Proofs from Interactive and Automated Theorem Provers for Kontroli & Dedukti Evaluation

Michael Färber from Universität Innsbruck compiled proofs in the Dedukti format from multiple theorem provers. The dataset includes contributions from interactive theorem provers Matita, HOL Light, and Isabelle/HOL, as well as automated theorem provers iProver Modulo and Zenon Modulo. This collection serves as a benchmark for evaluating the proof checkers Kontroli and Dedukti.

Use Cases

• Benchmarking proof checker performance based on proofs from multiple theorem provers mentioned in the description
• Studying proof translation and interoperability between different formal systems based on the Dedukti format
• Training or evaluating machine learning models for automated theorem proving based on structured proof data

Strengths

• Proofs are sourced from five established interactive and automated theorem provers, providing a diverse test suite.
• The dataset has a clear, stated purpose for evaluating two specific proof checkers, Kontroli and Dedukti.

Limitations

• Row count and dataset size are unknown, which may limit suitability assessment.
• Column-level documentation is absent; field semantics must be inferred after download.
• Last update date is unknown; freshness unverified.

Provenance

Source

Michael Färber, Universität Innsbruck, via paperswithcode

Collection Method

Likely extracted or converted from the output of the listed theorem provers.