WORST_CASE(?,O(n^1))

Solution:
---------

  Cons :: [A(1) x A(1)] -(1)-> A(1)
  False :: [] -(0)-> A(14)
  Nil :: [] -(0)-> A(1)
  True :: [] -(0)-> A(14)
  even :: [A(1)] -(7)-> A(14)
  evenodd :: [A(15)] -(14)-> A(0)
  notEmpty :: [A(1)] -(8)-> A(0)
  odd :: [A(1)] -(7)-> A(14)


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

  Cons :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  False :: [] -(0)-> A_cf(0)
  Nil :: [] -(0)-> A_cf(0)
  True :: [] -(0)-> A_cf(0)
  even :: [A_cf(0)] -(0)-> A_cf(0)
  odd :: [A_cf(0)] -(0)-> A_cf(0)


Base Constructors:
------------------
  Cons_A :: [A(1) x A(1)] -(1)-> A(1)
  False_A :: [] -(0)-> A(1)
  Nil_A :: [] -(0)-> A(1)
  True_A :: [] -(0)-> A(1)