Zwangsjagge (constraint-construction-search)
Translate a finite mathematical construction problem into constraints, solve it, and verify the result outside the solver. The encoding is a proof obligation, not clerical glue.
Choose the formulation
Read references/solver-routing.md when choosing between Boolean, SMT, CP-SAT, and MIP formulations.
- Use CryptoMiniSat for Boolean structure with substantial XOR or parity constraints.
- Use Z3 for bit-vectors, bounded integers, arrays, symbolic relations, or mixed logical structure.
- Use OR-Tools CP-SAT for bounded-integer combinatorial models with global or scheduling-style constraints.
- Use Gurobi for linear or mixed-integer formulations when a licensed installation is available and numerical tolerances are controlled.
Encoding contract
- Define variables, domains, symmetry breaking, constraints, objective, and the mathematical map between models and objects.
- Bound every integer and bit-vector operation. State overflow, wraparound, and signedness semantics.
- Test the encoding on hand-built satisfiable and unsatisfiable fixtures, including boundary cases.
- Emit a witness in a solver-neutral format and verify the original mathematical predicate with separate code.
- Freeze model text or generated-model hash, solver version, parameters, seed, time limit, termination status, and logs.
- Treat feasibility, infeasibility, bounded objective, and proved optimum as different outcomes.
- Apply the certification rules in references/certification.md before reporting UNSAT or optimality.
Stop conditions
- Stop if the independent verifier reconstructs the solver's encoding instead of checking the original object.
- Stop if a real-valued tolerance, big-M constant, overflow, or implicit coercion can change feasibility.
- Stop if symmetry breaking has no proof that every equivalence class retains a representative.
- Stop before using licensed software, remote services, or paid compute without the required authority.
1---2name: constraint-construction-search3description: "Encode and verify finite construction or optimization searches with CryptoMiniSat, Z3, OR-Tools CP-SAT or Gurobi, including witness extraction, model audits, and calibrated UNSAT or optimality claims."4metadata:5 source: https://skillmd.com/skills/odinfree/constraint-construction-search6---78# Zwangsjagge (constraint-construction-search)910Translate a finite mathematical construction problem into constraints, solve it, and verify the result outside the solver. The encoding is a proof obligation, not clerical glue.1112## Choose the formulation1314Read [references/solver-routing.md](references/solver-routing.md) when choosing between Boolean, SMT, CP-SAT, and MIP formulations.1516- Use CryptoMiniSat for Boolean structure with substantial XOR or parity constraints.17- Use Z3 for bit-vectors, bounded integers, arrays, symbolic relations, or mixed logical structure.18- Use OR-Tools CP-SAT for bounded-integer combinatorial models with global or scheduling-style constraints.19- Use Gurobi for linear or mixed-integer formulations when a licensed installation is available and numerical tolerances are controlled.2021## Encoding contract22231. Define variables, domains, symmetry breaking, constraints, objective, and the mathematical map between models and objects.242. Bound every integer and bit-vector operation. State overflow, wraparound, and signedness semantics.253. Test the encoding on hand-built satisfiable and unsatisfiable fixtures, including boundary cases.264. Emit a witness in a solver-neutral format and verify the original mathematical predicate with separate code.275. Freeze model text or generated-model hash, solver version, parameters, seed, time limit, termination status, and logs.286. Treat feasibility, infeasibility, bounded objective, and proved optimum as different outcomes.297. Apply the certification rules in [references/certification.md](references/certification.md) before reporting UNSAT or optimality.3031## Stop conditions3233- Stop if the independent verifier reconstructs the solver's encoding instead of checking the original object.34- Stop if a real-valued tolerance, big-M constant, overflow, or implicit coercion can change feasibility.35- Stop if symmetry breaking has no proof that every equivalence class retains a representative.36- Stop before using licensed software, remote services, or paid compute without the required authority.