WORST_CASE(?,O(n^1))
* Step 1: NaturalMI WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            goal(xs,ys) -> revapp(xs,ys)
            revapp(Cons(x,xs),rest) -> revapp(xs,Cons(x,rest))
            revapp(Nil(),rest) -> rest
        - Signature:
            {goal/2,revapp/2} / {Cons/2,Nil/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {goal,revapp} and constructors {Cons,Nil}
    + Applied Processor:
        NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing}
    + Details:
        We apply a matrix interpretation of kind constructor based matrix interpretation:
        The following argument positions are considered usable:
          none
        
        Following symbols are considered usable:
          {goal,revapp}
        TcT has computed the following interpretation:
            p(Cons) = [1] x2 + [1]          
             p(Nil) = [1]                   
            p(goal) = [9] x1 + [12] x2 + [9]
          p(revapp) = [9] x1 + [8] x2 + [8] 
        
        Following rules are strictly oriented:
                    goal(xs,ys) = [9] xs + [12] ys + [9]  
                                > [9] xs + [8] ys + [8]   
                                = revapp(xs,ys)           
        
        revapp(Cons(x,xs),rest) = [8] rest + [9] xs + [17]
                                > [8] rest + [9] xs + [16]
                                = revapp(xs,Cons(x,rest)) 
        
             revapp(Nil(),rest) = [8] rest + [17]         
                                > [1] rest + [0]          
                                = rest                    
        
        
        Following rules are (at-least) weakly oriented:
        

WORST_CASE(?,O(n^1))