bool solver_addclause(solver* s, lit* begin, lit* end)
{
lit *i,*j;
int maxvar;
lbool* values;
lit last;
if (begin == end) return false;
/* printlits(begin,end); printf("\n"); */
/* insertion sort */
maxvar = lit_var(*begin);
for (i = begin + 1; i < end; i++){
lit l = *i;
maxvar = lit_var(l) > maxvar ? lit_var(l) : maxvar;
for (j = i; j > begin && *(j-1) > l; j--)
*j = *(j-1);
*j = l;
}
solver_setnvars(s,maxvar+1);
/* printlits(begin,end); printf("\n"); */
values = s->assigns;
/* delete duplicates */
last = lit_Undef;
for (i = j = begin; i < end; i++){
/* printf("lit: "L_LIT", value = %d\n", L_lit(*i),
(lit_sign(*i) ? -values[lit_var(*i)] : values[lit_var(*i)])); */
lbool sig = !lit_sign(*i); sig += sig - 1;
if (*i == lit_neg(last) || sig == values[lit_var(*i)])
return true; /* tautology */
else if (*i != last && values[lit_var(*i)] == l_Undef)
last = *j++ = *i;
}
/* printf("final: "); printlits(begin,j); printf("\n"); */
if (j == begin) /* empty clause */
return false;
else if (j - begin == 1) /* unit clause */
return enqueue(s,*begin,(clause*)0);
/* create new clause */
vecp_push(&s->clauses,clause_new(s,begin,j,0));
s->stats.clauses++;
s->stats.clauses_literals += j - begin;
return true;
}
static void solver_record(solver* s, veci* cls)
{
lit* begin = veci_begin(cls);
lit* end = begin + veci_size(cls);
clause* c = (veci_size(cls) > 1) ? clause_new(s,begin,end,1)
: (clause*)0;
enqueue(s,*begin,c);
assert(veci_size(cls) > 0);
if (c != 0) {
vecp_push(&s->learnts,c);
act_clause_bump(s,c);
s->stats.learnts++;
s->stats.learnts_literals += veci_size(cls);
}
}
bool solver_addclause(solver* s, lit* begin, lit* end)
{
lit *i,*j;
int maxvar;
if (begin == end) return false; // Empty clause
// insertion sort
maxvar = lit_var(*begin);
for (i = begin + 1; i < end; i++){
lit l = *i;
maxvar = lit_var(l) > maxvar ? lit_var(l) : maxvar;
for (j = i; j > begin && *(j-1) > l; j--)
*j = *(j-1);
*j = l;
}
solver_setnvars(s,maxvar+1);
// create new clause
vecp_push(&s->clauses,clause_new(s,begin,end));
s->tail++; // tail == # of clauses at first.
return true;
}