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
|
28ad97d2b7
|
fix: typecheck issue
|
2022-08-27 23:42:19 -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
|
97a5c8efa3
|
detail
|
2022-08-07 22:42:35 -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
|
98c30bf0cc
|
updates and cleanup
|
2022-02-14 10:46:08 -05:00 |
|
Simon Cruanes
|
1d702029ee
|
fix(typecheck): use logic to decide default type of numerals
|
2022-02-08 13:12:29 -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
|
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 |
|