Published July 17, 2020 | Version v1

Analyzed Benchmarks on Experiments for a SAT Time Leap Challenge

  • 1. TU Dresden
  • 2. TU Wien

Description

For details see: 

Johannes K. Fichte, Markus Hecher, Stefan Szeider: A Time Leap Challenge for SAT-Solving, Proceedings of the 26th International Conference on Principles and Practice of Constraint Programming (CP'2020).

We include the sources from various authors.

zchaff is available at:  https://www.princeton.edu/~chaff/ zchaff.html

For the benchmark set, we refer to https://www.cs.uni-potsdam.de/wv/projects/sets/set-industrial-09-12.tar.xz or https://www.cs.uni-potsdam.de/wv/projects/sets. The instances are also available on Zenodo at: https://doi.org/10.5281/zenodo.3989071

Files

output_sat_knl.csv

Files (371.5 MB)

Name Size
md5:001b71d3f41803b3078d37781efaff44
1.7 MB Preview Download
md5:a80003715436633d03a62c13b8f02f8a
1.1 MB Preview Download
md5:9bf2f44e48666694508af066e48d28c4
315.3 kB Preview Download
md5:18efa559b3d646dce186fb7a51519d44
357.9 MB Download
md5:84b78bb72b159fb14ef939149f35da13
10.4 MB Download