
(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 20 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
(let* ((t_1 (+ t (/ (+ (/ (- U* U) (/ (/ Om l) n)) (* l -2.0)) (/ Om l)))))
(if (<= U 5e-304)
(sqrt (* U (* n (* 2.0 t_1))))
(* (sqrt (* n t_1)) (sqrt (* U 2.0))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l));
double tmp;
if (U <= 5e-304) {
tmp = sqrt((U * (n * (2.0 * t_1))));
} else {
tmp = sqrt((n * t_1)) * sqrt((U * 2.0));
}
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 = t + ((((u_42 - u) / ((om / l) / n)) + (l * (-2.0d0))) / (om / l))
if (u <= 5d-304) then
tmp = sqrt((u * (n * (2.0d0 * t_1))))
else
tmp = sqrt((n * t_1)) * sqrt((u * 2.0d0))
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 = t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l));
double tmp;
if (U <= 5e-304) {
tmp = Math.sqrt((U * (n * (2.0 * t_1))));
} else {
tmp = Math.sqrt((n * t_1)) * Math.sqrt((U * 2.0));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l)) tmp = 0 if U <= 5e-304: tmp = math.sqrt((U * (n * (2.0 * t_1)))) else: tmp = math.sqrt((n * t_1)) * math.sqrt((U * 2.0)) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(t + Float64(Float64(Float64(Float64(U_42_ - U) / Float64(Float64(Om / l) / n)) + Float64(l * -2.0)) / Float64(Om / l))) tmp = 0.0 if (U <= 5e-304) tmp = sqrt(Float64(U * Float64(n * Float64(2.0 * t_1)))); else tmp = Float64(sqrt(Float64(n * t_1)) * sqrt(Float64(U * 2.0))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l)); tmp = 0.0; if (U <= 5e-304) tmp = sqrt((U * (n * (2.0 * t_1)))); else tmp = sqrt((n * t_1)) * sqrt((U * 2.0)); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(t + N[(N[(N[(N[(U$42$ - U), $MachinePrecision] / N[(N[(Om / l), $MachinePrecision] / n), $MachinePrecision]), $MachinePrecision] + N[(l * -2.0), $MachinePrecision]), $MachinePrecision] / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[U, 5e-304], N[Sqrt[N[(U * N[(n * N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(n * t$95$1), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(U * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := t + \frac{\frac{U* - U}{\frac{\frac{Om}{\ell}}{n}} + \ell \cdot -2}{\frac{Om}{\ell}}\\
\mathbf{if}\;U \leq 5 \cdot 10^{-304}:\\
\;\;\;\;\sqrt{U \cdot \left(n \cdot \left(2 \cdot t\_1\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{n \cdot t\_1} \cdot \sqrt{U \cdot 2}\\
\end{array}
\end{array}
if U < 4.99999999999999965e-304Initial program 46.3%
Simplified57.4%
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr62.4%
if 4.99999999999999965e-304 < U Initial program 50.2%
Simplified57.3%
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
Applied egg-rr74.2%
Final simplification68.4%
(FPCore (n U t l Om U*)
:precision binary64
(if (<= U 5e-304)
(sqrt
(*
U
(*
n
(* 2.0 (+ t (/ (+ (/ (- U* U) (/ (/ Om l) n)) (* l -2.0)) (/ Om l)))))))
(*
(sqrt (* n (+ t (/ (+ (* l -2.0) (/ U* (/ Om (* l n)))) (/ Om l)))))
(pow (* U 2.0) 0.5))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (U <= 5e-304) {
tmp = sqrt((U * (n * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l)))))));
} else {
tmp = sqrt((n * (t + (((l * -2.0) + (U_42_ / (Om / (l * n)))) / (Om / l))))) * pow((U * 2.0), 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 (u <= 5d-304) then
tmp = sqrt((u * (n * (2.0d0 * (t + ((((u_42 - u) / ((om / l) / n)) + (l * (-2.0d0))) / (om / l)))))))
else
tmp = sqrt((n * (t + (((l * (-2.0d0)) + (u_42 / (om / (l * n)))) / (om / l))))) * ((u * 2.0d0) ** 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 (U <= 5e-304) {
tmp = Math.sqrt((U * (n * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l)))))));
} else {
tmp = Math.sqrt((n * (t + (((l * -2.0) + (U_42_ / (Om / (l * n)))) / (Om / l))))) * Math.pow((U * 2.0), 0.5);
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if U <= 5e-304: tmp = math.sqrt((U * (n * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l))))))) else: tmp = math.sqrt((n * (t + (((l * -2.0) + (U_42_ / (Om / (l * n)))) / (Om / l))))) * math.pow((U * 2.0), 0.5) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (U <= 5e-304) tmp = sqrt(Float64(U * Float64(n * Float64(2.0 * Float64(t + Float64(Float64(Float64(Float64(U_42_ - U) / Float64(Float64(Om / l) / n)) + Float64(l * -2.0)) / Float64(Om / l))))))); else tmp = Float64(sqrt(Float64(n * Float64(t + Float64(Float64(Float64(l * -2.0) + Float64(U_42_ / Float64(Om / Float64(l * n)))) / Float64(Om / l))))) * (Float64(U * 2.0) ^ 0.5)); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (U <= 5e-304) tmp = sqrt((U * (n * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l))))))); else tmp = sqrt((n * (t + (((l * -2.0) + (U_42_ / (Om / (l * n)))) / (Om / l))))) * ((U * 2.0) ^ 0.5); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[U, 5e-304], N[Sqrt[N[(U * N[(n * N[(2.0 * N[(t + N[(N[(N[(N[(U$42$ - U), $MachinePrecision] / N[(N[(Om / l), $MachinePrecision] / n), $MachinePrecision]), $MachinePrecision] + N[(l * -2.0), $MachinePrecision]), $MachinePrecision] / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(n * N[(t + N[(N[(N[(l * -2.0), $MachinePrecision] + N[(U$42$ / N[(Om / N[(l * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Power[N[(U * 2.0), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;U \leq 5 \cdot 10^{-304}:\\
\;\;\;\;\sqrt{U \cdot \left(n \cdot \left(2 \cdot \left(t + \frac{\frac{U* - U}{\frac{\frac{Om}{\ell}}{n}} + \ell \cdot -2}{\frac{Om}{\ell}}\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{n \cdot \left(t + \frac{\ell \cdot -2 + \frac{U*}{\frac{Om}{\ell \cdot n}}}{\frac{Om}{\ell}}\right)} \cdot {\left(U \cdot 2\right)}^{0.5}\\
\end{array}
\end{array}
if U < 4.99999999999999965e-304Initial program 46.3%
Simplified57.4%
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr62.4%
if 4.99999999999999965e-304 < U Initial program 50.2%
Simplified57.3%
Taylor expanded in U* around inf
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6457.2%
Simplified57.2%
*-commutativeN/A
*-lowering-*.f64N/A
associate-/l*N/A
*-commutativeN/A
associate-/r/N/A
/-lowering-/.f64N/A
/-lowering-/.f6458.7%
Applied egg-rr58.7%
pow1/2N/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr72.6%
Final simplification67.5%
(FPCore (n U t l Om U*)
:precision binary64
(if (<= U 5e-304)
(sqrt
(*
U
(*
n
(* 2.0 (+ t (/ (+ (/ (- U* U) (/ (/ Om l) n)) (* l -2.0)) (/ Om l)))))))
(*
(pow (* U 2.0) 0.5)
(sqrt (* n (+ t (/ (+ (* l -2.0) (/ (* U* (* l n)) Om)) (/ Om l))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (U <= 5e-304) {
tmp = sqrt((U * (n * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l)))))));
} else {
tmp = pow((U * 2.0), 0.5) * sqrt((n * (t + (((l * -2.0) + ((U_42_ * (l * n)) / Om)) / (Om / l)))));
}
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 (u <= 5d-304) then
tmp = sqrt((u * (n * (2.0d0 * (t + ((((u_42 - u) / ((om / l) / n)) + (l * (-2.0d0))) / (om / l)))))))
else
tmp = ((u * 2.0d0) ** 0.5d0) * sqrt((n * (t + (((l * (-2.0d0)) + ((u_42 * (l * n)) / om)) / (om / l)))))
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 (U <= 5e-304) {
tmp = Math.sqrt((U * (n * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l)))))));
} else {
tmp = Math.pow((U * 2.0), 0.5) * Math.sqrt((n * (t + (((l * -2.0) + ((U_42_ * (l * n)) / Om)) / (Om / l)))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if U <= 5e-304: tmp = math.sqrt((U * (n * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l))))))) else: tmp = math.pow((U * 2.0), 0.5) * math.sqrt((n * (t + (((l * -2.0) + ((U_42_ * (l * n)) / Om)) / (Om / l))))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (U <= 5e-304) tmp = sqrt(Float64(U * Float64(n * Float64(2.0 * Float64(t + Float64(Float64(Float64(Float64(U_42_ - U) / Float64(Float64(Om / l) / n)) + Float64(l * -2.0)) / Float64(Om / l))))))); else tmp = Float64((Float64(U * 2.0) ^ 0.5) * sqrt(Float64(n * Float64(t + Float64(Float64(Float64(l * -2.0) + Float64(Float64(U_42_ * Float64(l * n)) / Om)) / Float64(Om / l)))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (U <= 5e-304) tmp = sqrt((U * (n * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l))))))); else tmp = ((U * 2.0) ^ 0.5) * sqrt((n * (t + (((l * -2.0) + ((U_42_ * (l * n)) / Om)) / (Om / l))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[U, 5e-304], N[Sqrt[N[(U * N[(n * N[(2.0 * N[(t + N[(N[(N[(N[(U$42$ - U), $MachinePrecision] / N[(N[(Om / l), $MachinePrecision] / n), $MachinePrecision]), $MachinePrecision] + N[(l * -2.0), $MachinePrecision]), $MachinePrecision] / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Power[N[(U * 2.0), $MachinePrecision], 0.5], $MachinePrecision] * N[Sqrt[N[(n * N[(t + N[(N[(N[(l * -2.0), $MachinePrecision] + N[(N[(U$42$ * N[(l * n), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;U \leq 5 \cdot 10^{-304}:\\
\;\;\;\;\sqrt{U \cdot \left(n \cdot \left(2 \cdot \left(t + \frac{\frac{U* - U}{\frac{\frac{Om}{\ell}}{n}} + \ell \cdot -2}{\frac{Om}{\ell}}\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;{\left(U \cdot 2\right)}^{0.5} \cdot \sqrt{n \cdot \left(t + \frac{\ell \cdot -2 + \frac{U* \cdot \left(\ell \cdot n\right)}{Om}}{\frac{Om}{\ell}}\right)}\\
\end{array}
\end{array}
if U < 4.99999999999999965e-304Initial program 46.3%
Simplified57.4%
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr62.4%
if 4.99999999999999965e-304 < U Initial program 50.2%
Simplified57.3%
Taylor expanded in U* around inf
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6457.2%
Simplified57.2%
pow1/2N/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
Applied egg-rr72.0%
Final simplification67.3%
(FPCore (n U t l Om U*)
:precision binary64
(if (<= l 2.35e+232)
(sqrt
(*
U
(*
n
(* 2.0 (+ t (/ (+ (/ (- U* U) (/ (/ Om l) n)) (* l -2.0)) (/ Om l)))))))
(* (sqrt (/ (* (+ -2.0 (/ (* U* n) Om)) (* U n)) Om)) (* l (sqrt 2.0)))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 2.35e+232) {
tmp = sqrt((U * (n * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l)))))));
} else {
tmp = sqrt((((-2.0 + ((U_42_ * n) / Om)) * (U * n)) / Om)) * (l * sqrt(2.0));
}
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 <= 2.35d+232) then
tmp = sqrt((u * (n * (2.0d0 * (t + ((((u_42 - u) / ((om / l) / n)) + (l * (-2.0d0))) / (om / l)))))))
else
tmp = sqrt(((((-2.0d0) + ((u_42 * n) / om)) * (u * n)) / om)) * (l * sqrt(2.0d0))
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 <= 2.35e+232) {
tmp = Math.sqrt((U * (n * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l)))))));
} else {
tmp = Math.sqrt((((-2.0 + ((U_42_ * n) / Om)) * (U * n)) / Om)) * (l * Math.sqrt(2.0));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 2.35e+232: tmp = math.sqrt((U * (n * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l))))))) else: tmp = math.sqrt((((-2.0 + ((U_42_ * n) / Om)) * (U * n)) / Om)) * (l * math.sqrt(2.0)) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 2.35e+232) tmp = sqrt(Float64(U * Float64(n * Float64(2.0 * Float64(t + Float64(Float64(Float64(Float64(U_42_ - U) / Float64(Float64(Om / l) / n)) + Float64(l * -2.0)) / Float64(Om / l))))))); else tmp = Float64(sqrt(Float64(Float64(Float64(-2.0 + Float64(Float64(U_42_ * n) / Om)) * Float64(U * n)) / Om)) * Float64(l * sqrt(2.0))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 2.35e+232) tmp = sqrt((U * (n * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l))))))); else tmp = sqrt((((-2.0 + ((U_42_ * n) / Om)) * (U * n)) / Om)) * (l * sqrt(2.0)); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 2.35e+232], N[Sqrt[N[(U * N[(n * N[(2.0 * N[(t + N[(N[(N[(N[(U$42$ - U), $MachinePrecision] / N[(N[(Om / l), $MachinePrecision] / n), $MachinePrecision]), $MachinePrecision] + N[(l * -2.0), $MachinePrecision]), $MachinePrecision] / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(N[(N[(-2.0 + N[(N[(U$42$ * n), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] * N[(U * n), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]], $MachinePrecision] * N[(l * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 2.35 \cdot 10^{+232}:\\
\;\;\;\;\sqrt{U \cdot \left(n \cdot \left(2 \cdot \left(t + \frac{\frac{U* - U}{\frac{\frac{Om}{\ell}}{n}} + \ell \cdot -2}{\frac{Om}{\ell}}\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{\left(-2 + \frac{U* \cdot n}{Om}\right) \cdot \left(U \cdot n\right)}{Om}} \cdot \left(\ell \cdot \sqrt{2}\right)\\
\end{array}
\end{array}
if l < 2.34999999999999996e232Initial program 50.7%
Simplified57.9%
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr64.3%
if 2.34999999999999996e232 < l Initial program 9.0%
Simplified49.0%
Taylor expanded in U* around inf
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6449.6%
Simplified49.6%
Taylor expanded in t around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6457.1%
Simplified57.1%
Taylor expanded in l around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sub-negN/A
metadata-evalN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6474.5%
Simplified74.5%
Final simplification64.9%
(FPCore (n U t l Om U*)
:precision binary64
(if (<= t 1.6e+225)
(sqrt
(*
U
(*
n
(* 2.0 (+ t (/ (+ (/ (- U* U) (/ (/ Om l) n)) (* l -2.0)) (/ Om l)))))))
(* (sqrt t) (sqrt (* n (* U 2.0))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (t <= 1.6e+225) {
tmp = sqrt((U * (n * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l)))))));
} else {
tmp = sqrt(t) * sqrt((n * (U * 2.0)));
}
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 (t <= 1.6d+225) then
tmp = sqrt((u * (n * (2.0d0 * (t + ((((u_42 - u) / ((om / l) / n)) + (l * (-2.0d0))) / (om / l)))))))
else
tmp = sqrt(t) * sqrt((n * (u * 2.0d0)))
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 (t <= 1.6e+225) {
tmp = Math.sqrt((U * (n * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l)))))));
} else {
tmp = Math.sqrt(t) * Math.sqrt((n * (U * 2.0)));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if t <= 1.6e+225: tmp = math.sqrt((U * (n * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l))))))) else: tmp = math.sqrt(t) * math.sqrt((n * (U * 2.0))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (t <= 1.6e+225) tmp = sqrt(Float64(U * Float64(n * Float64(2.0 * Float64(t + Float64(Float64(Float64(Float64(U_42_ - U) / Float64(Float64(Om / l) / n)) + Float64(l * -2.0)) / Float64(Om / l))))))); else tmp = Float64(sqrt(t) * sqrt(Float64(n * Float64(U * 2.0)))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (t <= 1.6e+225) tmp = sqrt((U * (n * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l))))))); else tmp = sqrt(t) * sqrt((n * (U * 2.0))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[t, 1.6e+225], N[Sqrt[N[(U * N[(n * N[(2.0 * N[(t + N[(N[(N[(N[(U$42$ - U), $MachinePrecision] / N[(N[(Om / l), $MachinePrecision] / n), $MachinePrecision]), $MachinePrecision] + N[(l * -2.0), $MachinePrecision]), $MachinePrecision] / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[t], $MachinePrecision] * N[Sqrt[N[(n * N[(U * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;t \leq 1.6 \cdot 10^{+225}:\\
\;\;\;\;\sqrt{U \cdot \left(n \cdot \left(2 \cdot \left(t + \frac{\frac{U* - U}{\frac{\frac{Om}{\ell}}{n}} + \ell \cdot -2}{\frac{Om}{\ell}}\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{t} \cdot \sqrt{n \cdot \left(U \cdot 2\right)}\\
\end{array}
\end{array}
if t < 1.59999999999999995e225Initial program 50.6%
Simplified59.1%
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr65.7%
if 1.59999999999999995e225 < t Initial program 19.3%
Simplified34.9%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6434.9%
Simplified34.9%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6429.6%
Applied egg-rr29.6%
*-commutativeN/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6469.0%
Applied egg-rr69.0%
Final simplification65.9%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (+ (* l -2.0) (* U* (/ (* l n) Om)))))
(if (<= l 2.25e-11)
(sqrt (* U (* n (* 2.0 (+ t (/ (* l t_1) Om))))))
(if (<= l 1e+173)
(sqrt
(*
n
(*
U
(*
2.0
(+ t (/ (+ (/ (- U* U) (/ (/ Om l) n)) (* l -2.0)) (/ Om l)))))))
(sqrt (/ (* 2.0 (* (* U l) (* n t_1))) Om))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (l * -2.0) + (U_42_ * ((l * n) / Om));
double tmp;
if (l <= 2.25e-11) {
tmp = sqrt((U * (n * (2.0 * (t + ((l * t_1) / Om))))));
} else if (l <= 1e+173) {
tmp = sqrt((n * (U * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l)))))));
} else {
tmp = sqrt(((2.0 * ((U * l) * (n * t_1))) / 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 = (l * (-2.0d0)) + (u_42 * ((l * n) / om))
if (l <= 2.25d-11) then
tmp = sqrt((u * (n * (2.0d0 * (t + ((l * t_1) / om))))))
else if (l <= 1d+173) then
tmp = sqrt((n * (u * (2.0d0 * (t + ((((u_42 - u) / ((om / l) / n)) + (l * (-2.0d0))) / (om / l)))))))
else
tmp = sqrt(((2.0d0 * ((u * l) * (n * t_1))) / 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 = (l * -2.0) + (U_42_ * ((l * n) / Om));
double tmp;
if (l <= 2.25e-11) {
tmp = Math.sqrt((U * (n * (2.0 * (t + ((l * t_1) / Om))))));
} else if (l <= 1e+173) {
tmp = Math.sqrt((n * (U * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l)))))));
} else {
tmp = Math.sqrt(((2.0 * ((U * l) * (n * t_1))) / Om));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = (l * -2.0) + (U_42_ * ((l * n) / Om)) tmp = 0 if l <= 2.25e-11: tmp = math.sqrt((U * (n * (2.0 * (t + ((l * t_1) / Om)))))) elif l <= 1e+173: tmp = math.sqrt((n * (U * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l))))))) else: tmp = math.sqrt(((2.0 * ((U * l) * (n * t_1))) / Om)) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(Float64(l * -2.0) + Float64(U_42_ * Float64(Float64(l * n) / Om))) tmp = 0.0 if (l <= 2.25e-11) tmp = sqrt(Float64(U * Float64(n * Float64(2.0 * Float64(t + Float64(Float64(l * t_1) / Om)))))); elseif (l <= 1e+173) tmp = sqrt(Float64(n * Float64(U * Float64(2.0 * Float64(t + Float64(Float64(Float64(Float64(U_42_ - U) / Float64(Float64(Om / l) / n)) + Float64(l * -2.0)) / Float64(Om / l))))))); else tmp = sqrt(Float64(Float64(2.0 * Float64(Float64(U * l) * Float64(n * t_1))) / Om)); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = (l * -2.0) + (U_42_ * ((l * n) / Om)); tmp = 0.0; if (l <= 2.25e-11) tmp = sqrt((U * (n * (2.0 * (t + ((l * t_1) / Om)))))); elseif (l <= 1e+173) tmp = sqrt((n * (U * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l))))))); else tmp = sqrt(((2.0 * ((U * l) * (n * t_1))) / Om)); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(l * -2.0), $MachinePrecision] + N[(U$42$ * N[(N[(l * n), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, 2.25e-11], N[Sqrt[N[(U * N[(n * N[(2.0 * N[(t + N[(N[(l * t$95$1), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 1e+173], N[Sqrt[N[(n * N[(U * N[(2.0 * N[(t + N[(N[(N[(N[(U$42$ - U), $MachinePrecision] / N[(N[(Om / l), $MachinePrecision] / n), $MachinePrecision]), $MachinePrecision] + N[(l * -2.0), $MachinePrecision]), $MachinePrecision] / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(2.0 * N[(N[(U * l), $MachinePrecision] * N[(n * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]], $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \ell \cdot -2 + U* \cdot \frac{\ell \cdot n}{Om}\\
\mathbf{if}\;\ell \leq 2.25 \cdot 10^{-11}:\\
\;\;\;\;\sqrt{U \cdot \left(n \cdot \left(2 \cdot \left(t + \frac{\ell \cdot t\_1}{Om}\right)\right)\right)}\\
\mathbf{elif}\;\ell \leq 10^{+173}:\\
\;\;\;\;\sqrt{n \cdot \left(U \cdot \left(2 \cdot \left(t + \frac{\frac{U* - U}{\frac{\frac{Om}{\ell}}{n}} + \ell \cdot -2}{\frac{Om}{\ell}}\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{2 \cdot \left(\left(U \cdot \ell\right) \cdot \left(n \cdot t\_1\right)\right)}{Om}}\\
\end{array}
\end{array}
if l < 2.25e-11Initial program 52.4%
Simplified58.2%
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr63.5%
+-commutativeN/A
distribute-rgt-inN/A
associate-/r/N/A
associate-*l*N/A
*-commutativeN/A
fma-defineN/A
fma-lowering-fma.f64N/A
Applied egg-rr61.9%
Taylor expanded in U around 0
distribute-lft-outN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6458.4%
Simplified58.4%
if 2.25e-11 < l < 1e173Initial program 58.7%
Simplified64.2%
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr73.2%
if 1e173 < l Initial program 5.9%
Simplified43.0%
Taylor expanded in U* around inf
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6443.3%
Simplified43.3%
Taylor expanded in t around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6441.5%
Simplified41.5%
Taylor expanded in U around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6462.9%
Simplified62.9%
Final simplification60.7%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (+ (* l -2.0) (* U* (/ (* l n) Om)))))
(if (<= l 2.2e+104)
(sqrt (* U (* n (* 2.0 (+ t (/ (* l t_1) Om))))))
(sqrt (/ (* 2.0 (* (* U l) (* n t_1))) Om)))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (l * -2.0) + (U_42_ * ((l * n) / Om));
double tmp;
if (l <= 2.2e+104) {
tmp = sqrt((U * (n * (2.0 * (t + ((l * t_1) / Om))))));
} else {
tmp = sqrt(((2.0 * ((U * l) * (n * t_1))) / 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 = (l * (-2.0d0)) + (u_42 * ((l * n) / om))
if (l <= 2.2d+104) then
tmp = sqrt((u * (n * (2.0d0 * (t + ((l * t_1) / om))))))
else
tmp = sqrt(((2.0d0 * ((u * l) * (n * t_1))) / 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 = (l * -2.0) + (U_42_ * ((l * n) / Om));
double tmp;
if (l <= 2.2e+104) {
tmp = Math.sqrt((U * (n * (2.0 * (t + ((l * t_1) / Om))))));
} else {
tmp = Math.sqrt(((2.0 * ((U * l) * (n * t_1))) / Om));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = (l * -2.0) + (U_42_ * ((l * n) / Om)) tmp = 0 if l <= 2.2e+104: tmp = math.sqrt((U * (n * (2.0 * (t + ((l * t_1) / Om)))))) else: tmp = math.sqrt(((2.0 * ((U * l) * (n * t_1))) / Om)) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(Float64(l * -2.0) + Float64(U_42_ * Float64(Float64(l * n) / Om))) tmp = 0.0 if (l <= 2.2e+104) tmp = sqrt(Float64(U * Float64(n * Float64(2.0 * Float64(t + Float64(Float64(l * t_1) / Om)))))); else tmp = sqrt(Float64(Float64(2.0 * Float64(Float64(U * l) * Float64(n * t_1))) / Om)); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = (l * -2.0) + (U_42_ * ((l * n) / Om)); tmp = 0.0; if (l <= 2.2e+104) tmp = sqrt((U * (n * (2.0 * (t + ((l * t_1) / Om)))))); else tmp = sqrt(((2.0 * ((U * l) * (n * t_1))) / Om)); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(l * -2.0), $MachinePrecision] + N[(U$42$ * N[(N[(l * n), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, 2.2e+104], N[Sqrt[N[(U * N[(n * N[(2.0 * N[(t + N[(N[(l * t$95$1), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(2.0 * N[(N[(U * l), $MachinePrecision] * N[(n * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \ell \cdot -2 + U* \cdot \frac{\ell \cdot n}{Om}\\
\mathbf{if}\;\ell \leq 2.2 \cdot 10^{+104}:\\
\;\;\;\;\sqrt{U \cdot \left(n \cdot \left(2 \cdot \left(t + \frac{\ell \cdot t\_1}{Om}\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{2 \cdot \left(\left(U \cdot \ell\right) \cdot \left(n \cdot t\_1\right)\right)}{Om}}\\
\end{array}
\end{array}
if l < 2.2e104Initial program 53.8%
Simplified58.8%
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr64.8%
+-commutativeN/A
distribute-rgt-inN/A
associate-/r/N/A
associate-*l*N/A
*-commutativeN/A
fma-defineN/A
fma-lowering-fma.f64N/A
Applied egg-rr63.4%
Taylor expanded in U around 0
distribute-lft-outN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6460.3%
Simplified60.3%
if 2.2e104 < l Initial program 11.4%
Simplified47.5%
Taylor expanded in U* around inf
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6447.8%
Simplified47.8%
Taylor expanded in t around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6443.5%
Simplified43.5%
Taylor expanded in U around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6461.0%
Simplified61.0%
Final simplification60.4%
(FPCore (n U t l Om U*)
:precision binary64
(if (<= l 1.35e+219)
(sqrt
(*
2.0
(* (+ t (* (/ l Om) (+ (* l -2.0) (* U* (/ n (/ Om l)))))) (* U n))))
(sqrt
(/ (* 2.0 (* (* U l) (* n (+ (* l -2.0) (* U* (/ (* l n) Om)))))) Om))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 1.35e+219) {
tmp = sqrt((2.0 * ((t + ((l / Om) * ((l * -2.0) + (U_42_ * (n / (Om / l)))))) * (U * n))));
} else {
tmp = sqrt(((2.0 * ((U * l) * (n * ((l * -2.0) + (U_42_ * ((l * n) / Om)))))) / 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.35d+219) then
tmp = sqrt((2.0d0 * ((t + ((l / om) * ((l * (-2.0d0)) + (u_42 * (n / (om / l)))))) * (u * n))))
else
tmp = sqrt(((2.0d0 * ((u * l) * (n * ((l * (-2.0d0)) + (u_42 * ((l * n) / om)))))) / 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.35e+219) {
tmp = Math.sqrt((2.0 * ((t + ((l / Om) * ((l * -2.0) + (U_42_ * (n / (Om / l)))))) * (U * n))));
} else {
tmp = Math.sqrt(((2.0 * ((U * l) * (n * ((l * -2.0) + (U_42_ * ((l * n) / Om)))))) / Om));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 1.35e+219: tmp = math.sqrt((2.0 * ((t + ((l / Om) * ((l * -2.0) + (U_42_ * (n / (Om / l)))))) * (U * n)))) else: tmp = math.sqrt(((2.0 * ((U * l) * (n * ((l * -2.0) + (U_42_ * ((l * n) / Om)))))) / Om)) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 1.35e+219) tmp = sqrt(Float64(2.0 * Float64(Float64(t + Float64(Float64(l / Om) * Float64(Float64(l * -2.0) + Float64(U_42_ * Float64(n / Float64(Om / l)))))) * Float64(U * n)))); else tmp = sqrt(Float64(Float64(2.0 * Float64(Float64(U * l) * Float64(n * Float64(Float64(l * -2.0) + Float64(U_42_ * Float64(Float64(l * n) / Om)))))) / Om)); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 1.35e+219) tmp = sqrt((2.0 * ((t + ((l / Om) * ((l * -2.0) + (U_42_ * (n / (Om / l)))))) * (U * n)))); else tmp = sqrt(((2.0 * ((U * l) * (n * ((l * -2.0) + (U_42_ * ((l * n) / Om)))))) / Om)); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 1.35e+219], N[Sqrt[N[(2.0 * N[(N[(t + N[(N[(l / Om), $MachinePrecision] * N[(N[(l * -2.0), $MachinePrecision] + N[(U$42$ * N[(n / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(U * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(2.0 * N[(N[(U * l), $MachinePrecision] * N[(n * N[(N[(l * -2.0), $MachinePrecision] + N[(U$42$ * N[(N[(l * n), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 1.35 \cdot 10^{+219}:\\
\;\;\;\;\sqrt{2 \cdot \left(\left(t + \frac{\ell}{Om} \cdot \left(\ell \cdot -2 + U* \cdot \frac{n}{\frac{Om}{\ell}}\right)\right) \cdot \left(U \cdot n\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{2 \cdot \left(\left(U \cdot \ell\right) \cdot \left(n \cdot \left(\ell \cdot -2 + U* \cdot \frac{\ell \cdot n}{Om}\right)\right)\right)}{Om}}\\
\end{array}
\end{array}
if l < 1.3499999999999999e219Initial program 51.8%
Simplified58.2%
Taylor expanded in U* around inf
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6458.2%
Simplified58.2%
*-commutativeN/A
*-lowering-*.f64N/A
associate-/l*N/A
*-commutativeN/A
associate-/r/N/A
/-lowering-/.f64N/A
/-lowering-/.f6459.8%
Applied egg-rr59.8%
if 1.3499999999999999e219 < l Initial program 7.1%
Simplified47.0%
Taylor expanded in U* around inf
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6447.4%
Simplified47.4%
Taylor expanded in t around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6449.1%
Simplified49.1%
Taylor expanded in U around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6468.2%
Simplified68.2%
Final simplification60.5%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (+ (* l -2.0) (* U* (/ (* l n) Om)))))
(if (<= l 1e+90)
(sqrt (* 2.0 (* (* U n) (+ t (* t_1 (/ l Om))))))
(sqrt (/ (* 2.0 (* (* U l) (* n t_1))) Om)))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (l * -2.0) + (U_42_ * ((l * n) / Om));
double tmp;
if (l <= 1e+90) {
tmp = sqrt((2.0 * ((U * n) * (t + (t_1 * (l / Om))))));
} else {
tmp = sqrt(((2.0 * ((U * l) * (n * t_1))) / 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 = (l * (-2.0d0)) + (u_42 * ((l * n) / om))
if (l <= 1d+90) then
tmp = sqrt((2.0d0 * ((u * n) * (t + (t_1 * (l / om))))))
else
tmp = sqrt(((2.0d0 * ((u * l) * (n * t_1))) / 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 = (l * -2.0) + (U_42_ * ((l * n) / Om));
double tmp;
if (l <= 1e+90) {
tmp = Math.sqrt((2.0 * ((U * n) * (t + (t_1 * (l / Om))))));
} else {
tmp = Math.sqrt(((2.0 * ((U * l) * (n * t_1))) / Om));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = (l * -2.0) + (U_42_ * ((l * n) / Om)) tmp = 0 if l <= 1e+90: tmp = math.sqrt((2.0 * ((U * n) * (t + (t_1 * (l / Om)))))) else: tmp = math.sqrt(((2.0 * ((U * l) * (n * t_1))) / Om)) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(Float64(l * -2.0) + Float64(U_42_ * Float64(Float64(l * n) / Om))) tmp = 0.0 if (l <= 1e+90) tmp = sqrt(Float64(2.0 * Float64(Float64(U * n) * Float64(t + Float64(t_1 * Float64(l / Om)))))); else tmp = sqrt(Float64(Float64(2.0 * Float64(Float64(U * l) * Float64(n * t_1))) / Om)); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = (l * -2.0) + (U_42_ * ((l * n) / Om)); tmp = 0.0; if (l <= 1e+90) tmp = sqrt((2.0 * ((U * n) * (t + (t_1 * (l / Om)))))); else tmp = sqrt(((2.0 * ((U * l) * (n * t_1))) / Om)); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(l * -2.0), $MachinePrecision] + N[(U$42$ * N[(N[(l * n), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, 1e+90], N[Sqrt[N[(2.0 * N[(N[(U * n), $MachinePrecision] * N[(t + N[(t$95$1 * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(2.0 * N[(N[(U * l), $MachinePrecision] * N[(n * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \ell \cdot -2 + U* \cdot \frac{\ell \cdot n}{Om}\\
\mathbf{if}\;\ell \leq 10^{+90}:\\
\;\;\;\;\sqrt{2 \cdot \left(\left(U \cdot n\right) \cdot \left(t + t\_1 \cdot \frac{\ell}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{2 \cdot \left(\left(U \cdot \ell\right) \cdot \left(n \cdot t\_1\right)\right)}{Om}}\\
\end{array}
\end{array}
if l < 9.99999999999999966e89Initial program 53.8%
Simplified58.9%
Taylor expanded in U* around inf
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6458.9%
Simplified58.9%
if 9.99999999999999966e89 < l Initial program 15.8%
Simplified48.0%
Taylor expanded in U* around inf
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6448.2%
Simplified48.2%
Taylor expanded in t around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6449.2%
Simplified49.2%
Taylor expanded in U around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6464.7%
Simplified64.7%
Final simplification59.7%
(FPCore (n U t l Om U*)
:precision binary64
(if (<= l 5.5e+71)
(sqrt (* (* U 2.0) (* n (- t (* 2.0 (/ (* l l) Om))))))
(sqrt
(/ (* 2.0 (* (* U l) (* n (+ (* l -2.0) (* U* (/ (* l n) Om)))))) Om))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 5.5e+71) {
tmp = sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om))))));
} else {
tmp = sqrt(((2.0 * ((U * l) * (n * ((l * -2.0) + (U_42_ * ((l * n) / Om)))))) / 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 <= 5.5d+71) then
tmp = sqrt(((u * 2.0d0) * (n * (t - (2.0d0 * ((l * l) / om))))))
else
tmp = sqrt(((2.0d0 * ((u * l) * (n * ((l * (-2.0d0)) + (u_42 * ((l * n) / om)))))) / 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 <= 5.5e+71) {
tmp = Math.sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om))))));
} else {
tmp = Math.sqrt(((2.0 * ((U * l) * (n * ((l * -2.0) + (U_42_ * ((l * n) / Om)))))) / Om));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 5.5e+71: tmp = math.sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om)))))) else: tmp = math.sqrt(((2.0 * ((U * l) * (n * ((l * -2.0) + (U_42_ * ((l * n) / Om)))))) / Om)) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 5.5e+71) tmp = sqrt(Float64(Float64(U * 2.0) * Float64(n * Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om)))))); else tmp = sqrt(Float64(Float64(2.0 * Float64(Float64(U * l) * Float64(n * Float64(Float64(l * -2.0) + Float64(U_42_ * Float64(Float64(l * n) / Om)))))) / Om)); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 5.5e+71) tmp = sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om)))))); else tmp = sqrt(((2.0 * ((U * l) * (n * ((l * -2.0) + (U_42_ * ((l * n) / Om)))))) / Om)); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 5.5e+71], N[Sqrt[N[(N[(U * 2.0), $MachinePrecision] * N[(n * N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(2.0 * N[(N[(U * l), $MachinePrecision] * N[(n * N[(N[(l * -2.0), $MachinePrecision] + N[(U$42$ * N[(N[(l * n), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 5.5 \cdot 10^{+71}:\\
\;\;\;\;\sqrt{\left(U \cdot 2\right) \cdot \left(n \cdot \left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{2 \cdot \left(\left(U \cdot \ell\right) \cdot \left(n \cdot \left(\ell \cdot -2 + U* \cdot \frac{\ell \cdot n}{Om}\right)\right)\right)}{Om}}\\
\end{array}
\end{array}
if l < 5.5e71Initial program 53.2%
Simplified58.5%
Taylor expanded in n around 0
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
cancel-sign-sub-invN/A
--lowering--.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6451.1%
Simplified51.1%
if 5.5e71 < l Initial program 24.9%
Simplified52.0%
Taylor expanded in U* around inf
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6452.2%
Simplified52.2%
Taylor expanded in t around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6450.8%
Simplified50.8%
Taylor expanded in U around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6463.9%
Simplified63.9%
Final simplification53.3%
(FPCore (n U t l Om U*)
:precision binary64
(if (<= l 1.25e+65)
(sqrt (* (* U 2.0) (* n (- t (* 2.0 (/ (* l l) Om))))))
(sqrt
(* (* U 2.0) (/ (* (* l n) (+ (* l -2.0) (/ (* U* (* l n)) Om))) Om)))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 1.25e+65) {
tmp = sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om))))));
} else {
tmp = sqrt(((U * 2.0) * (((l * n) * ((l * -2.0) + ((U_42_ * (l * n)) / Om))) / 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+65) then
tmp = sqrt(((u * 2.0d0) * (n * (t - (2.0d0 * ((l * l) / om))))))
else
tmp = sqrt(((u * 2.0d0) * (((l * n) * ((l * (-2.0d0)) + ((u_42 * (l * n)) / om))) / 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+65) {
tmp = Math.sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om))))));
} else {
tmp = Math.sqrt(((U * 2.0) * (((l * n) * ((l * -2.0) + ((U_42_ * (l * n)) / Om))) / Om)));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 1.25e+65: tmp = math.sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om)))))) else: tmp = math.sqrt(((U * 2.0) * (((l * n) * ((l * -2.0) + ((U_42_ * (l * n)) / Om))) / Om))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 1.25e+65) tmp = sqrt(Float64(Float64(U * 2.0) * Float64(n * Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om)))))); else tmp = sqrt(Float64(Float64(U * 2.0) * Float64(Float64(Float64(l * n) * Float64(Float64(l * -2.0) + Float64(Float64(U_42_ * Float64(l * n)) / Om))) / Om))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 1.25e+65) tmp = sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om)))))); else tmp = sqrt(((U * 2.0) * (((l * n) * ((l * -2.0) + ((U_42_ * (l * n)) / Om))) / Om))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 1.25e+65], N[Sqrt[N[(N[(U * 2.0), $MachinePrecision] * N[(n * N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(U * 2.0), $MachinePrecision] * N[(N[(N[(l * n), $MachinePrecision] * N[(N[(l * -2.0), $MachinePrecision] + N[(N[(U$42$ * N[(l * n), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 1.25 \cdot 10^{+65}:\\
\;\;\;\;\sqrt{\left(U \cdot 2\right) \cdot \left(n \cdot \left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(U \cdot 2\right) \cdot \frac{\left(\ell \cdot n\right) \cdot \left(\ell \cdot -2 + \frac{U* \cdot \left(\ell \cdot n\right)}{Om}\right)}{Om}}\\
\end{array}
\end{array}
if l < 1.24999999999999993e65Initial program 53.4%
Simplified58.7%
Taylor expanded in n around 0
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
cancel-sign-sub-invN/A
--lowering--.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6451.3%
Simplified51.3%
if 1.24999999999999993e65 < l Initial program 24.5%
Simplified51.0%
Taylor expanded in U* around inf
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6451.2%
Simplified51.2%
Taylor expanded in t around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6449.9%
Simplified49.9%
associate-*r*N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6447.8%
Applied egg-rr47.8%
Final simplification50.7%
(FPCore (n U t l Om U*)
:precision binary64
(sqrt
(*
U
(*
n
(* 2.0 (+ t (/ (+ (/ (- U* U) (/ (/ Om l) n)) (* l -2.0)) (/ Om l))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return sqrt((U * (n * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l)))))));
}
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((u * (n * (2.0d0 * (t + ((((u_42 - u) / ((om / l) / n)) + (l * (-2.0d0))) / (om / l)))))))
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.sqrt((U * (n * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l)))))));
}
def code(n, U, t, l, Om, U_42_): return math.sqrt((U * (n * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l)))))))
function code(n, U, t, l, Om, U_42_) return sqrt(Float64(U * Float64(n * Float64(2.0 * Float64(t + Float64(Float64(Float64(Float64(U_42_ - U) / Float64(Float64(Om / l) / n)) + Float64(l * -2.0)) / Float64(Om / l))))))) end
function tmp = code(n, U, t, l, Om, U_42_) tmp = sqrt((U * (n * (2.0 * (t + ((((U_42_ - U) / ((Om / l) / n)) + (l * -2.0)) / (Om / l))))))); end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Sqrt[N[(U * N[(n * N[(2.0 * N[(t + N[(N[(N[(N[(U$42$ - U), $MachinePrecision] / N[(N[(Om / l), $MachinePrecision] / n), $MachinePrecision]), $MachinePrecision] + N[(l * -2.0), $MachinePrecision]), $MachinePrecision] / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{U \cdot \left(n \cdot \left(2 \cdot \left(t + \frac{\frac{U* - U}{\frac{\frac{Om}{\ell}}{n}} + \ell \cdot -2}{\frac{Om}{\ell}}\right)\right)\right)}
\end{array}
Initial program 48.3%
Simplified57.3%
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr63.5%
Final simplification63.5%
(FPCore (n U t l Om U*) :precision binary64 (if (<= l 6200000000.0) (sqrt (* U (+ (* 2.0 (* t n)) (* -4.0 (/ (* n (* l l)) Om))))) (sqrt (* (* l (* l (* n (+ -2.0 (* U* (/ n Om)))))) (/ (* U 2.0) Om)))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 6200000000.0) {
tmp = sqrt((U * ((2.0 * (t * n)) + (-4.0 * ((n * (l * l)) / Om)))));
} else {
tmp = sqrt(((l * (l * (n * (-2.0 + (U_42_ * (n / Om)))))) * ((U * 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 <= 6200000000.0d0) then
tmp = sqrt((u * ((2.0d0 * (t * n)) + ((-4.0d0) * ((n * (l * l)) / om)))))
else
tmp = sqrt(((l * (l * (n * ((-2.0d0) + (u_42 * (n / om)))))) * ((u * 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 <= 6200000000.0) {
tmp = Math.sqrt((U * ((2.0 * (t * n)) + (-4.0 * ((n * (l * l)) / Om)))));
} else {
tmp = Math.sqrt(((l * (l * (n * (-2.0 + (U_42_ * (n / Om)))))) * ((U * 2.0) / Om)));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 6200000000.0: tmp = math.sqrt((U * ((2.0 * (t * n)) + (-4.0 * ((n * (l * l)) / Om))))) else: tmp = math.sqrt(((l * (l * (n * (-2.0 + (U_42_ * (n / Om)))))) * ((U * 2.0) / Om))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 6200000000.0) tmp = sqrt(Float64(U * Float64(Float64(2.0 * Float64(t * n)) + Float64(-4.0 * Float64(Float64(n * Float64(l * l)) / Om))))); else tmp = sqrt(Float64(Float64(l * Float64(l * Float64(n * Float64(-2.0 + Float64(U_42_ * Float64(n / Om)))))) * Float64(Float64(U * 2.0) / Om))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 6200000000.0) tmp = sqrt((U * ((2.0 * (t * n)) + (-4.0 * ((n * (l * l)) / Om))))); else tmp = sqrt(((l * (l * (n * (-2.0 + (U_42_ * (n / Om)))))) * ((U * 2.0) / Om))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 6200000000.0], N[Sqrt[N[(U * N[(N[(2.0 * N[(t * n), $MachinePrecision]), $MachinePrecision] + N[(-4.0 * N[(N[(n * N[(l * l), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(l * N[(l * N[(n * N[(-2.0 + N[(U$42$ * N[(n / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(U * 2.0), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 6200000000:\\
\;\;\;\;\sqrt{U \cdot \left(2 \cdot \left(t \cdot n\right) + -4 \cdot \frac{n \cdot \left(\ell \cdot \ell\right)}{Om}\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(\ell \cdot \left(\ell \cdot \left(n \cdot \left(-2 + U* \cdot \frac{n}{Om}\right)\right)\right)\right) \cdot \frac{U \cdot 2}{Om}}\\
\end{array}
\end{array}
if l < 6.2e9Initial program 52.7%
Simplified58.4%
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr63.6%
Taylor expanded in Om around inf
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6450.5%
Simplified50.5%
if 6.2e9 < l Initial program 32.7%
Simplified53.7%
Taylor expanded in U* around inf
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6453.9%
Simplified53.9%
Taylor expanded in t around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6450.9%
Simplified50.9%
Taylor expanded in l around 0
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
sub-negN/A
metadata-evalN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6444.0%
Simplified44.0%
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6449.2%
Applied egg-rr49.2%
Final simplification50.2%
(FPCore (n U t l Om U*) :precision binary64 (if (<= l 1.12e+194) (sqrt (* (* U 2.0) (* n (- t (* 2.0 (/ (* l l) Om)))))) (sqrt (/ (* (* U 2.0) (/ (* (* U* (* l l)) (* n n)) Om)) Om))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 1.12e+194) {
tmp = sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om))))));
} else {
tmp = sqrt((((U * 2.0) * (((U_42_ * (l * l)) * (n * n)) / Om)) / 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.12d+194) then
tmp = sqrt(((u * 2.0d0) * (n * (t - (2.0d0 * ((l * l) / om))))))
else
tmp = sqrt((((u * 2.0d0) * (((u_42 * (l * l)) * (n * n)) / om)) / 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.12e+194) {
tmp = Math.sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om))))));
} else {
tmp = Math.sqrt((((U * 2.0) * (((U_42_ * (l * l)) * (n * n)) / Om)) / Om));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 1.12e+194: tmp = math.sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om)))))) else: tmp = math.sqrt((((U * 2.0) * (((U_42_ * (l * l)) * (n * n)) / Om)) / Om)) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 1.12e+194) tmp = sqrt(Float64(Float64(U * 2.0) * Float64(n * Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om)))))); else tmp = sqrt(Float64(Float64(Float64(U * 2.0) * Float64(Float64(Float64(U_42_ * Float64(l * l)) * Float64(n * n)) / Om)) / Om)); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 1.12e+194) tmp = sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om)))))); else tmp = sqrt((((U * 2.0) * (((U_42_ * (l * l)) * (n * n)) / Om)) / Om)); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 1.12e+194], N[Sqrt[N[(N[(U * 2.0), $MachinePrecision] * N[(n * N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(N[(U * 2.0), $MachinePrecision] * N[(N[(N[(U$42$ * N[(l * l), $MachinePrecision]), $MachinePrecision] * N[(n * n), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 1.12 \cdot 10^{+194}:\\
\;\;\;\;\sqrt{\left(U \cdot 2\right) \cdot \left(n \cdot \left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{\left(U \cdot 2\right) \cdot \frac{\left(U* \cdot \left(\ell \cdot \ell\right)\right) \cdot \left(n \cdot n\right)}{Om}}{Om}}\\
\end{array}
\end{array}
if l < 1.11999999999999994e194Initial program 52.9%
Simplified58.6%
Taylor expanded in n around 0
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
cancel-sign-sub-invN/A
--lowering--.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6450.5%
Simplified50.5%
if 1.11999999999999994e194 < l Initial program 6.0%
Simplified46.0%
Taylor expanded in U* around inf
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6446.4%
Simplified46.4%
Taylor expanded in t around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6440.5%
Simplified40.5%
Taylor expanded in l around 0
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
sub-negN/A
metadata-evalN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6432.4%
Simplified32.4%
Taylor expanded in n around inf
/-lowering-/.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6423.1%
Simplified23.1%
Final simplification47.9%
(FPCore (n U t l Om U*) :precision binary64 (if (<= l 9.4e+172) (sqrt (* (* U 2.0) (* n (- t (* 2.0 (/ (* l l) Om)))))) (sqrt (* U (* n (/ (* 2.0 (* U* (* n (* l l)))) (* Om Om)))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 9.4e+172) {
tmp = sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om))))));
} else {
tmp = sqrt((U * (n * ((2.0 * (U_42_ * (n * (l * l)))) / (Om * 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 <= 9.4d+172) then
tmp = sqrt(((u * 2.0d0) * (n * (t - (2.0d0 * ((l * l) / om))))))
else
tmp = sqrt((u * (n * ((2.0d0 * (u_42 * (n * (l * l)))) / (om * 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 <= 9.4e+172) {
tmp = Math.sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om))))));
} else {
tmp = Math.sqrt((U * (n * ((2.0 * (U_42_ * (n * (l * l)))) / (Om * Om)))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 9.4e+172: tmp = math.sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om)))))) else: tmp = math.sqrt((U * (n * ((2.0 * (U_42_ * (n * (l * l)))) / (Om * Om))))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 9.4e+172) tmp = sqrt(Float64(Float64(U * 2.0) * Float64(n * Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om)))))); else tmp = sqrt(Float64(U * Float64(n * Float64(Float64(2.0 * Float64(U_42_ * Float64(n * Float64(l * l)))) / Float64(Om * Om))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 9.4e+172) tmp = sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om)))))); else tmp = sqrt((U * (n * ((2.0 * (U_42_ * (n * (l * l)))) / (Om * Om))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 9.4e+172], N[Sqrt[N[(N[(U * 2.0), $MachinePrecision] * N[(n * N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(U * N[(n * N[(N[(2.0 * N[(U$42$ * N[(n * N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(Om * Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 9.4 \cdot 10^{+172}:\\
\;\;\;\;\sqrt{\left(U \cdot 2\right) \cdot \left(n \cdot \left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{U \cdot \left(n \cdot \frac{2 \cdot \left(U* \cdot \left(n \cdot \left(\ell \cdot \ell\right)\right)\right)}{Om \cdot Om}\right)}\\
\end{array}
\end{array}
if l < 9.4000000000000003e172Initial program 53.3%
Simplified59.0%
Taylor expanded in n around 0
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
cancel-sign-sub-invN/A
--lowering--.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6450.9%
Simplified50.9%
if 9.4000000000000003e172 < l Initial program 5.9%
Simplified43.0%
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr51.5%
Taylor expanded in U* around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6425.5%
Simplified25.5%
Final simplification48.2%
(FPCore (n U t l Om U*) :precision binary64 (if (<= l 7.8e+181) (sqrt (* (* U 2.0) (* n (- t (* 2.0 (/ (* l l) Om)))))) (sqrt (* (* U (* 2.0 n)) (/ (* U* (* n (* l l))) (* Om Om))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 7.8e+181) {
tmp = sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om))))));
} else {
tmp = sqrt(((U * (2.0 * n)) * ((U_42_ * (n * (l * l))) / (Om * 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 <= 7.8d+181) then
tmp = sqrt(((u * 2.0d0) * (n * (t - (2.0d0 * ((l * l) / om))))))
else
tmp = sqrt(((u * (2.0d0 * n)) * ((u_42 * (n * (l * l))) / (om * 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 <= 7.8e+181) {
tmp = Math.sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om))))));
} else {
tmp = Math.sqrt(((U * (2.0 * n)) * ((U_42_ * (n * (l * l))) / (Om * Om))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 7.8e+181: tmp = math.sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om)))))) else: tmp = math.sqrt(((U * (2.0 * n)) * ((U_42_ * (n * (l * l))) / (Om * Om)))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 7.8e+181) tmp = sqrt(Float64(Float64(U * 2.0) * Float64(n * Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om)))))); else tmp = sqrt(Float64(Float64(U * Float64(2.0 * n)) * Float64(Float64(U_42_ * Float64(n * Float64(l * l))) / Float64(Om * Om)))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 7.8e+181) tmp = sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om)))))); else tmp = sqrt(((U * (2.0 * n)) * ((U_42_ * (n * (l * l))) / (Om * Om)))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 7.8e+181], N[Sqrt[N[(N[(U * 2.0), $MachinePrecision] * N[(n * N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(U * N[(2.0 * n), $MachinePrecision]), $MachinePrecision] * N[(N[(U$42$ * N[(n * N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(Om * Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 7.8 \cdot 10^{+181}:\\
\;\;\;\;\sqrt{\left(U \cdot 2\right) \cdot \left(n \cdot \left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(U \cdot \left(2 \cdot n\right)\right) \cdot \frac{U* \cdot \left(n \cdot \left(\ell \cdot \ell\right)\right)}{Om \cdot Om}}\\
\end{array}
\end{array}
if l < 7.8e181Initial program 53.1%
Simplified58.8%
Taylor expanded in n around 0
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
cancel-sign-sub-invN/A
--lowering--.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6450.7%
Simplified50.7%
if 7.8e181 < l Initial program 6.1%
Taylor expanded in U* around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6424.8%
Simplified24.8%
Final simplification48.1%
(FPCore (n U t l Om U*) :precision binary64 (if (<= t 4.1e+34) (sqrt (* (* U 2.0) (* n (- t (* 2.0 (/ (* l l) Om)))))) (pow (* 2.0 (* U (* t n))) 0.5)))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (t <= 4.1e+34) {
tmp = sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om))))));
} else {
tmp = pow((2.0 * (U * (t * n))), 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 (t <= 4.1d+34) then
tmp = sqrt(((u * 2.0d0) * (n * (t - (2.0d0 * ((l * l) / om))))))
else
tmp = (2.0d0 * (u * (t * n))) ** 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 (t <= 4.1e+34) {
tmp = Math.sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om))))));
} else {
tmp = Math.pow((2.0 * (U * (t * n))), 0.5);
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if t <= 4.1e+34: tmp = math.sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om)))))) else: tmp = math.pow((2.0 * (U * (t * n))), 0.5) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (t <= 4.1e+34) tmp = sqrt(Float64(Float64(U * 2.0) * Float64(n * Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om)))))); else tmp = Float64(2.0 * Float64(U * Float64(t * n))) ^ 0.5; end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (t <= 4.1e+34) tmp = sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om)))))); else tmp = (2.0 * (U * (t * n))) ^ 0.5; end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[t, 4.1e+34], N[Sqrt[N[(N[(U * 2.0), $MachinePrecision] * N[(n * N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Power[N[(2.0 * N[(U * N[(t * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;t \leq 4.1 \cdot 10^{+34}:\\
\;\;\;\;\sqrt{\left(U \cdot 2\right) \cdot \left(n \cdot \left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;{\left(2 \cdot \left(U \cdot \left(t \cdot n\right)\right)\right)}^{0.5}\\
\end{array}
\end{array}
if t < 4.0999999999999998e34Initial program 53.8%
Simplified61.3%
Taylor expanded in n around 0
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
cancel-sign-sub-invN/A
--lowering--.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6451.3%
Simplified51.3%
if 4.0999999999999998e34 < t Initial program 31.3%
Simplified45.2%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6437.2%
Simplified37.2%
pow1/2N/A
pow-lowering-pow.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6438.9%
Applied egg-rr38.9%
Final simplification48.2%
(FPCore (n U t l Om U*) :precision binary64 (if (<= l 1.1e+29) (pow (* 2.0 (* U (* t n))) 0.5) (sqrt (/ (* -4.0 (* U (* n (* l l)))) Om))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 1.1e+29) {
tmp = pow((2.0 * (U * (t * n))), 0.5);
} else {
tmp = sqrt(((-4.0 * (U * (n * (l * l)))) / 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.1d+29) then
tmp = (2.0d0 * (u * (t * n))) ** 0.5d0
else
tmp = sqrt((((-4.0d0) * (u * (n * (l * l)))) / 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.1e+29) {
tmp = Math.pow((2.0 * (U * (t * n))), 0.5);
} else {
tmp = Math.sqrt(((-4.0 * (U * (n * (l * l)))) / Om));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 1.1e+29: tmp = math.pow((2.0 * (U * (t * n))), 0.5) else: tmp = math.sqrt(((-4.0 * (U * (n * (l * l)))) / Om)) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 1.1e+29) tmp = Float64(2.0 * Float64(U * Float64(t * n))) ^ 0.5; else tmp = sqrt(Float64(Float64(-4.0 * Float64(U * Float64(n * Float64(l * l)))) / Om)); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 1.1e+29) tmp = (2.0 * (U * (t * n))) ^ 0.5; else tmp = sqrt(((-4.0 * (U * (n * (l * l)))) / Om)); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 1.1e+29], N[Power[N[(2.0 * N[(U * N[(t * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[Sqrt[N[(N[(-4.0 * N[(U * N[(n * N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 1.1 \cdot 10^{+29}:\\
\;\;\;\;{\left(2 \cdot \left(U \cdot \left(t \cdot n\right)\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{-4 \cdot \left(U \cdot \left(n \cdot \left(\ell \cdot \ell\right)\right)\right)}{Om}}\\
\end{array}
\end{array}
if l < 1.1000000000000001e29Initial program 52.9%
Simplified58.4%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6445.0%
Simplified45.0%
pow1/2N/A
pow-lowering-pow.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6445.6%
Applied egg-rr45.6%
if 1.1000000000000001e29 < l Initial program 29.6%
Simplified53.0%
Taylor expanded in U* around inf
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6453.2%
Simplified53.2%
Taylor expanded in t around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6450.2%
Simplified50.2%
Taylor expanded in n around 0
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6422.7%
Simplified22.7%
Final simplification41.0%
(FPCore (n U t l Om U*) :precision binary64 (pow (* 2.0 (* U (* t n))) 0.5))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return pow((2.0 * (U * (t * n))), 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 * (u * (t * n))) ** 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 * (U * (t * n))), 0.5);
}
def code(n, U, t, l, Om, U_42_): return math.pow((2.0 * (U * (t * n))), 0.5)
function code(n, U, t, l, Om, U_42_) return Float64(2.0 * Float64(U * Float64(t * n))) ^ 0.5 end
function tmp = code(n, U, t, l, Om, U_42_) tmp = (2.0 * (U * (t * n))) ^ 0.5; end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Power[N[(2.0 * N[(U * N[(t * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]
\begin{array}{l}
\\
{\left(2 \cdot \left(U \cdot \left(t \cdot n\right)\right)\right)}^{0.5}
\end{array}
Initial program 48.3%
Simplified57.3%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6438.8%
Simplified38.8%
pow1/2N/A
pow-lowering-pow.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6440.0%
Applied egg-rr40.0%
(FPCore (n U t l Om U*) :precision binary64 (sqrt (* (* U 2.0) (* t n))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return sqrt(((U * 2.0) * (t * n)));
}
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(((u * 2.0d0) * (t * n)))
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.sqrt(((U * 2.0) * (t * n)));
}
def code(n, U, t, l, Om, U_42_): return math.sqrt(((U * 2.0) * (t * n)))
function code(n, U, t, l, Om, U_42_) return sqrt(Float64(Float64(U * 2.0) * Float64(t * n))) end
function tmp = code(n, U, t, l, Om, U_42_) tmp = sqrt(((U * 2.0) * (t * n))); end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Sqrt[N[(N[(U * 2.0), $MachinePrecision] * N[(t * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\left(U \cdot 2\right) \cdot \left(t \cdot n\right)}
\end{array}
Initial program 48.3%
Simplified57.3%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6438.8%
Simplified38.8%
Final simplification38.8%
herbie shell --seed 2024144
(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*))))))