Translate the following inference to logic notation: For all x, if x_13 were a server, then x_13 is driving a car. Patricia is driving a car or Susan is playing tennis. For all x, if x_13 drives a car, then x_13 is a server. Patricia is a server or Susan is not playing tennis. Therefore Patricia is a server.
forall x: P(x) -> Q(x). Q(a) or p. forall x: Q(x) -> P(x). P(a) or ~p. Therefore P(a).