Distance-regular Terwilliger graphs with intersection arrays $\{50,42,1;1,2,50\}$ and $\{50,42,9;1,2,42\}$ do not exist

Let $\Gamma$ be a distance-regular graph and its local subgraphs are isomorphic the Hoffman-Singleton graph. A.L. Gavrilyuk and A.A. Makhnev proved that $\Gamma$ is the Terwilliger graph with intersection array $\{50,42,9;1,2,42\}$ or $\{50,42,1;1,2,50\}$. In this paper we prove that Terwilliger graphs with intersection arrays $\{50,42,1;1,2,50\}$ and $\{50,42,9;1,2,42\}$ do not exist.