They are also non-equivalent since their consequents are semantically weaker than their antecedents; this requires that after their application, the antecedent nodes are still reusable for further rule applications.
(∀ T ) is non-equivalent and γ; for instance, for any en-Efficeint theorem proving with LangPro becomes more challenging with multi-premised problems and monotonic GQs.