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

WORST_CASE(?,O(n^1))