On solving big systems of congruences

Let $S$ be a finite set of positive integers such that almost all its elements are pairwise coprime. An algorithm is presented for finding all elements $s\in S$, such that $(s,s')>1$ for an element $s'\in S$, $s'\ne s$. The algorithm allows to reduce any system of polynomial congruences to a number of systems with coprime moduli.