# The VLSAT-3 Benchmark Suite

arXiv: https://arxiv.org/abs/2112.03675 · HTML: https://mlsanity.com/paper/2112.03675/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 7 Dec 2021.

## Built on by (most cited first, 1 of 1)

- [An Eager Satisfiability Modulo Theories Solver for Algebraic Datatypes](https://mlsanity.com/paper/2310.12234/) (2023)

## Abstract (arXiv)

This report presents VLSAT-3 (an acronym for "Very Large Boolean SATisfiability problems"),the third part of a benchmark suite to be used in scientific experimentsand software competitions addressing SAT and SMT (Satisfiability Modulo Theories) solving issues.VLSAT-3 contains 1200 (600~satisfiable and 600~unsatisfiable) quantifier-free first-order logic formulasof increasing complexity, proposed in SMT-LIB format under a permissive Creative Commons license.More than 90% of these benchmarks have been used during the 16th International Satisfiability Modulo TheoriesCompetition (SMT-COMP~2021).