\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}\;n \le -1.02531909921070028 \cdot 10^{99}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell}{\frac{Om}{\ell}}\right) - n \cdot \left({\left(\frac{\ell}{Om}\right)}^{2} \cdot \left(U - U*\right)\right)\right)}\\
\mathbf{elif}\;n \le 5.0893933557065809 \cdot 10^{-270}:\\
\;\;\;\;\sqrt{U \cdot \left(\left(2 \cdot n\right) \cdot \left(\left(t - 2 \cdot \frac{\ell}{\frac{Om}{\ell}}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{\left(\frac{2}{2}\right)}\right) \cdot \left({\left(\frac{\ell}{Om}\right)}^{\left(\frac{2}{2}\right)} \cdot \left(U - U*\right)\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{U \cdot \left(\left(t - 2 \cdot \frac{\ell}{\frac{Om}{\ell}}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{\left(\frac{2}{2}\right)}\right) \cdot \left({\left(\frac{\ell}{Om}\right)}^{\left(\frac{2}{2}\right)} \cdot \left(U - U*\right)\right)\right)} \cdot \sqrt{2 \cdot n}\\
\end{array}double code(double n, double U, double t, double l, double Om, double U_42_) {
return sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * pow((l / Om), 2.0)) * (U - U_42_)))));
}
double code(double n, double U, double t, double l, double Om, double U_42_) {
double VAR;
if ((n <= -1.0253190992107003e+99)) {
VAR = sqrt((((2.0 * n) * U) * ((t - (2.0 * (l / (Om / l)))) - (n * (pow((l / Om), 2.0) * (U - U_42_))))));
} else {
double VAR_1;
if ((n <= 5.089393355706581e-270)) {
VAR_1 = sqrt((U * ((2.0 * n) * ((t - (2.0 * (l / (Om / l)))) - ((n * pow((l / Om), (2.0 / 2.0))) * (pow((l / Om), (2.0 / 2.0)) * (U - U_42_)))))));
} else {
VAR_1 = (sqrt((U * ((t - (2.0 * (l / (Om / l)))) - ((n * pow((l / Om), (2.0 / 2.0))) * (pow((l / Om), (2.0 / 2.0)) * (U - U_42_)))))) * sqrt((2.0 * n)));
}
VAR = VAR_1;
}
return VAR;
}



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 n < -1.0253190992107003e+99Initial program 36.0
rmApplied associate-/l*34.5
rmApplied associate-*l*33.7
if -1.0253190992107003e+99 < n < 5.089393355706581e-270Initial program 34.3
rmApplied associate-/l*31.2
rmApplied *-commutative31.2
Applied associate-*l*29.6
rmApplied sqr-pow29.6
Applied associate-*r*28.3
Applied associate-*l*28.7
if 5.089393355706581e-270 < n Initial program 34.7
rmApplied associate-/l*31.9
rmApplied *-commutative31.9
Applied associate-*l*32.0
rmApplied sqr-pow32.0
Applied associate-*r*30.6
Applied associate-*l*30.7
rmApplied *-commutative30.7
Applied associate-*r*30.7
Applied sqrt-prod23.8
Final simplification27.1
herbie shell --seed 2020071 +o rules:numerics
(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*))))))