WORST_CASE(?,O(n^1))

Solution:
---------

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


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




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)