WORST_CASE(?,O(n^1))
* Step 1: NaturalMI WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            +(0(),y) -> y
            +(s(x),0()) -> s(x)
            +(s(x),s(y)) -> s(+(s(x),+(y,0())))
        - Signature:
            {+/2} / {0/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {+} 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(+) = {2},
          uargs(s) = {1}
        
        Following symbols are considered usable:
          {+}
        TcT has computed the following interpretation:
          p(+) = [1] x1 + [4] x2 + [0]
          p(0) = [0]                  
          p(s) = [1] x1 + [1]         
        
        Following rules are strictly oriented:
        +(s(x),s(y)) = [1] x + [4] y + [5]
                     > [1] x + [4] y + [2]
                     = s(+(s(x),+(y,0())))
        
        
        Following rules are (at-least) weakly oriented:
           +(0(),y) =  [4] y + [0]
                    >= [1] y + [0]
                    =  y          
        
        +(s(x),0()) =  [1] x + [1]
                    >= [1] x + [1]
                    =  s(x)       
        
* Step 2: NaturalMI WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            +(0(),y) -> y
            +(s(x),0()) -> s(x)
        - Weak TRS:
            +(s(x),s(y)) -> s(+(s(x),+(y,0())))
        - Signature:
            {+/2} / {0/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {+} 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(+) = {2},
          uargs(s) = {1}
        
        Following symbols are considered usable:
          {+}
        TcT has computed the following interpretation:
          p(+) = [1] x1 + [2] x2 + [1]
          p(0) = [0]                  
          p(s) = [1] x1 + [2]         
        
        Following rules are strictly oriented:
           +(0(),y) = [2] y + [1]
                    > [1] y + [0]
                    = y          
        
        +(s(x),0()) = [1] x + [3]
                    > [1] x + [2]
                    = s(x)       
        
        
        Following rules are (at-least) weakly oriented:
        +(s(x),s(y)) =  [1] x + [2] y + [7]
                     >= [1] x + [2] y + [7]
                     =  s(+(s(x),+(y,0())))
        
* Step 3: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            +(0(),y) -> y
            +(s(x),0()) -> s(x)
            +(s(x),s(y)) -> s(+(s(x),+(y,0())))
        - Signature:
            {+/2} / {0/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {+} and constructors {0,s}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))