[ ] or SUCCESS is Not Enough: Current Technology and Future Directions in Proof Presentation

Automated theorem provers for first order logic are now around for several decades. Over the last few years, their deductive power to solve hard problems has increased tremendously. The annual CASC system competitions [Se97] give a clear picture of this situation. However, today's automated theorem provers are restricted "more by general usability than by raw deductive power." As a result of this, there are only very few serious applications of automated theorem provers. There are numerous features which a theorem prover lacks for real-world applicability. An automated theorem prover (as it is currently seen) is nothing more than a fast and elaborate search procedure. In that sense, an ATP can compared to a formulated race car, cool and fast, but virtually unusable for shopping groceries around the corner. Many important features are missing, or are optimized for speed rather than for applicability. [Schol] identifies important features which are needed for practical usability like detection of non-theorems, handling of modal/inductive proof tasks, control of the prover, and proof output. In this paper, we will focus solely on the last point, the presentation of the ATP's result to the user. In the rest of this paper, we will first discuss the general importance of providing feedback to the user, then we will describe the system ExplainIt!, a part of the deductive synthesis system AMPHION/NAV. In the conclusions we will relate proof presentation to other ways of post-processing a proof found by an ATP and stress their role in the future of automated deduction.

[1]  Richard A. Brown,et al.  Introduction to random signals and applied kalman filtering (3rd ed , 2012 .

[2]  Matt Kaufmann,et al.  ACL2 Support for Verification Projects (Invited Talk) , 1998, CADE.

[3]  Bernd Fischer,et al.  Deduction-based software component retrieval , 2001, Ausgezeichnete Informatikdissertationen.

[4]  George C. Necula,et al.  Safe, Untrusted Agents Using Proof-Carrying Code , 1998, Mobile Agents and Security.

[5]  William McCune,et al.  OTTER 3.0 Reference Manual and Guide , 1994 .

[6]  Michael R. Lowry,et al.  Deductive Composition of Astronomical Software from Subroutine Libraries , 1994, CADE.

[7]  Christoph Goller,et al.  SETHEO V3.2: Recent Developments - System Abstract , 1994, CADE.

[8]  Helmut Horacek Presenting Proofs in a Human-Oriented Way , 1999, CADE.

[9]  George C. Necula,et al.  The design and implementation of a certifying compiler , 1998, PLDI.

[10]  Johann Schumann,et al.  ILF-SETHEO: Processing Model Elimination Proofs for Natural Language Output , 1997, CADE.

[11]  Ingo Dahn,et al.  Natural Language Presentation and Combination of Automatically Generated Proofs , 1996, FroCoS.

[12]  Michael R. Lowry,et al.  Explaining synthesized software , 1998, Proceedings 13th IEEE International Conference on Automated Software Engineering (Cat. No.98EX239).

[13]  Johann Schumann,et al.  Automated Theorem Proving in Software Engineering , 2001, Springer Berlin Heidelberg.

[14]  Zohar Manna,et al.  Fundamentals of Deductive Program Synthesis , 1992, IEEE Trans. Software Eng..