Twitch: Learning Abstractions for Equational Theorem Proving
Paper i 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

Författare

Guy Ross Axelrod

Göteborgs universitet

Chalmers, Data- och informationsteknik, Data Science och AI

Moa Johansson

Göteborgs universitet

Chalmers, Data- och informationsteknik, Data Science och AI

Nicholas Smallbone

Göteborgs universitet

Chalmers, Data- och informationsteknik, Funktionell programmering

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,

Semantiskt driven teorembevisning inom matematik

Vetenskapsrådet (VR) (2025-06153), 2026-01-01 -- 2030-12-31.

Ämneskategorier (SSIF 2025)

Programvaruteknik

Datavetenskap (datalogi)

DOI

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

Mer information

Senast uppdaterat

2026-08-20