BEST_CASE(Omega(n^1),?)

Solution:
---------

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


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