3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-08-21 18:50:26 +00:00

Fix some spelling errors (mostly in comments).

This commit is contained in:
Florian Pigorsch 2018-10-20 17:07:41 +02:00
parent 880ce12e2d
commit 326bf401b9
121 changed files with 205 additions and 205 deletions

View file

@ -8,7 +8,7 @@ Module Name:
Abstract:
Tactic for purifying quantifier-free formulas that mix QF_NRA and other theories.
It is designed to allow cooprating between the nlsat solver and other theories
It is designed to allow cooperation between the nlsat solver and other theories
in a decoupled way.
Let goal be formula F.
@ -446,7 +446,7 @@ private:
expr* pred = fresh_preds[i];
if (mdl->eval(pred, tmp)) {
polarity_t pol = m_polarities.find(pred);
// if assumptinon literals are used to satisfy NL state,
// if assumption literals are used to satisfy NL state,
// we have to assume them when satisfying SMT state
if (pol != pol_neg && m.is_false(tmp)) {
m_asms.push_back(m.mk_not(pred));
@ -767,7 +767,7 @@ public:
// then annotate subformulas by polarities,
// finally extract polynomial inequalities by
// creating a place-holder predicate inside the
// original goal and extracing pure nlsat clauses.
// original goal and extracting pure nlsat clauses.
r.set_interface_var_mode();
rewrite_goal(r, g);
if (!g->unsat_core_enabled()) {