WORST_CASE(?,O(n^2))

Solution:
---------

  + :: [A(0, 0) x A(1, 0)] -(2)-> A(0, 0)
  0 :: [] -(0)-> A(8, 3)
  0 :: [] -(0)-> A(1, 0)
  0 :: [] -(0)-> A(7, 7)
  s :: [A(11, 3)] -(8)-> A(8, 3)
  s :: [A(1, 0)] -(1)-> A(1, 0)
  s :: [A(0, 0)] -(0)-> A(0, 0)
  sum :: [A(8, 3)] -(5)-> A(0, 0)


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

  + :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
  0 :: [] -(0)-> A_cf(1, 0)
  0 :: [] -(0)-> A_cf(3, 2)
  0 :: [] -(0)-> A_cf(0, 0)
  s :: [A_cf(1, 0)] -(1)-> A_cf(1, 0)
  s :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
  sum :: [A_cf(1, 0)] -(1)-> 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)