cadical 0.9.0

data/ext/cadical/cadical/src/veripbtracer.cpp

@@ -0,0 +1,427 @@
+#include "internal.hpp"
+
+namespace CaDiCaL {
+
+/*------------------------------------------------------------------------*/
+
+VeripbTracer::VeripbTracer (Internal *i, File *f, bool b, bool a, bool c)
+    : internal (i), file (f), with_antecedents (a), checked_deletions (c),
+      num_clauses (0), size_clauses (0), clauses (0), last_hash (0),
+      last_id (0), last_clause (0)
+#ifndef QUIET
+      ,
+      added (0), deleted (0)
+#endif
+{
+  (void) internal;
+
+  // Initialize random number table for hash function.
+  //
+  Random random (42);
+  for (unsigned n = 0; n < num_nonces; n++) {
+    uint64_t nonce = random.next ();
+    if (!(nonce & 1))
+      nonce++;
+    assert (nonce), assert (nonce & 1);
+    nonces[n] = nonce;
+  }
+#ifndef NDEBUG
+  binary = b;
+#else
+  (void) b;
+#endif
+}
+
+void VeripbTracer::connect_internal (Internal *i) {
+  internal = i;
+  file->connect_internal (internal);
+  LOG ("VERIPB TRACER connected to internal");
+}
+
+VeripbTracer::~VeripbTracer () {
+  LOG ("VERIPB TRACER delete");
+  delete file;
+  for (size_t i = 0; i < size_clauses; i++)
+    for (HashId *c = clauses[i], *next; c; c = next)
+      next = c->next, delete_clause (c);
+  delete[] clauses;
+}
+
+/*------------------------------------------------------------------------*/
+
+void VeripbTracer::enlarge_clauses () {
+  assert (num_clauses == size_clauses);
+  const uint64_t new_size_clauses = size_clauses ? 2 * size_clauses : 1;
+  LOG ("VeriPB Tracer enlarging clauses from %" PRIu64 " to %" PRIu64,
+       (uint64_t) size_clauses, (uint64_t) new_size_clauses);
+  HashId **new_clauses;
+  new_clauses = new HashId *[new_size_clauses];
+  clear_n (new_clauses, new_size_clauses);
+  for (uint64_t i = 0; i < size_clauses; i++) {
+    for (HashId *c = clauses[i], *next; c; c = next) {
+      next = c->next;
+      const uint64_t h = reduce_hash (c->hash, new_size_clauses);
+      c->next = new_clauses[h];
+      new_clauses[h] = c;
+    }
+  }
+  delete[] clauses;
+  clauses = new_clauses;
+  size_clauses = new_size_clauses;
+}
+
+HashId *VeripbTracer::new_clause () {
+  HashId *res = new HashId ();
+  res->next = 0;
+  res->hash = last_hash;
+  res->id = last_id;
+  last_clause = res;
+  num_clauses++;
+  return res;
+}
+
+void VeripbTracer::delete_clause (HashId *c) {
+  assert (c);
+  num_clauses--;
+  delete c;
+}
+
+uint64_t VeripbTracer::reduce_hash (uint64_t hash, uint64_t size) {
+  assert (size > 0);
+  unsigned shift = 32;
+  uint64_t res = hash;
+  while ((((uint64_t) 1) << shift) > size) {
+    res ^= res >> shift;
+    shift >>= 1;
+  }
+  res &= size - 1;
+  assert (res < size);
+  return res;
+}
+
+uint64_t VeripbTracer::compute_hash (const int64_t id) {
+  assert (id > 0);
+  unsigned j = id % num_nonces;             // Dont know if this is a good
+  uint64_t tmp = nonces[j] * (uint64_t) id; // hash funktion or even better
+  return last_hash = tmp;                   // than just using id.
+}
+
+bool VeripbTracer::find_and_delete (const int64_t id) {
+  if (!num_clauses)
+    return false;
+  /*
+  if (last_clause && last_clause->id == id) {
+    const uint64_t h = reduce_hash (last_clause->hash, size_clauses);
+    clauses[h] = last_clause->next;
+    delete last_clause;
+    return true;
+  }
+  */
+  HashId **res = 0, *c;
+  const uint64_t hash = compute_hash (id);
+  const uint64_t h = reduce_hash (hash, size_clauses);
+  for (res = clauses + h; (c = *res); res = &c->next) {
+    if (c->hash == hash && c->id == id) {
+      break;
+    }
+    if (!c->next)
+      return false;
+  }
+  if (!c)
+    return false;
+  assert (c && res);
+  *res = c->next;
+  delete_clause (c);
+  return true;
+}
+
+void VeripbTracer::insert () {
+  if (num_clauses == size_clauses)
+    enlarge_clauses ();
+  const uint64_t h = reduce_hash (compute_hash (last_id), size_clauses);
+  HashId *c = new_clause ();
+  c->next = clauses[h];
+  clauses[h] = c;
+}
+
+/*------------------------------------------------------------------------*/
+
+inline void VeripbTracer::put_binary_zero () {
+  assert (binary);
+  assert (file);
+  file->put ((unsigned char) 0);
+}
+
+inline void VeripbTracer::put_binary_lit (int lit) {
+  assert (binary);
+  assert (file);
+  assert (lit != INT_MIN);
+  unsigned x = 2 * abs (lit) + (lit < 0);
+  unsigned char ch;
+  while (x & ~0x7f) {
+    ch = (x & 0x7f) | 0x80;
+    file->put (ch);
+    x >>= 7;
+  }
+  ch = x;
+  file->put (ch);
+}
+
+inline void VeripbTracer::put_binary_id (int64_t id, bool can_be_negative) {
+  assert (binary);
+  assert (file);
+  uint64_t x = abs (id);
+  if (can_be_negative) {
+    x = 2 * x + (id < 0);
+  }
+  unsigned char ch;
+  while (x & ~0x7f) {
+    ch = (x & 0x7f) | 0x80;
+    file->put (ch);
+    x >>= 7;
+  }
+  ch = x;
+  file->put (ch);
+}
+
+/*------------------------------------------------------------------------*/
+
+void VeripbTracer::veripb_add_derived_clause (int64_t id, bool redundant,
+                                              int witness,
+                                              const vector<int> &clause) {
+  assert (witness == clause[0]);
+  file->put ("red ");
+  for (const auto &external_lit : clause) {
+    file->put ("1 ");
+    if (external_lit < 0)
+      file->put ('~');
+    file->put ('x');
+    file->put (abs (external_lit));
+    file->put (' ');
+  }
+  file->put (">= 1 : ");
+  file->put ('x');
+  file->put (abs (witness));
+  file->put (" -> ");
+  if (witness < 0)
+    file->put ("0");
+  else
+    file->put ("1");
+  file->put (";\n");
+  if (!redundant && checked_deletions) {
+    file->put ("core id ");
+    file->put (id);
+    file->put (";\n");
+  }
+}
+
+void VeripbTracer::veripb_add_derived_clause (
+    int64_t id, bool redundant, const vector<int> &clause,
+    const vector<int64_t> &chain) {
+  file->put ("pol ");
+  bool first = true;
+  assert (!chain.empty ());
+  for (auto p = chain.rbegin (); p != chain.rend (); p++) {
+    auto cid = *p;
+    if (first) {
+      first = false;
+      file->put (cid);
+    } else {
+      file->put (' ');
+      file->put (cid);
+      file->put (" + s");
+    }
+  }
+  file->put (";\n");
+  file->put ("e ");
+  for (const auto &external_lit : clause) {
+    file->put ("1 ");
+    if (external_lit < 0)
+      file->put ('~');
+    file->put ('x');
+    file->put (abs (external_lit));
+    file->put (' ');
+  }
+  file->put (">= 1 : ");
+  file->put (id);
+  file->put (";\n");
+  if (!redundant && checked_deletions) {
+    file->put ("core id ");
+    file->put (id);
+    file->put (";\n");
+  }
+}
+
+void VeripbTracer::veripb_add_derived_clause (int64_t id, bool redundant,
+                                              const vector<int> &clause) {
+  file->put ("rup ");
+  for (const auto &external_lit : clause) {
+    file->put ("1 ");
+    if (external_lit < 0)
+      file->put ('~');
+    file->put ('x');
+    file->put (abs (external_lit));
+    file->put (' ');
+  }
+  file->put (">= 1;\n");
+  if (!redundant && checked_deletions) {
+    file->put ("core id ");
+    file->put (id);
+    file->put (";\n");
+  }
+}
+
+void VeripbTracer::veripb_begin_proof (int64_t reserved_ids) {
+  file->put ("pseudo-Boolean proof version 3.0\n");
+  file->put ("f ");
+  file->put (reserved_ids);
+  file->put (";\n");
+}
+
+void VeripbTracer::veripb_delete_clause (int64_t id, bool redundant) {
+  if (!redundant && checked_deletions && find_and_delete (id))
+    return;
+  if (redundant || !checked_deletions)
+    file->put ("del id ");
+  else {
+    file->put ("delc ");
+  }
+  file->put (id);
+  file->put (";\n");
+}
+
+void VeripbTracer::veripb_report_status (bool unsat, int64_t conflict_id) {
+  file->put ("output NONE;\n");
+  if (unsat) {
+    file->put ("conclusion UNSAT : ");
+    file->put (conflict_id);
+    file->put (";\n");
+  } else
+    file->put ("conclusion NONE;\n");
+  file->put ("end pseudo-Boolean proof;\n");
+}
+
+void VeripbTracer::veripb_strengthen (int64_t id) {
+  if (!checked_deletions)
+    return;
+  file->put ("core id ");
+  file->put (id);
+  file->put (";\n");
+}
+
+/*------------------------------------------------------------------------*/
+
+void VeripbTracer::begin_proof (int64_t id) {
+  if (file->closed ())
+    return;
+  LOG ("VERIPB TRACER tracing start of proof with %" PRId64
+       "original clauses",
+       id);
+  veripb_begin_proof (id);
+}
+
+void VeripbTracer::add_derived_clause (int64_t id, bool redundant,
+                                       int witness,
+                                       const vector<int> &clause,
+                                       const vector<int64_t> &chain) {
+  if (file->closed ())
+    return;
+  LOG ("VERIPB TRACER tracing addition of derived clause[%" PRId64 "]", id);
+  if (witness)
+    veripb_add_derived_clause (id, redundant, witness, clause);
+  else if (with_antecedents)
+    veripb_add_derived_clause (id, redundant, clause, chain);
+  else
+    veripb_add_derived_clause (id, redundant, clause);
+#ifndef QUIET
+  added++;
+#endif
+}
+
+void VeripbTracer::delete_clause (int64_t id, bool redundant,
+                                  const vector<int> &) {
+  if (file->closed ())
+    return;
+  LOG ("VERIPB TRACER tracing deletion of clause[%" PRId64 "]", id);
+  veripb_delete_clause (id, redundant);
+#ifndef QUIET
+  deleted++;
+#endif
+}
+
+void VeripbTracer::report_status (int status, int64_t conflict_id) {
+  if (file->closed ())
+    return;
+#ifdef LOGGING
+  if (conflict_id)
+    LOG ("VERIPB TRACER tracing finalization of proof with empty "
+         "clause[%" PRId64 "]",
+         conflict_id);
+#endif
+  veripb_report_status (status == UNSATISFIABLE, conflict_id);
+}
+
+void VeripbTracer::weaken_minus (int64_t id, const vector<int> &) {
+  if (!checked_deletions)
+    return;
+  if (file->closed ())
+    return;
+  LOG ("VERIPB TRACER tracing weaken minus of clause[%" PRId64 "]", id);
+  last_id = id;
+  insert ();
+}
+
+void VeripbTracer::strengthen (int64_t id) {
+  if (file->closed ())
+    return;
+  LOG ("VERIPB TRACER tracing strengthen of clause[%" PRId64 "]", id);
+  veripb_strengthen (id);
+}
+
+/*------------------------------------------------------------------------*/
+
+bool VeripbTracer::closed () { return file->closed (); }
+
+#ifndef QUIET
+
+void VeripbTracer::print_statistics () {
+  // TODO complete
+  uint64_t bytes = file->bytes ();
+  uint64_t total = added + deleted;
+  MSG ("VeriPB %" PRId64 " added clauses %.2f%%", added,
+       percent (added, total));
+  MSG ("VeriPB %" PRId64 " deleted clauses %.2f%%", deleted,
+       percent (deleted, total));
+  MSG ("VeriPB %" PRId64 " bytes (%.2f MB)", bytes,
+       bytes / (double) (1 << 20));
+}
+
+#endif
+
+void VeripbTracer::close (bool print) {
+  assert (!closed ());
+  file->close ();
+#ifndef QUIET
+  if (print) {
+    MSG ("VeriPB proof file '%s' closed", file->name ());
+    print_statistics ();
+  }
+#else
+  (void) print;
+#endif
+}
+
+void VeripbTracer::flush (bool print) {
+  assert (!closed ());
+  file->flush ();
+#ifndef QUIET
+  if (print) {
+    MSG ("VeriPB proof file '%s' flushed", file->name ());
+    print_statistics ();
+  }
+#else
+  (void) print;
+#endif
+}
+
+} // namespace CaDiCaL

