Give an example of a Boolean formula which is in CNF form and satisfiable and whose negation is NOT satisfiable.

  • $\begingroup$ We're not particularly looking for posts that are just the statement of an exercise-style task. We're happy to help you understand the concepts but just solving exercises for you is unlikely to achieve that. Our goal is to build up an archive of knowledge that will be useful to others, and posting the text of an exercise doesn't help with that terribly much. We'd prefer questions that will be useful even to others who aren't looking at the exact same exercise as you. You might find this page helpful in improving your question. $\endgroup$
    – D.W.
    Nov 20 at 2:59
  • $\begingroup$ We are a question-and-answer site, so we require you to formulate a specific question that you want answered. A question normally ends with a "?". A demand for us to do something is not likely to be well-received (we are all volunteers, so it is not appropriate to command participants on this site to do something), and is not a substitute for a clearly articulated question. $\endgroup$
    – D.W.
    Nov 20 at 3:00


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.

Browse other questions tagged or ask your own question.