Superposition and Model Evolution are calculi for automated
theorem proving in first-order logic. We present a new calculus,
ME+SUP, which generalizes both calculi (with equality) by integrating
their inference rules and redundancy criteria in a non-trivial
way. The main motivation is to combine the advantageous features of
both, rather complementary, calculi in a single framework. For
instance, Model Evolution, as a lifted version of the propositional
DPLL procedure, contributes a non-ground splitting rule that
effectively permits to split a clause into non variable disjoint
subclauses. In the talk I give an overview of the ME+Sup calculus
and the main ideas behind it.