WORST_CASE(?,O(n^1))

Solution:
---------

  "0" :: [] -(0)-> "A"(15)
  "Cons" :: ["A"(0) x "A"(3)] -(3)-> "A"(3)
  "Cons" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "Lam1" :: ["A"(1) x "A"(1)] -(0)-> "A"(1)
  "Lam2" :: [] -(0)-> "A"(1)
  "Lam2" :: [] -(0)-> "A"(7)
  "Lam3" :: ["A"(0)] -(1)-> "A"(1)
  "Nil" :: [] -(0)-> "A"(3)
  "Nil" :: [] -(0)-> "A"(15)
  "Nil" :: [] -(0)-> "A"(7)
  "S" :: ["A"(0)] -(0)-> "A"(15)
  "S" :: ["A"(0)] -(0)-> "A"(11)
  "apply#2" :: ["A"(1) x "A"(0)] -(1)-> "A"(0)
  "main" :: [] -(16)-> "A"(0)
  "walk#1" :: ["A"(3)] -(2)-> "A"(1)


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

  "Cons" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "Lam1" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "Lam2" :: [] -(0)-> "A"_cf(0)
  "Lam3" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "Nil" :: [] -(0)-> "A"_cf(0)
  "apply#2" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "walk#1" :: ["A"_cf(0)] -(0)-> "A"_cf(0)


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