Ononot — Consider the following set of propositional clauses in a res

Guest Session: 1 Question Remaining. Create Account to save progress.

Logichard

0:00.0

Consider the following set of propositional clauses in a resolution proof system:

$\neg P \lor \neg Q \lor R$

$\neg R \lor S$

$\neg T \lor Q$

$P$

$T$

$\neg S$

What is the minimum number of binary resolution steps required to derive the contradiction (the empty clause $\square$ ) from this set of clauses?