Translate the following inference to logic notation: There is at least one x for which x_8 is a bartender or x_8 is bored. For all x, if x_8 were a soldier, then x_8 is rich. For all x, if x_8 were bored, then x_8 is a soldier. For all x, x_8 is rich if and only if x_8 is a bartender. Therefore there is at least one x for which x_8 is rich.
exists x: P(x) or Q(x). forall x: R(x) -> S(x). forall x: Q(x) -> R(x). forall x: S(x) <-> P(x). Therefore exists x: S(x).