WORST_CASE(?,O(n^1))

Solution:
---------

  "Cons" :: ["A"(0) x "A"(14)] -(14)-> "A"(14)
  "Cons" :: ["A"(0) x "A"(10)] -(10)-> "A"(10)
  "Cons" :: ["A"(0) x "A"(12)] -(12)-> "A"(12)
  "Cons" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "Nil" :: [] -(0)-> "A"(14)
  "Nil" :: [] -(0)-> "A"(10)
  "main" :: ["A"(15)] -(16)-> "A"(0)
  "map#2" :: ["A"(10)] -(4)-> "A"(0)
  "rmap#2" :: ["A"(14) x "A"(12)] -(6)-> "A"(12)


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

  "Cons" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "Nil" :: [] -(0)-> "A"_cf(0)
  "map#2" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "rmap#2" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)


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