In this paper, we show the subalgebra lattice of an algebra determined by two nontrivial unary relations and a nontrivial equivalence relation on a finite set. Moreover, we use an algorithm to indicate isomorphic covering graphs of subalgebra lattices. This gives us a lower bound of the number of categorically equivalent classes of clones on a given finite set.