
(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 16 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 (+ (/ (- U* U) (/ Om (* n l))) (* l -2.0))))
(if (<= U -2e-310)
(sqrt (+ (* U (* t_1 (* (/ l Om) (* n 2.0)))) (* U (* 2.0 (* n t)))))
(* (sqrt (* (* n 2.0) (+ t (/ t_1 (/ Om l))))) (sqrt U)))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = ((U_42_ - U) / (Om / (n * l))) + (l * -2.0);
double tmp;
if (U <= -2e-310) {
tmp = sqrt(((U * (t_1 * ((l / Om) * (n * 2.0)))) + (U * (2.0 * (n * t)))));
} else {
tmp = sqrt(((n * 2.0) * (t + (t_1 / (Om / l))))) * sqrt(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 = ((u_42 - u) / (om / (n * l))) + (l * (-2.0d0))
if (u <= (-2d-310)) then
tmp = sqrt(((u * (t_1 * ((l / om) * (n * 2.0d0)))) + (u * (2.0d0 * (n * t)))))
else
tmp = sqrt(((n * 2.0d0) * (t + (t_1 / (om / l))))) * sqrt(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 = ((U_42_ - U) / (Om / (n * l))) + (l * -2.0);
double tmp;
if (U <= -2e-310) {
tmp = Math.sqrt(((U * (t_1 * ((l / Om) * (n * 2.0)))) + (U * (2.0 * (n * t)))));
} else {
tmp = Math.sqrt(((n * 2.0) * (t + (t_1 / (Om / l))))) * Math.sqrt(U);
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = ((U_42_ - U) / (Om / (n * l))) + (l * -2.0) tmp = 0 if U <= -2e-310: tmp = math.sqrt(((U * (t_1 * ((l / Om) * (n * 2.0)))) + (U * (2.0 * (n * t))))) else: tmp = math.sqrt(((n * 2.0) * (t + (t_1 / (Om / l))))) * math.sqrt(U) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(Float64(Float64(U_42_ - U) / Float64(Om / Float64(n * l))) + Float64(l * -2.0)) tmp = 0.0 if (U <= -2e-310) tmp = sqrt(Float64(Float64(U * Float64(t_1 * Float64(Float64(l / Om) * Float64(n * 2.0)))) + Float64(U * Float64(2.0 * Float64(n * t))))); else tmp = Float64(sqrt(Float64(Float64(n * 2.0) * Float64(t + Float64(t_1 / Float64(Om / l))))) * sqrt(U)); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = ((U_42_ - U) / (Om / (n * l))) + (l * -2.0); tmp = 0.0; if (U <= -2e-310) tmp = sqrt(((U * (t_1 * ((l / Om) * (n * 2.0)))) + (U * (2.0 * (n * t))))); else tmp = sqrt(((n * 2.0) * (t + (t_1 / (Om / l))))) * sqrt(U); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(N[(U$42$ - U), $MachinePrecision] / N[(Om / N[(n * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(l * -2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[U, -2e-310], N[Sqrt[N[(N[(U * N[(t$95$1 * N[(N[(l / Om), $MachinePrecision] * N[(n * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(U * N[(2.0 * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(N[(n * 2.0), $MachinePrecision] * N[(t + N[(t$95$1 / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[U], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \frac{U* - U}{\frac{Om}{n \cdot \ell}} + \ell \cdot -2\\
\mathbf{if}\;U \leq -2 \cdot 10^{-310}:\\
\;\;\;\;\sqrt{U \cdot \left(t\_1 \cdot \left(\frac{\ell}{Om} \cdot \left(n \cdot 2\right)\right)\right) + U \cdot \left(2 \cdot \left(n \cdot t\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(n \cdot 2\right) \cdot \left(t + \frac{t\_1}{\frac{Om}{\ell}}\right)} \cdot \sqrt{U}\\
\end{array}
\end{array}
if U < -1.999999999999994e-310Initial program 42.0%
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sub-negN/A
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
Simplified51.6%
+-commutativeN/A
distribute-lft-inN/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
fma-defineN/A
fma-lowering-fma.f64N/A
Applied egg-rr56.9%
+-lowering-+.f64N/A
Applied egg-rr61.3%
if -1.999999999999994e-310 < U Initial program 52.4%
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sub-negN/A
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
Simplified57.4%
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
Applied egg-rr74.7%
Final simplification68.1%
(FPCore (n U t l Om U*)
:precision binary64
(if (<= n 6e+74)
(sqrt
(+
(*
U
(* (+ (/ (- U* U) (/ Om (* n l))) (* l -2.0)) (* (/ l Om) (* n 2.0))))
(* U (* 2.0 (* n t)))))
(*
(pow (* n 2.0) 0.5)
(sqrt (* U (+ t (* (+ -2.0 (/ n (/ Om (- U* U)))) (* l (/ l Om)))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (n <= 6e+74) {
tmp = sqrt(((U * ((((U_42_ - U) / (Om / (n * l))) + (l * -2.0)) * ((l / Om) * (n * 2.0)))) + (U * (2.0 * (n * t)))));
} else {
tmp = pow((n * 2.0), 0.5) * sqrt((U * (t + ((-2.0 + (n / (Om / (U_42_ - U)))) * (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 (n <= 6d+74) then
tmp = sqrt(((u * ((((u_42 - u) / (om / (n * l))) + (l * (-2.0d0))) * ((l / om) * (n * 2.0d0)))) + (u * (2.0d0 * (n * t)))))
else
tmp = ((n * 2.0d0) ** 0.5d0) * sqrt((u * (t + (((-2.0d0) + (n / (om / (u_42 - u)))) * (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 (n <= 6e+74) {
tmp = Math.sqrt(((U * ((((U_42_ - U) / (Om / (n * l))) + (l * -2.0)) * ((l / Om) * (n * 2.0)))) + (U * (2.0 * (n * t)))));
} else {
tmp = Math.pow((n * 2.0), 0.5) * Math.sqrt((U * (t + ((-2.0 + (n / (Om / (U_42_ - U)))) * (l * (l / Om))))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if n <= 6e+74: tmp = math.sqrt(((U * ((((U_42_ - U) / (Om / (n * l))) + (l * -2.0)) * ((l / Om) * (n * 2.0)))) + (U * (2.0 * (n * t))))) else: tmp = math.pow((n * 2.0), 0.5) * math.sqrt((U * (t + ((-2.0 + (n / (Om / (U_42_ - U)))) * (l * (l / Om)))))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (n <= 6e+74) tmp = sqrt(Float64(Float64(U * Float64(Float64(Float64(Float64(U_42_ - U) / Float64(Om / Float64(n * l))) + Float64(l * -2.0)) * Float64(Float64(l / Om) * Float64(n * 2.0)))) + Float64(U * Float64(2.0 * Float64(n * t))))); else tmp = Float64((Float64(n * 2.0) ^ 0.5) * sqrt(Float64(U * Float64(t + Float64(Float64(-2.0 + Float64(n / Float64(Om / Float64(U_42_ - U)))) * Float64(l * Float64(l / Om))))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (n <= 6e+74) tmp = sqrt(((U * ((((U_42_ - U) / (Om / (n * l))) + (l * -2.0)) * ((l / Om) * (n * 2.0)))) + (U * (2.0 * (n * t))))); else tmp = ((n * 2.0) ^ 0.5) * sqrt((U * (t + ((-2.0 + (n / (Om / (U_42_ - U)))) * (l * (l / Om)))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[n, 6e+74], N[Sqrt[N[(N[(U * N[(N[(N[(N[(U$42$ - U), $MachinePrecision] / N[(Om / N[(n * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(l * -2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(l / Om), $MachinePrecision] * N[(n * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(U * N[(2.0 * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Power[N[(n * 2.0), $MachinePrecision], 0.5], $MachinePrecision] * N[Sqrt[N[(U * N[(t + N[(N[(-2.0 + N[(n / N[(Om / N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;n \leq 6 \cdot 10^{+74}:\\
\;\;\;\;\sqrt{U \cdot \left(\left(\frac{U* - U}{\frac{Om}{n \cdot \ell}} + \ell \cdot -2\right) \cdot \left(\frac{\ell}{Om} \cdot \left(n \cdot 2\right)\right)\right) + U \cdot \left(2 \cdot \left(n \cdot t\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;{\left(n \cdot 2\right)}^{0.5} \cdot \sqrt{U \cdot \left(t + \left(-2 + \frac{n}{\frac{Om}{U* - U}}\right) \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right)}\\
\end{array}
\end{array}
if n < 6e74Initial program 45.2%
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sub-negN/A
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
Simplified52.4%
+-commutativeN/A
distribute-lft-inN/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
fma-defineN/A
fma-lowering-fma.f64N/A
Applied egg-rr61.6%
+-lowering-+.f64N/A
Applied egg-rr64.9%
if 6e74 < n Initial program 60.2%
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sub-negN/A
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
Simplified67.9%
+-commutativeN/A
distribute-lft-inN/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
fma-defineN/A
fma-lowering-fma.f64N/A
Applied egg-rr48.8%
+-lowering-+.f64N/A
Applied egg-rr46.1%
Applied egg-rr83.8%
Final simplification67.5%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1
(sqrt
(*
(* 2.0 (* U n))
(+ t (* (/ l Om) (+ (* l -2.0) (* n (* (- U* U) (/ l Om))))))))))
(if (<= n -2.6e-18)
t_1
(if (<= n 0.78)
(sqrt
(+
(* U (* 2.0 (* n t)))
(* (* l (+ -2.0 (/ (* U* n) Om))) (* U (/ (* n 2.0) (/ Om l))))))
t_1))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = sqrt(((2.0 * (U * n)) * (t + ((l / Om) * ((l * -2.0) + (n * ((U_42_ - U) * (l / Om))))))));
double tmp;
if (n <= -2.6e-18) {
tmp = t_1;
} else if (n <= 0.78) {
tmp = sqrt(((U * (2.0 * (n * t))) + ((l * (-2.0 + ((U_42_ * n) / Om))) * (U * ((n * 2.0) / (Om / l))))));
} else {
tmp = t_1;
}
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 = sqrt(((2.0d0 * (u * n)) * (t + ((l / om) * ((l * (-2.0d0)) + (n * ((u_42 - u) * (l / om))))))))
if (n <= (-2.6d-18)) then
tmp = t_1
else if (n <= 0.78d0) then
tmp = sqrt(((u * (2.0d0 * (n * t))) + ((l * ((-2.0d0) + ((u_42 * n) / om))) * (u * ((n * 2.0d0) / (om / l))))))
else
tmp = t_1
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 = Math.sqrt(((2.0 * (U * n)) * (t + ((l / Om) * ((l * -2.0) + (n * ((U_42_ - U) * (l / Om))))))));
double tmp;
if (n <= -2.6e-18) {
tmp = t_1;
} else if (n <= 0.78) {
tmp = Math.sqrt(((U * (2.0 * (n * t))) + ((l * (-2.0 + ((U_42_ * n) / Om))) * (U * ((n * 2.0) / (Om / l))))));
} else {
tmp = t_1;
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = math.sqrt(((2.0 * (U * n)) * (t + ((l / Om) * ((l * -2.0) + (n * ((U_42_ - U) * (l / Om)))))))) tmp = 0 if n <= -2.6e-18: tmp = t_1 elif n <= 0.78: tmp = math.sqrt(((U * (2.0 * (n * t))) + ((l * (-2.0 + ((U_42_ * n) / Om))) * (U * ((n * 2.0) / (Om / l)))))) else: tmp = t_1 return tmp
function code(n, U, t, l, Om, U_42_) t_1 = sqrt(Float64(Float64(2.0 * Float64(U * n)) * Float64(t + Float64(Float64(l / Om) * Float64(Float64(l * -2.0) + Float64(n * Float64(Float64(U_42_ - U) * Float64(l / Om)))))))) tmp = 0.0 if (n <= -2.6e-18) tmp = t_1; elseif (n <= 0.78) tmp = sqrt(Float64(Float64(U * Float64(2.0 * Float64(n * t))) + Float64(Float64(l * Float64(-2.0 + Float64(Float64(U_42_ * n) / Om))) * Float64(U * Float64(Float64(n * 2.0) / Float64(Om / l)))))); else tmp = t_1; end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = sqrt(((2.0 * (U * n)) * (t + ((l / Om) * ((l * -2.0) + (n * ((U_42_ - U) * (l / Om)))))))); tmp = 0.0; if (n <= -2.6e-18) tmp = t_1; elseif (n <= 0.78) tmp = sqrt(((U * (2.0 * (n * t))) + ((l * (-2.0 + ((U_42_ * n) / Om))) * (U * ((n * 2.0) / (Om / l)))))); else tmp = t_1; end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[Sqrt[N[(N[(2.0 * N[(U * n), $MachinePrecision]), $MachinePrecision] * N[(t + N[(N[(l / Om), $MachinePrecision] * N[(N[(l * -2.0), $MachinePrecision] + N[(n * N[(N[(U$42$ - U), $MachinePrecision] * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[n, -2.6e-18], t$95$1, If[LessEqual[n, 0.78], N[Sqrt[N[(N[(U * N[(2.0 * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(l * N[(-2.0 + N[(N[(U$42$ * n), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(U * N[(N[(n * 2.0), $MachinePrecision] / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], t$95$1]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \sqrt{\left(2 \cdot \left(U \cdot n\right)\right) \cdot \left(t + \frac{\ell}{Om} \cdot \left(\ell \cdot -2 + n \cdot \left(\left(U* - U\right) \cdot \frac{\ell}{Om}\right)\right)\right)}\\
\mathbf{if}\;n \leq -2.6 \cdot 10^{-18}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;n \leq 0.78:\\
\;\;\;\;\sqrt{U \cdot \left(2 \cdot \left(n \cdot t\right)\right) + \left(\ell \cdot \left(-2 + \frac{U* \cdot n}{Om}\right)\right) \cdot \left(U \cdot \frac{n \cdot 2}{\frac{Om}{\ell}}\right)}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if n < -2.6e-18 or 0.78000000000000003 < n Initial program 53.9%
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sub-negN/A
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
Simplified62.0%
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
--lowering--.f6467.3%
Applied egg-rr67.3%
if -2.6e-18 < n < 0.78000000000000003Initial program 42.1%
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sub-negN/A
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
Simplified48.8%
+-commutativeN/A
distribute-lft-inN/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
fma-defineN/A
fma-lowering-fma.f64N/A
Applied egg-rr62.3%
+-lowering-+.f64N/A
Applied egg-rr67.5%
*-commutativeN/A
associate-*l*N/A
associate-/r/N/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
distribute-rgt-inN/A
*-lowering-*.f64N/A
Applied egg-rr62.8%
Taylor expanded in U around 0
*-lowering-*.f64N/A
sub-negN/A
metadata-evalN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6467.3%
Simplified67.3%
Final simplification67.3%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1
(sqrt
(*
(* 2.0 (* U n))
(+ t (* (/ l Om) (+ (* l -2.0) (* n (* (- U* U) (/ l Om))))))))))
(if (<= n -1.7e-14)
t_1
(if (<= n 6.5e-82)
(sqrt
(*
U
(+
(* (* l (* l (/ (* n 2.0) Om))) (+ -2.0 (/ (* (- U* U) n) Om)))
(* n (* 2.0 t)))))
t_1))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = sqrt(((2.0 * (U * n)) * (t + ((l / Om) * ((l * -2.0) + (n * ((U_42_ - U) * (l / Om))))))));
double tmp;
if (n <= -1.7e-14) {
tmp = t_1;
} else if (n <= 6.5e-82) {
tmp = sqrt((U * (((l * (l * ((n * 2.0) / Om))) * (-2.0 + (((U_42_ - U) * n) / Om))) + (n * (2.0 * t)))));
} else {
tmp = t_1;
}
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 = sqrt(((2.0d0 * (u * n)) * (t + ((l / om) * ((l * (-2.0d0)) + (n * ((u_42 - u) * (l / om))))))))
if (n <= (-1.7d-14)) then
tmp = t_1
else if (n <= 6.5d-82) then
tmp = sqrt((u * (((l * (l * ((n * 2.0d0) / om))) * ((-2.0d0) + (((u_42 - u) * n) / om))) + (n * (2.0d0 * t)))))
else
tmp = t_1
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 = Math.sqrt(((2.0 * (U * n)) * (t + ((l / Om) * ((l * -2.0) + (n * ((U_42_ - U) * (l / Om))))))));
double tmp;
if (n <= -1.7e-14) {
tmp = t_1;
} else if (n <= 6.5e-82) {
tmp = Math.sqrt((U * (((l * (l * ((n * 2.0) / Om))) * (-2.0 + (((U_42_ - U) * n) / Om))) + (n * (2.0 * t)))));
} else {
tmp = t_1;
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = math.sqrt(((2.0 * (U * n)) * (t + ((l / Om) * ((l * -2.0) + (n * ((U_42_ - U) * (l / Om)))))))) tmp = 0 if n <= -1.7e-14: tmp = t_1 elif n <= 6.5e-82: tmp = math.sqrt((U * (((l * (l * ((n * 2.0) / Om))) * (-2.0 + (((U_42_ - U) * n) / Om))) + (n * (2.0 * t))))) else: tmp = t_1 return tmp
function code(n, U, t, l, Om, U_42_) t_1 = sqrt(Float64(Float64(2.0 * Float64(U * n)) * Float64(t + Float64(Float64(l / Om) * Float64(Float64(l * -2.0) + Float64(n * Float64(Float64(U_42_ - U) * Float64(l / Om)))))))) tmp = 0.0 if (n <= -1.7e-14) tmp = t_1; elseif (n <= 6.5e-82) tmp = sqrt(Float64(U * Float64(Float64(Float64(l * Float64(l * Float64(Float64(n * 2.0) / Om))) * Float64(-2.0 + Float64(Float64(Float64(U_42_ - U) * n) / Om))) + Float64(n * Float64(2.0 * t))))); else tmp = t_1; end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = sqrt(((2.0 * (U * n)) * (t + ((l / Om) * ((l * -2.0) + (n * ((U_42_ - U) * (l / Om)))))))); tmp = 0.0; if (n <= -1.7e-14) tmp = t_1; elseif (n <= 6.5e-82) tmp = sqrt((U * (((l * (l * ((n * 2.0) / Om))) * (-2.0 + (((U_42_ - U) * n) / Om))) + (n * (2.0 * t))))); else tmp = t_1; end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[Sqrt[N[(N[(2.0 * N[(U * n), $MachinePrecision]), $MachinePrecision] * N[(t + N[(N[(l / Om), $MachinePrecision] * N[(N[(l * -2.0), $MachinePrecision] + N[(n * N[(N[(U$42$ - U), $MachinePrecision] * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[n, -1.7e-14], t$95$1, If[LessEqual[n, 6.5e-82], N[Sqrt[N[(U * N[(N[(N[(l * N[(l * N[(N[(n * 2.0), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(-2.0 + N[(N[(N[(U$42$ - U), $MachinePrecision] * n), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(n * N[(2.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], t$95$1]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \sqrt{\left(2 \cdot \left(U \cdot n\right)\right) \cdot \left(t + \frac{\ell}{Om} \cdot \left(\ell \cdot -2 + n \cdot \left(\left(U* - U\right) \cdot \frac{\ell}{Om}\right)\right)\right)}\\
\mathbf{if}\;n \leq -1.7 \cdot 10^{-14}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;n \leq 6.5 \cdot 10^{-82}:\\
\;\;\;\;\sqrt{U \cdot \left(\left(\ell \cdot \left(\ell \cdot \frac{n \cdot 2}{Om}\right)\right) \cdot \left(-2 + \frac{\left(U* - U\right) \cdot n}{Om}\right) + n \cdot \left(2 \cdot t\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if n < -1.70000000000000001e-14 or 6.4999999999999997e-82 < n Initial program 54.2%
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sub-negN/A
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
Simplified61.5%
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
--lowering--.f6466.8%
Applied egg-rr66.8%
if -1.70000000000000001e-14 < n < 6.4999999999999997e-82Initial program 40.5%
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sub-negN/A
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
Simplified47.8%
+-commutativeN/A
distribute-lft-inN/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
fma-defineN/A
fma-lowering-fma.f64N/A
Applied egg-rr62.8%
+-lowering-+.f64N/A
Applied egg-rr68.6%
*-commutativeN/A
associate-*l*N/A
associate-/r/N/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
distribute-rgt-inN/A
*-lowering-*.f64N/A
Applied egg-rr62.6%
associate-*r*N/A
*-commutativeN/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
Applied egg-rr65.0%
Final simplification65.9%
(FPCore (n U t l Om U*)
:precision binary64
(if (<= n 7e-80)
(sqrt
(+
(*
U
(* (+ (/ (- U* U) (/ Om (* n l))) (* l -2.0)) (* (/ l Om) (* n 2.0))))
(* U (* 2.0 (* n t)))))
(sqrt
(*
(* 2.0 (* U n))
(+ t (* (/ l Om) (+ (* l -2.0) (* n (* (- U* U) (/ l Om))))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (n <= 7e-80) {
tmp = sqrt(((U * ((((U_42_ - U) / (Om / (n * l))) + (l * -2.0)) * ((l / Om) * (n * 2.0)))) + (U * (2.0 * (n * t)))));
} else {
tmp = sqrt(((2.0 * (U * n)) * (t + ((l / Om) * ((l * -2.0) + (n * ((U_42_ - U) * (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 (n <= 7d-80) then
tmp = sqrt(((u * ((((u_42 - u) / (om / (n * l))) + (l * (-2.0d0))) * ((l / om) * (n * 2.0d0)))) + (u * (2.0d0 * (n * t)))))
else
tmp = sqrt(((2.0d0 * (u * n)) * (t + ((l / om) * ((l * (-2.0d0)) + (n * ((u_42 - u) * (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 (n <= 7e-80) {
tmp = Math.sqrt(((U * ((((U_42_ - U) / (Om / (n * l))) + (l * -2.0)) * ((l / Om) * (n * 2.0)))) + (U * (2.0 * (n * t)))));
} else {
tmp = Math.sqrt(((2.0 * (U * n)) * (t + ((l / Om) * ((l * -2.0) + (n * ((U_42_ - U) * (l / Om))))))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if n <= 7e-80: tmp = math.sqrt(((U * ((((U_42_ - U) / (Om / (n * l))) + (l * -2.0)) * ((l / Om) * (n * 2.0)))) + (U * (2.0 * (n * t))))) else: tmp = math.sqrt(((2.0 * (U * n)) * (t + ((l / Om) * ((l * -2.0) + (n * ((U_42_ - U) * (l / Om)))))))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (n <= 7e-80) tmp = sqrt(Float64(Float64(U * Float64(Float64(Float64(Float64(U_42_ - U) / Float64(Om / Float64(n * l))) + Float64(l * -2.0)) * Float64(Float64(l / Om) * Float64(n * 2.0)))) + Float64(U * Float64(2.0 * Float64(n * t))))); else tmp = sqrt(Float64(Float64(2.0 * Float64(U * n)) * Float64(t + Float64(Float64(l / Om) * Float64(Float64(l * -2.0) + Float64(n * Float64(Float64(U_42_ - U) * Float64(l / Om)))))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (n <= 7e-80) tmp = sqrt(((U * ((((U_42_ - U) / (Om / (n * l))) + (l * -2.0)) * ((l / Om) * (n * 2.0)))) + (U * (2.0 * (n * t))))); else tmp = sqrt(((2.0 * (U * n)) * (t + ((l / Om) * ((l * -2.0) + (n * ((U_42_ - U) * (l / Om)))))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[n, 7e-80], N[Sqrt[N[(N[(U * N[(N[(N[(N[(U$42$ - U), $MachinePrecision] / N[(Om / N[(n * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(l * -2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(l / Om), $MachinePrecision] * N[(n * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(U * N[(2.0 * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(2.0 * N[(U * n), $MachinePrecision]), $MachinePrecision] * N[(t + N[(N[(l / Om), $MachinePrecision] * N[(N[(l * -2.0), $MachinePrecision] + N[(n * N[(N[(U$42$ - U), $MachinePrecision] * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;n \leq 7 \cdot 10^{-80}:\\
\;\;\;\;\sqrt{U \cdot \left(\left(\frac{U* - U}{\frac{Om}{n \cdot \ell}} + \ell \cdot -2\right) \cdot \left(\frac{\ell}{Om} \cdot \left(n \cdot 2\right)\right)\right) + U \cdot \left(2 \cdot \left(n \cdot t\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(U \cdot n\right)\right) \cdot \left(t + \frac{\ell}{Om} \cdot \left(\ell \cdot -2 + n \cdot \left(\left(U* - U\right) \cdot \frac{\ell}{Om}\right)\right)\right)}\\
\end{array}
\end{array}
if n < 7.00000000000000029e-80Initial program 42.7%
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sub-negN/A
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
Simplified50.8%
+-commutativeN/A
distribute-lft-inN/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
fma-defineN/A
fma-lowering-fma.f64N/A
Applied egg-rr61.1%
+-lowering-+.f64N/A
Applied egg-rr64.8%
if 7.00000000000000029e-80 < n Initial program 62.1%
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sub-negN/A
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
Simplified67.0%
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
--lowering--.f6475.0%
Applied egg-rr75.0%
Final simplification67.2%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1
(sqrt
(*
(* 2.0 (* U n))
(+ t (* (/ l Om) (+ (* l -2.0) (* n (* (- U* U) (/ l Om))))))))))
(if (<= n -1.12e-23)
t_1
(if (<= n 4.2e-129)
(sqrt
(+ (* U (* 2.0 (* n t))) (* U (* (* l -2.0) (* (/ l Om) (* n 2.0))))))
t_1))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = sqrt(((2.0 * (U * n)) * (t + ((l / Om) * ((l * -2.0) + (n * ((U_42_ - U) * (l / Om))))))));
double tmp;
if (n <= -1.12e-23) {
tmp = t_1;
} else if (n <= 4.2e-129) {
tmp = sqrt(((U * (2.0 * (n * t))) + (U * ((l * -2.0) * ((l / Om) * (n * 2.0))))));
} else {
tmp = t_1;
}
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 = sqrt(((2.0d0 * (u * n)) * (t + ((l / om) * ((l * (-2.0d0)) + (n * ((u_42 - u) * (l / om))))))))
if (n <= (-1.12d-23)) then
tmp = t_1
else if (n <= 4.2d-129) then
tmp = sqrt(((u * (2.0d0 * (n * t))) + (u * ((l * (-2.0d0)) * ((l / om) * (n * 2.0d0))))))
else
tmp = t_1
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 = Math.sqrt(((2.0 * (U * n)) * (t + ((l / Om) * ((l * -2.0) + (n * ((U_42_ - U) * (l / Om))))))));
double tmp;
if (n <= -1.12e-23) {
tmp = t_1;
} else if (n <= 4.2e-129) {
tmp = Math.sqrt(((U * (2.0 * (n * t))) + (U * ((l * -2.0) * ((l / Om) * (n * 2.0))))));
} else {
tmp = t_1;
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = math.sqrt(((2.0 * (U * n)) * (t + ((l / Om) * ((l * -2.0) + (n * ((U_42_ - U) * (l / Om)))))))) tmp = 0 if n <= -1.12e-23: tmp = t_1 elif n <= 4.2e-129: tmp = math.sqrt(((U * (2.0 * (n * t))) + (U * ((l * -2.0) * ((l / Om) * (n * 2.0)))))) else: tmp = t_1 return tmp
function code(n, U, t, l, Om, U_42_) t_1 = sqrt(Float64(Float64(2.0 * Float64(U * n)) * Float64(t + Float64(Float64(l / Om) * Float64(Float64(l * -2.0) + Float64(n * Float64(Float64(U_42_ - U) * Float64(l / Om)))))))) tmp = 0.0 if (n <= -1.12e-23) tmp = t_1; elseif (n <= 4.2e-129) tmp = sqrt(Float64(Float64(U * Float64(2.0 * Float64(n * t))) + Float64(U * Float64(Float64(l * -2.0) * Float64(Float64(l / Om) * Float64(n * 2.0)))))); else tmp = t_1; end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = sqrt(((2.0 * (U * n)) * (t + ((l / Om) * ((l * -2.0) + (n * ((U_42_ - U) * (l / Om)))))))); tmp = 0.0; if (n <= -1.12e-23) tmp = t_1; elseif (n <= 4.2e-129) tmp = sqrt(((U * (2.0 * (n * t))) + (U * ((l * -2.0) * ((l / Om) * (n * 2.0)))))); else tmp = t_1; end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[Sqrt[N[(N[(2.0 * N[(U * n), $MachinePrecision]), $MachinePrecision] * N[(t + N[(N[(l / Om), $MachinePrecision] * N[(N[(l * -2.0), $MachinePrecision] + N[(n * N[(N[(U$42$ - U), $MachinePrecision] * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[n, -1.12e-23], t$95$1, If[LessEqual[n, 4.2e-129], N[Sqrt[N[(N[(U * N[(2.0 * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(U * N[(N[(l * -2.0), $MachinePrecision] * N[(N[(l / Om), $MachinePrecision] * N[(n * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], t$95$1]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \sqrt{\left(2 \cdot \left(U \cdot n\right)\right) \cdot \left(t + \frac{\ell}{Om} \cdot \left(\ell \cdot -2 + n \cdot \left(\left(U* - U\right) \cdot \frac{\ell}{Om}\right)\right)\right)}\\
\mathbf{if}\;n \leq -1.12 \cdot 10^{-23}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;n \leq 4.2 \cdot 10^{-129}:\\
\;\;\;\;\sqrt{U \cdot \left(2 \cdot \left(n \cdot t\right)\right) + U \cdot \left(\left(\ell \cdot -2\right) \cdot \left(\frac{\ell}{Om} \cdot \left(n \cdot 2\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if n < -1.1200000000000001e-23 or 4.2e-129 < n Initial program 53.6%
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sub-negN/A
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
Simplified60.4%
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
--lowering--.f6465.3%
Applied egg-rr65.3%
if -1.1200000000000001e-23 < n < 4.2e-129Initial program 39.9%
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sub-negN/A
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
Simplified47.7%
+-commutativeN/A
distribute-lft-inN/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
fma-defineN/A
fma-lowering-fma.f64N/A
Applied egg-rr63.4%
+-lowering-+.f64N/A
Applied egg-rr69.0%
Taylor expanded in Om around inf
*-lowering-*.f6465.6%
Simplified65.6%
Final simplification65.4%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* 2.0 (* U n)))
(t_2 (sqrt (* t_1 (+ t (* (* l -2.0) (/ l Om)))))))
(if (<= Om -4.5e+145)
t_2
(if (<= Om -2.6e-47)
(sqrt (* (* U 2.0) (* n (- t (* 2.0 (/ (* l l) Om))))))
(if (<= Om 128000000000.0)
(sqrt (* t_1 (+ t (* (/ l Om) (/ (* U* (* n l)) Om)))))
t_2)))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = 2.0 * (U * n);
double t_2 = sqrt((t_1 * (t + ((l * -2.0) * (l / Om)))));
double tmp;
if (Om <= -4.5e+145) {
tmp = t_2;
} else if (Om <= -2.6e-47) {
tmp = sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om))))));
} else if (Om <= 128000000000.0) {
tmp = sqrt((t_1 * (t + ((l / Om) * ((U_42_ * (n * l)) / Om)))));
} else {
tmp = t_2;
}
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) :: t_2
real(8) :: tmp
t_1 = 2.0d0 * (u * n)
t_2 = sqrt((t_1 * (t + ((l * (-2.0d0)) * (l / om)))))
if (om <= (-4.5d+145)) then
tmp = t_2
else if (om <= (-2.6d-47)) then
tmp = sqrt(((u * 2.0d0) * (n * (t - (2.0d0 * ((l * l) / om))))))
else if (om <= 128000000000.0d0) then
tmp = sqrt((t_1 * (t + ((l / om) * ((u_42 * (n * l)) / om)))))
else
tmp = t_2
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 = 2.0 * (U * n);
double t_2 = Math.sqrt((t_1 * (t + ((l * -2.0) * (l / Om)))));
double tmp;
if (Om <= -4.5e+145) {
tmp = t_2;
} else if (Om <= -2.6e-47) {
tmp = Math.sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om))))));
} else if (Om <= 128000000000.0) {
tmp = Math.sqrt((t_1 * (t + ((l / Om) * ((U_42_ * (n * l)) / Om)))));
} else {
tmp = t_2;
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = 2.0 * (U * n) t_2 = math.sqrt((t_1 * (t + ((l * -2.0) * (l / Om))))) tmp = 0 if Om <= -4.5e+145: tmp = t_2 elif Om <= -2.6e-47: tmp = math.sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om)))))) elif Om <= 128000000000.0: tmp = math.sqrt((t_1 * (t + ((l / Om) * ((U_42_ * (n * l)) / Om))))) else: tmp = t_2 return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(2.0 * Float64(U * n)) t_2 = sqrt(Float64(t_1 * Float64(t + Float64(Float64(l * -2.0) * Float64(l / Om))))) tmp = 0.0 if (Om <= -4.5e+145) tmp = t_2; elseif (Om <= -2.6e-47) tmp = sqrt(Float64(Float64(U * 2.0) * Float64(n * Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om)))))); elseif (Om <= 128000000000.0) tmp = sqrt(Float64(t_1 * Float64(t + Float64(Float64(l / Om) * Float64(Float64(U_42_ * Float64(n * l)) / Om))))); else tmp = t_2; end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = 2.0 * (U * n); t_2 = sqrt((t_1 * (t + ((l * -2.0) * (l / Om))))); tmp = 0.0; if (Om <= -4.5e+145) tmp = t_2; elseif (Om <= -2.6e-47) tmp = sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om)))))); elseif (Om <= 128000000000.0) tmp = sqrt((t_1 * (t + ((l / Om) * ((U_42_ * (n * l)) / Om))))); else tmp = t_2; end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(2.0 * N[(U * n), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(t$95$1 * N[(t + N[(N[(l * -2.0), $MachinePrecision] * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[Om, -4.5e+145], t$95$2, If[LessEqual[Om, -2.6e-47], 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], If[LessEqual[Om, 128000000000.0], N[Sqrt[N[(t$95$1 * N[(t + N[(N[(l / Om), $MachinePrecision] * N[(N[(U$42$ * N[(n * l), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], t$95$2]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := 2 \cdot \left(U \cdot n\right)\\
t_2 := \sqrt{t\_1 \cdot \left(t + \left(\ell \cdot -2\right) \cdot \frac{\ell}{Om}\right)}\\
\mathbf{if}\;Om \leq -4.5 \cdot 10^{+145}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;Om \leq -2.6 \cdot 10^{-47}:\\
\;\;\;\;\sqrt{\left(U \cdot 2\right) \cdot \left(n \cdot \left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right)\right)}\\
\mathbf{elif}\;Om \leq 128000000000:\\
\;\;\;\;\sqrt{t\_1 \cdot \left(t + \frac{\ell}{Om} \cdot \frac{U* \cdot \left(n \cdot \ell\right)}{Om}\right)}\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if Om < -4.4999999999999998e145 or 1.28e11 < Om Initial program 49.9%
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sub-negN/A
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
Simplified59.1%
Taylor expanded in n around 0
*-lowering-*.f6459.8%
Simplified59.8%
if -4.4999999999999998e145 < Om < -2.6e-47Initial program 42.7%
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sub-negN/A
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
Simplified42.7%
Taylor expanded in n around 0
associate-*r*N/A
metadata-evalN/A
cancel-sign-sub-invN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6457.4%
Simplified57.4%
if -2.6e-47 < Om < 1.28e11Initial program 45.4%
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sub-negN/A
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
Simplified52.5%
Taylor expanded in U* around inf
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6451.6%
Simplified51.6%
Final simplification56.4%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* 2.0 (* U n))))
(if (<= n -2.05e-23)
(sqrt (* t_1 (+ t (* (/ l Om) (/ (* U* (* n l)) Om)))))
(if (<= n 2.35e-126)
(sqrt
(+ (* U (* 2.0 (* n t))) (* U (* (* l -2.0) (* (/ l Om) (* n 2.0))))))
(sqrt
(* t_1 (+ t (* (/ l Om) (* l (+ -2.0 (/ (* (- U* U) n) Om)))))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = 2.0 * (U * n);
double tmp;
if (n <= -2.05e-23) {
tmp = sqrt((t_1 * (t + ((l / Om) * ((U_42_ * (n * l)) / Om)))));
} else if (n <= 2.35e-126) {
tmp = sqrt(((U * (2.0 * (n * t))) + (U * ((l * -2.0) * ((l / Om) * (n * 2.0))))));
} else {
tmp = sqrt((t_1 * (t + ((l / Om) * (l * (-2.0 + (((U_42_ - U) * 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) :: t_1
real(8) :: tmp
t_1 = 2.0d0 * (u * n)
if (n <= (-2.05d-23)) then
tmp = sqrt((t_1 * (t + ((l / om) * ((u_42 * (n * l)) / om)))))
else if (n <= 2.35d-126) then
tmp = sqrt(((u * (2.0d0 * (n * t))) + (u * ((l * (-2.0d0)) * ((l / om) * (n * 2.0d0))))))
else
tmp = sqrt((t_1 * (t + ((l / om) * (l * ((-2.0d0) + (((u_42 - u) * 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 t_1 = 2.0 * (U * n);
double tmp;
if (n <= -2.05e-23) {
tmp = Math.sqrt((t_1 * (t + ((l / Om) * ((U_42_ * (n * l)) / Om)))));
} else if (n <= 2.35e-126) {
tmp = Math.sqrt(((U * (2.0 * (n * t))) + (U * ((l * -2.0) * ((l / Om) * (n * 2.0))))));
} else {
tmp = Math.sqrt((t_1 * (t + ((l / Om) * (l * (-2.0 + (((U_42_ - U) * n) / Om)))))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = 2.0 * (U * n) tmp = 0 if n <= -2.05e-23: tmp = math.sqrt((t_1 * (t + ((l / Om) * ((U_42_ * (n * l)) / Om))))) elif n <= 2.35e-126: tmp = math.sqrt(((U * (2.0 * (n * t))) + (U * ((l * -2.0) * ((l / Om) * (n * 2.0)))))) else: tmp = math.sqrt((t_1 * (t + ((l / Om) * (l * (-2.0 + (((U_42_ - U) * n) / Om))))))) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(2.0 * Float64(U * n)) tmp = 0.0 if (n <= -2.05e-23) tmp = sqrt(Float64(t_1 * Float64(t + Float64(Float64(l / Om) * Float64(Float64(U_42_ * Float64(n * l)) / Om))))); elseif (n <= 2.35e-126) tmp = sqrt(Float64(Float64(U * Float64(2.0 * Float64(n * t))) + Float64(U * Float64(Float64(l * -2.0) * Float64(Float64(l / Om) * Float64(n * 2.0)))))); else tmp = sqrt(Float64(t_1 * Float64(t + Float64(Float64(l / Om) * Float64(l * Float64(-2.0 + Float64(Float64(Float64(U_42_ - U) * n) / Om))))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = 2.0 * (U * n); tmp = 0.0; if (n <= -2.05e-23) tmp = sqrt((t_1 * (t + ((l / Om) * ((U_42_ * (n * l)) / Om))))); elseif (n <= 2.35e-126) tmp = sqrt(((U * (2.0 * (n * t))) + (U * ((l * -2.0) * ((l / Om) * (n * 2.0)))))); else tmp = sqrt((t_1 * (t + ((l / Om) * (l * (-2.0 + (((U_42_ - U) * n) / Om))))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(2.0 * N[(U * n), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[n, -2.05e-23], N[Sqrt[N[(t$95$1 * N[(t + N[(N[(l / Om), $MachinePrecision] * N[(N[(U$42$ * N[(n * l), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[n, 2.35e-126], N[Sqrt[N[(N[(U * N[(2.0 * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(U * N[(N[(l * -2.0), $MachinePrecision] * N[(N[(l / Om), $MachinePrecision] * N[(n * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(t$95$1 * N[(t + N[(N[(l / Om), $MachinePrecision] * N[(l * N[(-2.0 + N[(N[(N[(U$42$ - U), $MachinePrecision] * n), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := 2 \cdot \left(U \cdot n\right)\\
\mathbf{if}\;n \leq -2.05 \cdot 10^{-23}:\\
\;\;\;\;\sqrt{t\_1 \cdot \left(t + \frac{\ell}{Om} \cdot \frac{U* \cdot \left(n \cdot \ell\right)}{Om}\right)}\\
\mathbf{elif}\;n \leq 2.35 \cdot 10^{-126}:\\
\;\;\;\;\sqrt{U \cdot \left(2 \cdot \left(n \cdot t\right)\right) + U \cdot \left(\left(\ell \cdot -2\right) \cdot \left(\frac{\ell}{Om} \cdot \left(n \cdot 2\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{t\_1 \cdot \left(t + \frac{\ell}{Om} \cdot \left(\ell \cdot \left(-2 + \frac{\left(U* - U\right) \cdot n}{Om}\right)\right)\right)}\\
\end{array}
\end{array}
if n < -2.05000000000000015e-23Initial program 45.9%
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sub-negN/A
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
Simplified55.1%
Taylor expanded in U* around inf
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6450.9%
Simplified50.9%
if -2.05000000000000015e-23 < n < 2.35000000000000009e-126Initial program 39.9%
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sub-negN/A
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
Simplified47.7%
+-commutativeN/A
distribute-lft-inN/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
fma-defineN/A
fma-lowering-fma.f64N/A
Applied egg-rr63.4%
+-lowering-+.f64N/A
Applied egg-rr69.0%
Taylor expanded in Om around inf
*-lowering-*.f6465.6%
Simplified65.6%
if 2.35000000000000009e-126 < n Initial program 61.3%
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sub-negN/A
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
Simplified65.7%
Taylor expanded in n around 0
+-commutativeN/A
associate-/l*N/A
*-commutativeN/A
distribute-lft-inN/A
metadata-evalN/A
sub-negN/A
*-lowering-*.f64N/A
sub-negN/A
metadata-evalN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
--lowering--.f6463.8%
Simplified63.8%
Final simplification61.1%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1
(sqrt (* (* 2.0 (* U n)) (+ t (* (/ l Om) (/ (* U* (* n l)) Om)))))))
(if (<= n -1.8e-23)
t_1
(if (<= n 2.3e-69)
(sqrt
(+ (* U (* 2.0 (* n t))) (* U (* (* l -2.0) (* (/ l Om) (* n 2.0))))))
t_1))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = sqrt(((2.0 * (U * n)) * (t + ((l / Om) * ((U_42_ * (n * l)) / Om)))));
double tmp;
if (n <= -1.8e-23) {
tmp = t_1;
} else if (n <= 2.3e-69) {
tmp = sqrt(((U * (2.0 * (n * t))) + (U * ((l * -2.0) * ((l / Om) * (n * 2.0))))));
} else {
tmp = t_1;
}
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 = sqrt(((2.0d0 * (u * n)) * (t + ((l / om) * ((u_42 * (n * l)) / om)))))
if (n <= (-1.8d-23)) then
tmp = t_1
else if (n <= 2.3d-69) then
tmp = sqrt(((u * (2.0d0 * (n * t))) + (u * ((l * (-2.0d0)) * ((l / om) * (n * 2.0d0))))))
else
tmp = t_1
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 = Math.sqrt(((2.0 * (U * n)) * (t + ((l / Om) * ((U_42_ * (n * l)) / Om)))));
double tmp;
if (n <= -1.8e-23) {
tmp = t_1;
} else if (n <= 2.3e-69) {
tmp = Math.sqrt(((U * (2.0 * (n * t))) + (U * ((l * -2.0) * ((l / Om) * (n * 2.0))))));
} else {
tmp = t_1;
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = math.sqrt(((2.0 * (U * n)) * (t + ((l / Om) * ((U_42_ * (n * l)) / Om))))) tmp = 0 if n <= -1.8e-23: tmp = t_1 elif n <= 2.3e-69: tmp = math.sqrt(((U * (2.0 * (n * t))) + (U * ((l * -2.0) * ((l / Om) * (n * 2.0)))))) else: tmp = t_1 return tmp
function code(n, U, t, l, Om, U_42_) t_1 = sqrt(Float64(Float64(2.0 * Float64(U * n)) * Float64(t + Float64(Float64(l / Om) * Float64(Float64(U_42_ * Float64(n * l)) / Om))))) tmp = 0.0 if (n <= -1.8e-23) tmp = t_1; elseif (n <= 2.3e-69) tmp = sqrt(Float64(Float64(U * Float64(2.0 * Float64(n * t))) + Float64(U * Float64(Float64(l * -2.0) * Float64(Float64(l / Om) * Float64(n * 2.0)))))); else tmp = t_1; end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = sqrt(((2.0 * (U * n)) * (t + ((l / Om) * ((U_42_ * (n * l)) / Om))))); tmp = 0.0; if (n <= -1.8e-23) tmp = t_1; elseif (n <= 2.3e-69) tmp = sqrt(((U * (2.0 * (n * t))) + (U * ((l * -2.0) * ((l / Om) * (n * 2.0)))))); else tmp = t_1; end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[Sqrt[N[(N[(2.0 * N[(U * n), $MachinePrecision]), $MachinePrecision] * N[(t + N[(N[(l / Om), $MachinePrecision] * N[(N[(U$42$ * N[(n * l), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[n, -1.8e-23], t$95$1, If[LessEqual[n, 2.3e-69], N[Sqrt[N[(N[(U * N[(2.0 * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(U * N[(N[(l * -2.0), $MachinePrecision] * N[(N[(l / Om), $MachinePrecision] * N[(n * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], t$95$1]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \sqrt{\left(2 \cdot \left(U \cdot n\right)\right) \cdot \left(t + \frac{\ell}{Om} \cdot \frac{U* \cdot \left(n \cdot \ell\right)}{Om}\right)}\\
\mathbf{if}\;n \leq -1.8 \cdot 10^{-23}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;n \leq 2.3 \cdot 10^{-69}:\\
\;\;\;\;\sqrt{U \cdot \left(2 \cdot \left(n \cdot t\right)\right) + U \cdot \left(\left(\ell \cdot -2\right) \cdot \left(\frac{\ell}{Om} \cdot \left(n \cdot 2\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if n < -1.7999999999999999e-23 or 2.3000000000000001e-69 < n Initial program 54.0%
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sub-negN/A
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
Simplified61.2%
Taylor expanded in U* around inf
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6455.7%
Simplified55.7%
if -1.7999999999999999e-23 < n < 2.3000000000000001e-69Initial program 40.8%
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sub-negN/A
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
Simplified48.1%
+-commutativeN/A
distribute-lft-inN/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
fma-defineN/A
fma-lowering-fma.f64N/A
Applied egg-rr63.1%
+-lowering-+.f64N/A
Applied egg-rr68.9%
Taylor expanded in Om around inf
*-lowering-*.f6463.5%
Simplified63.5%
Final simplification59.6%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1
(sqrt (* (* 2.0 (* U n)) (+ t (* (/ l Om) (/ (* U* (* n l)) Om)))))))
(if (<= n -1.12e-23)
t_1
(if (<= n 3.7e-69)
(sqrt (+ (/ (* -4.0 (* (* n l) (* U l))) Om) (* 2.0 (* U (* n t)))))
t_1))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = sqrt(((2.0 * (U * n)) * (t + ((l / Om) * ((U_42_ * (n * l)) / Om)))));
double tmp;
if (n <= -1.12e-23) {
tmp = t_1;
} else if (n <= 3.7e-69) {
tmp = sqrt((((-4.0 * ((n * l) * (U * l))) / Om) + (2.0 * (U * (n * t)))));
} else {
tmp = t_1;
}
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 = sqrt(((2.0d0 * (u * n)) * (t + ((l / om) * ((u_42 * (n * l)) / om)))))
if (n <= (-1.12d-23)) then
tmp = t_1
else if (n <= 3.7d-69) then
tmp = sqrt(((((-4.0d0) * ((n * l) * (u * l))) / om) + (2.0d0 * (u * (n * t)))))
else
tmp = t_1
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 = Math.sqrt(((2.0 * (U * n)) * (t + ((l / Om) * ((U_42_ * (n * l)) / Om)))));
double tmp;
if (n <= -1.12e-23) {
tmp = t_1;
} else if (n <= 3.7e-69) {
tmp = Math.sqrt((((-4.0 * ((n * l) * (U * l))) / Om) + (2.0 * (U * (n * t)))));
} else {
tmp = t_1;
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = math.sqrt(((2.0 * (U * n)) * (t + ((l / Om) * ((U_42_ * (n * l)) / Om))))) tmp = 0 if n <= -1.12e-23: tmp = t_1 elif n <= 3.7e-69: tmp = math.sqrt((((-4.0 * ((n * l) * (U * l))) / Om) + (2.0 * (U * (n * t))))) else: tmp = t_1 return tmp
function code(n, U, t, l, Om, U_42_) t_1 = sqrt(Float64(Float64(2.0 * Float64(U * n)) * Float64(t + Float64(Float64(l / Om) * Float64(Float64(U_42_ * Float64(n * l)) / Om))))) tmp = 0.0 if (n <= -1.12e-23) tmp = t_1; elseif (n <= 3.7e-69) tmp = sqrt(Float64(Float64(Float64(-4.0 * Float64(Float64(n * l) * Float64(U * l))) / Om) + Float64(2.0 * Float64(U * Float64(n * t))))); else tmp = t_1; end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = sqrt(((2.0 * (U * n)) * (t + ((l / Om) * ((U_42_ * (n * l)) / Om))))); tmp = 0.0; if (n <= -1.12e-23) tmp = t_1; elseif (n <= 3.7e-69) tmp = sqrt((((-4.0 * ((n * l) * (U * l))) / Om) + (2.0 * (U * (n * t))))); else tmp = t_1; end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[Sqrt[N[(N[(2.0 * N[(U * n), $MachinePrecision]), $MachinePrecision] * N[(t + N[(N[(l / Om), $MachinePrecision] * N[(N[(U$42$ * N[(n * l), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[n, -1.12e-23], t$95$1, If[LessEqual[n, 3.7e-69], N[Sqrt[N[(N[(N[(-4.0 * N[(N[(n * l), $MachinePrecision] * N[(U * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision] + N[(2.0 * N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], t$95$1]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \sqrt{\left(2 \cdot \left(U \cdot n\right)\right) \cdot \left(t + \frac{\ell}{Om} \cdot \frac{U* \cdot \left(n \cdot \ell\right)}{Om}\right)}\\
\mathbf{if}\;n \leq -1.12 \cdot 10^{-23}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;n \leq 3.7 \cdot 10^{-69}:\\
\;\;\;\;\sqrt{\frac{-4 \cdot \left(\left(n \cdot \ell\right) \cdot \left(U \cdot \ell\right)\right)}{Om} + 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if n < -1.1200000000000001e-23 or 3.7000000000000002e-69 < n Initial program 54.0%
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sub-negN/A
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
Simplified61.2%
Taylor expanded in U* around inf
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6455.7%
Simplified55.7%
if -1.1200000000000001e-23 < n < 3.7000000000000002e-69Initial program 40.8%
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sub-negN/A
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
Simplified48.1%
+-commutativeN/A
distribute-lft-inN/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
fma-defineN/A
fma-lowering-fma.f64N/A
Applied egg-rr63.1%
Taylor expanded in Om around inf
+-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
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6451.8%
Simplified51.8%
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6459.9%
Applied egg-rr59.9%
Final simplification57.8%
(FPCore (n U t l Om U*)
:precision binary64
(if (<= l 4.8e-173)
(sqrt (* (* 2.0 (* U n)) (+ t (* (/ l Om) (/ (* U* (* n l)) Om)))))
(sqrt
(*
(* n (+ t (* (+ -2.0 (/ n (/ Om (- U* U)))) (* l (/ l Om)))))
(* U 2.0)))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 4.8e-173) {
tmp = sqrt(((2.0 * (U * n)) * (t + ((l / Om) * ((U_42_ * (n * l)) / Om)))));
} else {
tmp = sqrt(((n * (t + ((-2.0 + (n / (Om / (U_42_ - U)))) * (l * (l / Om))))) * (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 (l <= 4.8d-173) then
tmp = sqrt(((2.0d0 * (u * n)) * (t + ((l / om) * ((u_42 * (n * l)) / om)))))
else
tmp = sqrt(((n * (t + (((-2.0d0) + (n / (om / (u_42 - u)))) * (l * (l / om))))) * (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 (l <= 4.8e-173) {
tmp = Math.sqrt(((2.0 * (U * n)) * (t + ((l / Om) * ((U_42_ * (n * l)) / Om)))));
} else {
tmp = Math.sqrt(((n * (t + ((-2.0 + (n / (Om / (U_42_ - U)))) * (l * (l / Om))))) * (U * 2.0)));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 4.8e-173: tmp = math.sqrt(((2.0 * (U * n)) * (t + ((l / Om) * ((U_42_ * (n * l)) / Om))))) else: tmp = math.sqrt(((n * (t + ((-2.0 + (n / (Om / (U_42_ - U)))) * (l * (l / Om))))) * (U * 2.0))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 4.8e-173) tmp = sqrt(Float64(Float64(2.0 * Float64(U * n)) * Float64(t + Float64(Float64(l / Om) * Float64(Float64(U_42_ * Float64(n * l)) / Om))))); else tmp = sqrt(Float64(Float64(n * Float64(t + Float64(Float64(-2.0 + Float64(n / Float64(Om / Float64(U_42_ - U)))) * Float64(l * Float64(l / Om))))) * Float64(U * 2.0))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 4.8e-173) tmp = sqrt(((2.0 * (U * n)) * (t + ((l / Om) * ((U_42_ * (n * l)) / Om))))); else tmp = sqrt(((n * (t + ((-2.0 + (n / (Om / (U_42_ - U)))) * (l * (l / Om))))) * (U * 2.0))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 4.8e-173], N[Sqrt[N[(N[(2.0 * N[(U * n), $MachinePrecision]), $MachinePrecision] * N[(t + N[(N[(l / Om), $MachinePrecision] * N[(N[(U$42$ * N[(n * l), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(n * N[(t + N[(N[(-2.0 + N[(n / N[(Om / N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(U * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 4.8 \cdot 10^{-173}:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(U \cdot n\right)\right) \cdot \left(t + \frac{\ell}{Om} \cdot \frac{U* \cdot \left(n \cdot \ell\right)}{Om}\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(n \cdot \left(t + \left(-2 + \frac{n}{\frac{Om}{U* - U}}\right) \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right)\right) \cdot \left(U \cdot 2\right)}\\
\end{array}
\end{array}
if l < 4.80000000000000034e-173Initial program 50.7%
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sub-negN/A
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
Simplified57.2%
Taylor expanded in U* around inf
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6451.7%
Simplified51.7%
if 4.80000000000000034e-173 < l Initial program 40.3%
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sub-negN/A
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
Simplified49.1%
+-commutativeN/A
distribute-lft-inN/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
fma-defineN/A
fma-lowering-fma.f64N/A
Applied egg-rr60.2%
+-lowering-+.f64N/A
Applied egg-rr64.7%
distribute-lft-outN/A
*-commutativeN/A
Applied egg-rr64.0%
Final simplification55.7%
(FPCore (n U t l Om U*) :precision binary64 (if (<= l 1.95e+153) (sqrt (* (* U 2.0) (* n (- t (* 2.0 (/ (* l l) Om)))))) (sqrt (* (* 2.0 (* U n)) (+ t (* (* l -2.0) (/ l Om)))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 1.95e+153) {
tmp = sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om))))));
} else {
tmp = sqrt(((2.0 * (U * n)) * (t + ((l * -2.0) * (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.95d+153) then
tmp = sqrt(((u * 2.0d0) * (n * (t - (2.0d0 * ((l * l) / om))))))
else
tmp = sqrt(((2.0d0 * (u * n)) * (t + ((l * (-2.0d0)) * (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.95e+153) {
tmp = Math.sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om))))));
} else {
tmp = Math.sqrt(((2.0 * (U * n)) * (t + ((l * -2.0) * (l / Om)))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 1.95e+153: tmp = math.sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om)))))) else: tmp = math.sqrt(((2.0 * (U * n)) * (t + ((l * -2.0) * (l / Om))))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 1.95e+153) 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(U * n)) * Float64(t + Float64(Float64(l * -2.0) * Float64(l / Om))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 1.95e+153) tmp = sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om)))))); else tmp = sqrt(((2.0 * (U * n)) * (t + ((l * -2.0) * (l / Om))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 1.95e+153], 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[(U * n), $MachinePrecision]), $MachinePrecision] * N[(t + N[(N[(l * -2.0), $MachinePrecision] * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 1.95 \cdot 10^{+153}:\\
\;\;\;\;\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(2 \cdot \left(U \cdot n\right)\right) \cdot \left(t + \left(\ell \cdot -2\right) \cdot \frac{\ell}{Om}\right)}\\
\end{array}
\end{array}
if l < 1.94999999999999992e153Initial program 50.3%
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sub-negN/A
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
Simplified55.7%
Taylor expanded in n around 0
associate-*r*N/A
metadata-evalN/A
cancel-sign-sub-invN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6450.0%
Simplified50.0%
if 1.94999999999999992e153 < l Initial program 18.3%
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sub-negN/A
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
Simplified43.9%
Taylor expanded in n around 0
*-lowering-*.f6450.9%
Simplified50.9%
Final simplification50.1%
(FPCore (n U t l Om U*) :precision binary64 (if (<= l 1.8e+113) (pow (* U (* 2.0 (* n t))) 0.5) (sqrt (/ (* -4.0 (* n (* U (* l l)))) Om))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 1.8e+113) {
tmp = pow((U * (2.0 * (n * t))), 0.5);
} else {
tmp = sqrt(((-4.0 * (n * (U * (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.8d+113) then
tmp = (u * (2.0d0 * (n * t))) ** 0.5d0
else
tmp = sqrt((((-4.0d0) * (n * (u * (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.8e+113) {
tmp = Math.pow((U * (2.0 * (n * t))), 0.5);
} else {
tmp = Math.sqrt(((-4.0 * (n * (U * (l * l)))) / Om));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 1.8e+113: tmp = math.pow((U * (2.0 * (n * t))), 0.5) else: tmp = math.sqrt(((-4.0 * (n * (U * (l * l)))) / Om)) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 1.8e+113) tmp = Float64(U * Float64(2.0 * Float64(n * t))) ^ 0.5; else tmp = sqrt(Float64(Float64(-4.0 * Float64(n * Float64(U * 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.8e+113) tmp = (U * (2.0 * (n * t))) ^ 0.5; else tmp = sqrt(((-4.0 * (n * (U * (l * l)))) / Om)); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 1.8e+113], N[Power[N[(U * N[(2.0 * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[Sqrt[N[(N[(-4.0 * N[(n * N[(U * N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 1.8 \cdot 10^{+113}:\\
\;\;\;\;{\left(U \cdot \left(2 \cdot \left(n \cdot t\right)\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{-4 \cdot \left(n \cdot \left(U \cdot \left(\ell \cdot \ell\right)\right)\right)}{Om}}\\
\end{array}
\end{array}
if l < 1.79999999999999996e113Initial program 51.3%
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sub-negN/A
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
Simplified56.4%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6445.3%
Simplified45.3%
pow1/2N/A
*-commutativeN/A
associate-*l*N/A
associate-*l*N/A
*-commutativeN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6446.7%
Applied egg-rr46.7%
if 1.79999999999999996e113 < l Initial program 15.7%
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sub-negN/A
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
Simplified40.3%
+-commutativeN/A
distribute-lft-inN/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
fma-defineN/A
fma-lowering-fma.f64N/A
Applied egg-rr44.1%
Taylor expanded in Om around inf
+-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
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6423.1%
Simplified23.1%
Taylor expanded in l around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6426.6%
Simplified26.6%
Final simplification44.4%
(FPCore (n U t l Om U*) :precision binary64 (sqrt (* (* U 2.0) (* n (- t (* 2.0 (/ (* l l) Om)))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om))))));
}
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) * (n * (t - (2.0d0 * ((l * l) / om))))))
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) * (n * (t - (2.0 * ((l * l) / Om))))));
}
def code(n, U, t, l, Om, U_42_): return math.sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om))))))
function code(n, U, t, l, Om, U_42_) return sqrt(Float64(Float64(U * 2.0) * Float64(n * Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om)))))) end
function tmp = code(n, U, t, l, Om, U_42_) tmp = sqrt(((U * 2.0) * (n * (t - (2.0 * ((l * l) / Om)))))); end
code[n_, U_, t_, l_, Om_, U$42$_] := 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]
\begin{array}{l}
\\
\sqrt{\left(U \cdot 2\right) \cdot \left(n \cdot \left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right)\right)}
\end{array}
Initial program 47.3%
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sub-negN/A
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
Simplified54.6%
Taylor expanded in n around 0
associate-*r*N/A
metadata-evalN/A
cancel-sign-sub-invN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6447.1%
Simplified47.1%
Final simplification47.1%
(FPCore (n U t l Om U*) :precision binary64 (pow (* U (* 2.0 (* n t))) 0.5))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return pow((U * (2.0 * (n * t))), 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 = (u * (2.0d0 * (n * t))) ** 0.5d0
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.pow((U * (2.0 * (n * t))), 0.5);
}
def code(n, U, t, l, Om, U_42_): return math.pow((U * (2.0 * (n * t))), 0.5)
function code(n, U, t, l, Om, U_42_) return Float64(U * Float64(2.0 * Float64(n * t))) ^ 0.5 end
function tmp = code(n, U, t, l, Om, U_42_) tmp = (U * (2.0 * (n * t))) ^ 0.5; end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Power[N[(U * N[(2.0 * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]
\begin{array}{l}
\\
{\left(U \cdot \left(2 \cdot \left(n \cdot t\right)\right)\right)}^{0.5}
\end{array}
Initial program 47.3%
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sub-negN/A
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
Simplified54.6%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6440.8%
Simplified40.8%
pow1/2N/A
*-commutativeN/A
associate-*l*N/A
associate-*l*N/A
*-commutativeN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6442.5%
Applied egg-rr42.5%
(FPCore (n U t l Om U*) :precision binary64 (sqrt (* (* n t) (* U 2.0))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return sqrt(((n * t) * (U * 2.0)));
}
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 * t) * (u * 2.0d0)))
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.sqrt(((n * t) * (U * 2.0)));
}
def code(n, U, t, l, Om, U_42_): return math.sqrt(((n * t) * (U * 2.0)))
function code(n, U, t, l, Om, U_42_) return sqrt(Float64(Float64(n * t) * Float64(U * 2.0))) end
function tmp = code(n, U, t, l, Om, U_42_) tmp = sqrt(((n * t) * (U * 2.0))); end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Sqrt[N[(N[(n * t), $MachinePrecision] * N[(U * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\left(n \cdot t\right) \cdot \left(U \cdot 2\right)}
\end{array}
Initial program 47.3%
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sub-negN/A
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
Simplified54.6%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6440.8%
Simplified40.8%
Final simplification40.8%
herbie shell --seed 2024288
(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*))))))