Is deciding solvability of systems of quadratic equations with integer coefficients over the reals in NP?
This problem (usually called QUAD) is in fact complete for the existential theory of the reals, and thus showing NP-membership would be a fantastic and unexpected result. It seems that Arora and Barak intended only to ask for a proof of NP-hardness.