It is impossible to put three pigeons in two pigeon holes with at most one pigeon per hole.
Prove this by the resolution algorithm.
Let xij be true when pigeon i is placed in hole j and formulate the problem in clausal form. The resolution proof for pigeon hole problems explodes exponentially with the number of pigeons.