  We prove that QCSP$(\mathbb{N};x=y\rightarrow y=z)$ is PSpace-complete,
settling a question open for more than ten years. This completes the complexity
classification for quantified equality languages as a trichotomy between
Logspace, NP-complete and PSpace-complete.
