A generalized of conjuncterms simplification rules in polynomial settheoretical format has been considered. These rules are based on the proposed theorems for different initial conditions transform of pair conjuncterms, Hamming distance between them can be arbitrary. These rules may be useful to minimize in polynomial set-theoretical format of arbitrary logic functions with n variables. Advantages of the proposed rules of simplification are illustrated by several examples.