WORST_CASE(?,O(n^2))

Solution:
---------

  0 :: [] -(0)-> A(5, 0)
  0 :: [] -(0)-> A(0, 0)
  0 :: [] -(0)-> A(7, 7)
  activate :: [A(0, 5)] -(2)-> A(0, 0)
  cons :: [A(0, 0) x A(0, 0)] -(0)-> A(0, 0)
  f :: [A(5, 0)] -(1)-> A(0, 0)
  n__f :: [A(5, 5)] -(0)-> A(0, 5)
  n__f :: [A(0, 0)] -(0)-> A(0, 0)
  p :: [A(0, 7)] -(1)-> A(7, 1)
  s :: [A(5, 0)] -(5)-> A(5, 0)
  s :: [A(7, 7)] -(0)-> A(0, 7)
  s :: [A(0, 0)] -(0)-> A(0, 0)


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

  0 :: [] -(0)-> A_cf(2, 1)
  0 :: [] -(0)-> A_cf(3, 1)
  0 :: [] -(0)-> A_cf(1, 1)
  cons :: [A_cf(1, 0) x A_cf(1, 0)] -(0)-> A_cf(1, 1)
  f :: [A_cf(2, 1)] -(3)-> A_cf(0, 0)
  n__f :: [A_cf(2, 1)] -(1)-> A_cf(1, 1)
  p :: [A_cf(1, 1)] -(1)-> A_cf(2, 1)
  s :: [A_cf(3, 1)] -(2)-> A_cf(2, 1)
  s :: [A_cf(2, 1)] -(1)-> A_cf(1, 1)