WORST_CASE(?,O(n^2))

Solution:
---------

  0 :: [] -(0)-> A(1, 7)
  0 :: [] -(0)-> A(0, 0)
  0 :: [] -(0)-> A(1, 0)
  0 :: [] -(0)-> A(8, 7)
  0 :: [] -(0)-> A(15, 13)
  0 :: [] -(0)-> A(15, 15)
  false :: [] -(0)-> A(0, 0)
  false :: [] -(0)-> A(8, 14)
  if :: [A(0, 0) x A(11, 7) x A(8, 7)] -(1)-> A(8, 7)
  le :: [A(0, 0) x A(1, 0)] -(1)-> A(6, 14)
  minus :: [A(8, 9) x A(8, 7)] -(4)-> A(5, 7)
  p :: [A(1, 7)] -(1)-> A(8, 7)
  s :: [A(8, 7)] -(1)-> A(1, 7)
  s :: [A(0, 0)] -(0)-> A(0, 0)
  s :: [A(1, 0)] -(1)-> A(1, 0)
  s :: [A(15, 7)] -(8)-> A(8, 7)
  true :: [] -(0)-> A(0, 0)
  true :: [] -(0)-> A(8, 14)


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

  0 :: [] -(0)-> A_cf(0, 0)
  false :: [] -(0)-> A_cf(0, 0)
  if :: [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)
  minus :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
  p :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
  s :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
  true :: [] -(0)-> A_cf(0, 0)


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)