Translate the following inference to logic notation: There is at least one x for which x_6 is not a soldier or x_6 is a sailor. For all x, x_6 is not a sailor or x_6 will play squash. For all x, x_6 will not write a letter or x_6 will take a plane. For all x, x_6 is a soldier or x_6 will write a letter. Therefore there is at least one x for which x_6 will take a plane or x_6 will play squash.
exists x: ~P(x) or Q(x). forall x: ~Q(x) or R(x). forall x: ~S(x) or T(x). forall x: P(x) or S(x). Therefore exists x: T(x) or R(x).