Translate the following inference to logic notation: There is at least one x for which x_7 is a soldier or x_7 is not a cashier. For all x, if x_7 were a soldier, then x_7 is not rich. For all x, x_7 is rich. Therefore there is at least one x for which x_7 is not a cashier.
exists x: P(x) or ~Q(x). forall x: P(x) -> ~R(x). forall x: R(x). Therefore exists x: ~Q(x).