anonymous-itp commited on
Commit
59d2881
·
verified ·
1 Parent(s): 3a9b39d

Update README.md

Browse files
Files changed (1) hide show
  1. README.md +130 -3
README.md CHANGED
@@ -1,3 +1,130 @@
1
- ---
2
- license: cc-by-4.0
3
- ---
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ ---
2
+ language:
3
+ - en
4
+ - code
5
+ license: cc-by-4.0
6
+ task_categories:
7
+ - translation
8
+ tags:
9
+ - formal-verification
10
+ - theorem-proving
11
+ - interactive-theorem-provers
12
+ - lean4
13
+ - rocq
14
+ - coq
15
+ - isabelle
16
+ - hol-light
17
+ - code-translation
18
+ pretty_name: ITPEval
19
+ size_categories:
20
+ - 1K<n<10K
21
+ ---
22
+
23
+ # ITPEval: Benchmarking Formal Translation Across Interactive Theorem Provers
24
+
25
+ ITPEval is a benchmark for evaluating automated formal proof translation across four major interactive theorem provers (ITPs) spanning two logical foundations. It accompanies the NeurIPS 2026 paper *ITPEval: Benchmarking Formal Translation Across Interactive Theorem Provers*.
26
+
27
+ ## Dataset Summary
28
+
29
+ The benchmark comprises **390 aligned files** spanning over 1,700 theorems and lemmas, each formalized in all four ITPs:
30
+
31
+ | ITP | Foundation | File Extension |
32
+ |---|---|---|
33
+ | Lean 4 | Calculus of Inductive Constructions | `.lean` |
34
+ | Rocq (Coq) | Calculus of Inductive Constructions | `.v` |
35
+ | Isabelle/HOL | Higher-order logic | `.thy` |
36
+ | HOL Light | Higher-order logic | `.ml` |
37
+
38
+ Every theorem is present in all four ITPs (4-way intersection), yielding **12 balanced directed translation pairs** per file.
39
+
40
+ ## Data Files
41
+
42
+ | File | Records | Description |
43
+ |---|---|---|
44
+ | `stmts.json` | 1,560 | Sorry-stripped theorem statements (390 theorems × 4 ITPs) |
45
+ | `proofs.json` | 296 | Full proof files (74 theorems × 4 ITPs) |
46
+
47
+ ## Record Schema
48
+
49
+ Each record is a JSON object with the following fields:
50
+
51
+ | Field | Type | Description |
52
+ |---|---|---|
53
+ | `theorem_id` | int | Globally unique theorem identifier (1–390) |
54
+ | `title` | string | Theorem name (e.g., `"circle_average"`, `"aime_1983_p1"`) |
55
+ | `source` | string | Benchmark source: `"babel-formal"`, `"hundred-theorems"`, or `"minif2f"` |
56
+ | `tier` | string | `"a"` (controlled/axiomatized) or `"b"` (ecosystem/library-dependent) |
57
+ | `prover` | string | ITP system: `"lean4"`, `"rocq"`, `"isabelle"`, or `"hol-light"` |
58
+ | `content` | string | Full file text (statement-only for `stmts.json`, complete proof for `proofs.json`) |
59
+ | `split` | string | *(miniF2F only)* `"test"` or `"valid"` |
60
+
61
+ ## Benchmark Structure
62
+
63
+ The benchmark is organized into two tiers:
64
+
65
+ | Tier | Source | Files | Lemmas | Description |
66
+ |---|---|---|---|---|
67
+ | A (Controlled) | Babel-formal | 16 | 165 | Self-contained, axiomatized theorems. Isolates foundational translation difficulty. |
68
+ | B (Ecosystem) | Hundred Theorems | 58 | 1,231 | Classical theorems from real ITP libraries. Tests library API and tactic translation. |
69
+ | B (Ecosystem) | miniF2F | 316 | 316 | Competition math statements. Tests pure statement translation. |
70
+
71
+ **Translation modes:**
72
+
73
+ - **Statement translation** (`stmts.json`): All 390 files. Source file has proof bodies replaced by placeholders (`sorry`, `Admitted`, etc.). Yields 4,680 directed pairs per model (390 × 12 directions).
74
+ - **Proof translation** (`proofs.json`): Babel-formal + Hundred Theorems (74 files). Source file contains the complete proof. Yields 888 directed pairs per model (74 × 12 directions).
75
+
76
+ ## Usage
77
+
78
+ ```python
79
+ import json
80
+
81
+ # Load data
82
+ stmts = json.load(open("stmts.json")) # 1,560 records
83
+ proofs = json.load(open("proofs.json")) # 296 records
84
+
85
+ # All Lean 4 statements
86
+ lean4_stmts = [r for r in stmts if r["prover"] == "lean4"]
87
+
88
+ # All 4 ITP variants of one theorem
89
+ theorem_1 = [r for r in stmts if r["theorem_id"] == 1]
90
+
91
+ # Generate all directed translation pairs for a theorem
92
+ def translation_pairs(records, theorem_id):
93
+ variants = [r for r in records if r["theorem_id"] == theorem_id]
94
+ pairs = []
95
+ for src in variants:
96
+ for tgt in variants:
97
+ if src["prover"] != tgt["prover"]:
98
+ pairs.append({"src": src, "tgt_prover": tgt["prover"]})
99
+ return pairs
100
+
101
+ # Tier A only (controlled)
102
+ tier_a = [r for r in stmts if r["tier"] == "a"]
103
+
104
+ # miniF2F test split
105
+ minif2f_test = [r for r in stmts if r["source"] == "minif2f" and r.get("split") == "test"]
106
+ ```
107
+
108
+ ## Evaluation Protocol
109
+
110
+ For each (source file, target ITP) pair:
111
+
112
+ 1. Prompt an LLM with the source file and the target ITP name
113
+ 2. The LLM generates a complete file in the target ITP
114
+ 3. Run the generated file through the target ITP binary
115
+ 4. Mark as **verified** if and only if the ITP exits with code 0 (no errors, no partial credit)
116
+
117
+ Per-prover timeouts: Lean 4 and Rocq at 60s, Isabelle at 120s, HOL Light at 300s.
118
+
119
+ ## Key Results
120
+
121
+ With five LLMs (GPT-5.5, Claude Sonnet 4.6, Gemini 3.1 Pro, DeepSeek-V4-Pro, Qwen3-235B), evaluated zero-shot at temperature 0:
122
+
123
+ - Statement translation peaks at **29.1%** pass@1; proof translation peaks at **10.5%**
124
+ - Tier A (controlled) reaches **29.7%** proof pass@1 vs. **5.2%** for Tier B (ecosystem)
125
+ - Translation direction matters sharply: e.g., Lean 4 → Isabelle (19.8%) vs. Isabelle → Lean 4 (1.9%)
126
+
127
+
128
+ ## License
129
+
130
+ This dataset is released under [CC BY 4.0](https://creativecommons.org/licenses/by/4.0/). Individual formalizations may inherit licenses from their upstream sources (Mathlib, Archive of Formal Proofs, HOL Light core, MathComp, miniF2F).