WORST_CASE(?,O(n^2))

Solution:
---------

  c :: [A(8, 7)] -(7)-> A(1, 7)
  c :: [A(1, 0)] -(0)-> A(1, 0)
  f :: [A(5, 0) x A(1, 7)] -(0)-> A(5, 3)
  s :: [A(5, 0)] -(5)-> A(5, 0)
  s :: [A(1, 0)] -(1)-> A(1, 7)
  s :: [A(3, 0)] -(3)-> A(3, 7)
  s :: [A(1, 0)] -(1)-> A(1, 15)
  s :: [A(1, 0)] -(1)-> A(1, 9)


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

  c :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
  c :: [A_cf(8, 8)] -(8)-> A_cf(0, 8)
  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(7, 0)
  f :: [A_cf(0, 0) x A_cf(0, 8)] -(3)-> A_cf(0, 0)
  s :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
  s :: [A_cf(0, 0)] -(0)-> A_cf(0, 12)
  s :: [A_cf(0, 0)] -(0)-> A_cf(0, 8)
  s :: [A_cf(0, 0)] -(0)-> A_cf(0, 2)


Base Constructors:
------------------
  c_A :: [A(1, 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)