I spent hours on this... feel pretty pathetic. I read this on an old AMATYC exam:
Let $\quad c, \quad$ and $\quad d\quad$ be the roots of $\quad x^2+ax+b$
and let $\quad a, \quad$ and $\quad b\quad$ be the roots of $\quad x^2+cx+d$
What is the value of $$a+b+c+d$$ Somehow, I am to reason that this value is $\quad -2$
I do realize that this must mean that $$\begin{cases} a&=-(c+d) \\ b&=cd \\ c&=-(a+b) \\ d&=ab \\ \end{cases}$$ would have a solution, but I cannot show one exists, can you find an example?...
the first and third equations alone imply that you can set two of the four variables free: $$\begin{pmatrix}1&0&1&1 \\ 1&1&1&0\end{pmatrix}\cdot \begin{pmatrix}a\\b\\c\\d\end{pmatrix}=0 \quad \sim \quad\begin{pmatrix}1&0&1&1 \\ 0&1&0&-1\end{pmatrix}\cdot \begin{pmatrix}a\\b\\c\\d\end{pmatrix}=0$$ so that $$\begin{cases} a&=-c-d \\ b&=d \\ c&=c \\ d&=d\\ \end{cases}$$
perhaps new letters?... kidding but:
$$x^2-(r_1+r_2)x+r_1r_2 \qquad \text{vs}\qquad x^2+(r_1+r_2-r_1r_2)x-r_1r_2(r_1+r_2)$$
works only one way: the roots of second are the coefficients of the first alright, but not the other way around.
Picking up where the OP left off.
Subtracting $\,(1)-(3)\,$:
$$ \require{cancel} \cancel{a} - \bcancel{c} = -(\bcancel{c}+d) + (\cancel{a}+b) \quad\iff\quad b = d $$
Using $\,b = d\,$ in $\,(2)\,$, $\,(4)\,$:
$$ b = cb \quad\iff\quad b = 0 \;\;\lor\;\; c = 1 \\ b = ab \quad\iff\quad b = 0 \;\;\lor\;\; a = 1 $$
$b = d = 0 \implies c = -a\,$ from $(1)$ and therefore $a+b+c+d = 0\,$.
$b = d \ne 0 \implies a = c = 1 \implies a + b + c + d = -(a+c) = -2$ from $\,(1) + (3)\,$.
[ EDIT ] $\;$ For a brute force approach using heavier machinery, let $\,t=a+b+c+d\,$ be the sum in question. Eliminating $a,b,c,d$ between $(1)-(4)$ and the expression for $t$ results (courtesy WA) in the equation $\,t(t+2)= 0\,$ with roots $0, -2$.