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

1. $P \lor Q \lor \neg R$
2. $eg P \lor S$
3. $eg Q \lor S$
4. $R$
5. $eg S$

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