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

WORST_CASE(?,O(n^1))