Nuno Lopes
|
8061765574
|
remove default destructors & some default constructors
Another ~700 KB reduction in binary size
|
2024-09-04 22:30:23 +01:00 |
|
Nikolaj Bjorner
|
107981f099
|
update proof formats for new core
- update proof format for quantifier instantiation to track original literals
- update proof replay tools with ability to extract proof object
The formats and features are subject to heavy revisions.
Example
```
(set-option :sat.euf true)
(set-option :sat.smt.proof eufproof.smt2)
(declare-fun f (Int) Int)
(declare-const x Int)
(assert (or (= (f (f (f x))) x) (= (f (f x)) x)))
(assert (not (= (f (f (f (f (f (f x)))))) x)))
(check-sat)
```
eufproof.smt2 is:
```
(declare-fun x () Int)
(declare-fun f (Int) Int)
(define-const $24 Int (f x))
(define-const $25 Int (f $24))
(define-const $26 Int (f $25))
(define-const $27 Bool (= $26 x))
(define-const $28 Bool (= $25 x))
(assume $27 $28)
(define-const $30 Int (f $26))
(define-const $31 Int (f $30))
(define-const $32 Int (f $31))
(define-const $33 Bool (= $32 x))
(assume (not $33))
(declare-fun rup () Proof)
(infer (not $33) rup)
(declare-fun euf (Bool Bool Proof Proof Proof Proof) Proof)
(declare-fun cc (Bool) Proof)
(define-const $42 Bool (= $32 $30))
(define-const $43 Proof (cc $42))
(define-const $40 Bool (= $31 $24))
(define-const $41 Proof (cc $40))
(define-const $38 Bool (= $30 $25))
(define-const $39 Proof (cc $38))
(define-const $36 Bool (= $24 $26))
(define-const $37 Proof (cc $36))
(define-const $34 Bool (not $33))
(define-const $44 Proof (euf $34 $28 $37 $39 $41 $43))
(infer (not $28) $33 $44)
(infer (not $28) rup)
(infer $27 rup)
(declare-fun euf (Bool Bool Proof Proof Proof) Proof)
(define-const $49 Bool (= $32 $26))
(define-const $50 Proof (cc $49))
(define-const $47 Bool (= $31 $25))
(define-const $48 Proof (cc $47))
(define-const $45 Bool (= $24 $30))
(define-const $46 Proof (cc $45))
(define-const $51 Proof (euf $34 $27 $46 $48 $50))
(infer $33 $51)
(infer rup)
```
Example of inspecting proof from Python:
```
from z3 import *
def parse(file):
s = Solver()
set_option("solver.proof.save", True)
set_option("solver.proof.check", False)
s.from_file(file)
for step in s.proof().children():
print(step)
parse("../eufproof.smt2")
```
Proof checking (self-validation) is on by default.
Proof saving is off by default.
You can use the proof logs and the proof terms to retrieve quantifier instantiations from the new core.
The self-checker contains a few built-in tuned checkers but falls back to self-checking inferred clauses using SMT.
|
2022-09-28 10:40:43 -07:00 |
|
Nikolaj Bjorner
|
d0e20e44ff
|
booyah
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
|
2020-07-04 15:56:30 -07:00 |
|
Nikolaj Bjorner
|
e67112f289
|
NYI control paths
|
2020-04-28 20:19:20 -07:00 |
|
Nikolaj Bjorner
|
498864c582
|
adding dump facility for cancelation #2095, easing dimacs in/out
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
|
2019-01-24 12:21:23 -08:00 |
|
Nikolaj Bjorner
|
bfeb15b876
|
move to list of clauses
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
|
2018-06-14 16:08:50 -07:00 |
|
Arie Gurfinkel
|
26339119e4
|
solver::check_sat_cc : check_sat assuming cube and clause
Extends check_sat with an ability to assume a single clause in
addition to assuming a cube of assumptions
|
2018-06-14 16:08:50 -07:00 |
|
Nikolaj Bjorner
|
c513f3ca09
|
merge with master
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
|
2018-03-25 14:57:01 -07:00 |
|
Bruce Mitchener
|
b7d1753843
|
Use override rather than virtual.
|
2018-02-09 21:19:27 +07:00 |
|
Nikolaj Bjorner
|
fa0c75e76e
|
rename to core2 to avoid overloaded virtual
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
|
2018-02-07 15:13:13 -08:00 |
|
Nikolaj Bjorner
|
5a8154c156
|
fix errors
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
|
2018-02-07 14:47:16 -08:00 |
|
Nikolaj Bjorner
|
0d15b6abb7
|
add stubs for converting assertions, consolidate filter_model_converter
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
|
2017-11-17 14:51:13 -08:00 |
|
Nikolaj Bjorner
|
b19f94ae5b
|
make include paths uniformly use path relative to src. #534
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
|
2017-07-31 13:24:11 -07:00 |
|
Nikolaj Bjorner
|
8d2b70a5e2
|
better encodings for at-most-1, #755
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
|
2016-10-10 23:46:03 -07:00 |
|
Nikolaj Bjorner
|
8221a09659
|
fast path for antecedent extraction in smt_context
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
|
2016-07-28 16:49:19 -07:00 |
|
Nikolaj Bjorner
|
c72ed3e6b4
|
update core minimization code
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
|
2016-06-23 21:39:28 -07:00 |
|
Nikolaj Bjorner
|
3d7eb12117
|
tracking use of assumptions in tactics
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
|
2016-03-09 21:33:08 -08:00 |
|
Nikolaj Bjorner
|
4bc044c982
|
update header guards to be C++ style. Fixes issue #9
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
|
2015-07-08 23:18:40 -07:00 |
|
Christoph M. Wintersteiger
|
9b137d54d3
|
Bugfix and new examples for implicit assumptions in Z3_solver_assert_and_track. Thanks to Amir Ebrahimi for reporting this issue!
(See http://stackoverflow.com/questions/28558683/modeling-constraints-in-z3-and-unsat-core-cases)
Signed-off-by: Christoph M. Wintersteiger <cwinter@microsoft.com>
|
2015-02-18 16:25:27 +00:00 |
|
Leonardo de Moura
|
8198e62cbd
|
solver factories, cleanup solver API, simplified strategic solver, added combined solver
Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>
|
2012-12-11 17:47:27 -08:00 |
|
Leonardo de Moura
|
d545f187f8
|
working on named assertions support
Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>
|
2012-11-02 08:28:34 -07:00 |
|