mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-07-23 04:38:53 +00:00
Code Activity

less output

Browse source
This commit is contained in:
Jakob Rath 2022-10-07 10:10:44 +02:00
parent f184545aca
commit af368b39c9
3 changed files with 9 additions and 8 deletions
Download patch file Download diff file Expand all files Collapse all files

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

@ -1012,7 +1012,7 @@ namespace polysat {
/// Deactivate constraint /// Deactivate constraint
void solver::deactivate_constraint(signed_constraint c) { void solver::deactivate_constraint(signed_constraint c) {
LOG("Deactivating constraint: " << c.blit()); LOG_V("Deactivating constraint: " << c.blit());
c->set_active(false); c->set_active(false);
} }
@ -1023,7 +1023,7 @@ namespace polysat {
} }
} }
// Add lemma to storage // Add clause to storage
void solver::add_clause(clause& clause) { void solver::add_clause(clause& clause) {
LOG((clause.is_redundant() ? "Lemma: ": "Aux: ") << clause); LOG((clause.is_redundant() ? "Lemma: ": "Aux: ") << clause);
for (sat::literal lit : clause) { for (sat::literal lit : clause) {

5
src/math/polysat/solver.h
View file

@ -17,7 +17,6 @@ Author:
--*/ --*/
#pragma once #pragma once
#include <limits>
#include "util/statistics.h" #include "util/statistics.h"
#include "util/params.h" #include "util/params.h"
#include "math/polysat/boolean.h" #include "math/polysat/boolean.h"
@ -35,6 +34,8 @@ Author:
#include "math/polysat/trail.h" #include "math/polysat/trail.h"
#include "math/polysat/viable.h" #include "math/polysat/viable.h"
#include "math/polysat/log.h" #include "math/polysat/log.h"
#include <limits>
#include <optional>
namespace polysat { namespace polysat {
@ -222,7 +223,7 @@ namespace polysat {
void report_unsat(); void report_unsat();
void learn_lemma(clause& lemma); void learn_lemma(clause& lemma);
void backjump(unsigned new_level); void backjump(unsigned new_level);
void add_clause(clause& lemma); void add_clause(clause& clause);
void add_clause(signed_constraint c1, signed_constraint c2, bool is_redundant); void add_clause(signed_constraint c1, signed_constraint c2, bool is_redundant);
void add_clause(signed_constraint c1, signed_constraint c2, signed_constraint c3, bool is_redundant); void add_clause(signed_constraint c1, signed_constraint c2, signed_constraint c3, bool is_redundant);
void add_clause(signed_constraint c1, signed_constraint c2, signed_constraint c3, signed_constraint c4, bool is_redundant); void add_clause(signed_constraint c1, signed_constraint c2, signed_constraint c3, signed_constraint c4, bool is_redundant);

8
src/sat/smt/bv_polysat.cpp
View file

@ -273,8 +273,8 @@ namespace bv {
pdd p = m_polysat.var(pv); pdd p = m_polysat.var(pv);
polysat_set(v, p); polysat_set(v, p);
#ifndef NDEBUG #ifndef NDEBUG
expr* e = var2enode(v)->get_expr(); // expr* e = var2enode(v)->get_expr();
std::cerr << "var2pdd: " << mk_ismt2_pp(e, m) << " -> " << p << std::endl; // std::cerr << "var2pdd: " << mk_ismt2_pp(e, m) << " -> " << p << std::endl;
#endif #endif
return p; return p;
} }
@ -303,8 +303,8 @@ namespace bv {
ctx.push(set_bitvector_trail(m_var2pdd_valid, v)); ctx.push(set_bitvector_trail(m_var2pdd_valid, v));
m_var2pdd[v] = p; m_var2pdd[v] = p;
#ifndef NDEBUG #ifndef NDEBUG
expr* e = var2enode(v)->get_expr(); // expr* e = var2enode(v)->get_expr();
std::cerr << "polysat_set: " << mk_ismt2_pp(e, m) << " -> " << p << std::endl; // std::cerr << "polysat_set: " << mk_ismt2_pp(e, m) << " -> " << p << std::endl;
#endif #endif
} }