WORST_CASE(?,O(n^1))

Solution:
---------

  f :: [A(14) x A(13) x A(1)] -(1)-> A(0)
  g :: [A(15) x A(15)] -(4)-> A(0)
  s :: [A(14)] -(14)-> A(14)
  s :: [A(1)] -(1)-> A(1)


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

  f :: [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:
------------------
  s_A :: [A(1)] -(1)-> A(1)