Translate the following inference to logic notation: For all x, x_4 will not drive a car. There is at least one x for which x_4 will read a book or x_4 is a soldier. For all x, x_4 will not read a book or x_4 will work. For all x, if x_4 were a soldier, then x_4 is driving a car. Therefore there is at least one x for which x_4 will work.
forall x: ~P(x). exists x: Q(x) or R(x). forall x: ~Q(x) or S(x). forall x: R(x) -> P(x). Therefore exists x: S(x).