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

WORST_CASE(?,O(n^1))