20 #include <core/Solver.h>
21 #include <simp/SimpSolver.h>
24 #error "Expected HAVE_GLUCOSE"
27 void convert(
const bvt &bv, Glucose::vec<Glucose::Lit> &dest)
29 dest.capacity(bv.size());
31 for(
const auto &literal : bv)
33 if(!literal.is_false())
34 dest.push(Glucose::mkLit(literal.var_no(), literal.sign()));
76 catch(Glucose::OutOfMemoryException)
78 log.error() <<
"SAT checker ran out of memory" <<
messaget::eom;
79 status = statust::ERROR;
80 throw std::bad_alloc();
86 return "Glucose Syrup without simplifier";
91 return "Glucose Syrup with simplifier";
97 while((
unsigned)
solver->nVars()<no_variables())
108 for(
const auto &literal : bv)
110 if(literal.is_true())
112 else if(!literal.is_false())
115 literal.var_no() < (
unsigned)
solver->nVars(),
116 "variable not added yet");
120 Glucose::vec<Glucose::Lit> c;
136 static size_t cnf_clause_index = 0;
138 bool clause_removed = process_clause(bv, cnf);
148 catch(Glucose::OutOfMemoryException)
150 log.error() <<
"SAT checker ran out of memory" <<
messaget::eom;
151 status = statust::ERROR;
152 throw std::bad_alloc();
156 template <
typename T>
162 log.statistics() << (no_variables() - 1) <<
" variables, "
171 log.status() <<
"SAT checker inconsistent: instance is UNSATISFIABLE"
177 bool has_false =
false;
179 for(
const auto &literal : assumptions)
181 if(literal.is_false())
187 log.status() <<
"got FALSE as assumption: instance is UNSATISFIABLE"
192 Glucose::vec<Glucose::Lit> solver_assumptions;
193 convert(assumptions, solver_assumptions);
195 if(
solver->solve(solver_assumptions))
197 log.status() <<
"SAT checker: instance is SATISFIABLE"
199 status = statust::SAT;
200 return resultt::P_SATISFIABLE;
204 log.status() <<
"SAT checker: instance is UNSATISFIABLE"
210 status = statust::UNSAT;
211 return resultt::P_UNSATISFIABLE;
213 catch(Glucose::OutOfMemoryException)
215 log.error() <<
"SAT checker ran out of memory" <<
messaget::eom;
216 status = statust::ERROR;
217 throw std::bad_alloc();
229 bool sign = a.
sign();
232 solver->model.growTo(v + 1);
234 solver->model[v] = Glucose::lbool(value);
236 catch(Glucose::OutOfMemoryException)
238 log.error() <<
"SAT checker ran out of memory" <<
messaget::eom;
239 status = statust::ERROR;
240 throw std::bad_alloc();
244 template <
typename T>
269 for(
int i=0; i<
solver->conflict.size(); i++)
270 if(var(
solver->conflict[i])==v)
281 for(
const auto &literal : assumptions)
284 !literal.is_constant(),
"assumption literals must not be constant");
314 catch(Glucose::OutOfMemoryException)
318 throw std::bad_alloc();
bool is_in_conflict(literalt a) const override
Returns true if an assumption is in the final conflict.
satcheck_glucose_baset(T *, message_handlert &message_handler)
void set_assumptions(const bvt &_assumptions) override
void lcnf(const bvt &bv) override
void set_polarity(literalt a, bool value)
resultt do_prop_solve() override
virtual ~satcheck_glucose_baset()
tvt l_get(literalt a) const override
void set_assignment(literalt a, bool value) override
const std::string solver_text() override
satcheck_glucose_no_simplifiert(message_handlert &message_handler)
const std::string solver_text() override
satcheck_glucose_simplifiert(message_handlert &message_handler)
void set_frozen(literalt a) override
bool is_eliminated(literalt a) const
void with_solver_hardness(T &maybe_hardness_collector, hardness_collectort::handlert handler)
std::vector< literalt > bvt
void convert(const bvt &bv, Glucose::vec< Glucose::Lit > &dest)
int solver(std::istream &in)
#define PRECONDITION(CONDITION)
#define INVARIANT(CONDITION, REASON)
This macro uses the wrapper function 'invariant_violated_string'.
A structure that facilitates collecting the complexity statistics from a decision procedure.
void register_clause(const bvt &bv, const bvt &cnf, const size_t cnf_clause_index, bool register_cnf)
Called e.g.