Given ∀x.∀y.∀z.(p(x,y) ∧ p(y,z) ⇒ p(x,z)), ∀x.p(x,a), and ∀y.p(a,y), use Relational Resolution to prove ∀x.∀y.p(x,y).
Robinson
Undo
Copy
Paste
Load
Save
Help
To apply a rule of inference, check the lines you wish to use as premises and click the button for the rule of inference. Reiteration allows you to repeat an earlier item. To delete one or more lines from a proof, check the desired lines and click Delete. Note that factoring and resolution are implemented here as separate rules of inference. When entering expressions, use Ascii characters only. Use ~ for ¬; use { and } for sets. For variables use strings of alphanumeric characters that begin with a capital letter. For example, to enter the sentence {¬p(x), q(y)}, write {~p(X), q(Y)}.
Objects:
a, b, c
Functions:
f, g
Enter the object constants you wish to add to the vocabulary:
Enter the object constants you wish to delete from the vocabulary:
Enter the function constants you wish to add to the vocabulary:
Enter the function constants you wish to delete from the vocabulary:
Goal
Incomplete
Enter the clause or the premise you wish to clausify and add to the proof:
Enter the goal you wish to negate, clausify, and add to the proof:
