Rudy’s OBTF Rudolf Adamkovič

Home / Computer science / 3-satisfiability (3SAT) / Explore / Case 4: More than three literals / Proof

Case 2: \(c\) is not satisfiable

For all \(i\), \(\ell_i = 0\).

© 2025 Rudolf Adamkovič under GNU General Public License version 3.
Made with Emacs and secret alien technologies of yesteryear.