WORST_CASE(?,O(n^2))

Solution:
---------

  "concat" :: ["A"(5, 6) x "A"(2, 6)] -(1)-> "A"(2, 6)
  "cons" :: ["A"(11, 6) x "A"(5, 6)] -(5)-> "A"(5, 6)
  "cons" :: ["A"(8, 6) x "A"(2, 6)] -(2)-> "A"(2, 6)
  "false" :: [] -(0)-> "A"(12, 12)
  "leaf" :: [] -(0)-> "A"(5, 6)
  "leaf" :: [] -(0)-> "A"(2, 6)
  "lessleaves" :: ["A"(2, 6) x "A"(2, 6)] -(2)-> "A"(2, 2)
  "true" :: [] -(0)-> "A"(12, 12)


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




Base Constructors:
------------------
  "\"cons\"_A" :: ["A"(1, 0) x "A"(1, 0)] -(1)-> "A"(1, 0)
  "\"cons\"_A" :: ["A"(1, 1) x "A"(0, 1)] -(0)-> "A"(0, 1)
  "\"false\"_A" :: [] -(0)-> "A"(1, 0)
  "\"false\"_A" :: [] -(0)-> "A"(0, 1)
  "\"leaf\"_A" :: [] -(0)-> "A"(1, 0)
  "\"leaf\"_A" :: [] -(0)-> "A"(0, 1)
  "\"true\"_A" :: [] -(0)-> "A"(1, 0)
  "\"true\"_A" :: [] -(0)-> "A"(0, 1)