WORST_CASE(?,O(n^2))

Solution:
---------

  0 :: [] -(0)-> A(3, 5)
  0 :: [] -(0)-> A(7, 7)
  f :: [A(3, 5)] -(3)-> A(0, 0)
  p :: [A(0, 5)] -(1)-> A(3, 5)
  s :: [A(5, 5)] -(3)-> A(3, 5)
  s :: [A(5, 5)] -(0)-> A(0, 5)
  s :: [A(0, 0)] -(0)-> A(0, 0)


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

  0 :: [] -(0)-> A_cf(0, 0)
  0 :: [] -(0)-> A_cf(2, 2)
  f :: [A_cf(0, 0)] -(1)-> A_cf(0, 0)
  p :: [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)
  s_A :: [A(0, 0)] -(1)-> A(1, 0)
  s_A :: [A(1, 1)] -(0)-> A(0, 1)