WORST_CASE(?,O(n^1))
* Step 1: NaturalPI 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:
        NaturalPI {shape = StronglyLinear, restrict = NoRestrict, uargs = UArgs, urules = URules, selector = Nothing}
    + Details:
        We apply a polynomial interpretation of kind constructor-based(stronglyLinear):
        The following argument positions are considered usable:
          none
        
        Following symbols are considered usable:
          {activate,f}
        TcT has computed the following interpretation:
                 p(a) = 7      
          p(activate) = 14 + x1
                 p(f) = 12 + x1
                 p(g) = 7      
              p(n__f) = 1 + x1 
        
        Following rules are strictly oriented:
              activate(X) = 14 + X         
                          > X              
                          = X              
        
        activate(n__f(X)) = 15 + X         
                          > 12 + X         
                          = f(X)           
        
                     f(X) = 12 + X         
                          > 1 + X          
                          = n__f(X)        
        
                f(f(a())) = 31             
                          > 19             
                          = f(g(n__f(a())))
        
        
        Following rules are (at-least) weakly oriented:
        

WORST_CASE(?,O(n^1))