WORST_CASE(?,O(n^1))

Solution:
---------

  "*" :: ["A"(5) x "A"(5)] -(1)-> "A"(3)
  "+" :: ["A"(0) x "A"(0)] -(0)-> "A"(15)
  "+Full" :: ["A"(7) x "A"(1)] -(7)-> "A"(0)
  "0" :: [] -(0)-> "A"(7)
  "0" :: [] -(0)-> "A"(5)
  "Cons" :: ["A"(13) x "A"(13)] -(13)-> "A"(13)
  "Cons" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "Nil" :: [] -(0)-> "A"(13)
  "Nil" :: [] -(0)-> "A"(7)
  "S" :: ["A"(7)] -(7)-> "A"(7)
  "S" :: ["A"(5)] -(5)-> "A"(5)
  "S" :: ["A"(1)] -(1)-> "A"(1)
  "f" :: ["A"(13)] -(11)-> "A"(2)
  "goal" :: ["A"(15)] -(8)-> "A"(0)
  "map" :: ["A"(13)] -(1)-> "A"(0)


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




Base Constructors:
------------------
  "\"+\"_A" :: ["A"(0) x "A"(0)] -(0)-> "A"(1)
  "\"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)