Obstacle number two conjecture for gyroelongated bipyramids

Let $X_n$ denote the gyroelongated $n$-bipyramid, and let ${\operatorname{{obs}}}_\mathrm{out}(X_n)$ be its outside obstacle number. Obstacle-number conjecture. If $n\geq 4$, then

$${\operatorname{{obs}}}_\mathrm{out}(X_n)=2.$$

The paper establishes this for $n=4,5,6$ and explains that larger cases were not computationally feasible; the conjecture asserts that no representation using only an outside obstacle exists for every larger $n$.