3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-08-19 01:32:17 +00:00

adding lookahead and lemmas

Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
Nikolaj Bjorner 2017-06-01 14:49:54 -07:00
parent 7d245be4e1
commit 4e65c13726
13 changed files with 203 additions and 1 deletions

View file

@ -255,6 +255,28 @@ public:
return 0;
}
virtual expr_ref lookahead(expr_ref_vector const& candidates) {
sat::bool_var_vector vars;
u_map<expr*> var2candidate;
for (auto c : candidates) {
// TBD: check membership
sat::bool_var v = m_map.to_bool_var(c);
SASSERT(v != sat::null_bool_var);
vars.push_back(v);
var2candidate.insert(v, c);
}
sat::literal l = m_solver.select_lookahead(vars);
if (l == sat::null_literal) {
return expr_ref(m.mk_true(), m);
}
expr* e;
if (!var2candidate.find(l.var(), e)) {
// TBD: if candidate set is empty, then do something else.
e = m.mk_true();
}
return expr_ref(l.sign() ? m.mk_not(e) : e, m);
}
virtual lbool get_consequences_core(expr_ref_vector const& assumptions, expr_ref_vector const& vars, expr_ref_vector& conseq) {
init_preprocess();
TRACE("sat", tout << assumptions << "\n" << vars << "\n";);