WORST_CASE(?,O(n^2))

Solution:
---------

  - :: [A(12, 4) x A(11, 0)] -(3)-> A(8, 0)
  0 :: [] -(0)-> A(12, 4)
  0 :: [] -(0)-> A(11, 0)
  0 :: [] -(0)-> A(2, 9)
  0 :: [] -(0)-> A(15, 7)
  0 :: [] -(0)-> A(15, 15)
  0 :: [] -(0)-> A(13, 7)
  greater :: [A(0, 0) x A(0, 0)] -(0)-> A(0, 14)
  if :: [A(0, 9) x A(0, 0) x A(9, 9)] -(0)-> A(8, 9)
  p :: [A(2, 9)] -(1)-> A(11, 0)
  s :: [A(11, 0)] -(11)-> A(11, 0)
  s :: [A(11, 0)] -(2)-> A(2, 9)
  s :: [A(0, 0)] -(0)-> A(0, 0)
  s :: [A(8, 0)] -(0)-> A(0, 8)


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

  - :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
  0 :: [] -(0)-> A_cf(0, 0)
  greater :: [A_cf(0, 0) x A_cf(0, 0)] -(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)
  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)
  greater_A :: [A(0, 0) x A(0, 0)] -(1)-> A(1, 0)
  greater_A :: [A(0, 0) x A(0, 0)] -(0)-> A(0, 1)
  if_A :: [A(0, 0) x A(0, 0) x A(0, 0)] -(0)-> A(1, 0)
  if_A :: [A(0, 1) x A(0, 0) x A(1, 1)] -(0)-> A(0, 1)
  s_A :: [A(1, 0)] -(1)-> A(1, 0)
  s_A :: [A(1, 0)] -(0)-> A(0, 1)