WORST_CASE(?,O(n^1))
* Step 1: NaturalPI WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            r1(cons(x,k),a) -> r1(k,cons(x,a))
            r1(empty(),a) -> a
            rev(ls) -> r1(ls,empty())
        - Signature:
            {r1/2,rev/1} / {cons/2,empty/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {r1,rev} and constructors {cons,empty}
    + 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:
          none
        
        Following symbols are considered usable:
          {r1,rev}
        TcT has computed the following interpretation:
           p(cons) = 4 + x2       
          p(empty) = 3            
             p(r1) = 4 + 5*x1 + x2
            p(rev) = 9 + 11*x1    
        
        Following rules are strictly oriented:
        r1(cons(x,k),a) = 24 + a + 5*k   
                        > 8 + a + 5*k    
                        = r1(k,cons(x,a))
        
          r1(empty(),a) = 19 + a         
                        > a              
                        = a              
        
                rev(ls) = 9 + 11*ls      
                        > 7 + 5*ls       
                        = r1(ls,empty()) 
        
        
        Following rules are (at-least) weakly oriented:
        

WORST_CASE(?,O(n^1))