WORST_CASE(?,O(n^1))

Solution:
---------

  + :: [A(12) x A(14)] -(8)-> A(2)
  - :: [A(10) x A(7)] -(4)-> A(9)
  0 :: [] -(0)-> A(12)
  0 :: [] -(0)-> A(10)
  0 :: [] -(0)-> A(7)
  s :: [A(12)] -(12)-> A(12)
  s :: [A(10)] -(10)-> A(10)
  s :: [A(7)] -(7)-> A(7)
  s :: [A(2)] -(2)-> A(2)


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

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


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