mirror of
https://github.com/Z3Prover/z3
synced 2025-04-08 10:25:18 +00:00
na
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
parent
46f754c43d
commit
4dfdabc80f
|
@ -127,7 +127,7 @@ namespace q {
|
|||
void on_binding(quantifier* q, app* pat, euf::enode* const* binding, unsigned max_generation, unsigned min_gen, unsigned max_gen);
|
||||
|
||||
// callback from queue
|
||||
lbool eval(euf::enode* const* binding, clause& c) { return m_eval(binding, c); }
|
||||
lbool evaluate(euf::enode* const* binding, clause& c) { return m_eval(binding, c); }
|
||||
void add_instantiation(clause& c, binding& b, sat::literal lit);
|
||||
bool propagate(euf::enode* const* binding, unsigned max_generation, clause& c);
|
||||
|
||||
|
|
|
@ -137,7 +137,6 @@ namespace q {
|
|||
void queue::instantiate(entry& ent) {
|
||||
fingerprint & f = *ent.m_qb;
|
||||
quantifier * q = f.q();
|
||||
unsigned generation = f.m_max_generation;
|
||||
unsigned num_bindings = f.size();
|
||||
euf::enode * const * bindings = f.nodes();
|
||||
q::quantifier_stat * stat = f.c->m_stat;
|
||||
|
@ -181,7 +180,7 @@ namespace q {
|
|||
|
||||
if (curr.m_cost <= m_eager_cost_threshold)
|
||||
instantiate(curr);
|
||||
else if (m_params.m_qi_promote_unsat && l_false == em.eval(f.nodes(), *f.c)) {
|
||||
else if (m_params.m_qi_promote_unsat && l_false == em.evaluate(f.nodes(), *f.c)) {
|
||||
// do not delay instances that produce a conflict.
|
||||
TRACE("q", tout << "promoting instance that produces a conflict\n" << mk_pp(f.q(), m) << "\n";);
|
||||
instantiate(curr);
|
||||
|
|
|
@ -33,14 +33,6 @@ static bool is_hex_digit(char ch, unsigned& d) {
|
|||
return false;
|
||||
}
|
||||
|
||||
static bool is_octal_digit(char ch, unsigned& d) {
|
||||
if ('0' <= ch && ch <= '7') {
|
||||
d = ch - '0';
|
||||
return true;
|
||||
}
|
||||
return false;
|
||||
}
|
||||
|
||||
bool zstring::is_escape_char(char const *& s, unsigned& result) {
|
||||
unsigned d;
|
||||
if (*s == '\\' && *(s+1) == 'u' && *(s+2) == '{') {
|
||||
|
|
Loading…
Reference in a new issue