WORST_CASE(?,O(n^1))

Solution:
---------

  "Cons" :: ["A"(0) x "A"(15)] -(15)-> "A"(15)
  "Cons" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "Nil" :: [] -(0)-> "A"(15)
  "Nil" :: [] -(0)-> "A"(8)
  "Nil" :: [] -(0)-> "A"(12)
  "comp_f_g" :: ["A"(3) x "A"(3)] -(0)-> "A"(3)
  "comp_f_g" :: ["A"(6) x "A"(6)] -(0)-> "A"(6)
  "comp_f_g#1" :: ["A"(3) x "A"(3) x "A"(0)] -(15)-> "A"(0)
  "main" :: ["A"(15)] -(15)-> "A"(0)
  "walk#1" :: ["A"(15)] -(4)-> "A"(6)
  "walk_xs" :: [] -(0)-> "A"(3)
  "walk_xs" :: [] -(0)-> "A"(14)
  "walk_xs_3" :: ["A"(0)] -(3)-> "A"(3)
  "walk_xs_3" :: ["A"(0)] -(6)-> "A"(6)
  "walk_xs_3" :: ["A"(0)] -(5)-> "A"(5)


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




Base Constructors:
------------------
  "\"Cons\"_A" :: ["A"(0) x "A"(1)] -(1)-> "A"(1)
  "\"Nil\"_A" :: [] -(0)-> "A"(1)
  "\"comp_f_g\"_A" :: ["A"(0) x "A"(0)] -(0)-> "A"(1)
  "\"walk_xs\"_A" :: [] -(0)-> "A"(1)
  "\"walk_xs_3\"_A" :: ["A"(0)] -(1)-> "A"(1)