WORST_CASE(?,O(n^1))
* Step 1: NaturalMI WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            id(0()) -> 0()
            id(s(x)) -> s(id(x))
        - Signature:
            {id/1} / {0/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {id} 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(s) = {1}
        
        Following symbols are considered usable:
          {id}
        TcT has computed the following interpretation:
           p(0) = [1]         
          p(id) = [9]         
           p(s) = [1] x1 + [0]
        
        Following rules are strictly oriented:
        id(0()) = [9]
                > [1]
                = 0()
        
        
        Following rules are (at-least) weakly oriented:
        id(s(x)) =  [9]     
                 >= [9]     
                 =  s(id(x))
        
* Step 2: NaturalPI WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            id(s(x)) -> s(id(x))
        - Weak TRS:
            id(0()) -> 0()
        - Signature:
            {id/1} / {0/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {id} and constructors {0,s}
    + Applied Processor:
        NaturalPI {shape = Linear, restrict = Restrict, uargs = UArgs, urules = URules, selector = Just any strict-rules}
    + Details:
        We apply a polynomial interpretation of kind constructor-based(linear):
        The following argument positions are considered usable:
          uargs(s) = {1}
        
        Following symbols are considered usable:
          {id}
        TcT has computed the following interpretation:
           p(0) = 0       
          p(id) = 2 + 8*x1
           p(s) = 2 + x1  
        
        Following rules are strictly oriented:
        id(s(x)) = 18 + 8*x
                 > 4 + 8*x 
                 = s(id(x))
        
        
        Following rules are (at-least) weakly oriented:
        id(0()) =  2  
                >= 0  
                =  0()
        
* Step 3: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            id(0()) -> 0()
            id(s(x)) -> s(id(x))
        - Signature:
            {id/1} / {0/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {id} and constructors {0,s}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))