The contrapositive of 'A implies B' is 'not B implies not A', and the two are logically equivalent. That equivalence is one of the most useful facts in deductive reasoning, because it gives the engine two structurally distinct paths to the same conclusion. When the forward direction is tangled — many cases, slippery boundary conditions, intermediate quantities that resist closed-form treatment — the reverse direction is sometimes immediate. Choosing the cleaner path is a structural optimisation, not a matter of taste.
The Quantm engine considers the contrapositive route during decomposition whenever a forward implication looks expensive. If the forward derivation requires twenty steps and the contrapositive requires three, the engine takes the three-step path and records that it did so. The audit trail shows both the chosen direction and the equivalence that justified the choice, so a reviewer can confirm the substitution is valid rather than treating it as an opaque shortcut.
The broader principle is that the engine is not committed to any particular direction of proof. It is committed to soundness and to the cleanest available derivation. Contrapositive reasoning is one of several structural moves — alongside proof by contradiction, case analysis, and inductive arguments — that the engine selects from based on the shape of the problem. The user does not see the menu. They see the result, the chain that produced it, and the rationale for the structural choices made along the way.