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

WORST_CASE(?,O(n^1))