WORST_CASE(?,O(n^1))

Solution:
---------

  0 :: [] -(0)-> A(13)
  Cons :: [A(13) x A(13)] -(0)-> A(13)
  Cons :: [A(3) x A(3)] -(0)-> A(3)
  Cons :: [A(0) x A(0)] -(0)-> A(0)
  False :: [] -(0)-> A(14)
  Nil :: [] -(0)-> A(13)
  Nil :: [] -(0)-> A(3)
  Nil :: [] -(0)-> A(7)
  S :: [A(13)] -(13)-> A(13)
  S :: [A(0)] -(0)-> A(0)
  True :: [] -(0)-> A(14)
  addlist :: [A(13) x A(13)] -(12)-> A(0)
  goal :: [A(15) x A(15)] -(15)-> A(0)
  notEmpty :: [A(3)] -(8)-> A(0)


Cost Free Signatures:
---------------------

  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 Constructors:
------------------
  0_A :: [] -(0)-> A(1)
  Cons_A :: [A(1) x A(1)] -(0)-> A(1)
  False_A :: [] -(0)-> A(1)
  Nil_A :: [] -(0)-> A(1)
  S_A :: [A(1)] -(1)-> A(1)
  True_A :: [] -(0)-> A(1)