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 {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = Z3}
    + Details:
        Signatures used:
        ----------------
          cons :: [A(0) x A(8)] -(8)-> A(8)
          cons :: [A(0) x A(0)] -(0)-> A(0)
          empty :: [] -(0)-> A(8)
          empty :: [] -(0)-> A(12)
          r1 :: [A(8) x A(0)] -(6)-> A(0)
          rev :: [A(14)] -(12)-> A(0)
        
        
        Cost-free Signatures used:
        --------------------------
          cons :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
          empty :: [] -(0)-> A_cf(0)
          r1 :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
        
        
        Base Constructor Signatures used:
        ---------------------------------
          cons_A :: [A(0) x A(1)] -(1)-> A(1)
          empty_A :: [] -(0)-> A(1)
        
* Step 2: Open MAYBE
    - 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}
Following problems could not be solved:
  - 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}
WORST_CASE(?,O(n^1))