WORST_CASE(?,O(n^2))

Solution:
---------

  "Cons" :: ["A"(0, 11) x "A"(11, 11)] -(11)-> "A"(0, 11)
  "Cons" :: ["A"(0, 0) x "A"(1, 0)] -(1)-> "A"(1, 0)
  "Cons" :: ["A"(0, 0) x "A"(2, 0)] -(2)-> "A"(2, 0)
  "Cons" :: ["A"(0, 0) x "A"(0, 0)] -(0)-> "A"(0, 0)
  "False" :: [] -(0)-> "A"(4, 12)
  "Nil" :: [] -(0)-> "A"(2, 0)
  "Nil" :: [] -(0)-> "A"(0, 11)
  "Nil" :: [] -(0)-> "A"(1, 0)
  "Nil" :: [] -(0)-> "A"(12, 10)
  "Nil" :: [] -(0)-> "A"(8, 8)
  "True" :: [] -(0)-> "A"(2, 13)
  "app" :: ["A"(1, 0) x "A"(0, 0)] -(1)-> "A"(0, 0)
  "goal" :: ["A"(14, 13)] -(8)-> "A"(0, 0)
  "naiverev" :: ["A"(0, 11)] -(1)-> "A"(0, 0)
  "notEmpty" :: ["A"(2, 0)] -(12)-> "A"(0, 2)


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

  "Cons" :: ["A"_cf(0, 0) x "A"_cf(11, 0)] -(11)-> "A"_cf(11, 0)
  "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(11, 0)
  "Nil" :: [] -(0)-> "A"_cf(1, 0)
  "Nil" :: [] -(0)-> "A"_cf(8, 8)
  "Nil" :: [] -(0)-> "A"_cf(2, 8)
  "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(11, 0)] -(9)-> "A"_cf(1, 0)


Base Constructors:
------------------
  "\"Cons\"_A" :: ["A"(0, 0) x "A"(1, 0)] -(1)-> "A"(1, 0)
  "\"Cons\"_A" :: ["A"(0, 1) 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)