Home › Datasets › task › Automated Theorem Proving

Automated Theorem Proving datasets

archive 2025-07-28

8 datasets carry the task tag "Automated Theorem Proving" (the task itself: Automated Theorem Proving), ordered by the archive's paper count. Page 1 of 1: 8 shown of 8. Facet routes are this site's own (the archive records the tag string, not a page).

The archive holds 12,214 dataset rows; 12,172 are listed. 6 are withheld from every listing and count here as vandalised before snapshot (6 with contact-centre spam in the title, 0 with a spam description on a row that has no homepage, no paper and no papers counted; none with more than 1 paper, 0 with a benchmark), listed in withheld.json; 1 listed row carries a vandalised description, withheld on its page. This gate never withholds a row with a homepage or a paper that resolves, and a clean description; the content rules below withhold a row whose name is spam whatever else it carries. The gate is a phrase list: these are the rows it caught, not a claim that the rest is clean. Before that gate, the site's content rules withhold 36 more rows (invite-code, gambling, travel-booking, contact-centre and similar spam in the name or on a row with nothing real behind it); they have no page and are listed in withheld.json.

Filter 51 task tags shown of 3,717, by dataset count; the full filter by modality, task and language is on /datasets

Automated Theorem Proving datasets 1–8 of 8

MiniF2F is a dataset of formal Olympiad-level mathematics problems statements intended to provide a unified cross-system benchmark for neural theorem proving.
84 papers · 2 benchmarks
A new large-scale geometry problem-solving dataset - 3,002 multi-choice geometry problems - dense annotations in formal language for the diagrams and text - 27,213 annotated diagram logic forms (literals) - 6,293 annotated text logic forms…
45 papers · 1 benchmark
ProofNet is a benchmark for autoformalization and formal proving of undergraduate-level mathematics.
27 papers · 0 benchmarks
MED (Monotonicity Entailment Dataset)
MED is a new evaluation dataset that covers a wide range of monotonicity reasoning that was created by crowdsourcing and collected from linguistics publications.
18 papers · 1 benchmark
HolStep is a dataset based on higher-order logic (HOL) proofs, for the purpose of developing new machine learning-based theorem-proving strategies.
10 papers · 2 benchmarks
This relational database consists of 24 unique names in two families (they have equivalent structures).
10 papers · 0 benchmarks
The official HOList benchmark for automated theorem proving consists of all theorem statements in the core, complex, and flyspeck corpora.
8 papers · 1 benchmark
GamePad that can be used to explore the application of machine learning methods to theorem proving in the Coq proof assistant.
1 paper · 0 benchmarks

Paper counts and descriptions are the archive's, frozen 2025-07-28; no citation counts, no stars, no trending. Sorting by "most cited" or "newest" was a live-site feature the archive does not carry.