Cubic Graphs with No Short Cycle Covers

The well-known shortest cycle cover conjecture suggests that every bridgeless graph $G$ can have its edges covered with a collection of cycles of total length not exceeding $\frac75\cdot|E(G)|$. Th...