WORST_CASE(?,O(n^1))

Solution:
---------

  0 :: [] -(0)-> A(15)
  0 :: [] -(0)-> A(0)
  0 :: [] -(0)-> A(14)
  cons :: [A(0)] -(0)-> A(12)
  f :: [A(15)] -(12)-> A(0)
  p :: [A(1)] -(0)-> A(15)
  s :: [A(0)] -(15)-> A(15)
  s :: [A(0)] -(1)-> A(1)


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

  0 :: [] -(0)-> A_cf(0)
  cons :: [A_cf(0)] -(0)-> A_cf(0)
  f :: [A_cf(0)] -(0)-> A_cf(0)
  p :: [A_cf(0)] -(0)-> A_cf(0)
  s :: [A_cf(0)] -(0)-> A_cf(0)


Base Constructors:
------------------
  0_A :: [] -(0)-> A(1)
  cons_A :: [A(0)] -(0)-> A(1)
  s_A :: [A(0)] -(1)-> A(1)