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

WORST_CASE(?,O(n^1))