Translate the following inference to logic notation: There is at least one x for which x_6 is sad or x_6 will play squash. For all x, x_6 is bored if and only if x_6 is a poet. For all x, if x_6 plays squash, then x_6 is bored. For all x, x_6 is not sad or x_6 is a poet. Therefore there is at least one x for which x_6 is bored.
exists x: P(x) or Q(x). forall x: R(x) <-> S(x). forall x: Q(x) -> R(x). forall x: ~P(x) or S(x). Therefore exists x: R(x).