Discussion about this post

User's avatar
The Coding Gopher's avatar

This is where a solver earns its place. Give the hard constraints to OR-Tools CP-SAT and it can return INFEASIBLE, which is a proof, and with assumption literals it names a subset of requirements that conflict. "I couldn't fix the clash" becomes "these requirements can't all hold together."

Ready for more?