-- Maclain Hunter: Observable Formal Proof — Scientific-Test Version
-- Exact authored source SHA-256: 3bef564bc8b81e60c38574e23830b6ce521193f9dbbe1424a61a4325d2c48316
-- Machine formalization by Replit Agent; authority below Logic/Logos/God.
import Lean
namespace HunterAuthored

theorem inference_1 (v0 v1 v2 : Bool) :
    ((!((v0 && v1) && (v2 == (v0 && v1)))) || ((v0 && v1) && v2)) = true := by
  cases v0 <;> cases v1 <;> cases v2 <;> decide
#print axioms inference_1

end HunterAuthored