Finite power-oracle queries cannot universally certify no feasible sample size

Give the procedure the constant-false oracle $E_0(n)=0$. Correctness forces the output none, and universal termination makes its queried set $Q$ finite. Put $M=1+{\sum }_{q\in Q}q$, which is a positive integer greater than every queried positive size, including $M=1$ when $Q$ is empty, and define $E_M(n)=\mathbf{1}\{n\ge M\}$. Both oracles are nondecreasing and answer false at every query in the completed $E_0$ transcript.

Run the same deterministic procedure with $E_M$. Its initial internal state is the same, and whenever a query is reached along the original transcript, its answer is the same false value. Induction through the finite transcript therefore gives identical internal states, queries and terminal output. It returns none on $E_M$, although $M$ is the least feasible size. This contradicts the claimed correctness.

These oracles are realizable as exact power-feasibility inputs: use candidate plans $d_n$ with one allocation count equal to $n$, for every positive integer $n$; at that size take the measurable space $\{0,1\}$ with its full power set, parameters $0,1$, null law $P_{0,n}={\delta }_0$, target law $P_{1,n}={\delta }_{E(n)}$, and test $\phi (x)=x$. The full power set makes $\phi$ measurable, and the proved point-mass and measurable-rejection-function suppliers in [F2] make this an experiment and randomized test. Its null size is zero and target power is $E(n)$, so a size bound zero and target power $1\mathrm{/}2$ in [F1] make feasibility equivalent to $E(n)=1$. Use either $E_0$ or $E_M$; hence the distinction is compatible with explicit statistical laws, not a numerical approximation error.