TxGraffiti conjectured in 2023 that every nontrivial connected graph $G$ satisfies $μ^*(G) \le H(G)$, where $μ^*(G)$ is the saturation number and $H(G)$ is the harmonic index. The conjecture is false: the friendship graph $F_4$ satisfies $μ^*(F_4) = 4 > 18/5 = H(F_4)$, and an exhaustive enumeration confirms that nine vertices is the smallest order admitting a counterexample. A generalized windmill family shows that the ratio $μ^*/H$ can be made arbitrarily large. The conjecture does hold for every graph in which all vertices have the same degree, in which case $H(G) = n/2$.