Too many paragraphs, with a deduction (unknown goal => can't be automated), that can easily be shown to be invalid because the halting problem is undecidable -

Too many paragraphs, with a deduction (unknown goal => can't be automated), that can easily be shown to be invalid because the halting problem is undecidable - e.g. it implies existence of (automated and goal can't be known).