Coq-OddOrder

Structured dataset from odd-order — Formal proof of the Feit-Thompson Odd Order Theorem.

Source

• Repository: https://github.com/math-comp/odd-order
• Commit: 6afa795b9018c64ab5c7cd2f9b3c9ab5dd45d93f
• Files: 34
• License: other

Schema

Column	Type	Description
statement	string	Declaration signature/claim with the leading keyword removed (verbatim slice); the full declaration minus its proof
proof	string	Verbatim proof/body, empty if the declaration has none
type	string	Declaration keyword
symbolic_name	string	Declaration identifier
library	string	Sub-library
filename	string	Repository-relative source path
imports	list[string]	File-level Require/Import modules
deps	list[string]	Intra-corpus identifiers referenced
docstring	string	Preceding documentation comment, empty if absent
source_url	string	Upstream repository
commit	string	Upstream commit extracted

Statistics

• Entries: 2,457
• With proof: 2,323 (94.5%)
• With docstring: 680 (27.7%)
• Libraries: 1

By type

Type	Count
Lemma	769
Let	702
Notation	332
Definition	172
Theorem	120
Hypothesis	72
Hypotheses	61
Proposition	54
Corollary	49
Remark	47
Fact	23
Canonical	21
Inductive	17
Fixpoint	7
Variant	6
Coercion	4
Record	1

Example

Puig_succS G D E : D \subset E -> 'L_[G](E) \subset 'L_[G](D).
Proof.
move=> sDE; apply: Puig_max (Puig_succ_sub _ _).
exact: norm_abgenS sDE (Puig_gen _ _).
Qed.

• type: Lemma | symbolic_name: Puig_succS | theories/BGappendixAB.v

Use

Each declaration is split into a statement (signature/claim) and a proof (body) that are disjoint and together form the complete declaration, for proof modeling, autoformalization, retrieval, and dependency analysis via deps.

Citation

@misc{coq_oddorder_dataset,
  title  = {Coq-OddOrder},
  author = {Norton, Charles},
  year   = {2026},
  note   = {Extracted from https://github.com/math-comp/odd-order, commit 6afa795b9018},
  url    = {https://huggingface.co/datasets/phanerozoic/Coq-OddOrder}
}