Resolves YES if by 2200 humanity has the demonstrated capability to solve all NP problems in worst-case polynomial time, with error probability bounded by a constant. Otherwise resolves NO. Because this criteria may be somewhat subjective, the resolution will be based on expert consensus.
Any method of computation is allowed for this question, as long as humans can actually do it practically and at reasonable scale. E.g. quantum computers can solve factorization in polytime, but I don't count factorization as solvable in polynomial time today because quantum computers can only do it on toy demonstrations currently.
Factorization is not NP-Complete.
Quantum computers are not expected to be able solve NP-problems in polynomial time. ("NP is not contained in BQP" is not proved but strongly conjectured.)