Datasets:
theorem_id int64 1 2.65k | source stringclasses 8
values | item_id stringlengths 1 132 | title stringlengths 1 95 | tier stringclasses 2
values | prover stringclasses 10
values | content stringlengths 44 290k | artifact stringlengths 40 167 | sha256 stringlengths 64 64 | split stringclasses 2
values |
|---|---|---|---|---|---|---|---|---|---|
1 | babel-formal | circle_average | circle_average | a | lean4 | class AddMonoid (R : Type) where
zero : R
add : R β R β R
add_zero : β x, add x zero = x
add_comm : β x y, add x y = add y x
add_assoc : β x y z, add (add x y) z = add x (add y z)
namespace CircleAverage
variable {R : Type} [AddMonoid R]
axiom integral : (R β R) β R
axiom integral_ext :... | src_data/babel-formal/stmts/lean4/circle_average.lean | c53837889407069e16d1a60939fbf34b9d0f56199c2c6ff525f8f50b24b030bb | null |
1 | babel-formal | circle_average | circle_average | a | rocq | Class AddMonoid (R : Type) := {
zero : R;
add : R -> R -> R;
add_zero : forall x, add x zero = x;
add_comm : forall x y, add x y = add y x;
add_assoc : forall x y z, add (add x y) z = add x (add y z)
}.
Section CircleAverage.
Context {R : Type} {M : AddMonoid R}.
Axiom integral : (R -... | src_data/babel-formal/stmts/rocq/circle_average.v | 48f06b4449ff478ccae4ed017f3167b25fadb02978d343b51bfc4583898a1493 | null |
1 | babel-formal | circle_average | circle_average | a | isabelle | theory circle_average
imports Main
begin
locale circle_average_setup =
fixes zero :: "'r"
and add :: "'r \<Rightarrow> 'r \<Rightarrow> 'r" (infixl "+C" 65)
and integral :: "('r \<Rightarrow> 'r) \<Rightarrow> 'r"
assumes add_zero : "\<And>x. x +C zero = x"
and add_comm : "\<... | src_data/babel-formal/stmts/isabelle/circle_average.thy | 71e8b60287645f0722b299cd1f5a09e2ce4ba1698727532adf15877eddd8a0d9 | null |
1 | babel-formal | circle_average | circle_average | a | hol-light | let is_add_monoid = new_definition
`is_add_monoid (zero:A) (add:A->A->A) <=>
(!x. add x zero = x) /\
(!x y. add x y = add y x) /\
(!x y z. add (add x y) z = add x (add y z))`;;
let is_integral = new_definition
`is_integral (integral:(A->A)->A) (add:A->A->A) (zero:A) <=>
(!g h. (!t. g t = h ... | src_data/babel-formal/stmts/hol-light/circle_average.ml | 9554fc3b628e83d21a6e8d72888abe1071f8a834648cde5ef8643d47c5ecdb30 | null |
1 | babel-formal | circle_average | circle_average | a | acl2 | ;; Statement-only formalization of Babel-formal artifact circle_average:
;; circle maps and circle averages over an arbitrary commutative additive
;; monoid with an extensional, constant-preserving, additive, and
;; translation-invariant integral, asserting the source's seventeen
;; identities. This file contains no pr... | src_data/babel-formal/stmts/acl2/circle_average.lsp | dff60c791b77f7ca1282cc803d3a736d95155b8da5fbe92f73f1c96ee229fd11 | null |
1 | babel-formal | circle_average | circle_average | a | agda | -- Statement-only formalization of the Babel-formal topic circle_average. This file contains no
-- proof.
module circle_average where
open import Agda.Primitive using (Level)
open import Agda.Builtin.Equality using (_β‘_)
record AddMonoid {β : Level} (R : Set β) : Set β where
field
zero : R
add :... | src_data/babel-formal/stmts/agda/circle_average.agda | 68dfc53c6541aa0add39404aa1644c0a4cdfff6f8c1c10e75935b34526448f8b | null |
1 | babel-formal | circle_average | circle_average | a | hol4 | (*
Statement-only formalization of the Babel-formal topic circle_average. This file contains no
proof.
*)
open HolKernel Parse boolLib;
val is_add_monoid_def = new_definition (
"is_add_monoid_def",
``is_add_monoid (zero : 'a) (add : 'a -> 'a -> 'a) <=>
(!x. add x zero = x) /\
(!x y. add x y = add ... | src_data/babel-formal/stmts/hol4/circle_average.sml | b22b292b54598ca0f3e9b45d6d723044a473e229e3739b68cd5c7f56b39c6da3 | null |
1 | babel-formal | circle_average | circle_average | a | metamath | $(
Statement-only formalization of the Babel-formal topic circle_average. This file contains no
proof.
$)
$(
Statement-only encoding of the circle-average theory.
obj is the fixed abstract carrier R, and fun is the function sort R -> R.
forallObj, forallFun, and lambda are object-language binders. The oper... | src_data/babel-formal/stmts/metamath/circle_average.mm | c80c441b3036aa169abd6cfb0201ed25331c9801a58bd6441218eaf6c95d4f90 | null |
1 | babel-formal | circle_average | circle_average | a | mizar | :: Statement-only formalization of the Babel-formal topic circle_average. This file contains no
:: proof.
environ
vocabularies FUNCT_1, FUNCT_2, RELAT_1, XBOOLE_0, ZFMISC_1,
SUBSET_1, TARSKI, PARTFUN1, BINOP_1;
notations TARSKI, XBOOLE_0, ZFMISC_1, SUBSET_1, RELAT_1,
FUNCT_1, RELSET_1, PARTFUN1, FUNCT_2, B... | src_data/babel-formal/stmts/mizar/circle_average.miz | 1e8f0f7c646d50043ba3f5f6780a5478b364811ba1e291a73987e424c69089fa | null |
1 | babel-formal | circle_average | circle_average | a | pvs | % Statement-only formalization of the Babel-formal topic circle_average. This file contains no
% proof.
circle_average[
R: TYPE+,
zero: R,
add: [R, R -> R],
integral: [[R -> R] -> R]
]: THEORY
BEGIN
add_monoid: bool =
(FORALL (x: R): add(x, zero) = x)
AND (FORALL (x, y: R): add(x, y) = add(y, x))
... | src_data/babel-formal/stmts/pvs/circle_average.pvs | a8eab1ac43b75071e10dc7b55d38b529f9d1a869ed8f994f172f988ae036ec17 | null |
2 | babel-formal | comp_commute | comp_commute | a | lean4 | universe u v w
namespace CompCommute
variable {Ξ± : Type u} {Ξ² : Type v} {Ξ³ : Type w}
def comp {Ξ± Ξ² Ξ³} (g : Ξ² β Ξ³) (f : Ξ± β Ξ²) : Ξ± β Ξ³ := fun x => g (f x)
def id {Ξ±} : Ξ± β Ξ± := fun x => x
axiom comp_assoc : β {Ξ± Ξ² Ξ³ Ξ΄} (h : Ξ³ β Ξ΄) (g : Ξ² β Ξ³) (f : Ξ± β Ξ²), comp h (comp g f) = comp (comp h g) f
axiom comp_id_l : β {Ξ±... | src_data/babel-formal/stmts/lean4/comp_commute.lean | c00920a341aedd31dfd481ba90086dbb117b19c3ec74af00dc943603377e9c91 | null |
2 | babel-formal | comp_commute | comp_commute | a | rocq | Section CompCommute.
Universes u v w.
Definition comp {Ξ± Ξ² Ξ³ : Type} (g : Ξ² -> Ξ³) (f : Ξ± -> Ξ²) : Ξ± -> Ξ³ := fun x => g (f x).
Definition id {Ξ± : Type} : Ξ± -> Ξ± := fun x => x.
Class FunProps := {
comp_assoc : forall {Ξ± Ξ² Ξ³ Ξ΄} (h : Ξ³ -> Ξ΄) (g : Ξ² -> Ξ³) (f : Ξ± -> Ξ²), comp h (comp g f) = comp (comp h g) f;
... | src_data/babel-formal/stmts/rocq/comp_commute.v | 1b5d3c79e575ebe4b41eae556c1b87c60d017ddb7912aef2705e88f72cac5630 | null |
2 | babel-formal | comp_commute | comp_commute | a | isabelle | theory comp_commute
imports Main
begin
definition myComp :: "('b \<Rightarrow> 'c) \<Rightarrow> ('a \<Rightarrow> 'b) \<Rightarrow> ('a \<Rightarrow> 'c)"
where "myComp g f \<equiv> \<lambda>x. g (f x)"
definition myId :: "'a \<Rightarrow> 'a"
where "myId \<equiv> \<lambda>x. x"
lemma comp_assoc:
"myComp ... | src_data/babel-formal/stmts/isabelle/comp_commute.thy | 2e67f339d5713cde7b88279e1316815f0bf77ca80e90cbeb5bba3f56e328c89b | null |
2 | babel-formal | comp_commute | comp_commute | a | hol-light | let myComp = new_definition
`myComp (g:B->C) (f:A->B) = (\x:A. g (f x))`;;
let myId = new_definition
`myId = (\x:A. x)`;;
let comp_assoc =
`!h g f. myComp h (myComp g f) = myComp (myComp h g) f`;;
let comp_id_l =
`!f:A->B. myComp myId f = f`;;
let comp_id_r =
`!f:A->B. myComp f myId = f`;;
let commute = ... | src_data/babel-formal/stmts/hol-light/comp_commute.ml | 78126c7e644ef2018ef447e54e138d867de30d8c5b641e705ba076262bf7e327 | null |
2 | babel-formal | comp_commute | comp_commute | a | acl2 | ;; Statement-only formalization of Babel-formal artifact comp_commute:
;; composition and identity laws for arbitrary functions between arbitrary
;; carriers, together with basic properties of commuting endofunctions. This
;; file contains no proof.
(in-package "ACL2")
(set-inhibit-output-lst '(prove proof-tree event... | src_data/babel-formal/stmts/acl2/comp_commute.lsp | 8e90313172070e9de723824b72a2c64b1f0c9989f226dee7e9ecb1957733da45 | null |
2 | babel-formal | comp_commute | comp_commute | a | agda | -- Statement-only formalization of the Babel-formal topic comp_commute. This file contains no
-- proof.
module comp_commute where
open import Agda.Primitive using (Level; SetΟ)
open import Agda.Builtin.Equality using (_β‘_)
comp : β {a b c : Level}
{A : Set a} {B : Set b} {C : Set c} β
(B β C) β (A β ... | src_data/babel-formal/stmts/agda/comp_commute.agda | 12ad35d0322fb9e76c9299b42a45ec888bd036d0b4386607d54c6aa1a4a782b8 | null |
2 | babel-formal | comp_commute | comp_commute | a | hol4 | (*
Statement-only formalization of the Babel-formal topic comp_commute. This file contains no
proof.
*)
open HolKernel Parse boolLib;
val cc_comp_def = new_definition (
"cc_comp_def",
``cc_comp (g : 'b -> 'c) (f : 'a -> 'b) =
\x. g (f x)``);
val cc_id_def = new_definition (
"cc_id_def",
``cc_id (x ... | src_data/babel-formal/stmts/hol4/comp_commute.sml | 599cf5e3a6f7b884e5c9aaf75a3200250fe21de33c97c11f581f5664b6b055c3 | null |
2 | babel-formal | comp_commute | comp_commute | a | metamath | $(
Statement-only formalization of the Babel-formal topic comp_commute. This file contains no
proof.
$)
$(
A statement-only encoding of polymorphic function composition, identity,
and commuting endomorphisms.
$)
$c type func wff |- ( ) -> => : = comp id commute <-> $.
$v A B C D f g h f1 f2 g1 g2 ph ps $.
t... | src_data/babel-formal/stmts/metamath/comp_commute.mm | 3a547c54292c848506bf376aa593a5dc3e45c21d6d6dd41738e5f3ea79f5339d | null |
2 | babel-formal | comp_commute | comp_commute | a | mizar | :: Statement-only formalization of the Babel-formal topic comp_commute. This file contains no
:: proof.
environ
vocabularies RELAT_1, FUNCT_1, FUNCT_2;
notations XBOOLE_0, RELAT_1, FUNCT_1, FUNCT_2;
constructors RELAT_1, FUNCT_1, FUNCT_2;
registrations RELAT_1, FUNCT_1, FUNCT_2;
begin
::$P-
theorem
for A,B... | src_data/babel-formal/stmts/mizar/comp_commute.miz | 1e81aea8b3ad8b7d96c170dafa452a7f4fca961e79bba03e5a56dd7c29911ef6 | null |
2 | babel-formal | comp_commute | comp_commute | a | pvs | % Statement-only formalization of the Babel-formal topic comp_commute. This file contains no
% proof.
comp_commute[A: TYPE+]: THEORY
BEGIN
myComp(g, f: [A -> A]): [A -> A] =
LAMBDA (x: A): g(f(x))
myId(x: A): A = x
comp_assoc: bool =
FORALL (h, g, f: [A -> A]):
myComp(h, myComp(g, f)) = myComp(my... | src_data/babel-formal/stmts/pvs/comp_commute.pvs | 9df0c67c092646114d4fa194e31911ee5235394628932b99e7d0f43ad47c1c8b | null |
3 | babel-formal | galois | galois | a | lean4 | class Field (F : Type) where
zero_F : F
one_F : F
add_F : F β F β F
mul_F : F β F β F
opp_F : F β F
inv_F : F β F
add_comm : β x y, add_F x y = add_F y x
add_assoc : β x y z, add_F (add_F x y) z = add_F x (add_F y z)
add_zero : β x, add_F x zero_F = x
add_inv_l : β ... | src_data/babel-formal/stmts/lean4/galois.lean | 2e50a004a3b6ad8d275cbf661c3790d7d6d0f13e6bc040c01ba54df047fc5121 | null |
3 | babel-formal | galois | galois | a | rocq | Class Field (F : Type) := {
zero_F : F;
one_F : F;
add_F : F -> F -> F;
mul_F : F -> F -> F;
opp_F : F -> F;
inv_F : F -> F;
add_comm : forall x y, add_F x y = add_F y x;
add_assoc : forall x y z, add_F (add_F x y) z = add_F x (add_F y z);
add_zero : forall x, add_F x z... | src_data/babel-formal/stmts/rocq/galois.v | 5152380ce58c0d786f549f2c5ad6e4beda88d5e89b5e68f6ac7185d444a86f40 | null |
3 | babel-formal | galois | galois | a | isabelle | theory galois
imports Main
begin
locale field_like =
fixes zero_F one_F :: "'f"
and add_F :: "'f \<Rightarrow> 'f \<Rightarrow> 'f" (infixl "+F" 65)
and mul_F :: "'f \<Rightarrow> 'f \<Rightarrow> 'f" (infixl "*F" 70)
and opp_F :: "'f \<Rightarrow> 'f"
and inv_F :: "'f \<Rightarrow> 'f"
ass... | src_data/babel-formal/stmts/isabelle/galois.thy | fdeeb688101b402a4c08e0fb4c54b4015b79b2ee317ac64baa98ce16ea874996 | null |
3 | babel-formal | galois | galois | a | hol-light | let field_like = new_definition
`field_like (zero_F:'a) (one_F:'a) (add_F:'a->'a->'a) (mul_F:'a->'a->'a)
(opp_F:'a->'a) (inv_F:'a->'a) <=>
(!x:'a y:'a. add_F x y = add_F y x) /\
(!x:'a y:'a z:'a. add_F (add_F x y) z = add_F x (add_F y z)) /\
(!x:'a. add_F x zero_F = x) /\
(!x:'a. add... | src_data/babel-formal/stmts/hol-light/galois.ml | 3f18c4527a9beb3f309cf92fdf01a08608eb260fc6b8f5f27cd8e58112926230 | null |
3 | babel-formal | galois | galois | a | acl2 | ;; Statement-only formalization of Babel-formal corpus artifact galois:
;; cancellation and inverse laws for arbitrary fields, and solvability
;; propagation through map-sensitive polynomial maps and splitting-field
;; towers over arbitrary types. This file contains no proof.
(in-package "ACL2")
(set-inhibit-output-l... | src_data/babel-formal/stmts/acl2/galois.lsp | 0fef7e52972c648d16a00d8090cdfa547ca4b6fbd18b660678593b818f9767d9 | null |
3 | babel-formal | galois | galois | a | agda | -- Statement-only formalization of the Babel-formal topic galois. This file contains no proof.
module galois where
open import Agda.Builtin.Equality using (_β‘_)
data β₯ : Set where
infix 4 _β’_
_β’_ : {A : Set} β A β A β Set
x β’ y = x β‘ y β β₯
infixr 2 _β§_
record _β§_ (A B : Set) : Set where
field
left : A
r... | src_data/babel-formal/stmts/agda/galois.agda | 41a852fea2729ca3ed7c1b3b1708bd7e89afceb64cb7dcd70c796ab02ba5c0ca | null |
3 | babel-formal | galois | galois | a | hol4 | (*
Statement-only formalization of the Babel-formal artifact galois: field
cancellation laws and solvability across polynomial maps and splitting-field
towers. This file contains no proof.
*)
open HolKernel Parse boolLib;
val _ = new_theory "hello";
val add_cancel_l =
``!(zerof : 'f) (onef : 'f)
(addf ... | src_data/babel-formal/stmts/hol4/galois.sml | cb24f954ccb6ae122bac6462d4c79331202cb77fcd78dcb5f1555d508421afc1 | null |
3 | babel-formal | galois | galois | a | metamath | $(
Statement-only formalization of the Babel-formal galois artifact: field
cancellation and inverses, and solvability of Galois groups along polynomial
splitting-field towers. This file contains no proof.
$)
$(
Statement-only translation of the Babel-formal galois artifact.
The object language is many-sorte... | src_data/babel-formal/stmts/metamath/galois.mm | fb22038b497624f3751327c07842247e7b36b0153d5735348202613106f61012 | null |
3 | babel-formal | galois | galois | a | mizar | :: Statement-only formalization of the Babel-formal artifact galois: field
:: cancellation laws and solvability along polynomial and splitting-field maps.
:: This file contains no proof.
environ
vocabularies TARSKI, XBOOLE_0, SUBSET_1, FUNCT_1, FUNCT_2, RELAT_1,
ZFMISC_1, BINOP_1;
notations TARSKI, XBOOLE_0, Z... | src_data/babel-formal/stmts/mizar/galois.miz | bce75648b2680356e872eb90c83b20b4bce86237a838a92769678d493da602c7 | null |
3 | babel-formal | galois | galois | a | pvs | % Statement-only formalization of the Babel-formal artifact galois, concerning field
% cancellation laws and solvability across Galois-theoretic polynomial towers. This file
% contains no proof.
galois_field[
FieldElem: TYPE,
zero_F: FieldElem,
one_F: FieldElem,
add_F: [FieldElem, FieldElem -> FieldElem],
mu... | src_data/babel-formal/stmts/pvs/galois.pvs | 5b30e4963c5dbea6062b53905cd30741312395ac1367d6070782205309a7fde0 | null |
4 | babel-formal | graph_paths | graph_paths | a | lean4 | universe u
namespace GraphPath
variable {V : Type u}
def Edge (V : Type u) := V β V β Prop
inductive Path (E : Edge V) : V β V β Prop
| nil : β v, Path E v v
| step : β {u v w}, Path E u v β E v w β Path E u w
variable {E : Edge V}
theorem refl (v : V) : Path (E:=E) v v := Path.nil v
theorem trans {u v w : V} ... | src_data/babel-formal/stmts/lean4/graph_paths.lean | 48a84cc2bbab86c56e46364733c42c4b84082e90a3e06c9c21fd78d79ddb4407 | null |
4 | babel-formal | graph_paths | graph_paths | a | rocq | Section Graph.
Variable V : Type.
Definition Edge := V -> V -> Prop.
Inductive Path (E : Edge) : V -> V -> Prop :=
| Pnil : forall v, Path E v v
| Pstep : forall u v w, Path E u v -> E v w -> Path E u w.
Lemma path_refl (E : Edge) (v : V) : Path E v v.
Proof.
Admitted.
Fixpoint append_right (E : Edge)... | src_data/babel-formal/stmts/rocq/graph_paths.v | d70bc5f745b2cdd5ecdc11ec29bdfe09ff71968f50dc20f981c357cb84d6ce54 | null |
ITPEval: Benchmarking Formal Translation Across Interactive Theorem Provers
ITPEval evaluates formal statement translation across ten theorem provers. The statement corpus contains 2,634 aligned items / 26,340 records from eight benchmarks. Every included item has a representation in every prover, yielding 90 directions / 237,060 directed translation tasks per model and sample.
An item can be a multi-lemma topic file, catalogue theorem, axiom, competition problem, or program-verification condition.
Provers
| Prover | Record ID | File extension |
|---|---|---|
| Lean 4 | lean4 |
.lean |
| Rocq (Coq) | rocq |
.v |
| Isabelle/HOL | isabelle |
.thy |
| HOL Light | hol-light |
.ml |
| ACL2 | acl2 |
.lsp |
| Agda | agda |
.agda |
| HOL4 | hol4 |
.sml |
| Metamath | metamath |
.mm |
| Mizar | mizar |
.miz |
| PVS | pvs |
.pvs |
Benchmark Breakdown
| Benchmark | Statement items | Records | What an item contains |
|---|---|---|---|
| Babel-formal | 15 | 150 | An axiomatized mathematical topic with several lemmas |
| Hundred Theorems | 100 | 1,000 | A catalogue theorem and its formal context |
| miniF2F | 455 | 4,550 | A competition or textbook-style mathematics problem |
| PutnamBench | 657 | 6,570 | An undergraduate Putnam competition problem |
| nTP4VC | 597 | 5,970 | A program-verification obligation and its environment |
| Logipedia | 394 | 3,940 | An arithmetic-library theorem or axiom |
| Thousand Theorems | 227 | 2,270 | A selected named theorem identified by catalogue ID |
| VERINA | 189 | 1,890 | A program, precondition, postcondition, and correctness statement |
| Total | 2,634 | 26,340 |
Data Files and Schema
| File | Items | Records | Description |
|---|---|---|---|
stmts.json |
2,634 | 26,340 | Statement representations in all ten provers; default HF configuration |
proofs.json |
74 | 296 | Available complete proof files from Babel-formal and Hundred Theorems |
Native statements are in src_data/<benchmark>/stmts/<prover>/; proof files are
in the corresponding proofs/ directories. The source tree includes candidate
files beyond the aligned benchmark; stmts.json defines evaluation membership.
Proof records are available in Lean 4, Rocq, Isabelle/HOL, and HOL Light, yielding
888 directed proof tasks. There are 73 identities shared with the statement
corpus: Babel's supinf remains in the proof export but is outside the ten-way
statement intersection. Statement coverage does not imply proof availability.
Each file is a JSON array with these fields:
| Field | Type | Meaning |
|---|---|---|
theorem_id |
int | Stable release ID; statement IDs range from 1 to 2,654 with reserved gaps |
title |
string | Shared item title or file stem |
source |
string | Dataset identifier, such as minif2f or ntp4vc |
tier |
string | a for Babel-formal; b for the other sources; a repository grouping, not a difficulty label |
prover |
string | One of the prover IDs above |
content |
string | Complete native statement or proof file text |
split |
string, optional | miniF2F source membership: test or valid |
item_id |
string, statements only | Canonical dataset-scoped identity |
artifact |
string, statements only | Local file path under src_data/ |
sha256 |
string, statements only | SHA256 of the UTF-8 source content |
Usage
Load the default ten-prover statement corpus through Hugging Face:
from datasets import load_dataset
statements = load_dataset("jiayi005/ITPEval", split="evaluation")
proofs = load_dataset("jiayi005/ITPEval", "proofs", split="evaluation")
The existing local JSON interface is also supported:
import json
with open("stmts.json", encoding="utf-8") as f:
statements = json.load(f) # 26,340 records
with open("proofs.json", encoding="utf-8") as f:
proofs = json.load(f) # 296 records
License
This dataset is released under CC BY 4.0. Individual formalizations retain their upstream licenses and source attribution.
- Downloads last month
- 262