\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 -4.09529487165365292 \cdot 10^{-293}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(\left(t - 2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right) - \left(\left(n \cdot {\left(\sqrt[3]{\frac{\ell}{Om}} \cdot \sqrt[3]{\frac{\ell}{Om}}\right)}^{2}\right) \cdot {\left(\sqrt[3]{\frac{\ell}{Om}}\right)}^{2}\right) \cdot \left(U - U*\right)\right)\right)}\\
\mathbf{elif}\;t \le 1.86927575833601258 \cdot 10^{-103}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot U} \cdot \sqrt{\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)}\\
\mathbf{elif}\;t \le 2.6569012253985319 \cdot 10^{-14}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \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)\right)}\\
\mathbf{elif}\;t \le 9.23476399192477856 \cdot 10^{36}:\\
\;\;\;\;\sqrt{2 \cdot n} \cdot \sqrt{U \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{\left(2 \cdot n\right) \cdot U} \cdot \sqrt{\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)}\\
\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 ((t <= -4.095294871653653e-293)) {
VAR = ((double) sqrt(((double) (((double) (2.0 * n)) * ((double) (U * ((double) (((double) (t - ((double) (2.0 * ((double) (l * ((double) (l / Om)))))))) - ((double) (((double) (((double) (n * ((double) pow(((double) (((double) cbrt(((double) (l / Om)))) * ((double) cbrt(((double) (l / Om)))))), 2.0)))) * ((double) pow(((double) cbrt(((double) (l / Om)))), 2.0)))) * ((double) (U - U_42_))))))))))));
} else {
double VAR_1;
if ((t <= 1.8692757583360126e-103)) {
VAR_1 = ((double) (((double) sqrt(((double) (((double) (2.0 * n)) * U)))) * ((double) sqrt(((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 {
double VAR_2;
if ((t <= 2.656901225398532e-14)) {
VAR_2 = ((double) sqrt(((double) (((double) (2.0 * n)) * ((double) (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 {
double VAR_3;
if ((t <= 9.234763991924779e+36)) {
VAR_3 = ((double) (((double) sqrt(((double) (2.0 * n)))) * ((double) sqrt(((double) (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_3 = ((double) (((double) sqrt(((double) (((double) (2.0 * n)) * U)))) * ((double) sqrt(((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_))))))))));
}
VAR_2 = VAR_3;
}
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 t < -4.09529487165365292e-293Initial program 34.0
rmApplied *-un-lft-identity34.0
Applied times-frac31.1
Simplified31.1
rmApplied associate-*l*31.3
rmApplied add-cube-cbrt31.3
Applied unpow-prod-down31.3
Applied associate-*r*30.4
if -4.09529487165365292e-293 < t < 1.86927575833601258e-103 or 9.23476399192477856e36 < t Initial program 35.1
rmApplied *-un-lft-identity35.1
Applied times-frac32.2
Simplified32.2
rmApplied sqrt-prod28.9
if 1.86927575833601258e-103 < t < 2.6569012253985319e-14Initial program 29.0
rmApplied *-un-lft-identity29.0
Applied times-frac26.7
Simplified26.7
rmApplied associate-*l*27.9
if 2.6569012253985319e-14 < t < 9.23476399192477856e36Initial program 25.1
rmApplied *-un-lft-identity25.1
Applied times-frac21.9
Simplified21.9
rmApplied associate-*l*21.9
rmApplied sqrt-prod37.7
Final simplification29.9
herbie shell --seed 2020150
(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*))))))