WORST_CASE(?,O(n^1))
* Step 1: NaturalMI 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:
        NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing}
    + Details:
        We apply a matrix interpretation of kind constructor based matrix interpretation:
        The following argument positions are considered usable:
          none
        
        Following symbols are considered usable:
          {f,g}
        TcT has computed the following interpretation:
          p(c) = [1] x2 + [1]  
          p(f) = [1] x1 + [13] 
          p(g) = [15] x1 + [15]
          p(s) = [1] x1 + [15] 
        
        Following rules are strictly oriented:
        f(c(X,s(Y))) = [1] Y + [29] 
                     > [1] Y + [14] 
                     = f(c(s(X),Y)) 
        
        g(c(s(X),Y)) = [15] Y + [30]
                     > [1] Y + [29] 
                     = f(c(X,s(Y))) 
        
        
        Following rules are (at-least) weakly oriented:
        

WORST_CASE(?,O(n^1))