WORST_CASE(?,O(n^2))

Solution:
---------

  0 :: [] -(0)-> A(0, 0)
  0 :: [] -(0)-> A(1, 0)
  0 :: [] -(0)-> A(6, 5)
  false :: [] -(0)-> A(0, 0)
  if_mod :: [A(0, 0) x A(3, 5) x A(0, 0)] -(2)-> A(0, 0)
  le :: [A(0, 0) x A(1, 0)] -(1)-> A(0, 0)
  minus :: [A(8, 5) x A(0, 0)] -(1)-> A(8, 5)
  mod :: [A(6, 5) x A(0, 0)] -(1)-> A(0, 0)
  s :: [A(0, 0)] -(0)-> A(0, 0)
  s :: [A(1, 0)] -(1)-> A(1, 0)
  s :: [A(13, 5)] -(8)-> A(8, 5)
  s :: [A(11, 5)] -(6)-> A(6, 5)
  s :: [A(8, 5)] -(3)-> A(3, 5)
  true :: [] -(0)-> A(0, 0)


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

  0 :: [] -(0)-> A_cf(0, 0)
  0 :: [] -(0)-> A_cf(2, 0)
  0 :: [] -(0)-> A_cf(1, 1)
  false :: [] -(0)-> A_cf(0, 0)
  false :: [] -(0)-> A_cf(1, 1)
  if_mod :: [A_cf(0, 0) x A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
  if_mod :: [A_cf(1, 1) x A_cf(2, 0) x A_cf(0, 0)] -(1)-> 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)] -(1)-> A_cf(1, 1)
  minus :: [A_cf(5, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
  minus :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
  minus :: [A_cf(2, 0) x A_cf(0, 0)] -(1)-> A_cf(2, 0)
  mod :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
  mod :: [A_cf(2, 0) x A_cf(0, 0)] -(2)-> A_cf(0, 0)
  s :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
  s :: [A_cf(5, 0)] -(5)-> A_cf(5, 0)
  s :: [A_cf(2, 0)] -(2)-> A_cf(2, 0)
  s :: [A_cf(1, 0)] -(1)-> A_cf(1, 0)
  true :: [] -(0)-> A_cf(0, 0)
  true :: [] -(0)-> A_cf(1, 1)