WORST_CASE(?,O(n^2))
* Step 1: Ara WORST_CASE(?,O(n^2))
    + Considered Problem:
        - Strict TRS:
            add0(Cons(x,xs),y) -> add0(xs,Cons(S(),y))
            add0(Nil(),y) -> y
            goal(xs,ys) -> mul0(xs,ys)
            mul0(Cons(x,xs),y) -> add0(mul0(xs,y),y)
            mul0(Nil(),y) -> Nil()
        - Signature:
            {add0/2,goal/2,mul0/2} / {Cons/2,Nil/0,S/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {add0,goal,mul0} and constructors {Cons,Nil,S}
    + Applied Processor:
        Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = Z3}
    + Details:
        Signatures used:
        ----------------
          Cons :: [A(0, 0) x A(9, 0)] -(9)-> A(9, 0)
          Cons :: [A(0, 2) x A(15, 2)] -(13)-> A(13, 2)
          Cons :: [A(0, 0) x A(8, 0)] -(8)-> A(8, 0)
          Nil :: [] -(0)-> A(9, 0)
          Nil :: [] -(0)-> A(13, 2)
          Nil :: [] -(0)-> A(15, 6)
          S :: [] -(0)-> A(7, 13)
          add0 :: [A(9, 0) x A(8, 0)] -(7)-> A(8, 0)
          goal :: [A(15, 12) x A(14, 14)] -(14)-> A(2, 0)
          mul0 :: [A(13, 2) x A(0, 0)] -(7)-> A(8, 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)
          Nil :: [] -(0)-> A_cf(0, 0)
          Nil :: [] -(0)-> A_cf(2, 0)
          Nil :: [] -(0)-> A_cf(2, 10)
          S :: [] -(0)-> A_cf(0, 0)
          S :: [] -(0)-> A_cf(15, 11)
          add0 :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
          add0 :: [A_cf(2, 0) x A_cf(2, 0)] -(2)-> A_cf(2, 0)
          mul0 :: [A_cf(2, 0) x A_cf(0, 0)] -(0)-> A_cf(2, 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)
          Nil_A :: [] -(0)-> A(1, 0)
          Nil_A :: [] -(0)-> A(0, 1)
          S_A :: [] -(0)-> A(1, 0)
          S_A :: [] -(0)-> A(0, 1)
        
* Step 2: Open MAYBE
    - Strict TRS:
        add0(Cons(x,xs),y) -> add0(xs,Cons(S(),y))
        add0(Nil(),y) -> y
        goal(xs,ys) -> mul0(xs,ys)
        mul0(Cons(x,xs),y) -> add0(mul0(xs,y),y)
        mul0(Nil(),y) -> Nil()
    - Signature:
        {add0/2,goal/2,mul0/2} / {Cons/2,Nil/0,S/0}
    - Obligation:
        innermost runtime complexity wrt. defined symbols {add0,goal,mul0} and constructors {Cons,Nil,S}
Following problems could not be solved:
  - Strict TRS:
      add0(Cons(x,xs),y) -> add0(xs,Cons(S(),y))
      add0(Nil(),y) -> y
      goal(xs,ys) -> mul0(xs,ys)
      mul0(Cons(x,xs),y) -> add0(mul0(xs,y),y)
      mul0(Nil(),y) -> Nil()
  - Signature:
      {add0/2,goal/2,mul0/2} / {Cons/2,Nil/0,S/0}
  - Obligation:
      innermost runtime complexity wrt. defined symbols {add0,goal,mul0} and constructors {Cons,Nil,S}
WORST_CASE(?,O(n^2))