WORST_CASE(?,O(n^1))
* Step 1: NaturalMI WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            f(f(x)) -> f(c(f(x)))
            f(f(x)) -> f(d(f(x)))
            g(c(x)) -> x
            g(c(1())) -> g(d(h(0())))
            g(c(h(0()))) -> g(d(1()))
            g(d(x)) -> x
            g(h(x)) -> g(x)
        - Signature:
            {f/1,g/1} / {0/0,1/0,c/1,d/1,h/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f,g} and constructors {0,1,c,d,h}
    + 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(0) = [0]           
                 [0]           
          p(1) = [2]           
                 [0]           
          p(c) = [1 1] x1 + [0]
                 [0 0]      [2]
          p(d) = [1 1] x1 + [0]
                 [0 0]      [1]
          p(f) = [0 5] x1 + [0]
                 [0 0]      [3]
          p(g) = [4 2] x1 + [0]
                 [4 1]      [1]
          p(h) = [1 1] x1 + [2]
                 [0 0]      [0]
        
        Following rules are strictly oriented:
             f(f(x)) = [15]         
                       [3]          
                     > [10]         
                       [3]          
                     = f(c(f(x)))   
        
             f(f(x)) = [15]         
                       [3]          
                     > [5]          
                       [3]          
                     = f(d(f(x)))   
        
             g(c(x)) = [4 4] x + [4]
                       [4 4]     [3]
                     > [1 0] x + [0]
                       [0 1]     [0]
                     = x            
        
           g(c(1())) = [12]         
                       [11]         
                     > [10]         
                       [10]         
                     = g(d(h(0()))) 
        
        g(c(h(0()))) = [12]         
                       [11]         
                     > [10]         
                       [10]         
                     = g(d(1()))    
        
             g(d(x)) = [4 4] x + [2]
                       [4 4]     [2]
                     > [1 0] x + [0]
                       [0 1]     [0]
                     = x            
        
             g(h(x)) = [4 4] x + [8]
                       [4 4]     [9]
                     > [4 2] x + [0]
                       [4 1]     [1]
                     = g(x)         
        
        
        Following rules are (at-least) weakly oriented:
        

WORST_CASE(?,O(n^1))