WORST_CASE(?,O(n^1))

Solution:
---------

  + :: [A(0) x A(0)] -(0)-> A(14)
  + :: [A(0) x A(0)] -(0)-> A(12)
  0 :: [] -(0)-> A(15)
  0 :: [] -(0)-> A(3)
  0 :: [] -(0)-> A(14)
  0 :: [] -(0)-> A(8)
  s :: [A(15)] -(15)-> A(15)
  s :: [A(3)] -(3)-> A(3)
  s :: [A(0)] -(0)-> A(0)
  sum :: [A(15)] -(12)-> A(0)
  sum1 :: [A(3)] -(7)-> A(0)


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

  + :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  0 :: [] -(0)-> A_cf(0)
  s :: [A_cf(0)] -(0)-> A_cf(0)
  sum :: [A_cf(0)] -(0)-> A_cf(0)
  sum1 :: [A_cf(0)] -(0)-> A_cf(0)


Base Constructors:
------------------
  +_A :: [A(0) x A(0)] -(0)-> A(0)
  0_A :: [] -(0)-> A(1)
  s_A :: [A(1)] -(1)-> A(1)