WORST_CASE(?,O(n^1))

Solution:
---------

  "f" :: ["A"(0) x "A"(14)] -(14)-> "A"(14)
  "f" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "f" :: ["A"(0) x "A"(6)] -(6)-> "A"(6)
  "g" :: ["A"(14) x "A"(6)] -(0)-> "A"(0)
  "h" :: ["A"(14) x "A"(14)] -(14)-> "A"(14)
  "h" :: ["A"(6) x "A"(6)] -(6)-> "A"(6)
  "h" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)


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




Base Constructors:
------------------
  "\"f\"_A" :: ["A"(0) x "A"(1)] -(1)-> "A"(1)
  "\"h\"_A" :: ["A"(1) x "A"(1)] -(1)-> "A"(1)