Guest Session: 1 Question Remaining. Create Account to save progress.
Login
Logichard
0:00.0

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

  1. P∨Q∨¬RP \lor Q \lor \neg RP∨Q∨¬R
  2. egP∨S eg P \lor SegP∨S
  3. egQ∨S eg Q \lor SegQ∨S
  4. RRR
  5. egS eg SegS

What is the minimum number of resolution steps required to derive the empty clause (□\square□)?