update release notes

Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>

src/ast/simplifiers/CMakeLists.txt

@@ -31,6 +31,11 @@ z3_add_component(simplifiers
     substitution
   TACTIC_HEADERS
     bit_blaster.h
+    bit2int.h
+    elim_bounds.h
+    elim_term_ite.h
+    pull_nested_quantifiers.h
+    push_ite.h
+    refine_inj_axiom.h
     rewriter_simplifier.h
-
 )

src/ast/simplifiers/bit2int.h

@@ -42,3 +42,6 @@ public:
     bool supports_proofs() const override { return true; }
 };
 
+/*
+  ADD_SIMPLIFIER("bit2int", "simplify bit2int expressions.", "alloc(bit2int_simplifier, m, p, s)")
+ */

src/ast/simplifiers/bit_blaster.h

@@ -33,7 +33,7 @@ public:
         m_rewriter(m, p) {
         updt_params(p);
     }
-    char const* name() const override { return "bit-blaster"; }
+    char const* name() const override { return "bit-blast"; }
     void updt_params(params_ref const & p) override;
     void collect_param_descrs(param_descrs & r) override;
     void reduce() override;
@@ -50,5 +50,5 @@ public:
 };
 
 /*
-  ADD_SIMPLIFIER("bit-blaster", "reduce bit-vector expressions into SAT.", "[](auto& m, auto& p, auto &s) -> dependent_expr_simplifier* { return alloc(bit_blaster_simplifier, m, p, s); }")
+  ADD_SIMPLIFIER("bit-blast", "reduce bit-vector expressions into SAT.", "alloc(bit_blaster_simplifier, m, p, s)")
 */

src/ast/simplifiers/elim_bounds.h

@@ -43,3 +43,6 @@ public:
     }
 };
 
+/*
+  ADD_SIMPLIFIER("cheap-fourier-motzkin", "eliminate variables from quantifiers using partial Fourier-Motzkin elimination.", "alloc(elim_bounds_simplifier, m, p, s)")
+ */

src/ast/simplifiers/elim_term_ite.h

@@ -49,3 +49,6 @@ public:
     void pop(unsigned n) override { m_rewriter.pop(n); m_df.pop(n); dependent_expr_simplifier::pop(n); }
 };
 
+/*
+  ADD_SIMPLIFIER("elim-term-ite", "eliminate if-then-else term by hoisting them top top-level.", "alloc(elim_term_ite_simplifier, m, p, s)")
+*/

src/ast/simplifiers/pull_nested_quantifiers.h

@@ -46,3 +46,7 @@ public:
 
     bool supports_proofs() const override { return true; }
 };
+
+/*
+  ADD_SIMPLIFIER("pull-nested-quantifiers", "pull nested quantifiers to top-level.", "alloc(pull_nested_quantifiers_simplifier, m, p, s)")
+*/

src/ast/simplifiers/push_ite.h

@@ -64,3 +64,9 @@ public:
     }
 };
 
+/*
+  ADD_SIMPLIFIER("push-app-ite-conservative", "Push functions over if-then else.", "alloc(push_ite_simplifier, m, p, s, true)")
+  ADD_SIMPLIFIER("push-app-ite", "Push functions over if-then else.", "alloc(push_ite_simplifier, m, p, s, false)")
+  ADD_SIMPLIFIER("ng-push-app-ite-conservative", "Push functions over if-then-else within non-ground terms only.", "alloc(ng_push_ite_simplifier, m, p, s, true)")
+  ADD_SIMPLIFIER("ng-push-app-ite", "Push functions over if-then-else within non-ground terms only.", "alloc(ng_push_ite_simplifier, m, p, s, false)")
+*/

src/ast/simplifiers/refine_inj_axiom.h

@@ -42,3 +42,7 @@ public:
         }
     }
 };
+
+/*
+  ADD_SIMPLIFIER("refine-injectivity", "refine injectivity axioms.", "alloc(refine_inj_axiom_simplifier, m, p, s)")
+*/

src/ast/simplifiers/rewriter_simplifier.h

@@ -55,5 +55,5 @@ public:
 };
 
 /*
-  ADD_SIMPLIFIER("simplify", "apply simplification rules.", "[](auto& m, auto& p, auto &s) -> dependent_expr_simplifier* { return alloc(rewriter_simplifier, m, p, s); }")
+  ADD_SIMPLIFIER("simplify", "apply simplification rules.", "alloc(rewriter_simplifier, m, p, s)")
  */