50 lines
925 B
C++
50 lines
925 B
C++
#include "../../src/cadical.hpp"
|
|
|
|
#ifdef NDEBUG
|
|
#undef NDEBUG
|
|
#endif
|
|
|
|
extern "C" {
|
|
#include <assert.h>
|
|
#include <unistd.h>
|
|
#include <signal.h>
|
|
}
|
|
|
|
static int n = 11;
|
|
|
|
static int ph (int p, int h) {
|
|
assert (0 <= p), assert (p < n + 1);
|
|
assert (0 <= h), assert (h < n);
|
|
return 1 + h * (n+1) + p;
|
|
}
|
|
|
|
static CaDiCaL::Solver solver;
|
|
|
|
static void handler (int) { solver.terminate (); }
|
|
|
|
int main () {
|
|
|
|
// Construct a pigeon hole formula for 'n+1' pigeons in 'n' holes.
|
|
//
|
|
for (int h = 0; h < n; h++)
|
|
for (int p1 = 0; p1 < n + 1; p1++)
|
|
for (int p2 = p1 + 1; p2 < n + 1; p2++)
|
|
solver.add (-ph (p1, h)),
|
|
solver.add (-ph (p2, h)),
|
|
solver.add (0);
|
|
|
|
for (int p = 0; p < n + 1; p++) {
|
|
for (int h = 0; h < n; h++)
|
|
solver.add (ph (p, h));
|
|
solver.add (0);
|
|
}
|
|
|
|
(void) signal (SIGALRM, handler);
|
|
ualarm (1e5, 0);
|
|
int res = solver.solve ();
|
|
assert (!res);
|
|
solver.statistics ();
|
|
|
|
return 0;
|
|
}
|