WORST_CASE(Omega(n^1),O(n^1))
* Step 1: Sum WORST_CASE(Omega(n^1),O(n^1))
    + Considered Problem:
        - Strict TRS:
            f(s(0()),g(x)) -> f(x,g(x))
            g(s(x)) -> g(x)
        - Signature:
            {f/2,g/1} / {0/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f,g} and constructors {0,s}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            f(s(0()),g(x)) -> f(x,g(x))
            g(s(x)) -> g(x)
        - Signature:
            {f/2,g/1} / {0/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f,g} and constructors {0,s}
    + Applied Processor:
        DecreasingLoops {bound = AnyLoop, narrow = 10}
    + Details:
        The system has following decreasing Loops:
          g(x){x -> s(x)} =
            g(s(x)) ->^+ g(x)
              = C[g(x) = g(x){}]

** Step 1.b:1: DependencyPairs WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            f(s(0()),g(x)) -> f(x,g(x))
            g(s(x)) -> g(x)
        - Signature:
            {f/2,g/1} / {0/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f,g} and constructors {0,s}
    + Applied Processor:
        DependencyPairs {dpKind_ = DT}
    + Details:
        We add the following dependency tuples:
        
        Strict DPs
          f#(s(0()),g(x)) -> c_1(f#(x,g(x)),g#(x))
          g#(s(x)) -> c_2(g#(x))
        Weak DPs
          
        
        and mark the set of starting terms.
** Step 1.b:2: RemoveInapplicable WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict DPs:
            f#(s(0()),g(x)) -> c_1(f#(x,g(x)),g#(x))
            g#(s(x)) -> c_2(g#(x))
        - Weak TRS:
            f(s(0()),g(x)) -> f(x,g(x))
            g(s(x)) -> g(x)
        - Signature:
            {f/2,g/1,f#/2,g#/1} / {0/0,s/1,c_1/2,c_2/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f#,g#} and constructors {0,s}
    + Applied Processor:
        RemoveInapplicable
    + Details:
        Only the nodes
          {2}
        are reachable from nodes
          {2}
        that start derivation from marked basic terms.
        The nodes not reachable are removed from the problem.
** Step 1.b:3: UsableRules WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict DPs:
            g#(s(x)) -> c_2(g#(x))
        - Weak TRS:
            f(s(0()),g(x)) -> f(x,g(x))
            g(s(x)) -> g(x)
        - Signature:
            {f/2,g/1,f#/2,g#/1} / {0/0,s/1,c_1/2,c_2/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f#,g#} and constructors {0,s}
    + Applied Processor:
        UsableRules
    + Details:
        We replace rewrite rules by usable rules:
          g#(s(x)) -> c_2(g#(x))
** Step 1.b:4: NaturalMI WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict DPs:
            g#(s(x)) -> c_2(g#(x))
        - Signature:
            {f/2,g/1,f#/2,g#/1} / {0/0,s/1,c_1/2,c_2/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f#,g#} and constructors {0,s}
    + Applied Processor:
        NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Just any strict-rules}
    + Details:
        We apply a matrix interpretation of kind constructor based matrix interpretation:
        The following argument positions are considered usable:
          uargs(c_2) = {1}
        
        Following symbols are considered usable:
          {f#,g#}
        TcT has computed the following interpretation:
            p(0) = [0]                  
            p(f) = [2] x1 + [0]         
            p(g) = [1] x1 + [1]         
            p(s) = [1] x1 + [8]         
           p(f#) = [2] x1 + [2] x2 + [1]
           p(g#) = [2] x1 + [8]         
          p(c_1) = [1]                  
          p(c_2) = [1] x1 + [14]        
        
        Following rules are strictly oriented:
        g#(s(x)) = [2] x + [24]
                 > [2] x + [22]
                 = c_2(g#(x))  
        
        
        Following rules are (at-least) weakly oriented:
        
** Step 1.b:5: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak DPs:
            g#(s(x)) -> c_2(g#(x))
        - Signature:
            {f/2,g/1,f#/2,g#/1} / {0/0,s/1,c_1/2,c_2/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f#,g#} and constructors {0,s}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(Omega(n^1),O(n^1))