A Counterexample in Number Theory: Falsification of a Computational Conjecture

We report the falsification of the following conjecture: For any integer n > 1, if n is a perfect power (n = x^a with x, a > 1) and the next consecutive perfect power m (m = y^b with y, b > 1, m > n) satisfies m - n = 1, then n must be 8. Furthermore, for any perfect power n > 8, the gap to the next perfec. A counterexample was discovered computationally: witness = 1000. This result was obtained by the SOVEREIGN autonomous research system.