The author discovered the simplest axiom for Boolean algebra using automated theorem proving, a feat unheard of in math history. The proof of the axiom, however, remains complex and challenging to comprehend, leading to questions about the human understandability of such results. The proof involves a sequence of structural symbolic operations and lemmas that gradually lead to known axioms of Boolean algebra. The proof process includes substitution and bisubstitution, with bisubstitution being a more intricate method to derive new lemmas from existing ones. Despite the difficulty in understanding the proof, it serves as a foundational challenge in math and AI integration.
https://writings.stephenwolfram.com/2025/01/who-can-understand-the-proof-a-window-on-formalized-mathematics/