BEST_CASE(Omega(n^2),?)

Solution:
---------

  "Cons" :: ["A"(0, 0) x "A"(1, 1)] -(1)-> "A"(0, 1)
  "Cons" :: ["A"(0, 0) x "A"(1, 0)] -(1)-> "A"(1, 0)
  "Cons" :: ["A"(0, 0) x "A"(0, 0)] -(0)-> "A"(0, 0)
  "False" :: [] -(0)-> "A"(1, 0)
  "Nil" :: [] -(0)-> "A"(0, 0)
  "Nil" :: [] -(0)-> "A"(0, 1)
  "Nil" :: [] -(0)-> "A"(1, 0)
  "True" :: [] -(0)-> "A"(1, 5)
  "app" :: ["A"(1, 0) x "A"(0, 0)] -(1)-> "A"(0, 0)
  "goal" :: ["A"(0, 1)] -(2)-> "A"(0, 0)
  "naiverev" :: ["A"(0, 1)] -(1)-> "A"(0, 0)
  "notEmpty" :: ["A"(0, 0)] -(1)-> "A"(15, 12)


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

  "Cons" :: ["A"_cf(0, 0) x "A"_cf(1, 0)] -(1)-> "A"_cf(1, 0)
  "Cons" :: ["A"_cf(0, 0) x "A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "Nil" :: [] -(0)-> "A"_cf(1, 0)
  "Nil" :: [] -(0)-> "A"_cf(0, 0)
  "app" :: ["A"_cf(1, 0) x "A"_cf(1, 0)] -(0)-> "A"_cf(1, 0)
  "app" :: ["A"_cf(0, 0) x "A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "naiverev" :: ["A"_cf(1, 0)] -(0)-> "A"_cf(1, 0)


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