BEST_CASE(Omega(n^1),?)

Solution:
---------

  "0" :: [] -(0)-> "A"(0)
  "0" :: [] -(0)-> "A"(2)
  "0" :: [] -(0)-> "A"(1)
  "Cons" :: ["A"(1) x "A"(0)] -(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)
  "S" :: ["A"(2)] -(2)-> "A"(2)
  "S" :: ["A"(1)] -(1)-> "A"(1)
  "main" :: ["A"(1)] -(1)-> "A"(0)
  "map#2" :: ["A"(1)] -(1)-> "A"(0)
  "mult#2" :: ["A"(2) x "A"(0)] -(1)-> "A"(0)
  "plus#2" :: ["A"(1) x "A"(0)] -(1)-> "A"(0)
  "sum#1" :: ["A"(1)] -(1)-> "A"(0)
  "unfoldr#2" :: ["A"(0)] -(1)-> "A"(0)


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




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