WORST_CASE(?,O(n^1))
* Step 1: NaturalPI WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            f(x,a()) -> x
            f(x,g(y)) -> f(g(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) = 2              
          p(f) = 2 + 8*x1 + 9*x2
          p(g) = 1 + x1         
        
        Following rules are strictly oriented:
         f(x,a()) = 20 + 8*x      
                  > x             
                  = x             
        
        f(x,g(y)) = 11 + 8*x + 9*y
                  > 10 + 8*x + 9*y
                  = f(g(x),y)     
        
        
        Following rules are (at-least) weakly oriented:
        

WORST_CASE(?,O(n^1))