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: forall x_11: R_10(x_11) -> Q(x_11). forall x_11: P_11(x_11) -> Q_11(x_11). forall x_11: Q_11(x_11) -> Q(x_11). forall x_11: P_10(x_11) or P_11(x_11). forall x_11: ~P_10(x_11) or R_10(x_11). forall x_11: T(x_11) or ~Q(x_11).
forall x_11: P_11(x_11) -> Q(x_11) can be inferred via the universal transitivity rule. forall x_11: P_11(x_11) or R_10(x_11) can be inferred via the universal resolution rule. forall x_11: Q(x_11) -> T(x_11) can be inferred via the universal rewriting rule.