WORST_CASE(?,O(n^1))

Solution:
---------

  "0" :: [] -(0)-> "A"(9)
  "0" :: [] -(0)-> "A"(0)
  "Cons" :: ["A"(11) x "A"(11)] -(11)-> "A"(11)
  "Nil" :: [] -(0)-> "A"(11)
  "S" :: ["A"(9)] -(9)-> "A"(9)
  "S" :: ["A"(0)] -(0)-> "A"(0)
  "fold#3" :: ["A"(11)] -(4)-> "A"(0)
  "main" :: ["A"(12)] -(5)-> "A"(0)
  "plus#2" :: ["A"(9) x "A"(0)] -(1)-> "A"(0)


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)