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