Case Study: Saturations as Explicit Models in Equational Theories

2026-02-18

AI Summary

This work addresses the challenge of interpreting saturated clause sets produced by automated theorem provers in equational theories lacking finite countermodels. It proposes a novel method that, for the first time, fully constructs and implements a transformation from such saturation outputs into explicit (potentially infinite) rewrite systems, thereby formally building verifiable countermodels. The approach integrates the Vampire and E theorem provers with confluence and termination verification tools to generate trustworthy rewrite systems amenable to formal certification. Experimental evaluation demonstrates that the method successfully handles hundreds of equational entailments without finite countermodels, significantly enhancing both the interpretability and certifiability of generated counterexamples.

Technology Category

• Constraint Satisfaction and Optimization: Satisfiability Modulo Theories
• Knowledge Representation and Reasoning: Automated Reasoning and Theorem Proving
• Cognitive Modeling & Cognitive Systems: Conceptual Inference and Reasoning

Application Category

• Semantics and Knowledge: Data modeling to support human-machine intelligence, including LLMs agents, intelligent system behavior, explanations, and user-friendly interactions
• Search and Retrieval-Augmented AI: Web learning to rank, online learning, and counterfactual learning for ranking
• User Modeling, Personalization and Recommendation: Attacks and countermeasures in recommendation systems

Abstract

Automated theorem provers (ATPs) can disprove conjectures by saturating a set of clauses, but the resulting saturated sets are opaque certificates. In the unit equational fragment, a saturated set can in fact be read as a convergent rewrite system defining an explicit, possibly infinite, model -- but this is not widely known, even amongst frequent users of ATPs. Moreover, ATPs do not emit these explicit certificates for infinite (counter-)models. We present such a certificate construction in full, implement it in Vampire and E, and apply it to the recent Equational Theories Project, where hundreds of implications do not admit finite countermodels. The resulting rewrite systems can be checked for confluence and termination by existing certified tools, yielding trustworthy countermodels.

Problem

• automated theorem proving
• saturated sets
• equational theories
• infinite countermodels
• rewrite systems

Innovation

• saturated sets
• explicit models
• convergent rewrite systems
• automated theorem proving
• infinite countermodels