SOTAVerified

HOList: An Environment for Machine Learning of Higher-Order Theorem Proving

2019-04-05Code Available0· sign in to hype

Kshitij Bansal, Sarah M. Loos, Markus N. Rabe, Christian Szegedy, Stewart Wilcox

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

We present an environment, benchmark, and deep learning driven automated theorem prover for higher-order logic. Higher-order interactive theorem provers enable the formalization of arbitrary mathematical theories and thereby present an interesting, open-ended challenge for deep learning. We provide an open-source framework based on the HOL Light theorem prover that can be used as a reinforcement learning environment. HOL Light comes with a broad coverage of basic mathematical theorems on calculus and the formal proof of the Kepler conjecture, from which we derive a challenging benchmark for automated reasoning. We also present a deep reinforcement learning driven automated theorem prover, DeepHOL, with strong initial results on this benchmark.

Tasks

Benchmark Results

DatasetModelMetricClaimedVerifiedStatus
HOList benchmarkTactic Dependent LoopPercentage correct38.88Unverified
HOList benchmarkDeeper Wider WaveNetPercentage correct32.65Unverified

Reproductions