Magnushammer: A Transformer-based Approach to Premise Selection
Abstract
A neural transformer-based approach outperforms traditional symbolic systems in automated theorem proving by achieving higher proof rates on the PISA benchmark.
Premise selection is a fundamental problem of automated theorem proving. Previous works often use intricate symbolic methods, rely on ___domain knowledge, and require significant engineering effort to solve this task. In this work, we show that Magnushammer, a neural transformer-based approach, can outperform traditional symbolic systems by a large margin. Tested on the PISA benchmark, Magnushammer achieves 59.5% proof rate compared to a 38.3% proof rate of Sledgehammer, the most mature and popular symbolic-based solver. Furthermore, by combining Magnushammer with a neural formal prover based on a language model, we significantly improve the previous state-of-the-art proof rate from 57.0% to 71.0%.
Get this paper in your agent:
hf papers read 2303.04488 Don't have the latest CLI?
curl -LsSf https://hf.co/cli/install.sh | bash Models citing this paper 0
No model linking this paper
Datasets citing this paper 1
Spaces citing this paper 0
No Space linking this paper
Collections including this paper 0
No Collection including this paper