Twee: An Equational Theorem Prover

Download PDF
Open Webpage

Nicholas Smallbone

Published: 2021, Last Modified: 05 Jan 2026CADE 2021EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Twee is an automated theorem prover for equational logic. It implements unfailing Knuth-Bendix completion with ground joinability testing and a connectedness-based redundancy criterion. It came second in the UEQ division of CASC-J10, solving some problems that no other system solved. This paper describes Twee’s design and implementation.