mirror of
https://github.com/Z3Prover/z3
synced 2025-06-06 14:13:23 +00:00
na
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
commit
e1224e116f
2 changed files with 0 additions and 9 deletions
|
@ -284,22 +284,16 @@ namespace polysat {
|
||||||
if (fi.perform(s, v, cjust_v, *this))
|
if (fi.perform(s, v, cjust_v, *this))
|
||||||
return true;
|
return true;
|
||||||
}
|
}
|
||||||
|
|
||||||
std::cout << "vars " << m_vars << " contains: " << m_vars.contains(v) << "\n";
|
|
||||||
|
|
||||||
m_vars.remove(v);
|
m_vars.remove(v);
|
||||||
|
|
||||||
for (auto c : cjust_v)
|
for (auto c : cjust_v)
|
||||||
insert(c);
|
insert(c);
|
||||||
|
|
||||||
std::cout << "try explain v" << v << "\n";
|
|
||||||
|
|
||||||
for (auto* engine : ex_engines)
|
for (auto* engine : ex_engines)
|
||||||
if (engine->try_explain(v, *this))
|
if (engine->try_explain(v, *this))
|
||||||
return true;
|
return true;
|
||||||
|
|
||||||
std::cout << "try elim v" << v << "\n";
|
|
||||||
|
|
||||||
// No value resolution method was successful => fall back to saturation and variable elimination
|
// No value resolution method was successful => fall back to saturation and variable elimination
|
||||||
while (s.inc()) {
|
while (s.inc()) {
|
||||||
// TODO: as a last resort, substitute v by m_value[v]?
|
// TODO: as a last resort, substitute v by m_value[v]?
|
||||||
|
@ -311,7 +305,6 @@ namespace polysat {
|
||||||
set_bailout();
|
set_bailout();
|
||||||
if (s.is_assigned(v))
|
if (s.is_assigned(v))
|
||||||
m_vars.insert(v);
|
m_vars.insert(v);
|
||||||
std::cout << "vars " << m_vars << "\n";
|
|
||||||
return false;
|
return false;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
|
@ -192,7 +192,6 @@ namespace polysat {
|
||||||
|
|
||||||
bool solver::propagate(sat::literal lit, clause& cl) {
|
bool solver::propagate(sat::literal lit, clause& cl) {
|
||||||
SASSERT(cl.size() >= 2);
|
SASSERT(cl.size() >= 2);
|
||||||
std::cout << lit << ": " << cl << "\n";
|
|
||||||
unsigned idx = cl[0] == ~lit ? 1 : 0;
|
unsigned idx = cl[0] == ~lit ? 1 : 0;
|
||||||
SASSERT(cl[1 - idx] == ~lit);
|
SASSERT(cl[1 - idx] == ~lit);
|
||||||
if (m_bvars.is_true(cl[idx]))
|
if (m_bvars.is_true(cl[idx]))
|
||||||
|
@ -623,7 +622,6 @@ namespace polysat {
|
||||||
|
|
||||||
clause_builder reason_builder = m_conflict.build_lemma();
|
clause_builder reason_builder = m_conflict.build_lemma();
|
||||||
SASSERT(std::find(reason_builder.begin(), reason_builder.end(), ~lit));
|
SASSERT(std::find(reason_builder.begin(), reason_builder.end(), ~lit));
|
||||||
|
|
||||||
clause_ref reason = reason_builder.build();
|
clause_ref reason = reason_builder.build();
|
||||||
|
|
||||||
if (reason->empty()) {
|
if (reason->empty()) {
|
||||||
|
|
Loading…
Add table
Add a link
Reference in a new issue