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
|
e3aa43f817
|
cleanup
|
2022-08-27 20:39:06 -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
|
dff65c5d26
|
refactor: Term.abs takes store again, so abs false can be false,true
|
2022-08-22 22:12:26 -04:00 |
|
Simon Cruanes
|
65f8a61913
|
feat(pure-sat): correct timing printing
|
2022-08-21 13:52:33 -04:00 |
|
Simon Cruanes
|
e0faf6ba72
|
feat: some spans in main/process
|
2022-08-20 00:21:45 -04:00 |
|
Simon Cruanes
|
57941a952a
|
add th-bool-dyn for dynamic boolean clausification
|
2022-08-16 21:30:17 -04:00 |
|
Simon Cruanes
|
63802fe3d6
|
feat(stat): improve printing api
|
2022-08-13 13:45:31 -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
|
f3f0628261
|
large refactor with signature splitting, events, etc.
|
2022-07-18 23:20:07 -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
|
f26d178380
|
feat(main): catch ctrl-c to cleanup
this allows us to cleanup progress bar, print stats, finish tracing,
etc.
|
2022-02-18 14:59:26 -05: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
|
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
|
4ac2eb25a6
|
use TEF in sudoku; improve a bit its ergonomics
|
2021-12-07 21:29:51 -05:00 |
|
Simon Cruanes
|
8ac2267595
|
add a simple binary to dump proof traces
|
2021-10-21 20:33:10 -04:00 |
|
Simon Cruanes
|
63e7d6659e
|
wip: dump more steps to the trace file
|
2021-10-20 20:41:51 -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
|
2f41a54719
|
feat(main): for pure SAT, emit proofs into file or locally
|
2021-08-23 00:10:34 -04:00 |
|
Simon Cruanes
|
baecce0946
|
feat: use Stat in SAT solver
|
2021-08-22 01:56:54 -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
|
22638a0c0b
|
tmp: use dummy proof in pure sat solver
|
2021-08-20 18:49:15 -04:00 |
|
Simon Cruanes
|
1ab7d34a7d
|
refactor: make it compile again
|
2021-08-20 18:18:30 -04:00 |
|
Simon Cruanes
|
8bc1f1c864
|
feat: inner DRUP proof checking for pure-sat-solver
|
2021-08-19 00:15:00 -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
|
458f5fa9b6
|
finish renaming
|
2021-08-18 00:03:16 -04:00 |
|
Simon Cruanes
|
bef0c810d3
|
wip: trace checking
- continue Drup checker
- create sidekick-bin.lib to share parsers
- parse problem+proof for sidekick-check
|
2021-08-07 18:10:42 -04:00 |
|
Simon Cruanes
|
971ae74ecc
|
perf: compile only in native
|
2021-08-05 10:53:46 -04:00 |
|
Simon Cruanes
|
e6fc7e7357
|
feat(sat): produce DRUP proofs if asked to
|
2021-08-02 23:48:52 -04:00 |
|
Simon Cruanes
|
a205c429e7
|
feat(sat): check proofs if asked to
|
2021-08-02 23:14:52 -04:00 |
|
Simon Cruanes
|
515a720d00
|
detail
|
2021-07-22 09:57:53 -04:00 |
|
Simon Cruanes
|
a174e5958a
|
more stats for main
|
2021-07-21 20:24:27 -04:00 |
|
Simon Cruanes
|
f2b2bbb973
|
some stats for the SAT solver
|
2021-07-19 21:44:58 -04:00 |
|
Simon Cruanes
|
97aab34e46
|
statistics for pure sat solver
|
2021-07-19 09:57:02 -04:00 |
|
Simon Cruanes
|
c7bf4b01e7
|
feat: optional memtrace support
|
2021-07-18 10:29:14 -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
|
564dcec252
|
cleanup msat, rename it sidekick.sat
|
2021-07-18 01:40:55 -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
|
57bf44dfb9
|
feat: basic proof production for QF_UF (wip)
|
2021-06-11 21:47:53 -04:00 |
|
Simon Cruanes
|
367c1945ef
|
feat(main): handle check-sat-assuming statement
|
2021-03-24 15:31:49 -04:00 |
|
Simon Cruanes
|
0aa13ca808
|
refactor: provide a state for Ty.bool in core signature
|
2021-02-24 15:52:54 -05:00 |
|