mirror of
https://github.com/saymrwulf/ltl-accumulator-verified.git
synced 2026-09-04 20:03:44 +00:00
The consistency collision extractor: walks the ConsRec new-root fold in parallel with the honest size-n tree of D₁ and returns the concrete colliding node preimage pair at the first level where the fold's hnode argument pair diverges from the honest node — or none if the fold is genuine all the way down (binding holds). Both branches verified faithful to ConsRec's hnode argument order (n₀≤k: y' left / s right; n₀>k: s left / y' right). Termination via kbelow bounds. Deliberate honest checkpoint: the DEFINITION compiles and is cone-audited [propext, LTLAcc.sha256, Quot.sound]; the binding CORRECTNESS proof — the single hardest object in the corpus — is stage 3, kept for a fresh session rather than a rushed long turn. 22 certs green. LTL untouched. Co-Authored-By: Claude Fable 5 <noreply@anthropic.com>
28 lines
936 B
Text
28 lines
936 B
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
|
|
#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
|