WORST_CASE(?,O(n^2))

Solution:
---------

  a__f :: [A(3, 5) x A(0, 0)] -(4)-> A(3, 5)
  f :: [A(5, 5) x A(0, 0)] -(5)-> A(5, 5)
  f :: [A(0, 0) x A(0, 0)] -(0)-> A(0, 0)
  f :: [A(3, 5) x A(0, 0)] -(3)-> A(3, 5)
  g :: [A(8, 5)] -(3)-> A(3, 5)
  g :: [A(10, 5)] -(5)-> A(5, 5)
  g :: [A(0, 0)] -(0)-> A(0, 0)
  mark :: [A(5, 5)] -(1)-> A(3, 5)


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

  a__f :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
  a__f :: [A_cf(5, 0) x A_cf(0, 0)] -(5)-> A_cf(5, 0)
  f :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
  f :: [A_cf(5, 0) x A_cf(0, 0)] -(5)-> A_cf(5, 0)
  g :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
  g :: [A_cf(5, 0)] -(5)-> A_cf(5, 0)
  mark :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
  mark :: [A_cf(5, 0)] -(1)-> A_cf(5, 0)


Base Constructors:
------------------
  f_A :: [A(1, 0) x A(0, 0)] -(1)-> A(1, 0)
  f_A :: [A(0, 1) x A(0, 0)] -(0)-> A(0, 1)
  g_A :: [A(1, 0)] -(1)-> A(1, 0)
  g_A :: [A(1, 1)] -(0)-> A(0, 1)