Parity Game SAT Benchmarks
These benchmarks originate from my research investigating the structure of parity games that are found to be tough to solve for the standard strategy improvement algorithm. All following downloads are distributed under the BSD license
The generator is written in OCaml
. You will therefore need an OCaml compiler to produce an executable.
If you want to generate difficult sat-instances using the generator by yourself, I suggest to combine the command line arguments "-pp -ce -ci -n N -i I", where N should be a natural number greater than 5 and lower than 10 (the higher, the harder...) and I should also be a natural number near N.
Click on the download button below to obtain a zip archive with the SAT benchmark generator
Download Pregenerated Instances
Click on the download button below to obtain a zip archive with pregenerated SAT instances (about 4 MB).