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