Twitch: Learning Abstractions for Equational Theorem Proving
Paper in proceeding, 2026

Automated theorem provers often perform better when told what shapes of terms are interesting. In this paper we discover interesting term shapes automatically, in the form of abstractions, term patterns that occur over and over again in proofs. Our tool Twitch produces abstractions automatically and can do so in two ways: (1) from a partial, failed proof of a conjecture; (2) from successful proofs of other theorems in the same domain. Twitch is built on top of Stitch, a tool designed for discovering reusable library functions in program synthesis tasks. We have also extended Twee, an equational theorem prover, to use the generated abstractions. We evaluate Twitch on a set of unit equality (UEQ) problems from TPTP, and show that it proves problems previously unsolved by Twee, as well as yielding speed-ups on many other problems.

abstraction learning

equational theorem proving

completion

automated theorem proving

proof-guided search

Author

Guy Ross Axelrod

University of Gothenburg

Chalmers, Computer Science and Engineering (Chalmers), Data Science and AI

Moa Johansson

University of Gothenburg

Chalmers, Computer Science and Engineering (Chalmers), Data Science and AI

Nicholas Smallbone

University of Gothenburg

Chalmers, Computer Science and Engineering (Chalmers), Functional Programming

Lecture Notes in Computer Science

0302-9743 (ISSN) 1611-3349 (eISSN)

Vol. 16688 LNCS 62-79
9783032325884 (ISBN)

13th International Joint Conference on Automated Reasoning, IJCAR 2026
Lisbon, Portugal,

Semantically-guided theorem proving for mathematics

Swedish Research Council (VR) (2025-06153), 2026-01-01 -- 2030-12-31.

Subject Categories (SSIF 2025)

Software Engineering

Computer Sciences

DOI

10.1007/978-3-032-32589-1_4

More information

Latest update

8/20/2026