Consider the following premises. forall z: P_1(z) <-> W_4(z). W_4(f_1) or p. forall z: ~R_3(z). forall z: R_3(z) -> P_1(z). forall z: P_1(z) -> R_3(z). Can we infer ~s from them? If possible, name the inference rules being used at each step.
We cannot infer that from the premises. Therefore the answer is no.