{'fraction_non_alphanumeric': 0.021739130434782608, 'fraction_numerical': 0.004140786749482402, 'mean_word_length': 4.688235294117647, '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}}
Applying Extended Resolution and Forced Patterns on Random 3-SAT instances

In this study we aim to improve the runtime of the state-of-the-art March SAT solver. We apply a technique known as extended resolution on uniform random 3SAT formulae; we add additional clauses, derived from the original formula, trying to guide the solver into the direction of a viable solution. Depending on a heuristic which we introduce, we add certain patterns to the formula to aid the solver. This method will be tested both unforced and forced: the unforced method lets the solver choose whether to include the additional clauses or not, in forced solving the patterns are used anyway. The latter might turn a satisfiable problem into an unsatisfiable one, however results still are very promising: a speed up of about 18% on the average. Also, at the end of this document some valuable insights into new studies can be found, which may lead to even more substantial improvements.