{'fraction_non_alphanumeric': 0.032915360501567396, 'fraction_numerical': 0.0, 'mean_word_length': 4.97196261682243, '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}}
Progress Report on LEO-II -- An Automatic Theorem Prover for Higher-Order Logic

Leo-II, a resolution based theorem prover for classical higherorder logic, is currently being developed in a one year research project at the University of Cambridge, UK, with support from Saarland University, Germany. We report on the current stage of development of LeoII. In particular, we sketch some main aspects of Leo-II’s automated proof search procedure, discuss its cooperation with first-order specialist provers, show that Leo-II is also an interactive proof assistant, and explain its shared term data structure and its term indexing mechanism.