WORST_CASE(?,O(n^2))

Solution:
---------

  c :: [A(0, 9) x A(1, 0)] -(1)-> A(1, 9)
  c :: [A(0, 0) x A(7, 0)] -(7)-> A(7, 0)
  f :: [A(1, 9)] -(1)-> A(7, 0)
  g :: [A(7, 0)] -(10)-> A(4, 4)
  s :: [A(0, 9)] -(9)-> A(0, 9)
  s :: [A(7, 0)] -(7)-> A(7, 0)
  s :: [A(1, 0)] -(1)-> A(1, 0)
  s :: [A(0, 0)] -(0)-> A(0, 0)


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

  c :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
  c :: [A_cf(0, 12) x A_cf(0, 0)] -(0)-> A_cf(0, 12)
  c :: [A_cf(0, 14) x A_cf(0, 0)] -(0)-> A_cf(0, 14)
  f :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
  f :: [A_cf(0, 14)] -(2)-> A_cf(0, 0)
  f :: [A_cf(0, 12)] -(0)-> A_cf(11, 11)
  f :: [A_cf(0, 14)] -(3)-> A_cf(0, 0)
  g :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
  g :: [A_cf(0, 0)] -(3)-> A_cf(0, 0)
  s :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
  s :: [A_cf(0, 12)] -(12)-> A_cf(0, 12)
  s :: [A_cf(0, 14)] -(14)-> A_cf(0, 14)


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