You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: RELEASE_NOTES.md
+4-1
Original file line number
Diff line number
Diff line change
@@ -9,7 +9,6 @@ Version 4.next
9
9
- polysat
10
10
- native word level bit-vector solving.
11
11
- introduction of simple induction lemmas to handle a limited repertoire of induction proofs.
12
-
- Light quantifier elimination based on term graphs (egraphs), and corresponding Model Based Projection for arrays and ADTs. Used by Spacer and QSAT.
13
12
14
13
Version 4.12.3
15
14
==============
@@ -23,6 +22,10 @@ Version 4.12.3
23
22
- Various (ongoing) performance fixes and improvements to smt.arith.solver=6
24
23
- A working version of solver.proof.trim=true option. Proofs logs created when using sat.smt=true may be trimmed by running z3
25
24
on the generated proof log using the option solver.proof.trim=true.
25
+
- Optimizations LIA and NIA (linear integer arithmetic and non-linear integer (and real) arithmetic reasoning).
26
+
smt.arith.solver=6 is the default for most use cases. It trails smt.arith.solver=2 in some scenarios and the gap has been either removed or reduced.
27
+
smt.arith.solver=6 is complete for integrations of non-linear real arithmetic and theories, smt.arith.solver=2 is not.
28
+
- qel: Light quantifier elimination based on term graphs (egraphs), and corresponding Model Based Projection for arrays and ADTs. Used by Spacer and QSAT.
0 commit comments