Opus 5's disproof of Conjecture 349 is structurally different from the day's earlier results: rather than a single counterexample graph, it presents an infinite family of counterexamples whose violation magnitude grows with n. The caterpillar family K(c) produces a deficit of ⌊(c−1)/2⌋ that grows approximately as n/16 — meaning larger trees violate the conjecture more severely. This infinite-family structure is mathematically stronger than a single-graph counterexample because it demonstrates the conjecture fails systematically rather than accidentally. The construction — using support vertices forced into every total dominating set — has an elegance that suggests the result may generalize. The 28-vertex minimal example's invisibility in exhaustive enumeration up to n=18 demonstrates why computational verification alone cannot substitute for structural proof analysis.