WORST_CASE(?,O(n^1))

Solution:
---------

  "0" :: [] -(0)-> "A"(5)
  "0" :: [] -(0)-> "A"(6)
  "0" :: [] -(0)-> "A"(14)
  "0" :: [] -(0)-> "A"(9)
  "0" :: [] -(0)-> "A"(7)
  "0" :: [] -(0)-> "A"(15)
  "Cons" :: ["A"(11) x "A"(11)] -(11)-> "A"(11)
  "Cons" :: ["A"(10) x "A"(10)] -(10)-> "A"(10)
  "Nil" :: [] -(0)-> "A"(11)
  "Nil" :: [] -(0)-> "A"(10)
  "Nil" :: [] -(0)-> "A"(13)
  "S" :: ["A"(6)] -(6)-> "A"(6)
  "S" :: ["A"(0)] -(0)-> "A"(0)
  "comp_f_g" :: ["A"(8) x "A"(8)] -(8)-> "A"(8)
  "comp_f_g#1" :: ["A"(8) x "A"(8) x "A"(5)] -(15)-> "A"(0)
  "foldr#3" :: ["A"(10)] -(1)-> "A"(8)
  "foldr_f#3" :: ["A"(10) x "A"(14)] -(7)-> "A"(0)
  "id" :: [] -(0)-> "A"(8)
  "id" :: [] -(0)-> "A"(15)
  "main" :: ["A"(13)] -(16)-> "A"(0)
  "map#2" :: ["A"(11)] -(4)-> "A"(10)
  "plus_x" :: ["A"(8)] -(0)-> "A"(8)
  "plus_x" :: ["A"(10)] -(0)-> "A"(10)
  "plus_x#1" :: ["A"(6) x "A"(0)] -(3)-> "A"(0)


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

  "0" :: [] -(0)-> "A"_cf(0)
  "Cons" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "Nil" :: [] -(0)-> "A"_cf(0)
  "S" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "comp_f_g" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "comp_f_g#1" :: ["A"_cf(0) x "A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "foldr#3" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "id" :: [] -(0)-> "A"_cf(0)
  "map#2" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "plus_x" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "plus_x#1" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)


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