Rudy’s OBTF
Rudolf Adamkovič
Home
/
Computer science
/
3-satisfiability (3SAT)
/
Explore
/
Case 4: More than three literals
Proof
Case 1: \(c\) is satisfiable
Case 2: \(c\) is not satisfiable
© 2025
Rudolf Adamkovič
under
GNU General Public License (GPL)
version 3 or later.
Made with
Emacs
and secret alien technologies of yesteryear.