WORST_CASE(?,O(n^2))

Solution:
---------

  0 :: [] -(0)-> A(0, 0)
  0 :: [] -(0)-> A(15, 7)
  0 :: [] -(0)-> A(8, 7)
  0 :: [] -(0)-> A(13, 7)
  log :: [A(1, 7)] -(0)-> A(0, 0)
  min :: [A(22, 7) x A(0, 0)] -(1)-> A(22, 7)
  quot :: [A(15, 7) x A(0, 0)] -(1)-> A(13, 7)
  s :: [A(29, 7)] -(22)-> A(22, 7)
  s :: [A(0, 0)] -(0)-> A(0, 0)
  s :: [A(22, 7)] -(15)-> A(15, 7)
  s :: [A(8, 7)] -(1)-> A(1, 7)
  s :: [A(15, 7)] -(8)-> A(8, 7)
  s :: [A(20, 7)] -(13)-> A(13, 7)
  s :: [A(13, 7)] -(6)-> A(6, 7)


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

  0 :: [] -(0)-> A_cf(0, 0)
  0 :: [] -(0)-> A_cf(7, 0)
  0 :: [] -(0)-> A_cf(5, 0)
  0 :: [] -(0)-> A_cf(1, 1)
  0 :: [] -(0)-> A_cf(5, 1)
  0 :: [] -(0)-> A_cf(3, 1)
  log :: [A_cf(5, 0)] -(1)-> A_cf(1, 0)
  min :: [A_cf(7, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
  min :: [A_cf(7, 0) x A_cf(0, 0)] -(0)-> A_cf(7, 0)
  min :: [A_cf(5, 0) x A_cf(0, 0)] -(0)-> A_cf(5, 0)
  quot :: [A_cf(7, 0) x A_cf(0, 0)] -(0)-> A_cf(7, 0)
  quot :: [A_cf(5, 0) x A_cf(1, 1)] -(1)-> A_cf(5, 0)
  s :: [A_cf(7, 0)] -(7)-> A_cf(7, 0)
  s :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
  s :: [A_cf(5, 0)] -(5)-> A_cf(5, 0)
  s :: [A_cf(1, 0)] -(1)-> A_cf(1, 0)
  s :: [A_cf(2, 1)] -(1)-> A_cf(1, 1)
  s :: [A_cf(3, 1)] -(2)-> A_cf(2, 1)