Several open conjectures are widely believed to be true due to strong heuristical evidence. Examples include Goldbach's conjecture , Collatz's conjecture and the Riemann hypothesis.
Are there examples of conjectures that turned out to be false despite of a strong heuristical evdidence to be true ?
I know that there are conjectures with very large smallest counterexamples , but I wonder whether there were additional reasons (except that a counterexample wasn't found for a long time) to believe the conjecture.
There is a conjecture that the number of primes between $x$ and $x+y$, inclusive, is never more than the number of primes between $2$ and $2+y$, inclusive. It seems reasonable, since anyone can see that the primes thin out as you go up, and it has never been disproved, but forty years ago it was proved to be in conflict with another unproved conjecture that has even better heuristic evidence, so it's now believed to be false.