A contradiction is false in every row of its truth table: no assignment makes it true. Prove it by checking all rows or by reducing it to ; disprove it by finding a single row where it is T.
| Step | On | |
|---|---|---|
| 1 | Set up the rows. List all assignments as in building a truth table. | 2 letters, 4 rows |
| 2 | Evaluate the parts. Fill one column for each part joined by . | : T, T, T, F; : F, F, T, T; : F, T, F, T |
| 3 | Combine with the main connective. A conjunction is T only in a row where every part is T. Look for such a row. | no row has all three parts T: F, F, F, F |
| 4 | Read the verdict. All F: a contradiction. Any T: the formula is satisfiable, and that row is the witness to report. | all four rows F: a contradiction |