Information
D-Syrup is an original
distributed SAT solver based on the
portfolio paradigm. This solver, dedicated to work on
plenty of cores, implements a new fully hybrid distributed
programming model from Syrup. This
page contains the version
of D-Syrup proposed in the paper "A
Distributed Version of Syrup" accepted to the 20th
International Conference on Theory and Applications of
Satisfiability Testing
(SAT'17). [PDF]
People involved in this project:
People involved in this project:
- Gilles Audemard (audemard@cril.fr)
- Jean-Marie Lagniez (lagniez@cril.fr)
- Nicolas Szczepanski (szczepanski@cril.fr)
- Sébastien Tabary (tabary@cril.fr)
Resources
- Source files with some tests and CNF
instances (New version : dsyrup2)
of D-Syrup 2 :
[dsyrup2.zip] (30MB) - SAT-Race 2015 Parallel track
benchmarks
link :
[sr15bench-hard.zip] (329MB) - SAT-Competition 2016 Application track
benchmarks
link :
[app16.zip] (1.6GB)
Results
