-- Maclain Hunter: ASR Energy — Compiled Authored Archive
-- Exact authored source SHA-256: affe54c88438ca0b8ba3a4e3c283831099c5b78cd73ca92673c5f6545bf68a54
-- Machine formalization by Replit Agent; authority below Logic/Logos/God.
import Lean
namespace HunterAuthored

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

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

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

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

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

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

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

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

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

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

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

theorem source_identity_rule (α : Type) (a : α) : a = a := rfl
#print axioms source_identity_rule

end HunterAuthored