WORST_CASE(?,O(n^1))

Solution:
---------

  cons :: [a(0) x b(15)] -(15)-> b(15)
  cons :: [a(0) x b(10)] -(10)-> b(10)
  cons :: [a(0) x b(1)] -(1)-> b(1)
  empty :: [] -(0)-> b(15)
  empty :: [] -(0)-> b(10)
  empty :: [] -(0)-> b(6)
  f :: [b(10) x b(15)] -(14)-> b(1)
  g :: [b(10) x b(1)] -(8)-> b(1)


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

  cons :: [a_cf(0) x b_cf(0)] -(0)-> b_cf(0)
  empty :: [] -(0)-> b_cf(0)
  f :: [b_cf(0) x b_cf(0)] -(0)-> b_cf(0)
  g :: [b_cf(0) x b_cf(0)] -(0)-> b_cf(0)


Base Constructors:
------------------
  cons_b :: [a(0) x b(1)] -(1)-> b(1)
  empty_b :: [] -(0)-> b(1)