The VLSAT-2 Benchmark Suite
Pierre Bouvier (CONVECS ), Hubert Garavel (CONVECS )
TL;DR
VLSAT-2 is a comprehensive benchmark suite with 100 complex SAT problems, designed to evaluate and improve SAT solvers, with some benchmarks previously used in international competitions.
Contribution
This paper introduces VLSAT-2, a new benchmark suite with diverse SAT problems, expanding resources for SAT solver testing and research.
Findings
Contains 100 benchmarks with balanced satisfiable and unsatisfiable formulas
Includes problems of increasing complexity for robust testing
Some benchmarks have been used in international SAT competitions
Abstract
This report presents VLSAT-2 (an acronym for "Very Large Boolean SATisfiability problems),the second part of a benchmark suite to be used in scientific experiments and softwarecompetitions addressing SAT-solving issues.VLSAT-2 contains 100 benchmarks (50 satisfiable and 50 unsatisfiable formulas)of increasing complexity, proposed in DIMACS CNF format undera permissive Creative Commons license.25% of these benchmarks have been used during the 2020 and 2021 editionsof the International SAT Competition.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.