
(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 21 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 (* (/ (* (fma (/ n Om) (- U U*) 2.0) l) Om) l)) (* n 2.0)))
(t_2 (/ (* l l) Om))
(t_3 (* (* 2.0 n) U))
(t_4
(sqrt
(*
t_3
(- (- t (* 2.0 t_2)) (* (* n (pow (/ l Om) 2.0)) (- U U*)))))))
(if (<= t_4 0.0)
(* (sqrt t_1) (sqrt U))
(if (<= t_4 2e+149)
(sqrt
(*
t_3
(fma (* (- (- U U*)) (/ l Om)) (* (/ l Om) n) (fma -2.0 t_2 t))))
(sqrt (* t_1 U))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (t - (((fma((n / Om), (U - U_42_), 2.0) * l) / Om) * l)) * (n * 2.0);
double t_2 = (l * l) / Om;
double t_3 = (2.0 * n) * U;
double t_4 = sqrt((t_3 * ((t - (2.0 * t_2)) - ((n * pow((l / Om), 2.0)) * (U - U_42_)))));
double tmp;
if (t_4 <= 0.0) {
tmp = sqrt(t_1) * sqrt(U);
} else if (t_4 <= 2e+149) {
tmp = sqrt((t_3 * fma((-(U - U_42_) * (l / Om)), ((l / Om) * n), fma(-2.0, t_2, t))));
} else {
tmp = sqrt((t_1 * U));
}
return tmp;
}
function code(n, U, t, l, Om, U_42_) t_1 = Float64(Float64(t - Float64(Float64(Float64(fma(Float64(n / Om), Float64(U - U_42_), 2.0) * l) / Om) * l)) * Float64(n * 2.0)) t_2 = Float64(Float64(l * l) / Om) t_3 = Float64(Float64(2.0 * n) * U) t_4 = sqrt(Float64(t_3 * Float64(Float64(t - Float64(2.0 * t_2)) - Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U - U_42_))))) tmp = 0.0 if (t_4 <= 0.0) tmp = Float64(sqrt(t_1) * sqrt(U)); elseif (t_4 <= 2e+149) tmp = sqrt(Float64(t_3 * fma(Float64(Float64(-Float64(U - U_42_)) * Float64(l / Om)), Float64(Float64(l / Om) * n), fma(-2.0, t_2, t)))); else tmp = sqrt(Float64(t_1 * U)); end return tmp end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(t - N[(N[(N[(N[(N[(n / Om), $MachinePrecision] * N[(U - U$42$), $MachinePrecision] + 2.0), $MachinePrecision] * l), $MachinePrecision] / Om), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * N[(n * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]}, Block[{t$95$3 = N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision]}, Block[{t$95$4 = N[Sqrt[N[(t$95$3 * N[(N[(t - N[(2.0 * t$95$2), $MachinePrecision]), $MachinePrecision] - N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$4, 0.0], N[(N[Sqrt[t$95$1], $MachinePrecision] * N[Sqrt[U], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, 2e+149], N[Sqrt[N[(t$95$3 * N[(N[((-N[(U - U$42$), $MachinePrecision]) * N[(l / Om), $MachinePrecision]), $MachinePrecision] * N[(N[(l / Om), $MachinePrecision] * n), $MachinePrecision] + N[(-2.0 * t$95$2 + t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(t$95$1 * U), $MachinePrecision]], $MachinePrecision]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \left(t - \frac{\mathsf{fma}\left(\frac{n}{Om}, U - U*, 2\right) \cdot \ell}{Om} \cdot \ell\right) \cdot \left(n \cdot 2\right)\\
t_2 := \frac{\ell \cdot \ell}{Om}\\
t_3 := \left(2 \cdot n\right) \cdot U\\
t_4 := \sqrt{t\_3 \cdot \left(\left(t - 2 \cdot t\_2\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)}\\
\mathbf{if}\;t\_4 \leq 0:\\
\;\;\;\;\sqrt{t\_1} \cdot \sqrt{U}\\
\mathbf{elif}\;t\_4 \leq 2 \cdot 10^{+149}:\\
\;\;\;\;\sqrt{t\_3 \cdot \mathsf{fma}\left(\left(-\left(U - U*\right)\right) \cdot \frac{\ell}{Om}, \frac{\ell}{Om} \cdot n, \mathsf{fma}\left(-2, t\_2, t\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{t\_1 \cdot U}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 0.0Initial program 8.3%
Taylor expanded in n around 0
mul-1-negN/A
unsub-negN/A
associate--r+N/A
+-commutativeN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
associate-/r*N/A
metadata-evalN/A
cancel-sign-sub-invN/A
associate-*r/N/A
Applied rewrites8.1%
Applied rewrites10.9%
Applied rewrites50.8%
if 0.0 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 2.0000000000000001e149Initial program 96.3%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lift-*.f64N/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
lower-neg.f64N/A
lower-*.f6497.8
lift--.f64N/A
Applied rewrites97.8%
if 2.0000000000000001e149 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) Initial program 23.7%
Taylor expanded in n around 0
mul-1-negN/A
unsub-negN/A
associate--r+N/A
+-commutativeN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
associate-/r*N/A
metadata-evalN/A
cancel-sign-sub-invN/A
associate-*r/N/A
Applied rewrites39.6%
Applied rewrites46.0%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites48.6%
Final simplification67.0%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1
(* (- t (* (/ (* (fma (/ n Om) (- U U*) 2.0) l) Om) l)) (* n 2.0)))
(t_2 (/ (* l l) Om))
(t_3 (* (* 2.0 n) U))
(t_4
(sqrt
(*
t_3
(- (- t (* 2.0 t_2)) (* (* n (pow (/ l Om) 2.0)) (- U U*)))))))
(if (<= t_4 0.0)
(* (sqrt t_1) (sqrt U))
(if (<= t_4 2e+149)
(sqrt (* t_3 (+ (fma -2.0 t_2 t) (* U* (* (/ n Om) (* (/ l Om) l))))))
(sqrt (* t_1 U))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (t - (((fma((n / Om), (U - U_42_), 2.0) * l) / Om) * l)) * (n * 2.0);
double t_2 = (l * l) / Om;
double t_3 = (2.0 * n) * U;
double t_4 = sqrt((t_3 * ((t - (2.0 * t_2)) - ((n * pow((l / Om), 2.0)) * (U - U_42_)))));
double tmp;
if (t_4 <= 0.0) {
tmp = sqrt(t_1) * sqrt(U);
} else if (t_4 <= 2e+149) {
tmp = sqrt((t_3 * (fma(-2.0, t_2, t) + (U_42_ * ((n / Om) * ((l / Om) * l))))));
} else {
tmp = sqrt((t_1 * U));
}
return tmp;
}
function code(n, U, t, l, Om, U_42_) t_1 = Float64(Float64(t - Float64(Float64(Float64(fma(Float64(n / Om), Float64(U - U_42_), 2.0) * l) / Om) * l)) * Float64(n * 2.0)) t_2 = Float64(Float64(l * l) / Om) t_3 = Float64(Float64(2.0 * n) * U) t_4 = sqrt(Float64(t_3 * Float64(Float64(t - Float64(2.0 * t_2)) - Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U - U_42_))))) tmp = 0.0 if (t_4 <= 0.0) tmp = Float64(sqrt(t_1) * sqrt(U)); elseif (t_4 <= 2e+149) tmp = sqrt(Float64(t_3 * Float64(fma(-2.0, t_2, t) + Float64(U_42_ * Float64(Float64(n / Om) * Float64(Float64(l / Om) * l)))))); else tmp = sqrt(Float64(t_1 * U)); end return tmp end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(t - N[(N[(N[(N[(N[(n / Om), $MachinePrecision] * N[(U - U$42$), $MachinePrecision] + 2.0), $MachinePrecision] * l), $MachinePrecision] / Om), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * N[(n * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]}, Block[{t$95$3 = N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision]}, Block[{t$95$4 = N[Sqrt[N[(t$95$3 * N[(N[(t - N[(2.0 * t$95$2), $MachinePrecision]), $MachinePrecision] - N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$4, 0.0], N[(N[Sqrt[t$95$1], $MachinePrecision] * N[Sqrt[U], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, 2e+149], N[Sqrt[N[(t$95$3 * N[(N[(-2.0 * t$95$2 + t), $MachinePrecision] + N[(U$42$ * N[(N[(n / Om), $MachinePrecision] * N[(N[(l / Om), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(t$95$1 * U), $MachinePrecision]], $MachinePrecision]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \left(t - \frac{\mathsf{fma}\left(\frac{n}{Om}, U - U*, 2\right) \cdot \ell}{Om} \cdot \ell\right) \cdot \left(n \cdot 2\right)\\
t_2 := \frac{\ell \cdot \ell}{Om}\\
t_3 := \left(2 \cdot n\right) \cdot U\\
t_4 := \sqrt{t\_3 \cdot \left(\left(t - 2 \cdot t\_2\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)}\\
\mathbf{if}\;t\_4 \leq 0:\\
\;\;\;\;\sqrt{t\_1} \cdot \sqrt{U}\\
\mathbf{elif}\;t\_4 \leq 2 \cdot 10^{+149}:\\
\;\;\;\;\sqrt{t\_3 \cdot \left(\mathsf{fma}\left(-2, t\_2, t\right) + U* \cdot \left(\frac{n}{Om} \cdot \left(\frac{\ell}{Om} \cdot \ell\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{t\_1 \cdot U}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 0.0Initial program 8.3%
Taylor expanded in n around 0
mul-1-negN/A
unsub-negN/A
associate--r+N/A
+-commutativeN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
associate-/r*N/A
metadata-evalN/A
cancel-sign-sub-invN/A
associate-*r/N/A
Applied rewrites8.1%
Applied rewrites10.9%
Applied rewrites50.8%
if 0.0 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 2.0000000000000001e149Initial program 96.3%
Taylor expanded in U around 0
+-commutativeN/A
associate--r+N/A
lower--.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
mul-1-negN/A
associate-/l*N/A
distribute-lft-neg-inN/A
neg-mul-1N/A
lower-*.f64N/A
neg-mul-1N/A
lower-neg.f64N/A
*-commutativeN/A
unpow2N/A
Applied rewrites92.6%
Applied rewrites95.8%
if 2.0000000000000001e149 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) Initial program 23.7%
Taylor expanded in n around 0
mul-1-negN/A
unsub-negN/A
associate--r+N/A
+-commutativeN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
associate-/r*N/A
metadata-evalN/A
cancel-sign-sub-invN/A
associate-*r/N/A
Applied rewrites39.6%
Applied rewrites46.0%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites48.6%
Final simplification66.2%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (/ (* l l) Om))
(t_2 (* (* 2.0 n) U))
(t_3
(sqrt
(*
t_2
(- (- t (* 2.0 t_1)) (* (* n (pow (/ l Om) 2.0)) (- U U*)))))))
(if (<= t_3 1e-118)
(sqrt (* (* (* (fma -2.0 t_1 t) U) 2.0) n))
(if (<= t_3 2e+149)
(sqrt (* t_2 (- t (* l (/ (* (- U*) (/ (* l n) Om)) Om)))))
(sqrt
(*
(* -2.0 U)
(* (* (* (fma (- U U*) (/ n Om) 2.0) (/ l Om)) l) n)))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (l * l) / Om;
double t_2 = (2.0 * n) * U;
double t_3 = sqrt((t_2 * ((t - (2.0 * t_1)) - ((n * pow((l / Om), 2.0)) * (U - U_42_)))));
double tmp;
if (t_3 <= 1e-118) {
tmp = sqrt((((fma(-2.0, t_1, t) * U) * 2.0) * n));
} else if (t_3 <= 2e+149) {
tmp = sqrt((t_2 * (t - (l * ((-U_42_ * ((l * n) / Om)) / Om)))));
} else {
tmp = sqrt(((-2.0 * U) * (((fma((U - U_42_), (n / Om), 2.0) * (l / Om)) * l) * n)));
}
return tmp;
}
function code(n, U, t, l, Om, U_42_) t_1 = Float64(Float64(l * l) / Om) t_2 = Float64(Float64(2.0 * n) * U) t_3 = sqrt(Float64(t_2 * Float64(Float64(t - Float64(2.0 * t_1)) - Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U - U_42_))))) tmp = 0.0 if (t_3 <= 1e-118) tmp = sqrt(Float64(Float64(Float64(fma(-2.0, t_1, t) * U) * 2.0) * n)); elseif (t_3 <= 2e+149) tmp = sqrt(Float64(t_2 * Float64(t - Float64(l * Float64(Float64(Float64(-U_42_) * Float64(Float64(l * n) / Om)) / Om))))); else tmp = sqrt(Float64(Float64(-2.0 * U) * Float64(Float64(Float64(fma(Float64(U - U_42_), Float64(n / Om), 2.0) * Float64(l / Om)) * l) * n))); end return tmp end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]}, Block[{t$95$2 = N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(t$95$2 * N[(N[(t - N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision] - N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$3, 1e-118], N[Sqrt[N[(N[(N[(N[(-2.0 * t$95$1 + t), $MachinePrecision] * U), $MachinePrecision] * 2.0), $MachinePrecision] * n), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$3, 2e+149], N[Sqrt[N[(t$95$2 * N[(t - N[(l * N[(N[((-U$42$) * N[(N[(l * n), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(-2.0 * U), $MachinePrecision] * N[(N[(N[(N[(N[(U - U$42$), $MachinePrecision] * N[(n / Om), $MachinePrecision] + 2.0), $MachinePrecision] * N[(l / Om), $MachinePrecision]), $MachinePrecision] * l), $MachinePrecision] * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \frac{\ell \cdot \ell}{Om}\\
t_2 := \left(2 \cdot n\right) \cdot U\\
t_3 := \sqrt{t\_2 \cdot \left(\left(t - 2 \cdot t\_1\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)}\\
\mathbf{if}\;t\_3 \leq 10^{-118}:\\
\;\;\;\;\sqrt{\left(\left(\mathsf{fma}\left(-2, t\_1, t\right) \cdot U\right) \cdot 2\right) \cdot n}\\
\mathbf{elif}\;t\_3 \leq 2 \cdot 10^{+149}:\\
\;\;\;\;\sqrt{t\_2 \cdot \left(t - \ell \cdot \frac{\left(-U*\right) \cdot \frac{\ell \cdot n}{Om}}{Om}\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(-2 \cdot U\right) \cdot \left(\left(\left(\mathsf{fma}\left(U - U*, \frac{n}{Om}, 2\right) \cdot \frac{\ell}{Om}\right) \cdot \ell\right) \cdot n\right)}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 9.99999999999999985e-119Initial program 28.3%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites55.0%
Taylor expanded in n around 0
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6452.9
Applied rewrites52.9%
if 9.99999999999999985e-119 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 2.0000000000000001e149Initial program 96.8%
Taylor expanded in n around 0
mul-1-negN/A
unsub-negN/A
associate--r+N/A
+-commutativeN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
associate-/r*N/A
metadata-evalN/A
cancel-sign-sub-invN/A
associate-*r/N/A
Applied rewrites90.2%
Applied rewrites90.5%
Taylor expanded in U* around inf
Applied rewrites83.0%
if 2.0000000000000001e149 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) Initial program 23.7%
Taylor expanded in t around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
Applied rewrites37.0%
Applied rewrites43.4%
Final simplification57.9%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (/ (* l l) Om))
(t_2 (* (* 2.0 n) U))
(t_3
(sqrt
(*
t_2
(- (- t (* 2.0 t_1)) (* (* n (pow (/ l Om) 2.0)) (- U U*)))))))
(if (<= t_3 0.0)
(* (sqrt (* (fma -2.0 t_1 t) (* n 2.0))) (sqrt U))
(if (<= t_3 2e+149)
(sqrt (* t_2 (- t (* l (/ (* l 2.0) Om)))))
(sqrt
(*
(* -2.0 U)
(* (* (* (fma (- U U*) (/ n Om) 2.0) (/ l Om)) l) n)))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (l * l) / Om;
double t_2 = (2.0 * n) * U;
double t_3 = sqrt((t_2 * ((t - (2.0 * t_1)) - ((n * pow((l / Om), 2.0)) * (U - U_42_)))));
double tmp;
if (t_3 <= 0.0) {
tmp = sqrt((fma(-2.0, t_1, t) * (n * 2.0))) * sqrt(U);
} else if (t_3 <= 2e+149) {
tmp = sqrt((t_2 * (t - (l * ((l * 2.0) / Om)))));
} else {
tmp = sqrt(((-2.0 * U) * (((fma((U - U_42_), (n / Om), 2.0) * (l / Om)) * l) * n)));
}
return tmp;
}
function code(n, U, t, l, Om, U_42_) t_1 = Float64(Float64(l * l) / Om) t_2 = Float64(Float64(2.0 * n) * U) t_3 = sqrt(Float64(t_2 * Float64(Float64(t - Float64(2.0 * t_1)) - Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U - U_42_))))) tmp = 0.0 if (t_3 <= 0.0) tmp = Float64(sqrt(Float64(fma(-2.0, t_1, t) * Float64(n * 2.0))) * sqrt(U)); elseif (t_3 <= 2e+149) tmp = sqrt(Float64(t_2 * Float64(t - Float64(l * Float64(Float64(l * 2.0) / Om))))); else tmp = sqrt(Float64(Float64(-2.0 * U) * Float64(Float64(Float64(fma(Float64(U - U_42_), Float64(n / Om), 2.0) * Float64(l / Om)) * l) * n))); end return tmp end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]}, Block[{t$95$2 = N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(t$95$2 * N[(N[(t - N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision] - N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$3, 0.0], N[(N[Sqrt[N[(N[(-2.0 * t$95$1 + t), $MachinePrecision] * N[(n * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[U], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 2e+149], N[Sqrt[N[(t$95$2 * N[(t - N[(l * N[(N[(l * 2.0), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(-2.0 * U), $MachinePrecision] * N[(N[(N[(N[(N[(U - U$42$), $MachinePrecision] * N[(n / Om), $MachinePrecision] + 2.0), $MachinePrecision] * N[(l / Om), $MachinePrecision]), $MachinePrecision] * l), $MachinePrecision] * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \frac{\ell \cdot \ell}{Om}\\
t_2 := \left(2 \cdot n\right) \cdot U\\
t_3 := \sqrt{t\_2 \cdot \left(\left(t - 2 \cdot t\_1\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)}\\
\mathbf{if}\;t\_3 \leq 0:\\
\;\;\;\;\sqrt{\mathsf{fma}\left(-2, t\_1, t\right) \cdot \left(n \cdot 2\right)} \cdot \sqrt{U}\\
\mathbf{elif}\;t\_3 \leq 2 \cdot 10^{+149}:\\
\;\;\;\;\sqrt{t\_2 \cdot \left(t - \ell \cdot \frac{\ell \cdot 2}{Om}\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(-2 \cdot U\right) \cdot \left(\left(\left(\mathsf{fma}\left(U - U*, \frac{n}{Om}, 2\right) \cdot \frac{\ell}{Om}\right) \cdot \ell\right) \cdot n\right)}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 0.0Initial program 8.3%
Taylor expanded in n around 0
mul-1-negN/A
unsub-negN/A
associate--r+N/A
+-commutativeN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
associate-/r*N/A
metadata-evalN/A
cancel-sign-sub-invN/A
associate-*r/N/A
Applied rewrites8.1%
Applied rewrites10.9%
Applied rewrites50.8%
Taylor expanded in n around 0
Applied rewrites42.4%
if 0.0 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 2.0000000000000001e149Initial program 96.3%
Taylor expanded in n around 0
mul-1-negN/A
unsub-negN/A
associate--r+N/A
+-commutativeN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
associate-/r*N/A
metadata-evalN/A
cancel-sign-sub-invN/A
associate-*r/N/A
Applied rewrites90.4%
Applied rewrites90.7%
Taylor expanded in n around 0
Applied rewrites80.9%
if 2.0000000000000001e149 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) Initial program 23.7%
Taylor expanded in t around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
Applied rewrites37.0%
Applied rewrites43.4%
Final simplification57.0%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* (* 2.0 n) U))
(t_2
(*
t_1
(-
(- t (* 2.0 (/ (* l l) Om)))
(* (* n (pow (/ l Om) 2.0)) (- U U*))))))
(if (<= t_2 5e-307)
(sqrt (* (* (- t (* (/ (* 2.0 l) Om) l)) (* n 2.0)) U))
(if (<= t_2 INFINITY)
(sqrt (* t_1 (- t (* l (/ (* l 2.0) Om)))))
(sqrt (* (* (/ 2.0 Om) (/ (* (* (* (* l l) n) U*) U) Om)) n))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (2.0 * n) * U;
double t_2 = t_1 * ((t - (2.0 * ((l * l) / Om))) - ((n * pow((l / Om), 2.0)) * (U - U_42_)));
double tmp;
if (t_2 <= 5e-307) {
tmp = sqrt((((t - (((2.0 * l) / Om) * l)) * (n * 2.0)) * U));
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt((t_1 * (t - (l * ((l * 2.0) / Om)))));
} else {
tmp = sqrt((((2.0 / Om) * (((((l * l) * n) * U_42_) * U) / Om)) * n));
}
return tmp;
}
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (2.0 * n) * U;
double t_2 = t_1 * ((t - (2.0 * ((l * l) / Om))) - ((n * Math.pow((l / Om), 2.0)) * (U - U_42_)));
double tmp;
if (t_2 <= 5e-307) {
tmp = Math.sqrt((((t - (((2.0 * l) / Om) * l)) * (n * 2.0)) * U));
} else if (t_2 <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt((t_1 * (t - (l * ((l * 2.0) / Om)))));
} else {
tmp = Math.sqrt((((2.0 / Om) * (((((l * l) * n) * U_42_) * U) / Om)) * n));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = (2.0 * n) * U t_2 = t_1 * ((t - (2.0 * ((l * l) / Om))) - ((n * math.pow((l / Om), 2.0)) * (U - U_42_))) tmp = 0 if t_2 <= 5e-307: tmp = math.sqrt((((t - (((2.0 * l) / Om) * l)) * (n * 2.0)) * U)) elif t_2 <= math.inf: tmp = math.sqrt((t_1 * (t - (l * ((l * 2.0) / Om))))) else: tmp = math.sqrt((((2.0 / Om) * (((((l * l) * n) * U_42_) * U) / Om)) * n)) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(Float64(2.0 * n) * U) t_2 = Float64(t_1 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) - Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U - U_42_)))) tmp = 0.0 if (t_2 <= 5e-307) tmp = sqrt(Float64(Float64(Float64(t - Float64(Float64(Float64(2.0 * l) / Om) * l)) * Float64(n * 2.0)) * U)); elseif (t_2 <= Inf) tmp = sqrt(Float64(t_1 * Float64(t - Float64(l * Float64(Float64(l * 2.0) / Om))))); else tmp = sqrt(Float64(Float64(Float64(2.0 / Om) * Float64(Float64(Float64(Float64(Float64(l * l) * n) * U_42_) * U) / Om)) * n)); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = (2.0 * n) * U; t_2 = t_1 * ((t - (2.0 * ((l * l) / Om))) - ((n * ((l / Om) ^ 2.0)) * (U - U_42_))); tmp = 0.0; if (t_2 <= 5e-307) tmp = sqrt((((t - (((2.0 * l) / Om) * l)) * (n * 2.0)) * U)); elseif (t_2 <= Inf) tmp = sqrt((t_1 * (t - (l * ((l * 2.0) / Om))))); else tmp = sqrt((((2.0 / Om) * (((((l * l) * n) * U_42_) * U) / Om)) * n)); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * 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]}, If[LessEqual[t$95$2, 5e-307], N[Sqrt[N[(N[(N[(t - N[(N[(N[(2.0 * l), $MachinePrecision] / Om), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * N[(n * 2.0), $MachinePrecision]), $MachinePrecision] * U), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[Sqrt[N[(t$95$1 * N[(t - N[(l * N[(N[(l * 2.0), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(N[(2.0 / Om), $MachinePrecision] * N[(N[(N[(N[(N[(l * l), $MachinePrecision] * n), $MachinePrecision] * U$42$), $MachinePrecision] * U), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] * n), $MachinePrecision]], $MachinePrecision]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \left(2 \cdot n\right) \cdot U\\
t_2 := t\_1 \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)\\
\mathbf{if}\;t\_2 \leq 5 \cdot 10^{-307}:\\
\;\;\;\;\sqrt{\left(\left(t - \frac{2 \cdot \ell}{Om} \cdot \ell\right) \cdot \left(n \cdot 2\right)\right) \cdot U}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\sqrt{t\_1 \cdot \left(t - \ell \cdot \frac{\ell \cdot 2}{Om}\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(\frac{2}{Om} \cdot \frac{\left(\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U*\right) \cdot U}{Om}\right) \cdot n}\\
\end{array}
\end{array}
if (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < 5.00000000000000014e-307Initial program 10.7%
Taylor expanded in n around 0
mul-1-negN/A
unsub-negN/A
associate--r+N/A
+-commutativeN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
associate-/r*N/A
metadata-evalN/A
cancel-sign-sub-invN/A
associate-*r/N/A
Applied rewrites19.8%
Applied rewrites24.4%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites50.8%
Taylor expanded in n around 0
Applied rewrites41.2%
if 5.00000000000000014e-307 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < +inf.0Initial program 67.5%
Taylor expanded in n around 0
mul-1-negN/A
unsub-negN/A
associate--r+N/A
+-commutativeN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
associate-/r*N/A
metadata-evalN/A
cancel-sign-sub-invN/A
associate-*r/N/A
Applied rewrites65.2%
Applied rewrites69.3%
Taylor expanded in n around 0
Applied rewrites59.9%
if +inf.0 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) Initial program 0.0%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites3.5%
Taylor expanded in U* around inf
associate-*r/N/A
unpow2N/A
times-fracN/A
metadata-evalN/A
associate-*r/N/A
lower-*.f64N/A
associate-*r/N/A
metadata-evalN/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6448.8
Applied rewrites48.8%
Final simplification55.1%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* (* 2.0 n) U))
(t_2
(*
t_1
(-
(- t (* 2.0 (/ (* l l) Om)))
(* (* n (pow (/ l Om) 2.0)) (- U U*))))))
(if (<= t_2 5e-307)
(sqrt (* (* (- t (* (/ (* 2.0 l) Om) l)) (* n 2.0)) U))
(if (<= t_2 INFINITY)
(sqrt (* t_1 (- t (* l (/ (* l 2.0) Om)))))
(sqrt (* (* -2.0 (/ (* (* (* l n) (* l n)) (- U U*)) (* Om Om))) U))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (2.0 * n) * U;
double t_2 = t_1 * ((t - (2.0 * ((l * l) / Om))) - ((n * pow((l / Om), 2.0)) * (U - U_42_)));
double tmp;
if (t_2 <= 5e-307) {
tmp = sqrt((((t - (((2.0 * l) / Om) * l)) * (n * 2.0)) * U));
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt((t_1 * (t - (l * ((l * 2.0) / Om)))));
} else {
tmp = sqrt(((-2.0 * ((((l * n) * (l * n)) * (U - U_42_)) / (Om * Om))) * U));
}
return tmp;
}
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (2.0 * n) * U;
double t_2 = t_1 * ((t - (2.0 * ((l * l) / Om))) - ((n * Math.pow((l / Om), 2.0)) * (U - U_42_)));
double tmp;
if (t_2 <= 5e-307) {
tmp = Math.sqrt((((t - (((2.0 * l) / Om) * l)) * (n * 2.0)) * U));
} else if (t_2 <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt((t_1 * (t - (l * ((l * 2.0) / Om)))));
} else {
tmp = Math.sqrt(((-2.0 * ((((l * n) * (l * n)) * (U - U_42_)) / (Om * Om))) * U));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = (2.0 * n) * U t_2 = t_1 * ((t - (2.0 * ((l * l) / Om))) - ((n * math.pow((l / Om), 2.0)) * (U - U_42_))) tmp = 0 if t_2 <= 5e-307: tmp = math.sqrt((((t - (((2.0 * l) / Om) * l)) * (n * 2.0)) * U)) elif t_2 <= math.inf: tmp = math.sqrt((t_1 * (t - (l * ((l * 2.0) / Om))))) else: tmp = math.sqrt(((-2.0 * ((((l * n) * (l * n)) * (U - U_42_)) / (Om * Om))) * U)) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(Float64(2.0 * n) * U) t_2 = Float64(t_1 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) - Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U - U_42_)))) tmp = 0.0 if (t_2 <= 5e-307) tmp = sqrt(Float64(Float64(Float64(t - Float64(Float64(Float64(2.0 * l) / Om) * l)) * Float64(n * 2.0)) * U)); elseif (t_2 <= Inf) tmp = sqrt(Float64(t_1 * Float64(t - Float64(l * Float64(Float64(l * 2.0) / Om))))); else tmp = sqrt(Float64(Float64(-2.0 * Float64(Float64(Float64(Float64(l * n) * Float64(l * n)) * Float64(U - U_42_)) / Float64(Om * Om))) * U)); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = (2.0 * n) * U; t_2 = t_1 * ((t - (2.0 * ((l * l) / Om))) - ((n * ((l / Om) ^ 2.0)) * (U - U_42_))); tmp = 0.0; if (t_2 <= 5e-307) tmp = sqrt((((t - (((2.0 * l) / Om) * l)) * (n * 2.0)) * U)); elseif (t_2 <= Inf) tmp = sqrt((t_1 * (t - (l * ((l * 2.0) / Om))))); else tmp = sqrt(((-2.0 * ((((l * n) * (l * n)) * (U - U_42_)) / (Om * Om))) * U)); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * 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]}, If[LessEqual[t$95$2, 5e-307], N[Sqrt[N[(N[(N[(t - N[(N[(N[(2.0 * l), $MachinePrecision] / Om), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * N[(n * 2.0), $MachinePrecision]), $MachinePrecision] * U), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[Sqrt[N[(t$95$1 * N[(t - N[(l * N[(N[(l * 2.0), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(-2.0 * N[(N[(N[(N[(l * n), $MachinePrecision] * N[(l * n), $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision] / N[(Om * Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * U), $MachinePrecision]], $MachinePrecision]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \left(2 \cdot n\right) \cdot U\\
t_2 := t\_1 \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)\\
\mathbf{if}\;t\_2 \leq 5 \cdot 10^{-307}:\\
\;\;\;\;\sqrt{\left(\left(t - \frac{2 \cdot \ell}{Om} \cdot \ell\right) \cdot \left(n \cdot 2\right)\right) \cdot U}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\sqrt{t\_1 \cdot \left(t - \ell \cdot \frac{\ell \cdot 2}{Om}\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(-2 \cdot \frac{\left(\left(\ell \cdot n\right) \cdot \left(\ell \cdot n\right)\right) \cdot \left(U - U*\right)}{Om \cdot Om}\right) \cdot U}\\
\end{array}
\end{array}
if (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < 5.00000000000000014e-307Initial program 10.7%
Taylor expanded in n around 0
mul-1-negN/A
unsub-negN/A
associate--r+N/A
+-commutativeN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
associate-/r*N/A
metadata-evalN/A
cancel-sign-sub-invN/A
associate-*r/N/A
Applied rewrites19.8%
Applied rewrites24.4%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites50.8%
Taylor expanded in n around 0
Applied rewrites41.2%
if 5.00000000000000014e-307 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < +inf.0Initial program 67.5%
Taylor expanded in n around 0
mul-1-negN/A
unsub-negN/A
associate--r+N/A
+-commutativeN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
associate-/r*N/A
metadata-evalN/A
cancel-sign-sub-invN/A
associate-*r/N/A
Applied rewrites65.2%
Applied rewrites69.3%
Taylor expanded in n around 0
Applied rewrites59.9%
if +inf.0 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) Initial program 0.0%
Taylor expanded in n around 0
mul-1-negN/A
unsub-negN/A
associate--r+N/A
+-commutativeN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
associate-/r*N/A
metadata-evalN/A
cancel-sign-sub-invN/A
associate-*r/N/A
Applied rewrites40.7%
Applied rewrites41.2%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites53.0%
Taylor expanded in n around inf
lower-*.f64N/A
lower-/.f64N/A
associate-*r*N/A
lower-*.f64N/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
lower-*.f6442.8
Applied rewrites42.8%
Final simplification54.3%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* (* 2.0 n) U))
(t_2
(*
t_1
(-
(- t (* 2.0 (/ (* l l) Om)))
(* (* n (pow (/ l Om) 2.0)) (- U U*))))))
(if (<= t_2 5e-307)
(sqrt (* (* (- t (* (/ (* 2.0 l) Om) l)) (* n 2.0)) U))
(if (<= t_2 INFINITY)
(sqrt (* t_1 (- t (* l (/ (* l 2.0) Om)))))
(sqrt (* (* (* (* (* U* U) l) n) (/ (* l n) (* Om Om))) 2.0))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (2.0 * n) * U;
double t_2 = t_1 * ((t - (2.0 * ((l * l) / Om))) - ((n * pow((l / Om), 2.0)) * (U - U_42_)));
double tmp;
if (t_2 <= 5e-307) {
tmp = sqrt((((t - (((2.0 * l) / Om) * l)) * (n * 2.0)) * U));
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt((t_1 * (t - (l * ((l * 2.0) / Om)))));
} else {
tmp = sqrt((((((U_42_ * U) * l) * n) * ((l * n) / (Om * Om))) * 2.0));
}
return tmp;
}
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (2.0 * n) * U;
double t_2 = t_1 * ((t - (2.0 * ((l * l) / Om))) - ((n * Math.pow((l / Om), 2.0)) * (U - U_42_)));
double tmp;
if (t_2 <= 5e-307) {
tmp = Math.sqrt((((t - (((2.0 * l) / Om) * l)) * (n * 2.0)) * U));
} else if (t_2 <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt((t_1 * (t - (l * ((l * 2.0) / Om)))));
} else {
tmp = Math.sqrt((((((U_42_ * U) * l) * n) * ((l * n) / (Om * Om))) * 2.0));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = (2.0 * n) * U t_2 = t_1 * ((t - (2.0 * ((l * l) / Om))) - ((n * math.pow((l / Om), 2.0)) * (U - U_42_))) tmp = 0 if t_2 <= 5e-307: tmp = math.sqrt((((t - (((2.0 * l) / Om) * l)) * (n * 2.0)) * U)) elif t_2 <= math.inf: tmp = math.sqrt((t_1 * (t - (l * ((l * 2.0) / Om))))) else: tmp = math.sqrt((((((U_42_ * U) * l) * n) * ((l * n) / (Om * Om))) * 2.0)) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(Float64(2.0 * n) * U) t_2 = Float64(t_1 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) - Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U - U_42_)))) tmp = 0.0 if (t_2 <= 5e-307) tmp = sqrt(Float64(Float64(Float64(t - Float64(Float64(Float64(2.0 * l) / Om) * l)) * Float64(n * 2.0)) * U)); elseif (t_2 <= Inf) tmp = sqrt(Float64(t_1 * Float64(t - Float64(l * Float64(Float64(l * 2.0) / Om))))); else tmp = sqrt(Float64(Float64(Float64(Float64(Float64(U_42_ * U) * l) * n) * Float64(Float64(l * n) / Float64(Om * Om))) * 2.0)); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = (2.0 * n) * U; t_2 = t_1 * ((t - (2.0 * ((l * l) / Om))) - ((n * ((l / Om) ^ 2.0)) * (U - U_42_))); tmp = 0.0; if (t_2 <= 5e-307) tmp = sqrt((((t - (((2.0 * l) / Om) * l)) * (n * 2.0)) * U)); elseif (t_2 <= Inf) tmp = sqrt((t_1 * (t - (l * ((l * 2.0) / Om))))); else tmp = sqrt((((((U_42_ * U) * l) * n) * ((l * n) / (Om * Om))) * 2.0)); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * 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]}, If[LessEqual[t$95$2, 5e-307], N[Sqrt[N[(N[(N[(t - N[(N[(N[(2.0 * l), $MachinePrecision] / Om), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * N[(n * 2.0), $MachinePrecision]), $MachinePrecision] * U), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[Sqrt[N[(t$95$1 * N[(t - N[(l * N[(N[(l * 2.0), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(N[(N[(N[(U$42$ * U), $MachinePrecision] * l), $MachinePrecision] * n), $MachinePrecision] * N[(N[(l * n), $MachinePrecision] / N[(Om * Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \left(2 \cdot n\right) \cdot U\\
t_2 := t\_1 \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)\\
\mathbf{if}\;t\_2 \leq 5 \cdot 10^{-307}:\\
\;\;\;\;\sqrt{\left(\left(t - \frac{2 \cdot \ell}{Om} \cdot \ell\right) \cdot \left(n \cdot 2\right)\right) \cdot U}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\sqrt{t\_1 \cdot \left(t - \ell \cdot \frac{\ell \cdot 2}{Om}\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(\left(\left(\left(U* \cdot U\right) \cdot \ell\right) \cdot n\right) \cdot \frac{\ell \cdot n}{Om \cdot Om}\right) \cdot 2}\\
\end{array}
\end{array}
if (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < 5.00000000000000014e-307Initial program 10.7%
Taylor expanded in n around 0
mul-1-negN/A
unsub-negN/A
associate--r+N/A
+-commutativeN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
associate-/r*N/A
metadata-evalN/A
cancel-sign-sub-invN/A
associate-*r/N/A
Applied rewrites19.8%
Applied rewrites24.4%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites50.8%
Taylor expanded in n around 0
Applied rewrites41.2%
if 5.00000000000000014e-307 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < +inf.0Initial program 67.5%
Taylor expanded in n around 0
mul-1-negN/A
unsub-negN/A
associate--r+N/A
+-commutativeN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
associate-/r*N/A
metadata-evalN/A
cancel-sign-sub-invN/A
associate-*r/N/A
Applied rewrites65.2%
Applied rewrites69.3%
Taylor expanded in n around 0
Applied rewrites59.9%
if +inf.0 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) Initial program 0.0%
Taylor expanded in n around 0
mul-1-negN/A
unsub-negN/A
associate--r+N/A
+-commutativeN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
associate-/r*N/A
metadata-evalN/A
cancel-sign-sub-invN/A
associate-*r/N/A
Applied rewrites40.7%
Taylor expanded in U* around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6440.6
Applied rewrites40.6%
Applied rewrites40.6%
Final simplification54.0%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* (* 2.0 n) U))
(t_2
(*
t_1
(-
(- t (* 2.0 (/ (* l l) Om)))
(* (* n (pow (/ l Om) 2.0)) (- U U*))))))
(if (<= t_2 5e-307)
(sqrt (* (* (- t (* (/ (* 2.0 l) Om) l)) (* n 2.0)) U))
(if (<= t_2 INFINITY)
(sqrt (* t_1 (- t (* l (/ (* l 2.0) Om)))))
(* (sqrt (* U* U)) (/ (* (* (sqrt 2.0) n) l) Om))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (2.0 * n) * U;
double t_2 = t_1 * ((t - (2.0 * ((l * l) / Om))) - ((n * pow((l / Om), 2.0)) * (U - U_42_)));
double tmp;
if (t_2 <= 5e-307) {
tmp = sqrt((((t - (((2.0 * l) / Om) * l)) * (n * 2.0)) * U));
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt((t_1 * (t - (l * ((l * 2.0) / Om)))));
} else {
tmp = sqrt((U_42_ * U)) * (((sqrt(2.0) * n) * l) / Om);
}
return tmp;
}
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (2.0 * n) * U;
double t_2 = t_1 * ((t - (2.0 * ((l * l) / Om))) - ((n * Math.pow((l / Om), 2.0)) * (U - U_42_)));
double tmp;
if (t_2 <= 5e-307) {
tmp = Math.sqrt((((t - (((2.0 * l) / Om) * l)) * (n * 2.0)) * U));
} else if (t_2 <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt((t_1 * (t - (l * ((l * 2.0) / Om)))));
} else {
tmp = Math.sqrt((U_42_ * U)) * (((Math.sqrt(2.0) * n) * l) / Om);
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = (2.0 * n) * U t_2 = t_1 * ((t - (2.0 * ((l * l) / Om))) - ((n * math.pow((l / Om), 2.0)) * (U - U_42_))) tmp = 0 if t_2 <= 5e-307: tmp = math.sqrt((((t - (((2.0 * l) / Om) * l)) * (n * 2.0)) * U)) elif t_2 <= math.inf: tmp = math.sqrt((t_1 * (t - (l * ((l * 2.0) / Om))))) else: tmp = math.sqrt((U_42_ * U)) * (((math.sqrt(2.0) * n) * l) / Om) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(Float64(2.0 * n) * U) t_2 = Float64(t_1 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) - Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U - U_42_)))) tmp = 0.0 if (t_2 <= 5e-307) tmp = sqrt(Float64(Float64(Float64(t - Float64(Float64(Float64(2.0 * l) / Om) * l)) * Float64(n * 2.0)) * U)); elseif (t_2 <= Inf) tmp = sqrt(Float64(t_1 * Float64(t - Float64(l * Float64(Float64(l * 2.0) / Om))))); else tmp = Float64(sqrt(Float64(U_42_ * U)) * Float64(Float64(Float64(sqrt(2.0) * n) * l) / Om)); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = (2.0 * n) * U; t_2 = t_1 * ((t - (2.0 * ((l * l) / Om))) - ((n * ((l / Om) ^ 2.0)) * (U - U_42_))); tmp = 0.0; if (t_2 <= 5e-307) tmp = sqrt((((t - (((2.0 * l) / Om) * l)) * (n * 2.0)) * U)); elseif (t_2 <= Inf) tmp = sqrt((t_1 * (t - (l * ((l * 2.0) / Om))))); else tmp = sqrt((U_42_ * U)) * (((sqrt(2.0) * n) * l) / Om); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * 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]}, If[LessEqual[t$95$2, 5e-307], N[Sqrt[N[(N[(N[(t - N[(N[(N[(2.0 * l), $MachinePrecision] / Om), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * N[(n * 2.0), $MachinePrecision]), $MachinePrecision] * U), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[Sqrt[N[(t$95$1 * N[(t - N[(l * N[(N[(l * 2.0), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(U$42$ * U), $MachinePrecision]], $MachinePrecision] * N[(N[(N[(N[Sqrt[2.0], $MachinePrecision] * n), $MachinePrecision] * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \left(2 \cdot n\right) \cdot U\\
t_2 := t\_1 \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)\\
\mathbf{if}\;t\_2 \leq 5 \cdot 10^{-307}:\\
\;\;\;\;\sqrt{\left(\left(t - \frac{2 \cdot \ell}{Om} \cdot \ell\right) \cdot \left(n \cdot 2\right)\right) \cdot U}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\sqrt{t\_1 \cdot \left(t - \ell \cdot \frac{\ell \cdot 2}{Om}\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{U* \cdot U} \cdot \frac{\left(\sqrt{2} \cdot n\right) \cdot \ell}{Om}\\
\end{array}
\end{array}
if (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < 5.00000000000000014e-307Initial program 10.7%
Taylor expanded in n around 0
mul-1-negN/A
unsub-negN/A
associate--r+N/A
+-commutativeN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
associate-/r*N/A
metadata-evalN/A
cancel-sign-sub-invN/A
associate-*r/N/A
Applied rewrites19.8%
Applied rewrites24.4%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites50.8%
Taylor expanded in n around 0
Applied rewrites41.2%
if 5.00000000000000014e-307 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < +inf.0Initial program 67.5%
Taylor expanded in n around 0
mul-1-negN/A
unsub-negN/A
associate--r+N/A
+-commutativeN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
associate-/r*N/A
metadata-evalN/A
cancel-sign-sub-invN/A
associate-*r/N/A
Applied rewrites65.2%
Applied rewrites69.3%
Taylor expanded in n around 0
Applied rewrites59.9%
if +inf.0 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) Initial program 0.0%
Taylor expanded in U* around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f6428.5
Applied rewrites28.5%
Final simplification52.3%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1
(sqrt
(*
(* (* 2.0 n) U)
(-
(- t (* 2.0 (/ (* l l) Om)))
(* (* n (pow (/ l Om) 2.0)) (- U U*)))))))
(if (or (<= t_1 1e-153) (not (<= t_1 2e+149)))
(sqrt (* (* (* n t) U) 2.0))
(sqrt (* (* (* n U) t) 2.0)))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * pow((l / Om), 2.0)) * (U - U_42_)))));
double tmp;
if ((t_1 <= 1e-153) || !(t_1 <= 2e+149)) {
tmp = sqrt((((n * t) * U) * 2.0));
} else {
tmp = sqrt((((n * U) * t) * 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 = sqrt((((2.0d0 * n) * u) * ((t - (2.0d0 * ((l * l) / om))) - ((n * ((l / om) ** 2.0d0)) * (u - u_42)))))
if ((t_1 <= 1d-153) .or. (.not. (t_1 <= 2d+149))) then
tmp = sqrt((((n * t) * u) * 2.0d0))
else
tmp = sqrt((((n * u) * t) * 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 = Math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * Math.pow((l / Om), 2.0)) * (U - U_42_)))));
double tmp;
if ((t_1 <= 1e-153) || !(t_1 <= 2e+149)) {
tmp = Math.sqrt((((n * t) * U) * 2.0));
} else {
tmp = Math.sqrt((((n * U) * t) * 2.0));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * math.pow((l / Om), 2.0)) * (U - U_42_))))) tmp = 0 if (t_1 <= 1e-153) or not (t_1 <= 2e+149): tmp = math.sqrt((((n * t) * U) * 2.0)) else: tmp = math.sqrt((((n * U) * t) * 2.0)) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = 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_))))) tmp = 0.0 if ((t_1 <= 1e-153) || !(t_1 <= 2e+149)) tmp = sqrt(Float64(Float64(Float64(n * t) * U) * 2.0)); else tmp = sqrt(Float64(Float64(Float64(n * U) * t) * 2.0)); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * ((l / Om) ^ 2.0)) * (U - U_42_))))); tmp = 0.0; if ((t_1 <= 1e-153) || ~((t_1 <= 2e+149))) tmp = sqrt((((n * t) * U) * 2.0)); else tmp = sqrt((((n * U) * t) * 2.0)); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = 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]}, If[Or[LessEqual[t$95$1, 1e-153], N[Not[LessEqual[t$95$1, 2e+149]], $MachinePrecision]], N[Sqrt[N[(N[(N[(n * t), $MachinePrecision] * U), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(N[(n * U), $MachinePrecision] * t), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \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)}\\
\mathbf{if}\;t\_1 \leq 10^{-153} \lor \neg \left(t\_1 \leq 2 \cdot 10^{+149}\right):\\
\;\;\;\;\sqrt{\left(\left(n \cdot t\right) \cdot U\right) \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(\left(n \cdot U\right) \cdot t\right) \cdot 2}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 1.00000000000000004e-153 or 2.0000000000000001e149 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) Initial program 21.2%
Taylor expanded in t around inf
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6414.5
Applied rewrites14.5%
if 1.00000000000000004e-153 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 2.0000000000000001e149Initial program 96.4%
Taylor expanded in t around inf
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6458.2
Applied rewrites58.2%
Applied rewrites69.1%
Final simplification34.1%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (/ (* (fma (/ n Om) (- U U*) 2.0) l) Om)) (t_2 (* (* 2.0 n) U)))
(if (<=
(sqrt
(*
t_2
(-
(- t (* 2.0 (/ (* l l) Om)))
(* (* n (pow (/ l Om) 2.0)) (- U U*)))))
1e-153)
(sqrt (* (* (- t (* t_1 l)) (* n 2.0)) U))
(sqrt (* t_2 (- t (* l t_1)))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (fma((n / Om), (U - U_42_), 2.0) * l) / Om;
double t_2 = (2.0 * n) * U;
double tmp;
if (sqrt((t_2 * ((t - (2.0 * ((l * l) / Om))) - ((n * pow((l / Om), 2.0)) * (U - U_42_))))) <= 1e-153) {
tmp = sqrt((((t - (t_1 * l)) * (n * 2.0)) * U));
} else {
tmp = sqrt((t_2 * (t - (l * t_1))));
}
return tmp;
}
function code(n, U, t, l, Om, U_42_) t_1 = Float64(Float64(fma(Float64(n / Om), Float64(U - U_42_), 2.0) * l) / Om) t_2 = Float64(Float64(2.0 * n) * U) tmp = 0.0 if (sqrt(Float64(t_2 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) - Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U - U_42_))))) <= 1e-153) tmp = sqrt(Float64(Float64(Float64(t - Float64(t_1 * l)) * Float64(n * 2.0)) * U)); else tmp = sqrt(Float64(t_2 * Float64(t - Float64(l * t_1)))); end return tmp end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(N[(N[(n / Om), $MachinePrecision] * N[(U - U$42$), $MachinePrecision] + 2.0), $MachinePrecision] * l), $MachinePrecision] / Om), $MachinePrecision]}, Block[{t$95$2 = N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision]}, If[LessEqual[N[Sqrt[N[(t$95$2 * 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], 1e-153], N[Sqrt[N[(N[(N[(t - N[(t$95$1 * l), $MachinePrecision]), $MachinePrecision] * N[(n * 2.0), $MachinePrecision]), $MachinePrecision] * U), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(t$95$2 * N[(t - N[(l * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \frac{\mathsf{fma}\left(\frac{n}{Om}, U - U*, 2\right) \cdot \ell}{Om}\\
t_2 := \left(2 \cdot n\right) \cdot U\\
\mathbf{if}\;\sqrt{t\_2 \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)} \leq 10^{-153}:\\
\;\;\;\;\sqrt{\left(\left(t - t\_1 \cdot \ell\right) \cdot \left(n \cdot 2\right)\right) \cdot U}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{t\_2 \cdot \left(t - \ell \cdot t\_1\right)}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 1.00000000000000004e-153Initial program 12.7%
Taylor expanded in n around 0
mul-1-negN/A
unsub-negN/A
associate--r+N/A
+-commutativeN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
associate-/r*N/A
metadata-evalN/A
cancel-sign-sub-invN/A
associate-*r/N/A
Applied rewrites12.6%
Applied rewrites15.2%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites49.1%
if 1.00000000000000004e-153 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) Initial program 54.3%
Taylor expanded in n around 0
mul-1-negN/A
unsub-negN/A
associate--r+N/A
+-commutativeN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
associate-/r*N/A
metadata-evalN/A
cancel-sign-sub-invN/A
associate-*r/N/A
Applied rewrites61.0%
Applied rewrites64.8%
Final simplification62.5%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (/ (* (fma (/ n Om) (- U U*) 2.0) l) Om)) (t_2 (- t (* t_1 l))))
(if (<= n -3.6e+146)
(sqrt (* (* (* 2.0 n) U) (- t (* l t_1))))
(if (<= n -5e-310)
(sqrt (* (* t_2 (* n 2.0)) U))
(* (sqrt n) (sqrt (* 2.0 (* t_2 U))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (fma((n / Om), (U - U_42_), 2.0) * l) / Om;
double t_2 = t - (t_1 * l);
double tmp;
if (n <= -3.6e+146) {
tmp = sqrt((((2.0 * n) * U) * (t - (l * t_1))));
} else if (n <= -5e-310) {
tmp = sqrt(((t_2 * (n * 2.0)) * U));
} else {
tmp = sqrt(n) * sqrt((2.0 * (t_2 * U)));
}
return tmp;
}
function code(n, U, t, l, Om, U_42_) t_1 = Float64(Float64(fma(Float64(n / Om), Float64(U - U_42_), 2.0) * l) / Om) t_2 = Float64(t - Float64(t_1 * l)) tmp = 0.0 if (n <= -3.6e+146) tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(t - Float64(l * t_1)))); elseif (n <= -5e-310) tmp = sqrt(Float64(Float64(t_2 * Float64(n * 2.0)) * U)); else tmp = Float64(sqrt(n) * sqrt(Float64(2.0 * Float64(t_2 * U)))); end return tmp end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(N[(N[(n / Om), $MachinePrecision] * N[(U - U$42$), $MachinePrecision] + 2.0), $MachinePrecision] * l), $MachinePrecision] / Om), $MachinePrecision]}, Block[{t$95$2 = N[(t - N[(t$95$1 * l), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[n, -3.6e+146], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(t - N[(l * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[n, -5e-310], N[Sqrt[N[(N[(t$95$2 * N[(n * 2.0), $MachinePrecision]), $MachinePrecision] * U), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[n], $MachinePrecision] * N[Sqrt[N[(2.0 * N[(t$95$2 * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \frac{\mathsf{fma}\left(\frac{n}{Om}, U - U*, 2\right) \cdot \ell}{Om}\\
t_2 := t - t\_1 \cdot \ell\\
\mathbf{if}\;n \leq -3.6 \cdot 10^{+146}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t - \ell \cdot t\_1\right)}\\
\mathbf{elif}\;n \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\sqrt{\left(t\_2 \cdot \left(n \cdot 2\right)\right) \cdot U}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{n} \cdot \sqrt{2 \cdot \left(t\_2 \cdot U\right)}\\
\end{array}
\end{array}
if n < -3.5999999999999998e146Initial program 67.8%
Taylor expanded in n around 0
mul-1-negN/A
unsub-negN/A
associate--r+N/A
+-commutativeN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
associate-/r*N/A
metadata-evalN/A
cancel-sign-sub-invN/A
associate-*r/N/A
Applied rewrites77.6%
Applied rewrites84.1%
if -3.5999999999999998e146 < n < -4.999999999999985e-310Initial program 45.5%
Taylor expanded in n around 0
mul-1-negN/A
unsub-negN/A
associate--r+N/A
+-commutativeN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
associate-/r*N/A
metadata-evalN/A
cancel-sign-sub-invN/A
associate-*r/N/A
Applied rewrites51.3%
Applied rewrites57.4%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites63.3%
if -4.999999999999985e-310 < n Initial program 45.7%
Taylor expanded in n around 0
mul-1-negN/A
unsub-negN/A
associate--r+N/A
+-commutativeN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
associate-/r*N/A
metadata-evalN/A
cancel-sign-sub-invN/A
associate-*r/N/A
Applied rewrites50.6%
Applied rewrites52.3%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
Applied rewrites64.0%
Final simplification66.1%
(FPCore (n U t l Om U*)
:precision binary64
(if (<= l 2.8e-209)
(sqrt (* (* (- t (* (* (- U*) (* (/ l Om) (/ n Om))) l)) (* n 2.0)) U))
(if (<= l 9.2e-77)
(sqrt (* (* (* (fma -2.0 (/ (* l l) Om) t) U) 2.0) n))
(if (<= l 2.7e+148)
(sqrt
(* (* (* 2.0 n) U) (- t (* (* l l) (/ (- 2.0 (/ (* n U*) Om)) Om)))))
(sqrt
(*
(* -2.0 U)
(* (* (* (fma (- U U*) (/ n Om) 2.0) (/ l Om)) l) n)))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 2.8e-209) {
tmp = sqrt((((t - ((-U_42_ * ((l / Om) * (n / Om))) * l)) * (n * 2.0)) * U));
} else if (l <= 9.2e-77) {
tmp = sqrt((((fma(-2.0, ((l * l) / Om), t) * U) * 2.0) * n));
} else if (l <= 2.7e+148) {
tmp = sqrt((((2.0 * n) * U) * (t - ((l * l) * ((2.0 - ((n * U_42_) / Om)) / Om)))));
} else {
tmp = sqrt(((-2.0 * U) * (((fma((U - U_42_), (n / Om), 2.0) * (l / Om)) * l) * n)));
}
return tmp;
}
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 2.8e-209) tmp = sqrt(Float64(Float64(Float64(t - Float64(Float64(Float64(-U_42_) * Float64(Float64(l / Om) * Float64(n / Om))) * l)) * Float64(n * 2.0)) * U)); elseif (l <= 9.2e-77) tmp = sqrt(Float64(Float64(Float64(fma(-2.0, Float64(Float64(l * l) / Om), t) * U) * 2.0) * n)); elseif (l <= 2.7e+148) tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(t - Float64(Float64(l * l) * Float64(Float64(2.0 - Float64(Float64(n * U_42_) / Om)) / Om))))); else tmp = sqrt(Float64(Float64(-2.0 * U) * Float64(Float64(Float64(fma(Float64(U - U_42_), Float64(n / Om), 2.0) * Float64(l / Om)) * l) * n))); end return tmp end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 2.8e-209], N[Sqrt[N[(N[(N[(t - N[(N[((-U$42$) * N[(N[(l / Om), $MachinePrecision] * N[(n / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * N[(n * 2.0), $MachinePrecision]), $MachinePrecision] * U), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 9.2e-77], N[Sqrt[N[(N[(N[(N[(-2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision] + t), $MachinePrecision] * U), $MachinePrecision] * 2.0), $MachinePrecision] * n), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 2.7e+148], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(t - N[(N[(l * l), $MachinePrecision] * N[(N[(2.0 - N[(N[(n * U$42$), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(-2.0 * U), $MachinePrecision] * N[(N[(N[(N[(N[(U - U$42$), $MachinePrecision] * N[(n / Om), $MachinePrecision] + 2.0), $MachinePrecision] * N[(l / Om), $MachinePrecision]), $MachinePrecision] * l), $MachinePrecision] * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 2.8 \cdot 10^{-209}:\\
\;\;\;\;\sqrt{\left(\left(t - \left(\left(-U*\right) \cdot \left(\frac{\ell}{Om} \cdot \frac{n}{Om}\right)\right) \cdot \ell\right) \cdot \left(n \cdot 2\right)\right) \cdot U}\\
\mathbf{elif}\;\ell \leq 9.2 \cdot 10^{-77}:\\
\;\;\;\;\sqrt{\left(\left(\mathsf{fma}\left(-2, \frac{\ell \cdot \ell}{Om}, t\right) \cdot U\right) \cdot 2\right) \cdot n}\\
\mathbf{elif}\;\ell \leq 2.7 \cdot 10^{+148}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t - \left(\ell \cdot \ell\right) \cdot \frac{2 - \frac{n \cdot U*}{Om}}{Om}\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(-2 \cdot U\right) \cdot \left(\left(\left(\mathsf{fma}\left(U - U*, \frac{n}{Om}, 2\right) \cdot \frac{\ell}{Om}\right) \cdot \ell\right) \cdot n\right)}\\
\end{array}
\end{array}
if l < 2.80000000000000012e-209Initial program 51.1%
Taylor expanded in n around 0
mul-1-negN/A
unsub-negN/A
associate--r+N/A
+-commutativeN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
associate-/r*N/A
metadata-evalN/A
cancel-sign-sub-invN/A
associate-*r/N/A
Applied rewrites53.5%
Applied rewrites58.3%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites59.4%
Taylor expanded in U* around inf
Applied rewrites57.0%
if 2.80000000000000012e-209 < l < 9.19999999999999994e-77Initial program 48.8%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites55.1%
Taylor expanded in n around 0
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6458.6
Applied rewrites58.6%
if 9.19999999999999994e-77 < l < 2.70000000000000019e148Initial program 58.4%
Taylor expanded in n around 0
mul-1-negN/A
unsub-negN/A
associate--r+N/A
+-commutativeN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
associate-/r*N/A
metadata-evalN/A
cancel-sign-sub-invN/A
associate-*r/N/A
Applied rewrites65.0%
Taylor expanded in U around 0
Applied rewrites64.7%
if 2.70000000000000019e148 < l Initial program 16.7%
Taylor expanded in t around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
Applied rewrites37.3%
Applied rewrites56.1%
Final simplification58.9%
(FPCore (n U t l Om U*)
:precision binary64
(if (<= l 2.1e-237)
(sqrt (* (* (- t (* (* (- U*) (* (/ l Om) (/ n Om))) l)) (* n 2.0)) U))
(if (<= l 8e-107)
(sqrt (* (* (* 2.0 n) U) (- t (* l (/ (* (- U*) (/ (* l n) Om)) Om)))))
(sqrt
(*
(* (- t (* (/ (* (fma (/ n Om) (- U U*) 2.0) l) Om) l)) (* n 2.0))
U)))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 2.1e-237) {
tmp = sqrt((((t - ((-U_42_ * ((l / Om) * (n / Om))) * l)) * (n * 2.0)) * U));
} else if (l <= 8e-107) {
tmp = sqrt((((2.0 * n) * U) * (t - (l * ((-U_42_ * ((l * n) / Om)) / Om)))));
} else {
tmp = sqrt((((t - (((fma((n / Om), (U - U_42_), 2.0) * l) / Om) * l)) * (n * 2.0)) * U));
}
return tmp;
}
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 2.1e-237) tmp = sqrt(Float64(Float64(Float64(t - Float64(Float64(Float64(-U_42_) * Float64(Float64(l / Om) * Float64(n / Om))) * l)) * Float64(n * 2.0)) * U)); elseif (l <= 8e-107) tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(t - Float64(l * Float64(Float64(Float64(-U_42_) * Float64(Float64(l * n) / Om)) / Om))))); else tmp = sqrt(Float64(Float64(Float64(t - Float64(Float64(Float64(fma(Float64(n / Om), Float64(U - U_42_), 2.0) * l) / Om) * l)) * Float64(n * 2.0)) * U)); end return tmp end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 2.1e-237], N[Sqrt[N[(N[(N[(t - N[(N[((-U$42$) * N[(N[(l / Om), $MachinePrecision] * N[(n / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * N[(n * 2.0), $MachinePrecision]), $MachinePrecision] * U), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 8e-107], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(t - N[(l * N[(N[((-U$42$) * N[(N[(l * n), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(N[(t - N[(N[(N[(N[(N[(n / Om), $MachinePrecision] * N[(U - U$42$), $MachinePrecision] + 2.0), $MachinePrecision] * l), $MachinePrecision] / Om), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * N[(n * 2.0), $MachinePrecision]), $MachinePrecision] * U), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 2.1 \cdot 10^{-237}:\\
\;\;\;\;\sqrt{\left(\left(t - \left(\left(-U*\right) \cdot \left(\frac{\ell}{Om} \cdot \frac{n}{Om}\right)\right) \cdot \ell\right) \cdot \left(n \cdot 2\right)\right) \cdot U}\\
\mathbf{elif}\;\ell \leq 8 \cdot 10^{-107}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t - \ell \cdot \frac{\left(-U*\right) \cdot \frac{\ell \cdot n}{Om}}{Om}\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(\left(t - \frac{\mathsf{fma}\left(\frac{n}{Om}, U - U*, 2\right) \cdot \ell}{Om} \cdot \ell\right) \cdot \left(n \cdot 2\right)\right) \cdot U}\\
\end{array}
\end{array}
if l < 2.1000000000000001e-237Initial program 52.2%
Taylor expanded in n around 0
mul-1-negN/A
unsub-negN/A
associate--r+N/A
+-commutativeN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
associate-/r*N/A
metadata-evalN/A
cancel-sign-sub-invN/A
associate-*r/N/A
Applied rewrites55.9%
Applied rewrites60.8%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites62.8%
Taylor expanded in U* around inf
Applied rewrites59.5%
if 2.1000000000000001e-237 < l < 8e-107Initial program 50.3%
Taylor expanded in n around 0
mul-1-negN/A
unsub-negN/A
associate--r+N/A
+-commutativeN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
associate-/r*N/A
metadata-evalN/A
cancel-sign-sub-invN/A
associate-*r/N/A
Applied rewrites48.8%
Applied rewrites48.9%
Taylor expanded in U* around inf
Applied rewrites56.3%
if 8e-107 < l Initial program 42.6%
Taylor expanded in n around 0
mul-1-negN/A
unsub-negN/A
associate--r+N/A
+-commutativeN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
associate-/r*N/A
metadata-evalN/A
cancel-sign-sub-invN/A
associate-*r/N/A
Applied rewrites53.0%
Applied rewrites56.0%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites61.1%
Final simplification59.8%
(FPCore (n U t l Om U*)
:precision binary64
(if (<= l 2.8e-209)
(sqrt (* (* (- t (* (* (- U*) (* (/ l Om) (/ n Om))) l)) (* n 2.0)) U))
(if (<= l 9.2e-77)
(sqrt (* (* (* (fma -2.0 (/ (* l l) Om) t) U) 2.0) n))
(sqrt
(* (* (* 2.0 n) U) (- t (* l (/ (* (- 2.0 (/ (* U* n) Om)) l) Om))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 2.8e-209) {
tmp = sqrt((((t - ((-U_42_ * ((l / Om) * (n / Om))) * l)) * (n * 2.0)) * U));
} else if (l <= 9.2e-77) {
tmp = sqrt((((fma(-2.0, ((l * l) / Om), t) * U) * 2.0) * n));
} else {
tmp = sqrt((((2.0 * n) * U) * (t - (l * (((2.0 - ((U_42_ * n) / Om)) * l) / Om)))));
}
return tmp;
}
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 2.8e-209) tmp = sqrt(Float64(Float64(Float64(t - Float64(Float64(Float64(-U_42_) * Float64(Float64(l / Om) * Float64(n / Om))) * l)) * Float64(n * 2.0)) * U)); elseif (l <= 9.2e-77) tmp = sqrt(Float64(Float64(Float64(fma(-2.0, Float64(Float64(l * l) / Om), t) * U) * 2.0) * n)); else tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(t - Float64(l * Float64(Float64(Float64(2.0 - Float64(Float64(U_42_ * n) / Om)) * l) / Om))))); end return tmp end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 2.8e-209], N[Sqrt[N[(N[(N[(t - N[(N[((-U$42$) * N[(N[(l / Om), $MachinePrecision] * N[(n / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * N[(n * 2.0), $MachinePrecision]), $MachinePrecision] * U), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 9.2e-77], N[Sqrt[N[(N[(N[(N[(-2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision] + t), $MachinePrecision] * U), $MachinePrecision] * 2.0), $MachinePrecision] * n), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(t - N[(l * N[(N[(N[(2.0 - N[(N[(U$42$ * n), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 2.8 \cdot 10^{-209}:\\
\;\;\;\;\sqrt{\left(\left(t - \left(\left(-U*\right) \cdot \left(\frac{\ell}{Om} \cdot \frac{n}{Om}\right)\right) \cdot \ell\right) \cdot \left(n \cdot 2\right)\right) \cdot U}\\
\mathbf{elif}\;\ell \leq 9.2 \cdot 10^{-77}:\\
\;\;\;\;\sqrt{\left(\left(\mathsf{fma}\left(-2, \frac{\ell \cdot \ell}{Om}, t\right) \cdot U\right) \cdot 2\right) \cdot n}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t - \ell \cdot \frac{\left(2 - \frac{U* \cdot n}{Om}\right) \cdot \ell}{Om}\right)}\\
\end{array}
\end{array}
if l < 2.80000000000000012e-209Initial program 51.1%
Taylor expanded in n around 0
mul-1-negN/A
unsub-negN/A
associate--r+N/A
+-commutativeN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
associate-/r*N/A
metadata-evalN/A
cancel-sign-sub-invN/A
associate-*r/N/A
Applied rewrites53.5%
Applied rewrites58.3%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites59.4%
Taylor expanded in U* around inf
Applied rewrites57.0%
if 2.80000000000000012e-209 < l < 9.19999999999999994e-77Initial program 48.8%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites55.1%
Taylor expanded in n around 0
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6458.6
Applied rewrites58.6%
if 9.19999999999999994e-77 < l Initial program 43.9%
Taylor expanded in n around 0
mul-1-negN/A
unsub-negN/A
associate--r+N/A
+-commutativeN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
associate-/r*N/A
metadata-evalN/A
cancel-sign-sub-invN/A
associate-*r/N/A
Applied rewrites54.1%
Applied rewrites58.4%
Taylor expanded in U around 0
Applied rewrites58.2%
Final simplification57.6%
(FPCore (n U t l Om U*) :precision binary64 (if (or (<= Om -61.0) (not (<= Om 5.5e-17))) (sqrt (* (* (* 2.0 n) U) (- t (* l (/ (* l 2.0) Om))))) (sqrt (* (* (- t (* (* (- U*) (* (/ l Om) (/ n Om))) l)) (* n 2.0)) U))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if ((Om <= -61.0) || !(Om <= 5.5e-17)) {
tmp = sqrt((((2.0 * n) * U) * (t - (l * ((l * 2.0) / Om)))));
} else {
tmp = sqrt((((t - ((-U_42_ * ((l / Om) * (n / Om))) * l)) * (n * 2.0)) * U));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if ((om <= (-61.0d0)) .or. (.not. (om <= 5.5d-17))) then
tmp = sqrt((((2.0d0 * n) * u) * (t - (l * ((l * 2.0d0) / om)))))
else
tmp = sqrt((((t - ((-u_42 * ((l / om) * (n / om))) * l)) * (n * 2.0d0)) * u))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if ((Om <= -61.0) || !(Om <= 5.5e-17)) {
tmp = Math.sqrt((((2.0 * n) * U) * (t - (l * ((l * 2.0) / Om)))));
} else {
tmp = Math.sqrt((((t - ((-U_42_ * ((l / Om) * (n / Om))) * l)) * (n * 2.0)) * U));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if (Om <= -61.0) or not (Om <= 5.5e-17): tmp = math.sqrt((((2.0 * n) * U) * (t - (l * ((l * 2.0) / Om))))) else: tmp = math.sqrt((((t - ((-U_42_ * ((l / Om) * (n / Om))) * l)) * (n * 2.0)) * U)) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if ((Om <= -61.0) || !(Om <= 5.5e-17)) tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(t - Float64(l * Float64(Float64(l * 2.0) / Om))))); else tmp = sqrt(Float64(Float64(Float64(t - Float64(Float64(Float64(-U_42_) * Float64(Float64(l / Om) * Float64(n / Om))) * l)) * Float64(n * 2.0)) * U)); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if ((Om <= -61.0) || ~((Om <= 5.5e-17))) tmp = sqrt((((2.0 * n) * U) * (t - (l * ((l * 2.0) / Om))))); else tmp = sqrt((((t - ((-U_42_ * ((l / Om) * (n / Om))) * l)) * (n * 2.0)) * U)); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[Or[LessEqual[Om, -61.0], N[Not[LessEqual[Om, 5.5e-17]], $MachinePrecision]], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(t - N[(l * N[(N[(l * 2.0), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(N[(t - N[(N[((-U$42$) * N[(N[(l / Om), $MachinePrecision] * N[(n / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * N[(n * 2.0), $MachinePrecision]), $MachinePrecision] * U), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;Om \leq -61 \lor \neg \left(Om \leq 5.5 \cdot 10^{-17}\right):\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t - \ell \cdot \frac{\ell \cdot 2}{Om}\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(\left(t - \left(\left(-U*\right) \cdot \left(\frac{\ell}{Om} \cdot \frac{n}{Om}\right)\right) \cdot \ell\right) \cdot \left(n \cdot 2\right)\right) \cdot U}\\
\end{array}
\end{array}
if Om < -61 or 5.50000000000000001e-17 < Om Initial program 54.3%
Taylor expanded in n around 0
mul-1-negN/A
unsub-negN/A
associate--r+N/A
+-commutativeN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
associate-/r*N/A
metadata-evalN/A
cancel-sign-sub-invN/A
associate-*r/N/A
Applied rewrites59.4%
Applied rewrites65.4%
Taylor expanded in n around 0
Applied rewrites58.0%
if -61 < Om < 5.50000000000000001e-17Initial program 39.3%
Taylor expanded in n around 0
mul-1-negN/A
unsub-negN/A
associate--r+N/A
+-commutativeN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
associate-/r*N/A
metadata-evalN/A
cancel-sign-sub-invN/A
associate-*r/N/A
Applied rewrites45.9%
Applied rewrites46.1%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites55.5%
Taylor expanded in U* around inf
Applied rewrites57.4%
Final simplification57.7%
(FPCore (n U t l Om U*) :precision binary64 (if (<= l 1.5e-17) (sqrt (* (* (* (fma -2.0 (/ (* l l) Om) t) U) 2.0) n)) (sqrt (* (* (- t (* (/ (* 2.0 l) Om) l)) (* n 2.0)) U))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 1.5e-17) {
tmp = sqrt((((fma(-2.0, ((l * l) / Om), t) * U) * 2.0) * n));
} else {
tmp = sqrt((((t - (((2.0 * l) / Om) * l)) * (n * 2.0)) * U));
}
return tmp;
}
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 1.5e-17) tmp = sqrt(Float64(Float64(Float64(fma(-2.0, Float64(Float64(l * l) / Om), t) * U) * 2.0) * n)); else tmp = sqrt(Float64(Float64(Float64(t - Float64(Float64(Float64(2.0 * l) / Om) * l)) * Float64(n * 2.0)) * U)); end return tmp end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 1.5e-17], N[Sqrt[N[(N[(N[(N[(-2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision] + t), $MachinePrecision] * U), $MachinePrecision] * 2.0), $MachinePrecision] * n), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(N[(t - N[(N[(N[(2.0 * l), $MachinePrecision] / Om), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * N[(n * 2.0), $MachinePrecision]), $MachinePrecision] * U), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 1.5 \cdot 10^{-17}:\\
\;\;\;\;\sqrt{\left(\left(\mathsf{fma}\left(-2, \frac{\ell \cdot \ell}{Om}, t\right) \cdot U\right) \cdot 2\right) \cdot n}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(\left(t - \frac{2 \cdot \ell}{Om} \cdot \ell\right) \cdot \left(n \cdot 2\right)\right) \cdot U}\\
\end{array}
\end{array}
if l < 1.50000000000000003e-17Initial program 51.7%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites52.6%
Taylor expanded in n around 0
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6447.9
Applied rewrites47.9%
if 1.50000000000000003e-17 < l Initial program 40.0%
Taylor expanded in n around 0
mul-1-negN/A
unsub-negN/A
associate--r+N/A
+-commutativeN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
associate-/r*N/A
metadata-evalN/A
cancel-sign-sub-invN/A
associate-*r/N/A
Applied rewrites51.3%
Applied rewrites56.6%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites61.1%
Taylor expanded in n around 0
Applied rewrites48.2%
Final simplification48.0%
(FPCore (n U t l Om U*) :precision binary64 (if (<= t 3.2e+234) (sqrt (* (* (* (fma -2.0 (/ (* l l) Om) t) U) 2.0) n)) (* (sqrt (* (* 2.0 n) U)) (sqrt t))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (t <= 3.2e+234) {
tmp = sqrt((((fma(-2.0, ((l * l) / Om), t) * U) * 2.0) * n));
} else {
tmp = sqrt(((2.0 * n) * U)) * sqrt(t);
}
return tmp;
}
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (t <= 3.2e+234) tmp = sqrt(Float64(Float64(Float64(fma(-2.0, Float64(Float64(l * l) / Om), t) * U) * 2.0) * n)); else tmp = Float64(sqrt(Float64(Float64(2.0 * n) * U)) * sqrt(t)); end return tmp end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[t, 3.2e+234], N[Sqrt[N[(N[(N[(N[(-2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision] + t), $MachinePrecision] * U), $MachinePrecision] * 2.0), $MachinePrecision] * n), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;t \leq 3.2 \cdot 10^{+234}:\\
\;\;\;\;\sqrt{\left(\left(\mathsf{fma}\left(-2, \frac{\ell \cdot \ell}{Om}, t\right) \cdot U\right) \cdot 2\right) \cdot n}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot U} \cdot \sqrt{t}\\
\end{array}
\end{array}
if t < 3.19999999999999992e234Initial program 49.5%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites50.7%
Taylor expanded in n around 0
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6445.5
Applied rewrites45.5%
if 3.19999999999999992e234 < t Initial program 20.4%
Taylor expanded in n around 0
mul-1-negN/A
unsub-negN/A
associate--r+N/A
+-commutativeN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
associate-/r*N/A
metadata-evalN/A
cancel-sign-sub-invN/A
associate-*r/N/A
Applied rewrites47.3%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
Applied rewrites55.0%
Taylor expanded in t around inf
lower-sqrt.f6467.8
Applied rewrites67.8%
(FPCore (n U t l Om U*) :precision binary64 (if (<= l 1.8e-19) (sqrt (* (* (* U t) 2.0) n)) (sqrt (* (* (* (fma -2.0 (/ (* l l) Om) t) n) U) 2.0))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 1.8e-19) {
tmp = sqrt((((U * t) * 2.0) * n));
} else {
tmp = sqrt((((fma(-2.0, ((l * l) / Om), t) * n) * U) * 2.0));
}
return tmp;
}
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 1.8e-19) tmp = sqrt(Float64(Float64(Float64(U * t) * 2.0) * n)); else tmp = sqrt(Float64(Float64(Float64(fma(-2.0, Float64(Float64(l * l) / Om), t) * n) * U) * 2.0)); end return tmp end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 1.8e-19], N[Sqrt[N[(N[(N[(U * t), $MachinePrecision] * 2.0), $MachinePrecision] * n), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(N[(N[(-2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision] + t), $MachinePrecision] * n), $MachinePrecision] * U), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 1.8 \cdot 10^{-19}:\\
\;\;\;\;\sqrt{\left(\left(U \cdot t\right) \cdot 2\right) \cdot n}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(\left(\mathsf{fma}\left(-2, \frac{\ell \cdot \ell}{Om}, t\right) \cdot n\right) \cdot U\right) \cdot 2}\\
\end{array}
\end{array}
if l < 1.8000000000000001e-19Initial program 51.7%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites52.6%
Taylor expanded in t around inf
*-commutativeN/A
lower-*.f64N/A
lower-*.f6439.1
Applied rewrites39.1%
if 1.8000000000000001e-19 < l Initial program 40.0%
Taylor expanded in n around 0
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6440.0
Applied rewrites40.0%
(FPCore (n U t l Om U*) :precision binary64 (if (<= l 2.6e+58) (sqrt (* (* (* U t) 2.0) n)) (sqrt (* (/ (* (* (* l l) n) U) Om) -4.0))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 2.6e+58) {
tmp = sqrt((((U * t) * 2.0) * n));
} else {
tmp = sqrt((((((l * l) * n) * U) / Om) * -4.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.6d+58) then
tmp = sqrt((((u * t) * 2.0d0) * n))
else
tmp = sqrt((((((l * l) * n) * u) / om) * (-4.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.6e+58) {
tmp = Math.sqrt((((U * t) * 2.0) * n));
} else {
tmp = Math.sqrt((((((l * l) * n) * U) / Om) * -4.0));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 2.6e+58: tmp = math.sqrt((((U * t) * 2.0) * n)) else: tmp = math.sqrt((((((l * l) * n) * U) / Om) * -4.0)) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 2.6e+58) tmp = sqrt(Float64(Float64(Float64(U * t) * 2.0) * n)); else tmp = sqrt(Float64(Float64(Float64(Float64(Float64(l * l) * n) * U) / Om) * -4.0)); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 2.6e+58) tmp = sqrt((((U * t) * 2.0) * n)); else tmp = sqrt((((((l * l) * n) * U) / Om) * -4.0)); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 2.6e+58], N[Sqrt[N[(N[(N[(U * t), $MachinePrecision] * 2.0), $MachinePrecision] * n), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(N[(N[(N[(l * l), $MachinePrecision] * n), $MachinePrecision] * U), $MachinePrecision] / Om), $MachinePrecision] * -4.0), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 2.6 \cdot 10^{+58}:\\
\;\;\;\;\sqrt{\left(\left(U \cdot t\right) \cdot 2\right) \cdot n}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om} \cdot -4}\\
\end{array}
\end{array}
if l < 2.59999999999999988e58Initial program 51.5%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites51.9%
Taylor expanded in t around inf
*-commutativeN/A
lower-*.f64N/A
lower-*.f6438.4
Applied rewrites38.4%
if 2.59999999999999988e58 < l Initial program 35.5%
Taylor expanded in Om around inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6424.7
Applied rewrites24.7%
Taylor expanded in t around 0
Applied rewrites36.4%
(FPCore (n U t l Om U*) :precision binary64 (if (<= l 4.9e-17) (sqrt (* (* (* U t) 2.0) n)) (sqrt (* (* (* n t) U) 2.0))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 4.9e-17) {
tmp = sqrt((((U * t) * 2.0) * n));
} else {
tmp = sqrt((((n * t) * 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.9d-17) then
tmp = sqrt((((u * t) * 2.0d0) * n))
else
tmp = sqrt((((n * t) * 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.9e-17) {
tmp = Math.sqrt((((U * t) * 2.0) * n));
} else {
tmp = Math.sqrt((((n * t) * U) * 2.0));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 4.9e-17: tmp = math.sqrt((((U * t) * 2.0) * n)) else: tmp = math.sqrt((((n * t) * U) * 2.0)) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 4.9e-17) tmp = sqrt(Float64(Float64(Float64(U * t) * 2.0) * n)); else tmp = sqrt(Float64(Float64(Float64(n * t) * U) * 2.0)); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 4.9e-17) tmp = sqrt((((U * t) * 2.0) * n)); else tmp = sqrt((((n * t) * U) * 2.0)); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 4.9e-17], N[Sqrt[N[(N[(N[(U * t), $MachinePrecision] * 2.0), $MachinePrecision] * n), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(N[(n * t), $MachinePrecision] * U), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 4.9 \cdot 10^{-17}:\\
\;\;\;\;\sqrt{\left(\left(U \cdot t\right) \cdot 2\right) \cdot n}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(\left(n \cdot t\right) \cdot U\right) \cdot 2}\\
\end{array}
\end{array}
if l < 4.90000000000000012e-17Initial program 51.7%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites52.6%
Taylor expanded in t around inf
*-commutativeN/A
lower-*.f64N/A
lower-*.f6439.1
Applied rewrites39.1%
if 4.90000000000000012e-17 < l Initial program 40.0%
Taylor expanded in t around inf
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6414.2
Applied rewrites14.2%
(FPCore (n U t l Om U*) :precision binary64 (sqrt (* (* (* n U) t) 2.0)))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return sqrt((((n * U) * t) * 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 * u) * t) * 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 * U) * t) * 2.0));
}
def code(n, U, t, l, Om, U_42_): return math.sqrt((((n * U) * t) * 2.0))
function code(n, U, t, l, Om, U_42_) return sqrt(Float64(Float64(Float64(n * U) * t) * 2.0)) end
function tmp = code(n, U, t, l, Om, U_42_) tmp = sqrt((((n * U) * t) * 2.0)); end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Sqrt[N[(N[(N[(n * U), $MachinePrecision] * t), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\left(\left(n \cdot U\right) \cdot t\right) \cdot 2}
\end{array}
Initial program 48.2%
Taylor expanded in t around inf
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6430.2
Applied rewrites30.2%
Applied rewrites28.9%
herbie shell --seed 2024313
(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*))))))