Step 1
Clause 8: ¬M(x7) ∨ S(x7)
Clause 1: S(x1) ∨ M(x1)
| Clause 1 | Clause 2 | Resolvent | MGU (i.e., Theta) |
|---|---|---|---|
| 8 | 1 | 9. S(x1) | {x7/x1} |
Step 2
Clause 9: S(x1)
Clause 3: ¬S(x3) ∨ L(x3, Snow)
| Clause 1 | Clause 2 | Resolvent | MGU (i.e., Theta) |
|---|---|---|---|
| 9 | 3 | 10. L(x1, Snow) | {x3/x1} |
Step 3
Clause 10: L(x1, Snow)
Clause 4: ¬L(Tony, x4) ∨ ¬L(Ellen, x4)
| Clause 1 | Clause 2 | Resolvent | MGU (i.e., Theta) |
|---|---|---|---|
| 10 | 4 | 11. ¬L(Tony, Snow) | {x4/Snow, x1/Ellen} |
Step 4
Clause 11: ¬L(Tony, Snow)
Clause 7: L(Tony, Snow)
| Clause 1 | Clause 2 | Resolvent | MGU (i.e., Theta) |
|---|---|---|---|
| 11 | 7 | 12. False | {} |
| Clause 1 | Clause 2 | Resolvent | MGU (i.e., Theta) |
|---|---|---|---|
| ¬M(x7) ∨ S(x7) ∨ (M(x7) ∧ ¬S(x7)) | 1 | 9. S(x1) ∨ (M(x1) ∧ ¬S(x1)) | {x7/x1} |
| 9 | 3 | 10. L(x1, Snow) ∨ (M(x1) ∧ ¬S(x1)) | {x3/x1} |
| 10 | 4 | 11. ¬L(Tony, Snow) ∨ (M(Ellen) ∧ ¬S(Ellen)) | {x4/Snow, x1/Ellen} |
| 11 | 7 | 12. M(Ellen) ∧ ¬S(Ellen) | {} |
For answer extraction, the original query is carried along as an extra disjunct while the same resolution steps and substitutions are performed. When the proof reaches the final resolvent, those substitutions have instantiated the query as M(Ellen) ∧ ¬S(Ellen), identifying Ellen as the answer.
Ellen!