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(0()) -> cons(0(),n__f(s(0())))
            f(s(0())) -> f(p(s(0())))
            p(s(0())) -> 0()
        - Signature:
            {activate/1,f/1,p/1} / {0/0,cons/2,n__f/1,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {activate,f,p} and constructors {0,cons,n__f,s}
    + 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:
          uargs(f) = {1}
        
        Following symbols are considered usable:
          {activate,f,p}
        TcT has computed the following interpretation:
                 p(0) = 1      
          p(activate) = 8 + x1 
              p(cons) = 0      
                 p(f) = 3 + x1 
              p(n__f) = x1     
                 p(p) = 3      
                 p(s) = 15 + x1
        
        Following rules are strictly oriented:
              activate(X) = 8 + X                 
                          > X                     
                          = X                     
        
        activate(n__f(X)) = 8 + X                 
                          > 3 + X                 
                          = f(X)                  
        
                     f(X) = 3 + X                 
                          > X                     
                          = n__f(X)               
        
                   f(0()) = 4                     
                          > 0                     
                          = cons(0(),n__f(s(0())))
        
                f(s(0())) = 19                    
                          > 6                     
                          = f(p(s(0())))          
        
                p(s(0())) = 3                     
                          > 1                     
                          = 0()                   
        
        
        Following rules are (at-least) weakly oriented:
        

WORST_CASE(?,O(n^1))