Commit graph

93 commits

Author SHA1 Message Date
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
Simon Cruanes
9ddce6a186 feat(check-cc): add statistics 2019-10-30 13:31:04 -05:00
Simon Cruanes
7d8589accd refactor: change the functor stack 2019-10-29 15:06:19 -05:00
Simon Cruanes
0031c64ea9 feat(th-bool-static): check for new terms in the CC in final check 2019-10-08 09:08:05 -05:00
Simon Cruanes
49a7446631 feat(th-bool-static): add non-traversable opaque boolean term 2019-10-05 18:37:49 -05:00
Simon Cruanes
238226500a feat: add is_valid_literal filter to add_term_rec 2019-10-02 18:15:06 -05:00
Simon Cruanes
769b80030a feat: progress bar in solver 2019-07-31 04:36:32 -05:00
Simon Cruanes
d527b2b945 fix: remove some module aliases for 4.08 2019-07-31 03:25:04 -05:00
Simon Cruanes
38f001b0e7 refactor: move Lit inside the solver, as output, not input 2019-06-07 17:31:11 -05:00
Simon Cruanes
12ea0c3be4 feat: check propagations if --check is passed 2019-06-07 14:58:46 -05:00
Simon Cruanes
357dc73426 feat(check): use mini-cc to check CC conflicts on the fly 2019-06-07 14:47:52 -05:00
Simon Cruanes
cad49b3747 wip: preprocess/simplify as part of theories 2019-06-06 17:13:21 -05:00
Simon Cruanes
19d65b4069 remove dimacs stuff 2019-06-06 10:45:47 -05:00
Simon Cruanes
2e7ab9ba9b wip: simplify a lot and only keep th-bool-static in the functor 2019-06-05 16:53:13 -05:00
Simon Cruanes
fadf76d944 chore: migrate from sequence to iter 2019-03-22 19:43:05 -05:00
Simon Cruanes
431988d5e4 feat: more expressive theories, also plug distinct in 2019-03-09 16:15:24 -06:00
Simon Cruanes
342dba4533 wip: new micro-theories in CC 2019-02-26 22:46:40 -06:00
Simon Cruanes
3873718174 refactor: require state in Lit.atom, and in Term.abs
allows abs(false)=true
2019-02-16 17:43:49 -06:00
Simon Cruanes
e878907f4b refactor(bool): bool-view of terms, functorized theory 2019-02-16 14:49:00 -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
431d8fe4ac small style change 2019-02-09 16:17:15 -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
9ac274fc09 refactor: simplify literals; remove useless casts in CC; bit for pending nodes 2018-06-22 19:38:04 -05:00
Simon Cruanes
c8ca60461a fix: typo in Th_bool 2018-06-16 20:47:23 -05:00
Simon Cruanes
080cde778e feat(model): proper model construction for CC + fun interpretation 2018-06-11 21:42:02 -05:00
Simon Cruanes
04f25779fa refactor(term): much simpler term model, without builtins or typeclass
just use a few custom functions in `Cst.t`
2018-05-25 23:45:15 -05:00
Simon Cruanes
fade033458 refactor: get SAT properly again on some problems 2018-05-20 14:30:36 -05:00
Simon Cruanes
24bbe97ceb rename to sidekick 2018-05-09 19:28:41 -05:00
Simon Cruanes
d19b798ee9 add ability to parse and process dimacs files 2018-04-11 19:57:51 -05: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
2fcef323b3 move back process to dagon_smtlib 2018-02-11 10:47:47 -06:00
Renamed from src/smt/Process.ml (Browse further)