Recovering Intuition from Automated Formal Proofs using Tableaux with Superdeduction

Abstract: We propose an automated deduction method which allows us to produce proofs close to the human intuition and practice. This method is based on tableaux, which generate more natural proofs than similar methods relying on clausal forms, and uses the principles of superdeduction, among which the theory is used to enrich the deduction system with new deduction rules. We present two implementations of this method, which consist of extensions of the Zenon automated theorem prover. The first implementation is a version dedicated to the set theory of the B formal method, while the second implementation is a generic version able to deal with any first order theory. We also provide several examples of problems, which can be handled by these tools and which come from different theories, such as the B set theory or theories of the TPTP library.