mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-23 17:15:31 +00:00
Code Activity

na

Browse source 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
Nikolaj Bjorner 2021-09-28 16:45:03 -07:00
commit e1224e116f
2 changed files with 0 additions and 9 deletions
Download patch file Download diff file Expand all files Collapse all files

7
src/math/polysat/conflict.cpp
View file

@ -284,22 +284,16 @@ namespace polysat {
if (fi.perform(s, v, cjust_v, *this))
return true;
}
std::cout << "vars " << m_vars << " contains: " << m_vars.contains(v) << "\n";
m_vars.remove(v);
for (auto c : cjust_v)
insert(c);
std::cout << "try explain v" << v << "\n";
for (auto* engine : ex_engines)
if (engine->try_explain(v, *this))
return true;
std::cout << "try elim v" << v << "\n";
// No value resolution method was successful => fall back to saturation and variable elimination
while (s.inc()) {
// TODO: as a last resort, substitute v by m_value[v]?
@ -311,7 +305,6 @@ namespace polysat {
set_bailout();
if (s.is_assigned(v))
m_vars.insert(v);
std::cout << "vars " << m_vars << "\n";
return false;
}

2
src/math/polysat/solver.cpp
View file

@ -192,7 +192,6 @@ namespace polysat {
bool solver::propagate(sat::literal lit, clause& cl) {
SASSERT(cl.size() >= 2);
std::cout << lit << ": " << cl << "\n";
unsigned idx = cl[0] == ~lit ? 1 : 0;
SASSERT(cl[1 - idx] == ~lit);
if (m_bvars.is_true(cl[idx]))
@ -623,7 +622,6 @@ namespace polysat {
clause_builder reason_builder = m_conflict.build_lemma();
SASSERT(std::find(reason_builder.begin(), reason_builder.end(), ~lit));
clause_ref reason = reason_builder.build();
if (reason->empty()) {