Planar Graphs · Hard problem

A graph has $12$ vertices $0,1,\ldots,11$, with each vertex joined to the two vertices $1$ step away around the cycle AND the two vertices $5$ steps away (so $24$ edges in total). A brute-force search finds its girth. By how many edges does $24$ exceed the planar bound that matches this girth?