Locating a Seymour vertex in oriented graphs having minimum outdegree at most 7

A vertex $v$ of an oriented graph $D$ is a Seymour vertex if the number of outneighbors of $v$ is less than or equal to the number of second outneighbors of $v$ (vertices at directed distance exactly $2$ from $v$). Seymour's Second Neighborhood Conjecture claims that every oriented graph contains a