## WALDMEISTER: Development of a High Performance Completion-Based Theorem Prover (1996)

Citations: | 14 - 0 self |

### BibTeX

@TECHREPORT{Buch96waldmeister:development,

author = {Arnim Buch and Thomas Hillenbrand},

title = {WALDMEISTER: Development of a High Performance Completion-Based Theorem Prover},

institution = {},

year = {1996}

}

### Years of Citing Articles

### OpenURL

### Abstract

: In this report we give an overview of the development of our new Waldmeister prover for equational theories. We elaborate a systematic stepwise design process, starting with the inference system for unfailing Knuth--Bendix completion and ending up with an implementation which avoids the main diseases today's provers suffer from: overindulgence in time and space. Our design process is based on a logical three--level system model consisting of basic operations for inference step execution, aggregated inference machine, and overall control strategy. Careful analysis of the inference system for unfailing completion has revealed the crucial points responsible for time and space consumption. For the low level of our model, we introduce specialized data structures and algorithms speeding up the running system and cutting it down in size --- both by one order of magnitude compared with standard techniques. Flexible control of the mid--level aggregation inside the resulting prover is made po...

### Citations

523 | P.: Simple word problems in universal algebras - Knuth, Bendix - 1970 |

169 |
Theory of braids
- Artin
- 1947
(Show Context)
Citation Context ...f equations to be normalized. -- For mode PROOF, a set of hypotheses to be proved. Variables are implicitely existentially quantified. All--quantification is expressed via Skolem constants. braid4.cf =-=[Art47]-=-, for the equations see [Cho48] NAME Braid4 MODE CONFLUENCE SORTS ANY SIGNATURE p,q,r,s,t,u,P,Q,R,S,T,U: ANY -? ANY 305,306,307,308,315,316,317,318,325: ANY -? ANY 326,327,328,405,406,407,408,415,416:... |

125 | Completion without Failure
- Bachmair, Dershowitz, et al.
- 1989
(Show Context)
Citation Context ...completion In [KB70], Knuth and Bendix introduced the completion algorithm which tries to derive a set of convergent rules from a given set of equations. With the extension to unfailing completion in =-=[BDP89]-=-, it has turned out to be a valuable means of proving theorems in equational theories (positive first--order unit equality clauses). The following nine inference rules form a variant of unfailing comp... |

47 |
The pairing heap: A new form of self-adjusting heap
- Fredman, Sedgewick, et al.
- 1986
(Show Context)
Citation Context ...Heap In a first approach, the reduction of reorganization effort caused by orphan murder led us to a related dynamic data structure, the so--called pairing--heap (cf. Fig. 10) which was introduced in =-=[FSST86]-=- (see [SV87] for an evalutation). Double--chaining its entries allows arbitrary deletion and reweighting of elements in constant time. For the purpose of immediate orphan murder, the unprocessed equat... |

47 | Experiments with discrimination-tree indexing and path indexing for term retrieval - McCune - 1992 |

