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

WORST_CASE(?,O(n^1))