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