This anonymous, unrefereed research release presents one explicit connected cubic graph on forty-eight vertices. Its minimum maximal matching has size fifteen, while its smallest independent dominating set has size sixteen. That strict inequality supplies a smaller candidate counterexample to a regular-graph conjecture linking the two parameters. The matching value has a short proof: the package gives a maximal matching with fifteen edges, and any maximal matching in a cubic graph with seventy-two edges must contain at least the ceiling of seventy-two divided by five, which is fifteen. The independent-domination value combines an explicit sixteen-vertex witness with an exhaustive proof tree excluding every witness of size fifteen or less. The public checker reads four hundred thirty-seven thousand one hundred eighty-eight tree nodes. A C plus plus generator reproduces the compressed certificate byte for byte, and eight deliberate corruptions are rejected in ordinary and optimized Python. The result lowers the public candidate-order upper bound from fifty to forty-eight. It does not show that forty-eight is globally minimal, that this graph is unique, or that priority is settled. GitHub and Zenodo expose matching release assets, but availability, internal replay and internal model-mediated review are not independent reproduction, formal verification, specialist review or peer review. This synthetic-voice briefing is a communication aid, not additional mathematical evidence.