Davila–Kenter forcing-number conjecture for graphs with given girth

Let $G$ be a graph with girth $g\geq 3$ and minimum degree $\delta\geq 2$. Its forcing number $F(G)$ is the cardinality of a smallest forcing set, where a forcing set is an initial set of colored vertices from which the iterative forcing process colors every vertex of $G$.

Davila–Kenter conjecture.

$$F(G)\geq \delta+(\delta-2)(g-3).$$

The conjecture gives a lower bound for the forcing number in terms of minimum degree and girth. The supplied material does not state whether it has been resolved.