Resolution Refutation Proof

Step 1
Clause 8: ¬M(x7) ∨ S(x7)
Clause 1: S(x1) ∨ M(x1)

Clause 1Clause 2ResolventMGU (i.e., Theta)
819. S(x1){x7/x1}

Step 2
Clause 9: S(x1)
Clause 3: ¬S(x3) ∨ L(x3, Snow)

Clause 1Clause 2ResolventMGU (i.e., Theta)
9310. L(x1, Snow){x3/x1}

Step 3
Clause 10: L(x1, Snow)
Clause 4: ¬L(Tony, x4) ∨ ¬L(Ellen, x4)

Clause 1Clause 2ResolventMGU (i.e., Theta)
10411. ¬L(Tony, Snow){x4/Snow, x1/Ellen}

Step 4
Clause 11: ¬L(Tony, Snow)
Clause 7: L(Tony, Snow)

Clause 1Clause 2ResolventMGU (i.e., Theta)
11712. False{}

  • Answer Extraction

    Clause 1Clause 2ResolventMGU (i.e., Theta)
    ¬M(x7) ∨ S(x7) ∨ (M(x7) ∧ ¬S(x7))19. S(x1) ∨ (M(x1) ∧ ¬S(x1)){x7/x1}
    9310. L(x1, Snow) ∨ (M(x1) ∧ ¬S(x1)){x3/x1}
    10411. ¬L(Tony, Snow) ∨ (M(Ellen) ∧ ¬S(Ellen)){x4/Snow, x1/Ellen}
    11712. 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.

  • Answer to the Query

    Ellen!