void cost_flip_unfixed_rule(samp_table_t *table, int32_t rule_index,
int32_t *dcost) {
atom_table_t *atom_table = &table->atom_table;
rule_inst_table_t *rule_inst_table = &table->rule_inst_table;
rule_inst_t *rinst = rule_inst_table->rule_insts[rule_index];
*dcost = 0;
int32_t i;
for (i = 0; i < rinst->num_clauses; i++) {
if (eval_clause(atom_table->assignment, rinst->conjunct[i]) == -1)
(*dcost)--;
}
}
/*
* Validate all the lists in the clause table
*/
bool valid_rule_inst_table(rule_inst_table_t *rule_inst_table, atom_table_t *atom_table){
samp_clause_t *ptr;
samp_clause_t *cls;
int32_t lit, i;
assert(rule_inst_table->size >= 0);
assert(rule_inst_table->num_rule_insts >= 0);
assert(rule_inst_table->num_rule_insts <= rule_inst_table->size);
if (rule_inst_table->size < 0) return false;
if (rule_inst_table->num_rule_insts < 0
|| rule_inst_table->num_rule_insts > rule_inst_table->size)
return false;
/* check that every clause in the unsat list is unsat */
valid_clause_list(&rule_inst_table->unsat_clauses);
for (ptr = rule_inst_table->unsat_clauses.head;
ptr != rule_inst_table->unsat_clauses.tail;
ptr = next_clause_ptr(ptr)) {
cls = ptr->link;
assert(eval_clause(atom_table->assignment, cls) == -1);
if (eval_clause(atom_table->assignment, cls) != -1)
return false;
}
///* check negative_or_unit_clauses */
//valid_clause_list(&rule_inst_table->negative_or_unit_clauses);
//for (ptr = rule_inst_table->negative_or_unit_clauses.head;
// ptr != rule_inst_table->negative_or_unit_clauses.tail;
// ptr = next_clause_ptr(ptr)) {
// cls = ptr->link;
// assert(cls->weight < 0 || cls->numlits == 1);
// if (cls->weight >= 0 && cls->numlits != 1)
// return false;
//}
///* check dead_negative_or_unit_clauses */
//valid_clause_list(&rule_inst_table->dead_negative_or_unit_clauses);
//for (ptr = rule_inst_table->dead_negative_or_unit_clauses.head;
// ptr != rule_inst_table->dead_negative_or_unit_clauses.tail;
// ptr = next_clause_ptr(ptr)) {
// cls = ptr->link;
// assert(cls->weight < 0 || cls->numlits == 1);
// if (cls->weight >= 0 && cls->numlits != 1)
// return false;
//}
/* check that every watched clause is satisfied */
for (i = 0; i < atom_table->num_vars; i++) {
lit = pos_lit(i);
valid_watched_lit(rule_inst_table, lit, atom_table);
lit = neg_lit(i);
valid_watched_lit(rule_inst_table, lit, atom_table);
}
/* check the sat_clauses to see if the first disjunct is fixed true */
valid_clause_list(&rule_inst_table->sat_clauses);
for (ptr = rule_inst_table->sat_clauses.head;
ptr != rule_inst_table->sat_clauses.tail;
ptr = next_clause_ptr(ptr)) {
cls = ptr->link;
assert(clause_contains_fixed_true_lit(cls, atom_table->assignment));
if (!clause_contains_fixed_true_lit(cls, atom_table->assignment))
return false;
}
/* check the live_clauses */
valid_clause_list(&rule_inst_table->sat_clauses);
/* check all the clauses to see if they are properly indexed */
rule_inst_t *rinst;
for (i = 0; i < rule_inst_table->num_rule_insts; i++){
rinst = rule_inst_table->rule_insts[i];
assert(rinst->num_clauses >= 0);
if (rinst->num_clauses < 0)
return false;
//for (j = 0; j < clause->numlits; j++){
// assert(var_of(clause->disjunct[j]) >= 0);
// assert(var_of(clause->disjunct[j]) < atom_table->num_vars);
// if (var_of(clause->disjunct[j]) < 0 ||
// var_of(clause->disjunct[j]) >= atom_table->num_vars)
// return false;
//}
}
return true;
}
