The importance of "proof" in math is to discover the reason and see if you can generalize or apply it somewhere else. A uncomprehandable proof is completely useless.
An advanced machine may have a much higher complexity limit on what is comprehensible. It can take insights from the proof and apply them to other proofs that are not comprehensible to humans.
Just because something is generalizable doesn't mean it's simple. Generalization doesn't have some minimal/maximal complexity requirements.