Canonical event

Endrullis Ivanov and van Raamsdonk publish machine-checked confluence proof preprint

Authors submitted October 5, 2026 a proof that decreasing diagrams are complete for confluence of arbitrary rewriting systems, supported by Isabelle/HOL and Lean checking. The paper resolves RTA Problem 56 according to its authors; this is not an independently peer-reviewed AI-generated proof claim.