For now I think more or less the same thing as with all recent math announcements: This is in a range where human work still exists (see Terry Tao, (1)). I wonder whether the trend will extend into the problems that (as far as I can tell) are considered complete brick walls right now -- P vs. NP, Collatz, Goldbach, odd perfect numbers, problems that aren't part of any research program. (2) In other words, is the progress coming from putting together vast amounts of existing work and computational power, or is it more from RLVR and self-play and autonomous effort?
The answer to this will obviously shape the near future of mathematics, but there's also something even bigger than that at play: It has always been the case that the questions in math were stronger than the answers; you have stuff like Fermat's great theorem that is easy to state but monstrous to prove. This seems to be a property of mathematics, not of humans... but is it true?
A question by Scott Aaronson from 2011 (3) about P vs. NP seems relevant here: "Will humans manage to prove P≠NP before they either kill themselves out or are transcended by superintelligent cyborgs? And if the latter, will the cyborgs be able to prove P≠NP?" Later, he notes that if P≠NP, "once the robots do overtake us, they won’t have a general-purpose way to automate mathematical discovery any more than we do today".
---
(1) https://mathstodon.xyz/@tao/117207849921390904
(2) I'm not sure whether this is a hard distinction -- e.g. Tao also has some partial results towards Collatz (https://terrytao.wordpress.com/2019/09/10/almost-all-collatz...).