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

WORST_CASE(?,O(n^1))