WORST_CASE(?,O(n^1))

Solution:
---------

  "Cons" :: ["A"(5) x "A"(5)] -(5)-> "A"(5)
  "Cons" :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
  "Cons" :: ["A"(7) x "A"(7)] -(7)-> "A"(7)
  "Cons" :: ["A"(3) x "A"(3)] -(3)-> "A"(3)
  "False" :: [] -(0)-> "A"(0)
  "False" :: [] -(0)-> "A"(14)
  "False" :: [] -(0)-> "A"(8)
  "Nil" :: [] -(0)-> "A"(1)
  "Nil" :: [] -(0)-> "A"(7)
  "Nil" :: [] -(0)-> "A"(3)
  "Nil" :: [] -(0)-> "A"(5)
  "True" :: [] -(0)-> "A"(0)
  "True" :: [] -(0)-> "A"(14)
  "True" :: [] -(0)-> "A"(6)
  "and" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "even" :: ["A"(7)] -(1)-> "A"(0)
  "goal" :: ["A"(15) x "A"(15)] -(12)-> "A"(0)
  "lte" :: ["A"(5) x "A"(1)] -(1)-> "A"(0)
  "notEmpty" :: ["A"(3)] -(3)-> "A"(0)


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




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)