GRUNGE: A Grand Unified ATP Challenge
Not on the map. Why?
Abstract (arXiv)
This paper describes a large set of related theorem proving problems obtained by translating theorems from the HOL4 standard library into multiple logical formalisms. The formalisms are in higher-order logic (with and without type variables) and first-order logic (possibly with multiple types, and possibly with type variables). The resultant problem sets allow us to run automated theorem provers that support different logical formats on corresponding problems, and compare their performances. This also results in a new "grand unified" large theory benchmark that emulates the ITP/ATP hammer setting, where systems and metasystems can use multiple ATP formalisms in complementary ways, and jointly learn from the accumulated knowledge.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). First posted on arXiv 6 Mar 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 1.
2 papers.
- 2022The Isabelle ENIGMAcited by 8
- 2024Machine Learning for Quantifier Selection in cvc5cited by 0
- 2024Machine Learning for Quantifier Selection in cvc526 Aug 2024
- 2022The Isabelle ENIGMA4 May 2022