In this paper, stepwise and nearly stepwise simulation results for a n
umber of first-order proof calculi are presented and an overview is gi
ven that illustrates the relations between these calculi. For this pur
pose, we modify the consolution calculus in such a way that it can be
instantiated to resolution, tableaux model elimination, a connection m
ethod and Loveland's model elimination.