Commit graph

110 commits

Author SHA1 Message Date
Simon Cruanes
e3e71f3d76
refactor: smtlib driver now part of base; make it stateful 2022-10-10 14:28:43 -04:00
Simon Cruanes
e74439cf2a
wip: new attempt at theory combination 2022-09-01 22:34:27 -04:00
Simon Cruanes
52b60c4114
fix(main): method for measuring memory overhead was wrong 2022-08-31 00:47:11 -04:00
Simon Cruanes
5feb5d8e73
refactor: new API for combination, with theories claiming terms
interface variables are terms claimed by >= 2 theories. Theories now
have a unique ID attributed at their creation.
2022-08-27 22:51:16 -04:00
Simon Cruanes
5f91d0bd76
fix spurious \r 2022-08-27 12:36:45 -04:00
Simon Cruanes
f0041f9dae
feat: reinstate LRA theory and terms 2022-08-26 22:17:02 -04:00
Simon Cruanes
e66a27229b
detail in printing 2022-08-26 22:16:45 -04:00
Simon Cruanes
dff65c5d26
refactor: Term.abs takes store again, so abs false can be false,true 2022-08-22 22:12:26 -04:00
Simon Cruanes
e0faf6ba72
feat: some spans in main/process 2022-08-20 00:21:45 -04:00
Simon Cruanes
27ccd367b2
fix output so benchpress can parse it 2022-08-16 23:34:08 -04:00
Simon Cruanes
b23a031519
fix: time measurements were wrong 2022-08-16 21:45:16 -04:00
Simon Cruanes
57941a952a
add th-bool-dyn for dynamic boolean clausification 2022-08-16 21:30:17 -04:00
Simon Cruanes
2ab93aee04
feat(main): fix initial time; better display (smtlib-friendly) 2022-08-14 23:21:02 -04:00
Simon Cruanes
517a5d2e5f
better tracing 2022-08-13 13:55:01 -04:00
Simon Cruanes
d14617ca77
refactor: rush to have sidekick compile again. th-lra is commented out 2022-08-10 22:08:57 -04:00
Simon Cruanes
95dcb0ae74
wip: refactor further 2022-08-09 22:41:13 -04:00
Simon Cruanes
fc5ce9bf87
wip: make it compile 2022-08-08 21:52:47 -04:00
Simon Cruanes
f3f0628261
large refactor with signature splitting, events, etc. 2022-07-18 23:20:07 -04:00
Simon Cruanes
00dec7ced8
remove iarray 2022-07-15 21:06:46 -04:00
Simon Cruanes
a1bc186d2e
use ocamlformat 2022-07-14 22:09:13 -04:00
Simon Cruanes
e2b9b2874c
fix more warnings; remove never completed LIA stuff 2022-07-14 22:01:23 -04:00
Simon Cruanes
fd500a3d7d
fix some warnings 2022-07-14 21:56:37 -04:00
Simon Cruanes
52cae96ee2
improve progress bar and printingof stat after timeout 2022-02-18 14:59:25 -05:00
Simon Cruanes
20791a551f
feat: enforce time/memory limits in main runner 2022-02-17 13:09:48 -05:00
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
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
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
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
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
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
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