WORST_CASE(?,O(n^2))

Solution:
---------

  - :: [A(9, 5) x A(0, 0)] -(1)-> A(9, 5)
  0 :: [] -(0)-> A(0, 0)
  0 :: [] -(0)-> A(9, 5)
  0 :: [] -(0)-> A(1, 0)
  0 :: [] -(0)-> A(5, 5)
  div :: [A(5, 5) x A(0, 0)] -(1)-> A(0, 0)
  false :: [] -(0)-> A(0, 0)
  if :: [A(0, 0) x A(0, 0) x A(0, 0)] -(1)-> A(0, 0)
  lt :: [A(1, 0) x A(0, 0)] -(1)-> A(0, 0)
  s :: [A(0, 0)] -(0)-> A(0, 0)
  s :: [A(14, 5)] -(9)-> A(9, 5)
  s :: [A(1, 0)] -(1)-> A(1, 0)
  s :: [A(10, 5)] -(5)-> A(5, 5)
  true :: [] -(0)-> A(0, 0)


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

  - :: [A_cf(5, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
  - :: [A_cf(4, 0) x A_cf(0, 0)] -(1)-> A_cf(4, 0)
  0 :: [] -(0)-> A_cf(0, 0)
  0 :: [] -(0)-> A_cf(5, 0)
  0 :: [] -(0)-> A_cf(4, 0)
  0 :: [] -(0)-> A_cf(1, 1)
  0 :: [] -(0)-> A_cf(4, 1)
  div :: [A_cf(4, 0) x A_cf(0, 0)] -(1)-> A_cf(1, 0)
  false :: [] -(0)-> A_cf(0, 0)
  false :: [] -(0)-> A_cf(1, 1)
  if :: [A_cf(1, 1) x A_cf(1, 1) x A_cf(1, 0)] -(1)-> A_cf(1, 0)
  lt :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
  lt :: [A_cf(0, 0) x A_cf(0, 0)] -(1)-> A_cf(1, 1)
  s :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
  s :: [A_cf(5, 0)] -(5)-> A_cf(5, 0)
  s :: [A_cf(4, 0)] -(4)-> A_cf(4, 0)
  s :: [A_cf(1, 0)] -(1)-> A_cf(1, 0)
  true :: [] -(0)-> A_cf(0, 0)
  true :: [] -(0)-> A_cf(1, 1)