We present a confluence criterion for term rewrite systems by relaxing termination requirements of Knuth and Bendix’ confluence criterion, using joinability of extended critical pairs. Because computation of extended critical pairs requires equational unification, which is undecidable, we give a sufficient condition for testing joinability automatically.