WORST_CASE(?,O(n^2))

Solution:
---------

  + :: [A(0, 1) x A(0, 8)] -(1)-> A(0, 1)
  0 :: [] -(0)-> A(0, 1)
  0 :: [] -(0)-> A(0, 8)
  0 :: [] -(0)-> A(7, 15)
  s :: [A(0, 1)] -(1)-> A(0, 1)
  s :: [A(0, 8)] -(8)-> A(0, 8)


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

  + :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
  + :: [A_cf(0, 7) x A_cf(0, 7)] -(0)-> A_cf(0, 7)
  0 :: [] -(0)-> A_cf(0, 0)
  0 :: [] -(0)-> A_cf(0, 7)
  0 :: [] -(0)-> A_cf(3, 11)
  s :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
  s :: [A_cf(0, 7)] -(7)-> A_cf(0, 7)


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(0, 1)] -(1)-> A(0, 1)