# Existing implementation of Scott's reduction?

As per this paper by Grädel, Kolaitis and Moshe Vardi, they discuss computational complexity of satisfiability problem in $$\mathrm{FO^2}$$, In order to do this they use Scott's reduction. Which is the fact that any sentence in $$\mathrm{FO^2}$$ can be reduced to Scott's Normal form in polynomial time. The Scott's Normal form is given as $$\forall x \forall y \alpha(x,y) \land \bigwedge_{i=1}^{m} \forall x \exists y \beta_{i}(x,y)$$ Does anyone know of existing code base where scott's reduction is implemented, i.e I input an arbitrary $$\mathrm{FO^2}$$ sentence and get it's Scott's Normal Form?