everything it does must be verified in such a way to render the automation aspect useless.
While there’s no formal mathematical proof that P ≠ NP, all signs point it being so. Even if literally everything must be verified as you say, it still very often takes less time to verify a result than to generate it.