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

WORST_CASE(?,O(n^1))