mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-05-08 00:05:46 +00:00
Code Activity

update doc

Browse source 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
Nikolaj Bjorner 2022-12-11 10:16:17 -08:00
parent a9f52b0069
commit f7269bb60a
6 changed files with 13 additions and 13 deletions
Download patch file Download diff file Expand all files Collapse all files

2
src/ast/simplifiers/propagate_values.cpp
View file

@ -115,5 +115,5 @@ void propagate_values::updt_params(params_ref const& p) {
void propagate_values::collect_param_descrs(param_descrs& r) {
th_rewriter::get_param_descrs(r);
r.insert("max_rounds", CPK_UINT, "(default: 4) maximum number of rounds.");
r.insert("max_rounds", CPK_UINT, "maximum number of rounds.", "4");
}

8
src/ast/simplifiers/solve_eqs.cpp
View file

@ -270,10 +270,10 @@ namespace euf {
}
void solve_eqs::collect_param_descrs(param_descrs& r) {
r.insert("solve_eqs_max_occs", CPK_UINT, "(default: infty) maximum number of occurrences for considering a variable for gaussian eliminations.");
r.insert("theory_solver", CPK_BOOL, "(default: true) use theory solvers.");
r.insert("ite_solver", CPK_BOOL, "(default: true) use if-then-else solver.");
r.insert("context_solve", CPK_BOOL, "(default: false) solve equalities under disjunctions.");
r.insert("solve_eqs_max_occs", CPK_UINT, "(default: infty) maximum number of occurrences for considering a variable for gaussian eliminations.", "4294967295");
r.insert("theory_solver", CPK_BOOL, "theory solvers.", "true");
r.insert("ite_solver", CPK_BOOL, "use if-then-else solver.", "true");
r.insert("context_solve", CPK_BOOL, "solve equalities under disjunctions.", "false");
}
void solve_eqs::collect_statistics(statistics& st) const {