WORST_CASE(?,O(n^2))

Solution:
---------

  - :: [A(1, 4) x A(1, 0)] -(1)-> A(1, 4)
  0 :: [] -(0)-> A(1, 0)
  f :: [A(5, 4) x A(5, 4)] -(0)-> A(0, 0)
  p :: [A(1, 4)] -(0)-> A(5, 4)
  s :: [A(5, 4)] -(1)-> A(1, 4)
  s :: [A(1, 0)] -(1)-> A(1, 0)
  s :: [A(9, 4)] -(5)-> A(5, 4)


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

  - :: [A_cf(4, 0) x A_cf(0, 0)] -(1)-> A_cf(0, 0)
  - :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
  0 :: [] -(0)-> A_cf(0, 0)
  f :: [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(4, 0)] -(4)-> A_cf(4, 0)
  s :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)