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

WORST_CASE(?,O(n^1))