We show that there exist graphs with harmonic index less than their minimum maximal matching number. This disproves the TxGraffiti conjecture stating that the minimum maximal matching number of a connected graph is at most its harmonic index.