data/ext/cadical/cadical/src/veripbtracer.hpp

@@ -0,0 +1,106 @@
+#ifndef _veripbtracer_h_INCLUDED
+#define _veripbtracer_h_INCLUDED
+
+#include "file.hpp"
+#include "tracer.hpp"
+
+namespace CaDiCaL {
+
+struct HashId {
+  HashId *next;  // collision chain link for hash table
+  uint64_t hash; // previously computed full 64-bit hash
+  int64_t id;    // id of clause
+};
+
+class VeripbTracer : public FileTracer {
+
+  Internal *internal;
+  File *file;
+#ifndef NDEBUG
+  bool binary;
+#endif
+  bool with_antecedents;
+  bool checked_deletions;
+
+  // hash table for checked deletions
+  //
+  uint64_t num_clauses;  // number of clauses in hash table
+  uint64_t size_clauses; // size of clause hash table
+  HashId **clauses;      // hash table of clauses
+
+  static const unsigned num_nonces = 4;
+
+  uint64_t nonces[num_nonces]; // random numbers for hashing
+  uint64_t last_hash;          // last computed hash value of clause
+  int64_t last_id;             // id of the last added clause
+  HashId *last_clause;
+  uint64_t compute_hash (int64_t); // compute and save hash value of clause
+
+  HashId *new_clause ();
+  void delete_clause (HashId *);
+
+  // Reduce hash value to the actual size.
+  //
+  static uint64_t reduce_hash (uint64_t hash, uint64_t size);
+
+  void enlarge_clauses (); // enlarge hash table for clauses
+  void insert ();          // insert clause in hash table
+  bool
+  find_and_delete (const int64_t); // find clause position in hash table
+
+#ifndef QUIET
+  int64_t added, deleted;
+#endif
+  std::vector<int64_t> delete_ids;
+
+  void put_binary_zero ();
+  void put_binary_lit (int external_lit);
+  void put_binary_id (int64_t id, bool = false);
+
+  // support veriPB
+  void veripb_add_derived_clause (int64_t, bool redundant, int witness,
+                                  const std::vector<int> &clause);
+  void veripb_add_derived_clause (int64_t, bool redundant,
+                                  const std::vector<int> &clause,
+                                  const std::vector<int64_t> &chain);
+  void veripb_add_derived_clause (int64_t, bool redundant,
+                                  const std::vector<int> &clause);
+  void veripb_begin_proof (int64_t reserved_ids);
+  void veripb_delete_clause (int64_t id, bool redundant);
+  void veripb_report_status (bool unsat, int64_t conflict_id);
+  void veripb_strengthen (int64_t);
+
+public:
+  // own and delete 'file'
+  VeripbTracer (Internal *, File *file, bool, bool, bool);
+  ~VeripbTracer ();
+
+  void connect_internal (Internal *i) override;
+  void begin_proof (int64_t) override;
+
+  void add_original_clause (int64_t, bool, const std::vector<int> &,
+                            bool = false) override {} // skip
+
+  void add_derived_clause (int64_t, bool, int, const std::vector<int> &,
+                           const std::vector<int64_t> &) override;
+
+  void delete_clause (int64_t, bool, const std::vector<int> &) override;
+  void finalize_clause (int64_t, const std::vector<int> &) override {
+  } // skip
+
+  void report_status (int, int64_t) override;
+
+  void weaken_minus (int64_t, const std::vector<int> &) override;
+  void strengthen (int64_t) override;
+
+#ifndef QUIET
+  void print_statistics ();
+#endif
+  bool closed () override;
+  void close (bool) override;
+  void flush (bool) override;
+};
+
+} // namespace CaDiCaL
+
+#endif

