Without loss of generality we may assume that a,b,c,d≥0. By dividing 2, it is enough to prove the inequality for the numbers 0≤a,b,c,d≤1:
b2+1a3+c2+1b3+d2+1c3+a2+1d3≤2.
Now, suppose that a is the largest among the a,b,c,d. Then,
b2+1a3+c2+1b3≤21+c2+1a3.
Indeed, clearing denominators and simplifying gives
2a3b2+b2c2+b2+c2+1≥2a3c2+2b5+2b3
This follows from the inequality b2c2+1≥b2+c2. b2(a3−b3)+b2(1−b)+c2(1−a3)≥0
Similarly,
c2+1a3+d2+1c3≤21+d2+1a3andd2+1a3+a2+1d3≤21+a2+1a3.
Clearly, 2a3≤a2+1, so the problem is solved.