Problem Forge
Make each variable true or false so that every clause has at least one true literal.
(x₁ ∨ x₂ ∨ x₃)
∧ (¬x₁ ∨ ¬x₂)
x₁ = 1, x₂ = 0, x₃ = 0
(x₁ ∨ x₂)
∧ (¬x₁ ∨ x₂)
∧ (x₁ ∨ ¬x₂)
∧ (¬x₁ ∨ ¬x₂)
This Month's Challenges: Boolean Satisfiability (SAT)
This month's rungs
| rung | solved, all climbers | answers sent, all climbers | status |
|---|---|---|---|
| 2026-11-SAT-12 | 0 | 0 | unsolved |
| 2026-11-SAT-11 | 0 | 0 | unsolved |
| 2026-11-SAT-10 | 0 | 0 | unsolved |
| 2026-11-SAT-09 | 0 | 0 | unsolved |
| 2026-11-SAT-08 | 1 | 1 | solved |
| 2026-11-SAT-07 | 1 | 1 | solved |
| 2026-11-SAT-06 | 1 | 1 | solved |
| 2026-11-SAT-05 | 1 | 1 | solved |
| 2026-11-SAT-04 | 1 | 1 | solved |
| 2026-11-SAT-03 | 1 | 1 | solved |
| 2026-11-SAT-02 | 1 | 1 | solved |
| 2026-11-SAT-01 | 1 | 1 | solved |
| 2026-11-SAT-00 | 1 | 1 | solved |
Sign in to see your own progress and to open the rungs.
Samples
Five sample files, each with its answer. You need no account. To check your own answer, open a file on the Check page.
- SAMPLE-SAT-01.cnf · 35 variables, 141 clauses · answer
- SAMPLE-SAT-02.cnf · 32 variables, 167 clauses · answer
- SAMPLE-SAT-03.cnf · 27 variables, 137 clauses · answer
- SAMPLE-SAT-04.cnf · 28 variables, 155 clauses · answer
- SAMPLE-SAT-05.cnf · 28 variables, 119 clauses · answer
Read more: references for Boolean Satisfiability (SAT).