cadical-sys 0.6.0

Almost complete safe and unsafe bindings for the CaDiCal SAT solver. Made using the cxx crate and then wrapped in a safe 1 to 1 API.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68

#include "../../src/cadical.hpp"

#include <cstdlib>
#include <string>

using namespace std;
using namespace CaDiCaL;

static string path (const char *name) {
  const char *prefix = getenv ("CADICALBUILD");
  string res = prefix ? prefix : ".";
  res += "/test-api-apitrace-";
  res += name;
  return res;
}

int main () {

  {
    for (int lrat = 0; lrat < 2; lrat++) {
      Solver *solver = new Solver;
      solver->set ("log", 1);
      solver->set ("binary", 0);
      solver->set ("verbose", 3);
      solver->set ("flushproof", 1);
      solver->configure ("plain");
      solver->set ("elim", 1);
      solver->set ("lrat", lrat);
      solver->trace_proof (
          path (lrat ? "inctrace1.lrat" : "inctrace1.drup").c_str ());
      solver->clause (1, 2, 3);
      solver->simplify ();
      solver->clause (-1, -2, -3);
      solver->solve ();
      solver->close_proof_trace (true);
      delete solver;
    }
  }

  {
    for (int lrat = 0; lrat < 2; lrat++) {
      Solver *solver = new Solver;
      solver->set ("log", 1);
      solver->set ("binary", 0);
      solver->set ("verbose", 3);
      solver->set ("flushproof", 1);
      solver->configure ("plain");
      solver->set ("elim", 1);
      solver->set ("lrat", lrat);
      solver->trace_proof (
          path (lrat ? "inctrace2.lrat" : "inctrace2.drup").c_str ());
      for (int i = -1; i <= -1; i += 2)
        for (int j = -1; j <= 1; j += 2)
          for (int k = -1; k <= 1; k += 2)
            solver->clause (i * 1, j * 2, k * 3);
      solver->simplify ();
      for (int i = 1; i <= 1; i += 2)
        for (int j = -1; j <= 1; j += 2)
          for (int k = -1; k <= 1; k += 2)
            solver->clause (i * 1, j * 2, k * 3);
      solver->solve ();
      solver->close_proof_trace (true);
      delete solver;
    }
  }

  return 0;
}