WORST_CASE(?,O(n^1))

Solution:
---------

  "0" :: [] -(0)-> "A"(15)
  "Cons" :: ["A"(0) x "A"(2)] -(2)-> "A"(2)
  "Cons" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "Nil" :: [] -(0)-> "A"(2)
  "Nil" :: [] -(0)-> "A"(15)
  "Nil" :: [] -(0)-> "A"(7)
  "S" :: ["A"(0)] -(0)-> "A"(15)
  "S" :: ["A"(0)] -(0)-> "A"(11)
  "S" :: ["A"(0)] -(0)-> "A"(10)
  "comp_f_g" :: ["A"(1) x "A"(1)] -(0)-> "A"(1)
  "comp_f_g#1" :: ["A"(1) x "A"(0) x "A"(0)] -(3)-> "A"(0)
  "main" :: [] -(16)-> "A"(0)
  "walk#1" :: ["A"(2)] -(8)-> "A"(1)
  "walk_xyz" :: [] -(0)-> "A"(1)
  "walk_xyz" :: [] -(0)-> "A"(7)
  "walk_xyz_3" :: ["A"(0)] -(1)-> "A"(1)
  "walk_xyz_3" :: ["A"(0)] -(0)-> "A"(0)


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




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