Cutting Planes Method

A proof and refutation method that operates on linear inequalities representing 0–1 integer constraints: derive new valid linear inequalities by linear combinations and apply integer rounding (cutting) rules to eliminate fractional solutions and ultimately derive an explicit contradiction (e.g., 0 ≥ 1) for propositional encodings of arithmetic constraints.