{'fraction_non_alphanumeric': 0.03924646781789639, 'fraction_numerical': 0.006279434850863423, 'mean_word_length': 4.186991869918699, '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}}
On the Tractability of the Un/Reachability Problem

The Petri Net (PN) reachability problem is an effective formulation to attack the P vs. N P problem. The effectiveness is due to the inverse of the PN structure. The inversed reachability problem exchanges the initial and target state of the PN. In this problem, some 2SAT (XOR-SAT) formula arises to determine the " incompatibility " of a particular assignment, which does not mean that 3SAT is reduced to 2SAT. The PN structure is also to be " levelled " for the inversed reachability problem. The solution complexity is O(n 5), n is the number of the literals, thus P = N P = coN P.