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