362 {
366
368
369 unsigned total_shrunken = 0;
370 unsigned total_minimized = 0;
371
374
376
377 while (end_block != begin_lits)
378 end_block = minimize_and_shrink_block (
379 solver, begin_lits, end_block, &total_shrunken, &total_minimized);
380 unsigned *q = begin_lits;
381 for (
const unsigned *
p = q;
p != end_lits;
p++) {
382 const unsigned lit = *
p;
385 }
386 LOG (
"clause shrunken by %u literals (including %u minimized)",
387 total_shrunken, total_minimized);
390 ADD (literals_shrunken, total_shrunken);
391 ADD (literals_minshrunken, total_minimized);
392
393 LOGTMP (
"shrunken learned");
395
397}
#define SET_END_OF_STACK(S, P)
#define KISSAT_assert(ignore)
void kissat_reset_poisoned(kissat *solver)