WORST_CASE(?,O(n^3))
* Step 1: MI WORST_CASE(?,O(n^3))
    + Considered Problem:
        - Strict TRS:
            h(f(x,y)) -> f(f(a(),h(h(y))),x)
        - Signature:
            {h/1} / {a/0,f/2}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {h} and constructors {a,f}
    + Applied Processor:
        MI {miKind = Automaton Nothing, miDimension = 3, miUArgs = NoUArgs, miURules = NoURules, miSelector = Nothing}
    + Details:
        We apply a matrix interpretation of kind Automaton Nothing:
        
        
        Following symbols are considered usable:
          all
        TcT has computed the following interpretation:
          p(a) = [4]                            
                 [0]                            
                 [0]                            
          p(f) = [1 0 1]       [1 0 0]       [0]
                 [0 0 0] x_1 + [0 1 1] x_2 + [2]
                 [0 1 1]       [0 0 0]       [2]
          p(h) = [1 4 0]       [1]              
                 [0 0 1] x_1 + [0]              
                 [0 4 0]       [0]              
        
        Following rules are strictly oriented:
        h(f(x,y)) = [1 0 1]     [1 4 4]     [9]
                    [0 1 1] x + [0 0 0] y + [2]
                    [0 0 0]     [0 4 4]     [8]
                  > [1 0 0]     [1 4 4]     [8]
                    [0 1 1] x + [0 0 0] y + [2]
                    [0 0 0]     [0 4 4]     [6]
                  = f(f(a(),h(h(y))),x)        
        
        
        Following rules are (at-least) weakly oriented:
        

WORST_CASE(?,O(n^3))