WORST_CASE(?,O(n^2))

Solution:
---------

  0 :: [] -(0)-> A(0, 7)
  0 :: [] -(0)-> A(7, 7)
  0 :: [] -(0)-> A(11, 13)
  0 :: [] -(0)-> A(15, 15)
  f :: [A(0, 7)] -(6)-> A(0, 3)
  s :: [A(7, 7)] -(0)-> A(0, 7)
  s :: [A(14, 7)] -(7)-> A(7, 7)
  s :: [A(4, 3)] -(1)-> A(1, 3)
  s :: [A(13, 12)] -(1)-> A(1, 12)


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

  0 :: [] -(0)-> A_cf(0, 0)
  0 :: [] -(0)-> A_cf(11, 11)
  f :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
  f :: [A_cf(0, 0)] -(0)-> A_cf(0, 4)
  s :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
  s :: [A_cf(9, 9)] -(0)-> A_cf(0, 9)
  s :: [A_cf(5, 5)] -(0)-> A_cf(0, 5)


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