WORST_CASE(?,O(n^2))

Solution:
---------

  0 :: [] -(0)-> A(7, 7)
  0 :: [] -(0)-> A(15, 15)
  fac :: [A(7, 7)] -(5)-> A(0, 0)
  p :: [A(1, 7)] -(0)-> A(7, 7)
  s :: [A(8, 7)] -(1)-> A(1, 7)
  s :: [A(14, 7)] -(7)-> A(7, 7)
  s :: [A(14, 14)] -(0)-> A(0, 14)
  s :: [A(0, 0)] -(0)-> A(0, 0)
  s :: [A(9, 7)] -(2)-> A(2, 7)
  times :: [A(0, 0) x A(0, 0)] -(0)-> A(4, 0)


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

  0 :: [] -(0)-> A_cf(0, 0)
  fac :: [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)
  times :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)


Base Constructors:
------------------
  0_A :: [] -(0)-> A(1, 0)
  0_A :: [] -(0)-> A(0, 1)
  s_A :: [A(1, 0)] -(1)-> A(1, 0)
  s_A :: [A(1, 1)] -(0)-> A(0, 1)
  times_A :: [A(0, 0) x A(0, 0)] -(0)-> A(1, 0)
  times_A :: [A(0, 0) x A(0, 0)] -(1)-> A(0, 1)