WORST_CASE(?,O(n^2))

Solution:
---------

  "Cons" :: ["A"(14, 0) x "A"(14, 11)] -(3)-> "A"(3, 11)
  "Cons" :: ["A"(1, 0) x "A"(1, 0)] -(1)-> "A"(1, 0)
  "Cons" :: ["A"(4, 0) x "A"(4, 0)] -(4)-> "A"(4, 0)
  "Cons" :: ["A"(0, 0) x "A"(0, 0)] -(0)-> "A"(0, 0)
  "Nil" :: [] -(0)-> "A"(3, 11)
  "Nil" :: [] -(0)-> "A"(4, 0)
  "Nil" :: [] -(0)-> "A"(1, 0)
  "Nil" :: [] -(0)-> "A"(8, 8)
  "Nil" :: [] -(0)-> "A"(15, 14)
  "Nil" :: [] -(0)-> "A"(14, 14)
  "append#2" :: ["A"(4, 0) x "A"(1, 0)] -(0)-> "A"(0, 0)
  "main" :: ["A"(13, 13)] -(16)-> "A"(0, 0)
  "rev#1" :: ["A"(3, 11)] -(13)-> "A"(0, 0)


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

  "Cons" :: ["A"_cf(11, 0) x "A"_cf(11, 0)] -(11)-> "A"_cf(11, 0)
  "Cons" :: ["A"_cf(8, 0) x "A"_cf(8, 5)] -(3)-> "A"_cf(3, 5)
  "Cons" :: ["A"_cf(4, 0) x "A"_cf(4, 0)] -(4)-> "A"_cf(4, 0)
  "Cons" :: ["A"_cf(8, 0) x "A"_cf(8, 4)] -(4)-> "A"_cf(4, 4)
  "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(4, 12)
  "Nil" :: [] -(0)-> "A"_cf(4, 0)
  "Nil" :: [] -(0)-> "A"_cf(8, 5)
  "Nil" :: [] -(0)-> "A"_cf(12, 14)
  "Nil" :: [] -(0)-> "A"_cf(12, 15)
  "Nil" :: [] -(0)-> "A"_cf(14, 12)
  "Nil" :: [] -(0)-> "A"_cf(0, 0)
  "append#2" :: ["A"_cf(4, 0) x "A"_cf(3, 5)] -(2)-> "A"_cf(4, 0)
  "append#2" :: ["A"_cf(0, 0) x "A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "rev#1" :: ["A"_cf(11, 0)] -(0)-> "A"_cf(4, 0)


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