Take something like

  (1+x*y)^3*z+y^2*(1+x*y)*(4+3*x*y);y+3*x*(1+x*y)^2*z+3*x*y^2*(4+3*x*y);2*x-3*x^2*y-x^3*z|0,0,-1/4|1,-3/2,13/2

If a thousand monkeys typed at a character per second, on a keyboard with the 23 relevant characters, it would take roughly 10^136 years for them to come up with this counterexample. Though, to be fair to monkey scenario, there's a large family of them known now, so it's not quite this bad: suppose there are a trillion permutations and similar examples that fit in this string. Then we are down to 10^124 years.

If LLMs are monkeys, somehow trained LLM weights allow them to model and prune massive numbers of universes in parallel.