GRUNGE: A Grand Unified ATP Challenge
Chad Brown, Thibault Gauthier, Cezary Kaliszyk, Geoff Sutcliffe, Josef Urban27th International Conference on Automated Deduction, LNCS 11716, pp. 123 – 141, 2019.
Abstract
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 types, and possibly with type variables). The resultant problem sets allow us to run automated theorem provers that support different logical formalisms 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 formalisms in complementary ways, and jointly learn from the accumulated knowledge.
BibTeX
@inproceedings{cbtgckgsju-cade19,
author = {Chad Brown and Thibault Gauthier and Cezary Kaliszyk and Geoff Sutcliffe and Josef Urban},
title = {{GRUNGE:} {A} Grand Unified {ATP} Challenge},
booktitle = {The 27th International Conference on Automated Deduction (CADE 2019)},
year = {2019},
series = {LNCS},
pages = {123--141},
editor = {Pascal Fontaine},
volume = {11716},
publisher = {Springer},
url = {https://doi.org/10.1007/978-3-030-29436-6_8},
doi = {10.1007/978-3-030-29436-6_8},
}