7 commits

Author	SHA1	Message	Date
Guillaume Bury	9a5c23d9c5	[bugfix] termination check after full slice was wrong ... 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.	2016-03-04 16:30:51 +01:00
Simon Cruanes	2fe5be8317	update Log interface, with real/dummy implementation ... - `make disable_log` to use the dummy - `make enable_log` to use the real one (slower)	2016-01-20 21:04:44 +01:00
Guillaume Bury	bbbd407631	Res now includes solver type	2015-10-02 13:30:32 +02:00
Simon Cruanes	3443e2b8dc	optimization in Log.debug	2014-11-04 20:42:43 +01:00
Simon Cruanes	30e372d302	moved vec, iheap, etc. from common/ to util/; ... removed dependency of util/ on unix,str	2014-11-04 20:25:26 +01:00
Guillaume Bury	8d95cecba4	Correct indentation.	2014-11-01 17:17:50 +01:00
Guillaume Bury	7a8a6d0de1	Few fixes. Sat Solver is working.	2014-11-01 16:31:19 +01:00