
(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 11 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (n U t l Om U*) :precision binary64 (sqrt (* (* (* 2.0 n) U) (- (- t (* 2.0 (/ (* l l) Om))) (* (* n (pow (/ l Om) 2.0)) (- U U*))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * pow((l / Om), 2.0)) * (U - U_42_)))));
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
code = sqrt((((2.0d0 * n) * u) * ((t - (2.0d0 * ((l * l) / om))) - ((n * ((l / om) ** 2.0d0)) * (u - u_42)))))
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * Math.pow((l / Om), 2.0)) * (U - U_42_)))));
}
def code(n, U, t, l, Om, U_42_): return math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * math.pow((l / Om), 2.0)) * (U - U_42_)))))
function code(n, U, t, l, Om, U_42_) return sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) - Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U - U_42_))))) end
function tmp = code(n, U, t, l, Om, U_42_) tmp = sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * ((l / Om) ^ 2.0)) * (U - U_42_))))); end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)}
\end{array}
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* (- U* U) (* n (pow (/ l Om) 2.0))))
(t_2 (* (* 2.0 n) U))
(t_3 (sqrt (* t_2 (+ (- t (* 2.0 (/ (* l l) Om))) t_1)))))
(if (<= t_3 0.0)
(*
(sqrt (* 2.0 n))
(sqrt (* U (+ t (+ (* (/ (pow l 2.0) Om) -2.0) t_1)))))
(if (<= t_3 INFINITY)
(sqrt
(*
t_2
(+
(- t (* 2.0 (* l (/ l Om))))
(* (- U* U) (* (/ l Om) (/ n (/ Om l)))))))
(sqrt
(*
(* U -2.0)
(*
(pow l 2.0)
(* n (+ (/ 2.0 Om) (/ n (/ (pow Om 2.0) (- U U*))))))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (U_42_ - U) * (n * pow((l / Om), 2.0));
double t_2 = (2.0 * n) * U;
double t_3 = sqrt((t_2 * ((t - (2.0 * ((l * l) / Om))) + t_1)));
double tmp;
if (t_3 <= 0.0) {
tmp = sqrt((2.0 * n)) * sqrt((U * (t + (((pow(l, 2.0) / Om) * -2.0) + t_1))));
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt((t_2 * ((t - (2.0 * (l * (l / Om)))) + ((U_42_ - U) * ((l / Om) * (n / (Om / l)))))));
} else {
tmp = sqrt(((U * -2.0) * (pow(l, 2.0) * (n * ((2.0 / Om) + (n / (pow(Om, 2.0) / (U - U_42_))))))));
}
return tmp;
}
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (U_42_ - U) * (n * Math.pow((l / Om), 2.0));
double t_2 = (2.0 * n) * U;
double t_3 = Math.sqrt((t_2 * ((t - (2.0 * ((l * l) / Om))) + t_1)));
double tmp;
if (t_3 <= 0.0) {
tmp = Math.sqrt((2.0 * n)) * Math.sqrt((U * (t + (((Math.pow(l, 2.0) / Om) * -2.0) + t_1))));
} else if (t_3 <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt((t_2 * ((t - (2.0 * (l * (l / Om)))) + ((U_42_ - U) * ((l / Om) * (n / (Om / l)))))));
} else {
tmp = Math.sqrt(((U * -2.0) * (Math.pow(l, 2.0) * (n * ((2.0 / Om) + (n / (Math.pow(Om, 2.0) / (U - U_42_))))))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = (U_42_ - U) * (n * math.pow((l / Om), 2.0)) t_2 = (2.0 * n) * U t_3 = math.sqrt((t_2 * ((t - (2.0 * ((l * l) / Om))) + t_1))) tmp = 0 if t_3 <= 0.0: tmp = math.sqrt((2.0 * n)) * math.sqrt((U * (t + (((math.pow(l, 2.0) / Om) * -2.0) + t_1)))) elif t_3 <= math.inf: tmp = math.sqrt((t_2 * ((t - (2.0 * (l * (l / Om)))) + ((U_42_ - U) * ((l / Om) * (n / (Om / l))))))) else: tmp = math.sqrt(((U * -2.0) * (math.pow(l, 2.0) * (n * ((2.0 / Om) + (n / (math.pow(Om, 2.0) / (U - U_42_)))))))) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(Float64(U_42_ - U) * Float64(n * (Float64(l / Om) ^ 2.0))) t_2 = Float64(Float64(2.0 * n) * U) t_3 = sqrt(Float64(t_2 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) + t_1))) tmp = 0.0 if (t_3 <= 0.0) tmp = Float64(sqrt(Float64(2.0 * n)) * sqrt(Float64(U * Float64(t + Float64(Float64(Float64((l ^ 2.0) / Om) * -2.0) + t_1))))); elseif (t_3 <= Inf) tmp = sqrt(Float64(t_2 * Float64(Float64(t - Float64(2.0 * Float64(l * Float64(l / Om)))) + Float64(Float64(U_42_ - U) * Float64(Float64(l / Om) * Float64(n / Float64(Om / l))))))); else tmp = sqrt(Float64(Float64(U * -2.0) * Float64((l ^ 2.0) * Float64(n * Float64(Float64(2.0 / Om) + Float64(n / Float64((Om ^ 2.0) / Float64(U - U_42_)))))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = (U_42_ - U) * (n * ((l / Om) ^ 2.0)); t_2 = (2.0 * n) * U; t_3 = sqrt((t_2 * ((t - (2.0 * ((l * l) / Om))) + t_1))); tmp = 0.0; if (t_3 <= 0.0) tmp = sqrt((2.0 * n)) * sqrt((U * (t + ((((l ^ 2.0) / Om) * -2.0) + t_1)))); elseif (t_3 <= Inf) tmp = sqrt((t_2 * ((t - (2.0 * (l * (l / Om)))) + ((U_42_ - U) * ((l / Om) * (n / (Om / l))))))); else tmp = sqrt(((U * -2.0) * ((l ^ 2.0) * (n * ((2.0 / Om) + (n / ((Om ^ 2.0) / (U - U_42_)))))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(U$42$ - U), $MachinePrecision] * N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $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 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$3, 0.0], N[(N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(U * N[(t + N[(N[(N[(N[Power[l, 2.0], $MachinePrecision] / Om), $MachinePrecision] * -2.0), $MachinePrecision] + t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[Sqrt[N[(t$95$2 * N[(N[(t - N[(2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(U$42$ - U), $MachinePrecision] * N[(N[(l / Om), $MachinePrecision] * N[(n / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(U * -2.0), $MachinePrecision] * N[(N[Power[l, 2.0], $MachinePrecision] * N[(n * N[(N[(2.0 / Om), $MachinePrecision] + N[(n / N[(N[Power[Om, 2.0], $MachinePrecision] / N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \left(U* - U\right) \cdot \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right)\\
t_2 := \left(2 \cdot n\right) \cdot U\\
t_3 := \sqrt{t_2 \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) + t_1\right)}\\
\mathbf{if}\;t_3 \leq 0:\\
\;\;\;\;\sqrt{2 \cdot n} \cdot \sqrt{U \cdot \left(t + \left(\frac{{\ell}^{2}}{Om} \cdot -2 + t_1\right)\right)}\\
\mathbf{elif}\;t_3 \leq \infty:\\
\;\;\;\;\sqrt{t_2 \cdot \left(\left(t - 2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right) + \left(U* - U\right) \cdot \left(\frac{\ell}{Om} \cdot \frac{n}{\frac{Om}{\ell}}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(U \cdot -2\right) \cdot \left({\ell}^{2} \cdot \left(n \cdot \left(\frac{2}{Om} + \frac{n}{\frac{{Om}^{2}}{U - U*}}\right)\right)\right)}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*))))) < 0.0Initial program 7.2%
associate-*l/7.2%
Applied egg-rr7.2%
associate-*l*30.3%
sqrt-prod44.4%
*-commutative44.4%
sub-neg44.4%
sub-neg44.4%
cancel-sign-sub-inv44.4%
associate--l+44.4%
Applied egg-rr44.4%
*-commutative44.4%
associate-*r*44.4%
*-commutative44.4%
Simplified44.4%
if 0.0 < (sqrt.f64 (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*))))) < +inf.0Initial program 65.7%
associate-*l/68.3%
Applied egg-rr68.3%
add-cbrt-cube65.8%
pow365.8%
Applied egg-rr65.8%
rem-cbrt-cube68.3%
*-commutative68.3%
unpow268.3%
associate-*l*69.8%
Applied egg-rr69.8%
*-commutative69.8%
clear-num69.8%
un-div-inv69.9%
Applied egg-rr69.9%
if +inf.0 < (sqrt.f64 (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*))))) Initial program 0.0%
Taylor expanded in l around inf 38.7%
associate-*r*38.7%
associate-*r/38.7%
metadata-eval38.7%
associate-/l*38.7%
Simplified38.7%
Final simplification63.0%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* (* 2.0 n) U))
(t_2
(sqrt
(*
t_1
(+
(- t (* 2.0 (/ (* l l) Om)))
(* (- U* U) (* n (pow (/ l Om) 2.0))))))))
(if (<= t_2 0.0)
(* (sqrt (* 2.0 n)) (sqrt (* U t)))
(if (<= t_2 INFINITY)
(sqrt
(*
t_1
(+
(- t (* 2.0 (* l (/ l Om))))
(* (- U* U) (* (/ l Om) (/ n (/ Om l)))))))
(sqrt
(*
(* U -2.0)
(*
(pow l 2.0)
(* n (+ (/ 2.0 Om) (/ n (/ (pow Om 2.0) (- U 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 = sqrt((t_1 * ((t - (2.0 * ((l * l) / Om))) + ((U_42_ - U) * (n * pow((l / Om), 2.0))))));
double tmp;
if (t_2 <= 0.0) {
tmp = sqrt((2.0 * n)) * sqrt((U * t));
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt((t_1 * ((t - (2.0 * (l * (l / Om)))) + ((U_42_ - U) * ((l / Om) * (n / (Om / l)))))));
} else {
tmp = sqrt(((U * -2.0) * (pow(l, 2.0) * (n * ((2.0 / Om) + (n / (pow(Om, 2.0) / (U - U_42_))))))));
}
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 = Math.sqrt((t_1 * ((t - (2.0 * ((l * l) / Om))) + ((U_42_ - U) * (n * Math.pow((l / Om), 2.0))))));
double tmp;
if (t_2 <= 0.0) {
tmp = Math.sqrt((2.0 * n)) * Math.sqrt((U * t));
} else if (t_2 <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt((t_1 * ((t - (2.0 * (l * (l / Om)))) + ((U_42_ - U) * ((l / Om) * (n / (Om / l)))))));
} else {
tmp = Math.sqrt(((U * -2.0) * (Math.pow(l, 2.0) * (n * ((2.0 / Om) + (n / (Math.pow(Om, 2.0) / (U - U_42_))))))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = (2.0 * n) * U t_2 = math.sqrt((t_1 * ((t - (2.0 * ((l * l) / Om))) + ((U_42_ - U) * (n * math.pow((l / Om), 2.0)))))) tmp = 0 if t_2 <= 0.0: tmp = math.sqrt((2.0 * n)) * math.sqrt((U * t)) elif t_2 <= math.inf: tmp = math.sqrt((t_1 * ((t - (2.0 * (l * (l / Om)))) + ((U_42_ - U) * ((l / Om) * (n / (Om / l))))))) else: tmp = math.sqrt(((U * -2.0) * (math.pow(l, 2.0) * (n * ((2.0 / Om) + (n / (math.pow(Om, 2.0) / (U - U_42_)))))))) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(Float64(2.0 * n) * U) t_2 = sqrt(Float64(t_1 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) + Float64(Float64(U_42_ - U) * Float64(n * (Float64(l / Om) ^ 2.0)))))) tmp = 0.0 if (t_2 <= 0.0) tmp = Float64(sqrt(Float64(2.0 * n)) * sqrt(Float64(U * t))); elseif (t_2 <= Inf) tmp = sqrt(Float64(t_1 * Float64(Float64(t - Float64(2.0 * Float64(l * Float64(l / Om)))) + Float64(Float64(U_42_ - U) * Float64(Float64(l / Om) * Float64(n / Float64(Om / l))))))); else tmp = sqrt(Float64(Float64(U * -2.0) * Float64((l ^ 2.0) * Float64(n * Float64(Float64(2.0 / Om) + Float64(n / Float64((Om ^ 2.0) / Float64(U - U_42_)))))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = (2.0 * n) * U; t_2 = sqrt((t_1 * ((t - (2.0 * ((l * l) / Om))) + ((U_42_ - U) * (n * ((l / Om) ^ 2.0)))))); tmp = 0.0; if (t_2 <= 0.0) tmp = sqrt((2.0 * n)) * sqrt((U * t)); elseif (t_2 <= Inf) tmp = sqrt((t_1 * ((t - (2.0 * (l * (l / Om)))) + ((U_42_ - U) * ((l / Om) * (n / (Om / l))))))); else tmp = sqrt(((U * -2.0) * ((l ^ 2.0) * (n * ((2.0 / Om) + (n / ((Om ^ 2.0) / (U - U_42_)))))))); 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[Sqrt[N[(t$95$1 * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(U$42$ - U), $MachinePrecision] * N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$2, 0.0], N[(N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(U * t), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[Sqrt[N[(t$95$1 * N[(N[(t - N[(2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(U$42$ - U), $MachinePrecision] * N[(N[(l / Om), $MachinePrecision] * N[(n / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(U * -2.0), $MachinePrecision] * N[(N[Power[l, 2.0], $MachinePrecision] * N[(n * N[(N[(2.0 / Om), $MachinePrecision] + N[(n / N[(N[Power[Om, 2.0], $MachinePrecision] / N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \left(2 \cdot n\right) \cdot U\\
t_2 := \sqrt{t_1 \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) + \left(U* - U\right) \cdot \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right)\right)}\\
\mathbf{if}\;t_2 \leq 0:\\
\;\;\;\;\sqrt{2 \cdot n} \cdot \sqrt{U \cdot t}\\
\mathbf{elif}\;t_2 \leq \infty:\\
\;\;\;\;\sqrt{t_1 \cdot \left(\left(t - 2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right) + \left(U* - U\right) \cdot \left(\frac{\ell}{Om} \cdot \frac{n}{\frac{Om}{\ell}}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(U \cdot -2\right) \cdot \left({\ell}^{2} \cdot \left(n \cdot \left(\frac{2}{Om} + \frac{n}{\frac{{Om}^{2}}{U - U*}}\right)\right)\right)}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*))))) < 0.0Initial program 7.2%
Simplified26.9%
Taylor expanded in t around inf 23.8%
associate-*r*7.2%
*-commutative7.2%
associate-*l*23.8%
Simplified23.8%
associate-*r*23.8%
sqrt-prod34.8%
Applied egg-rr34.8%
*-commutative34.8%
Simplified34.8%
if 0.0 < (sqrt.f64 (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*))))) < +inf.0Initial program 65.7%
associate-*l/68.3%
Applied egg-rr68.3%
add-cbrt-cube65.8%
pow365.8%
Applied egg-rr65.8%
rem-cbrt-cube68.3%
*-commutative68.3%
unpow268.3%
associate-*l*69.8%
Applied egg-rr69.8%
*-commutative69.8%
clear-num69.8%
un-div-inv69.9%
Applied egg-rr69.9%
if +inf.0 < (sqrt.f64 (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*))))) Initial program 0.0%
Taylor expanded in l around inf 38.7%
associate-*r*38.7%
associate-*r/38.7%
metadata-eval38.7%
associate-/l*38.7%
Simplified38.7%
Final simplification61.9%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* (* 2.0 n) U))
(t_2
(sqrt
(*
t_1
(+
(- t (* 2.0 (/ (* l l) Om)))
(* (- U* U) (* n (pow (/ l Om) 2.0))))))))
(if (<= t_2 0.0)
(* (sqrt (* 2.0 n)) (sqrt (* U t)))
(if (<= t_2 INFINITY)
(sqrt
(*
t_1
(+
(- t (* 2.0 (* l (/ l Om))))
(* (- U* U) (* (/ l Om) (/ n (/ Om l)))))))
(pow
(fma -4.0 (* (/ U Om) (* n (pow l 2.0))) (* 2.0 (* t (* n U))))
0.5)))))
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 = sqrt((t_1 * ((t - (2.0 * ((l * l) / Om))) + ((U_42_ - U) * (n * pow((l / Om), 2.0))))));
double tmp;
if (t_2 <= 0.0) {
tmp = sqrt((2.0 * n)) * sqrt((U * t));
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt((t_1 * ((t - (2.0 * (l * (l / Om)))) + ((U_42_ - U) * ((l / Om) * (n / (Om / l)))))));
} else {
tmp = pow(fma(-4.0, ((U / Om) * (n * pow(l, 2.0))), (2.0 * (t * (n * U)))), 0.5);
}
return tmp;
}
function code(n, U, t, l, Om, U_42_) t_1 = Float64(Float64(2.0 * n) * U) t_2 = sqrt(Float64(t_1 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) + Float64(Float64(U_42_ - U) * Float64(n * (Float64(l / Om) ^ 2.0)))))) tmp = 0.0 if (t_2 <= 0.0) tmp = Float64(sqrt(Float64(2.0 * n)) * sqrt(Float64(U * t))); elseif (t_2 <= Inf) tmp = sqrt(Float64(t_1 * Float64(Float64(t - Float64(2.0 * Float64(l * Float64(l / Om)))) + Float64(Float64(U_42_ - U) * Float64(Float64(l / Om) * Float64(n / Float64(Om / l))))))); else tmp = fma(-4.0, Float64(Float64(U / Om) * Float64(n * (l ^ 2.0))), Float64(2.0 * Float64(t * Float64(n * U)))) ^ 0.5; end return 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[Sqrt[N[(t$95$1 * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(U$42$ - U), $MachinePrecision] * N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$2, 0.0], N[(N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(U * t), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[Sqrt[N[(t$95$1 * N[(N[(t - N[(2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(U$42$ - U), $MachinePrecision] * N[(N[(l / Om), $MachinePrecision] * N[(n / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Power[N[(-4.0 * N[(N[(U / Om), $MachinePrecision] * N[(n * N[Power[l, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(2.0 * N[(t * N[(n * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \left(2 \cdot n\right) \cdot U\\
t_2 := \sqrt{t_1 \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) + \left(U* - U\right) \cdot \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right)\right)}\\
\mathbf{if}\;t_2 \leq 0:\\
\;\;\;\;\sqrt{2 \cdot n} \cdot \sqrt{U \cdot t}\\
\mathbf{elif}\;t_2 \leq \infty:\\
\;\;\;\;\sqrt{t_1 \cdot \left(\left(t - 2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right) + \left(U* - U\right) \cdot \left(\frac{\ell}{Om} \cdot \frac{n}{\frac{Om}{\ell}}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;{\left(\mathsf{fma}\left(-4, \frac{U}{Om} \cdot \left(n \cdot {\ell}^{2}\right), 2 \cdot \left(t \cdot \left(n \cdot U\right)\right)\right)\right)}^{0.5}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*))))) < 0.0Initial program 7.2%
Simplified26.9%
Taylor expanded in t around inf 23.8%
associate-*r*7.2%
*-commutative7.2%
associate-*l*23.8%
Simplified23.8%
associate-*r*23.8%
sqrt-prod34.8%
Applied egg-rr34.8%
*-commutative34.8%
Simplified34.8%
if 0.0 < (sqrt.f64 (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*))))) < +inf.0Initial program 65.7%
associate-*l/68.3%
Applied egg-rr68.3%
add-cbrt-cube65.8%
pow365.8%
Applied egg-rr65.8%
rem-cbrt-cube68.3%
*-commutative68.3%
unpow268.3%
associate-*l*69.8%
Applied egg-rr69.8%
*-commutative69.8%
clear-num69.8%
un-div-inv69.9%
Applied egg-rr69.9%
if +inf.0 < (sqrt.f64 (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*))))) Initial program 0.0%
Taylor expanded in Om around inf 4.4%
pow1/235.7%
fma-def35.7%
associate-/l*38.9%
associate-/r/38.4%
*-commutative38.4%
associate-*r*38.5%
*-commutative38.5%
*-commutative38.5%
Applied egg-rr38.5%
Final simplification61.8%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* (* 2.0 n) U)))
(if (<=
(sqrt
(*
t_1
(+
(- t (* 2.0 (/ (* l l) Om)))
(* (- U* U) (* n (pow (/ l Om) 2.0))))))
0.0)
(* (sqrt (* 2.0 n)) (sqrt (* U t)))
(sqrt
(*
t_1
(+
(- t (* 2.0 (* l (/ l Om))))
(* (- U* U) (* (/ l Om) (/ n (/ Om l))))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (2.0 * n) * U;
double tmp;
if (sqrt((t_1 * ((t - (2.0 * ((l * l) / Om))) + ((U_42_ - U) * (n * pow((l / Om), 2.0)))))) <= 0.0) {
tmp = sqrt((2.0 * n)) * sqrt((U * t));
} else {
tmp = sqrt((t_1 * ((t - (2.0 * (l * (l / Om)))) + ((U_42_ - U) * ((l / Om) * (n / (Om / l)))))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: t_1
real(8) :: tmp
t_1 = (2.0d0 * n) * u
if (sqrt((t_1 * ((t - (2.0d0 * ((l * l) / om))) + ((u_42 - u) * (n * ((l / om) ** 2.0d0)))))) <= 0.0d0) then
tmp = sqrt((2.0d0 * n)) * sqrt((u * t))
else
tmp = sqrt((t_1 * ((t - (2.0d0 * (l * (l / om)))) + ((u_42 - u) * ((l / om) * (n / (om / l)))))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (2.0 * n) * U;
double tmp;
if (Math.sqrt((t_1 * ((t - (2.0 * ((l * l) / Om))) + ((U_42_ - U) * (n * Math.pow((l / Om), 2.0)))))) <= 0.0) {
tmp = Math.sqrt((2.0 * n)) * Math.sqrt((U * t));
} else {
tmp = Math.sqrt((t_1 * ((t - (2.0 * (l * (l / Om)))) + ((U_42_ - U) * ((l / Om) * (n / (Om / l)))))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = (2.0 * n) * U tmp = 0 if math.sqrt((t_1 * ((t - (2.0 * ((l * l) / Om))) + ((U_42_ - U) * (n * math.pow((l / Om), 2.0)))))) <= 0.0: tmp = math.sqrt((2.0 * n)) * math.sqrt((U * t)) else: tmp = math.sqrt((t_1 * ((t - (2.0 * (l * (l / Om)))) + ((U_42_ - U) * ((l / Om) * (n / (Om / l))))))) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(Float64(2.0 * n) * U) tmp = 0.0 if (sqrt(Float64(t_1 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) + Float64(Float64(U_42_ - U) * Float64(n * (Float64(l / Om) ^ 2.0)))))) <= 0.0) tmp = Float64(sqrt(Float64(2.0 * n)) * sqrt(Float64(U * t))); else tmp = sqrt(Float64(t_1 * Float64(Float64(t - Float64(2.0 * Float64(l * Float64(l / Om)))) + Float64(Float64(U_42_ - U) * Float64(Float64(l / Om) * Float64(n / Float64(Om / l))))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = (2.0 * n) * U; tmp = 0.0; if (sqrt((t_1 * ((t - (2.0 * ((l * l) / Om))) + ((U_42_ - U) * (n * ((l / Om) ^ 2.0)))))) <= 0.0) tmp = sqrt((2.0 * n)) * sqrt((U * t)); else tmp = sqrt((t_1 * ((t - (2.0 * (l * (l / Om)))) + ((U_42_ - U) * ((l / Om) * (n / (Om / l))))))); 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]}, If[LessEqual[N[Sqrt[N[(t$95$1 * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(U$42$ - U), $MachinePrecision] * N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 0.0], N[(N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(U * t), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(t$95$1 * N[(N[(t - N[(2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(U$42$ - U), $MachinePrecision] * N[(N[(l / Om), $MachinePrecision] * N[(n / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \left(2 \cdot n\right) \cdot U\\
\mathbf{if}\;\sqrt{t_1 \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) + \left(U* - U\right) \cdot \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right)\right)} \leq 0:\\
\;\;\;\;\sqrt{2 \cdot n} \cdot \sqrt{U \cdot t}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{t_1 \cdot \left(\left(t - 2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right) + \left(U* - U\right) \cdot \left(\frac{\ell}{Om} \cdot \frac{n}{\frac{Om}{\ell}}\right)\right)}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*))))) < 0.0Initial program 7.2%
Simplified26.9%
Taylor expanded in t around inf 23.8%
associate-*r*7.2%
*-commutative7.2%
associate-*l*23.8%
Simplified23.8%
associate-*r*23.8%
sqrt-prod34.8%
Applied egg-rr34.8%
*-commutative34.8%
Simplified34.8%
if 0.0 < (sqrt.f64 (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*))))) Initial program 56.2%
associate-*l/58.9%
Applied egg-rr58.9%
add-cbrt-cube56.7%
pow356.7%
Applied egg-rr56.7%
rem-cbrt-cube58.9%
*-commutative58.9%
unpow258.9%
associate-*l*60.3%
Applied egg-rr60.3%
*-commutative60.3%
clear-num60.3%
un-div-inv60.3%
Applied egg-rr60.3%
Final simplification57.4%
(FPCore (n U t l Om U*) :precision binary64 (sqrt (* (* (* 2.0 n) U) (+ (- t (* 2.0 (* l (/ l Om)))) (* (- U* U) (* (/ l Om) (* n (/ l Om))))))))
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)))) + ((U_42_ - U) * ((l / Om) * (n * (l / Om)))))));
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
code = sqrt((((2.0d0 * n) * u) * ((t - (2.0d0 * (l * (l / om)))) + ((u_42 - u) * ((l / om) * (n * (l / om)))))))
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)))) + ((U_42_ - U) * ((l / Om) * (n * (l / Om)))))));
}
def code(n, U, t, l, Om, U_42_): return math.sqrt((((2.0 * n) * U) * ((t - (2.0 * (l * (l / Om)))) + ((U_42_ - U) * ((l / Om) * (n * (l / Om)))))))
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(l * Float64(l / Om)))) + Float64(Float64(U_42_ - U) * Float64(Float64(l / Om) * Float64(n * Float64(l / Om))))))) end
function tmp = code(n, U, t, l, Om, U_42_) tmp = sqrt((((2.0 * n) * U) * ((t - (2.0 * (l * (l / Om)))) + ((U_42_ - U) * ((l / Om) * (n * (l / Om))))))); 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[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(U$42$ - U), $MachinePrecision] * N[(N[(l / Om), $MachinePrecision] * N[(n * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right) + \left(U* - U\right) \cdot \left(\frac{\ell}{Om} \cdot \left(n \cdot \frac{\ell}{Om}\right)\right)\right)}
\end{array}
Initial program 50.6%
associate-*l/53.0%
Applied egg-rr53.0%
add-cbrt-cube51.1%
pow351.1%
Applied egg-rr51.1%
rem-cbrt-cube53.0%
*-commutative53.0%
unpow253.0%
associate-*l*54.3%
Applied egg-rr54.3%
Final simplification54.3%
(FPCore (n U t l Om U*) :precision binary64 (sqrt (* (* (* 2.0 n) U) (+ (- t (* 2.0 (* l (/ l Om)))) (* (- U* U) (* (/ l Om) (/ n (/ Om l))))))))
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)))) + ((U_42_ - U) * ((l / Om) * (n / (Om / l)))))));
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
code = sqrt((((2.0d0 * n) * u) * ((t - (2.0d0 * (l * (l / om)))) + ((u_42 - u) * ((l / om) * (n / (om / l)))))))
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)))) + ((U_42_ - U) * ((l / Om) * (n / (Om / l)))))));
}
def code(n, U, t, l, Om, U_42_): return math.sqrt((((2.0 * n) * U) * ((t - (2.0 * (l * (l / Om)))) + ((U_42_ - U) * ((l / Om) * (n / (Om / l)))))))
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(l * Float64(l / Om)))) + Float64(Float64(U_42_ - U) * Float64(Float64(l / Om) * Float64(n / Float64(Om / l))))))) end
function tmp = code(n, U, t, l, Om, U_42_) tmp = sqrt((((2.0 * n) * U) * ((t - (2.0 * (l * (l / Om)))) + ((U_42_ - U) * ((l / Om) * (n / (Om / l))))))); 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[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(U$42$ - U), $MachinePrecision] * N[(N[(l / Om), $MachinePrecision] * N[(n / N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right) + \left(U* - U\right) \cdot \left(\frac{\ell}{Om} \cdot \frac{n}{\frac{Om}{\ell}}\right)\right)}
\end{array}
Initial program 50.6%
associate-*l/53.0%
Applied egg-rr53.0%
add-cbrt-cube51.1%
pow351.1%
Applied egg-rr51.1%
rem-cbrt-cube53.0%
*-commutative53.0%
unpow253.0%
associate-*l*54.3%
Applied egg-rr54.3%
*-commutative54.3%
clear-num54.3%
un-div-inv54.3%
Applied egg-rr54.3%
Final simplification54.3%
(FPCore (n U t l Om U*) :precision binary64 (if (<= t 1.4e-167) (pow (* 2.0 (* n (* U t))) 0.5) (sqrt (* 2.0 (* U (* n t))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (t <= 1.4e-167) {
tmp = pow((2.0 * (n * (U * t))), 0.5);
} else {
tmp = sqrt((2.0 * (U * (n * t))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (t <= 1.4d-167) then
tmp = (2.0d0 * (n * (u * t))) ** 0.5d0
else
tmp = sqrt((2.0d0 * (u * (n * t))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (t <= 1.4e-167) {
tmp = Math.pow((2.0 * (n * (U * t))), 0.5);
} else {
tmp = Math.sqrt((2.0 * (U * (n * t))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if t <= 1.4e-167: tmp = math.pow((2.0 * (n * (U * t))), 0.5) else: tmp = math.sqrt((2.0 * (U * (n * t)))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (t <= 1.4e-167) tmp = Float64(2.0 * Float64(n * Float64(U * t))) ^ 0.5; else tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * t)))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (t <= 1.4e-167) tmp = (2.0 * (n * (U * t))) ^ 0.5; else tmp = sqrt((2.0 * (U * (n * t)))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[t, 1.4e-167], N[Power[N[(2.0 * N[(n * N[(U * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[Sqrt[N[(2.0 * N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;t \leq 1.4 \cdot 10^{-167}:\\
\;\;\;\;{\left(2 \cdot \left(n \cdot \left(U \cdot t\right)\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}\\
\end{array}
\end{array}
if t < 1.39999999999999993e-167Initial program 46.6%
Simplified45.9%
Taylor expanded in t around inf 24.7%
pow1/226.8%
*-commutative26.8%
associate-*l*29.7%
Applied egg-rr29.7%
if 1.39999999999999993e-167 < t Initial program 56.7%
Simplified56.0%
Taylor expanded in t around inf 47.8%
Final simplification36.8%
(FPCore (n U t l Om U*) :precision binary64 (if (<= t 5e+103) (pow (* 2.0 (* t (* n U))) 0.5) (sqrt (* 2.0 (* U (* n t))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (t <= 5e+103) {
tmp = pow((2.0 * (t * (n * U))), 0.5);
} else {
tmp = sqrt((2.0 * (U * (n * t))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (t <= 5d+103) then
tmp = (2.0d0 * (t * (n * u))) ** 0.5d0
else
tmp = sqrt((2.0d0 * (u * (n * t))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (t <= 5e+103) {
tmp = Math.pow((2.0 * (t * (n * U))), 0.5);
} else {
tmp = Math.sqrt((2.0 * (U * (n * t))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if t <= 5e+103: tmp = math.pow((2.0 * (t * (n * U))), 0.5) else: tmp = math.sqrt((2.0 * (U * (n * t)))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (t <= 5e+103) tmp = Float64(2.0 * Float64(t * Float64(n * U))) ^ 0.5; else tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * t)))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (t <= 5e+103) tmp = (2.0 * (t * (n * U))) ^ 0.5; else tmp = sqrt((2.0 * (U * (n * t)))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[t, 5e+103], N[Power[N[(2.0 * N[(t * N[(n * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[Sqrt[N[(2.0 * N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;t \leq 5 \cdot 10^{+103}:\\
\;\;\;\;{\left(2 \cdot \left(t \cdot \left(n \cdot U\right)\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}\\
\end{array}
\end{array}
if t < 5e103Initial program 48.3%
Simplified48.3%
Taylor expanded in t around inf 27.9%
associate-*r*31.8%
*-commutative31.8%
associate-*l*29.5%
Simplified29.5%
pow1/231.1%
associate-*r*33.8%
*-commutative33.8%
Applied egg-rr33.8%
if 5e103 < t Initial program 61.5%
Simplified57.3%
Taylor expanded in t around inf 61.8%
Final simplification38.7%
(FPCore (n U t l Om U*) :precision binary64 (if (<= t 5e+116) (pow (* (* n U) (* 2.0 t)) 0.5) (sqrt (* 2.0 (* U (* n t))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (t <= 5e+116) {
tmp = pow(((n * U) * (2.0 * t)), 0.5);
} else {
tmp = sqrt((2.0 * (U * (n * t))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (t <= 5d+116) then
tmp = ((n * u) * (2.0d0 * t)) ** 0.5d0
else
tmp = sqrt((2.0d0 * (u * (n * t))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (t <= 5e+116) {
tmp = Math.pow(((n * U) * (2.0 * t)), 0.5);
} else {
tmp = Math.sqrt((2.0 * (U * (n * t))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if t <= 5e+116: tmp = math.pow(((n * U) * (2.0 * t)), 0.5) else: tmp = math.sqrt((2.0 * (U * (n * t)))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (t <= 5e+116) tmp = Float64(Float64(n * U) * Float64(2.0 * t)) ^ 0.5; else tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * t)))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (t <= 5e+116) tmp = ((n * U) * (2.0 * t)) ^ 0.5; else tmp = sqrt((2.0 * (U * (n * t)))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[t, 5e+116], N[Power[N[(N[(n * U), $MachinePrecision] * N[(2.0 * t), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[Sqrt[N[(2.0 * N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;t \leq 5 \cdot 10^{+116}:\\
\;\;\;\;{\left(\left(n \cdot U\right) \cdot \left(2 \cdot t\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}\\
\end{array}
\end{array}
if t < 5.00000000000000025e116Initial program 48.3%
associate-*l/51.1%
Applied egg-rr51.1%
add-cbrt-cube49.7%
pow349.7%
Applied egg-rr49.7%
Taylor expanded in t around inf 27.9%
associate-*r*27.9%
Simplified27.9%
associate-*r*27.9%
pow1/229.4%
*-commutative29.4%
associate-*r*33.8%
associate-*l*33.8%
*-commutative33.8%
Applied egg-rr33.8%
if 5.00000000000000025e116 < t Initial program 61.5%
Simplified57.3%
Taylor expanded in t around inf 61.8%
Final simplification38.7%
(FPCore (n U t l Om U*) :precision binary64 (if (<= t 6e-180) (sqrt (* 2.0 (* n (* U t)))) (sqrt (* 2.0 (* U (* n t))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (t <= 6e-180) {
tmp = sqrt((2.0 * (n * (U * t))));
} else {
tmp = sqrt((2.0 * (U * (n * t))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (t <= 6d-180) then
tmp = sqrt((2.0d0 * (n * (u * t))))
else
tmp = sqrt((2.0d0 * (u * (n * t))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (t <= 6e-180) {
tmp = Math.sqrt((2.0 * (n * (U * t))));
} else {
tmp = Math.sqrt((2.0 * (U * (n * t))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if t <= 6e-180: tmp = math.sqrt((2.0 * (n * (U * t)))) else: tmp = math.sqrt((2.0 * (U * (n * t)))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (t <= 6e-180) tmp = sqrt(Float64(2.0 * Float64(n * Float64(U * t)))); else tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * t)))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (t <= 6e-180) tmp = sqrt((2.0 * (n * (U * t)))); else tmp = sqrt((2.0 * (U * (n * t)))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[t, 6e-180], N[Sqrt[N[(2.0 * N[(n * N[(U * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;t \leq 6 \cdot 10^{-180}:\\
\;\;\;\;\sqrt{2 \cdot \left(n \cdot \left(U \cdot t\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}\\
\end{array}
\end{array}
if t < 6.0000000000000001e-180Initial program 46.6%
Simplified45.9%
Taylor expanded in t around inf 24.7%
associate-*r*30.0%
*-commutative30.0%
associate-*l*27.5%
Simplified27.5%
if 6.0000000000000001e-180 < t Initial program 56.7%
Simplified56.0%
Taylor expanded in t around inf 47.8%
Final simplification35.5%
(FPCore (n U t l Om U*) :precision binary64 (sqrt (* 2.0 (* U (* n t)))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return sqrt((2.0 * (U * (n * t))));
}
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 * (u * (n * t))))
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.sqrt((2.0 * (U * (n * t))));
}
def code(n, U, t, l, Om, U_42_): return math.sqrt((2.0 * (U * (n * t))))
function code(n, U, t, l, Om, U_42_) return sqrt(Float64(2.0 * Float64(U * Float64(n * t)))) end
function tmp = code(n, U, t, l, Om, U_42_) tmp = sqrt((2.0 * (U * (n * t)))); end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Sqrt[N[(2.0 * N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}
\end{array}
Initial program 50.6%
Simplified49.9%
Taylor expanded in t around inf 33.8%
Final simplification33.8%
herbie shell --seed 2023301
(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*))))))