We report the falsification of the following conjecture: For any integer n >= 2, let S_n be the set of primes of the form k^2+1 where k <= n. Let M_n be the maximum gap between consecutive elements in the sorted sequence S_n (defining the first gap as p_1 - 2). Then, M_n is strictly less than (ln(p_max))^3. A counterexample was discovered computationally: witness = Max gap 9084000 >= bound 10133.16 at n=50000, p_max=2500000001. This result was obtained by the SOVEREIGN autonomous research system.