The performance of a theorem prover crucially depends on the speed of the basic retrieval operations, such as finding terms that are unifiable with (instances of, or more general than) some query term. Among the known indexing methods for term retrieval in deduction systems, Path–Indexing exhibits a good performance in general. However, as Path–Indexing is not a perfect filter, the candidates f...