mirror of
https://github.com/Z3Prover/z3
synced 2025-04-24 09:35:32 +00:00
Fix some typos. (#7115)
This commit is contained in:
parent
937d4aa8f4
commit
53f89a81c1
22 changed files with 33 additions and 33 deletions
|
@ -905,10 +905,10 @@ public:
|
|||
|
||||
void collect_param_descrs(param_descrs & r) override {
|
||||
insert_max_memory(r);
|
||||
r.insert("common_patterns", CPK_BOOL, "minimize the number of auxiliary variables during CNF encoding by identifing commonly used patterns", "true");
|
||||
r.insert("common_patterns", CPK_BOOL, "minimize the number of auxiliary variables during CNF encoding by identifying commonly used patterns", "true");
|
||||
r.insert("distributivity", CPK_BOOL, "minimize the number of auxiliary variables during CNF encoding by applying distributivity over unshared subformulas", "true");
|
||||
r.insert("distributivity_blowup", CPK_UINT, "maximum overhead for applying distributivity during CNF encoding", "32");
|
||||
r.insert("ite_chaing", CPK_BOOL, "minimize the number of auxiliary variables during CNF encoding by identifing if-then-else chains", "true");
|
||||
r.insert("ite_chaing", CPK_BOOL, "minimize the number of auxiliary variables during CNF encoding by identifying if-then-else chains", "true");
|
||||
r.insert("ite_extra", CPK_BOOL, "add redundant clauses (that improve unit propagation) when encoding if-then-else formulas", "true");
|
||||
}
|
||||
|
||||
|
|
|
@ -64,7 +64,7 @@ public:
|
|||
}
|
||||
|
||||
/**
|
||||
* size(), [](), update() and inconsisent() implement the abstract interface of dependent_expr_state
|
||||
* size(), [](), update() and inconsistent() implement the abstract interface of dependent_expr_state
|
||||
*/
|
||||
unsigned qtail() const override { return m_goal->size(); }
|
||||
|
||||
|
|
|
@ -433,7 +433,7 @@ namespace smtfd {
|
|||
void populate_model(model_ref& mdl, expr_ref_vector const& terms);
|
||||
|
||||
/**
|
||||
* \brief check consistency properties that can only be achived using a global analysis of terms
|
||||
* \brief check consistency properties that can only be achieved using a global analysis of terms
|
||||
*/
|
||||
void global_check(expr_ref_vector const& core);
|
||||
|
||||
|
|
|
@ -37,7 +37,7 @@ public:
|
|||
}
|
||||
|
||||
proof_ref operator()(ast_manager & m, unsigned num_source, proof * const * source) override {
|
||||
// ignore the proofs from the arguments, instead obtain the proofs fromt he subgoals.
|
||||
// ignore the proofs from the arguments, instead obtain the proofs from the subgoals.
|
||||
SASSERT(num_source == 0);
|
||||
proof_converter_ref_buffer pc_buffer;
|
||||
for (goal_ref g : m_goals) {
|
||||
|
|
|
@ -18,7 +18,7 @@ Tactic Documentation
|
|||
## Tactic quasi-macro-finder
|
||||
|
||||
### Short Description
|
||||
dentifies and applies quasi-macros.
|
||||
Identifies and applies quasi-macros.
|
||||
|
||||
### Long Description
|
||||
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue