WORST_CASE(?,O(n^1))

Solution:
---------

  "=" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "false" :: [] -(0)-> "A"(0)
  "false" :: [] -(0)-> "A"(14)
  "false" :: [] -(0)-> "A"(2)
  "mem" :: ["A"(0) x "A"(15)] -(12)-> "A"(0)
  "nil" :: [] -(0)-> "A"(15)
  "or" :: ["A"(0) x "A"(0)] -(1)-> "A"(0)
  "set" :: ["A"(15)] -(15)-> "A"(15)
  "true" :: [] -(0)-> "A"(0)
  "true" :: [] -(0)-> "A"(14)
  "union" :: ["A"(15) x "A"(15)] -(15)-> "A"(15)


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




Base Constructors:
------------------
  "\"=\"_A" :: ["A"(0) x "A"(0)] -(0)-> "A"(1)
  "\"false\"_A" :: [] -(0)-> "A"(1)
  "\"nil\"_A" :: [] -(0)-> "A"(1)
  "\"set\"_A" :: ["A"(1)] -(1)-> "A"(1)
  "\"true\"_A" :: [] -(0)-> "A"(1)
  "\"union\"_A" :: ["A"(1) x "A"(1)] -(1)-> "A"(1)