diff options
author | Andrew Reynolds <andrew.j.reynolds@gmail.com> | 2021-04-19 16:59:35 -0500 |
---|---|---|
committer | GitHub <noreply@github.com> | 2021-04-19 21:59:35 +0000 |
commit | 14ee76f0737bcd0ad6711c4ab4ff9bf53a29a705 (patch) | |
tree | 1ecb2ec9968443adfb37f7f9128a1c4107254907 /src/smt/process_assertions.cpp | |
parent | a06ec9eb224c437523f3bff0ac6f6437d924f36a (diff) |
Fully incorporate quantifiers macros into ppAssert / non-clausal simplification (#6394)
This PR removes the quantifiers macro preprocessing pass, which had several shortcomings, both in terms of performance and features.
This makes it so that quantifier macros are the (optional) implementation of TheoryQuantifiers::ppAssert.
In other words, quantifiers can now be put into "solved form", forall x. P(x) ---> P = lambda x. true.
This is part of an effort to improve proofs for preprocessing, as well as centralizing our reason about substitutions for the sake of efficiency.
Diffstat (limited to 'src/smt/process_assertions.cpp')
-rw-r--r-- | src/smt/process_assertions.cpp | 5 |
1 files changed, 0 insertions, 5 deletions
diff --git a/src/smt/process_assertions.cpp b/src/smt/process_assertions.cpp index 1aa46c73c..fa230cd54 100644 --- a/src/smt/process_assertions.cpp +++ b/src/smt/process_assertions.cpp @@ -236,11 +236,6 @@ bool ProcessAssertions::apply(Assertions& as) { // remove rewrite rules, apply pre-skolemization to existential quantifiers d_passes["quantifiers-preprocess"]->apply(&assertions); - if (options::macrosQuant()) - { - // quantifiers macro expansion - d_passes["quantifier-macros"]->apply(&assertions); - } // fmf-fun : assume admissible functions, applying preprocessing reduction // to FMF |