data/ext/cadical/cadical/src/version.cpp

@@ -0,0 +1,107 @@
+/*------------------------------------------------------------------------*/
+
+// To simplify the build process without 'make', you can disable the
+// generation of 'build.hpp' through '../scripts/make-build-header.sh' by
+// defining '-DNBUILD'.  Then we try to guess part of the configuration.
+
+#ifndef NBUILD
+#if __GNUC__ > 4
+#if __has_include(<build.hpp>)
+#include "build.hpp"
+#endif // __has_include
+#else
+#include "build.hpp"
+#endif // __GNUC > 4
+#endif // NBUILD
+
+/*------------------------------------------------------------------------*/
+
+// We prefer short 3 character version numbers made of digits and lower case
+// letters only, which gives 36^3 = 46656 different versions.  The following
+// macro is used for the non-standard build process and only set from
+// the file '../VERSION' with '../scripts/update-version.sh'.  The standard
+// build process relies on 'VERSION' to be defined in 'build.hpp'.
+
+#ifdef NBUILD
+#ifndef VERSION
+#define VERSION "3.0.0"
+#endif // VERSION
+#endif // NBUILD
+
+/*------------------------------------------------------------------------*/
+
+// The copyright of the code is here.
+
+static const char *COPYRIGHT = "Copyright (c) 2016-2025";
+static const char *AUTHORS =
+    "A. Biere, M. Fleury, N. Froleyks, K. Fazekas, F. Pollitt, T. Faller";
+static const char *AFFILIATIONS =
+    "JKU Linz, University of Freiburg, TU Wien";
+
+/*------------------------------------------------------------------------*/
+
+// Again if we do not have 'NBUILD' or if something during configuration is
+// broken we still want to be able to compile the solver.  In this case we
+// then try our best to figure out 'COMPILER' and 'DATE', but for
+// 'IDENTIFIER' and 'FLAGS' we can only use the '0' string, which marks
+// those as unknown.
+
+#ifndef COMPILER
+#ifdef __clang__
+#ifdef __VERSION__
+#define COMPILER "clang++-" __VERSION__
+#else
+#define COMPILER "clang++"
+#endif
+#elif defined(__GNUC__)
+#ifdef __VERSION__
+#define COMPILER "g++-" __VERSION__
+#else
+#define COMPILER "g++"
+#endif
+#else
+#define COMPILER 0
+#endif
+#endif
+
+// GIT SHA2 identifier.
+//
+#ifndef IDENTIFIER
+#define IDENTIFIER 0
+#endif
+#ifdef SHORTID
+#define SHORTIDSTR "-" SHORTID
+#else
+#define SHORTIDSTR ""
+#define SHORTID 0
+#endif
+
+// Compilation flags.
+//
+#ifndef FLAGS
+#define FLAGS 0
+#endif
+
+// Build Time and operating system.
+//
+#ifndef DATE
+#define DATE __DATE__ " " __TIME__
+#endif
+
+/*------------------------------------------------------------------------*/
+
+#include "version.hpp"
+
+namespace CaDiCaL {
+
+const char *version () { return VERSION; }
+const char *copyright () { return COPYRIGHT; }
+const char *authors () { return AUTHORS; }
+const char *affiliations () { return AFFILIATIONS; }
+const char *signature () { return "cadical-" VERSION SHORTIDSTR; }
+const char *identifier () { return IDENTIFIER; }
+const char *compiler () { return COMPILER; }
+const char *date () { return DATE; }
+const char *flags () { return FLAGS; }
+
+} // namespace CaDiCaL

data/ext/cadical/cadical/src/version.hpp

@@ -0,0 +1,13 @@
+namespace CaDiCaL {
+
+const char *version ();
+const char *copyright ();
+const char *authors ();
+const char *affiliations ();
+const char *signature ();
+const char *identifier ();
+const char *compiler ();
+const char *date ();
+const char *flags ();
+
+} // namespace CaDiCaL