WORST_CASE(?,O(n^1))

Solution:
---------

  cons :: [A(15) x A(15)] -(15)-> A(15)
  cons :: [A(2) x A(2)] -(2)-> A(2)
  empty :: [] -(0)-> A(15)
  empty :: [] -(0)-> A(14)
  r1 :: [A(15) x A(2)] -(3)-> A(2)
  rev :: [A(15)] -(14)-> A(0)


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

  cons :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  empty :: [] -(0)-> A_cf(0)
  r1 :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)


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