Simon Cruanes
|
342dba4533
|
wip: new micro-theories in CC
|
2019-02-26 22:46:40 -06:00 |
|
Simon Cruanes
|
1f68753121
|
refactor: remove proof printing code
|
2019-02-16 13:38:54 -06:00 |
|
Simon Cruanes
|
5865151247
|
refactor: return optional proof, do not store if if -no-check was given
|
2019-02-10 16:59:27 -06:00 |
|
Simon Cruanes
|
a463dbb4b5
|
feat(cc): split sub-library sidekick.cc, make it fully functorized
|
2019-02-09 21:57:20 -06:00 |
|
Simon Cruanes
|
a57fdcdeda
|
refactor: use msat 0.8
|
2019-02-01 20:57:44 -06:00 |
|
Simon Cruanes
|
27d1841f6b
|
wip: migrate to msat 0.8
|
2019-01-28 21:09:57 -06:00 |
|
Simon Cruanes
|
c2d79b2e6a
|
fix(main): properly handle option no-restarts
|
2018-08-18 18:05:22 -05:00 |
|
Simon Cruanes
|
fade033458
|
refactor: get SAT properly again on some problems
|
2018-05-20 14:30:36 -05:00 |
|
Simon Cruanes
|
3968688a35
|
large refactor of SAT solver, all internal code in Internal now
|
2018-05-09 22:47:21 -05:00 |
|
Simon Cruanes
|
24bbe97ceb
|
rename to sidekick
|
2018-05-09 19:28:41 -05:00 |
|
Simon Cruanes
|
543f8a5a99
|
add distinct handling to congruence closure
|
2018-02-23 00:44:23 -06:00 |
|
Simon Cruanes
|
d53bd8671a
|
lower overhead for adding clauses to the SAT solver
- directly build clauses from arrays
- use IArrays rather than lists, when possible
- pushing local/persistent clauses is now direct, no more queues
|
2018-02-19 19:47:03 -06:00 |
|
Simon Cruanes
|
7b44146102
|
make it compile! with stubs for conversion parse ast -> ast -> term
|
2018-02-08 22:19:32 -06:00 |
|
Simon Cruanes
|
d73684902f
|
wip: have a proper smtlib parser
|
2018-02-05 23:09:29 -06:00 |
|
Simon Cruanes
|
221ed7dcdb
|
continue large refactoring, progress in theory combination
- first draft of theory combination
- theory interface
- have the project compile
|
2018-02-01 22:53:06 -06:00 |
|