Build the exact containment hierarchy of minimal repair consequences

Extends the exact robust-repair overlap audit into a consequence-containment partially ordered set. It returns every strict subset-to-superset relation, the Hasse diagram cover edges (transitive reduction), per-repair comparable and incomparable neighbors, a deterministic longest chain, an exact maximum antichain, and a deterministic minimum chain cover with a verified Dilworth identity. It does not rank repairs or apply criterion weights. Results are exact for returned grid/sample observations, not continuous-time proofs, causal claims, quality scores, recommendations, interpretations, predictions, probabilities, or statistical confidence. No licensed catalog, new dependency, or request-time network source is used. One standard quota unit per admitted request; failed or timed-out admitted attempts are not refunded. Do not automatically retry. Historical mode uses an explicit BCE/CE date object and UT1 conventions. Its response is the versioned historical envelope, not the modern UTC envelope. Read result for calculation fields and metadata for limits and uncertainty.