WORST_CASE(?,O(n^1))
* Step 1: NaturalPI WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            sqr(x) -> *(x,x)
            sum(0()) -> 0()
            sum(s(x)) -> +(*(s(x),s(x)),sum(x))
            sum(s(x)) -> +(sqr(s(x)),sum(x))
        - Signature:
            {sqr/1,sum/1} / {*/2,+/2,0/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {sqr,sum} 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(+) = {1,2}
        
        Following symbols are considered usable:
          {sqr,sum}
        TcT has computed the following interpretation:
            p(*) = 0          
            p(+) = 2 + x1 + x2
            p(0) = 2          
            p(s) = 14 + x1    
          p(sqr) = 8          
          p(sum) = 8 + x1     
        
        Following rules are strictly oriented:
           sqr(x) = 8                     
                  > 0                     
                  = *(x,x)                
        
         sum(0()) = 10                    
                  > 2                     
                  = 0()                   
        
        sum(s(x)) = 22 + x                
                  > 10 + x                
                  = +(*(s(x),s(x)),sum(x))
        
        sum(s(x)) = 22 + x                
                  > 18 + x                
                  = +(sqr(s(x)),sum(x))   
        
        
        Following rules are (at-least) weakly oriented:
        

WORST_CASE(?,O(n^1))