Use purification for set comprehension reduction (#8711)
authorAndrew Reynolds <andrew.j.reynolds@gmail.com>
Thu, 5 May 2022 01:26:46 +0000 (20:26 -0500)
committerGitHub <noreply@github.com>
Thu, 5 May 2022 01:26:46 +0000 (01:26 +0000)
commit388cfb3cd1e80d50751b468112e91664c5c4e47a
tree3de9892128cc8e54c6e861529dfc8ee94f0d4080
parent9c6e91b97a63c8085263c3e5e0513ec133763884
Use purification for set comprehension reduction (#8711)

Currently, the reduction lemma does not purify set comprehension from its reduction predicate. This means that our rewriter (if it were smart enough) should rewrite the reduction predicate to true.

Moreover, a new forthcoming model-based instantiation technique was giving wrong answers when set comprehensions were present since it could prove the reductions were tautological.
src/theory/sets/theory_sets_private.cpp