/**
 * Lemma Decomposition (Phase 1, rule-based) — verification-side tests.
 *
 * Mechanism (from AlphaProof Nexus, DeepMind 2026): the whole-claim path runs at most
 * ONE formal check (the first pattern in classifyClaim's cascade) and ignores every
 * other conjunct in a compound claim. Decomposition splits the claim and runs a check
 * per conjunct, catching violations the single check skips.
 *
 * Soundness properties under test:
 *  - any sub-lemma formal FAIL ⇒ parent FAIL (a false conjunct ⇒ false claim)
 *  - PASS only when every check that ran passed (≥ the whole-claim path's checks)
 *  - decomposition never moves a formal claim back to LLM (monotonic)
 *  - decomposeClaimRuleBased is pure & deterministic
 *
 * Spec: docs/plans/2026-06-04-lemma-decomposition-tournament-regeneration.md
 */
export {};