mirror of
https://github.com/saymrwulf/ltl-accumulator-verified.git
synced 2026-09-04 20:03:44 +00:00
mrwulf
260ad64511
No theorem was wrong; every fix is spec-surface, audit-mechanism, docs, or harness coverage. Changes: LEAN (Claude F1, GPT M4): - acceptIncl: the consumer's inclusion accept (m<n ∧ Root=some r) is now a named object, not just a theorem hypothesis. Root alone accepts out-of-range m; acceptIncl pins the guard. - acceptIncl_complete / acceptIncl_sound: route Thm 1/2 through it. - extractCons_correct_paper: Thm 3 at the paper's exact quantifiers (n₀≤n₁, no separate 0<n₀; n₀=0 discharged since D₀=[]=take 0). SCRIPT (GPT H1/H2, Claude F3): - Phase 3b: fail-closed audit-surface COVERAGE — every named decl under Proofs/ and gen/ must be in CONES or a documented EXCLUDE (sha256, Bytes); anonymous gen instances count-pinned; every CONES key must be queried by AxiomCheck (no pin-but-never-check). Tested: an unclassified theorem now makes the button exit 1. - H2: distinct markers — LEAN GREEN always, ATTESTATION GREEN only when fidelity actually ran; SKIP/absent-pacta no longer emit the strong marker. Attestation gate keys on ATTESTATION GREEN. - Phase 0: orphan-olean guard (every Proofs/*.olean needs a sibling .lean); deleted 6 orphans; untracked all *.olean/.lake from git and gitignored them (root cause of the F3 tarball leak). HARNESS (Claude F1, GPT M3): - added out-of-range families (m≥n, m>n, n₀>n₁, n₀=0); re-pinned counts 230,271 / 230,016 (match the reviewer's independent RFC difftest exactly); narrowed 'exhaustive' wording to the tested domain. DOCS: README stale rows fixed (freeze banner no longer contradicts table); KNOWN-GAPS gap 3 reworded (general Lemma 2 = specializations), +gaps 9 (cost), 10 (pin init), 11 (acceptIncl resolved); STATEMENT-MAP +acceptIncl rows, +Lemma-2-general note, +constant-vs-property clarification for §10(i). Button: EXIT 0, coverage complete, ATTESTATION GREEN, 230,271/230,016. 56 pinned cones over an ENFORCED surface. LTL untouched (12, bcd15f9d). Co-Authored-By: Claude Fable 5 <noreply@anthropic.com>
70 lines
2.3 KiB
Text
70 lines
2.3 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
|