What's an example of an unsatisfiable 3-CNF formula?
-
30-10-2019 - |
Question
I'm trying to wrap my head around an NP-completeness proof which seem to revolve around SAT/3CNF-SAT.
Maybe it's the late hour but I'm afraid I can't think of a 3CNF formula that cannot be satisfied (I'm probably missing something obvious).
Can you give me an example for such formula?
No correct solution
Licensed under: CC-BY-SA with attribution
Not affiliated with cs.stackexchange