WORST_CASE(?,O(n^1))

Solution:
---------

  + :: [A(12) x A(4)] -(4)-> A(0)
  0 :: [] -(0)-> A(15)
  0 :: [] -(0)-> A(4)
  false :: [] -(0)-> A(0)
  not :: [A(0)] -(4)-> A(0)
  odd :: [A(15)] -(1)-> A(0)
  s :: [A(15)] -(15)-> A(15)
  s :: [A(4)] -(4)-> A(4)
  s :: [A(12)] -(12)-> A(12)
  s :: [A(0)] -(0)-> A(0)
  true :: [] -(0)-> A(0)


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

  + :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  0 :: [] -(0)-> A_cf(0)
  false :: [] -(0)-> A_cf(0)
  not :: [A_cf(0)] -(0)-> A_cf(0)
  odd :: [A_cf(0)] -(0)-> A_cf(0)
  s :: [A_cf(0)] -(0)-> A_cf(0)
  true :: [] -(0)-> A_cf(0)


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