mirror of
https://github.com/Z3Prover/z3
synced 2025-08-03 18:00:23 +00:00
add options for logging learned lemmas and theory axioms
- add solver.axioms2files - prints negated theory axioms to files. Each file should be unsat - add solver.lemmas2console - prints lemmas to the console. - remove option smt.arith.dump_lemmas. It is replaced by solver.axioms2files
This commit is contained in:
Nikolaj Bjorner
parent
410eed9bd5
commit
63f48f8fd4
32 changed files with 260 additions and 319 deletions
|
|
@ -82,144 +82,145 @@ struct smt_params : public preprocessor_params,
|
|||
public theory_seq_params,
|
||||
public theory_pb_params,
|
||||
public theory_datatype_params {
|
||||
bool m_display_proof;
|
||||
bool m_display_dot_proof;
|
||||
bool m_display_unsat_core;
|
||||
bool m_check_proof;
|
||||
bool m_eq_propagation;
|
||||
bool m_binary_clause_opt;
|
||||
unsigned m_relevancy_lvl;
|
||||
bool m_relevancy_lemma;
|
||||
unsigned m_random_seed;
|
||||
double m_random_var_freq;
|
||||
double m_inv_decay;
|
||||
bool m_display_proof = false;
|
||||
bool m_display_dot_proof = false;
|
||||
bool m_display_unsat_core = false;
|
||||
bool m_check_proof = false;
|
||||
bool m_eq_propagation = true;
|
||||
bool m_binary_clause_opt = true;
|
||||
unsigned m_relevancy_lvl = 2;
|
||||
bool m_relevancy_lemma = false;
|
||||
unsigned m_random_seed = 0;
|
||||
double m_random_var_freq = 1.052;
|
||||
double m_inv_decay = 1;
|
||||
unsigned m_clause_decay;
|
||||
initial_activity m_random_initial_activity;
|
||||
phase_selection m_phase_selection;
|
||||
unsigned m_phase_caching_on;
|
||||
unsigned m_phase_caching_off;
|
||||
bool m_minimize_lemmas;
|
||||
unsigned m_max_conflicts;
|
||||
initial_activity m_random_initial_activity = initial_activity::IA_RANDOM_WHEN_SEARCHING;
|
||||
phase_selection m_phase_selection = phase_selection::PS_CACHING_CONSERVATIVE;
|
||||
unsigned m_phase_caching_on = 700;
|
||||
unsigned m_phase_caching_off = 100;
|
||||
bool m_minimize_lemmas = true;
|
||||
unsigned m_max_conflicts = UINT_MAX;
|
||||
unsigned m_restart_max;
|
||||
unsigned m_cube_depth;
|
||||
unsigned m_threads;
|
||||
unsigned m_threads_max_conflicts;
|
||||
unsigned m_threads_cube_frequency;
|
||||
bool m_simplify_clauses;
|
||||
unsigned m_tick;
|
||||
bool m_display_features;
|
||||
bool m_new_core2th_eq;
|
||||
bool m_ematching;
|
||||
bool m_induction;
|
||||
bool m_clause_proof;
|
||||
unsigned m_cube_depth = 1;
|
||||
unsigned m_threads = 1;
|
||||
unsigned m_threads_max_conflicts = UINT_MAX;
|
||||
unsigned m_threads_cube_frequency = 2;
|
||||
bool m_simplify_clauses = true;
|
||||
unsigned m_tick = 1000;
|
||||
bool m_display_features = false;
|
||||
bool m_new_core2th_eq = true;
|
||||
bool m_ematching = true;
|
||||
bool m_induction = false;
|
||||
bool m_clause_proof = false;
|
||||
|
||||
// -----------------------------------
|
||||
//
|
||||
// Case split strategy
|
||||
//
|
||||
// -----------------------------------
|
||||
case_split_strategy m_case_split_strategy;
|
||||
unsigned m_rel_case_split_order;
|
||||
bool m_lookahead_diseq;
|
||||
bool m_theory_case_split;
|
||||
bool m_theory_aware_branching;
|
||||
case_split_strategy m_case_split_strategy = case_split_strategy::CS_ACTIVITY_DELAY_NEW;
|
||||
unsigned m_rel_case_split_order = 0;
|
||||
bool m_lookahead_diseq = false;
|
||||
bool m_theory_case_split = false;
|
||||
bool m_theory_aware_branching = false;
|
||||
|
||||
// -----------------------------------
|
||||
//
|
||||
// Delay units...
|
||||
//
|
||||
// -----------------------------------
|
||||
bool m_delay_units;
|
||||
unsigned m_delay_units_threshold;
|
||||
bool m_delay_units = false;
|
||||
unsigned m_delay_units_threshold = 32;
|
||||
|
||||
// -----------------------------------
|
||||
//
|
||||
// Conflict resolution
|
||||
//
|
||||
// -----------------------------------
|
||||
bool m_theory_resolve;
|
||||
bool m_theory_resolve = false;
|
||||
|
||||
// -----------------------------------
|
||||
//
|
||||
// Restart
|
||||
//
|
||||
// -----------------------------------
|
||||
restart_strategy m_restart_strategy;
|
||||
unsigned m_restart_initial;
|
||||
double m_restart_factor;
|
||||
bool m_restart_adaptive;
|
||||
double m_agility_factor;
|
||||
double m_restart_agility_threshold;
|
||||
restart_strategy m_restart_strategy = restart_strategy::RS_IN_OUT_GEOMETRIC;
|
||||
unsigned m_restart_initial = 100;
|
||||
double m_restart_factor = 1.1;
|
||||
bool m_restart_adaptive = true;
|
||||
double m_agility_factor = 0.9999;
|
||||
double m_restart_agility_threshold = 0.18;
|
||||
|
||||
// -----------------------------------
|
||||
//
|
||||
// Lemma garbage collection
|
||||
//
|
||||
// -----------------------------------
|
||||
lemma_gc_strategy m_lemma_gc_strategy;
|
||||
bool m_lemma_gc_half;
|
||||
unsigned m_recent_lemmas_size;
|
||||
unsigned m_lemma_gc_initial;
|
||||
double m_lemma_gc_factor;
|
||||
unsigned m_new_old_ratio; //!< the ratio of new and old clauses.
|
||||
unsigned m_new_clause_activity;
|
||||
unsigned m_old_clause_activity;
|
||||
unsigned m_new_clause_relevancy; //!< Max. number of unassigned literals to be considered relevant.
|
||||
unsigned m_old_clause_relevancy; //!< Max. number of unassigned literals to be considered relevant.
|
||||
double m_inv_clause_decay; //!< clause activity decay
|
||||
lemma_gc_strategy m_lemma_gc_strategy = lemma_gc_strategy::LGC_FIXED;
|
||||
bool m_lemma_gc_half = false;
|
||||
unsigned m_recent_lemmas_size = 100;
|
||||
unsigned m_lemma_gc_initial = 5000;
|
||||
double m_lemma_gc_factor = 1.1;
|
||||
unsigned m_new_old_ratio = 16; //!< the ratio of new and old clauses.
|
||||
unsigned m_new_clause_activity = 10;
|
||||
unsigned m_old_clause_activity = 500;
|
||||
unsigned m_new_clause_relevancy = 45; //!< Max. number of unassigned literals to be considered relevant.
|
||||
unsigned m_old_clause_relevancy = 6; //!< Max. number of unassigned literals to be considered relevant.
|
||||
double m_inv_clause_decay = 1; //!< clause activity decay
|
||||
|
||||
// -----------------------------------
|
||||
//
|
||||
// SMT-LIB (debug) pretty printer
|
||||
//
|
||||
// -----------------------------------
|
||||
bool m_smtlib_dump_lemmas;
|
||||
symbol m_logic;
|
||||
bool m_axioms2files = false;
|
||||
bool m_lemmas2console = false;
|
||||
symbol m_logic = symbol::null;
|
||||
|
||||
// -----------------------------------
|
||||
//
|
||||
// Statistics for Profiling
|
||||
//
|
||||
// -----------------------------------
|
||||
bool m_profile_res_sub;
|
||||
bool m_display_bool_var2expr;
|
||||
bool m_display_ll_bool_var2expr;
|
||||
bool m_profile_res_sub = false;
|
||||
bool m_display_bool_var2expr = false;
|
||||
bool m_display_ll_bool_var2expr = false;
|
||||
|
||||
// -----------------------------------
|
||||
//
|
||||
// Model generation
|
||||
//
|
||||
// -----------------------------------
|
||||
bool m_model;
|
||||
bool m_model_on_timeout;
|
||||
bool m_model_on_final_check;
|
||||
bool m_model = true;
|
||||
bool m_model_on_timeout = false;
|
||||
bool m_model_on_final_check = false;
|
||||
|
||||
// -----------------------------------
|
||||
//
|
||||
// Progress sampling
|
||||
//
|
||||
// -----------------------------------
|
||||
unsigned m_progress_sampling_freq;
|
||||
unsigned m_progress_sampling_freq = 0;
|
||||
|
||||
// -----------------------------------
|
||||
//
|
||||
// Debugging goodies
|
||||
//
|
||||
// -----------------------------------
|
||||
bool m_core_validate;
|
||||
bool m_core_validate = false;
|
||||
|
||||
// -----------------------------------
|
||||
//
|
||||
// From front_end_params
|
||||
//
|
||||
// -----------------------------------
|
||||
bool m_preprocess; // temporary hack for disabling all preprocessing..
|
||||
bool m_user_theory_preprocess_axioms;
|
||||
bool m_user_theory_persist_axioms;
|
||||
bool m_at_labels_cex; // only use labels which contains the @ symbol when building multiple counterexamples.
|
||||
bool m_check_at_labels; // check that @ labels are inserted to generate unique counter-examples.
|
||||
bool m_dump_goal_as_smt;
|
||||
bool m_auto_config;
|
||||
bool m_preprocess = true; // temporary hack for disabling all preprocessing..
|
||||
bool m_user_theory_preprocess_axioms = false;
|
||||
bool m_user_theory_persist_axioms = false;
|
||||
bool m_at_labels_cex = false; // only use labels which contains the @ symbol when building multiple counterexamples.
|
||||
bool m_check_at_labels = false; // check that @ labels are inserted to generate unique counter-examples.
|
||||
bool m_dump_goal_as_smt = false;
|
||||
bool m_auto_config = true;
|
||||
|
||||
// -----------------------------------
|
||||
//
|
||||
|
|
@ -238,77 +239,6 @@ struct smt_params : public preprocessor_params,
|
|||
symbol m_string_solver;
|
||||
|
||||
smt_params(params_ref const & p = params_ref()):
|
||||
m_display_proof(false),
|
||||
m_display_dot_proof(false),
|
||||
m_display_unsat_core(false),
|
||||
m_check_proof(false),
|
||||
m_eq_propagation(true),
|
||||
m_binary_clause_opt(true),
|
||||
m_relevancy_lvl(2),
|
||||
m_relevancy_lemma(false),
|
||||
m_random_seed(0),
|
||||
m_random_var_freq(0.01),
|
||||
m_inv_decay(1.052),
|
||||
m_clause_decay(1),
|
||||
m_random_initial_activity(initial_activity::IA_RANDOM_WHEN_SEARCHING),
|
||||
m_phase_selection(phase_selection::PS_CACHING_CONSERVATIVE),
|
||||
m_phase_caching_on(700),
|
||||
m_phase_caching_off(100),
|
||||
m_minimize_lemmas(true),
|
||||
m_max_conflicts(UINT_MAX),
|
||||
m_cube_depth(1),
|
||||
m_threads(1),
|
||||
m_threads_max_conflicts(UINT_MAX),
|
||||
m_threads_cube_frequency(2),
|
||||
m_simplify_clauses(true),
|
||||
m_tick(1000),
|
||||
m_display_features(false),
|
||||
m_new_core2th_eq(true),
|
||||
m_ematching(true),
|
||||
m_induction(false),
|
||||
m_clause_proof(false),
|
||||
m_case_split_strategy(case_split_strategy::CS_ACTIVITY_DELAY_NEW),
|
||||
m_rel_case_split_order(0),
|
||||
m_lookahead_diseq(false),
|
||||
m_theory_case_split(false),
|
||||
m_theory_aware_branching(false),
|
||||
m_delay_units(false),
|
||||
m_delay_units_threshold(32),
|
||||
m_theory_resolve(false),
|
||||
m_restart_strategy(restart_strategy::RS_IN_OUT_GEOMETRIC),
|
||||
m_restart_initial(100),
|
||||
m_restart_factor(1.1),
|
||||
m_restart_adaptive(true),
|
||||
m_agility_factor(0.9999),
|
||||
m_restart_agility_threshold(0.18),
|
||||
m_lemma_gc_strategy(lemma_gc_strategy::LGC_FIXED),
|
||||
m_lemma_gc_half(false),
|
||||
m_recent_lemmas_size(100),
|
||||
m_lemma_gc_initial(5000),
|
||||
m_lemma_gc_factor(1.1),
|
||||
m_new_old_ratio(16),
|
||||
m_new_clause_activity(10),
|
||||
m_old_clause_activity(500),
|
||||
m_new_clause_relevancy(45),
|
||||
m_old_clause_relevancy(6),
|
||||
m_inv_clause_decay(1),
|
||||
m_smtlib_dump_lemmas(false),
|
||||
m_logic(symbol::null),
|
||||
m_profile_res_sub(false),
|
||||
m_display_bool_var2expr(false),
|
||||
m_display_ll_bool_var2expr(false),
|
||||
m_model(true),
|
||||
m_model_on_timeout(false),
|
||||
m_model_on_final_check(false),
|
||||
m_progress_sampling_freq(0),
|
||||
m_core_validate(false),
|
||||
m_preprocess(true), // temporary hack for disabling all preprocessing..
|
||||
m_user_theory_preprocess_axioms(false),
|
||||
m_user_theory_persist_axioms(false),
|
||||
m_at_labels_cex(false),
|
||||
m_check_at_labels(false),
|
||||
m_dump_goal_as_smt(false),
|
||||
m_auto_config(true),
|
||||
m_string_solver(symbol("auto")){
|
||||
updt_local_params(p);
|
||||
}
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue