
(FPCore (n U t l Om U*) :precision binary64 (sqrt (* (* (* 2.0 n) U) (- (- t (* 2.0 (/ (* l l) Om))) (* (* n (pow (/ l Om) 2.0)) (- U U*))))))
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_)))));
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
code = sqrt((((2.0d0 * n) * u) * ((t - (2.0d0 * ((l * l) / om))) - ((n * ((l / om) ** 2.0d0)) * (u - u_42)))))
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * Math.pow((l / Om), 2.0)) * (U - U_42_)))));
}
def code(n, U, t, l, Om, U_42_): return math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * math.pow((l / Om), 2.0)) * (U - U_42_)))))
function code(n, U, t, l, Om, U_42_) return sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) - Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U - U_42_))))) end
function tmp = code(n, U, t, l, Om, U_42_) tmp = sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * ((l / Om) ^ 2.0)) * (U - U_42_))))); end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\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)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 15 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (n U t l Om U*) :precision binary64 (sqrt (* (* (* 2.0 n) U) (- (- t (* 2.0 (/ (* l l) Om))) (* (* n (pow (/ l Om) 2.0)) (- U U*))))))
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_)))));
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
code = sqrt((((2.0d0 * n) * u) * ((t - (2.0d0 * ((l * l) / om))) - ((n * ((l / om) ** 2.0d0)) * (u - u_42)))))
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * Math.pow((l / Om), 2.0)) * (U - U_42_)))));
}
def code(n, U, t, l, Om, U_42_): return math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * math.pow((l / Om), 2.0)) * (U - U_42_)))))
function code(n, U, t, l, Om, U_42_) return sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) - Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U - U_42_))))) end
function tmp = code(n, U, t, l, Om, U_42_) tmp = sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * ((l / Om) ^ 2.0)) * (U - U_42_))))); end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\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)}
\end{array}
(FPCore (n U t l Om U*)
:precision binary64
(if (<= n -5.6e-132)
(sqrt
(*
(* n 2.0)
(* (+ t (/ (* l (+ (* l -2.0) (/ (* n (* l U*)) Om))) Om)) U)))
(if (<= n -4e-311)
(pow
(*
2.0
(+
(* n (* t U))
(/ (+ (* l -2.0) (/ (* (* n l) (- U* U)) Om)) (/ Om (* n (* l U))))))
0.5)
(*
(sqrt (* n 2.0))
(sqrt
(* U (fma (fma l -2.0 (* (- U* U) (* n (/ l Om)))) (/ l Om) t)))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (n <= -5.6e-132) {
tmp = sqrt(((n * 2.0) * ((t + ((l * ((l * -2.0) + ((n * (l * U_42_)) / Om))) / Om)) * U)));
} else if (n <= -4e-311) {
tmp = pow((2.0 * ((n * (t * U)) + (((l * -2.0) + (((n * l) * (U_42_ - U)) / Om)) / (Om / (n * (l * U)))))), 0.5);
} else {
tmp = sqrt((n * 2.0)) * sqrt((U * fma(fma(l, -2.0, ((U_42_ - U) * (n * (l / Om)))), (l / Om), t)));
}
return tmp;
}
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (n <= -5.6e-132) tmp = sqrt(Float64(Float64(n * 2.0) * Float64(Float64(t + Float64(Float64(l * Float64(Float64(l * -2.0) + Float64(Float64(n * Float64(l * U_42_)) / Om))) / Om)) * U))); elseif (n <= -4e-311) tmp = Float64(2.0 * Float64(Float64(n * Float64(t * U)) + Float64(Float64(Float64(l * -2.0) + Float64(Float64(Float64(n * l) * Float64(U_42_ - U)) / Om)) / Float64(Om / Float64(n * Float64(l * U)))))) ^ 0.5; else tmp = Float64(sqrt(Float64(n * 2.0)) * sqrt(Float64(U * fma(fma(l, -2.0, Float64(Float64(U_42_ - U) * Float64(n * Float64(l / Om)))), Float64(l / Om), t)))); end return tmp end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[n, -5.6e-132], N[Sqrt[N[(N[(n * 2.0), $MachinePrecision] * N[(N[(t + N[(N[(l * N[(N[(l * -2.0), $MachinePrecision] + N[(N[(n * N[(l * U$42$), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[n, -4e-311], N[Power[N[(2.0 * N[(N[(n * N[(t * U), $MachinePrecision]), $MachinePrecision] + N[(N[(N[(l * -2.0), $MachinePrecision] + N[(N[(N[(n * l), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] / N[(Om / N[(n * N[(l * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[(N[Sqrt[N[(n * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(U * N[(N[(l * -2.0 + N[(N[(U$42$ - U), $MachinePrecision] * N[(n * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(l / Om), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;n \leq -5.6 \cdot 10^{-132}:\\
\;\;\;\;\sqrt{\left(n \cdot 2\right) \cdot \left(\left(t + \frac{\ell \cdot \left(\ell \cdot -2 + \frac{n \cdot \left(\ell \cdot U*\right)}{Om}\right)}{Om}\right) \cdot U\right)}\\
\mathbf{elif}\;n \leq -4 \cdot 10^{-311}:\\
\;\;\;\;{\left(2 \cdot \left(n \cdot \left(t \cdot U\right) + \frac{\ell \cdot -2 + \frac{\left(n \cdot \ell\right) \cdot \left(U* - U\right)}{Om}}{\frac{Om}{n \cdot \left(\ell \cdot U\right)}}\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{n \cdot 2} \cdot \sqrt{U \cdot \mathsf{fma}\left(\mathsf{fma}\left(\ell, -2, \left(U* - U\right) \cdot \left(n \cdot \frac{\ell}{Om}\right)\right), \frac{\ell}{Om}, t\right)}\\
\end{array}
\end{array}
if n < -5.60000000000000005e-132Initial program 55.4%
Simplified61.9%
Taylor expanded in U around 0 64.3%
if -5.60000000000000005e-132 < n < -3.99999999999979e-311Initial program 53.0%
Simplified59.9%
Taylor expanded in t around inf 59.5%
pow1/259.6%
distribute-lft-out59.6%
*-commutative59.6%
associate-/l*60.3%
associate-*r*65.7%
*-commutative65.7%
*-commutative65.7%
Applied egg-rr65.7%
if -3.99999999999979e-311 < n Initial program 47.8%
Simplified60.6%
sqrt-prod70.0%
Applied egg-rr70.0%
+-commutative70.0%
*-commutative70.0%
fma-udef70.0%
*-commutative70.0%
associate-*l/66.0%
associate-*r*69.1%
*-commutative69.1%
associate-*r*65.2%
+-commutative65.2%
fma-def65.2%
Simplified78.3%
Final simplification71.6%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1
(*
(* (* n 2.0) U)
(+
(- t (* 2.0 (/ (* l l) Om)))
(* (- U* U) (* n (pow (/ l Om) 2.0)))))))
(if (<= t_1 2e-319)
(sqrt
(*
(* n 2.0)
(* U (+ t (/ (* l (- (* l -2.0) (* (* U* (* n l)) (/ -1.0 Om)))) Om)))))
(if (<= t_1 5e+300)
(sqrt t_1)
(*
(* l (sqrt 2.0))
(sqrt (/ (* n (* U (- (/ (* n (- U* U)) Om) 2.0))) Om)))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = ((n * 2.0) * U) * ((t - (2.0 * ((l * l) / Om))) + ((U_42_ - U) * (n * pow((l / Om), 2.0))));
double tmp;
if (t_1 <= 2e-319) {
tmp = sqrt(((n * 2.0) * (U * (t + ((l * ((l * -2.0) - ((U_42_ * (n * l)) * (-1.0 / Om)))) / Om)))));
} else if (t_1 <= 5e+300) {
tmp = sqrt(t_1);
} else {
tmp = (l * sqrt(2.0)) * sqrt(((n * (U * (((n * (U_42_ - U)) / Om) - 2.0))) / Om));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: t_1
real(8) :: tmp
t_1 = ((n * 2.0d0) * u) * ((t - (2.0d0 * ((l * l) / om))) + ((u_42 - u) * (n * ((l / om) ** 2.0d0))))
if (t_1 <= 2d-319) then
tmp = sqrt(((n * 2.0d0) * (u * (t + ((l * ((l * (-2.0d0)) - ((u_42 * (n * l)) * ((-1.0d0) / om)))) / om)))))
else if (t_1 <= 5d+300) then
tmp = sqrt(t_1)
else
tmp = (l * sqrt(2.0d0)) * sqrt(((n * (u * (((n * (u_42 - u)) / om) - 2.0d0))) / om))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = ((n * 2.0) * U) * ((t - (2.0 * ((l * l) / Om))) + ((U_42_ - U) * (n * Math.pow((l / Om), 2.0))));
double tmp;
if (t_1 <= 2e-319) {
tmp = Math.sqrt(((n * 2.0) * (U * (t + ((l * ((l * -2.0) - ((U_42_ * (n * l)) * (-1.0 / Om)))) / Om)))));
} else if (t_1 <= 5e+300) {
tmp = Math.sqrt(t_1);
} else {
tmp = (l * Math.sqrt(2.0)) * Math.sqrt(((n * (U * (((n * (U_42_ - U)) / Om) - 2.0))) / Om));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = ((n * 2.0) * U) * ((t - (2.0 * ((l * l) / Om))) + ((U_42_ - U) * (n * math.pow((l / Om), 2.0)))) tmp = 0 if t_1 <= 2e-319: tmp = math.sqrt(((n * 2.0) * (U * (t + ((l * ((l * -2.0) - ((U_42_ * (n * l)) * (-1.0 / Om)))) / Om))))) elif t_1 <= 5e+300: tmp = math.sqrt(t_1) else: tmp = (l * math.sqrt(2.0)) * math.sqrt(((n * (U * (((n * (U_42_ - U)) / Om) - 2.0))) / Om)) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(Float64(Float64(n * 2.0) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) + Float64(Float64(U_42_ - U) * Float64(n * (Float64(l / Om) ^ 2.0))))) tmp = 0.0 if (t_1 <= 2e-319) tmp = sqrt(Float64(Float64(n * 2.0) * Float64(U * Float64(t + Float64(Float64(l * Float64(Float64(l * -2.0) - Float64(Float64(U_42_ * Float64(n * l)) * Float64(-1.0 / Om)))) / Om))))); elseif (t_1 <= 5e+300) tmp = sqrt(t_1); else tmp = Float64(Float64(l * sqrt(2.0)) * sqrt(Float64(Float64(n * Float64(U * Float64(Float64(Float64(n * Float64(U_42_ - U)) / Om) - 2.0))) / Om))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = ((n * 2.0) * U) * ((t - (2.0 * ((l * l) / Om))) + ((U_42_ - U) * (n * ((l / Om) ^ 2.0)))); tmp = 0.0; if (t_1 <= 2e-319) tmp = sqrt(((n * 2.0) * (U * (t + ((l * ((l * -2.0) - ((U_42_ * (n * l)) * (-1.0 / Om)))) / Om))))); elseif (t_1 <= 5e+300) tmp = sqrt(t_1); else tmp = (l * sqrt(2.0)) * sqrt(((n * (U * (((n * (U_42_ - U)) / Om) - 2.0))) / Om)); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(N[(n * 2.0), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(U$42$ - U), $MachinePrecision] * N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, 2e-319], N[Sqrt[N[(N[(n * 2.0), $MachinePrecision] * N[(U * N[(t + N[(N[(l * N[(N[(l * -2.0), $MachinePrecision] - N[(N[(U$42$ * N[(n * l), $MachinePrecision]), $MachinePrecision] * N[(-1.0 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$1, 5e+300], N[Sqrt[t$95$1], $MachinePrecision], N[(N[(l * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(n * N[(U * N[(N[(N[(n * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision] - 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \left(\left(n \cdot 2\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) + \left(U* - U\right) \cdot \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right)\right)\\
\mathbf{if}\;t_1 \leq 2 \cdot 10^{-319}:\\
\;\;\;\;\sqrt{\left(n \cdot 2\right) \cdot \left(U \cdot \left(t + \frac{\ell \cdot \left(\ell \cdot -2 - \left(U* \cdot \left(n \cdot \ell\right)\right) \cdot \frac{-1}{Om}\right)}{Om}\right)\right)}\\
\mathbf{elif}\;t_1 \leq 5 \cdot 10^{+300}:\\
\;\;\;\;\sqrt{t_1}\\
\mathbf{else}:\\
\;\;\;\;\left(\ell \cdot \sqrt{2}\right) \cdot \sqrt{\frac{n \cdot \left(U \cdot \left(\frac{n \cdot \left(U* - U\right)}{Om} - 2\right)\right)}{Om}}\\
\end{array}
\end{array}
if (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*)))) < 1.99998e-319Initial program 14.0%
Simplified39.6%
Taylor expanded in U around 0 39.5%
div-inv39.5%
associate-*r*41.5%
Applied egg-rr41.5%
if 1.99998e-319 < (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*)))) < 5.00000000000000026e300Initial program 97.9%
if 5.00000000000000026e300 < (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*)))) Initial program 19.4%
Simplified44.5%
Taylor expanded in t around inf 46.6%
Taylor expanded in l around inf 27.1%
Final simplification58.5%
(FPCore (n U t l Om U*)
:precision binary64
(if (<= l 1.25e-57)
(sqrt
(*
(* n 2.0)
(* (+ t (/ (* l (+ (* l -2.0) (/ (* n (* l U*)) Om))) Om)) U)))
(if (<= l 4.6e+145)
(sqrt
(* (* n 2.0) (* U (+ t (/ (* (* l l) (+ -2.0 (/ n (/ Om U*)))) Om)))))
(if (<= l 2.5e+198)
(sqrt
(+
(* 2.0 (* n (* t U)))
(*
2.0
(/ (* (+ (* l -2.0) (/ n (/ Om (* l U*)))) (* n (* l U))) Om))))
(*
(sqrt 2.0)
(* l (sqrt (/ (* n (* U (- (/ (* n (- U* U)) Om) 2.0))) Om))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 1.25e-57) {
tmp = sqrt(((n * 2.0) * ((t + ((l * ((l * -2.0) + ((n * (l * U_42_)) / Om))) / Om)) * U)));
} else if (l <= 4.6e+145) {
tmp = sqrt(((n * 2.0) * (U * (t + (((l * l) * (-2.0 + (n / (Om / U_42_)))) / Om)))));
} else if (l <= 2.5e+198) {
tmp = sqrt(((2.0 * (n * (t * U))) + (2.0 * ((((l * -2.0) + (n / (Om / (l * U_42_)))) * (n * (l * U))) / Om))));
} else {
tmp = sqrt(2.0) * (l * sqrt(((n * (U * (((n * (U_42_ - U)) / Om) - 2.0))) / Om)));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l <= 1.25d-57) then
tmp = sqrt(((n * 2.0d0) * ((t + ((l * ((l * (-2.0d0)) + ((n * (l * u_42)) / om))) / om)) * u)))
else if (l <= 4.6d+145) then
tmp = sqrt(((n * 2.0d0) * (u * (t + (((l * l) * ((-2.0d0) + (n / (om / u_42)))) / om)))))
else if (l <= 2.5d+198) then
tmp = sqrt(((2.0d0 * (n * (t * u))) + (2.0d0 * ((((l * (-2.0d0)) + (n / (om / (l * u_42)))) * (n * (l * u))) / om))))
else
tmp = sqrt(2.0d0) * (l * sqrt(((n * (u * (((n * (u_42 - u)) / om) - 2.0d0))) / om)))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 1.25e-57) {
tmp = Math.sqrt(((n * 2.0) * ((t + ((l * ((l * -2.0) + ((n * (l * U_42_)) / Om))) / Om)) * U)));
} else if (l <= 4.6e+145) {
tmp = Math.sqrt(((n * 2.0) * (U * (t + (((l * l) * (-2.0 + (n / (Om / U_42_)))) / Om)))));
} else if (l <= 2.5e+198) {
tmp = Math.sqrt(((2.0 * (n * (t * U))) + (2.0 * ((((l * -2.0) + (n / (Om / (l * U_42_)))) * (n * (l * U))) / Om))));
} else {
tmp = Math.sqrt(2.0) * (l * Math.sqrt(((n * (U * (((n * (U_42_ - U)) / Om) - 2.0))) / Om)));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 1.25e-57: tmp = math.sqrt(((n * 2.0) * ((t + ((l * ((l * -2.0) + ((n * (l * U_42_)) / Om))) / Om)) * U))) elif l <= 4.6e+145: tmp = math.sqrt(((n * 2.0) * (U * (t + (((l * l) * (-2.0 + (n / (Om / U_42_)))) / Om))))) elif l <= 2.5e+198: tmp = math.sqrt(((2.0 * (n * (t * U))) + (2.0 * ((((l * -2.0) + (n / (Om / (l * U_42_)))) * (n * (l * U))) / Om)))) else: tmp = math.sqrt(2.0) * (l * math.sqrt(((n * (U * (((n * (U_42_ - U)) / Om) - 2.0))) / Om))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 1.25e-57) tmp = sqrt(Float64(Float64(n * 2.0) * Float64(Float64(t + Float64(Float64(l * Float64(Float64(l * -2.0) + Float64(Float64(n * Float64(l * U_42_)) / Om))) / Om)) * U))); elseif (l <= 4.6e+145) tmp = sqrt(Float64(Float64(n * 2.0) * Float64(U * Float64(t + Float64(Float64(Float64(l * l) * Float64(-2.0 + Float64(n / Float64(Om / U_42_)))) / Om))))); elseif (l <= 2.5e+198) tmp = sqrt(Float64(Float64(2.0 * Float64(n * Float64(t * U))) + Float64(2.0 * Float64(Float64(Float64(Float64(l * -2.0) + Float64(n / Float64(Om / Float64(l * U_42_)))) * Float64(n * Float64(l * U))) / Om)))); else tmp = Float64(sqrt(2.0) * Float64(l * sqrt(Float64(Float64(n * Float64(U * Float64(Float64(Float64(n * Float64(U_42_ - U)) / Om) - 2.0))) / Om)))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 1.25e-57) tmp = sqrt(((n * 2.0) * ((t + ((l * ((l * -2.0) + ((n * (l * U_42_)) / Om))) / Om)) * U))); elseif (l <= 4.6e+145) tmp = sqrt(((n * 2.0) * (U * (t + (((l * l) * (-2.0 + (n / (Om / U_42_)))) / Om))))); elseif (l <= 2.5e+198) tmp = sqrt(((2.0 * (n * (t * U))) + (2.0 * ((((l * -2.0) + (n / (Om / (l * U_42_)))) * (n * (l * U))) / Om)))); else tmp = sqrt(2.0) * (l * sqrt(((n * (U * (((n * (U_42_ - U)) / Om) - 2.0))) / Om))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 1.25e-57], N[Sqrt[N[(N[(n * 2.0), $MachinePrecision] * N[(N[(t + N[(N[(l * N[(N[(l * -2.0), $MachinePrecision] + N[(N[(n * N[(l * U$42$), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 4.6e+145], N[Sqrt[N[(N[(n * 2.0), $MachinePrecision] * N[(U * N[(t + N[(N[(N[(l * l), $MachinePrecision] * N[(-2.0 + N[(n / N[(Om / U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 2.5e+198], N[Sqrt[N[(N[(2.0 * N[(n * N[(t * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(2.0 * N[(N[(N[(N[(l * -2.0), $MachinePrecision] + N[(n / N[(Om / N[(l * U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(n * N[(l * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * N[(l * N[Sqrt[N[(N[(n * N[(U * N[(N[(N[(n * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision] - 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 1.25 \cdot 10^{-57}:\\
\;\;\;\;\sqrt{\left(n \cdot 2\right) \cdot \left(\left(t + \frac{\ell \cdot \left(\ell \cdot -2 + \frac{n \cdot \left(\ell \cdot U*\right)}{Om}\right)}{Om}\right) \cdot U\right)}\\
\mathbf{elif}\;\ell \leq 4.6 \cdot 10^{+145}:\\
\;\;\;\;\sqrt{\left(n \cdot 2\right) \cdot \left(U \cdot \left(t + \frac{\left(\ell \cdot \ell\right) \cdot \left(-2 + \frac{n}{\frac{Om}{U*}}\right)}{Om}\right)\right)}\\
\mathbf{elif}\;\ell \leq 2.5 \cdot 10^{+198}:\\
\;\;\;\;\sqrt{2 \cdot \left(n \cdot \left(t \cdot U\right)\right) + 2 \cdot \frac{\left(\ell \cdot -2 + \frac{n}{\frac{Om}{\ell \cdot U*}}\right) \cdot \left(n \cdot \left(\ell \cdot U\right)\right)}{Om}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \left(\ell \cdot \sqrt{\frac{n \cdot \left(U \cdot \left(\frac{n \cdot \left(U* - U\right)}{Om} - 2\right)\right)}{Om}}\right)\\
\end{array}
\end{array}
if l < 1.25e-57Initial program 54.5%
Simplified62.8%
Taylor expanded in U around 0 61.2%
if 1.25e-57 < l < 4.6e145Initial program 52.1%
Simplified52.6%
Taylor expanded in U around 0 48.1%
Taylor expanded in l around 0 52.7%
unpow252.7%
sub-neg52.7%
associate-/l*54.8%
metadata-eval54.8%
Simplified54.8%
if 4.6e145 < l < 2.50000000000000024e198Initial program 33.9%
Simplified67.9%
Taylor expanded in t around inf 84.0%
Taylor expanded in U* around inf 84.0%
associate-/l*84.0%
Simplified84.0%
if 2.50000000000000024e198 < l Initial program 14.7%
Simplified58.5%
Taylor expanded in t around 0 51.7%
Taylor expanded in l around 0 75.5%
Final simplification61.6%
(FPCore (n U t l Om U*)
:precision binary64
(if (<= l 2e-59)
(sqrt
(*
(* n 2.0)
(* (+ t (/ (* l (+ (* l -2.0) (/ (* n (* l U*)) Om))) Om)) U)))
(if (<= l 1.15e+140)
(sqrt
(* (* n 2.0) (* U (+ t (/ (* (* l l) (+ -2.0 (/ n (/ Om U*)))) Om)))))
(pow
(*
2.0
(+
(* n (* t U))
(/ (- (* l -2.0) (/ n (/ Om (* l U)))) (/ Om (* n (* l U))))))
0.5))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 2e-59) {
tmp = sqrt(((n * 2.0) * ((t + ((l * ((l * -2.0) + ((n * (l * U_42_)) / Om))) / Om)) * U)));
} else if (l <= 1.15e+140) {
tmp = sqrt(((n * 2.0) * (U * (t + (((l * l) * (-2.0 + (n / (Om / U_42_)))) / Om)))));
} else {
tmp = pow((2.0 * ((n * (t * U)) + (((l * -2.0) - (n / (Om / (l * U)))) / (Om / (n * (l * U)))))), 0.5);
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l <= 2d-59) then
tmp = sqrt(((n * 2.0d0) * ((t + ((l * ((l * (-2.0d0)) + ((n * (l * u_42)) / om))) / om)) * u)))
else if (l <= 1.15d+140) then
tmp = sqrt(((n * 2.0d0) * (u * (t + (((l * l) * ((-2.0d0) + (n / (om / u_42)))) / om)))))
else
tmp = (2.0d0 * ((n * (t * u)) + (((l * (-2.0d0)) - (n / (om / (l * u)))) / (om / (n * (l * u)))))) ** 0.5d0
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 2e-59) {
tmp = Math.sqrt(((n * 2.0) * ((t + ((l * ((l * -2.0) + ((n * (l * U_42_)) / Om))) / Om)) * U)));
} else if (l <= 1.15e+140) {
tmp = Math.sqrt(((n * 2.0) * (U * (t + (((l * l) * (-2.0 + (n / (Om / U_42_)))) / Om)))));
} else {
tmp = Math.pow((2.0 * ((n * (t * U)) + (((l * -2.0) - (n / (Om / (l * U)))) / (Om / (n * (l * U)))))), 0.5);
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 2e-59: tmp = math.sqrt(((n * 2.0) * ((t + ((l * ((l * -2.0) + ((n * (l * U_42_)) / Om))) / Om)) * U))) elif l <= 1.15e+140: tmp = math.sqrt(((n * 2.0) * (U * (t + (((l * l) * (-2.0 + (n / (Om / U_42_)))) / Om))))) else: tmp = math.pow((2.0 * ((n * (t * U)) + (((l * -2.0) - (n / (Om / (l * U)))) / (Om / (n * (l * U)))))), 0.5) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 2e-59) tmp = sqrt(Float64(Float64(n * 2.0) * Float64(Float64(t + Float64(Float64(l * Float64(Float64(l * -2.0) + Float64(Float64(n * Float64(l * U_42_)) / Om))) / Om)) * U))); elseif (l <= 1.15e+140) tmp = sqrt(Float64(Float64(n * 2.0) * Float64(U * Float64(t + Float64(Float64(Float64(l * l) * Float64(-2.0 + Float64(n / Float64(Om / U_42_)))) / Om))))); else tmp = Float64(2.0 * Float64(Float64(n * Float64(t * U)) + Float64(Float64(Float64(l * -2.0) - Float64(n / Float64(Om / Float64(l * U)))) / Float64(Om / Float64(n * Float64(l * U)))))) ^ 0.5; end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 2e-59) tmp = sqrt(((n * 2.0) * ((t + ((l * ((l * -2.0) + ((n * (l * U_42_)) / Om))) / Om)) * U))); elseif (l <= 1.15e+140) tmp = sqrt(((n * 2.0) * (U * (t + (((l * l) * (-2.0 + (n / (Om / U_42_)))) / Om))))); else tmp = (2.0 * ((n * (t * U)) + (((l * -2.0) - (n / (Om / (l * U)))) / (Om / (n * (l * U)))))) ^ 0.5; end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 2e-59], N[Sqrt[N[(N[(n * 2.0), $MachinePrecision] * N[(N[(t + N[(N[(l * N[(N[(l * -2.0), $MachinePrecision] + N[(N[(n * N[(l * U$42$), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 1.15e+140], N[Sqrt[N[(N[(n * 2.0), $MachinePrecision] * N[(U * N[(t + N[(N[(N[(l * l), $MachinePrecision] * N[(-2.0 + N[(n / N[(Om / U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Power[N[(2.0 * N[(N[(n * N[(t * U), $MachinePrecision]), $MachinePrecision] + N[(N[(N[(l * -2.0), $MachinePrecision] - N[(n / N[(Om / N[(l * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(Om / N[(n * N[(l * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 2 \cdot 10^{-59}:\\
\;\;\;\;\sqrt{\left(n \cdot 2\right) \cdot \left(\left(t + \frac{\ell \cdot \left(\ell \cdot -2 + \frac{n \cdot \left(\ell \cdot U*\right)}{Om}\right)}{Om}\right) \cdot U\right)}\\
\mathbf{elif}\;\ell \leq 1.15 \cdot 10^{+140}:\\
\;\;\;\;\sqrt{\left(n \cdot 2\right) \cdot \left(U \cdot \left(t + \frac{\left(\ell \cdot \ell\right) \cdot \left(-2 + \frac{n}{\frac{Om}{U*}}\right)}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;{\left(2 \cdot \left(n \cdot \left(t \cdot U\right) + \frac{\ell \cdot -2 - \frac{n}{\frac{Om}{\ell \cdot U}}}{\frac{Om}{n \cdot \left(\ell \cdot U\right)}}\right)\right)}^{0.5}\\
\end{array}
\end{array}
if l < 2.0000000000000001e-59Initial program 54.5%
Simplified62.8%
Taylor expanded in U around 0 61.2%
if 2.0000000000000001e-59 < l < 1.14999999999999995e140Initial program 53.3%
Simplified53.7%
Taylor expanded in U around 0 49.1%
Taylor expanded in l around 0 53.8%
unpow253.8%
sub-neg53.8%
associate-/l*56.0%
metadata-eval56.0%
Simplified56.0%
if 1.14999999999999995e140 < l Initial program 19.1%
Simplified58.6%
Taylor expanded in t around inf 58.2%
pow1/258.5%
distribute-lft-out58.5%
*-commutative58.5%
associate-/l*54.0%
associate-*r*54.2%
*-commutative54.2%
*-commutative54.2%
Applied egg-rr54.2%
Taylor expanded in U* around 0 58.0%
mul-1-neg58.0%
associate-/l*58.0%
distribute-neg-frac58.0%
Simplified58.0%
Final simplification60.1%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (/ n (/ Om U*))))
(if (<= l 2e-12)
(sqrt (* (* n 2.0) (* U (+ t (/ (/ n (/ Om (* U* (* l l)))) Om)))))
(if (<= l 5e+145)
(sqrt (* (* n 2.0) (* U (+ t (/ (* (* l l) (+ -2.0 t_1)) Om)))))
(sqrt (* (- 2.0 t_1) (* (/ (* n -2.0) Om) (* l (* l U)))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = n / (Om / U_42_);
double tmp;
if (l <= 2e-12) {
tmp = sqrt(((n * 2.0) * (U * (t + ((n / (Om / (U_42_ * (l * l)))) / Om)))));
} else if (l <= 5e+145) {
tmp = sqrt(((n * 2.0) * (U * (t + (((l * l) * (-2.0 + t_1)) / Om)))));
} else {
tmp = sqrt(((2.0 - t_1) * (((n * -2.0) / Om) * (l * (l * U)))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: t_1
real(8) :: tmp
t_1 = n / (om / u_42)
if (l <= 2d-12) then
tmp = sqrt(((n * 2.0d0) * (u * (t + ((n / (om / (u_42 * (l * l)))) / om)))))
else if (l <= 5d+145) then
tmp = sqrt(((n * 2.0d0) * (u * (t + (((l * l) * ((-2.0d0) + t_1)) / om)))))
else
tmp = sqrt(((2.0d0 - t_1) * (((n * (-2.0d0)) / om) * (l * (l * u)))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = n / (Om / U_42_);
double tmp;
if (l <= 2e-12) {
tmp = Math.sqrt(((n * 2.0) * (U * (t + ((n / (Om / (U_42_ * (l * l)))) / Om)))));
} else if (l <= 5e+145) {
tmp = Math.sqrt(((n * 2.0) * (U * (t + (((l * l) * (-2.0 + t_1)) / Om)))));
} else {
tmp = Math.sqrt(((2.0 - t_1) * (((n * -2.0) / Om) * (l * (l * U)))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = n / (Om / U_42_) tmp = 0 if l <= 2e-12: tmp = math.sqrt(((n * 2.0) * (U * (t + ((n / (Om / (U_42_ * (l * l)))) / Om))))) elif l <= 5e+145: tmp = math.sqrt(((n * 2.0) * (U * (t + (((l * l) * (-2.0 + t_1)) / Om))))) else: tmp = math.sqrt(((2.0 - t_1) * (((n * -2.0) / Om) * (l * (l * U))))) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(n / Float64(Om / U_42_)) tmp = 0.0 if (l <= 2e-12) tmp = sqrt(Float64(Float64(n * 2.0) * Float64(U * Float64(t + Float64(Float64(n / Float64(Om / Float64(U_42_ * Float64(l * l)))) / Om))))); elseif (l <= 5e+145) tmp = sqrt(Float64(Float64(n * 2.0) * Float64(U * Float64(t + Float64(Float64(Float64(l * l) * Float64(-2.0 + t_1)) / Om))))); else tmp = sqrt(Float64(Float64(2.0 - t_1) * Float64(Float64(Float64(n * -2.0) / Om) * Float64(l * Float64(l * U))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = n / (Om / U_42_); tmp = 0.0; if (l <= 2e-12) tmp = sqrt(((n * 2.0) * (U * (t + ((n / (Om / (U_42_ * (l * l)))) / Om))))); elseif (l <= 5e+145) tmp = sqrt(((n * 2.0) * (U * (t + (((l * l) * (-2.0 + t_1)) / Om))))); else tmp = sqrt(((2.0 - t_1) * (((n * -2.0) / Om) * (l * (l * U))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(n / N[(Om / U$42$), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, 2e-12], N[Sqrt[N[(N[(n * 2.0), $MachinePrecision] * N[(U * N[(t + N[(N[(n / N[(Om / N[(U$42$ * N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 5e+145], N[Sqrt[N[(N[(n * 2.0), $MachinePrecision] * N[(U * N[(t + N[(N[(N[(l * l), $MachinePrecision] * N[(-2.0 + t$95$1), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(2.0 - t$95$1), $MachinePrecision] * N[(N[(N[(n * -2.0), $MachinePrecision] / Om), $MachinePrecision] * N[(l * N[(l * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \frac{n}{\frac{Om}{U*}}\\
\mathbf{if}\;\ell \leq 2 \cdot 10^{-12}:\\
\;\;\;\;\sqrt{\left(n \cdot 2\right) \cdot \left(U \cdot \left(t + \frac{\frac{n}{\frac{Om}{U* \cdot \left(\ell \cdot \ell\right)}}}{Om}\right)\right)}\\
\mathbf{elif}\;\ell \leq 5 \cdot 10^{+145}:\\
\;\;\;\;\sqrt{\left(n \cdot 2\right) \cdot \left(U \cdot \left(t + \frac{\left(\ell \cdot \ell\right) \cdot \left(-2 + t_1\right)}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(2 - t_1\right) \cdot \left(\frac{n \cdot -2}{Om} \cdot \left(\ell \cdot \left(\ell \cdot U\right)\right)\right)}\\
\end{array}
\end{array}
if l < 1.99999999999999996e-12Initial program 54.4%
Simplified61.2%
Taylor expanded in U around 0 59.8%
Taylor expanded in n around inf 53.9%
associate-/l*54.4%
*-commutative54.4%
unpow254.4%
Simplified54.4%
if 1.99999999999999996e-12 < l < 4.99999999999999967e145Initial program 51.8%
Simplified58.6%
Taylor expanded in U around 0 52.3%
Taylor expanded in l around 0 58.5%
unpow258.5%
sub-neg58.5%
associate-/l*61.5%
metadata-eval61.5%
Simplified61.5%
if 4.99999999999999967e145 < l Initial program 19.9%
Simplified61.0%
Taylor expanded in l around -inf 43.6%
associate-/l*43.6%
associate-*r/43.6%
*-commutative43.6%
associate-/r*43.3%
*-commutative43.3%
associate-/r*42.9%
mul-1-neg42.9%
unsub-neg42.9%
associate-/l*42.9%
unpow242.9%
Simplified42.9%
*-un-lft-identity42.9%
associate-/l/42.9%
associate-/r/42.9%
Applied egg-rr42.9%
*-lft-identity42.9%
unpow242.9%
associate-/r*42.9%
unpow242.9%
Simplified42.9%
*-un-lft-identity42.9%
associate-/r/42.9%
*-commutative42.9%
associate-/l/43.6%
associate-*l/43.6%
Applied egg-rr43.6%
*-lft-identity43.6%
*-commutative43.6%
associate-/l*43.6%
associate-/r/43.0%
associate-*l*56.2%
Simplified56.2%
Taylor expanded in U* around inf 47.4%
associate-/l*56.2%
Simplified56.2%
Final simplification55.4%
(FPCore (n U t l Om U*)
:precision binary64
(if (<= l 5e-10)
(sqrt (* (* n 2.0) (* U (+ t (/ (/ n (/ Om (* U* (* l l)))) Om)))))
(if (<= l 5e+145)
(sqrt
(* (* n 2.0) (* U (+ t (/ (* (* l l) (+ -2.0 (/ n (/ Om U*)))) Om)))))
(sqrt
(* (- 2.0 (/ n (/ Om (- U* U)))) (* l (* (* l U) (* -2.0 (/ n Om)))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 5e-10) {
tmp = sqrt(((n * 2.0) * (U * (t + ((n / (Om / (U_42_ * (l * l)))) / Om)))));
} else if (l <= 5e+145) {
tmp = sqrt(((n * 2.0) * (U * (t + (((l * l) * (-2.0 + (n / (Om / U_42_)))) / Om)))));
} else {
tmp = sqrt(((2.0 - (n / (Om / (U_42_ - U)))) * (l * ((l * U) * (-2.0 * (n / Om))))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l <= 5d-10) then
tmp = sqrt(((n * 2.0d0) * (u * (t + ((n / (om / (u_42 * (l * l)))) / om)))))
else if (l <= 5d+145) then
tmp = sqrt(((n * 2.0d0) * (u * (t + (((l * l) * ((-2.0d0) + (n / (om / u_42)))) / om)))))
else
tmp = sqrt(((2.0d0 - (n / (om / (u_42 - u)))) * (l * ((l * u) * ((-2.0d0) * (n / om))))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 5e-10) {
tmp = Math.sqrt(((n * 2.0) * (U * (t + ((n / (Om / (U_42_ * (l * l)))) / Om)))));
} else if (l <= 5e+145) {
tmp = Math.sqrt(((n * 2.0) * (U * (t + (((l * l) * (-2.0 + (n / (Om / U_42_)))) / Om)))));
} else {
tmp = Math.sqrt(((2.0 - (n / (Om / (U_42_ - U)))) * (l * ((l * U) * (-2.0 * (n / Om))))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 5e-10: tmp = math.sqrt(((n * 2.0) * (U * (t + ((n / (Om / (U_42_ * (l * l)))) / Om))))) elif l <= 5e+145: tmp = math.sqrt(((n * 2.0) * (U * (t + (((l * l) * (-2.0 + (n / (Om / U_42_)))) / Om))))) else: tmp = math.sqrt(((2.0 - (n / (Om / (U_42_ - U)))) * (l * ((l * U) * (-2.0 * (n / Om)))))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 5e-10) tmp = sqrt(Float64(Float64(n * 2.0) * Float64(U * Float64(t + Float64(Float64(n / Float64(Om / Float64(U_42_ * Float64(l * l)))) / Om))))); elseif (l <= 5e+145) tmp = sqrt(Float64(Float64(n * 2.0) * Float64(U * Float64(t + Float64(Float64(Float64(l * l) * Float64(-2.0 + Float64(n / Float64(Om / U_42_)))) / Om))))); else tmp = sqrt(Float64(Float64(2.0 - Float64(n / Float64(Om / Float64(U_42_ - U)))) * Float64(l * Float64(Float64(l * U) * Float64(-2.0 * Float64(n / Om)))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 5e-10) tmp = sqrt(((n * 2.0) * (U * (t + ((n / (Om / (U_42_ * (l * l)))) / Om))))); elseif (l <= 5e+145) tmp = sqrt(((n * 2.0) * (U * (t + (((l * l) * (-2.0 + (n / (Om / U_42_)))) / Om))))); else tmp = sqrt(((2.0 - (n / (Om / (U_42_ - U)))) * (l * ((l * U) * (-2.0 * (n / Om)))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 5e-10], N[Sqrt[N[(N[(n * 2.0), $MachinePrecision] * N[(U * N[(t + N[(N[(n / N[(Om / N[(U$42$ * N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 5e+145], N[Sqrt[N[(N[(n * 2.0), $MachinePrecision] * N[(U * N[(t + N[(N[(N[(l * l), $MachinePrecision] * N[(-2.0 + N[(n / N[(Om / U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(2.0 - N[(n / N[(Om / N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(l * N[(N[(l * U), $MachinePrecision] * N[(-2.0 * N[(n / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 5 \cdot 10^{-10}:\\
\;\;\;\;\sqrt{\left(n \cdot 2\right) \cdot \left(U \cdot \left(t + \frac{\frac{n}{\frac{Om}{U* \cdot \left(\ell \cdot \ell\right)}}}{Om}\right)\right)}\\
\mathbf{elif}\;\ell \leq 5 \cdot 10^{+145}:\\
\;\;\;\;\sqrt{\left(n \cdot 2\right) \cdot \left(U \cdot \left(t + \frac{\left(\ell \cdot \ell\right) \cdot \left(-2 + \frac{n}{\frac{Om}{U*}}\right)}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(2 - \frac{n}{\frac{Om}{U* - U}}\right) \cdot \left(\ell \cdot \left(\left(\ell \cdot U\right) \cdot \left(-2 \cdot \frac{n}{Om}\right)\right)\right)}\\
\end{array}
\end{array}
if l < 5.00000000000000031e-10Initial program 54.4%
Simplified61.2%
Taylor expanded in U around 0 59.8%
Taylor expanded in n around inf 53.9%
associate-/l*54.4%
*-commutative54.4%
unpow254.4%
Simplified54.4%
if 5.00000000000000031e-10 < l < 4.99999999999999967e145Initial program 51.8%
Simplified58.6%
Taylor expanded in U around 0 52.3%
Taylor expanded in l around 0 58.5%
unpow258.5%
sub-neg58.5%
associate-/l*61.5%
metadata-eval61.5%
Simplified61.5%
if 4.99999999999999967e145 < l Initial program 19.9%
Simplified61.0%
Taylor expanded in l around -inf 43.6%
associate-/l*43.6%
associate-*r/43.6%
*-commutative43.6%
associate-/r*43.3%
*-commutative43.3%
associate-/r*42.9%
mul-1-neg42.9%
unsub-neg42.9%
associate-/l*42.9%
unpow242.9%
Simplified42.9%
*-un-lft-identity42.9%
associate-/l/42.9%
associate-/r/42.9%
Applied egg-rr42.9%
*-lft-identity42.9%
unpow242.9%
associate-/r*42.9%
unpow242.9%
Simplified42.9%
*-un-lft-identity42.9%
associate-/r/42.9%
*-commutative42.9%
associate-/l/43.6%
associate-*l/43.6%
Applied egg-rr43.6%
*-lft-identity43.6%
*-commutative43.6%
associate-/l*43.6%
associate-/r/43.0%
associate-*l*56.2%
Simplified56.2%
pow156.2%
*-commutative56.2%
associate-/l*56.2%
Applied egg-rr56.2%
unpow156.2%
associate-*l*65.3%
associate-/r/65.3%
Simplified65.3%
Final simplification56.2%
(FPCore (n U t l Om U*)
:precision binary64
(if (<= l 1e-59)
(sqrt
(*
(* n 2.0)
(* (+ t (/ (* l (+ (* l -2.0) (/ (* n (* l U*)) Om))) Om)) U)))
(if (<= l 3.6e+145)
(sqrt
(* (* n 2.0) (* U (+ t (/ (* (* l l) (+ -2.0 (/ n (/ Om U*)))) Om)))))
(sqrt
(* (- 2.0 (/ n (/ Om (- U* U)))) (* l (* (* l U) (* -2.0 (/ n Om)))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 1e-59) {
tmp = sqrt(((n * 2.0) * ((t + ((l * ((l * -2.0) + ((n * (l * U_42_)) / Om))) / Om)) * U)));
} else if (l <= 3.6e+145) {
tmp = sqrt(((n * 2.0) * (U * (t + (((l * l) * (-2.0 + (n / (Om / U_42_)))) / Om)))));
} else {
tmp = sqrt(((2.0 - (n / (Om / (U_42_ - U)))) * (l * ((l * U) * (-2.0 * (n / Om))))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l <= 1d-59) then
tmp = sqrt(((n * 2.0d0) * ((t + ((l * ((l * (-2.0d0)) + ((n * (l * u_42)) / om))) / om)) * u)))
else if (l <= 3.6d+145) then
tmp = sqrt(((n * 2.0d0) * (u * (t + (((l * l) * ((-2.0d0) + (n / (om / u_42)))) / om)))))
else
tmp = sqrt(((2.0d0 - (n / (om / (u_42 - u)))) * (l * ((l * u) * ((-2.0d0) * (n / om))))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 1e-59) {
tmp = Math.sqrt(((n * 2.0) * ((t + ((l * ((l * -2.0) + ((n * (l * U_42_)) / Om))) / Om)) * U)));
} else if (l <= 3.6e+145) {
tmp = Math.sqrt(((n * 2.0) * (U * (t + (((l * l) * (-2.0 + (n / (Om / U_42_)))) / Om)))));
} else {
tmp = Math.sqrt(((2.0 - (n / (Om / (U_42_ - U)))) * (l * ((l * U) * (-2.0 * (n / Om))))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 1e-59: tmp = math.sqrt(((n * 2.0) * ((t + ((l * ((l * -2.0) + ((n * (l * U_42_)) / Om))) / Om)) * U))) elif l <= 3.6e+145: tmp = math.sqrt(((n * 2.0) * (U * (t + (((l * l) * (-2.0 + (n / (Om / U_42_)))) / Om))))) else: tmp = math.sqrt(((2.0 - (n / (Om / (U_42_ - U)))) * (l * ((l * U) * (-2.0 * (n / Om)))))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 1e-59) tmp = sqrt(Float64(Float64(n * 2.0) * Float64(Float64(t + Float64(Float64(l * Float64(Float64(l * -2.0) + Float64(Float64(n * Float64(l * U_42_)) / Om))) / Om)) * U))); elseif (l <= 3.6e+145) tmp = sqrt(Float64(Float64(n * 2.0) * Float64(U * Float64(t + Float64(Float64(Float64(l * l) * Float64(-2.0 + Float64(n / Float64(Om / U_42_)))) / Om))))); else tmp = sqrt(Float64(Float64(2.0 - Float64(n / Float64(Om / Float64(U_42_ - U)))) * Float64(l * Float64(Float64(l * U) * Float64(-2.0 * Float64(n / Om)))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 1e-59) tmp = sqrt(((n * 2.0) * ((t + ((l * ((l * -2.0) + ((n * (l * U_42_)) / Om))) / Om)) * U))); elseif (l <= 3.6e+145) tmp = sqrt(((n * 2.0) * (U * (t + (((l * l) * (-2.0 + (n / (Om / U_42_)))) / Om))))); else tmp = sqrt(((2.0 - (n / (Om / (U_42_ - U)))) * (l * ((l * U) * (-2.0 * (n / Om)))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 1e-59], N[Sqrt[N[(N[(n * 2.0), $MachinePrecision] * N[(N[(t + N[(N[(l * N[(N[(l * -2.0), $MachinePrecision] + N[(N[(n * N[(l * U$42$), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 3.6e+145], N[Sqrt[N[(N[(n * 2.0), $MachinePrecision] * N[(U * N[(t + N[(N[(N[(l * l), $MachinePrecision] * N[(-2.0 + N[(n / N[(Om / U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(2.0 - N[(n / N[(Om / N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(l * N[(N[(l * U), $MachinePrecision] * N[(-2.0 * N[(n / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 10^{-59}:\\
\;\;\;\;\sqrt{\left(n \cdot 2\right) \cdot \left(\left(t + \frac{\ell \cdot \left(\ell \cdot -2 + \frac{n \cdot \left(\ell \cdot U*\right)}{Om}\right)}{Om}\right) \cdot U\right)}\\
\mathbf{elif}\;\ell \leq 3.6 \cdot 10^{+145}:\\
\;\;\;\;\sqrt{\left(n \cdot 2\right) \cdot \left(U \cdot \left(t + \frac{\left(\ell \cdot \ell\right) \cdot \left(-2 + \frac{n}{\frac{Om}{U*}}\right)}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(2 - \frac{n}{\frac{Om}{U* - U}}\right) \cdot \left(\ell \cdot \left(\left(\ell \cdot U\right) \cdot \left(-2 \cdot \frac{n}{Om}\right)\right)\right)}\\
\end{array}
\end{array}
if l < 1e-59Initial program 54.5%
Simplified62.8%
Taylor expanded in U around 0 61.2%
if 1e-59 < l < 3.59999999999999974e145Initial program 52.1%
Simplified52.6%
Taylor expanded in U around 0 48.1%
Taylor expanded in l around 0 52.7%
unpow252.7%
sub-neg52.7%
associate-/l*54.8%
metadata-eval54.8%
Simplified54.8%
if 3.59999999999999974e145 < l Initial program 19.9%
Simplified61.0%
Taylor expanded in l around -inf 43.6%
associate-/l*43.6%
associate-*r/43.6%
*-commutative43.6%
associate-/r*43.3%
*-commutative43.3%
associate-/r*42.9%
mul-1-neg42.9%
unsub-neg42.9%
associate-/l*42.9%
unpow242.9%
Simplified42.9%
*-un-lft-identity42.9%
associate-/l/42.9%
associate-/r/42.9%
Applied egg-rr42.9%
*-lft-identity42.9%
unpow242.9%
associate-/r*42.9%
unpow242.9%
Simplified42.9%
*-un-lft-identity42.9%
associate-/r/42.9%
*-commutative42.9%
associate-/l/43.6%
associate-*l/43.6%
Applied egg-rr43.6%
*-lft-identity43.6%
*-commutative43.6%
associate-/l*43.6%
associate-/r/43.0%
associate-*l*56.2%
Simplified56.2%
pow156.2%
*-commutative56.2%
associate-/l*56.2%
Applied egg-rr56.2%
unpow156.2%
associate-*l*65.3%
associate-/r/65.3%
Simplified65.3%
Final simplification60.5%
(FPCore (n U t l Om U*) :precision binary64 (if (<= l 1.15e+95) (sqrt (* (* n 2.0) (* U (+ t (/ (/ n (/ Om (* U* (* l l)))) Om))))) (pow (* -4.0 (/ n (/ Om (* l (* l U))))) 0.5)))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 1.15e+95) {
tmp = sqrt(((n * 2.0) * (U * (t + ((n / (Om / (U_42_ * (l * l)))) / Om)))));
} else {
tmp = pow((-4.0 * (n / (Om / (l * (l * U))))), 0.5);
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l <= 1.15d+95) then
tmp = sqrt(((n * 2.0d0) * (u * (t + ((n / (om / (u_42 * (l * l)))) / om)))))
else
tmp = ((-4.0d0) * (n / (om / (l * (l * u))))) ** 0.5d0
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 1.15e+95) {
tmp = Math.sqrt(((n * 2.0) * (U * (t + ((n / (Om / (U_42_ * (l * l)))) / Om)))));
} else {
tmp = Math.pow((-4.0 * (n / (Om / (l * (l * U))))), 0.5);
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 1.15e+95: tmp = math.sqrt(((n * 2.0) * (U * (t + ((n / (Om / (U_42_ * (l * l)))) / Om))))) else: tmp = math.pow((-4.0 * (n / (Om / (l * (l * U))))), 0.5) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 1.15e+95) tmp = sqrt(Float64(Float64(n * 2.0) * Float64(U * Float64(t + Float64(Float64(n / Float64(Om / Float64(U_42_ * Float64(l * l)))) / Om))))); else tmp = Float64(-4.0 * Float64(n / Float64(Om / Float64(l * Float64(l * U))))) ^ 0.5; end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 1.15e+95) tmp = sqrt(((n * 2.0) * (U * (t + ((n / (Om / (U_42_ * (l * l)))) / Om))))); else tmp = (-4.0 * (n / (Om / (l * (l * U))))) ^ 0.5; end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 1.15e+95], N[Sqrt[N[(N[(n * 2.0), $MachinePrecision] * N[(U * N[(t + N[(N[(n / N[(Om / N[(U$42$ * N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Power[N[(-4.0 * N[(n / N[(Om / N[(l * N[(l * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 1.15 \cdot 10^{+95}:\\
\;\;\;\;\sqrt{\left(n \cdot 2\right) \cdot \left(U \cdot \left(t + \frac{\frac{n}{\frac{Om}{U* \cdot \left(\ell \cdot \ell\right)}}}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;{\left(-4 \cdot \frac{n}{\frac{Om}{\ell \cdot \left(\ell \cdot U\right)}}\right)}^{0.5}\\
\end{array}
\end{array}
if l < 1.14999999999999999e95Initial program 54.4%
Simplified60.6%
Taylor expanded in U around 0 58.9%
Taylor expanded in n around inf 53.3%
associate-/l*54.2%
*-commutative54.2%
unpow254.2%
Simplified54.2%
if 1.14999999999999999e95 < l Initial program 29.0%
Simplified62.5%
Taylor expanded in l around -inf 47.7%
associate-/l*47.7%
associate-*r/47.7%
*-commutative47.7%
associate-/r*50.5%
*-commutative50.5%
associate-/r*50.2%
mul-1-neg50.2%
unsub-neg50.2%
associate-/l*50.2%
unpow250.2%
Simplified50.2%
*-un-lft-identity50.2%
associate-/l/50.2%
associate-/r/50.2%
Applied egg-rr50.2%
*-lft-identity50.2%
unpow250.2%
associate-/r*50.2%
unpow250.2%
Simplified50.2%
Taylor expanded in Om around inf 17.4%
unpow217.4%
associate-*l*20.3%
Simplified20.3%
pow1/244.9%
times-frac44.9%
metadata-eval44.9%
Applied egg-rr44.9%
Final simplification53.0%
(FPCore (n U t l Om U*) :precision binary64 (if (<= l 4.5e+94) (sqrt (* (* n 2.0) (* U (+ t (/ (/ n (/ Om (* U* (* l l)))) Om))))) (sqrt (* (- 2.0 (/ n (/ Om U*))) (* (/ (* n -2.0) Om) (* l (* l U)))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 4.5e+94) {
tmp = sqrt(((n * 2.0) * (U * (t + ((n / (Om / (U_42_ * (l * l)))) / Om)))));
} else {
tmp = sqrt(((2.0 - (n / (Om / U_42_))) * (((n * -2.0) / Om) * (l * (l * U)))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l <= 4.5d+94) then
tmp = sqrt(((n * 2.0d0) * (u * (t + ((n / (om / (u_42 * (l * l)))) / om)))))
else
tmp = sqrt(((2.0d0 - (n / (om / u_42))) * (((n * (-2.0d0)) / om) * (l * (l * u)))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 4.5e+94) {
tmp = Math.sqrt(((n * 2.0) * (U * (t + ((n / (Om / (U_42_ * (l * l)))) / Om)))));
} else {
tmp = Math.sqrt(((2.0 - (n / (Om / U_42_))) * (((n * -2.0) / Om) * (l * (l * U)))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 4.5e+94: tmp = math.sqrt(((n * 2.0) * (U * (t + ((n / (Om / (U_42_ * (l * l)))) / Om))))) else: tmp = math.sqrt(((2.0 - (n / (Om / U_42_))) * (((n * -2.0) / Om) * (l * (l * U))))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 4.5e+94) tmp = sqrt(Float64(Float64(n * 2.0) * Float64(U * Float64(t + Float64(Float64(n / Float64(Om / Float64(U_42_ * Float64(l * l)))) / Om))))); else tmp = sqrt(Float64(Float64(2.0 - Float64(n / Float64(Om / U_42_))) * Float64(Float64(Float64(n * -2.0) / Om) * Float64(l * Float64(l * U))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 4.5e+94) tmp = sqrt(((n * 2.0) * (U * (t + ((n / (Om / (U_42_ * (l * l)))) / Om))))); else tmp = sqrt(((2.0 - (n / (Om / U_42_))) * (((n * -2.0) / Om) * (l * (l * U))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 4.5e+94], N[Sqrt[N[(N[(n * 2.0), $MachinePrecision] * N[(U * N[(t + N[(N[(n / N[(Om / N[(U$42$ * N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(2.0 - N[(n / N[(Om / U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(n * -2.0), $MachinePrecision] / Om), $MachinePrecision] * N[(l * N[(l * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 4.5 \cdot 10^{+94}:\\
\;\;\;\;\sqrt{\left(n \cdot 2\right) \cdot \left(U \cdot \left(t + \frac{\frac{n}{\frac{Om}{U* \cdot \left(\ell \cdot \ell\right)}}}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(2 - \frac{n}{\frac{Om}{U*}}\right) \cdot \left(\frac{n \cdot -2}{Om} \cdot \left(\ell \cdot \left(\ell \cdot U\right)\right)\right)}\\
\end{array}
\end{array}
if l < 4.49999999999999972e94Initial program 54.4%
Simplified60.6%
Taylor expanded in U around 0 58.9%
Taylor expanded in n around inf 53.3%
associate-/l*54.2%
*-commutative54.2%
unpow254.2%
Simplified54.2%
if 4.49999999999999972e94 < l Initial program 29.0%
Simplified62.5%
Taylor expanded in l around -inf 47.7%
associate-/l*47.7%
associate-*r/47.7%
*-commutative47.7%
associate-/r*50.5%
*-commutative50.5%
associate-/r*50.2%
mul-1-neg50.2%
unsub-neg50.2%
associate-/l*50.2%
unpow250.2%
Simplified50.2%
*-un-lft-identity50.2%
associate-/l/50.2%
associate-/r/50.2%
Applied egg-rr50.2%
*-lft-identity50.2%
unpow250.2%
associate-/r*50.2%
unpow250.2%
Simplified50.2%
*-un-lft-identity50.2%
associate-/r/50.2%
*-commutative50.2%
associate-/l/47.7%
associate-*l/47.7%
Applied egg-rr47.7%
*-lft-identity47.7%
*-commutative47.7%
associate-/l*47.7%
associate-/r/47.2%
associate-*l*55.9%
Simplified55.9%
Taylor expanded in U* around inf 50.1%
associate-/l*55.9%
Simplified55.9%
Final simplification54.4%
(FPCore (n U t l Om U*) :precision binary64 (if (<= l 5e+104) (sqrt (* (* n 2.0) (* U (- t (* 2.0 (* l (/ l Om))))))) (pow (* -4.0 (/ n (/ Om (* l (* l U))))) 0.5)))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 5e+104) {
tmp = sqrt(((n * 2.0) * (U * (t - (2.0 * (l * (l / Om)))))));
} else {
tmp = pow((-4.0 * (n / (Om / (l * (l * U))))), 0.5);
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l <= 5d+104) then
tmp = sqrt(((n * 2.0d0) * (u * (t - (2.0d0 * (l * (l / om)))))))
else
tmp = ((-4.0d0) * (n / (om / (l * (l * u))))) ** 0.5d0
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 5e+104) {
tmp = Math.sqrt(((n * 2.0) * (U * (t - (2.0 * (l * (l / Om)))))));
} else {
tmp = Math.pow((-4.0 * (n / (Om / (l * (l * U))))), 0.5);
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 5e+104: tmp = math.sqrt(((n * 2.0) * (U * (t - (2.0 * (l * (l / Om))))))) else: tmp = math.pow((-4.0 * (n / (Om / (l * (l * U))))), 0.5) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 5e+104) tmp = sqrt(Float64(Float64(n * 2.0) * Float64(U * Float64(t - Float64(2.0 * Float64(l * Float64(l / Om))))))); else tmp = Float64(-4.0 * Float64(n / Float64(Om / Float64(l * Float64(l * U))))) ^ 0.5; end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 5e+104) tmp = sqrt(((n * 2.0) * (U * (t - (2.0 * (l * (l / Om))))))); else tmp = (-4.0 * (n / (Om / (l * (l * U))))) ^ 0.5; end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 5e+104], N[Sqrt[N[(N[(n * 2.0), $MachinePrecision] * N[(U * N[(t - N[(2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Power[N[(-4.0 * N[(n / N[(Om / N[(l * N[(l * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 5 \cdot 10^{+104}:\\
\;\;\;\;\sqrt{\left(n \cdot 2\right) \cdot \left(U \cdot \left(t - 2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;{\left(-4 \cdot \frac{n}{\frac{Om}{\ell \cdot \left(\ell \cdot U\right)}}\right)}^{0.5}\\
\end{array}
\end{array}
if l < 4.9999999999999997e104Initial program 54.2%
associate-*l*55.9%
sub-neg55.9%
associate-+l-55.9%
sub-neg55.9%
associate-/l*59.8%
remove-double-neg59.8%
associate-*l*58.5%
Simplified58.5%
Taylor expanded in Om around inf 47.6%
unpow247.6%
associate-*r/51.6%
Simplified51.6%
if 4.9999999999999997e104 < l Initial program 29.7%
Simplified64.3%
Taylor expanded in l around -inf 49.0%
associate-/l*49.0%
associate-*r/49.0%
*-commutative49.0%
associate-/r*51.9%
*-commutative51.9%
associate-/r*51.7%
mul-1-neg51.7%
unsub-neg51.7%
associate-/l*51.7%
unpow251.7%
Simplified51.7%
*-un-lft-identity51.7%
associate-/l/51.7%
associate-/r/51.7%
Applied egg-rr51.7%
*-lft-identity51.7%
unpow251.7%
associate-/r*51.7%
unpow251.7%
Simplified51.7%
Taylor expanded in Om around inf 17.7%
unpow217.7%
associate-*l*20.8%
Simplified20.8%
pow1/246.1%
times-frac46.1%
metadata-eval46.1%
Applied egg-rr46.1%
Final simplification50.9%
(FPCore (n U t l Om U*) :precision binary64 (if (<= l 8.6e+86) (pow (* 2.0 (* n (* t U))) 0.5) (pow (* -4.0 (/ n (/ Om (* l (* l U))))) 0.5)))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 8.6e+86) {
tmp = pow((2.0 * (n * (t * U))), 0.5);
} else {
tmp = pow((-4.0 * (n / (Om / (l * (l * U))))), 0.5);
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l <= 8.6d+86) then
tmp = (2.0d0 * (n * (t * u))) ** 0.5d0
else
tmp = ((-4.0d0) * (n / (om / (l * (l * u))))) ** 0.5d0
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 8.6e+86) {
tmp = Math.pow((2.0 * (n * (t * U))), 0.5);
} else {
tmp = Math.pow((-4.0 * (n / (Om / (l * (l * U))))), 0.5);
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 8.6e+86: tmp = math.pow((2.0 * (n * (t * U))), 0.5) else: tmp = math.pow((-4.0 * (n / (Om / (l * (l * U))))), 0.5) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 8.6e+86) tmp = Float64(2.0 * Float64(n * Float64(t * U))) ^ 0.5; else tmp = Float64(-4.0 * Float64(n / Float64(Om / Float64(l * Float64(l * U))))) ^ 0.5; end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 8.6e+86) tmp = (2.0 * (n * (t * U))) ^ 0.5; else tmp = (-4.0 * (n / (Om / (l * (l * U))))) ^ 0.5; end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 8.6e+86], N[Power[N[(2.0 * N[(n * N[(t * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[Power[N[(-4.0 * N[(n / N[(Om / N[(l * N[(l * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 8.6 \cdot 10^{+86}:\\
\;\;\;\;{\left(2 \cdot \left(n \cdot \left(t \cdot U\right)\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;{\left(-4 \cdot \frac{n}{\frac{Om}{\ell \cdot \left(\ell \cdot U\right)}}\right)}^{0.5}\\
\end{array}
\end{array}
if l < 8.6000000000000004e86Initial program 54.2%
Simplified60.5%
Taylor expanded in t around inf 43.7%
pow1/244.6%
associate-*r*44.6%
*-commutative44.6%
Applied egg-rr44.6%
if 8.6000000000000004e86 < l Initial program 32.1%
Simplified63.1%
Taylor expanded in l around -inf 46.8%
associate-/l*46.8%
associate-*r/46.8%
*-commutative46.8%
associate-/r*49.3%
*-commutative49.3%
associate-/r*49.1%
mul-1-neg49.1%
unsub-neg49.1%
associate-/l*49.1%
unpow249.1%
Simplified49.1%
*-un-lft-identity49.1%
associate-/l/49.1%
associate-/r/49.1%
Applied egg-rr49.1%
*-lft-identity49.1%
unpow249.1%
associate-/r*49.1%
unpow249.1%
Simplified49.1%
Taylor expanded in Om around inf 18.7%
unpow218.7%
associate-*l*21.4%
Simplified21.4%
pow1/244.0%
times-frac44.0%
metadata-eval44.0%
Applied egg-rr44.0%
Final simplification44.5%
(FPCore (n U t l Om U*) :precision binary64 (if (<= l 6.6e+94) (pow (* 2.0 (* n (* t U))) 0.5) (sqrt (* -4.0 (* (/ n Om) (* l (* l U)))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 6.6e+94) {
tmp = pow((2.0 * (n * (t * U))), 0.5);
} else {
tmp = sqrt((-4.0 * ((n / Om) * (l * (l * U)))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l <= 6.6d+94) then
tmp = (2.0d0 * (n * (t * u))) ** 0.5d0
else
tmp = sqrt(((-4.0d0) * ((n / om) * (l * (l * u)))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 6.6e+94) {
tmp = Math.pow((2.0 * (n * (t * U))), 0.5);
} else {
tmp = Math.sqrt((-4.0 * ((n / Om) * (l * (l * U)))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 6.6e+94: tmp = math.pow((2.0 * (n * (t * U))), 0.5) else: tmp = math.sqrt((-4.0 * ((n / Om) * (l * (l * U))))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 6.6e+94) tmp = Float64(2.0 * Float64(n * Float64(t * U))) ^ 0.5; else tmp = sqrt(Float64(-4.0 * Float64(Float64(n / Om) * Float64(l * Float64(l * U))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 6.6e+94) tmp = (2.0 * (n * (t * U))) ^ 0.5; else tmp = sqrt((-4.0 * ((n / Om) * (l * (l * U))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 6.6e+94], N[Power[N[(2.0 * N[(n * N[(t * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[Sqrt[N[(-4.0 * N[(N[(n / Om), $MachinePrecision] * N[(l * N[(l * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 6.6 \cdot 10^{+94}:\\
\;\;\;\;{\left(2 \cdot \left(n \cdot \left(t \cdot U\right)\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{-4 \cdot \left(\frac{n}{Om} \cdot \left(\ell \cdot \left(\ell \cdot U\right)\right)\right)}\\
\end{array}
\end{array}
if l < 6.6e94Initial program 54.4%
Simplified60.6%
Taylor expanded in t around inf 43.6%
pow1/244.5%
associate-*r*44.5%
*-commutative44.5%
Applied egg-rr44.5%
if 6.6e94 < l Initial program 29.0%
Simplified62.5%
Taylor expanded in l around -inf 47.7%
associate-/l*47.7%
associate-*r/47.7%
*-commutative47.7%
associate-/r*50.5%
*-commutative50.5%
associate-/r*50.2%
mul-1-neg50.2%
unsub-neg50.2%
associate-/l*50.2%
unpow250.2%
Simplified50.2%
*-un-lft-identity50.2%
associate-/l/50.2%
associate-/r/50.2%
Applied egg-rr50.2%
*-lft-identity50.2%
unpow250.2%
associate-/r*50.2%
unpow250.2%
Simplified50.2%
Taylor expanded in Om around inf 17.4%
unpow217.4%
associate-*l*20.3%
Simplified20.3%
Taylor expanded in n around 0 17.4%
unpow217.4%
associate-*r*20.3%
associate-*l/19.7%
Simplified19.7%
Final simplification41.3%
(FPCore (n U t l Om U*) :precision binary64 (if (<= l 4e+95) (pow (* 2.0 (* n (* t U))) 0.5) (sqrt (* -4.0 (/ n (/ Om (* l (* l U))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 4e+95) {
tmp = pow((2.0 * (n * (t * U))), 0.5);
} else {
tmp = sqrt((-4.0 * (n / (Om / (l * (l * U))))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l <= 4d+95) then
tmp = (2.0d0 * (n * (t * u))) ** 0.5d0
else
tmp = sqrt(((-4.0d0) * (n / (om / (l * (l * u))))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 4e+95) {
tmp = Math.pow((2.0 * (n * (t * U))), 0.5);
} else {
tmp = Math.sqrt((-4.0 * (n / (Om / (l * (l * U))))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 4e+95: tmp = math.pow((2.0 * (n * (t * U))), 0.5) else: tmp = math.sqrt((-4.0 * (n / (Om / (l * (l * U)))))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 4e+95) tmp = Float64(2.0 * Float64(n * Float64(t * U))) ^ 0.5; else tmp = sqrt(Float64(-4.0 * Float64(n / Float64(Om / Float64(l * Float64(l * U)))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 4e+95) tmp = (2.0 * (n * (t * U))) ^ 0.5; else tmp = sqrt((-4.0 * (n / (Om / (l * (l * U)))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 4e+95], N[Power[N[(2.0 * N[(n * N[(t * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[Sqrt[N[(-4.0 * N[(n / N[(Om / N[(l * N[(l * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 4 \cdot 10^{+95}:\\
\;\;\;\;{\left(2 \cdot \left(n \cdot \left(t \cdot U\right)\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{-4 \cdot \frac{n}{\frac{Om}{\ell \cdot \left(\ell \cdot U\right)}}}\\
\end{array}
\end{array}
if l < 4.00000000000000008e95Initial program 54.4%
Simplified60.6%
Taylor expanded in t around inf 43.6%
pow1/244.5%
associate-*r*44.5%
*-commutative44.5%
Applied egg-rr44.5%
if 4.00000000000000008e95 < l Initial program 29.0%
Simplified62.5%
Taylor expanded in l around -inf 47.7%
associate-/l*47.7%
associate-*r/47.7%
*-commutative47.7%
associate-/r*50.5%
*-commutative50.5%
associate-/r*50.2%
mul-1-neg50.2%
unsub-neg50.2%
associate-/l*50.2%
unpow250.2%
Simplified50.2%
*-un-lft-identity50.2%
associate-/l/50.2%
associate-/r/50.2%
Applied egg-rr50.2%
*-lft-identity50.2%
unpow250.2%
associate-/r*50.2%
unpow250.2%
Simplified50.2%
Taylor expanded in Om around inf 17.4%
unpow217.4%
associate-*l*20.3%
Simplified20.3%
times-frac20.3%
metadata-eval20.3%
Applied egg-rr20.3%
Final simplification41.3%
(FPCore (n U t l Om U*) :precision binary64 (pow (* 2.0 (* n (* t U))) 0.5))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return pow((2.0 * (n * (t * U))), 0.5);
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
code = (2.0d0 * (n * (t * u))) ** 0.5d0
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.pow((2.0 * (n * (t * U))), 0.5);
}
def code(n, U, t, l, Om, U_42_): return math.pow((2.0 * (n * (t * U))), 0.5)
function code(n, U, t, l, Om, U_42_) return Float64(2.0 * Float64(n * Float64(t * U))) ^ 0.5 end
function tmp = code(n, U, t, l, Om, U_42_) tmp = (2.0 * (n * (t * U))) ^ 0.5; end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Power[N[(2.0 * N[(n * N[(t * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]
\begin{array}{l}
\\
{\left(2 \cdot \left(n \cdot \left(t \cdot U\right)\right)\right)}^{0.5}
\end{array}
Initial program 51.1%
Simplified60.9%
Taylor expanded in t around inf 38.6%
pow1/239.4%
associate-*r*39.4%
*-commutative39.4%
Applied egg-rr39.4%
Final simplification39.4%
(FPCore (n U t l Om U*) :precision binary64 (sqrt (* (* n 2.0) (* t U))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return sqrt(((n * 2.0) * (t * U)));
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
code = sqrt(((n * 2.0d0) * (t * u)))
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.sqrt(((n * 2.0) * (t * U)));
}
def code(n, U, t, l, Om, U_42_): return math.sqrt(((n * 2.0) * (t * U)))
function code(n, U, t, l, Om, U_42_) return sqrt(Float64(Float64(n * 2.0) * Float64(t * U))) end
function tmp = code(n, U, t, l, Om, U_42_) tmp = sqrt(((n * 2.0) * (t * U))); end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Sqrt[N[(N[(n * 2.0), $MachinePrecision] * N[(t * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\left(n \cdot 2\right) \cdot \left(t \cdot U\right)}
\end{array}
Initial program 51.1%
Simplified60.9%
Taylor expanded in t around inf 38.6%
Final simplification38.6%
herbie shell --seed 2023258
(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*))))))