mirror of
https://github.com/saymrwulf/ltl-accumulator-verified.git
synced 2026-09-03 19:53:48 +00:00
mrwulf
a3b8b3ecea
Audit-of-the-coverage-audit. Its 18 added cone values re-verified against the observed #print outputs (all match). Methodology blind spots found: abbrev Bytes (bare alias, no cone content — excluded by nature) and the two ANONYMOUS gen/ instances, which are silently load-bearing (DecidableEq Hash powers ConsRec's 'if C = []' and pinAccept's root compare; Inhabited Hash powers every getD default). Transitivity covered them, but no hand-waves before external review: cones read and pinned — instInhabitedHash = [propext], instDecidableEqHash = AXIOM-FREE. The audit-surface definition is now documented in check.sh itself. Button verified by exit code: EXIT 0, ALL GREEN, FIDELITY GREEN. 54 pinned cones. LTL untouched. Co-Authored-By: Claude Fable 5 <noreply@anthropic.com>
65 lines
2.1 KiB
Text
65 lines
2.1 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
|