That’s a pretty strong claim. Is there a proof? Or did you just mean that consistency checking is in NP?
It’s worse than that, consistency checking is undecidable. This is implied by Gödel’s second incompleteness theorem.
It’s worse than that, consistency checking is undecidable. This is implied by Gödel’s second incompleteness theorem.