Let $\mathrm{Exp}_t^{[y]} (x)$ denote the $y$ th iteration of the exponential function with base $t$ : $t^x.$
For example $\mathrm{Exp}_t^{[1]} (x) = t^x$.
Let $\sim\sim$ denote best fit.
Now as $x$ Goes to positive infinity and a pair $(a,b)$ with $e<a<b$ Is given , I wonder how to find the best fit base value $C$ such that
$$\sqrt { \mathrm{Exp}_a^{[1/2]} (x) \cdot \mathrm{Exp}_b^{[1/2]} (x) } \sim\sim \mathrm{Exp}_C^{[1/2]} (x). $$
Lets define then $C = f(a,b)$, assuming $a< f(a,b) < \sqrt{ab} < b $.
How to improve those bounds ?
How to find the value $C$ ?
Below: Edit
There are many solutions to tetration , but I am talking here about solutions where $x>1$ , $b > a>e$ implies $\mathrm{Exp}_b^{[1/2]}(x) > \mathrm{Exp}_a^{[1/2]} (x)$.
Notice that in that case $\mathrm{Exp}_t^{[1/2]} (x) $ is asymptotic to $2 \sinh_t^{[1/2]} (x) $ and
$$ 2\sinh_t (x) = t^x - t^{-x} $$
And $^{[1/2]}$ means half-iterate as usual.
Notice $ 2\sinh_t $ does have a hyperbolic fixpoint at $ x= 0$. So by using koenigs function we get a solution from that fixpoint.
Also notice this implies the entire post can be reformulated by rewriting Every $\mathrm{Exp}_t $ with $2\sinh_t$.
So we get the possibly easier :
Let $2\sinh_t^{[y]} (x) $ denote the $y$ th iteration of the 2 times sinh function with base $t$ : $t^x - t^{-x}.$
For example $2sinh_t^{[1]} (x) = t^x - t^{-x} $
Now as $x$ Goes to positive infinity and a pair $(a,b)$ with $e<a<b$ Is given , I wonder how to find the best fit base value $C$ such that
$$\sqrt { 2\sinh_a^{[1/2]} (x) \cdot 2\sinh_b^{[1/2]} (x) } \sim\sim 2\sinh_C^{[1/2]} (x)~. $$
This edit might be helpful to solve the problem and to clarify the (goal of the) question, avoid confusion, and address Sheldon's comments.
See Koenigs function, tetration, and the strongly related
End of Edit

Consider the function $$g(x) = \text{slog}_e(\text{sexp}_2(z+0.5))-\text{slog}_e(\text{sexp}_2(z))-0.5$$
if $g(z)=0\;$ then $\;\exp_e^{0.5}(\text{sexp}_2(z))=\exp_2^{0.5}(\text{sexp}_2(z))\;\;$ since $\;\exp_e^{0.5}(\text{sexp}_2(z))=\text{sexp}_2(z+0.5)\;$ so we are comparing the slog_e of z and the half iterate (base2) of z.
g(z) applies for base_2 and base_e, but any bases can work. The op says, "USUALLY $\exp_e^{0.5}>\exp_w^{0.5}$, which would imply $g(z)<0$, but as z gets arbitrarily large, g(z) spends half of its time positive and half of its time negative. If z is large enough, when can easily show that $g(z+1) \approx g(z)$ and $g(z+0.5) \approx -g(z)$, where the approximation gets arbitrarily good as z increases.
First we show, z is large enough, $\text{slog}_e(\text{sexp}_2(z+1)) \approx \text{slog}_e(\text{sexp}_2(z))+1$ Step1: $$\text{slog}_e(\text{sexp}_2(z)) = \text{slog}_e(2^{\text{sexp}_2(z-1))})$$ $$\text{slog}_e(\text{sexp}_2(z)) = \text{slog}_e(\ln(2^{\text{sexp}_2(z-1))}))+1$$ $$\text{slog}_e(\text{sexp}_2(z)) = \text{slog}_e(\ln(2) \cdot \text{sexp}_2(z-1))+1$$ similarly we can write an equation for slog_e(sexp_2(z+1)) in terms of sexp_2(z-1) $$\text{slog}_e(\text{sexp}_2(z+1)) = \text{slog}_e(\ln(2) \cdot \text{sexp}_2(z))+1$$ $$\text{slog}_e(\text{sexp}_2(z+1)) = \text{slog}_e(\ln(2) \cdot 2^{\text{sexp}_2(z-1)})+1$$ $$\text{slog}_e(\text{sexp}_2(z+1)) = \text{slog}_e(\ln(2) \cdot \text{sexp}_2(z-1)+\ln(\ln(2)))+2$$ If z is large enought, then sexp_2(z-1) is large enough to make the ln(ln(2)) term completely insignificant. $$\text{slog}_e(\text{sexp}_2(z+1)) = \text{slog}_e(\ln(2) \cdot \text{sexp}_2(z-1))+2+O\frac{1}{\text{sexp}_2(z-1)} = \text{slog}_e(\text{sexp}_2(z))+1+O\frac{1}{\text{sexp}_2(z-1)} $$ With a little bit of algebra $g(z+1) = g(z)+O\frac{1}{\text{sexp}_2(z-1)}$ where g(z+1) approaches g(z) as z increases. With a little bit algebra, we can also show that $g(z+0.5)=-g(z) + O\frac{1}{\text{sexp}_2(z-1)}\;$ therefore if $g(z)=0\;\;g(z+0.5)\;$ also approaches zero as z increases. Therefore, unless g(z) goes to zero for all z as z gets arbitrarily large, g(z) will spend half of its time positive and half of its time negative.
Here are two graphs of g(z), from -1 to 8, and another showing the asymptotic behavior. The first zero crossing occurs at x1~=4.61986470857217, sexp_2(x1)~=4.78924742892085E72 followed by x2~=4.91660. subsequent zero crossings occur at x~=5.41812556847432+0.5n, for integers n.