WORST_CASE(?,O(n^2))
* Step 1: Ara WORST_CASE(?,O(n^2))
    + Considered Problem:
        - Strict TRS:
            app(Cons(x,xs),ys) -> Cons(x,app(xs,ys))
            app(Nil(),ys) -> ys
            goal(xs) -> naiverev(xs)
            naiverev(Cons(x,xs)) -> app(naiverev(xs),Cons(x,Nil()))
            naiverev(Nil()) -> Nil()
            notEmpty(Cons(x,xs)) -> True()
            notEmpty(Nil()) -> False()
        - Signature:
            {app/2,goal/1,naiverev/1,notEmpty/1} / {Cons/2,False/0,Nil/0,True/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {app,goal,naiverev,notEmpty} and constructors {Cons,False
            ,Nil,True}
    + Applied Processor:
        Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = MiniSMT}
    + Details:
        Signatures used:
        ----------------
          Cons :: [A(0, 0) x A(1, 0)] -(1)-> A(1, 0)
          Cons :: [A(0, 2) x A(7, 2)] -(5)-> A(5, 2)
          Cons :: [A(0, 2) x A(2, 2)] -(0)-> A(0, 2)
          Cons :: [A(0, 0) x A(0, 0)] -(0)-> A(0, 0)
          Cons :: [A(0, 1) x A(1, 1)] -(0)-> A(0, 1)
          False :: [] -(0)-> A(0, 0)
          Nil :: [] -(0)-> A(1, 0)
          Nil :: [] -(0)-> A(5, 2)
          Nil :: [] -(0)-> A(0, 2)
          Nil :: [] -(0)-> A(4, 4)
          Nil :: [] -(0)-> A(2, 0)
          True :: [] -(0)-> A(0, 0)
          app :: [A(1, 0) x A(0, 0)] -(4)-> A(0, 0)
          goal :: [A(5, 3)] -(7)-> A(0, 0)
          naiverev :: [A(5, 2)] -(2)-> A(0, 0)
          notEmpty :: [A(0, 2)] -(2)-> A(0, 0)
        
        
        Cost-free Signatures used:
        --------------------------
          Cons :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
          Cons :: [A_cf(0, 0) x A_cf(2, 0)] -(2)-> A_cf(2, 0)
          Cons :: [A_cf(0, 0) x A_cf(1, 0)] -(1)-> A_cf(1, 0)
          Nil :: [] -(0)-> A_cf(0, 0)
          Nil :: [] -(0)-> A_cf(2, 0)
          Nil :: [] -(0)-> A_cf(1, 0)
          Nil :: [] -(0)-> A_cf(6, 0)
          Nil :: [] -(0)-> A_cf(5, 0)
          app :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
          app :: [A_cf(1, 0) x A_cf(1, 0)] -(0)-> A_cf(1, 0)
          naiverev :: [A_cf(2, 0)] -(0)-> A_cf(1, 0)
        
        
        Base Constructor Signatures used:
        ---------------------------------
          Cons_A :: [A(0, 0) x A(1, 0)] -(1)-> A(1, 0)
          Cons_A :: [A(0, 1) x A(1, 1)] -(0)-> A(0, 1)
          False_A :: [] -(0)-> A(1, 0)
          False_A :: [] -(0)-> A(0, 1)
          Nil_A :: [] -(0)-> A(1, 0)
          Nil_A :: [] -(0)-> A(0, 1)
          True_A :: [] -(0)-> A(1, 0)
          True_A :: [] -(1)-> A(0, 1)
        
* Step 2: Open MAYBE
    - Strict TRS:
        app(Cons(x,xs),ys) -> Cons(x,app(xs,ys))
        app(Nil(),ys) -> ys
        goal(xs) -> naiverev(xs)
        naiverev(Cons(x,xs)) -> app(naiverev(xs),Cons(x,Nil()))
        naiverev(Nil()) -> Nil()
        notEmpty(Cons(x,xs)) -> True()
        notEmpty(Nil()) -> False()
    - Signature:
        {app/2,goal/1,naiverev/1,notEmpty/1} / {Cons/2,False/0,Nil/0,True/0}
    - Obligation:
        innermost runtime complexity wrt. defined symbols {app,goal,naiverev,notEmpty} and constructors {Cons,False
        ,Nil,True}
Following problems could not be solved:
  - Strict TRS:
      app(Cons(x,xs),ys) -> Cons(x,app(xs,ys))
      app(Nil(),ys) -> ys
      goal(xs) -> naiverev(xs)
      naiverev(Cons(x,xs)) -> app(naiverev(xs),Cons(x,Nil()))
      naiverev(Nil()) -> Nil()
      notEmpty(Cons(x,xs)) -> True()
      notEmpty(Nil()) -> False()
  - Signature:
      {app/2,goal/1,naiverev/1,notEmpty/1} / {Cons/2,False/0,Nil/0,True/0}
  - Obligation:
      innermost runtime complexity wrt. defined symbols {app,goal,naiverev,notEmpty} and constructors {Cons,False
      ,Nil,True}
WORST_CASE(?,O(n^2))