WORST_CASE(?,O(n^1))
* Step 1: NaturalMI WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            f(x) -> x
            f(c(s(x),y)) -> f(c(x,s(y)))
            f(f(x)) -> f(d(f(x)))
            g(c(x,s(y))) -> g(c(s(x),y))
        - Signature:
            {f/1,g/1} / {c/2,d/1,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f,g} and constructors {c,d,s}
    + Applied Processor:
        NaturalMI {miDimension = 2, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing}
    + Details:
        We apply a matrix interpretation of kind constructor based matrix interpretation (containing no more than 1 non-zero interpretation-entries in the diagonal of the component-wise maxima):
        The following argument positions are considered usable:
          none
        
        Following symbols are considered usable:
          {f,g}
        TcT has computed the following interpretation:
          p(c) = [0 0] x1 + [0 2] x2 + [1]
                 [0 1]      [0 0]      [1]
          p(d) = [0]                      
                 [0]                      
          p(f) = [1 4] x1 + [2]           
                 [0 1]      [0]           
          p(g) = [1 1] x1 + [2]           
                 [1 0]      [2]           
          p(s) = [0 0] x1 + [0]           
                 [0 1]      [2]           
        
        Following rules are strictly oriented:
                f(x) = [1 4] x + [2]           
                       [0 1]     [0]           
                     > [1 0] x + [0]           
                       [0 1]     [0]           
                     = x                       
        
        f(c(s(x),y)) = [0 4] x + [0 2] y + [15]
                       [0 1]     [0 0]     [3] 
                     > [0 4] x + [0 2] y + [11]
                       [0 1]     [0 0]     [1] 
                     = f(c(x,s(y)))            
        
             f(f(x)) = [1 8] x + [4]           
                       [0 1]     [0]           
                     > [2]                     
                       [0]                     
                     = f(d(f(x)))              
        
        g(c(x,s(y))) = [0 1] x + [0 2] y + [8] 
                       [0 0]     [0 2]     [7] 
                     > [0 1] x + [0 2] y + [6] 
                       [0 0]     [0 2]     [3] 
                     = g(c(s(x),y))            
        
        
        Following rules are (at-least) weakly oriented:
        

WORST_CASE(?,O(n^1))