Translate the following inference to logic notation: For all x, if x_11 sleeps, then x_11 is working. For all x, x_11 will cook if and only if x_11 will sleep. For all x, x_11 is a police officer or x_11 will work. For all x, if x_11 works, then x_11 is sleeping. For all x, x_11 will not cook. For all x, x_11 is not a police officer or x_11 will read a book. Therefore for all x, x_11 will read a book.
forall x: P(x) -> Q(x). forall x: R(x) <-> P(x). forall x: S(x) or Q(x). forall x: Q(x) -> P(x). forall x: ~R(x). forall x: ~S(x) or T(x). Therefore forall x: T(x).