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

WORST_CASE(?,O(n^1))