Translate the following inference to logic notation: For all x, if x_13 drives a car, then x_13 is not working. For all x, x_13 will work. There is at least one x for which if x_13 were a sailor, then x_13 is driving a car. For all x, if x_13 drives a car, then x_13 is a sailor. For all x, if x_13 drives a car, then x_13 is a sailor. Therefore there is at least one x for which x_13 is not a sailor.
forall x: P(x) -> ~Q(x). forall x: Q(x). exists x: R(x) -> P(x). forall x: P(x) -> R(x). forall x: P(x) -> R(x). Therefore exists x: ~R(x).