Pith. sign in

REVIEW

GRUNGE: A Grand Unified ATP Challenge

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1903.02539 v2 pith:HZALPWXW submitted 2019-03-06 cs.LO

classification cs.LO
keywords formalismsmultiplegrandlargelogiclogicalpossiblyproblems
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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 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.

Discussion (0). Sign in to comment.

Pith tools