3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-24 01:25:31 +00:00

Typo Fixes (#6803)

This commit is contained in:
THE Spellchecker 2023-07-09 14:56:10 -04:00 committed by GitHub
parent 28a0c2d18f
commit dc0887db5a
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
43 changed files with 1811 additions and 1811 deletions

View file

@ -94,7 +94,7 @@ namespace sat {
// from clause x, y, z
// then ~x, ~y -> z
// look for ~y, z -> ~x - contains ternary(y, ~z, ~x)
// look for ~x, y -> u - u is used in a ternary claues (~y, x)
// look for ~x, y -> u - u is used in a ternary clause (~y, x)
// look for y, u -> ~x - contains ternary(~u, ~x, ~y)
// then ~x = if ~y then z else u

View file

@ -47,7 +47,7 @@ Marijn's version:
if inconsistent():
learn C (subsumes C or p)
else:
candidates' := C union ~(consequencs of propagate(~C))
candidates' := C union ~(consequences of propagate(~C))
candidates := candidates' intersect candidates
pop(1)
for q in candidates:
@ -77,7 +77,7 @@ Marijn's version:
if inconsistent():
learn C (subsumes C or p)
else:
candidates := candicates union C union ~(consequencs of propagate(~C))
candidates := candidates union C union ~(consequences of propagate(~C))
pop(1)
for q in candidates:
push(1)

View file

@ -3462,7 +3462,7 @@ namespace sat {
}
}
// can't eliminat FUIP
// can't eliminate FUIP
SASSERT(is_marked_lit(m_lemma[0]));
unsigned j = 0;

View file

@ -47,7 +47,7 @@ class sat_smt_solver : public solver {
ast_manager& m;
trail_stack& m_trail;
expr_ref_vector m_refs;
obj_map<expr, expr*> m_dep2orig; // map original dependency to uninterpeted literal
obj_map<expr, expr*> m_dep2orig; // map original dependency to uninterpreted literal
u_map<expr*> m_lit2dep; // map from literal assumption to original expression
obj_map<expr, sat::literal> m_dep2lit; // map uninterpreted literal to sat literal