WORST_CASE(?,O(n^2))

Solution:
---------

  - :: [A(1, 8) x A(0, 0)] -(1)-> A(1, 8)
  0 :: [] -(0)-> A(0, 0)
  f :: [A(6, 8) x A(7, 8)] -(7)-> A(4, 4)
  p :: [A(1, 8)] -(0)-> A(9, 8)
  s :: [A(9, 8)] -(1)-> A(1, 8)
  s :: [A(0, 0)] -(0)-> A(0, 0)
  s :: [A(14, 8)] -(6)-> A(6, 8)
  s :: [A(15, 8)] -(7)-> A(7, 8)
  s :: [A(1, 0)] -(1)-> A(1, 0)


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

  - :: [A_cf(8, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
  - :: [A_cf(2, 0) x A_cf(0, 0)] -(0)-> A_cf(2, 0)
  - :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
  0 :: [] -(0)-> A_cf(0, 0)
  f :: [A_cf(2, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
  p :: [A_cf(2, 0)] -(0)-> A_cf(2, 0)
  p :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
  s :: [A_cf(8, 0)] -(8)-> A_cf(8, 0)
  s :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
  s :: [A_cf(2, 0)] -(2)-> A_cf(2, 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)