$a,b,c >0$, prove $\sqrt[2]{\frac{a}{b+c}}+\sqrt[3]{\frac{b}{c+a}}+\sqrt[4]{\frac{c}{a+b}} \geqslant \frac{7}{12} \cdot2^{\frac67} \cdot 3^{\frac47}$ $a,b,c >0$, prove
$$\sqrt[2]{\frac{a}{b+c}}+\sqrt[3]{\frac{b}{c+a}}+\sqrt[4]{\frac{c}{a+b}} \geqslant \frac{7}{12} \cdot2^{\frac67} \cdot 3^{\frac47}$$
What I tried:
1) It seems like a Nesbitt inequality. But I tried to imitate some Nesbitt proofs but was not successful.
2) Update: Following Frank's suggestion: the inequality is homogeneous, and can assume $a+b+c=1$ to reduce variables.
3) Test on Excel a lot of pairs $(a,b,c)$ and convinced myself the inequality is true and can be achievable.
4) Try Bernoulli's inequality but failed miserably. 

Edit by Andreas, 2018-06-15: Sorry, but this is a wrong claim (counterexamples can be -and were - given), however it is a very interesting task. What should really be proved is $$\sqrt[2]{\frac{a}{b+c}}+\sqrt[3]{\frac{b}{c+a}}+\sqrt[4]{\frac{c}{a+b}} \geqslant 3 \cdot (\frac12)^{\frac23}$$ where the RHS is lower than the claimed $\frac{7}{12} \cdot2^{\frac67} \cdot 3^{\frac47}$, and the RHS is tight, i.e. values of $(a,b,c)$ can be given such that the RHS is indeed an infimum.
 A: This is not an answer. Just sharing a possible way to simplify the problem.
From the new answers/comments it is clear that the original bound is wrong, and so, this post should be taken as a failed attempt, though the method might be useful, and so I will leave this intact.
Let's introduce new variables:
$$\frac{c}{a+b}=u$$
$$\frac{b}{c+a}=v$$
Then, we can show that:
$$\frac{a}{b+c}=\frac{1-uv}{u+v+2uv}$$
Now the inequality becomes:
$$u^{1/4}+v^{1/3}+\sqrt{\frac{1-uv}{u+v+2uv}} \geq \frac{7}{12} \cdot2^{\frac67} \cdot 3^{\frac47}$$
For $a,b,c>0$ we always have $uv \leq 1$.

I had a lucky guess (which remains to be proven), that the minimum of the function:
$$f(u,v)=u^{1/4}+v^{1/3}+\sqrt{\frac{1-uv}{u+v+2uv}}$$
is the same as the miminum of the following two functions:
$$f(u,1/u), \qquad f(1/v,v)$$
Which is confirmed by Mathematica output:

Note that this is the same as $uv=1$, which makes the third term exactly zero.
Minimization leads to the following for the first case:
$$u=\left(\frac{4}{3}\right)^{12/7}, \qquad v= \left(\frac{3}{4}\right)^{12/7}$$
Which makes the function:
$$f_{\text{min}}=\left(\frac{4}{3}\right)^{3/7}+\left(\frac{3}{4}\right)^{4/7}=\left(\frac{3}{4}\right)^{4/7} \left(1+\frac{4}{3} \right)=\frac{7}{12} \cdot2^{\frac67} \cdot 3^{\frac47} $$
A: A solution will be given by first showing that two of the arguments of the roots are always less than 1, and that for any fixed sum $s = a+b$ (or of any other two variables), the minimum of the LHS is obtained if one variable is taken to be zero.  After that, the LHS can be minimized.
It shows (following the comment by fedja) that $\underline{\rm{the \; OP's \;claim \;is \;actually \;false.}}$ A correct lower bound will be given which is $3 \cdot (1/2)^{2/3} \simeq 1.8899$.
Let us give names to the three arguments of the roots:
$$f = \frac{a}{b+c}\\
g = \frac{b}{c+a}
\\
h = \frac{c}{a+b}
$$
Observe that the sum expression is homogenous in $(a,b,c)$. So we can demand $a+b+c=6$.
(The number 6 was taken to avoid fractions later on.)
This gives for the three arguments:
$$f(a) = -1 +\frac{6}{6-a}\\
g(b) = -1 +\frac{6}{6-b}\\
h(c) = -1 +\frac{6}{6-c}\\
$$
Any argument function rises with its variable, i.e. $f(a)$ rises with $a$ etc.
All three argument functions are equal ($= 1/2$) for $a=b=c=2$.  The argument functions obtain the value $f=1$ for $a=3$, etc. This means that we will always have 2 or 3 argument functions which are less than 1. For if we had at least two argument functions which are greater than 1, we would have $a+b >6$ which is a contradiction.
From the discussion above, for any given $(a,b,c)$, let us choose the two argument functions (for the sake of the discussion, say, $f$ and $g$)) which have the smallest values (which are less than 1). Then we have $a+b = s \le 4$. For if $s >4$, these were not the two argument functions which have the smallest values, as $c <2$.
Now for any fixed $s\le 4$, we have that $\sqrt{f(a)}+\sqrt[3]{g(s-a)}$ takes the smallest value (infimum)  at the boundary, i.e. either at $a=0$ or $a = s$, i.e. $b=0$  (likewise for a pair of other roots). It takes a lengthy discussion on values and derivatives to show this. Notably, the statement is false for some $s>4$. 
The following picture illustrates the situation for $s = 3$ (lower curve) and $s = 4$ (upper curve): 

This means that, for a lower limit,  one variable out of $(a,b,c)$ will be zero, and the corresponding root will be zero. All the dicussions above did not specify yet which one. So we are left with the three cases of choosing that variable.
When taking $a=0$, one obtains:
$$
\sqrt[2]{\frac{a}{b+c}}+\sqrt[3]{\frac{b}{c+a}}+\sqrt[4]{\frac{c}{a+b}} \\
\geqslant \sqrt[3]{\frac{b}{c}}+\sqrt[4]{\frac{c}{b}} = x^{1/3} + x^{-1/4}
$$
where we introduced $x = \frac{b}{c}$. It is now easy to find the minimum w.r.t. $x$, resulting in $x = (3/4)^{12/7}$. So 
$$
\sqrt[2]{\frac{a}{b+c}}+\sqrt[3]{\frac{b}{c+a}}+\sqrt[4]{\frac{c}{a+b}} \\
\geqslant \left(\frac{4}{3}\right)^{3/7}+\left(\frac{3}{4}\right)^{4/7}=\left(\frac{3}{4}\right)^{4/7} \left(1+\frac{4}{3} \right)=\frac{7}{12} \cdot2^{\frac67} \cdot 3^{\frac47} \simeq 1.9796
$$
which is the lower bound conjectured by the OP. However, this is not the best option. As indicated by fedja, taking $b=0$ will give a lower bound (which, again, cannot be improved by taking $c=0$). fedja may post his own solution on that, I do not want to steal it. The lower bound (infimum) is then, with the same method as described above,  $3 \cdot (1/2)^{2/3} \simeq 1.8899$. This is obtained when $a = c \cdot (1/2)^{4/3}$.
As a "fun fact", compare this to the Nesbitt limit which is obtained for $a=b=c$. The LHS value is then $\sqrt[2]{\frac12}+\sqrt[3]{\frac12}+\sqrt[4]{\frac12} \simeq 2.3417$ so this is far from the true minimum.
This completes the proof. $\quad \quad \Box$
A: It's wrong. Try $a=0.63^2$, $c=1$ and $b\rightarrow0^+$.
