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

auto generation of parameter helper

Browse source 
Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>
This commit is contained in:
Leonardo de Moura 2012-11-30 15:31:40 -08:00
parent 124c0339c1
commit 4f9442864a
4 changed files with 123 additions and 22 deletions
Download patch file Download diff file Expand all files Collapse all files

13
src/nlsat/nlsat_params.pyg Normal file
View file

@ -0,0 +1,13 @@
def_module_params('nlsat',
export=True,
params=(max_memory_param(),
('lazy', UINT, 0, "how lazy the solver is."),
('reorder', BOOL, True, "reorder variables."),
('simplify_conflicts', BOOL, True, "simplify conflicts using equalities before resolving them in nlsat solver."),
('minimize_conflicts', BOOL, False, "minimize conflicts"),
('randomize', BOOL, True, "randomize selection of a witness in nlsat."),
('max_conflicts', UINT, UINT_MAX, "maximum number of conflicts."),
('shuffle_vars', BOOL, False, "use a random variable order."),
('seed', UINT, 0, "random seed.")))

33
src/nlsat/nlsat_solver.cpp
View file

@ -31,6 +31,7 @@ Revision History:
#include"dependency.h"
#include"polynomial_cache.h"
#include"permutation.h"
#include"nlsat_params.hpp"
#define NLSAT_EXTRA_VERBOSE
@ -197,20 +198,21 @@ namespace nlsat {
mk_clause(1, &true_lit, false, 0);
}
void updt_params(params_ref const & p) {
m_max_memory = megabytes_to_bytes(p.get_uint("max_memory", UINT_MAX));
m_lazy = p.get_uint("lazy", 0);
m_simplify_cores = p.get_bool("simplify_conflicts", true);
bool min_cores = p.get_bool("minimize_conflicts", false);
m_reorder = p.get_bool("reorder", true);
m_randomize = p.get_bool("randomize", true);
m_max_conflicts = p.get_uint("max_conflicts", UINT_MAX);
m_random_order = p.get_bool("shuffle_vars", false);
m_random_seed = p.get_uint("seed", 0);
void updt_params(params_ref const & _p) {
nlsat_params p(_p);
m_max_memory = p.max_memory();
m_lazy = p.lazy();
m_simplify_cores = p.simplify_conflicts();
bool min_cores = p.minimize_conflicts();
m_reorder = p.reorder();
m_randomize = p.randomize();
m_max_conflicts = p.max_conflicts();
m_random_order = p.shuffle_vars();
m_random_seed = p.seed();
m_ism.set_seed(m_random_seed);
m_explain.set_simplify_cores(m_simplify_cores);
m_explain.set_minimize_cores(min_cores);
m_am.updt_params(p);
m_am.updt_params(p.p);
}
void set_cancel(bool f) {
@ -2570,15 +2572,8 @@ namespace nlsat {
}
void solver::collect_param_descrs(param_descrs & d) {
insert_max_memory(d);
algebraic_numbers::manager::collect_param_descrs(d);
d.insert("max_conflicts", CPK_UINT, "(default: inf) maximum number of conflicts.");
d.insert("shuffle_vars", CPK_BOOL, "(default: false) use a variable order.");
d.insert("seed", CPK_UINT, "(default: 0) random seed.");
d.insert("randomize", CPK_BOOL, "(default: true) randomize selection of a witness in nlsat.");
d.insert("reorder", CPK_BOOL, "(default: true) reorder variables.");
d.insert("lazy", CPK_UINT, "(default: 0) how lazy the solver is.");
d.insert("simplify_conflicts", CPK_BOOL, "(default: true) simplify conflicts using equalities before resolving them in nlsat solver.");
nlsat_params::collect_param_descrs(d);
}
unsynch_mpq_manager & solver::qm() {