I've got a system of equations
$$\begin{array}{rl} x_1 y_1 &= p_1\\ x_1 y_2 &= 1-p_1\\ x_2 y_2 &= p_2\\ x_2 y_3 &= 1-p_2\\ x_3 y_3 &= p_3\\ x_3 y_1 &= 1-p_3 \end{array}$$
where $p_i$ are constants. Is there any way to determine the number of solutions to this system without solving for the variables explicitly? Specifically, I want to know the solutions residing in the open interval $x_i, y_i \in (0,1)$.
The solvability of the system depends on the constants $p_i$. For example, for $(p_1,p_2,p_3)=(2,2,2)$ there is no solution. Using Buchberger's algorithm, or elementary elimination we see that the system has solutions if and only if the parameters satisfy the equation $$ 2p_1p_2p_3 - p_1p_2 - p_1p_3 - p_2p_3 + p_1 + p_2 + p_3 - 1=0, $$ i.e., if and only if either $(p_2,p_3)=(1,0)$, or if $$ p_1=\frac{(p_2-1)(p_3-1)}{2p_2p_3 - p_2 - p_3 + 1}. $$ In the first case all solutions are given by $$ x_1=\frac{ - p_1 + 1}{y_2}, \; x_2=\frac{1}{y_2},\; x_3=\frac{ - p_1 + 1}{p_1y_2},\; y_1=\frac{ - p_1y_2}{p_1 - 1},\; y_3=0. $$ Since $y_2\neq 0$ is arbitrary we obtain infinitely many solutions. A similar "formula" for the solutions can be obtained for the second case, e.g., $$ x_1=\frac{p_3( - p_2 + 1)}{y_3(2p_2p_3 - p_2 - p_3 + 1)}, \cdots ,\cdots $$