WORST_CASE(?,O(n^2))

Solution:
---------

  c :: [A(12, 12)] -(12)-> A(0, 12)
  c :: [A(0, 0)] -(0)-> A(15, 0)
  f :: [A(12, 0) x A(0, 12)] -(3)-> A(14, 14)
  s :: [A(12, 0)] -(12)-> A(12, 0)
  s :: [A(4, 0)] -(4)-> A(4, 15)
  s :: [A(0, 0)] -(0)-> A(0, 12)


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

  c :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
  c :: [A_cf(0, 0)] -(0)-> A_cf(3, 0)
  f :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
  f :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(1, 1)
  s :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
  s :: [A_cf(0, 0)] -(0)-> A_cf(0, 8)
  s :: [A_cf(0, 0)] -(0)-> A_cf(0, 12)


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