Let K be a nonempty closed convex subset of a real Hilbert space H. Approximation solvability of a system of nonlinear variational inequality (SNVI) problems, based on the convergence of projection methods, is given as follows: find elements $x^*,;y^*{in}H$ such that $g(x^*),;g(y^*){in}K$ and $$<;{ ho}T(y^*)+g(x^*)-g(y^*),;g(x)-g(x^*);{geq};0;{forall};g(x){in}K;and;for;{ ho}>0$$ $$<;{eta}T(x^*)+g(y^*)-g(x^*),;g(x)-g(y^*);{geq};0;{forall}g(x){in}K;and;for;{eta}>0,$$ where T: $H;{ ightarrow};H$ is a relaxed $g-{gamma}-r-cocoercive$ and $g-{mu}-Lipschitz$ continuous nonlinear mapping on H and g: $H{ ightarrow};H$ is any mapping on H. In recent years general variational inequalities and their algorithmic have assumed a central role in the theory of variational methods. This two-step system for nonlinear variational inequalities offers a great promise and more new challenges to the existing theory of general variational inequalities in terms of applications to problems arising from other closely related fields, such as complementarity problems, control and optimizations, and mathematical programming.