mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-23 09:05:31 +00:00
Code Activity

experiment with sat solver

Browse source 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
Nikolaj Bjorner 2014-05-14 19:40:58 -07:00
parent 81c2560854
commit d849b5c637
5 changed files with 149 additions and 53 deletions
Download patch file Download diff file Expand all files Collapse all files

3
src/sat/sat_simplifier.cpp
View file

@ -1421,6 +1421,8 @@ namespace sat {
};
void simplifier::elim_vars() {
if (!m_elim_vars) return;
elim_var_report rpt(*this);
bool_var_vector vars;
order_vars_for_elim(vars);
@ -1460,6 +1462,7 @@ namespace sat {
m_res_cls_cutoff2 = p.resolution_cls_cutoff2();
m_subsumption = p.subsumption();
m_subsumption_limit = p.subsumption_limit();
m_elim_vars = p.elim_vars();
}
void simplifier::collect_param_descrs(param_descrs & r) {

1
src/sat/sat_simplifier.h
View file

@ -82,6 +82,7 @@ namespace sat {
bool m_subsumption;
unsigned m_subsumption_limit;
bool m_elim_vars;
// stats
unsigned m_num_blocked_clauses;

1
src/sat/sat_simplifier_params.pyg
View file

@ -15,5 +15,6 @@ def_module_params(module_name='sat',
('resolution.lit_cutoff_range3', UINT, 300, 'second cutoff (total number of literals) for Boolean variable elimination, for problems containing more than res_cls_cutoff2'),
('resolution.cls_cutoff1', UINT, 100000000, 'limit1 - total number of problems clauses for the second cutoff of Boolean variable elimination'),
('resolution.cls_cutoff2', UINT, 700000000, 'limit2 - total number of problems clauses for the second cutoff of Boolean variable elimination'),
('elim_vars', BOOL, True, 'enable variable elimination during simplification'),
('subsumption', BOOL, True, 'eliminate subsumed clauses'),
('subsumption.limit', UINT, 100000000, 'approx. maximum number of literals visited during subsumption (and subsumption resolution)')))