WORST_CASE(?,O(n^1))

Solution:
---------

  "0" :: [] -(0)-> "A"(13)
  "0" :: [] -(0)-> "A"(14)
  "Cons" :: ["A"(13) x "A"(13)] -(13)-> "A"(13)
  "Nil" :: [] -(0)-> "A"(13)
  "S" :: ["A"(13)] -(13)-> "A"(13)
  "S" :: ["A"(6)] -(6)-> "A"(6)
  "fold#3" :: ["A"(13)] -(12)-> "A"(6)
  "main" :: ["A"(15)] -(16)-> "A"(0)
  "plus#2" :: ["A"(13) x "A"(6)] -(1)-> "A"(6)


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)