{'fraction_non_alphanumeric': 0.014970059880239521, 'fraction_numerical': 0.0, 'mean_word_length': 5.137614678899083, '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}}
Solving QBF Instances with Nested SAT Solvers

We present a new approach towards solving quantified Boolean formulas (QBFs) using nested SAT solvers with lazy clause generation. The approach has been implemented on top of the Glucose solver by adding mechanisms for nesting solvers as well as clause learning. Our preliminary experiments show that nested SAT solving performs (out of the box) relatively well on QBF, when taking into account that no particular QBF-oriented solving techniques were incorporated. The most important contribution of this work is that it provides a systematic way of lifting advances in SAT solvers to QBFs with low implementation effort.