WORST_CASE(?,O(n^1))
* Step 1: Ara 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:
        Ara {minDegree = 1, maxDegree = 2, araTimeout = 5, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          F (TrsFun "cons") :: ["A"(0) x "A"(1)] -(1)-> "A"(1)
          F (TrsFun "cons") :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
          F (TrsFun "empty") :: [] -(0)-> "A"(1)
          F (TrsFun "empty") :: [] -(0)-> "A"(14)
          F (TrsFun "r1") :: ["A"(1) x "A"(0)] -(15)-> "A"(0)
          F (TrsFun "rev") :: ["A"(15)] -(16)-> "A"(0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "F (TrsFun \"cons\")_A" :: ["A"(0) x "A"(1)] -(1)-> "A"(1)
          "F (TrsFun \"empty\")_A" :: [] -(0)-> "A"(1)
        

WORST_CASE(?,O(n^1))