WORST_CASE(?,O(n^1))

Solution:
---------

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


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)] -(0)-> A_cf(0)


Base Constructors:
------------------
  cons_A :: [A(0) x A(1)] -(1)-> A(1)
  empty_A :: [] -(0)-> A(1)