mlsanityData to 14 Oct 2026

The VLSAT-3 Benchmark Suite

arXiv 2112.03675 ↗First posted 7 Dec 2021cs.DS cs.FL cs.SCcited by 1

Not on the map. Why?

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).

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

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.