WORST_CASE(?,O(n^2))

Solution:
---------

  + :: [A(0, 0) x A(5, 0)] -(1)-> A(0, 0)
  0 :: [] -(0)-> A(0, 14)
  0 :: [] -(0)-> A(5, 0)
  1 :: [] -(0)-> A(6, 6)
  f :: [A(0, 14)] -(5)-> A(0, 0)
  g :: [A(0, 14) x A(0, 0)] -(9)-> A(0, 0)
  s :: [A(14, 14)] -(14)-> A(0, 14)
  s :: [A(5, 0)] -(5)-> A(5, 0)
  s :: [A(1, 0)] -(1)-> A(1, 0)
  s :: [A(0, 0)] -(0)-> A(0, 0)


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

  + :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
  0 :: [] -(0)-> A_cf(0, 0)
  g :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
  s :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)


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