WORST_CASE(?,O(n^2))

Solution:
---------

  0 :: [] -(0)-> A(0, 0)
  0 :: [] -(0)-> A(1, 0)
  0 :: [] -(0)-> A(13, 1)
  0 :: [] -(0)-> A(4, 0)
  0 :: [] -(0)-> A(13, 7)
  0 :: [] -(0)-> A(12, 6)
  false :: [] -(0)-> A(9, 9)
  false :: [] -(0)-> A(15, 15)
  if_mod :: [A(9, 9) x A(12, 1) x A(4, 0)] -(1)-> A(6, 0)
  le :: [A(0, 0) x A(1, 0)] -(4)-> A(12, 12)
  minus :: [A(13, 1) x A(0, 0)] -(1)-> A(13, 1)
  mod :: [A(13, 1) x A(4, 0)] -(7)-> A(6, 0)
  s :: [A(0, 0)] -(0)-> A(0, 0)
  s :: [A(1, 0)] -(1)-> A(1, 0)
  s :: [A(14, 1)] -(13)-> A(13, 1)
  s :: [A(4, 0)] -(4)-> A(4, 0)
  s :: [A(13, 1)] -(12)-> A(12, 1)
  s :: [A(12, 0)] -(12)-> A(12, 0)
  true :: [] -(0)-> A(9, 9)
  true :: [] -(0)-> A(15, 15)


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

  0 :: [] -(0)-> A_cf(0, 0)
  0 :: [] -(0)-> A_cf(2, 2)
  false :: [] -(0)-> A_cf(0, 0)
  false :: [] -(0)-> A_cf(1, 1)
  false :: [] -(0)-> A_cf(3, 3)
  if_mod :: [A_cf(1, 1) x A_cf(0, 0) x A_cf(0, 0)] -(1)-> A_cf(0, 0)
  if_mod :: [A_cf(0, 0) x A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
  le :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
  le :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(3, 3)
  minus :: [A_cf(1, 0) x A_cf(0, 0)] -(5)-> A_cf(0, 0)
  minus :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
  mod :: [A_cf(0, 0) x A_cf(0, 0)] -(1)-> A_cf(0, 0)
  mod :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
  s :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
  s :: [A_cf(1, 0)] -(1)-> A_cf(1, 0)
  true :: [] -(0)-> A_cf(0, 0)
  true :: [] -(0)-> A_cf(1, 1)
  true :: [] -(0)-> A_cf(3, 3)


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