mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-10-30 19:22:28 +00:00
Code Activity

Fix some spelling errors (mostly in comments).

Browse source
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
Download patch file Download diff file Expand all files Collapse all files

6
src/muz/spacer/spacer_farkas_learner.cpp
View file

@ -7,8 +7,8 @@ Module Name:
Abstract:
Proviced abstract interface and some inplementations of algorithms
for strenghtning lemmas
Provides abstract interface and some implementations of algorithms
for strenghtening lemmas
Author:
@ -161,7 +161,7 @@ bool farkas_learner::is_pure_expr(func_decl_set const& symbs, expr* e, ast_manag
in a clausal version.
NB: the routine is not interpolating, though an interpolating variant would
be preferrable because then we can also use it for model propagation.
be preferable because then we can also use it for model propagation.
We collect the unit derivable nodes from bs.
These are the weakenings of bs, besides the

20
src/muz/spacer/spacer_quant_generalizer.cpp
View file

@ -186,7 +186,7 @@ void lemma_quantifier_generalizer::find_candidates(expr *e,
std::sort(candidates.c_ptr(), candidates.c_ptr() + candidates.size(),
index_lt_proc(m));
// keep actual select indecies in the order found at the back of
// keep actual select indices in the order found at the back of
// candidate list. There is no particular reason for this order
candidates.append(extra);
}
@ -199,24 +199,24 @@ bool lemma_quantifier_generalizer::match_sk_idx(expr *e, app_ref_vector const &z
contains_app has_zk(m, zks.get(0));
if (!contains_selects(e, m)) return false;
app_ref_vector indicies(m);
get_select_indices(e, indicies);
if (indicies.size() > 2) return false;
app_ref_vector indices(m);
get_select_indices(e, indices);
if (indices.size() > 2) return false;
unsigned i=0;
if (indicies.size() == 1) {
if (!has_zk(indicies.get(0))) return false;
if (indices.size() == 1) {
if (!has_zk(indices.get(0))) return false;
}
else {
if (has_zk(indicies.get(0)) && !has_zk(indicies.get(1)))
if (has_zk(indices.get(0)) && !has_zk(indices.get(1)))
i = 0;
else if (!has_zk(indicies.get(0)) && has_zk(indicies.get(1)))
else if (!has_zk(indices.get(0)) && has_zk(indices.get(1)))
i = 1;
else if (!has_zk(indicies.get(0)) && !has_zk(indicies.get(1)))
else if (!has_zk(indices.get(0)) && !has_zk(indices.get(1)))
return false;
}
idx = indicies.get(i);
idx = indices.get(i);
sk = zks.get(0);
return true;
}

2
src/muz/spacer/spacer_unsat_core_plugin.cpp
View file

@ -124,7 +124,7 @@ namespace spacer {
* We can rewrite (E2) to rewrite (E1) to
* (BP*Fark(BP)) => (neg(A*Fark(A) + BNP*Fark(BNP) + (neg D)*Fark(D))) (E3)
* and since we can derive (A*Fark(A) + BNP*Fark(BNP) + (neg D)*Fark(D)) from
* A, BNP and D, we also know that it is inconsisent. Therefore
* A, BNP and D, we also know that it is inconsistent. Therefore
* neg(A*Fark(A) + BNP*Fark(BNP) + (neg D)*Fark(D)) is a solution.
*
* Finally we also need the following workaround: