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

Download the sample (JSON)

Where the problems come from

Limits