 Solution

Take $S_1$ to consist of the three usual first-order sentencesThese assert reflexivity, symmetry and transitivity and therefore define exactly the equivalence relations.

For $S_2$, adjoin to $S_1$ the single first-order sentenceIts witness $y$ gives a second member of each class, while its final universal clause excludes all others. Hence every class has exactly two members, and conversely such a relation satisfies it. This remains a finite set of first-order sentences.

For each positive integer $n$, writeThenEvery class in a first-order model has at least $n$ elements for every $n$, so cannot be finite. Conversely every infinite equivalence class supplies each finite collection of distinct witnesses. The displayed infinite scheme therefore has exactly the requested first-order models.