WORST_CASE(?,O(n^2))
* Step 1: NaturalPI WORST_CASE(?,O(n^2))
    + Considered Problem:
        - Strict TRS:
            +(x,0()) -> x
            +(x,s(y)) -> s(+(x,y))
            f(0()) -> 1()
            f(s(x)) -> g(x,s(x))
            g(0(),y) -> y
            g(s(x),y) -> g(x,+(y,s(x)))
            g(s(x),y) -> g(x,s(+(y,x)))
        - Signature:
            {+/2,f/1,g/2} / {0/0,1/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {+,f,g} and constructors {0,1,s}
    + Applied Processor:
        NaturalPI {shape = Quadratic, restrict = NoRestrict, uargs = UArgs, urules = URules, selector = Nothing}
    + Details:
        We apply a polynomial interpretation of kind constructor-based(quadratic):
        The following argument positions are considered usable:
          uargs(g) = {2},
          uargs(s) = {1}
        
        Following symbols are considered usable:
          {+,f,g}
        TcT has computed the following interpretation:
          p(+) = 1 + x1 + 2*x2  
          p(0) = 1              
          p(1) = 1              
          p(f) = 6 + 6*x1^2     
          p(g) = 7 + 6*x1^2 + x2
          p(s) = 1 + x1         
        
        Following rules are strictly oriented:
         +(x,0()) = 3 + x                
                  > x                    
                  = x                    
        
        +(x,s(y)) = 3 + x + 2*y          
                  > 2 + x + 2*y          
                  = s(+(x,y))            
        
           f(0()) = 12                   
                  > 1                    
                  = 1()                  
        
          f(s(x)) = 12 + 12*x + 6*x^2    
                  > 8 + x + 6*x^2        
                  = g(x,s(x))            
        
         g(0(),y) = 13 + y               
                  > y                    
                  = y                    
        
        g(s(x),y) = 13 + 12*x + 6*x^2 + y
                  > 10 + 2*x + 6*x^2 + y 
                  = g(x,+(y,s(x)))       
        
        g(s(x),y) = 13 + 12*x + 6*x^2 + y
                  > 9 + 2*x + 6*x^2 + y  
                  = g(x,s(+(y,x)))       
        
        
        Following rules are (at-least) weakly oriented:
        

WORST_CASE(?,O(n^2))