WORST_CASE(?,O(n^1))
* Step 1: NaturalPI WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            activate(X) -> X
            activate(n__d(X)) -> d(X)
            activate(n__f(X)) -> f(activate(X))
            activate(n__g(X)) -> g(X)
            c(X) -> d(activate(X))
            d(X) -> n__d(X)
            f(X) -> n__f(X)
            f(f(X)) -> c(n__f(n__g(n__f(X))))
            g(X) -> n__g(X)
            h(X) -> c(n__d(X))
        - Signature:
            {activate/1,c/1,d/1,f/1,g/1,h/1} / {n__d/1,n__f/1,n__g/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {activate,c,d,f,g,h} and constructors {n__d,n__f,n__g}
    + Applied Processor:
        NaturalPI {shape = Linear, restrict = NoRestrict, uargs = UArgs, urules = URules, selector = Nothing}
    + Details:
        We apply a polynomial interpretation of kind constructor-based(linear):
        The following argument positions are considered usable:
          uargs(d) = {1},
          uargs(f) = {1}
        
        Following symbols are considered usable:
          {activate,c,d,f,g,h}
        TcT has computed the following interpretation:
          p(activate) = 4 + 6*x1  
                 p(c) = 6 + 6*x1  
                 p(d) = 1 + x1    
                 p(f) = 10 + x1   
                 p(g) = 1         
                 p(h) = 13 + 12*x1
              p(n__d) = x1        
              p(n__f) = 2 + x1    
              p(n__g) = 0         
        
        Following rules are strictly oriented:
              activate(X) = 4 + 6*X               
                          > X                     
                          = X                     
        
        activate(n__d(X)) = 4 + 6*X               
                          > 1 + X                 
                          = d(X)                  
        
        activate(n__f(X)) = 16 + 6*X              
                          > 14 + 6*X              
                          = f(activate(X))        
        
        activate(n__g(X)) = 4                     
                          > 1                     
                          = g(X)                  
        
                     c(X) = 6 + 6*X               
                          > 5 + 6*X               
                          = d(activate(X))        
        
                     d(X) = 1 + X                 
                          > X                     
                          = n__d(X)               
        
                     f(X) = 10 + X                
                          > 2 + X                 
                          = n__f(X)               
        
                  f(f(X)) = 20 + X                
                          > 18                    
                          = c(n__f(n__g(n__f(X))))
        
                     g(X) = 1                     
                          > 0                     
                          = n__g(X)               
        
                     h(X) = 13 + 12*X             
                          > 6 + 6*X               
                          = c(n__d(X))            
        
        
        Following rules are (at-least) weakly oriented:
        

WORST_CASE(?,O(n^1))