Math Proof Refinery v1 sample
A small, honest first version: math problems, each paired with a step-by-step derivation that was re-computed and checked by sympy. A row is only marked verified if every check passed. Everything else is marked unverified.
What "verified" means here. The problem contains one math expression (or one equation). A rule turns it into a claim: expression = boxed answer, expression equals the answer for all values of its variables, or the real solutions of the equation are exactly the listed set. sympy then recomputes each derivation step and checks that the claim holds. It does not check that the claim captures every word of the problem statement, and it is not a Lean or Isabelle proof. This build has no Lean toolchain.
Browse the free sample
Where the problems come from
- Source: Hendrycks MATH, test split (algebra, prealgebra, number theory), EleutherAI/hendrycks_math. License: MIT. Hendrycks et al., "Measuring Mathematical Problem Solving With the MATH Dataset", NeurIPS 2021.
- Problems and boxed answers are the source's. The derivations and the verifier status are what this build adds. Rows for which no derivation could be built keep the source's own solution text, labelled as unchecked.
Limits
- Only problems with a single plain expression or equation fit the three rule families, so the output is small compared with the 2,598 problems read. The exact counts are in the boxes above.
- The free sample on this page is a subset of the full file. The sample's rows are the same as the full set's rows; nothing here is more accurate than the paid file.
- The source problems are free to download from the original dataset. What the paid file adds is the verified derivations, the per-row verifier detail, and the script that rebuilds it.
- Page text is shown as raw LaTeX. This page loads no scripts or fonts from other sites and sends nothing anywhere.