WORST_CASE(?,O(n^1))

Solution:
---------

  !EQ :: [A(0) x A(0)] -(1)-> A(12)
  0 :: [] -(0)-> A(0)
  Cons :: [A(0) x A(5)] -(5)-> A(5)
  Cons :: [A(0) x A(7)] -(7)-> A(7)
  False :: [] -(0)-> A(10)
  False :: [] -(0)-> A(11)
  False :: [] -(0)-> A(14)
  Nil :: [] -(0)-> A(5)
  Nil :: [] -(0)-> A(7)
  S :: [A(0)] -(0)-> A(0)
  True :: [] -(0)-> A(10)
  True :: [] -(0)-> A(15)
  True :: [] -(0)-> A(11)
  goal :: [A(15) x A(11)] -(14)-> A(2)
  member :: [A(9) x A(5)] -(11)-> A(5)
  member[Ite][True][Ite] :: [A(10) x A(9) x A(5)] -(6)-> A(5)
  notEmpty :: [A(7)] -(8)-> A(0)


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

  !EQ :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  0 :: [] -(0)-> A_cf(0)
  Cons :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  False :: [] -(0)-> A_cf(0)
  Nil :: [] -(0)-> A_cf(0)
  S :: [A_cf(0)] -(0)-> A_cf(0)
  True :: [] -(0)-> A_cf(0)
  member :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  member[Ite][True][Ite] :: [A_cf(0) x A_cf(0) x A_cf(0)] -(0)-> A_cf(0)


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