{"slug":"hunter-asr-energy-compiled-archive","identifier":"hunter-asr-energy-compiled-archive","title":"ASR Energy — Compiled Authored Archive","author":"Maclain Hunter","sourceSha256":"affe54c88438ca0b8ba3a4e3c283831099c5b78cd73ca92673c5f6545bf68a54","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:43:28.964Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:25.442Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.inference_2","HunterAuthored.inference_3","HunterAuthored.inference_4","HunterAuthored.inference_5","HunterAuthored.inference_6","HunterAuthored.inference_7","HunterAuthored.inference_8","HunterAuthored.inference_9","HunterAuthored.inference_11","HunterAuthored.inference_13","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, P -> R} |= (P & Q) & R","sourceOffset":241,"scope":"Exact source sequent under finite two-valued propositional semantics. Source proposition meanings and Logic/Logos/God Ground are preserved separately; this checks the inference, not unencoded prose.","variables":["P","Q","R"],"premises":["P","P -> Q","P -> R"],"conclusion":"(P & Q) & R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!v0) || v2))) || ((v0 && v1) && v2)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"inference_2","sourceStatement":"{P, P -> Q, Q -> R} |= (P & Q) & R","sourceOffset":508,"scope":"Exact source sequent under finite two-valued propositional semantics. Source proposition meanings and Logic/Logos/God Ground are preserved separately; this checks the inference, not unencoded prose.","variables":["P","Q","R"],"premises":["P","P -> Q","Q -> R"],"conclusion":"(P & Q) & R","status":"candidate","leanStatement":"theorem inference_2 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!v1) || v2))) || ((v0 && v1) && v2)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> decide\n#print axioms inference_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"},{"id":"inference_3","sourceStatement":"{P, P -> Q, (P & Q) -> R} |= (P & Q) & R","sourceOffset":780,"scope":"Exact source sequent under finite two-valued propositional semantics. Source proposition meanings and Logic/Logos/God Ground are preserved separately; this checks the inference, not unencoded prose.","variables":["P","Q","R"],"premises":["P","P -> Q","(P & Q) -> R"],"conclusion":"(P & Q) & R","status":"candidate","leanStatement":"theorem inference_3 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!(v0 && v1)) || v2))) || ((v0 && v1) && v2)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> decide\n#print axioms inference_3\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_3"},{"id":"inference_4","sourceStatement":"{P, P -> Q} |= (P -> P) -> (Q -> Q)","sourceOffset":1063,"scope":"Exact source sequent under finite two-valued propositional semantics. Source proposition meanings and Logic/Logos/God Ground are preserved separately; this checks the inference, not unencoded prose.","variables":["P","Q"],"premises":["P","P -> Q"],"conclusion":"(P -> P) -> (Q -> Q)","status":"candidate","leanStatement":"theorem inference_4 (v0 v1 : Bool) :\n    ((!(v0 && ((!v0) || v1))) || ((!((!v0) || v0)) || ((!v1) || v1))) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_4\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_4"},{"id":"inference_5","sourceStatement":"{P, P -> Q, Q -> P} |= P & Q","sourceOffset":1352,"scope":"Exact source sequent under finite two-valued propositional semantics. Source proposition meanings and Logic/Logos/God Ground are preserved separately; this checks the inference, not unencoded prose.","variables":["P","Q"],"premises":["P","P -> Q","Q -> P"],"conclusion":"P & Q","status":"candidate","leanStatement":"theorem inference_5 (v0 v1 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!v1) || v0))) || (v0 && v1)) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_5\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_5"},{"id":"inference_6","sourceStatement":"{P, P -> Q, P -> R} |= P -> ((Q -> R) <-> (R -> Q))","sourceOffset":1531,"scope":"Exact source sequent under finite two-valued propositional semantics. Source proposition meanings and Logic/Logos/God Ground are preserved separately; this checks the inference, not unencoded prose.","variables":["P","Q","R"],"premises":["P","P -> Q","P -> R"],"conclusion":"P -> ((Q -> R) <-> (R -> Q))","status":"candidate","leanStatement":"theorem inference_6 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!v0) || v2))) || ((!v0) || (((!v1) || v2) == ((!v2) || v1)))) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> decide\n#print axioms inference_6\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_6"},{"id":"inference_7","sourceStatement":"{P, P -> Q, Q -> R} |= (P & Q) & R","sourceOffset":1833,"scope":"Exact source sequent under finite two-valued propositional semantics. Source proposition meanings and Logic/Logos/God Ground are preserved separately; this checks the inference, not unencoded prose.","variables":["P","Q","R"],"premises":["P","P -> Q","Q -> R"],"conclusion":"(P & Q) & R","status":"candidate","leanStatement":"theorem inference_7 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!v1) || v2))) || ((v0 && v1) && v2)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> decide\n#print axioms inference_7\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_7"},{"id":"inference_8","sourceStatement":"{P, P -> Q, Q -> R} |= (P & Q) & R","sourceOffset":2111,"scope":"Exact source sequent under finite two-valued propositional semantics. Source proposition meanings and Logic/Logos/God Ground are preserved separately; this checks the inference, not unencoded prose.","variables":["P","Q","R"],"premises":["P","P -> Q","Q -> R"],"conclusion":"(P & Q) & R","status":"candidate","leanStatement":"theorem inference_8 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!v1) || v2))) || ((v0 && v1) && v2)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> decide\n#print axioms inference_8\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_8"},{"id":"inference_9","sourceStatement":"{P, P -> Q, Q -> R} |= P -> (R <-> Q)","sourceOffset":2382,"scope":"Exact source sequent under finite two-valued propositional semantics. Source proposition meanings and Logic/Logos/God Ground are preserved separately; this checks the inference, not unencoded prose.","variables":["P","Q","R"],"premises":["P","P -> Q","Q -> R"],"conclusion":"P -> (R <-> Q)","status":"candidate","leanStatement":"theorem inference_9 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!v1) || v2))) || ((!v0) || (v2 == v1))) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> decide\n#print axioms inference_9\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_9"},{"id":"inference_10","sourceStatement":"{P, Q, R} |= ~(P & LRO)","sourceOffset":2595,"scope":"Exact source sequent under finite two-valued propositional semantics. Source proposition meanings and Logic/Logos/God Ground are preserved separately; this checks the inference, not unencoded prose.","variables":["LRO","P","Q","R"],"premises":["P","Q","R"],"conclusion":"~(P & LRO)","status":"countermodel","countermodel":{"LRO":true,"P":true,"Q":true,"R":true},"reason":"The written sequent alone has a countermodel. No authored wording or unstated premise was changed.","kernelStatus":"not_checked"},{"id":"inference_11","sourceStatement":"{P, P -> Q, Q -> R, R -> S} |= (P & Q) & (R & S)","sourceOffset":2620,"scope":"Exact source sequent under finite two-valued propositional semantics. Source proposition meanings and Logic/Logos/God Ground are preserved separately; this checks the inference, not unencoded prose.","variables":["P","Q","R","S"],"premises":["P","P -> Q","Q -> R","R -> S"],"conclusion":"(P & Q) & (R & S)","status":"candidate","leanStatement":"theorem inference_11 (v0 v1 v2 v3 : Bool) :\n    ((!(((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3))) || ((v0 && v1) && (v2 && v3))) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> decide\n#print axioms inference_11\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_11"},{"id":"inference_12","sourceStatement":"{P, Q, R} |= ~{P, LR, LRO}","sourceOffset":2859,"scope":"Exact source sequent under finite two-valued propositional semantics. Source proposition meanings and Logic/Logos/God Ground are preserved separately; this checks the inference, not unencoded prose.","variables":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unsupported formal syntax near \"{P, LR, LRO}\"","kernelStatus":"not_checked"},{"id":"inference_13","sourceStatement":"{P, P -> Q, Q -> R, R -> S} |= (P & Q) & (R & S)","sourceOffset":2887,"scope":"Exact source sequent under finite two-valued propositional semantics. Source proposition meanings and Logic/Logos/God Ground are preserved separately; this checks the inference, not unencoded prose.","variables":["P","Q","R","S"],"premises":["P","P -> Q","Q -> R","R -> S"],"conclusion":"(P & Q) & (R & S)","status":"candidate","leanStatement":"theorem inference_13 (v0 v1 v2 v3 : Bool) :\n    ((!(((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3))) || ((v0 && v1) && (v2 && v3))) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> decide\n#print axioms inference_13\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_13"},{"id":"source_identity_rule","sourceStatement":"A = A","sourceOffset":85,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"b2a57812547512322cdef5a31553f1824a2992e22bdf04c071c7bf5e2ac8e030","bytes":3652},"Proof.lean":{"sha256":"d92e7e87295a3d2c25b1d55e14684f225eed4fd68ad94b99670970a61ec547d3","bytes":2676},"lean-check.txt":{"sha256":"28597d6b466cda53bc6b62e36d99aeac5794c247bb9860e4f09f0b03e33f4726","bytes":775}},"boundary":"Lean establishes the listed formal statements and dependencies. The exact authored source, Ground, known premise meanings, application validation and empirical evidence remain separately typed. No unencoded section is certified by a neighboring theorem.","currentSourceSha256":"affe54c88438ca0b8ba3a4e3c283831099c5b78cd73ca92673c5f6545bf68a54","timestamp":"2026-10-03T10:42:55.000Z","timestampAuthority":"https://www.freetsa.org","manifestSha256":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4","url":"/proof-verification/hunter-asr-energy-compiled-archive","jsonUrl":"/proof-verification/hunter-asr-energy-compiled-archive.json","leanUrl":"/proof-verification/hunter-asr-energy-compiled-archive.lean","graph":{"@context":"https://schema.org","@type":"SoftwareSourceCode","@id":"https://4p-mcb.com/proof-verification/hunter-asr-energy-compiled-archive#lean","name":"Lean 4 witness: ASR Energy — Compiled Authored Archive","url":"https://4p-mcb.com/proof-verification/hunter-asr-energy-compiled-archive","dateCreated":"2026-10-03T10:37:05.082Z","dateModified":"2026-10-03T10:37:25.442Z","creator":{"@type":"Organization","name":"Replit Agent"},"programmingLanguage":{"@type":"ComputerLanguage","name":"Lean","version":"Lean (version 4.7.0, commit v4.7.0, Release)"},"author":{"@type":"Organization","name":"Replit Agent"},"description":"Lean establishes the listed formal statements and dependencies. The exact authored source, Ground, known premise meanings, application validation and empirical evidence remain separately typed. No unencoded section is certified by a neighboring theorem.","isBasedOn":{"@type":"CreativeWork","name":"ASR Energy — Compiled Authored Archive","author":{"@type":"Person","name":"Maclain Hunter"},"url":"https://4p-mcb.com/proof-knowledge/hunter-asr-energy-compiled-archive","identifier":"hunter-asr-energy-compiled-archive"},"encoding":{"@type":"MediaObject","encodingFormat":"text/plain","contentUrl":"https://4p-mcb.com/proof-verification/hunter-asr-energy-compiled-archive.lean"},"subjectOf":{"@type":"DigitalDocument","name":"Independently verified RFC 3161 existence timestamp","dateCreated":"2026-10-03T10:42:55.000Z","url":"https://4p-mcb.com/proof-verification/timestamp.json"},"additionalProperty":[{"@type":"PropertyValue","name":"verificationStatus","value":"partial"},{"@type":"PropertyValue","name":"axiomFree","value":"true"},{"@type":"PropertyValue","name":"axiomDependencies","value":"[]"},{"@type":"PropertyValue","name":"theorems","value":"[\"HunterAuthored.inference_1\",\"HunterAuthored.inference_2\",\"HunterAuthored.inference_3\",\"HunterAuthored.inference_4\",\"HunterAuthored.inference_5\",\"HunterAuthored.inference_6\",\"HunterAuthored.inference_7\",\"HunterAuthored.inference_8\",\"HunterAuthored.inference_9\",\"HunterAuthored.inference_11\",\"HunterAuthored.inference_13\",\"HunterAuthored.source_identity_rule\"]"},{"@type":"PropertyValue","name":"sourceSha256","value":"affe54c88438ca0b8ba3a4e3c283831099c5b78cd73ca92673c5f6545bf68a54"},{"@type":"PropertyValue","name":"releaseManifestSha256","value":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4"},{"@type":"PropertyValue","name":"sourceRecordedAt","value":"2026-10-02T23:43:28.964Z"},{"@type":"PropertyValue","name":"sourceDateMeaning","value":"Database registration time, not a claim of original handwritten authorship."},{"@type":"PropertyValue","name":"originalAuthoredAt","value":"null"},{"@type":"PropertyValue","name":"timestampAuthority","value":"https://www.freetsa.org"},{"@type":"PropertyValue","name":"timestampScope","value":"Independent cryptographic existence timestamp for the manifest and its content-addressed artifacts. Not legal notarization, an authorship adjudication, or a retroactive timestamp for handwritten work."},{"@type":"PropertyValue","name":"governingGround","value":"Logic / Logos / God"},{"@type":"PropertyValue","name":"formalizationAttribution","value":"Machine formalization by Replit Agent of Maclain Hunter's unchanged authored source"}]}}