\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 2.0842190509153543 \cdot 10^{-288}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(\left(t - 2 \cdot \left(\frac{\ell}{\sqrt[3]{Om} \cdot \sqrt[3]{Om}} \cdot \frac{\ell}{\sqrt[3]{Om}}\right)\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)\right)}\\
\mathbf{elif}\;n \le 5.5870184874489422 \cdot 10^{-70}:\\
\;\;\;\;\sqrt{2 \cdot n} \cdot \sqrt{U \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)}\\
\mathbf{elif}\;n \le 2.294579162631725 \cdot 10^{116}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot n} \cdot \sqrt{U \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)}\\
\end{array}double code(double n, double U, double t, double l, double Om, double U_42_) {
return ((double) sqrt(((double) (((double) (((double) (2.0 * n)) * U)) * ((double) (((double) (t - ((double) (2.0 * ((double) (((double) (l * l)) / Om)))))) - ((double) (((double) (n * ((double) pow(((double) (l / Om)), 2.0)))) * ((double) (U - U_42_))))))))));
}
double code(double n, double U, double t, double l, double Om, double U_42_) {
double VAR;
if ((n <= 2.0842190509153543e-288)) {
VAR = ((double) sqrt(((double) (((double) (2.0 * n)) * ((double) (U * ((double) (((double) (t - ((double) (2.0 * ((double) (((double) (l / ((double) (((double) cbrt(Om)) * ((double) cbrt(Om)))))) * ((double) (l / ((double) cbrt(Om)))))))))) - ((double) (((double) (n * ((double) pow(((double) (l / Om)), 2.0)))) * ((double) (U - U_42_))))))))))));
} else {
double VAR_1;
if ((n <= 5.587018487448942e-70)) {
VAR_1 = ((double) (((double) sqrt(((double) (2.0 * n)))) * ((double) sqrt(((double) (U * ((double) (((double) (t - ((double) (2.0 * ((double) (((double) (l * l)) / Om)))))) - ((double) (((double) (n * ((double) pow(((double) (l / Om)), 2.0)))) * ((double) (U - U_42_))))))))))));
} else {
double VAR_2;
if ((n <= 2.294579162631725e+116)) {
VAR_2 = ((double) sqrt(((double) (((double) (((double) (2.0 * n)) * U)) * ((double) (((double) (t - ((double) (2.0 * ((double) (l * ((double) (l / Om)))))))) - ((double) (((double) (n * ((double) pow(((double) (l / Om)), 2.0)))) * ((double) (U - U_42_))))))))));
} else {
VAR_2 = ((double) (((double) sqrt(((double) (2.0 * n)))) * ((double) sqrt(((double) (U * ((double) (((double) (t - ((double) (2.0 * ((double) (((double) (l * l)) / Om)))))) - ((double) (((double) (n * ((double) pow(((double) (l / Om)), 2.0)))) * ((double) (U - U_42_))))))))))));
}
VAR_1 = VAR_2;
}
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 < 2.0842190509153543e-288Initial program 34.4
rmApplied associate-*l*34.7
rmApplied add-cube-cbrt34.7
Applied times-frac32.3
if 2.0842190509153543e-288 < n < 5.587018487448942e-70 or 2.294579162631725e+116 < n Initial program 37.0
rmApplied associate-*l*36.8
rmApplied sqrt-prod28.3
if 5.587018487448942e-70 < n < 2.294579162631725e+116Initial program 30.0
rmApplied *-un-lft-identity30.0
Applied times-frac27.1
Simplified27.1
Final simplification30.2
herbie shell --seed 2020130
(FPCore (n U t l Om U*)
:name "Toniolo and Linder, Equation (13)"
:precision binary64
(sqrt (* (* (* 2.0 n) U) (- (- t (* 2.0 (/ (* l l) Om))) (* (* n (pow (/ l Om) 2.0)) (- U U*))))))