Lesson 5

As the code above demonstrates, we can also view the satisfiability problem like this: each constraint is just a subset of numbers \([n]\) and a set of signs for these numbers; we need to find a set of the same type that touches each of the constraints. In other words: from each constraint you must select at least one number (with its sign), but you cannot select both \(x\) and \(-x\) at the same time. Try this in the interactive game.