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 |
|
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
|
14bb5898f0
|
Merge branch 'wip-fix-lra' into wip-lra-simplex-unsat-core
|
2020-12-22 11:46:09 -05:00 |
|
Simon Cruanes
|
db1c50f7ed
|
feat(LRA): expose model after fourier-motzkin returns "SAT"
|
2020-11-17 16:52:49 -05:00 |
|
Simon Cruanes
|
5ff0fff85b
|
wip: refactor(lra): import Simplex from funarith, replace FM with it
|
2020-11-13 22:35:59 -05:00 |
|
Simon Cruanes
|
534fc45783
|
wip: better progress bar
|
2020-10-11 23:30:22 -04:00 |
|
Simon Cruanes
|
349d884664
|
chore: add sidekick-arith library, depends on zarith
|
2020-10-10 17:18:20 -04:00 |
|
Simon Cruanes
|
fabdb27dfe
|
wip: feat(lra): preprocess by renaming lits/terms and storing defs
|
2020-10-04 21:37:03 -04:00 |
|
Simon Cruanes
|
ac6ca7d584
|
wip: properly typecheck and build LRA terms
|
2020-10-04 00:32:52 -04:00 |
|
Simon Cruanes
|
943efad206
|
feat: add AST for LRA
|
2020-10-03 23:46:45 -04:00 |
|
Simon Cruanes
|
f59a5d9fce
|
wip
|
2020-09-23 21:59:33 -04:00 |
|
Simon Cruanes
|
aff2e29a6b
|
wip: representing real types and values
|
2020-09-23 21:59:29 -04:00 |
|
Simon Cruanes
|
4f12bfdb93
|
wip: LRA
|
2020-09-23 21:58:54 -04:00 |
|
Simon Cruanes
|
40d47a8d6c
|
wip: lra
|
2020-09-23 21:58:54 -04:00 |
|
Simon Cruanes
|
e21dea4780
|
feat(cc): flag some explanations as being theory-induced
|
2020-01-17 18:49:14 -06:00 |
|
Simon Cruanes
|
a31b2b36ef
|
fixes: add missing expl in monoids; handle is-c t
|
2020-01-14 22:41:33 -06:00 |
|
Simon Cruanes
|
e58b29da02
|
fix(term): hashconsing error leading to non termination
|
2019-12-28 08:49:14 -06:00 |
|
Simon Cruanes
|
7c951c08ff
|
wip: use t=c instead of (is _ c) t for nullary constructors
|
2019-12-28 05:17:47 -06:00 |
|
Simon Cruanes
|
444a0b9f85
|
wip: theory of datatypes
|
2019-12-28 05:17:47 -06:00 |
|
Simon Cruanes
|
8c5e28da28
|
wip: theory of datatypes
|
2019-12-28 05:17:47 -06:00 |
|
Simon Cruanes
|
949e079867
|
wip: add datatypes
|
2019-12-28 05:17:47 -06:00 |
|
Simon Cruanes
|
10cfa137b6
|
feat: handle parsing of .cnf files
|
2019-11-23 13:41:03 -06:00 |
|
Simon Cruanes
|
9b99560130
|
feat: handle typechecking and term building for datatypes
|
2019-11-23 13:23:30 -06:00 |
|
Simon Cruanes
|
3327c86841
|
refactor(smtlib): remove intermediate typed AST, type directly into terms
|
2019-11-23 13:23:30 -06:00 |
|