WORST_CASE(?,O(n^2))

Solution:
---------

  0 :: [] -(0)-> A(2, 2)
  0 :: [] -(0)-> A(0, 0)
  fac :: [A(2, 2)] -(1)-> A(0, 0)
  p :: [A(0, 2)] -(1)-> A(2, 2)
  s :: [A(2, 2)] -(0)-> A(0, 2)
  s :: [A(4, 2)] -(2)-> A(2, 2)
  s :: [A(0, 0)] -(0)-> A(0, 0)
  times :: [A(0, 0) x A(0, 0)] -(0)-> A(0, 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)