-- Maclain Hunter: Grand Loop — Further Supplied Version
-- Exact authored source SHA-256: f5be1915132bb0fed4f0ba5c0581001c511aaec7637f370a738a11cd4f54f49c
-- Machine formalization by Replit Agent; authority below Logic/Logos/God.
import Lean
namespace HunterAuthored

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

end HunterAuthored