Coq-Hammer

Structured dataset from CoqHammer — Automation for dependent type theory via ATPs.

Source

• Repository: https://github.com/lukaszcz/coqhammer
• Commit: 9e081180c6b00ca3925cf84b08d8621f562f8285
• Files: 28
• License: lgpl-2.1

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: 762
• With proof: 757 (99.3%)
• With docstring: 35 (4.6%)
• Libraries: 6

By type

Type	Count
Lemma	342
Ltac	295
Definition	32
Fixpoint	28
Inductive	25
Notation	23
Theorem	4
Instance	4
Coercion	3
Class	2
Axiom	2
Corollary	1
Function	1

Example

lem_2 : forall n : nat, Nat.Odd n \/ Nat.Odd (n + 1).
hammer. Restart.
  hauto lq: on use: Nat.Even_or_Odd, Nat.add_1_r, Nat.Odd_succ.
Qed.

• type: Lemma | symbolic_name: lem_2 | examples/hammer_tests.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_hammer_dataset,
  title  = {Coq-Hammer},
  author = {Norton, Charles},
  year   = {2026},
  note   = {Extracted from https://github.com/lukaszcz/coqhammer, commit 9e081180c6b0},
  url    = {https://huggingface.co/datasets/phanerozoic/Coq-Hammer}
}