WORST_CASE(?,O(n^1))
* Step 1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            deeprev(C(x1,x2)) -> deeprevapp(C(x1,x2),N())
            deeprev(N()) -> N()
            deeprev(V(n)) -> V(n)
            deeprevapp(C(x1,x2),rest) -> deeprevapp(x2,C(x1,rest))
            deeprevapp(N(),rest) -> rest
            deeprevapp(V(n),rest) -> revconsapp(rest,V(n))
            first(C(x1,x2)) -> x1
            first(V(n)) -> N()
            goal(x) -> deeprev(x)
            isEmptyT(C(x1,x2)) -> False()
            isEmptyT(N()) -> True()
            isEmptyT(V(n)) -> False()
            isNotEmptyT(C(x1,x2)) -> True()
            isNotEmptyT(N()) -> False()
            isNotEmptyT(V(n)) -> False()
            isVal(C(x1,x2)) -> False()
            isVal(N()) -> False()
            isVal(V(n)) -> True()
            revconsapp(C(x1,x2),r) -> revconsapp(x2,C(x1,r))
            revconsapp(N(),r) -> r
            revconsapp(V(n),r) -> r
            second(C(x1,x2)) -> x2
            second(V(n)) -> N()
        - Signature:
            {deeprev/1,deeprevapp/2,first/1,goal/1,isEmptyT/1,isNotEmptyT/1,isVal/1,revconsapp/2,second/1} / {C/2
            ,False/0,N/0,True/0,V/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {deeprev,deeprevapp,first,goal,isEmptyT,isNotEmptyT,isVal
            ,revconsapp,second} and constructors {C,False,N,True,V}
    + Applied Processor:
        Ara {araHeuristics = NoHeuristics, minDegree = 1, maxDegree = 2, araTimeout = 5, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          C :: ["A"(14) x "A"(14)] -(14)-> "A"(14)
          C :: ["A"(10) x "A"(10)] -(10)-> "A"(10)
          C :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
          C :: ["A"(8) x "A"(8)] -(8)-> "A"(8)
          False :: [] -(0)-> "A"(14)
          N :: [] -(0)-> "A"(14)
          N :: [] -(0)-> "A"(10)
          N :: [] -(0)-> "A"(1)
          N :: [] -(0)-> "A"(8)
          N :: [] -(0)-> "A"(15)
          N :: [] -(0)-> "A"(7)
          True :: [] -(0)-> "A"(14)
          V :: ["A"(14)] -(14)-> "A"(14)
          V :: ["A"(10)] -(10)-> "A"(10)
          V :: ["A"(1)] -(1)-> "A"(1)
          V :: ["A"(8)] -(8)-> "A"(8)
          V :: ["A"(2)] -(2)-> "A"(2)
          deeprev :: ["A"(14)] -(14)-> "A"(1)
          deeprevapp :: ["A"(10) x "A"(8)] -(14)-> "A"(1)
          first :: ["A"(1)] -(11)-> "A"(0)
          goal :: ["A"(14)] -(16)-> "A"(0)
          isEmptyT :: ["A"(1)] -(11)-> "A"(0)
          isNotEmptyT :: ["A"(1)] -(11)-> "A"(0)
          isVal :: ["A"(1)] -(11)-> "A"(0)
          revconsapp :: ["A"(8) x "A"(1)] -(6)-> "A"(1)
          second :: ["A"(14)] -(8)-> "A"(1)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "C_A" :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
          "False_A" :: [] -(0)-> "A"(1)
          "N_A" :: [] -(0)-> "A"(1)
          "True_A" :: [] -(0)-> "A"(1)
          "V_A" :: ["A"(1)] -(1)-> "A"(1)
        

WORST_CASE(?,O(n^1))