WORST_CASE(?,O(n^1))

Solution:
---------

  Cons :: [A(15) x A(15)] -(15)-> A(15)
  Cons :: [A(4) x A(4)] -(4)-> A(4)
  Cons :: [A(0) x A(0)] -(0)-> A(0)
  False :: [] -(0)-> A(6)
  Nil :: [] -(0)-> A(4)
  Nil :: [] -(0)-> A(15)
  Nil :: [] -(0)-> A(14)
  True :: [] -(0)-> A(12)
  add0 :: [A(0) x A(15)] -(1)-> A(0)
  goal :: [A(4) x A(15)] -(14)-> A(0)
  notEmpty :: [A(4)] -(15)-> A(1)


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

  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 Constructors:
------------------
  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)