Solver::Solver() :
// Parameters: (formerly in 'SearchParams')
var_decay(1 / 0.95), clause_decay(1 / 0.999), random_var_freq(0.02)
, restart_first(100), restart_inc(1.5), learntsize_factor((double)1/(double)3), learntsize_inc(1)
// More parameters:
//
, expensive_ccmin (true)
, polarity_mode (polarity_user)
, verbosity (0)
// Statistics: (formerly in 'SolverStats')
//
, nbDL2(0),nbBin(0),nbUn(0) , nbReduceDB(0), starts(0), decisions(0), rnd_decisions(0), propagations(0), conflicts(0), bogoProps(0)
, clauses_literals(0), learnts_literals(0), max_literals(0), tot_literals(0)
, ok (true)
, cla_inc (1)
, var_inc (1)
, qhead (0)
, simpDB_assigns (-1)
, simpDB_props (0)
, order_heap (VarOrderLt(activity))
, backup (VarOrderLt(activity))
, random_seed (91648253)
, progress_estimate(0)
, remove_satisfied (true)
, clIndex(0)
, cleanNo(0)
{
MYFLAG = 0; //No comment ;)
}
Solver::Solver() :
// Parameters: (formerly in 'SearchParams')
var_decay(1 / 0.95), clause_decay(1 / 0.999), random_var_freq(0.02)
, restart_first(100), restart_inc(1.5), learntsize_factor((double)1/(double)3), learntsize_inc(1.1)
// More parameters:
//
, expensive_ccmin (true)
, polarity_mode (polarity_false)
, verbosity (0)
// Statistics: (formerly in 'SolverStats')
//
, starts(0), decisions(0), rnd_decisions(0), propagations(0), conflicts(0)
, clauses_literals(0), learnts_literals(0), max_literals(0), tot_literals(0)
, node_limit (0)
, fail_limit (0)
, time_limit (0.0)
, start_time (0.0)
, ok (true)
, cla_inc (1)
, var_inc (1)
, qhead (0)
, simpDB_assigns (-1)
, simpDB_props (0)
, order_heap (VarOrderLt(activity))
, random_seed (91648253)
, progress_estimate(0)
, remove_satisfied (true)
, init_level (0)
{}
// Modified Line
MiniSATP::MiniSATP ( const int i
, vector< Enode * > & e
, vector< Enode * > & d
, vector< Enode * > & s
, vector< Enode * > & v
, const bool t )
// Parameters: (formerly in 'SearchParams')
: var_decay(1 / 0.95), clause_decay(1 / 0.999), random_var_freq(0.02)
, restart_first(100)
// Changed from 1.5
, restart_inc(1.1)
, learntsize_factor((double)1/(double)3), learntsize_inc(1.1)
// More parameters:
//
, expensive_ccmin (true)
, polarity_mode (polarity_false)
, verbosity (0)
// Statistics: (formerly in 'MiniSATPStats')
//
, starts(0), decisions(0), rnd_decisions(0), propagations(0), conflicts(0)
, clauses_literals(0), learnts_literals(0), max_literals(0), tot_literals(0)
//=================================================================================================
// Added Code
, solver_id ( i )
, explanation ( e )
, deductions ( d )
, suggestions ( s )
, var_to_enode ( v )
, theory_prop ( t )
// Added Code
//=================================================================================================
, ok (true)
, cla_inc (1)
, var_inc (1)
, qhead (0)
, simpDB_assigns (-1)
, simpDB_props (0)
, order_heap (VarOrderLt(activity))
, random_seed (91648253)
, progress_estimate(0)
, remove_satisfied (true)
{
exp_dup.reserve( 65535 );
var_dup.reserve( 65535 );
exp_dup_count = 1;
var_dup_count = 1;
active_exp_dup = false;
active_var_dup = false;
}
SAT::SAT() :
lit_sort(trailpos)
, pushback_time(0)
, trail(1)
, qhead(1,0)
, rtrail(1)
, confl(NULL)
, var_inc(1)
, maxActivity(0)
, cla_inc(1)
, order_heap(VarOrderLt(activity))
, bin_clauses(0)
, tern_clauses(0)
, long_clauses(0)
, learnt_clauses(0)
, propagations(0)
, back_jumps(0)
, nrestarts(0)
, next_simp_db(100000)
, clauses_literals(0)
, learnts_literals(0)
, max_literals(0)
, tot_literals(0)
, avg_depth(100)
, confl_rate(1000)
, ll_time(wallClockTime())
, ll_inc(1)
, learnt_len_el(10)
, learnt_len_occ(MAX_SHARE_LEN,learnt_len_el*1000/MAX_SHARE_LEN)
{
newVar(); enqueue(Lit(0,1));
newVar(); enqueue(Lit(1,0));
temp_sc = (SClause*) malloc(TEMP_SC_LEN * sizeof(int));
short_expl = (Clause*) malloc(sizeof(Clause) + 3 * sizeof(Lit));
short_confl = (Clause*) malloc(sizeof(Clause) + 2 * sizeof(Lit));
short_expl->clearFlags();
short_confl->clearFlags();
short_confl->sz = 2;
}
