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

WORST_CASE(?,O(n^1))