{"slug":"hunter-psr-received-copy","identifier":"hunter-psr-received-copy","title":"Proof of the PSR — Full Supplied Copy","author":"Maclain Hunter","sourceSha256":"1777fd11e570cd38f3ff96ea507523cb5866cb1250be230d3405ebdfe0421079","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:29:49.835Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:41:12.501Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, (P & Q) -> R, S, S -> T, (S & T) -> U} |= U","sourceOffset":2082,"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","T","U"],"premises":["P","P -> Q","(P & Q) -> R","S","S -> T","(S & T) -> U"],"conclusion":"U","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((v0 && ((!v0) || v1)) && ((!(v0 && v1)) || v2)) && v3) && ((!v3) || v4)) && ((!(v3 && v4)) || v5))) || v5) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"cf4a5791132681a1f6086438b70f8779f87240dda3e97776b23f0d18d3ada891","bytes":7588},"Proof.lean":{"sha256":"d79b3e61ac247c5226f5fbc8de002102454df5dfc1e10426dd680cf8d5e2c449","bytes":584},"lean-check.txt":{"sha256":"283a8aa40f54008e4bfc528069537344fae9f76a8d2f62b37f48d942b98ba62c","bytes":115}},"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":"1777fd11e570cd38f3ff96ea507523cb5866cb1250be230d3405ebdfe0421079","timestamp":"2026-10-03T10:42:55.000Z","timestampAuthority":"https://www.freetsa.org","manifestSha256":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4","url":"/proof-verification/hunter-psr-received-copy","jsonUrl":"/proof-verification/hunter-psr-received-copy.json","leanUrl":"/proof-verification/hunter-psr-received-copy.lean","graph":{"@context":"https://schema.org","@type":"SoftwareSourceCode","@id":"https://4p-engine.com/proof-verification/hunter-psr-received-copy#lean","name":"Lean 4 witness: Proof of the PSR — Full Supplied Copy","url":"https://4p-engine.com/proof-verification/hunter-psr-received-copy","dateCreated":"2026-10-03T10:37:05.082Z","dateModified":"2026-10-03T10:41:12.501Z","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":"Proof of the PSR — Full Supplied Copy","author":{"@type":"Person","name":"Maclain Hunter"},"url":"https://4p-engine.com/proof-knowledge/hunter-psr-received-copy","identifier":"hunter-psr-received-copy"},"encoding":{"@type":"MediaObject","encodingFormat":"text/plain","contentUrl":"https://4p-engine.com/proof-verification/hunter-psr-received-copy.lean"},"subjectOf":{"@type":"DigitalDocument","name":"Independently verified RFC 3161 existence timestamp","dateCreated":"2026-10-03T10:42:55.000Z","url":"https://4p-engine.com/proof-verification/timestamp.json"},"additionalProperty":[{"@type":"PropertyValue","name":"verificationStatus","value":"verified"},{"@type":"PropertyValue","name":"axiomFree","value":"true"},{"@type":"PropertyValue","name":"axiomDependencies","value":"[]"},{"@type":"PropertyValue","name":"theorems","value":"[\"HunterAuthored.inference_1\"]"},{"@type":"PropertyValue","name":"sourceSha256","value":"1777fd11e570cd38f3ff96ea507523cb5866cb1250be230d3405ebdfe0421079"},{"@type":"PropertyValue","name":"releaseManifestSha256","value":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4"},{"@type":"PropertyValue","name":"sourceRecordedAt","value":"2026-10-03T01:29:49.835Z"},{"@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"}]}}