WORST_CASE(?,O(n^1))

Solution:
---------

  "!EQ" :: ["A"(0) x "A"(0)] -(0)-> "A"(11)
  "0" :: [] -(0)-> "A"(0)
  "Cons" :: ["A"(0) x "A"(5)] -(5)-> "A"(5)
  "Cons" :: ["A"(0) x "A"(15)] -(15)-> "A"(15)
  "False" :: [] -(0)-> "A"(4)
  "False" :: [] -(0)-> "A"(15)
  "False" :: [] -(0)-> "A"(13)
  "Nil" :: [] -(0)-> "A"(5)
  "Nil" :: [] -(0)-> "A"(15)
  "S" :: ["A"(0)] -(0)-> "A"(0)
  "True" :: [] -(0)-> "A"(4)
  "True" :: [] -(0)-> "A"(15)
  "True" :: [] -(0)-> "A"(13)
  "goal" :: ["A"(15) x "A"(11)] -(11)-> "A"(2)
  "member" :: ["A"(9) x "A"(5)] -(8)-> "A"(13)
  "member[Ite][True][Ite]" :: ["A"(4) x "A"(9) x "A"(5)] -(5)-> "A"(13)
  "notEmpty" :: ["A"(15)] -(9)-> "A"(0)


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




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"(0)] -(1)-> "A"(1)
  "\"True\"_A" :: [] -(0)-> "A"(1)