WORST_CASE(?,O(n^1))
* Step 1: NaturalPI WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            activate(X) -> X
            activate(n__from(X)) -> from(X)
            after(0(),XS) -> XS
            after(s(N),cons(X,XS)) -> after(N,activate(XS))
            from(X) -> cons(X,n__from(s(X)))
            from(X) -> n__from(X)
        - Signature:
            {activate/1,after/2,from/1} / {0/0,cons/2,n__from/1,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {activate,after,from} and constructors {0,cons,n__from,s}
    + 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(after) = {2}
        
        Following symbols are considered usable:
          {activate,after,from}
        TcT has computed the following interpretation:
                 p(0) = 2          
          p(activate) = 15 + x1    
             p(after) = 5*x1 + 2*x2
              p(cons) = 3 + x2     
              p(from) = 8          
           p(n__from) = 1          
                 p(s) = 5 + x1     
        
        Following rules are strictly oriented:
                   activate(X) = 15 + X               
                               > X                    
                               = X                    
        
          activate(n__from(X)) = 16                   
                               > 8                    
                               = from(X)              
        
                 after(0(),XS) = 10 + 2*XS            
                               > XS                   
                               = XS                   
        
        after(s(N),cons(X,XS)) = 31 + 5*N + 2*XS      
                               > 30 + 5*N + 2*XS      
                               = after(N,activate(XS))
        
                       from(X) = 8                    
                               > 4                    
                               = cons(X,n__from(s(X)))
        
                       from(X) = 8                    
                               > 1                    
                               = n__from(X)           
        
        
        Following rules are (at-least) weakly oriented:
        

WORST_CASE(?,O(n^1))