WORST_CASE(?,O(n^2))
* Step 1: NaturalMI WORST_CASE(?,O(n^2))
    + Considered Problem:
        - Strict TRS:
            a__f(X1,X2) -> f(X1,X2)
            a__f(g(X),Y) -> a__f(mark(X),f(g(X),Y))
            mark(f(X1,X2)) -> a__f(mark(X1),X2)
            mark(g(X)) -> g(mark(X))
        - Signature:
            {a__f/2,mark/1} / {f/2,g/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {a__f,mark} and constructors {f,g}
    + Applied Processor:
        NaturalMI {miDimension = 2, miDegree = 2, 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(a__f) = {1},
          uargs(g) = {1}
        
        Following symbols are considered usable:
          {a__f,mark}
        TcT has computed the following interpretation:
          p(a__f) = [1 4] x1 + [1]
                    [0 1]      [5]
             p(f) = [1 4] x1 + [0]
                    [0 1]      [5]
             p(g) = [1 2] x1 + [0]
                    [0 1]      [1]
          p(mark) = [1 1] x1 + [0]
                    [0 1]      [0]
        
        Following rules are strictly oriented:
           a__f(X1,X2) = [1 4] X1 + [1]         
                         [0 1]      [5]         
                       > [1 4] X1 + [0]         
                         [0 1]      [5]         
                       = f(X1,X2)               
        
          a__f(g(X),Y) = [1 6] X + [5]          
                         [0 1]     [6]          
                       > [1 5] X + [1]          
                         [0 1]     [5]          
                       = a__f(mark(X),f(g(X),Y))
        
        mark(f(X1,X2)) = [1 5] X1 + [5]         
                         [0 1]      [5]         
                       > [1 5] X1 + [1]         
                         [0 1]      [5]         
                       = a__f(mark(X1),X2)      
        
            mark(g(X)) = [1 3] X + [1]          
                         [0 1]     [1]          
                       > [1 3] X + [0]          
                         [0 1]     [1]          
                       = g(mark(X))             
        
        
        Following rules are (at-least) weakly oriented:
        

WORST_CASE(?,O(n^2))