Your question is really interesting and this a rather long answer and it is only the reflexion I have so far for this prof. There is still a lot missing to make it complete. Still I decided to post it any way.
By the way thank for the kindness of all of you on my first attempt.
Something one can realize is the symmetry of both side of the inequality and on the iso-surface.
$$\frac{a^3+b^3+c^3}{3}$$
$$\sqrt{\frac{a^4+b^4+c^4}{3}}$$
$$(a+b)(b+c)(c+a)=8$$
When using a geometry approach it easy to see by the plot of the graph that the inequality is true. For that one can plot the iso-surface, $(a+b)(b+c)(c+a)=8$, using polar coordinate, gray in this graph. Then its possible to use the radius to prove the inequality, $a^i=r*a_\phi^i(\theta,\phi)$ where $a^i= (a,b,c)$
$$r*a_\phi^i(\theta,\phi) = (r*a_\phi, r*b_\phi,r*c_\phi)$$
By multiply each radius $r(\theta,\phi)$ of the iso-surface by $r_{\neq}$:
$$
r_{\neq}=\frac{a_\phi^3+b_\phi^3+c_\phi^3}
{\sqrt{3(a_\phi^4+b_\phi^4+c_\phi^4)}}
$$
We construct a new iso-surface, red in this graph, and compare there radius. If $r_{\neq}\geq 1$ then the inequality hold true. This is the case.
To prove it is more difficult as you know.
The symmetry
By the fact that $a,b,c$ can be interchange. Symmetry can be describe with 3 plane. Those plane $s_a,s_b,s_c$ are construct with the flowing vector at the origin $(0,0,0)$: $\vec{1}_p=(1,1,1), \vec{1}_a=(0,1,1), \vec{1}_b=(1,0,1), \vec{1}_c=(1,1,0)$
with $s_a=(\vec{1}_p,\vec{1}_a), s_b=(\vec{1}_p,\vec{1}_b), s_a=(\vec{1}_p,\vec{1}_b)$ and the normal to each plane is:
$$
\begin{align*}
\vec{n}_a=(0,-1,1)\\
\vec{n}_b=(1,0,-1)\\
\vec{n}_c=(-1,1,0)
\end{align*}
$$
Thus the domain can be restricted without lost of generality to one if the 6 symmetric $\mathbb{R}^3$ subset one can get from:
$$\pm\vec{n}_i\cdot\vec{a} \geq 0$$
where $\vec{a}=(a,b,c)$.
Those 6 symmetric $\mathbb{R}^3$ subset and there boundary of the are describe by any permutation of $a,b,c$ of:
$$
\begin{align}
a \geq b\geq c\geq 0 \\
a = b\, \&\, a\geq c \\
b = c\, \&\, a\geq b \\
1 \geq c \geq 0
\end{align}
$$
This symmetry old true for the transformation you where using $(a+b)=2x\dots$ and thus on each one of those 6 symmetric region a permutation of $x,y,z$ of these inequality are true by virtue of symmetry.
$$
\begin{align}
1 \geq y^2z \geq yz^2 \\
x^2z \geq 1 \geq xz^2 \\
x^2y \geq xy^2 \geq 1
\end{align}
$$
I thought that those where interesting to prove the inequality since this is one of the transformation you where talking about.
On the edge of the symmetric section
There is 6 segment on the surface of (a+b)(b+c)(c+a)=8 that define the boundary of the symmetric region. They can be verified with one equation, on $a=b$ and one on $b=c$ knowing that in this symmetric region $0\leq c \leq1$. One can solve the inequality.
For the short edge, $a=b$, we have that:
$$ c=\frac{2}{\sqrt{a}}-a$$
And using the same technique to plot the result as for the 3d case we obtain this graph.
For the long edge, $b=c$, we have that:
$$ a=\frac{2}{\sqrt{c}}-c$$
And obtain this graph.
So far this only prove that there is 6 curve on the edge of the symmetry that respect the inequality. This is a beginning for a geometric understanding of what is going on. There is a map $g(\theta,\phi)$ where the curve $a=b$, $b=c$ and any other one are one have a fix $\phi$ value where $\phi \in [0,\pi/3]$ on these curve the inequality is one variable, $\theta$, which is also bound $\theta \in [0,\Theta(\phi)]$ where $\Theta(\phi) \in [0.615,0.955]$. On such a map it might be easier to prove the inequality. But that might be what you are tiring to do.