mirror of
https://github.com/saymrwulf/ltl-accumulator-verified.git
synced 2026-09-04 20:03:44 +00:00
mrwulf
2da0a79981
Round-3 verdicts: GPT-5.6 conditionally approves (blockers closed, one portability finding); the Claude reviewer's Socratic addendum produced F1*, the strongest finding of the series — deployed verify_consistency and mechanized ConsRec are NOT extensionally equal. Reproduced exactly (witness verify_consistency(1,3,R2,R3,P(2→3))=True vs ConsRec reject; 3,405 divergences n<60; strictly one-sided; power-of-two seeding mechanism confirmed in source). - KNOWN-GAPS gap 14: witness, mechanism, one-sidedness, and the pinned-pair side condition under which Theorem 3 transfers to the deployed verifier (pacta's pin-store flow supplies it by construction). No pacta code change; deployed behavior matches upstream RFC 9162 implementations. - fidelity: lied-size family — 73,573 boundary cases, 3,867 expected divergences PINNED, one-sided direction asserted per case. Banner rescoped: agreement over pinned families, not extensional equality. - Theorem3.lean: acceptCons_sound (F2) — soundness over the named acceptCons predicate, n₀=0 discharged from the non-prefix premise, size bound derived from acceptance via new consRec_some_le. Cones read from #print axioms; CONES/AxiomCheck/allowlist updated (218 → 222 constants, diff = the two theorems + two generated auxiliaries). - F3/GPT§7: verification/lean-toolchain pin + run_bare.sh (reviewer's standalone runner, plain public lean — verified green: 61 cones, 222 constants, gate green) + AENEAS_ENV override in check.sh and selftest_audit.sh. - F4: awk field-equality replaces regex-with-dots in Phase 3b. - F5: git-tracked .pyc removed (worse than reported — it was in the repo, not just the kit); __pycache__ gitignored; round-4 kit ships a corpus MANIFEST.sha256 + pinned commit (also GPT's governance condition). check.sh exit 0, ATTESTATION GREEN; selftest exit 0, 9/9 + control. Live LTL untouched (12 leaves, bcd15f9d…); attestation still gated on ePrint decision + author review + explicit operator order. Co-Authored-By: Claude Fable 5 <noreply@anthropic.com>
72 lines
2.4 KiB
Text
72 lines
2.4 KiB
Text
/- Axiom-cone observation for the audit (Phase 3 of check.sh). -/
|
|
import Proofs.Basic
|
|
import Proofs.Completeness
|
|
import Proofs.Extract
|
|
import Proofs.Descent
|
|
import Proofs.Consistency
|
|
import Proofs.Binding3
|
|
import Proofs.Refactor
|
|
import Proofs.Theorem3
|
|
import Proofs.PinStore
|
|
#print axioms LTLAcc.domsep
|
|
#print axioms LTLAcc.kbelow_pos
|
|
#print axioms LTLAcc.kbelow_lt
|
|
#print axioms LTLAcc.le_two_kbelow
|
|
#print axioms LTLAcc.kbelow_pow2
|
|
#print axioms LTLAcc.MTH
|
|
#print axioms LTLAcc.Root
|
|
#print axioms LTLAcc.ConsRec
|
|
#print axioms LTLAcc.Path
|
|
#print axioms LTLAcc.incl_complete
|
|
#print axioms LTLAcc.hnode_preimage_inj
|
|
#print axioms LTLAcc.IsCollision
|
|
#print axioms LTLAcc.extractIncl
|
|
#print axioms LTLAcc.extractIncl_correct
|
|
#print axioms LTLAcc.extractIncl_nonvacuous
|
|
#print axioms LTLAcc.extractMTH
|
|
#print axioms LTLAcc.extractMTH_correct
|
|
#print axioms LTLAcc.extractMTH_nonvacuous
|
|
#print axioms LTLAcc.kbelow_prefix_eq
|
|
#print axioms LTLAcc.take_take_le
|
|
#print axioms LTLAcc.take_drop_prefix
|
|
#print axioms LTLAcc.extractConsNode
|
|
#print axioms LTLAcc.take_all
|
|
#print axioms LTLAcc.consRecBinding
|
|
#print axioms LTLAcc.consRec_base_false_eq
|
|
#print axioms LTLAcc.consRec_base_true_eq
|
|
#print axioms LTLAcc.extractCons
|
|
#print axioms LTLAcc.extractCons_correct
|
|
#print axioms LTLAcc.extractCons_nonvacuous
|
|
#print axioms LTLAcc.pinAccept_monotone
|
|
#print axioms LTLAcc.pin_prefix_correct
|
|
#print axioms LTLAcc.fork_distinct
|
|
#print axioms LTLAcc.pin_prefix_nonvacuous
|
|
|
|
#print axioms LTLAcc.MTH_single
|
|
#print axioms LTLAcc.MTH_split
|
|
#print axioms LTLAcc.Root_left
|
|
#print axioms LTLAcc.Root_one
|
|
#print axioms LTLAcc.Root_one_cons
|
|
#print axioms LTLAcc.Root_right
|
|
#print axioms LTLAcc.acceptCons
|
|
#print axioms LTLAcc.eq_dropLast_append_of_getLast?
|
|
#print axioms LTLAcc.exists_singleton_of_length_one
|
|
#print axioms LTLAcc.getD_drop
|
|
#print axioms LTLAcc.getD_take
|
|
#print axioms LTLAcc.hleaf
|
|
#print axioms LTLAcc.hnode
|
|
#print axioms LTLAcc.kbelow
|
|
#print axioms LTLAcc.kbelow_eq_of_pow2_between
|
|
#print axioms LTLAcc.pinAccept
|
|
#print axioms LTLAcc.pinExtract
|
|
#print axioms LTLAcc.pow2_exp_unique
|
|
#print axioms LTLAcc.take_append_drop
|
|
#print axioms LTLAcc.instInhabitedHash
|
|
#print axioms LTLAcc.instDecidableEqHash
|
|
#print axioms LTLAcc.acceptIncl
|
|
#print axioms LTLAcc.acceptIncl_complete
|
|
#print axioms LTLAcc.acceptIncl_sound
|
|
#print axioms LTLAcc.extractCons_correct_paper
|
|
#print axioms LTLAcc.Hash
|
|
#print axioms LTLAcc.consRec_some_le
|
|
#print axioms LTLAcc.acceptCons_sound
|