Fiol et al.'s oddness–resistance conjecture for snarks with empty buffer subgraph

Let $G$ be a snark, let $\omega(G)$ denote its oddness, let $r(G)$ denote its resistance, and suppose that the buffer subgraph of $G$ is empty. Oddness–resistance conjecture with empty buffer subgraph.

$$\omega(G) \leq 2r(G).$$

The unrestricted inequality for snarks was disproved by constructing graphs with unbounded oddness and constant resistance. The proposed reformulation restricts the claim to snarks with empty buffer subgraph, but the supplied text gives no resolution for that restricted statement.