Towards Concise, Machine-Discovered Proofs of Gödel's Two Incompleteness Theorems