Here is an elementary proof that does not require the $pqr$ method (however using it will tremendously speed up the proof). Notice that:
$$\frac{1}{x+yz}=\frac{3}{3x+3yz}=\frac{3}{x^2+xy+xz+3yz}.$$
Using this representation and summing over the cyclic terms, we have the following result after some tedious simplification:
$$\sum_{cyc}\frac{1}{x+yz}=\sum_{cyc}\frac{3}{x^2+xy+xz+3yz}=\frac{12(x+y+z)^2(xy+yz+zx)}{\prod_{cyc}(x^2+xy+xz+3yz)}=\frac{4(xy+yz+yx)}{\prod_{cyc}(x+yz)}.$$
Therefore, the original inequality simplifies to:
$$ 9(x+yz)(y+zx)(z+xy) - 8(xy+yz+xz)^2\geq 0.$$
By expanding the polynomial, one can show that:
$$9(x+yz)(y+zx)(z+xy) - 8(xy+yz+xz)^2 - \frac{1}{2}\sum_{cyc}(x-y)^2z^2=9xyz(x^2+y^2+z^2+xyz-4),$$
and it thus suffices to show that $x^2+y^2+z^2+xyz-4\geq 0$. This can be proved by a standard Lagrange Multiplier. The first order condition is:
$$
2x+yz-\lambda = 0\\
2y+xz-\lambda = 0\\
2z+xy-\lambda = 0\\
x+y+z=3
$$
And the solutions are $(x,y,z,\lambda)=(1,1,1,3)$ and $(-1,2,2,2)$ (up to a permutation). Clearly, there is only one solution that satisfies the requirement that $x,y,z>0$. By checking the Hessian matrix, we can confirm that $(x^*,y^*,z^*)=(1,1,1)$ is the global minimum under the constraints on $x,y,z$. Therefore: $x^2+y^2+z^2+xyz-4\geq 1^2+1^2+1^2+1-4=0$ as desired. This completes the proof.