\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)}\begin{array}{l}
\mathbf{if}\;t \le 8.48078266481481385711732205638014053282 \cdot 10^{128}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(\left(t - 2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right) - \left(U - U*\right) \cdot \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{\left(2 \cdot \frac{2}{2}\right)}\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot U} \cdot \sqrt{\left(t - 2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right) - \left(U - U*\right) \cdot \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{\left(2 \cdot \frac{2}{2}\right)}\right)}\\
\end{array}double f(double n, double U, double t, double l, double Om, double U_) {
double r184823 = 2.0;
double r184824 = n;
double r184825 = r184823 * r184824;
double r184826 = U;
double r184827 = r184825 * r184826;
double r184828 = t;
double r184829 = l;
double r184830 = r184829 * r184829;
double r184831 = Om;
double r184832 = r184830 / r184831;
double r184833 = r184823 * r184832;
double r184834 = r184828 - r184833;
double r184835 = r184829 / r184831;
double r184836 = pow(r184835, r184823);
double r184837 = r184824 * r184836;
double r184838 = U_;
double r184839 = r184826 - r184838;
double r184840 = r184837 * r184839;
double r184841 = r184834 - r184840;
double r184842 = r184827 * r184841;
double r184843 = sqrt(r184842);
return r184843;
}
double f(double n, double U, double t, double l, double Om, double U_) {
double r184844 = t;
double r184845 = 8.480782664814814e+128;
bool r184846 = r184844 <= r184845;
double r184847 = 2.0;
double r184848 = n;
double r184849 = r184847 * r184848;
double r184850 = U;
double r184851 = l;
double r184852 = Om;
double r184853 = r184851 / r184852;
double r184854 = r184851 * r184853;
double r184855 = r184847 * r184854;
double r184856 = r184844 - r184855;
double r184857 = U_;
double r184858 = r184850 - r184857;
double r184859 = 2.0;
double r184860 = r184847 / r184859;
double r184861 = r184859 * r184860;
double r184862 = pow(r184853, r184861);
double r184863 = r184848 * r184862;
double r184864 = r184858 * r184863;
double r184865 = r184856 - r184864;
double r184866 = r184850 * r184865;
double r184867 = r184849 * r184866;
double r184868 = sqrt(r184867);
double r184869 = r184849 * r184850;
double r184870 = sqrt(r184869);
double r184871 = sqrt(r184865);
double r184872 = r184870 * r184871;
double r184873 = r184846 ? r184868 : r184872;
return r184873;
}



Bits error versus n



Bits error versus U



Bits error versus t



Bits error versus l



Bits error versus Om



Bits error versus U*
Results
if t < 8.480782664814814e+128Initial program 34.1
rmApplied *-un-lft-identity34.1
Applied times-frac31.2
Simplified31.2
rmApplied sqr-pow31.2
Applied associate-*r*30.4
rmApplied associate-*l*29.9
Simplified31.0
if 8.480782664814814e+128 < t Initial program 37.9
rmApplied *-un-lft-identity37.9
Applied times-frac35.2
Simplified35.2
rmApplied sqr-pow35.2
Applied associate-*r*34.6
rmApplied sqrt-prod22.9
Simplified23.4
Final simplification29.9
herbie shell --seed 2019325
(FPCore (n U t l Om U*)
:name "Toniolo and Linder, Equation (13)"
:precision binary64
(sqrt (* (* (* 2 n) U) (- (- t (* 2 (/ (* l l) Om))) (* (* n (pow (/ l Om) 2)) (- U U*))))))