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))
            activate(n__g(X)) -> g(activate(X))
            f(X) -> n__f(X)
            f(f(a())) -> c(n__f(n__g(n__f(n__a()))))
            g(X) -> n__g(X)
        - Signature:
            {a/0,activate/1,f/1,g/1} / {c/1,n__a/0,n__f/1,n__g/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {a,activate,f,g} and constructors {c,n__a,n__f,n__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:
          uargs(f) = {1},
          uargs(g) = {1}
        
        Following symbols are considered usable:
          {a,activate,f,g}
        TcT has computed the following interpretation:
                 p(a) = [11]        
          p(activate) = [4] x1 + [2]
                 p(c) = [1]         
                 p(f) = [1] x1 + [5]
                 p(g) = [1] x1 + [4]
              p(n__a) = [3]         
              p(n__f) = [1] x1 + [4]
              p(n__g) = [1] x1 + [2]
        
        Following rules are strictly oriented:
                      a() = [11]                       
                          > [3]                        
                          = n__a()                     
        
              activate(X) = [4] X + [2]                
                          > [1] X + [0]                
                          = X                          
        
         activate(n__a()) = [14]                       
                          > [11]                       
                          = a()                        
        
        activate(n__f(X)) = [4] X + [18]               
                          > [4] X + [7]                
                          = f(activate(X))             
        
        activate(n__g(X)) = [4] X + [10]               
                          > [4] X + [6]                
                          = g(activate(X))             
        
                     f(X) = [1] X + [5]                
                          > [1] X + [4]                
                          = n__f(X)                    
        
                f(f(a())) = [21]                       
                          > [1]                        
                          = c(n__f(n__g(n__f(n__a()))))
        
                     g(X) = [1] X + [4]                
                          > [1] X + [2]                
                          = n__g(X)                    
        
        
        Following rules are (at-least) weakly oriented:
        

WORST_CASE(?,O(n^1))