WORST_CASE(?,O(n^1))

Solution:
---------

  "Cons" :: ["A"(0) x "A"(0)] -(0)-> "A"(12)
  "Cons" :: ["A"(0) x "A"(0)] -(0)-> "A"(15)
  "Leaf" :: ["A"(13)] -(13)-> "A"(13)
  "Leaf" :: ["A"(15)] -(15)-> "A"(15)
  "Nil" :: [] -(0)-> "A"(15)
  "Node" :: ["A"(13) x "A"(13)] -(13)-> "A"(13)
  "Node" :: ["A"(15) x "A"(15)] -(15)-> "A"(15)
  "comp_f_g" :: ["A"(8) x "A"(8)] -(8)-> "A"(8)
  "comp_f_g#1" :: ["A"(8) x "A"(8) x "A"(1)] -(0)-> "A"(8)
  "cons_x" :: ["A"(8)] -(8)-> "A"(8)
  "main" :: ["A"(15)] -(1)-> "A"(5)
  "walk#1" :: ["A"(13)] -(1)-> "A"(8)


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




Base Constructors:
------------------
  "\"Cons\"_A" :: ["A"(0) x "A"(0)] -(0)-> "A"(1)
  "\"Leaf\"_A" :: ["A"(1)] -(1)-> "A"(1)
  "\"Nil\"_A" :: [] -(0)-> "A"(1)
  "\"Node\"_A" :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
  "\"comp_f_g\"_A" :: ["A"(0) x "A"(0)] -(1)-> "A"(1)
  "\"cons_x\"_A" :: ["A"(0)] -(1)-> "A"(1)