#include "probe.h"
#include "backbone.h"
#include "backtrack.h"
#include "congruence.h"
#include "factor.h"
#include "internal.h"
#include "print.h"
#include "substitute.h"
#include "sweep.h"
#include "terminate.h"
#include "transitive.h"
#include "vivify.h"
#include <inttypes.h>
Go to the source code of this file.
◆ kissat_probe()
| int kissat_probe |
( |
kissat * | solver | ) |
|
Definition at line 72 of file probe.c.
72 {
77 const unsigned max_rounds =
GET_OPTION (proberounds);
78 for (unsigned round = 0; round != max_rounds; round++) {
79 unsigned before =
solver->active;
82 break;
83 if (before ==
solver->active)
84 break;
85 }
88 solver->last.ticks.probe =
solver->statistics_.search_ticks;
91 return solver->inconsistent ? 20 : 0;
92}
ABC_NAMESPACE_IMPL_START void kissat_classify(struct kissat *solver)
#define UPDATE_CONFLICT_LIMIT(NAME, COUNT, SCALE_COUNT_FUNCTION, SCALE_DELTA)
#define KISSAT_assert(ignore)
◆ kissat_probe_initially()
| int kissat_probe_initially |
( |
kissat * | solver | ) |
|
Definition at line 94 of file probe.c.
94 {
105 return solver->inconsistent ? 20 : 0;
106}
◆ kissat_probing()
Definition at line 18 of file probe.c.
18 {
19 if (!
solver->enabled.probe)
20 return false;
22 const uint64_t conflicts =
statistics->conflicts;
23 if (
solver->last.conflicts.reduce == conflicts)
24 return false;
25 return solver->limits.probe.conflicts < conflicts;
26}