Experiments concerning the automated search for elegant proofs
The research reported in this technical report was spawned by the request to find an elegant proof (of a theorem from Boolean algebra) to replace the known proof consisting of 816 deduced steps. The request was met by finding a proof consisting of 100 deduced steps. The methodology used to obtain the far shorter proof is presented in detail through a sequence of experiments. Although clearly not an algorithm, the methodology is sufficiently general to enable its use for seeking elegant proofs regardless of the domain of study. The methodology relies heavily on the assistance of McCune`s automated reasoning program OTTER. Of the aspects of proof elegance, the main focus here is on proof length, with brief attention paid to the type of term present, the number of variables required, and the complexity of deduced steps. The methodology is iterative, relying heavily on the use of three strategies: the resonance strategy, the hot list strategy, and McCune`s ratio strategy. To provide some insight regarding the value of the methodology, the author discusses its successful application to other problems from Boolean algebra and to problems from lattice theory. Research suggestions and challenges are also offered.
- Research Organization:
- Argonne National Lab., IL (United States)
- Sponsoring Organization:
- USDOE Office of Energy Research, Washington, DC (United States)
- DOE Contract Number:
- W-31109-ENG-38
- OSTI ID:
- 516006
- Report Number(s):
- ANL/MCS/TM--221; ON: DE97008537
- Country of Publication:
- United States
- Language:
- English
Similar Records
Finding missing proofs with automated reasoning.
A spectrum of applications of automated reasoning.