@trwnh oh you mean AS2, not general formal reasoning
this reminded me of Gödel's incompleteness theorem
any sufficiently useful and consistent set of axioms will have some statement X that is unprovable under the existing axioms. Trying to get to 100% might introduce an inconsistency (and being consistent is more important than being complete)
that's not to say that some axiomatic mathematical spaces aren't provably complete (many are), but that sometimes completeness lags and that's okay, so long as it's not contradictory, and as long as there are enough axioms to be useful