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

WORST_CASE(?,O(n^1))