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