Twitch: Learning Abstractions for Equational Theorem Proving
Organizations: Chalmers University, of Technology, Gothenburg, Sweden · University of Gothenburg, Gothenburg, Sweden
Abstract
Several successful strategies in automated reasoning rely on human-supplied guidance about which term or clause shapes are interesting. In this paper we aim to discover interesting term shapes automatically. Specifically, we discover abstractions : term patterns that occur over and over again in relevant proofs. We present our tool Twitch which discovers abstractions with the help of Stitch, a tool originally developed for discovering reusable library functions in program synthesis tasks. Twitch can produce abstractions in two ways: (1) from a partial, failed proof of a conjecture; (2) from successful proofs of other theorems in the same domain. We have also extended Twee, an equational theorem prover, to use these abstractions. We evaluate Twitch on a set of unit equality (UEQ) problems from TPTP, and show that it can prove 12 rating-1 problems as well as yielding significant speed-ups on many other problems.
Figures & tables
| Domain | Count |
|---|---|
| ALG (General Algebra) | 20 |
| BOO (Boolean Algebra) | 56 |
| COL (Combinatory Logic) | 120 |
| GRP (Group Theory) | 481 |
| LAT (Lattice Theory) | 126 |
| LCL (Logic Calculi) | 84 |
Automated Theorem Proving
Automated theorem proving develops algorithms and AI systems that construct or check formal proofs in mathematics, logic, and software.
See all 156 papers