Manoussakis's pancyclicity conjecture for digraphs

Let $D$ be a strongly connected digraph on $n$ vertices. For vertices $x,y,z\in V(D)$, say that $x$ is nonadjacent to $y$ when neither arc between them is present. A digraph is pancyclic if it contains directed cycles of every length allowed by the conjecture.

Manoussakis's conjecture. If, for every triple $x,y,z\in V(D)$ with $x$ nonadjacent to $y$, the inequalities

$$d(x)+d(y)+d^+(x)+d^-(z)\geq 3n+1$$

when $xz\notin A(D)$, and

$$d(x)+d(y)+d^+(z)+d^-(x)\geq 3n+1$$

when $zx\notin A(D)$, hold, then $D$ is pancyclic.

This is a proposed pancyclic analogue of Manoussakis-type Hamiltonicity degree conditions. The supplied source does not report a resolution.