What can be inferred from the following premises in a single inference step (ignoring inferences that add new predicates or constants)? Name the inference rule being used: r <-> P(g). forall z: W(z) -> P(z). ~s_3 or W(g). s_3 or r.
r or W(g) can be inferred via the resolution rule. R_1(g) -> ~s_3 can be inferred via the rewriting rule. r -> P(g) can be inferred via the biconditional elimination rule. P(g) -> r can be inferred via the biconditional elimination rule.