Construct a predicate calculus formalization for the Missionaries-and-Cannibals Problem (Exercise 3–2); give a resolution-based proof that it is solvable and use the example-construction technique to find a solution.

Exercise 3–2

Three missionaries and three cannibals are all on one bank of a river they wish to cross. They have a boat, which will hold two persons, but which can be rowed by one if necessary. If the cannibals ever outnumber the missionaries on a given bank, all the missionaries on that bank will be eaten. Otherwise, both parties will cooperate peacefully toward crossing the river. How can all the missionaries and cannibals be transported safely to the other bank? (b) Consider the general case in which there are m missionaries and n cannibals (m ≥ n), and in which the boat can hold p persons, but requires at least r persons to be rowed (p ≥ r).