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

WORST_CASE(?,O(n^3))