BliStrTune: Hierarchical Invention of Theorem Proving Strategies

TL;DR

BliStrTune is a hierarchical system that automatically invents and fine-tunes theorem proving strategies, significantly improving the performance of the E prover on large problem libraries.

Contribution

It introduces BliStrTune, a hierarchical extension of BliStr, enabling exploration of larger strategy spaces through combined high-level and fine-tuning search.

Findings

BliStrTune invents new strategies based on novel clause weight functions.

Strategies developed with BliStrTune improve E prover performance on Mizar problems.

Hierarchical approach enhances strategy invention efficiency.

Abstract

Inventing targeted proof search strategies for specific problem sets is a difficult task. State-of-the-art automated theorem provers (ATPs) such as E allow a large number of user-specified proof search strategies described in a rich domain specific language. Several machine learning methods that invent strategies automatically for ATPs were proposed previously. One of them is the Blind Strategymaker (BliStr), a system for automated invention of ATP strategies. In this paper we introduce BliStrTune -- a hierarchical extension of BliStr. BliStrTune allows exploring much larger space of E strategies by interleaving search for high-level parameters with their fine-tuning. We use BliStrTune to invent new strategies based also on new clause weight functions targeted at problems from large ITP libraries. We show that the new strategies significantly improve E's performance in solving problems from the Mizar Mathematical Library.