0
$\begingroup$

I've been tasked with resolving the following statement to prove that it is valid:

$(p\rightarrow q) \rightarrow ((p \lor r) \rightarrow (q \lor r))$

I convert to CNF with the following set of clauses as a result:

$\{\{p, \lnot p, q, r\}, \{\lnot q, \lnot p, q, r\}, \{p, \lnot r, q, r\}, \{\lnot q, \lnot r, q, r\}\}$

I've labelled them (1) through (4) when applying the resolution steps.

When I attempt to resolve by refutation, I hit a bit of a wall; when applying the rule to most of these, I eliminate the resolvent because it's the trivial clause - so it's not added to the set of clauses. However, at some point, I always come across a non-trivial resolvent, namely $\{\lnot p, q, r\}$ when resolving on (1) and (2). This is then labelled (5) added to the set to give:

$\{\{p, \lnot p, q, r\}, \{\lnot q, \lnot p, q, r\}, \{p, \lnot r, q, r\}, \{\lnot q, \lnot r, q, r\}, \{\lnot p, q, r\}\}$

I've redone this step several times, with different combinations of the above clauses but always end up with the final resolvent of $\{\lnot p, q, r\}$. Though, since the statement is a tautology, it should resolve to the empty set of clauses.

Is my CNF conversion possibly the problem, or am I missing something in the resolution step?

$\endgroup$
  • $\begingroup$ I don't know the notation of the "resolution refutation" method which you want to use. However, in your CNF form you have either $p\vee \neg p$, $q\vee \neg q$ or $r\vee \neg r$ in each clause, thus it should be clear from that fact that the statement is valid. $\endgroup$ – Ove Ahlman Jun 30 '16 at 6:42
  • $\begingroup$ See Resolution: " If the sentence contains complementary literals, it is discarded (as a tautology)." $\endgroup$ – Mauro ALLEGRANZA Jun 30 '16 at 7:24
  • $\begingroup$ Typically, yes, you'd exclude those trivial clauses when writing in CNF. In resolution refutation, however, you don't (unless I have it wrong). If there is exactly one contradicting literal, you resolve it and add the resulting clause to the set of clauses. If there is more than one, you can still resolve, but then you just don't add the resulting clause to the set of clauses. $\endgroup$ – Zenadia Groenewald Jun 30 '16 at 7:25
  • $\begingroup$ I have the resolution rule described here as the following: "Resolution is only performed if the pair of clauses clash on exactly one pair of complementary literals. If two clauses clash on more than one literal, their resolvent is a trivial clause. It is not strictly incorrect to perform resolution on such clauses, but since trivial clauses contribute nothing to the satisfiability/unsatisfiability of the set of clauses, we agree to delete them from the set and not perform resolution on clauses with two clashing pairs of literals." $\endgroup$ – Zenadia Groenewald Jun 30 '16 at 7:30
  • $\begingroup$ Is it strictly necessary to remove all trivial clauses from the set before resolving, or can it be resolved even if they are included in the set of clauses? $\endgroup$ – Zenadia Groenewald Jun 30 '16 at 7:31
1
$\begingroup$

To show that the formula:

$(p→q)→((p∨r)→(q∨r))$

is valid with Resolution, we have to consider its negation and show that this is unsatisfiable.

Thus, we have to consider:

$\lnot [\lnot (\lnot p ∨ q) ∨ (\lnot (p∨r) ∨ (q∨r))]$

i.e.

$(\lnot p ∨ q) \land (p∨r) \land \lnot q \land \lnot r)$.

Thus, we have the set of clauses:

$\{ \{ ¬p,q \}, \{ p,r \}, \{ ¬q \}, \{ ¬r \} \}$.

As you can verify, we can derive the empty clause, showing that the set of clauses is unsatisfiable, and thus that the initial formula is a tautology.

$\endgroup$
  • $\begingroup$ Does disproving its unsatisfiability not just prove that the original formula is satisfiable? Not necessarily valid? $\endgroup$ – Zenadia Groenewald Jun 30 '16 at 11:58
  • $\begingroup$ @ZenadiaGroenewald - NO. $\endgroup$ – Mauro ALLEGRANZA Jun 30 '16 at 12:01

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.