mirror of
https://github.com/c-cube/sidekick.git
synced 2025-12-06 03:05:31 -05:00
9a5c23d9c5
When the solver finds a SAT result, it sends the whole model to the theory, because maybe it can do something interesting/costly to expand the proof search. After that there must be a check to see if the theory has effectively done something, in which case we should resume proof search, or if nothing has been done, in which case the solver should return that the problem is satisfiable. That check was incorrect before (checking number of assumptions, and if the queue is all caught up), because new learnt clauses (i.e tautologies, which are *not* assumptions) can be added that do not immediately causes propagation, so that the number of assumptions and the element queue is constant, but we should still resume the search. |
||
|---|---|---|
| .. | ||
| smtlib | ||
| .merlin | ||
| either.ml | ||
| either.mli | ||
| hashcons.ml | ||
| hashcons.mli | ||
| hstring.ml | ||
| hstring.mli | ||
| iheap.ml | ||
| iheap.mli | ||
| log.ml | ||
| log.mli | ||
| log_dummy.ml | ||
| log_real.ml | ||
| parsedimacs.ml | ||
| parsedimacs.mli | ||
| sparse_vec.ml | ||
| sparse_vec.mli | ||
| vec.ml | ||
| vec.mli | ||