33 |
Single axioms for groups and Abelian groups with various operations
- McCune
- 1993
(Show Context)
Citation Context ...ANY EQUATIONS f(i(f(i(f(i(f(x,y)),f(y,x))), f(i(f(z,u)),f(z,i(f(f(v,i(w)),i(u))))))), w) = v CONCLUSION f(f(a,b),c) = f(a,f(b,c)) f(a,f(a,i(a))) = a f(a,i(a)) = f(b,i(b)) f(a,b) = f(b,a) jar10.2.1.pr =-=[McC93]-=- NAME jar10-2-1 MODE PROOF SORTS ANY SIGNATURE i: ANY -? ANY f: ANY ANY -? ANY a, b, c: -? ANY ORDERING LPO i ? f ? a ? b ? c VARIABLES x,y,z: ANY EQUATIONS f(f(i(f(x,i(f(y,z)))),f(x,i(z))),i(f(i(z),z... |

29 |
On the algebraic braid group
- Chow
- 1948
(Show Context)
Citation Context ...- For mode PROOF, a set of hypotheses to be proved. Variables are implicitely existentially quantified. All--quantification is expressed via Skolem constants. braid4.cf [Art47], for the equations see =-=[Cho48]-=- NAME Braid4 MODE CONFLUENCE SORTS ANY SIGNATURE p,q,r,s,t,u,P,Q,R,S,T,U: ANY -? ANY 305,306,307,308,315,316,317,318,325: ANY -? ANY 326,327,328,405,406,407,408,415,416: ANY -? ANY 417,418,425,426,427... |

24 |
discrimination nets and fast term rewriting
- Christian, ‘Flatterms
- 1993
(Show Context)
Citation Context ...tructure for the nodes of standard discrimination trees, Christian proposed an array--based hash table which maps each function symbol onto its corresponding successor node if such a node exists (cf. =-=[Chr93]-=-). There is an additional slot for the wildcard symbolsreplacing variables. The hash table especially supports descending from a parent node to a child with respect to a given symbol --- keeping the c... |

22 | Distributing equational theorem proving
- Avenhaus, Denzinger
- 1993
(Show Context)
Citation Context ...h is to take domain knowledge into account and thus to adjust the prover to new problem classes independently ([Sti84], [DS96]). Furthermore, distributing automated theorem proving on the high level (=-=[AD93]-=-, [CMM90]), or parallelizing it on the low level ([BGK96]) is tried in order to reduce the wall--clock run time of provers. Apart from that, the development of data structures and algorithms for speci... |

21 | Analysis and representation of equational proofs generated by a distributed completion based proof system, SEKI-Report SR-94-05
- Denzinger, Schulz
- 1994
(Show Context)
Citation Context ...ound via completion can be very spacious and unwieldy. Schulz and Denzinger introduced a protocol language, along with methods and tools for extracting and presenting proofs from those protocols (cf. =-=[DS93]-=-). We are currently adapting this method for Waldmeister and are working on space saving protocol 64 mechanisms since the original language produces protocol files that exhaust even large hard disk ca... |

18 | Learning Domain Knowledge to Improve Theorem Proving
- Denzinger, Schulz
- 1996
(Show Context)
Citation Context ...ams to use their experience from the past ([Fuc96b]). Another successful approach is to take domain knowledge into account and thus to adjust the prover to new problem classes independently ([Sti84], =-=[DS96]-=-). Furthermore, distributing automated theorem proving on the high level ([AD93], [CMM90]), or parallelizing it on the low level ([BGK96]) is tried in order to reduce the wall--clock run time of prove... |

16 |
DARES: A distributed automated REasoning system
- Conry, Macintosh
- 1990
(Show Context)
Citation Context ...take domain knowledge into account and thus to adjust the prover to new problem classes independently ([Sti84], [DS96]). Furthermore, distributing automated theorem proving on the high level ([AD93], =-=[CMM90]-=-), or parallelizing it on the low level ([BGK96]) is tried in order to reduce the wall--clock run time of provers. Apart from that, the development of data structures and algorithms for specialized hi... |

16 | Experiments in the Heuristic Use of Past Proof Experience
- Fuchs
- 1996
(Show Context)
Citation Context ...rk is put into the development of sophisticated heuristics on the top level. Making provers learn from previous runs is employed in order to enable the programs to use their experience from the past (=-=[Fuc96b]-=-). Another successful approach is to take domain knowledge into account and thus to adjust the prover to new problem classes independently ([Sti84], [DS96]). Furthermore, distributing automated theore... |

15 |
Only prime superpositions need be considered in the Knuth-Bendix procedure
- Kapur, Musser, et al.
- 1985
(Show Context)
Citation Context ...nd E selected , do not get much smaller either, thus for the add--weight heuristic in general the lazy variant that executes no IRP at all performs best. 7.3 A Subconnectedness Criterion Kapur et al. =-=[KMN88]-=- introduced a simple criterion that detects superpositions which can be ignored without losing completeness: If an inner subterm of the current superposition can be reduced w.r.t. the current rewrite ... |

15 |
A case study of theorem proving by the Knuth-Bendix method discovering that x 3 =x implies ring commutativity
- Stickel
(Show Context)
Citation Context ...the programs to use their experience from the past ([Fuc96b]). Another successful approach is to take domain knowledge into account and thus to adjust the prover to new problem classes independently (=-=[Sti84]-=-, [DS96]). Furthermore, distributing automated theorem proving on the high level ([AD93], [CMM90]), or parallelizing it on the low level ([BGK96]) is tried in order to reduce the wall--clock run time ... |

12 |
Fast Knuth-Bendix completion: summary
- Christian
- 1989
(Show Context)
Citation Context ... term representation. 4.1 Flatterms f i e e e f f e e e i f Figure 5: Flatterms vs. tree terms Flatterms as an alternative to tree--like recursive term representations were introduced by Christian in =-=[Chr89]-=-. The function symbols and variables --- represented by non--negative resp. negative integers --- are collected in a doubly linked list just in the order of a preorder term traversal. For each list ce... |

11 |
A master-slave approach to parallel term rewriting on a hierachical multiprocessor
- BÜNDGEN, GÖBEL, et al.
- 1996
(Show Context)
Citation Context ...djust the prover to new problem classes independently ([Sti84], [DS96]). Furthermore, distributing automated theorem proving on the high level ([AD93], [CMM90]), or parallelizing it on the low level (=-=[BGK96]-=-) is tried in order to reduce the wall--clock run time of provers. Apart from that, the development of data structures and algorithms for specialized high--speed operations like retrieval of generaliz... |

11 | Rewrite systems for integer arithmetic
- Walters, Zantema
- 1995
(Show Context)
Citation Context ...e term again instead of starting backtracking immediately. This is because termination holds only under a certain normalization strategy (innermost combined with a special backtracking mechanism; cf. =-=[WZ95]-=-). Result: The parameter setting of the backtracking behavior is worthwhile although we could not recognize a tendency. Once again it turns out that even slight changes of the inference machine can in... |

10 |
Teamwork: Eine Methode zum Entwurf verteilter, wissensbasierter Theorembeweiser
- Denzinger
(Show Context)
Citation Context ... !E ;l=r u with s ? l Delete an equation E [ fs = sg; R; G E; R; G 2 Waldmeister is also able to deal with existentially quantified goals, which requires additional inference rules for narrowing. See =-=[Den93]-=- for more details. 4 Subsume an equation E [ fs : = t; u[oe(s)] : = u[oe(t)]g; R; G E [ fs : = tg; R; G Simplify the right--hand side of a rule E; R [ fs ! tg; G E; R [ fs ! ug; G if t !R[E u Simplify... |

8 |
The Knuth-Bendix procedure for strings as a substitute for coset enumeration
- SIMS
- 1991
(Show Context)
Citation Context ...0 161.0 3 mv2.pr LCL111-2 225.8 16.5 1487 ?6000 136.5 274 p9a.pr GRP178-1 7.3 7.1 2253 90.2 25.9 807 ra2.pr ROB023-1 6.3 2.8 2356 ?6000 118.0 21 ra3.pr ROB005-14 96.1 5.6 1174 ?6000 100.4 16 sims2.cp =-=[Sim91]-=- 50.8 3.8 807 365.5 61.6 443 z22.cp [Den93] 0.9 2.5 2726 3.7 3.9 1743 Table 19: Comparison of Inference Machines To that purpose, both provers were run with the same primitive search strategy. In this... |

7 |
Term Indexing, volume 1053 of LNAI
- Graf
- 1995
(Show Context)
Citation Context ...rs. Apart from that, the development of data structures and algorithms for specialized high--speed operations like retrieval of generalizations and instances of terms has made good progress ([McC92], =-=[Gra96]-=-). In contrast, not enough attention is yet paid to the question how the single inference steps should be aggregated into an inference machine. If research focusses on one of the three levels, usually... |

7 |
Reasoning about Equality
- Lusk, Overbeek
- 1985
(Show Context)
Citation Context ...NS C(T,p) = p C(p,C(q,p)) = T C(C(p,C(q,r)),C(C(p,q),C(p,r))) = T C(C(p,C(q,r)),C(q,C(p,r))) = T C(C(p,q),C(N(q),N(p))) = T C(N(N(p)),p) = T C(p,N(N(p))) = T CONCLUSION C(N(Ap),C(Ap,Aq)) = T Lusk5.pr =-=[LO85]-=- NAME Lusk5 MODE PROOF SORTS ANY SIGNATURE f: ANY ANY ANY -? ANY g: ANY -? ANY a, b: -?ANY ORDERING LPO 82 g ? f ? b ? a VARIABLES v,w,x,y,z: ANY EQUATIONS f(f(v,w,x),y,f(v,w,z)) = f(v,w,f(x,y,z)) f(y... |

7 |
L.: Benchmark Problems in which equality plays the major role
- Lusk, Wos
- 1992
(Show Context)
Citation Context ...pproach is promising (Sect. 9). Although we have not yet spent much effort on specialized heuristics we gain impressive results on standard problems. Furthermore, Waldmeister solves two problems from =-=[LW92]-=- never proved unaided with standard unfailing completion be1 In German this means woodruff and is composed of forrest and master. 2 fore (Sect. 10). The completely machine generated proof of one of th... |

5 | The Application of Goal-Oriented Heuristics for Proving Equational Theorems via the Unfailing Knuth-Bendix Completion Procedure. A Case Study: Lattice Ordered Groups
- Fuchs
- 1994
(Show Context)
Citation Context ...NG LPO i ? n ? T ? a ? b VARIABLES x,y,z: ANY EQUATIONS i(T,x) = x i(i(x,y),y) = i(i(y,x),x) i(i(n(x),n(y)),i(y,x)) = T i(i(x,y),i(i(y,z),i(x,z))) = T CONCLUSION i(i(i(a,b),i(b,a)),i(b,a)) = T p9a.pr =-=[Fuc94]-=- NAME p9a MODE PROOF SORTS ANY SIGNATURE i: ANY -? ANY f, n, u: ANY ANY -? ANY 1, a, b, c: -? ANY ORDERING LPO i ? f ? n ? u ? 1 ? a ? b ? c VARIABLES x,y,z: ANY EQUATIONS u(x,x) = x n(x,x) = x f(1,x)... |

1 |
Teamwork--Varianten fur die verteilte wissensbasierte Suche am Beispiel eines Condensed--Detachement--Beweisers
- Fuchs
- 1996
(Show Context)
Citation Context ....2.1.pr 28496 193 1785000 29501 29.6 26.3 Table 3: Comparison of top symbol hashing and WDT indexing Starting from our isolated WDT indexing routines, Fuchs has build a specialized prover DiCoDe (cf. =-=[Fuc96a]-=-) for problems in the domain of condensed detachement (see [Luk70]). Comparing a version with indexing to another version without, he measured substantial speedups as well. 4.4 Comparison of Indexing ... |

1 |
ACID: A Collection of Indexing Datastructures. Available via internet at http://www.mpi-sb.mpg.de/tools/deduction/ACID
- Graf
- 1994
(Show Context)
Citation Context ...nd also introduced some new ones. Now, what is his favourite technique for the purpose of retrieving generalizations? Graf compared the run--times of implementations taken from his ACID--toolbox (cf. =-=[Gra94]-=-) on average term sets, and the winner was the so-- called substitution tree. In its nodes, this tree collects pairs of variables and substituted terms. Via composition, every branch from the root nod... |

1 |
Deduktionstreffen 1995. http://js-sfbsun.cs.uni-sb.de:80/pub/www/deduktion/dedtreff95. For proof task dt1.pr follow links Beweiserhappening and EQ
- Ohlbach, Kohlhase, et al.
(Show Context)
Citation Context ...(u(316(x)))))))))))))) 326(U(x)) = P(S(T(S(t(s(s(326(x)))))))) 426(U(x)) = P(Q(p(S(T(U(t(S(T(u(t(s(s(426(x)))))))))))))) 307(U(x)) = Q(S(U(s(u(307(x)))))) 407(U(x)) = P(S(T(s(t(407(x)))))) ... dt1.rd =-=[OKW]-=- NAME Fibonacci MODE REDUCTION SORTS ANY SIGNATURE 0: -? ANY s, p: ANY -? ANY 78 fib, dfib: ANY -? ANY +, -: ANY ANY -? ANY VARIABLES x,y: ANY EQUATIONS fib(0) = s(0) fib(s(0)) = s(0) fib(s(s(x))) = +... |

1 |
Pairing--heaps: Experiments and analysis
- Stasko, Vitter
- 1987
(Show Context)
Citation Context ...t approach, the reduction of reorganization effort caused by orphan murder led us to a related dynamic data structure, the so--called pairing--heap (cf. Fig. 10) which was introduced in [FSST86] (see =-=[SV87]-=- for an evalutation). Double--chaining its entries allows arbitrary deletion and reweighting of elements in constant time. For the purpose of immediate orphan murder, the unprocessed equations are add... |