WORST_CASE(?,O(n^1))

Solution:
---------

  0 :: [] -(0)-> A(14)
  p :: [A(14) x A(14) x A(14)] -(2)-> A(0)
  s :: [A(14)] -(14)-> A(14)


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

  0 :: [] -(0)-> A_cf(0)
  p :: [A_cf(0) x A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  s :: [A_cf(0)] -(0)-> A_cf(0)


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