Infinite induced-system freeness conjecture

Let $\mathcal{F}$ be a possibly infinite set of systems of induced equations, and let a Boolean function be $\mathcal{F}$-free when it contains no induced solution of any system in $\mathcal{F}$. Infinite induced-system conjecture. For every possibly infinite set $\mathcal{F}$ of systems of induced equations, the property of being $\mathcal{F}$-free is testable with one-sided error. This is motivated by the analogy with induced-free graph and hypergraph properties; the source raises it as an open conjecture, while noting that bounded-rank variants may be more plausible.