Consider the following premises. For all y, y is not happy or y is a server. For all y, y will drive a car if and only if y is a server. For all y, y is happy or y will play squash. For all y, if y plays squash, then y is driving a car. Can we infer the following from them? If we can, name the inference rule being used: There is at least one y for which y will not drive a car.
 From the fact that for all y, y is happy or y will play squash, and that for all y, y is not happy or y is a server we can infer that for all y, y will play squash or y is a server via universal resolution. From the fact that for all y, y will drive a car if and only if y is a server we can infer that for all y, if y were a server, then y is driving a car via universal biconditional elimination. Finally, from the fact that for all y, if y plays squash, then y is driving a car, that for all y, if y were a server, then y is driving a car, and that for all y, y will play squash or y is a server we can infer that for all y, y will drive a car via universal disjunction elimination, which contradicts that There is at least one y for which y will not drive a car. Therefore, the answer is no.