Which of the following formulas can be shown to be satisfiable/unsatisfiable by just applying BCP (and nothing else)?

Question

Answer

(c ∨ ¬d ∨ ¬e ) ∧ ¬b

Answer

(c ∨ ¬d ∨ ¬e ∨ a) ∧ ( ¬e ∨ ¬f ∨ ¬d ∨ ¬a)  ∧ a

Answer

( ¬a ∨ c) ∧ (c ∨ ¬d ∨ ¬e ∨ a) ∧ ( ¬e ∨ ¬f ∨ ¬d ∨ ¬a)  ∧ a ∧ ¬b

Answer

( b ∨ c)  ∧ ( b ∨ ¬c)  ∧ ¬b

Answer

( ¬a ∨ c) ∧ (c ∨ ¬d ∨ ¬e ∨ a) ∧ ( c ∨ ¬f ∨ ¬d ∨ ¬a)  ∧ a

Crowdly