{'fraction_non_alphanumeric': 0.015193370165745856, 'fraction_numerical': 0.0, 'mean_word_length': 5.1440677966101696, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Completion and Equational Theorem Proving Using Taxonomic Constraints

We present an approach to prove several theorems in slightly diierent axiom systems simultaneously. We represent the diierent problems as a taxonomy, i.e. a tree in which each node inherits all knowledge of its predecessors, and solve the problems using inference steps on rules and equations with simple constraints, i.e. words identifying nodes in the taxonomy. We demonstrate that a substantial gain can be achieved by using taxonomic constraints, not only by avoiding the repetition of inference steps in the diierent problems but also by achieving run times that are much shorter than the accumulated run times when proving each problem separately.