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 {minDegree = 1, maxDegree = 2, araTimeout = 3, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          F (TrsFun "Cons") :: ["A"(7) x "A"(7)] -(7)-> "A"(7)
          F (TrsFun "Cons") :: ["A"(12) x "A"(12)] -(12)-> "A"(12)
          F (TrsFun "Cons") :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
          F (TrsFun "False") :: [] -(0)-> "A"(14)
          F (TrsFun "Nil") :: [] -(0)-> "A"(7)
          F (TrsFun "Nil") :: [] -(0)-> "A"(12)
          F (TrsFun "Nil") :: [] -(0)-> "A"(14)
          F (TrsFun "True") :: [] -(0)-> "A"(14)
          F (TrsFun "add0") :: ["A"(0) x "A"(7)] -(15)-> "A"(0)
          F (TrsFun "goal") :: ["A"(14) x "A"(15)] -(16)-> "A"(0)
          F (TrsFun "notEmpty") :: ["A"(12)] -(8)-> "A"(0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "F (TrsFun \"Cons\")_A" :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
          "F (TrsFun \"False\")_A" :: [] -(0)-> "A"(1)
          "F (TrsFun \"Nil\")_A" :: [] -(0)-> "A"(1)
          "F (TrsFun \"True\")_A" :: [] -(0)-> "A"(1)
        

WORST_CASE(?,O(n^1))