WORST_CASE(?,O(n^1))

Solution:
---------

  "cons" :: ["a"(0) x "a"(9)] -(9)-> "a"(9)
  "cons" :: ["a"(0) x "a"(0)] -(0)-> "a"(0)
  "empty" :: [] -(0)-> "a"(9)
  "f" :: ["a"(9) x "a"(0)] -(13)-> "a"(0)
  "g" :: ["a"(9) x "a"(0) x "a"(0)] -(15)-> "a"(0)


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

  "cons" :: ["a"_cf(0) x "a"_cf(0)] -(0)-> "a"_cf(0)
  "empty" :: [] -(0)-> "a"_cf(0)
  "f" :: ["a"_cf(0) x "a"_cf(0)] -(0)-> "a"_cf(0)
  "g" :: ["a"_cf(0) x "a"_cf(0) x "a"_cf(0)] -(0)-> "a"_cf(0)


Base Constructors:
------------------
  "\"cons\"_a" :: ["a"(0) x "a"(1)] -(1)-> "a"(1)
  "\"empty\"_a" :: [] -(0)-> "a"(1)