WORST_CASE(?,O(n^1))
* Step 1: NaturalPI WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            +(0(),y) -> y
            +(s(x),y) -> +(x,s(y))
            +(s(x),y) -> s(+(x,y))
        - Signature:
            {+/2} / {0/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {+} and constructors {0,s}
    + Applied Processor:
        NaturalPI {shape = Linear, restrict = NoRestrict, uargs = UArgs, urules = URules, selector = Nothing}
    + 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:
          {+}
        TcT has computed the following interpretation:
          p(+) = 3 + 9*x1 + 8*x2
          p(0) = 1              
          p(s) = 2 + x1         
        
        Following rules are strictly oriented:
         +(0(),y) = 12 + 8*y      
                  > y             
                  = y             
        
        +(s(x),y) = 21 + 9*x + 8*y
                  > 19 + 9*x + 8*y
                  = +(x,s(y))     
        
        +(s(x),y) = 21 + 9*x + 8*y
                  > 5 + 9*x + 8*y 
                  = s(+(x,y))     
        
        
        Following rules are (at-least) weakly oriented:
        

WORST_CASE(?,O(n^1))