Simon Cruanes
|
dbb9dabd1d
|
simpler printing of models
|
2022-02-02 16:12:11 -05:00 |
|
Simon Cruanes
|
3fdb07b533
|
feat: handle get-model/get-value from smtlib inputs
|
2022-02-02 15:51:44 -05:00 |
|
Simon Cruanes
|
cb369ec68d
|
easier list of known logic
|
2022-01-31 15:28:02 -05:00 |
|
Simon Cruanes
|
3c41ab2484
|
refactor: new term representation for LIA/LRA
|
2022-01-31 15:13:25 -05:00 |
|
Simon Cruanes
|
4b2afd7a05
|
wip: LIA theory
|
2022-01-13 12:55:36 -05:00 |
|
Simon Cruanes
|
8410a57f1a
|
wip: feat(LIA): LIA solver, will rely on LRA solver
we want to reuse the simplex, but do branch and bound + cutting planes
|
2022-01-11 14:00:04 -05:00 |
|
Simon Cruanes
|
2378fc37ac
|
fix LIA->LRA cast operation
|
2022-01-11 14:00:04 -05:00 |
|
Simon Cruanes
|
671fa6515a
|
fix missing conversions
|
2022-01-11 14:00:04 -05:00 |
|
Simon Cruanes
|
3477f39b73
|
fix handling of numeral constants
|
2022-01-11 14:00:04 -05:00 |
|
Simon Cruanes
|
691ff12a01
|
wip: support LIA in input AST and base terms
|
2022-01-11 14:00:03 -05:00 |
|
Simon Cruanes
|
a8a851a7de
|
feat: ability to produce .gz proof files
|
2021-11-10 18:23:26 -05:00 |
|
Simon Cruanes
|
4a30a06f87
|
wip: reconstruct quip proof from binary proof-trace
|
2021-10-26 21:57:17 -04:00 |
|
Simon Cruanes
|
3589592296
|
wip: use real proofs
|
2021-10-16 22:00:29 -04:00 |
|
Simon Cruanes
|
597a6c378e
|
wip: split VecI32 and VecSmallInt
- use VecSmallInt for small integers of type `int`
- use VecI32 to store actual int32 (in particular for proof steps)
|
2021-10-16 20:31:56 -04:00 |
|
Simon Cruanes
|
fd1d068997
|
proof stubs and sat proof
|
2021-10-12 22:13:28 -04:00 |
|
Simon Cruanes
|
e7e8873295
|
fix more warnings
|
2021-08-27 09:28:59 -04:00 |
|
Simon Cruanes
|
e93e084eac
|
refactor: eager proofs; stronger preprocessing
proofs are now directly emitted (almost) everywhere, which simplifies
a lot of things. preprocessing is more recursive (a bit too much
really).
|
2021-08-22 01:13:41 -04:00 |
|
Simon Cruanes
|
1ab7d34a7d
|
refactor: make it compile again
|
2021-08-20 18:18:30 -04:00 |
|
Simon Cruanes
|
9f01b98cde
|
wip: imperative proofs
- getting closer to having the SMT solver compile again
- dummy proof implementation
- DRUP proof implementation for pure SAT solver
|
2021-08-18 23:59:39 -04:00 |
|
Simon Cruanes
|
27e775ee04
|
wip: refactor proofs for SMT
|
2021-08-12 22:05:49 -04:00 |
|
Simon Cruanes
|
5faa1d6ef7
|
chore: try to build again
|
2021-07-18 08:04:56 -04:00 |
|
Simon Cruanes
|
1aa160fe56
|
use a pure sat solver for cnf files
|
2021-07-18 02:46:04 -04:00 |
|
Simon Cruanes
|
2f353cfd94
|
add stat to count number of acyclicity conflicts in datatypes
|
2021-07-04 18:02:48 -04:00 |
|
Simon Cruanes
|
6578ea9136
|
move form to sidekick_base; rename {Term,Ty}.state into store
|
2021-07-03 22:48:44 -04:00 |
|
Simon Cruanes
|
80b50e8744
|
refactor: add solver instance in sidekick base
move some functor instantiations from `sidekick-bin.smtlib` to
`sidekick-base.solver` so they're usable from a library.
|
2021-07-03 22:28:57 -04:00 |
|
Simon Cruanes
|
590f1ef887
|
more cleanup, add doc
|
2021-07-03 21:14:17 -04:00 |
|
Simon Cruanes
|
79bc3def3f
|
refactor to get sidekick-base library
|
2021-07-03 20:20:19 -04:00 |
|
Simon Cruanes
|
2eee760e29
|
refactor(proof): new serialization; faster implem
|
2021-06-11 21:53:13 -04:00 |
|
Simon Cruanes
|
784c1dceee
|
feat(main): -o to dump proof into a file
|
2021-06-11 21:53:13 -04:00 |
|
Simon Cruanes
|
c02da6ce8a
|
feat(proof): progress on preprocessing; proper proofs for th-bool
|
2021-06-11 21:53:12 -04:00 |
|
Simon Cruanes
|
502dce503c
|
refactor(proof): merge proof and lemma, add composite proof constructor
|
2021-06-11 21:51:53 -04:00 |
|
Simon Cruanes
|
22d6786c40
|
refactor(proof): more and better constructs; compile again
|
2021-06-11 21:51:15 -04:00 |
|
Simon Cruanes
|
ff7a87f3fb
|
wip: feat(proof): insert proof constructs in most of sidekick
|
2021-06-11 21:50:25 -04:00 |
|
Simon Cruanes
|
683909c6ef
|
wip: proof printing in sidekick.msat-solver
|
2021-06-11 21:47:54 -04:00 |
|
Simon Cruanes
|
57bf44dfb9
|
feat: basic proof production for QF_UF (wip)
|
2021-06-11 21:47:53 -04:00 |
|
Simon Cruanes
|
8aa851608a
|
fix(data): use a cstor equality rather than is-a for model completion
|
2021-03-29 13:30:13 -04:00 |
|
Simon Cruanes
|
367c1945ef
|
feat(main): handle check-sat-assuming statement
|
2021-03-24 15:31:49 -04:00 |
|
Simon Cruanes
|
3aadb055b6
|
refactor: make proof production lazy
|
2021-03-19 17:26:30 -04:00 |
|
Simon Cruanes
|
2312da883c
|
feat(bool): also provide xor/neq
|
2021-03-18 13:06:44 -04:00 |
|
Simon Cruanes
|
0a14d556d9
|
style
|
2021-03-18 13:06:44 -04:00 |
|
Simon Cruanes
|
791290118b
|
fix(form): make eval rule more precise
|
2021-03-18 12:26:14 -04:00 |
|
Simon Cruanes
|
0d31d9d84e
|
refactor(th-bool): parametrize bool_view by type of lists
use iterator instead of a IArray.t on the view side
|
2021-03-17 18:29:39 -04:00 |
|
Simon Cruanes
|
0aa13ca808
|
refactor: provide a state for Ty.bool in core signature
|
2021-02-24 15:52:54 -05:00 |
|
Simon Cruanes
|
2810312e2f
|
add simplify to LRA
|
2021-02-22 21:10:18 -05:00 |
|
Simon Cruanes
|
04615e4e3d
|
Merge branch 'wip-lra-simplex'
|
2021-02-22 17:13:39 -05:00 |
|
Simon Cruanes
|
cfbd352ca0
|
feat(lra): restore theory combination; improve preprocessing
|
2021-02-16 14:01:21 -05:00 |
|
Simon Cruanes
|
a908f2b3f2
|
feat(arith): integrate simplex2 into sidekick; remove old simplex
|
2021-02-15 16:19:39 -05:00 |
|
Simon Cruanes
|
fafb001934
|
feat: add profiling system based on TEF
- a `Sidekick_util.Profile` module, deps-free
- an optional sidekick.tef library that needs unix+mtime
|
2020-12-22 16:27:45 -05:00 |
|
Simon Cruanes
|
35e5e30e93
|
fix(smtlib): handle "xor"
|
2020-12-22 14:59:21 -05:00 |
|
Simon Cruanes
|
14bb5898f0
|
Merge branch 'wip-fix-lra' into wip-lra-simplex-unsat-core
|
2020-12-22 11:46:09 -05:00 |
|