This definition of NP is in conflict, when you compare this which what is written in Wikipedia about: P versus NP problem .
Which reads: "The class of questions for which an answer can be verified in polynomial time is called NP."
For comments about Euler Diagram see: Euler diagram for P, NP, NP-Complete and NP-hard set of problems
1. Overview