We present a new method for solving a system of two bivariate polynomials. In comparison to former approaches, it comes with two main advantages: Firstly, a minimum amount of symbolic computation steps is needed and, secondly, the generic position assumption is dropped. The overall method uses a very efficient implementation on the GPU for computing resultants (due to P. Emeliyanenko) and combines this result with a new inclusion predicate for the existence of a solution. The new algorithm outperforms the existing implementations by far while achieving excellent bounds on the bit complexity as well.