In the paper the problem of mean behavior of an equivalence program is considered. The method used for its implementation is a set merging scheme with a path compression rule. It is proved that the expected running time for the execution of a random equivalence program is O(n) in the spanning tree model, where n is the number of elements.