The genus of the GRAY graph is 7

Using the genus embedding of the Cartesian product of three triangles we prove one can embed the smallest cubic semisymmetric graph on 54 vertices, the so-called Gray graph, in the orientable surface of genus 7, and we prove that such an embedding is optimal.