WORST_CASE(?,O(n^1))

Solution:
---------

  "Cons" :: ["A"(0) x "A"(8)] -(8)-> "A"(8)
  "Cons" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "False" :: [] -(0)-> "A"(14)
  "Nil" :: [] -(0)-> "A"(8)
  "Nil" :: [] -(0)-> "A"(0)
  "Nil" :: [] -(0)-> "A"(14)
  "True" :: [] -(0)-> "A"(14)
  "goal" :: ["A"(14)] -(9)-> "A"(0)
  "isEmpty[Match]" :: ["A"(0)] -(0)-> "A"(14)
  "list" :: ["A"(8)] -(8)-> "A"(0)
  "notEmpty" :: ["A"(0)] -(3)-> "A"(0)


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

  "Cons" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "Nil" :: [] -(0)-> "A"_cf(0)
  "True" :: [] -(0)-> "A"_cf(0)
  "isEmpty[Match]" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "list" :: ["A"_cf(0)] -(0)-> "A"_cf(0)


Base Constructors:
------------------
  "\"Cons\"_A" :: ["A"(0) x "A"(1)] -(1)-> "A"(1)
  "\"False\"_A" :: [] -(0)-> "A"(1)
  "\"Nil\"_A" :: [] -(0)-> "A"(1)
  "\"True\"_A" :: [] -(0)-> "A"(1)
  "\"isEmpty[Match]\"_A" :: ["A"(0)] -(0)-> "A"(1)