Th. Hillenbrand, A. Buch, and R. Fettig. On gaining efficiency in completion-based theorem proving. In H. Ganzinger, editor, Proceedings of the International Conference on Rewriting Techniques and Applications, pp. 432--435, Lecture Notes in Computer Science, vol. 1103, Springer-Verlag, 1996.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....1996, EQP proved the second lemma (in 12 days) Winker s proofs are higher order in the sense that they use induction, so EQP s proofs are seen as the first equational proofs of the lemmas. As far as we know, the only other program to have automatically proved either of these lemmas is Waldmeister [3], which recently proved the first lemma (without AC unification) The first lemma was proved by refuting the set 8 : n(n(n(x) y) n(x y) y C D = C x x 6= x 9 = denial of first Robbins lemma) and the second by refuting the set 8 : n(n(n(x) y) n(x y) y n(C D) ....

Th. Hillenbrand, A. Buch, and R. Fettig. On gaining efficiency in completion-based theorem proving. In H. Ganzinger, editor, Proceedings of the International Conference on Rewriting Techniques and Applications, pp. 432--435, Lecture Notes in Computer Science, vol. 1103, Springer-Verlag, 1996.

....[DGHW97] A major requirement for the application of theorem provers is the performance of proof systems in terms of proofs found within a practical time limit. While new calculi and refined implementations can improve the performance (as shown by the success of SPASS [WGR96] and Waldmeister [HBF96]) the proper use of search control knowledge offers at least the same potential for improvements. Search control knowledge in most current theorem provers is represented by various, often parameterized heuristics for the selection of certain inference steps. Optimization of the theorem prover ....

T. Hillenbrand, A. Buch, and R. Fettig. On Gaining Efficiency in CompletionBased Theorem Proving. In H. Ganzinger, editor, Proc. of the 7th RTA, New Brunswick, number 1103 in LNCS, pages 432--435. Springer, 1996.

....from e.g. CL73] For a short description of E including performance data, see [Sch99a] Some other provers have influenced the design of E and may be referenced in the course of this manual. These include SETHEO [MIL 97] Otter [McC94, MW97] SPASS [WGR96] DISCOUNT [DKS97] and Waldmeister [HBF96, HJL99] 2 Getting Started Installation of E should be straightforward. The file README in the main directory of the distribution contains the necessary information. After building, you will find the standalone executable CLIB PROVER eprover. E is controlled by a very wide range of parameters. ....

T. Hillenbrand, A. Buch, and R. Fettig. On Gaining Efficiency in Completion-Based Theorem Proving. In H. Ganzinger, editor, Proc. of the 7th RTA, New Brunswick, number 1103 in LNCS, pages 432-- 435. Springer, 1996.

....of mathematicians [DGHW97] A major requirement for the application of theorem provers is the performance in terms of proofs found within a practical time limit. While new calculi and refined implementations can improve the performance (as shown by the success of SPASS [WGR96] and Waldmeister [HBF96]) the proper use of search control knowledge offers at least the same potential for improvements. Search control knowledge in most current theorem provers is represented by various, often parameterized heuristics for the selection of certain inference steps. Optimization of the theorem prover ....

T. Hillenbrand, A. Buch, and R. Fettig. On Gaining Efficiency in Completion-Based Theorem Proving. In H. Ganzinger, editor, Proc. of the 7th RTA, New Brunswick, number 1103 in LNCS, pages 432--435. Springer, 1996.

....1 Introduction In general, automated theorem proving is based on the solution of search problems which usually comprise huge search spaces. Thus, it is on the one hand necessary to develop fast algorithms and to use a lot of tricks in order to obtain a fast implementation (see, e.g. HBF96] On the other hand, however, a skillful control of the search conducted by the prover is especially important to deal with hard search problems. Therefore, for first order theorem proving a lot of different calculi, each of them controllable by various heuristics, have been developed. However, ....

....theorem provers for sub logics of first order logic exist that are able to solve problems stemming from their specialized logic very efficiently, but cannot deal with problems specified in full first order logic. e.g. the availability of high performance equational provers like Waldmeister ( HBF96] or Discount ( ADF95] is somewhat limited although many problems contain a lot of formulae where equality is involved (cf. the well known problem library TPTP [SSY94] The first problem, the lack of knowledge about the quality of certain provers for certain problems could indeed be solved by ....

T. Hillenbrand, A. Buch, and R. Fettig. On Gaining Efficiency in Completion-Based Theorem Proving. In Proc. RTA-96, pages 432--435. Springer LNCS 1103, 1996.

....to the SPRFN format [Pla88] thinker, to convert FOF problems to the THINKER format [Pel82, Pel87] tptp, to convert FOF and CNF problems to the TPTP format, substituting include instructions with the actual formulae. waldmeister, to convert CNF problems to the Waldmeister format [HBF96] The default Format is tptp. ffl d Directory : Specifies the top level directory below which the output files are to be placed. If the Directory value is , then all output files are written to standard output, and all informational output is suppressed (even quieter than q2) Otherwise ....

T. Hillenbrand, A. Buch, and R. Fettig. On Gaining Efficiency in Completion-Based Theorem Proving. In H. Ganzinger, editor, Proceedings of the 7th International Conference on Rewriting Techniques and Applications, number 1103 in Lecture Notes in Computer Science, pages 432--435. Springer-Verlag, 1996.

....to the SPRFN format [Pla88] thinker, to convert FOF problems to the THINKER format [Pel82, Pel87] tptp, to convert FOF and CNF problems to the TPTP format, substituting include instructions with the actual formulae. waldmeister, to convert CNF problems to the Waldmeister format [HBF96] The default Format is tptp. ffl d Directory : Specifies the top level directory below which the output files are to be placed. If the Directory value is , then all output files are written to standard output, and all informational output is suppressed (even quieter than q2) If the ....

T. Hillenbrand, A. Buch, and R. Fettig. On Gaining Efficiency in Completion-Based Theorem Proving. In H. Ganzinger, editor, Proceedings of the 7th International Conference on Rewriting Techniques and Applications, number 1103 in Lecture Notes in Computer Science, pages 432--435. Springer-Verlag, 1996.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC