Translate the following inference to logic notation: For all x, x_15 is a taxi driver. If Susan were poor, then Robert is a server. For all x, x_15 is poor or x_15 is not a taxi driver. Therefore Robert is a server.
forall x: P(x). Q(a) -> p. forall x: Q(x) or ~P(x). Therefore p.