Smallest Neumaier graph of coherent rank five

Determine the smallest Neumaier graph having coherent rank five.

Background

The paper constructs the first known infinite family of Neumaier graphs with coherent rank five, beginning with a graph on 280 vertices having parameters (280,160,96;18,35). The authors leave unresolved whether a smaller Neumaier graph of coherent rank five exists and, if so, what its order and structure are.