Comment by skywalqer

Well, I believe the incompleteness theorems speak about provability, not about how the proofs themselves are expressed.

We know as a consequence of Goedel theorems (at least I believe so), that there is no algorithm that would take a statement and output a proof if it is provable or a counterexample if it is not. However, AI provers never give anything for sure, so I think there is no contradiction here.