Schrijver's partition formulation of Woodall's conjecture

Let $\tau\textgreater=2$ be an integer, and let $D=(V,A)$ be a digraph whose minimum dicut size is $\tau$. A strengthening is an arc set whose reversal makes the digraph strongly connected. Schrijver's reformulation. The arc set $A$ can be partitioned into $\tau$ strengthenings. This is an equivalent partition formulation of Woodall's dijoin-packing conjecture; the source does not indicate a resolution.