Translate the following inference to logic notation: For all x, if x_5 were curious, then x_5 is a bartender. For all x, if x_5 were a bartender, then x_5 is a carpenter. For all x, if x_5 sleeps, then x_5 is a carpenter. For all x, x_5 is curious or x_5 will sleep. For all x, x_5 is rich. Therefore for all x, x_5 is a carpenter and x_5 is rich.
forall x: P(x) -> Q(x). forall x: Q(x) -> R(x). forall x: S(x) -> R(x). forall x: P(x) or S(x). forall x: T(x). Therefore forall x: R(x) and T(x).