In my view, it's theoretically possible for a combination of the author's iterative prompts + evaluation with Wolfram Alpha to activate the weights that encode the language that describes the constraints on these polynomials (from the faulty proofs) in such a way that the author eventually arrives at this:
> ((1+xy)^3 z + y^2 (1+xy) (4+3xy), y + 3 x (1+xy)^2 z + 3 x y^2 (4+3xy), 2 x - 3 x^2 y - x^3 z): \C^3\to \C^3
How is that not like claiming that a "combination of iterative prompts and evaluation with Wolfram Alpha" would produce my Google Mail password? I also have to note that this response abandons the original claim, that the counterexample was found by exhaustively searching prior failed attempts.
I haven't seen these claims, but all of the open problems that have been solved so far have been in the category of "humans could have solved them, but didn't". This doesn't diminish the significance of the results, but it does mean there's still work for mathematicians to do other than glorified prompt engineers.
This specific counterexample really is trivial. There's nothing to cite. People have wasted hours and hours on a question whose answer you could give as a homework problem in Calc II.
> ((1+xy)^3 z + y^2 (1+xy) (4+3xy), y + 3 x (1+xy)^2 z + 3 x y^2 (4+3xy), 2 x - 3 x^2 y - x^3 z): \C^3\to \C^3