This question is closely related to
Let $r$ be a real number satisfying $0<r<e^{-e}$. In order to prove that the iteration $x_1=r$ , $x_{n+1}=r^{x_n}$ does not converge (hence the infinite power tower does not converge), I had the following idea which could solve the problem, but I was not successful.
The equation $r^{r^x}=x$ seems to have $3$ solutions and the middle solution (sorted in magnitude) seems to be the solution of $r^x=x$. First of all, is this correct ?
The equation $r^{r^x}=x$ is equivalent to $r^x\ln(r)=\ln(x)$. I have no idea how to show that it has $3$ solutions. And what I have to show next (if this is the case) that the above iteration eventually switches between values close to the smallest and values close to the largest solution.
This would show that the middle solution is not reached.


Considering $$f(x)=r^x\log(r)-\log(x)$$ $$f'(x)=r^x \log ^2(r)-\frac{1}{x}$$ $$f''(x)=r^x \log ^3(r)+\frac{1}{x^2}$$ the first derivative cancels for two values of $x$, namely $$x_a=\frac{W_0\left(\frac{1}{\log (r)}\right)}{\log (r)}\qquad \text{and}\qquad x_b=\frac{W_{-1}\left(\frac{1}{\log (r)}\right)}{\log (r)}$$ where appear Lambert functions.
By the second derivative test, $x_a$ corresponds to a minimimum (with $f(x_a) <0$) and $x_b$ corresponds to a maximum (with $f(x_b) >0$).
So, for $f(x)=0$, there are three roots $a,b,c$ such that $$0 < a < x_a \qquad x_a < b < x_b \qquad x_b< c < 1$$ If fact, we could even show that the second root is such that $x_a < x <\frac 12(x_a+x_b)$.
So, depending on the starting point, Newton method would converge to one of these roots.
Concerning the middle root, it effectively corresponds to the solution of $r^x=x$ that is to say $x=-\frac{W_0(-\log (r))}{\log (r)}$.
For example, using $\color{red}{r=\frac 1 2 e^{-e}}$ and using $x_0=\frac 12 x_a$, we should get the following iterates $$\left( \begin{array}{cc} n & x_n \\ 0 & 0.06861303857 \\ 1 & 0.06484498458 \\ 2 & 0.06506516116 \\ 3 & 0.06506598462 \\ 4 & 0.06506598464 \end{array} \right)$$ Using $x_0=\frac 12 (x_a+x_b)$, we should get the following iterates $$\left( \begin{array}{cc} n & x_n \\ 0 & 0.3372962715 \\ 1 & 0.3270913322 \\ 2 & 0.3273489201 \\ 3 & 0.3273490811 \end{array} \right)$$ Using $x_0=\frac 12 (1+x_b)$, we should get the following iterates $$\left( \begin{array}{cc} n & x_n \\ 0 & 0.7686832329 \\ 1 & 0.8022363077 \\ 2 & 0.8009427413 \\ 3 & 0.8009410041 \end{array} \right)$$
Edit
We could have done almost the same solving for $r$ to get $$r_1=\left(\frac{x \log (x)}{W_0(x \log (x))}\right)^{\frac{1}{x}}\qquad \text{and}\qquad r_2=\left(\frac{x \log (x)}{W_{-1}(x \log (x))}\right)^{\frac{1}{x}}$$ For $r \leq e^{-e}$ there is only one $x$ given by $r_1$, while there are two $x$'s for $r_2$.