
(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 14 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 (* l (/ l Om)))
(t_2 (* n (pow (/ l Om) 2.0)))
(t_3 (* t_2 (- U* U)))
(t_4 (* (* (* 2.0 n) U) (+ (- t (* 2.0 (/ (* l l) Om))) t_3))))
(if (<= t_4 0.0)
(sqrt (* (* 2.0 n) (* U (- t (fma 2.0 t_1 (- (* U t_2) (* t_2 U*)))))))
(if (<= t_4 INFINITY)
(sqrt (* (+ t (- t_3 (* 2.0 t_1))) (* 2.0 (* n U))))
(pow
(pow
(* (* 2.0 (* U -2.0)) (* n (/ (pow l 2.0) Om)))
0.16666666666666666)
3.0)))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = l * (l / Om);
double t_2 = n * pow((l / Om), 2.0);
double t_3 = t_2 * (U_42_ - U);
double t_4 = ((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) + t_3);
double tmp;
if (t_4 <= 0.0) {
tmp = sqrt(((2.0 * n) * (U * (t - fma(2.0, t_1, ((U * t_2) - (t_2 * U_42_)))))));
} else if (t_4 <= ((double) INFINITY)) {
tmp = sqrt(((t + (t_3 - (2.0 * t_1))) * (2.0 * (n * U))));
} else {
tmp = pow(pow(((2.0 * (U * -2.0)) * (n * (pow(l, 2.0) / Om))), 0.16666666666666666), 3.0);
}
return tmp;
}
function code(n, U, t, l, Om, U_42_) t_1 = Float64(l * Float64(l / Om)) t_2 = Float64(n * (Float64(l / Om) ^ 2.0)) t_3 = Float64(t_2 * Float64(U_42_ - U)) t_4 = Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) + t_3)) tmp = 0.0 if (t_4 <= 0.0) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t - fma(2.0, t_1, Float64(Float64(U * t_2) - Float64(t_2 * U_42_))))))); elseif (t_4 <= Inf) tmp = sqrt(Float64(Float64(t + Float64(t_3 - Float64(2.0 * t_1))) * Float64(2.0 * Float64(n * U)))); else tmp = (Float64(Float64(2.0 * Float64(U * -2.0)) * Float64(n * Float64((l ^ 2.0) / Om))) ^ 0.16666666666666666) ^ 3.0; end return tmp end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$2 * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$3), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$4, 0.0], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t - N[(2.0 * t$95$1 + N[(N[(U * t$95$2), $MachinePrecision] - N[(t$95$2 * U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[Sqrt[N[(N[(t + N[(t$95$3 - N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Power[N[Power[N[(N[(2.0 * N[(U * -2.0), $MachinePrecision]), $MachinePrecision] * N[(n * N[(N[Power[l, 2.0], $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.16666666666666666], $MachinePrecision], 3.0], $MachinePrecision]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \ell \cdot \frac{\ell}{Om}\\
t_2 := n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\\
t_3 := t\_2 \cdot \left(U* - U\right)\\
t_4 := \left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) + t\_3\right)\\
\mathbf{if}\;t\_4 \leq 0:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t - \mathsf{fma}\left(2, t\_1, U \cdot t\_2 - t\_2 \cdot U*\right)\right)\right)}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\sqrt{\left(t + \left(t\_3 - 2 \cdot t\_1\right)\right) \cdot \left(2 \cdot \left(n \cdot U\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;{\left({\left(\left(2 \cdot \left(U \cdot -2\right)\right) \cdot \left(n \cdot \frac{{\ell}^{2}}{Om}\right)\right)}^{0.16666666666666666}\right)}^{3}\\
\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*)))) < 0.0Initial program 15.4%
Simplified45.2%
associate-*r*48.5%
sub-neg48.5%
distribute-lft-in48.5%
Applied egg-rr48.5%
if 0.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*)))) < +inf.0Initial program 68.3%
Simplified72.8%
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%
Simplified3.0%
Taylor expanded in n around 0 2.1%
add-cube-cbrt2.1%
pow32.1%
associate-*r*1.3%
*-commutative1.3%
cancel-sign-sub-inv1.3%
metadata-eval1.3%
Applied egg-rr1.3%
Taylor expanded in t around 0 2.3%
associate-*r/2.3%
associate-*r*2.3%
*-commutative2.3%
Simplified2.3%
*-un-lft-identity2.3%
pow1/32.3%
pow1/230.2%
metadata-eval30.2%
pow-pow30.2%
associate-/l*33.1%
*-commutative33.1%
metadata-eval33.1%
metadata-eval33.1%
Applied egg-rr33.1%
*-lft-identity33.1%
associate-*r*33.1%
associate-/l*33.1%
Simplified33.1%
Final simplification64.3%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (/ (pow l 2.0) Om))
(t_2 (* (* n (pow (/ l Om) 2.0)) (- U* U)))
(t_3 (sqrt (* (* (* 2.0 n) U) (+ (- t (* 2.0 (/ (* l l) Om))) t_2)))))
(if (<= t_3 0.0)
(sqrt (* 2.0 (* U (* n (- t (* 2.0 t_1))))))
(if (<= t_3 INFINITY)
(sqrt (* (+ t (- t_2 (* 2.0 (* l (/ l Om))))) (* 2.0 (* n U))))
(pow (pow (* (* 2.0 (* U -2.0)) (* n t_1)) 0.16666666666666666) 3.0)))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = pow(l, 2.0) / Om;
double t_2 = (n * pow((l / Om), 2.0)) * (U_42_ - U);
double t_3 = sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) + t_2)));
double tmp;
if (t_3 <= 0.0) {
tmp = sqrt((2.0 * (U * (n * (t - (2.0 * t_1))))));
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt(((t + (t_2 - (2.0 * (l * (l / Om))))) * (2.0 * (n * U))));
} else {
tmp = pow(pow(((2.0 * (U * -2.0)) * (n * t_1)), 0.16666666666666666), 3.0);
}
return tmp;
}
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = Math.pow(l, 2.0) / Om;
double t_2 = (n * Math.pow((l / Om), 2.0)) * (U_42_ - U);
double t_3 = Math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) + t_2)));
double tmp;
if (t_3 <= 0.0) {
tmp = Math.sqrt((2.0 * (U * (n * (t - (2.0 * t_1))))));
} else if (t_3 <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt(((t + (t_2 - (2.0 * (l * (l / Om))))) * (2.0 * (n * U))));
} else {
tmp = Math.pow(Math.pow(((2.0 * (U * -2.0)) * (n * t_1)), 0.16666666666666666), 3.0);
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = math.pow(l, 2.0) / Om t_2 = (n * math.pow((l / Om), 2.0)) * (U_42_ - U) t_3 = math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) + t_2))) tmp = 0 if t_3 <= 0.0: tmp = math.sqrt((2.0 * (U * (n * (t - (2.0 * t_1)))))) elif t_3 <= math.inf: tmp = math.sqrt(((t + (t_2 - (2.0 * (l * (l / Om))))) * (2.0 * (n * U)))) else: tmp = math.pow(math.pow(((2.0 * (U * -2.0)) * (n * t_1)), 0.16666666666666666), 3.0) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64((l ^ 2.0) / Om) t_2 = Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U_42_ - U)) t_3 = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) + t_2))) tmp = 0.0 if (t_3 <= 0.0) tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(t - Float64(2.0 * t_1)))))); elseif (t_3 <= Inf) tmp = sqrt(Float64(Float64(t + Float64(t_2 - Float64(2.0 * Float64(l * Float64(l / Om))))) * Float64(2.0 * Float64(n * U)))); else tmp = (Float64(Float64(2.0 * Float64(U * -2.0)) * Float64(n * t_1)) ^ 0.16666666666666666) ^ 3.0; end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = (l ^ 2.0) / Om; t_2 = (n * ((l / Om) ^ 2.0)) * (U_42_ - U); t_3 = sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) + t_2))); tmp = 0.0; if (t_3 <= 0.0) tmp = sqrt((2.0 * (U * (n * (t - (2.0 * t_1)))))); elseif (t_3 <= Inf) tmp = sqrt(((t + (t_2 - (2.0 * (l * (l / Om))))) * (2.0 * (n * U)))); else tmp = (((2.0 * (U * -2.0)) * (n * t_1)) ^ 0.16666666666666666) ^ 3.0; end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(N[Power[l, 2.0], $MachinePrecision] / Om), $MachinePrecision]}, Block[{t$95$2 = N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = 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] + t$95$2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$3, 0.0], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(t - N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[Sqrt[N[(N[(t + N[(t$95$2 - N[(2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Power[N[Power[N[(N[(2.0 * N[(U * -2.0), $MachinePrecision]), $MachinePrecision] * N[(n * t$95$1), $MachinePrecision]), $MachinePrecision], 0.16666666666666666], $MachinePrecision], 3.0], $MachinePrecision]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \frac{{\ell}^{2}}{Om}\\
t_2 := \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\\
t_3 := \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) + t\_2\right)}\\
\mathbf{if}\;t\_3 \leq 0:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(t - 2 \cdot t\_1\right)\right)\right)}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\sqrt{\left(t + \left(t\_2 - 2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right)\right) \cdot \left(2 \cdot \left(n \cdot U\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;{\left({\left(\left(2 \cdot \left(U \cdot -2\right)\right) \cdot \left(n \cdot t\_1\right)\right)}^{0.16666666666666666}\right)}^{3}\\
\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 15.9%
Simplified46.6%
Taylor expanded in n around 0 46.7%
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*))))) < +inf.0Initial program 68.3%
Simplified72.8%
if +inf.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*))))) Initial program 0.0%
Simplified3.0%
Taylor expanded in n around 0 2.0%
add-cube-cbrt2.0%
pow32.0%
associate-*r*1.2%
*-commutative1.2%
cancel-sign-sub-inv1.2%
metadata-eval1.2%
Applied egg-rr1.2%
Taylor expanded in t around 0 2.2%
associate-*r/2.2%
associate-*r*2.2%
*-commutative2.2%
Simplified2.2%
*-un-lft-identity2.2%
pow1/32.2%
pow1/229.6%
metadata-eval29.6%
pow-pow29.6%
associate-/l*32.3%
*-commutative32.3%
metadata-eval32.3%
metadata-eval32.3%
Applied egg-rr32.3%
*-lft-identity32.3%
associate-*r*32.3%
associate-/l*32.4%
Simplified32.4%
Final simplification63.9%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* 2.0 (* n U)))
(t_2 (* n (pow (/ l Om) 2.0)))
(t_3 (* t_2 (- U* U)))
(t_4 (sqrt (* (* (* 2.0 n) U) (+ (- t (* 2.0 (/ (* l l) Om))) t_3)))))
(if (<= t_4 0.0)
(sqrt (* 2.0 (* U (* n (- t (* 2.0 (/ (pow l 2.0) Om)))))))
(if (<= t_4 INFINITY)
(sqrt (* (+ t (- t_3 (* 2.0 (* l (/ l Om))))) t_1))
(sqrt (* (+ t (* t_2 U*)) t_1))))))
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 = n * pow((l / Om), 2.0);
double t_3 = t_2 * (U_42_ - U);
double t_4 = sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) + t_3)));
double tmp;
if (t_4 <= 0.0) {
tmp = sqrt((2.0 * (U * (n * (t - (2.0 * (pow(l, 2.0) / Om)))))));
} else if (t_4 <= ((double) INFINITY)) {
tmp = sqrt(((t + (t_3 - (2.0 * (l * (l / Om))))) * t_1));
} else {
tmp = sqrt(((t + (t_2 * U_42_)) * t_1));
}
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 = n * Math.pow((l / Om), 2.0);
double t_3 = t_2 * (U_42_ - U);
double t_4 = Math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) + t_3)));
double tmp;
if (t_4 <= 0.0) {
tmp = Math.sqrt((2.0 * (U * (n * (t - (2.0 * (Math.pow(l, 2.0) / Om)))))));
} else if (t_4 <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt(((t + (t_3 - (2.0 * (l * (l / Om))))) * t_1));
} else {
tmp = Math.sqrt(((t + (t_2 * U_42_)) * t_1));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = 2.0 * (n * U) t_2 = n * math.pow((l / Om), 2.0) t_3 = t_2 * (U_42_ - U) t_4 = math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) + t_3))) tmp = 0 if t_4 <= 0.0: tmp = math.sqrt((2.0 * (U * (n * (t - (2.0 * (math.pow(l, 2.0) / Om))))))) elif t_4 <= math.inf: tmp = math.sqrt(((t + (t_3 - (2.0 * (l * (l / Om))))) * t_1)) else: tmp = math.sqrt(((t + (t_2 * U_42_)) * t_1)) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(2.0 * Float64(n * U)) t_2 = Float64(n * (Float64(l / Om) ^ 2.0)) t_3 = Float64(t_2 * Float64(U_42_ - U)) t_4 = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) + t_3))) tmp = 0.0 if (t_4 <= 0.0) tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(t - Float64(2.0 * Float64((l ^ 2.0) / Om))))))); elseif (t_4 <= Inf) tmp = sqrt(Float64(Float64(t + Float64(t_3 - Float64(2.0 * Float64(l * Float64(l / Om))))) * t_1)); else tmp = sqrt(Float64(Float64(t + Float64(t_2 * U_42_)) * t_1)); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = 2.0 * (n * U); t_2 = n * ((l / Om) ^ 2.0); t_3 = t_2 * (U_42_ - U); t_4 = sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) + t_3))); tmp = 0.0; if (t_4 <= 0.0) tmp = sqrt((2.0 * (U * (n * (t - (2.0 * ((l ^ 2.0) / Om))))))); elseif (t_4 <= Inf) tmp = sqrt(((t + (t_3 - (2.0 * (l * (l / Om))))) * t_1)); else tmp = sqrt(((t + (t_2 * U_42_)) * t_1)); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$2 * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = 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] + t$95$3), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$4, 0.0], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(t - N[(2.0 * N[(N[Power[l, 2.0], $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[Sqrt[N[(N[(t + N[(t$95$3 - N[(2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(t + N[(t$95$2 * U$42$), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := 2 \cdot \left(n \cdot U\right)\\
t_2 := n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\\
t_3 := t\_2 \cdot \left(U* - U\right)\\
t_4 := \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) + t\_3\right)}\\
\mathbf{if}\;t\_4 \leq 0:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(t - 2 \cdot \frac{{\ell}^{2}}{Om}\right)\right)\right)}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\sqrt{\left(t + \left(t\_3 - 2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right)\right) \cdot t\_1}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(t + t\_2 \cdot U*\right) \cdot t\_1}\\
\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 15.9%
Simplified46.6%
Taylor expanded in n around 0 46.7%
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*))))) < +inf.0Initial program 68.3%
Simplified72.8%
if +inf.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*))))) Initial program 0.0%
Simplified3.0%
Taylor expanded in U* around inf 31.0%
mul-1-neg31.0%
associate-/l*31.0%
distribute-rgt-neg-in31.0%
distribute-neg-frac231.0%
*-commutative31.0%
Simplified31.0%
*-un-lft-identity31.0%
associate-*r*30.4%
associate-*l*30.4%
associate-/l*30.4%
Applied egg-rr30.4%
*-lft-identity30.4%
distribute-frac-neg230.4%
unpow230.4%
unpow230.4%
times-frac31.1%
unpow231.1%
Simplified31.1%
Final simplification63.8%
(FPCore (n U t l Om U*) :precision binary64 (if (or (<= U* -3.4e-243) (not (<= U* 9.5e+127))) (sqrt (* (* 2.0 (* n U)) (+ t (* n (* (pow (/ l Om) 2.0) U*))))) (sqrt (* 2.0 (* U (* n (- t (* 2.0 (/ (pow l 2.0) Om)))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if ((U_42_ <= -3.4e-243) || !(U_42_ <= 9.5e+127)) {
tmp = sqrt(((2.0 * (n * U)) * (t + (n * (pow((l / Om), 2.0) * U_42_)))));
} else {
tmp = sqrt((2.0 * (U * (n * (t - (2.0 * (pow(l, 2.0) / Om)))))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if ((u_42 <= (-3.4d-243)) .or. (.not. (u_42 <= 9.5d+127))) then
tmp = sqrt(((2.0d0 * (n * u)) * (t + (n * (((l / om) ** 2.0d0) * u_42)))))
else
tmp = sqrt((2.0d0 * (u * (n * (t - (2.0d0 * ((l ** 2.0d0) / om)))))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if ((U_42_ <= -3.4e-243) || !(U_42_ <= 9.5e+127)) {
tmp = Math.sqrt(((2.0 * (n * U)) * (t + (n * (Math.pow((l / Om), 2.0) * U_42_)))));
} else {
tmp = Math.sqrt((2.0 * (U * (n * (t - (2.0 * (Math.pow(l, 2.0) / Om)))))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if (U_42_ <= -3.4e-243) or not (U_42_ <= 9.5e+127): tmp = math.sqrt(((2.0 * (n * U)) * (t + (n * (math.pow((l / Om), 2.0) * U_42_))))) else: tmp = math.sqrt((2.0 * (U * (n * (t - (2.0 * (math.pow(l, 2.0) / Om))))))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if ((U_42_ <= -3.4e-243) || !(U_42_ <= 9.5e+127)) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t + Float64(n * Float64((Float64(l / Om) ^ 2.0) * U_42_))))); else tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(t - Float64(2.0 * Float64((l ^ 2.0) / Om))))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if ((U_42_ <= -3.4e-243) || ~((U_42_ <= 9.5e+127))) tmp = sqrt(((2.0 * (n * U)) * (t + (n * (((l / Om) ^ 2.0) * U_42_))))); else tmp = sqrt((2.0 * (U * (n * (t - (2.0 * ((l ^ 2.0) / Om))))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[Or[LessEqual[U$42$, -3.4e-243], N[Not[LessEqual[U$42$, 9.5e+127]], $MachinePrecision]], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(n * N[(N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision] * U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(t - N[(2.0 * N[(N[Power[l, 2.0], $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;U* \leq -3.4 \cdot 10^{-243} \lor \neg \left(U* \leq 9.5 \cdot 10^{+127}\right):\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t + n \cdot \left({\left(\frac{\ell}{Om}\right)}^{2} \cdot U*\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(t - 2 \cdot \frac{{\ell}^{2}}{Om}\right)\right)\right)}\\
\end{array}
\end{array}
if U* < -3.39999999999999996e-243 or 9.49999999999999975e127 < U* Initial program 54.5%
Simplified53.2%
Taylor expanded in U* around inf 47.2%
mul-1-neg47.2%
associate-/l*49.9%
distribute-rgt-neg-in49.9%
distribute-neg-frac249.9%
*-commutative49.9%
Simplified49.9%
*-un-lft-identity49.9%
associate-*r*51.8%
associate-*l*51.8%
associate-/l*51.9%
Applied egg-rr51.9%
*-lft-identity51.9%
distribute-frac-neg251.9%
unpow251.9%
unpow251.9%
times-frac60.6%
unpow260.6%
Simplified60.6%
*-un-lft-identity60.6%
associate-*r*56.5%
Applied egg-rr56.5%
*-lft-identity56.5%
*-commutative56.5%
sub-neg56.5%
distribute-rgt-neg-out56.5%
remove-double-neg56.5%
*-commutative56.5%
Simplified56.5%
pow156.5%
associate-*l*60.3%
Applied egg-rr60.3%
unpow160.3%
Simplified60.3%
if -3.39999999999999996e-243 < U* < 9.49999999999999975e127Initial program 49.4%
Simplified53.0%
Taylor expanded in n around 0 53.4%
Final simplification57.5%
(FPCore (n U t l Om U*) :precision binary64 (if (or (<= U* -1.96e-230) (not (<= U* 2.8e+111))) (sqrt (* (+ t (* (* n (pow (/ l Om) 2.0)) U*)) (* 2.0 (* n U)))) (sqrt (* 2.0 (* U (* n (- t (* 2.0 (/ (pow l 2.0) Om)))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if ((U_42_ <= -1.96e-230) || !(U_42_ <= 2.8e+111)) {
tmp = sqrt(((t + ((n * pow((l / Om), 2.0)) * U_42_)) * (2.0 * (n * U))));
} else {
tmp = sqrt((2.0 * (U * (n * (t - (2.0 * (pow(l, 2.0) / Om)))))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if ((u_42 <= (-1.96d-230)) .or. (.not. (u_42 <= 2.8d+111))) then
tmp = sqrt(((t + ((n * ((l / om) ** 2.0d0)) * u_42)) * (2.0d0 * (n * u))))
else
tmp = sqrt((2.0d0 * (u * (n * (t - (2.0d0 * ((l ** 2.0d0) / om)))))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if ((U_42_ <= -1.96e-230) || !(U_42_ <= 2.8e+111)) {
tmp = Math.sqrt(((t + ((n * Math.pow((l / Om), 2.0)) * U_42_)) * (2.0 * (n * U))));
} else {
tmp = Math.sqrt((2.0 * (U * (n * (t - (2.0 * (Math.pow(l, 2.0) / Om)))))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if (U_42_ <= -1.96e-230) or not (U_42_ <= 2.8e+111): tmp = math.sqrt(((t + ((n * math.pow((l / Om), 2.0)) * U_42_)) * (2.0 * (n * U)))) else: tmp = math.sqrt((2.0 * (U * (n * (t - (2.0 * (math.pow(l, 2.0) / Om))))))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if ((U_42_ <= -1.96e-230) || !(U_42_ <= 2.8e+111)) tmp = sqrt(Float64(Float64(t + Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * U_42_)) * Float64(2.0 * Float64(n * U)))); else tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(t - Float64(2.0 * Float64((l ^ 2.0) / Om))))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if ((U_42_ <= -1.96e-230) || ~((U_42_ <= 2.8e+111))) tmp = sqrt(((t + ((n * ((l / Om) ^ 2.0)) * U_42_)) * (2.0 * (n * U)))); else tmp = sqrt((2.0 * (U * (n * (t - (2.0 * ((l ^ 2.0) / Om))))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[Or[LessEqual[U$42$, -1.96e-230], N[Not[LessEqual[U$42$, 2.8e+111]], $MachinePrecision]], N[Sqrt[N[(N[(t + N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * U$42$), $MachinePrecision]), $MachinePrecision] * N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(t - N[(2.0 * N[(N[Power[l, 2.0], $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;U* \leq -1.96 \cdot 10^{-230} \lor \neg \left(U* \leq 2.8 \cdot 10^{+111}\right):\\
\;\;\;\;\sqrt{\left(t + \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot U*\right) \cdot \left(2 \cdot \left(n \cdot U\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(t - 2 \cdot \frac{{\ell}^{2}}{Om}\right)\right)\right)}\\
\end{array}
\end{array}
if U* < -1.96000000000000001e-230 or 2.7999999999999999e111 < U* Initial program 53.3%
Simplified52.0%
Taylor expanded in U* around inf 46.7%
mul-1-neg46.7%
associate-/l*49.3%
distribute-rgt-neg-in49.3%
distribute-neg-frac249.3%
*-commutative49.3%
Simplified49.3%
*-un-lft-identity49.3%
associate-*r*50.6%
associate-*l*50.6%
associate-/l*50.7%
Applied egg-rr50.7%
*-lft-identity50.7%
distribute-frac-neg250.7%
unpow250.7%
unpow250.7%
times-frac59.2%
unpow259.2%
Simplified59.2%
if -1.96000000000000001e-230 < U* < 2.7999999999999999e111Initial program 51.1%
Simplified54.9%
Taylor expanded in n around 0 55.3%
Final simplification57.6%
(FPCore (n U t l Om U*) :precision binary64 (if (or (<= U* -5e-62) (not (<= U* 2.5e+111))) (sqrt (* (* 2.0 (* n U)) (+ t (* (* n U*) (* (/ l Om) (/ l Om)))))) (sqrt (* 2.0 (* U (* n (- t (* 2.0 (/ (pow l 2.0) Om)))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if ((U_42_ <= -5e-62) || !(U_42_ <= 2.5e+111)) {
tmp = sqrt(((2.0 * (n * U)) * (t + ((n * U_42_) * ((l / Om) * (l / Om))))));
} else {
tmp = sqrt((2.0 * (U * (n * (t - (2.0 * (pow(l, 2.0) / Om)))))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if ((u_42 <= (-5d-62)) .or. (.not. (u_42 <= 2.5d+111))) then
tmp = sqrt(((2.0d0 * (n * u)) * (t + ((n * u_42) * ((l / om) * (l / om))))))
else
tmp = sqrt((2.0d0 * (u * (n * (t - (2.0d0 * ((l ** 2.0d0) / om)))))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if ((U_42_ <= -5e-62) || !(U_42_ <= 2.5e+111)) {
tmp = Math.sqrt(((2.0 * (n * U)) * (t + ((n * U_42_) * ((l / Om) * (l / Om))))));
} else {
tmp = Math.sqrt((2.0 * (U * (n * (t - (2.0 * (Math.pow(l, 2.0) / Om)))))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if (U_42_ <= -5e-62) or not (U_42_ <= 2.5e+111): tmp = math.sqrt(((2.0 * (n * U)) * (t + ((n * U_42_) * ((l / Om) * (l / Om)))))) else: tmp = math.sqrt((2.0 * (U * (n * (t - (2.0 * (math.pow(l, 2.0) / Om))))))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if ((U_42_ <= -5e-62) || !(U_42_ <= 2.5e+111)) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t + Float64(Float64(n * U_42_) * Float64(Float64(l / Om) * Float64(l / Om)))))); else tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(t - Float64(2.0 * Float64((l ^ 2.0) / Om))))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if ((U_42_ <= -5e-62) || ~((U_42_ <= 2.5e+111))) tmp = sqrt(((2.0 * (n * U)) * (t + ((n * U_42_) * ((l / Om) * (l / Om)))))); else tmp = sqrt((2.0 * (U * (n * (t - (2.0 * ((l ^ 2.0) / Om))))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[Or[LessEqual[U$42$, -5e-62], N[Not[LessEqual[U$42$, 2.5e+111]], $MachinePrecision]], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(N[(n * U$42$), $MachinePrecision] * N[(N[(l / Om), $MachinePrecision] * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(t - N[(2.0 * N[(N[Power[l, 2.0], $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;U* \leq -5 \cdot 10^{-62} \lor \neg \left(U* \leq 2.5 \cdot 10^{+111}\right):\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t + \left(n \cdot U*\right) \cdot \left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(t - 2 \cdot \frac{{\ell}^{2}}{Om}\right)\right)\right)}\\
\end{array}
\end{array}
if U* < -5.0000000000000002e-62 or 2.4999999999999998e111 < U* Initial program 53.1%
Simplified53.7%
Taylor expanded in U* around inf 50.3%
mul-1-neg50.3%
associate-/l*53.5%
distribute-rgt-neg-in53.5%
distribute-neg-frac253.5%
*-commutative53.5%
Simplified53.5%
*-un-lft-identity53.5%
associate-*r*52.8%
associate-*l*52.8%
associate-/l*52.9%
Applied egg-rr52.9%
*-lft-identity52.9%
distribute-frac-neg252.9%
unpow252.9%
unpow252.9%
times-frac61.9%
unpow261.9%
Simplified61.9%
*-un-lft-identity61.9%
associate-*r*56.9%
Applied egg-rr56.9%
*-lft-identity56.9%
*-commutative56.9%
sub-neg56.9%
distribute-rgt-neg-out56.9%
remove-double-neg56.9%
*-commutative56.9%
Simplified56.9%
unpow256.9%
Applied egg-rr56.9%
if -5.0000000000000002e-62 < U* < 2.4999999999999998e111Initial program 51.8%
Simplified52.6%
Taylor expanded in n around 0 53.7%
Final simplification55.2%
(FPCore (n U t l Om U*)
:precision binary64
(if (<= Om -1.85e+15)
(sqrt (* (* 2.0 n) (* U (- t (/ (* 2.0 (pow l 2.0)) Om)))))
(if (<= Om 8.2e+83)
(sqrt (* (* 2.0 (* n U)) (+ t (* (* n U*) (* (/ l Om) (/ l Om))))))
(sqrt (fabs (* (* 2.0 U) (* n t)))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (Om <= -1.85e+15) {
tmp = sqrt(((2.0 * n) * (U * (t - ((2.0 * pow(l, 2.0)) / Om)))));
} else if (Om <= 8.2e+83) {
tmp = sqrt(((2.0 * (n * U)) * (t + ((n * U_42_) * ((l / Om) * (l / Om))))));
} else {
tmp = sqrt(fabs(((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 (om <= (-1.85d+15)) then
tmp = sqrt(((2.0d0 * n) * (u * (t - ((2.0d0 * (l ** 2.0d0)) / om)))))
else if (om <= 8.2d+83) then
tmp = sqrt(((2.0d0 * (n * u)) * (t + ((n * u_42) * ((l / om) * (l / om))))))
else
tmp = sqrt(abs(((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 (Om <= -1.85e+15) {
tmp = Math.sqrt(((2.0 * n) * (U * (t - ((2.0 * Math.pow(l, 2.0)) / Om)))));
} else if (Om <= 8.2e+83) {
tmp = Math.sqrt(((2.0 * (n * U)) * (t + ((n * U_42_) * ((l / Om) * (l / Om))))));
} else {
tmp = Math.sqrt(Math.abs(((2.0 * U) * (n * t))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if Om <= -1.85e+15: tmp = math.sqrt(((2.0 * n) * (U * (t - ((2.0 * math.pow(l, 2.0)) / Om))))) elif Om <= 8.2e+83: tmp = math.sqrt(((2.0 * (n * U)) * (t + ((n * U_42_) * ((l / Om) * (l / Om)))))) else: tmp = math.sqrt(math.fabs(((2.0 * U) * (n * t)))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (Om <= -1.85e+15) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t - Float64(Float64(2.0 * (l ^ 2.0)) / Om))))); elseif (Om <= 8.2e+83) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t + Float64(Float64(n * U_42_) * Float64(Float64(l / Om) * Float64(l / Om)))))); else tmp = sqrt(abs(Float64(Float64(2.0 * U) * Float64(n * t)))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (Om <= -1.85e+15) tmp = sqrt(((2.0 * n) * (U * (t - ((2.0 * (l ^ 2.0)) / Om))))); elseif (Om <= 8.2e+83) tmp = sqrt(((2.0 * (n * U)) * (t + ((n * U_42_) * ((l / Om) * (l / Om)))))); else tmp = sqrt(abs(((2.0 * U) * (n * t)))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[Om, -1.85e+15], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t - N[(N[(2.0 * N[Power[l, 2.0], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[Om, 8.2e+83], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(N[(n * U$42$), $MachinePrecision] * N[(N[(l / Om), $MachinePrecision] * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[Abs[N[(N[(2.0 * U), $MachinePrecision] * N[(n * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;Om \leq -1.85 \cdot 10^{+15}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t - \frac{2 \cdot {\ell}^{2}}{Om}\right)\right)}\\
\mathbf{elif}\;Om \leq 8.2 \cdot 10^{+83}:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t + \left(n \cdot U*\right) \cdot \left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left|\left(2 \cdot U\right) \cdot \left(n \cdot t\right)\right|}\\
\end{array}
\end{array}
if Om < -1.85e15Initial program 63.3%
Simplified67.2%
Taylor expanded in Om around inf 58.4%
associate-*r/58.4%
Simplified58.4%
if -1.85e15 < Om < 8.2000000000000002e83Initial program 49.7%
Simplified46.6%
Taylor expanded in U* around inf 43.5%
mul-1-neg43.5%
associate-/l*43.5%
distribute-rgt-neg-in43.5%
distribute-neg-frac243.5%
*-commutative43.5%
Simplified43.5%
*-un-lft-identity43.5%
associate-*r*44.3%
associate-*l*44.3%
associate-/l*44.3%
Applied egg-rr44.3%
*-lft-identity44.3%
distribute-frac-neg244.3%
unpow244.3%
unpow244.3%
times-frac57.0%
unpow257.0%
Simplified57.0%
*-un-lft-identity57.0%
associate-*r*56.9%
Applied egg-rr56.9%
*-lft-identity56.9%
*-commutative56.9%
sub-neg56.9%
distribute-rgt-neg-out56.9%
remove-double-neg56.9%
*-commutative56.9%
Simplified56.9%
unpow256.9%
Applied egg-rr56.9%
if 8.2000000000000002e83 < Om Initial program 43.1%
Simplified48.3%
Taylor expanded in t around inf 48.9%
add-sqr-sqrt48.9%
pow1/248.9%
pow1/248.9%
pow-prod-down37.4%
pow237.4%
associate-*r*37.4%
Applied egg-rr37.4%
unpow1/237.4%
unpow237.4%
rem-sqrt-square49.2%
Simplified49.2%
Final simplification55.7%
(FPCore (n U t l Om U*)
:precision binary64
(if (<= Om -1e+16)
(sqrt (* (* (* 2.0 n) U) (- t (/ (* 2.0 (pow l 2.0)) Om))))
(if (<= Om 9.5e+83)
(sqrt (* (* 2.0 (* n U)) (+ t (* (* n U*) (* (/ l Om) (/ l Om))))))
(sqrt (fabs (* (* 2.0 U) (* n t)))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (Om <= -1e+16) {
tmp = sqrt((((2.0 * n) * U) * (t - ((2.0 * pow(l, 2.0)) / Om))));
} else if (Om <= 9.5e+83) {
tmp = sqrt(((2.0 * (n * U)) * (t + ((n * U_42_) * ((l / Om) * (l / Om))))));
} else {
tmp = sqrt(fabs(((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 (om <= (-1d+16)) then
tmp = sqrt((((2.0d0 * n) * u) * (t - ((2.0d0 * (l ** 2.0d0)) / om))))
else if (om <= 9.5d+83) then
tmp = sqrt(((2.0d0 * (n * u)) * (t + ((n * u_42) * ((l / om) * (l / om))))))
else
tmp = sqrt(abs(((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 (Om <= -1e+16) {
tmp = Math.sqrt((((2.0 * n) * U) * (t - ((2.0 * Math.pow(l, 2.0)) / Om))));
} else if (Om <= 9.5e+83) {
tmp = Math.sqrt(((2.0 * (n * U)) * (t + ((n * U_42_) * ((l / Om) * (l / Om))))));
} else {
tmp = Math.sqrt(Math.abs(((2.0 * U) * (n * t))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if Om <= -1e+16: tmp = math.sqrt((((2.0 * n) * U) * (t - ((2.0 * math.pow(l, 2.0)) / Om)))) elif Om <= 9.5e+83: tmp = math.sqrt(((2.0 * (n * U)) * (t + ((n * U_42_) * ((l / Om) * (l / Om)))))) else: tmp = math.sqrt(math.fabs(((2.0 * U) * (n * t)))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (Om <= -1e+16) tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(t - Float64(Float64(2.0 * (l ^ 2.0)) / Om)))); elseif (Om <= 9.5e+83) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t + Float64(Float64(n * U_42_) * Float64(Float64(l / Om) * Float64(l / Om)))))); else tmp = sqrt(abs(Float64(Float64(2.0 * U) * Float64(n * t)))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (Om <= -1e+16) tmp = sqrt((((2.0 * n) * U) * (t - ((2.0 * (l ^ 2.0)) / Om)))); elseif (Om <= 9.5e+83) tmp = sqrt(((2.0 * (n * U)) * (t + ((n * U_42_) * ((l / Om) * (l / Om)))))); else tmp = sqrt(abs(((2.0 * U) * (n * t)))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[Om, -1e+16], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(t - N[(N[(2.0 * N[Power[l, 2.0], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[Om, 9.5e+83], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(N[(n * U$42$), $MachinePrecision] * N[(N[(l / Om), $MachinePrecision] * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[Abs[N[(N[(2.0 * U), $MachinePrecision] * N[(n * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;Om \leq -1 \cdot 10^{+16}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t - \frac{2 \cdot {\ell}^{2}}{Om}\right)}\\
\mathbf{elif}\;Om \leq 9.5 \cdot 10^{+83}:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t + \left(n \cdot U*\right) \cdot \left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left|\left(2 \cdot U\right) \cdot \left(n \cdot t\right)\right|}\\
\end{array}
\end{array}
if Om < -1e16Initial program 64.2%
Taylor expanded in Om around inf 62.8%
metadata-eval62.8%
cancel-sign-sub-inv62.8%
associate-*r/62.8%
Simplified62.8%
if -1e16 < Om < 9.5000000000000002e83Initial program 49.3%
Simplified46.2%
Taylor expanded in U* around inf 43.2%
mul-1-neg43.2%
associate-/l*43.2%
distribute-rgt-neg-in43.2%
distribute-neg-frac243.2%
*-commutative43.2%
Simplified43.2%
*-un-lft-identity43.2%
associate-*r*43.9%
associate-*l*43.9%
associate-/l*44.0%
Applied egg-rr44.0%
*-lft-identity44.0%
distribute-frac-neg244.0%
unpow244.0%
unpow244.0%
times-frac56.5%
unpow256.5%
Simplified56.5%
*-un-lft-identity56.5%
associate-*r*56.4%
Applied egg-rr56.4%
*-lft-identity56.4%
*-commutative56.4%
sub-neg56.4%
distribute-rgt-neg-out56.4%
remove-double-neg56.4%
*-commutative56.4%
Simplified56.4%
unpow256.4%
Applied egg-rr56.4%
if 9.5000000000000002e83 < Om Initial program 43.1%
Simplified48.3%
Taylor expanded in t around inf 48.9%
add-sqr-sqrt48.9%
pow1/248.9%
pow1/248.9%
pow-prod-down37.4%
pow237.4%
associate-*r*37.4%
Applied egg-rr37.4%
unpow1/237.4%
unpow237.4%
rem-sqrt-square49.2%
Simplified49.2%
Final simplification56.8%
(FPCore (n U t l Om U*) :precision binary64 (if (<= Om 4.3e+83) (sqrt (* (* 2.0 (* n U)) (+ t (* (* n U*) (* (/ l Om) (/ l Om)))))) (sqrt (fabs (* (* 2.0 U) (* n t))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (Om <= 4.3e+83) {
tmp = sqrt(((2.0 * (n * U)) * (t + ((n * U_42_) * ((l / Om) * (l / Om))))));
} else {
tmp = sqrt(fabs(((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 (om <= 4.3d+83) then
tmp = sqrt(((2.0d0 * (n * u)) * (t + ((n * u_42) * ((l / om) * (l / om))))))
else
tmp = sqrt(abs(((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 (Om <= 4.3e+83) {
tmp = Math.sqrt(((2.0 * (n * U)) * (t + ((n * U_42_) * ((l / Om) * (l / Om))))));
} else {
tmp = Math.sqrt(Math.abs(((2.0 * U) * (n * t))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if Om <= 4.3e+83: tmp = math.sqrt(((2.0 * (n * U)) * (t + ((n * U_42_) * ((l / Om) * (l / Om)))))) else: tmp = math.sqrt(math.fabs(((2.0 * U) * (n * t)))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (Om <= 4.3e+83) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t + Float64(Float64(n * U_42_) * Float64(Float64(l / Om) * Float64(l / Om)))))); else tmp = sqrt(abs(Float64(Float64(2.0 * U) * Float64(n * t)))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (Om <= 4.3e+83) tmp = sqrt(((2.0 * (n * U)) * (t + ((n * U_42_) * ((l / Om) * (l / Om)))))); else tmp = sqrt(abs(((2.0 * U) * (n * t)))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[Om, 4.3e+83], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(N[(n * U$42$), $MachinePrecision] * N[(N[(l / Om), $MachinePrecision] * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[Abs[N[(N[(2.0 * U), $MachinePrecision] * N[(n * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;Om \leq 4.3 \cdot 10^{+83}:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t + \left(n \cdot U*\right) \cdot \left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left|\left(2 \cdot U\right) \cdot \left(n \cdot t\right)\right|}\\
\end{array}
\end{array}
if Om < 4.3e83Initial program 54.9%
Simplified54.4%
Taylor expanded in U* around inf 43.5%
mul-1-neg43.5%
associate-/l*44.4%
distribute-rgt-neg-in44.4%
distribute-neg-frac244.4%
*-commutative44.4%
Simplified44.4%
*-un-lft-identity44.4%
associate-*r*46.3%
associate-*l*46.3%
associate-/l*46.4%
Applied egg-rr46.4%
*-lft-identity46.4%
distribute-frac-neg246.4%
unpow246.4%
unpow246.4%
times-frac55.1%
unpow255.1%
Simplified55.1%
*-un-lft-identity55.1%
associate-*r*53.5%
Applied egg-rr53.5%
*-lft-identity53.5%
*-commutative53.5%
sub-neg53.5%
distribute-rgt-neg-out53.5%
remove-double-neg53.5%
*-commutative53.5%
Simplified53.5%
unpow253.5%
Applied egg-rr53.5%
if 4.3e83 < Om Initial program 43.1%
Simplified48.3%
Taylor expanded in t around inf 48.9%
add-sqr-sqrt48.9%
pow1/248.9%
pow1/248.9%
pow-prod-down37.4%
pow237.4%
associate-*r*37.4%
Applied egg-rr37.4%
unpow1/237.4%
unpow237.4%
rem-sqrt-square49.2%
Simplified49.2%
Final simplification52.6%
(FPCore (n U t l Om U*) :precision binary64 (if (<= Om 1.9e+83) (sqrt (* (* 2.0 (* n U)) (+ t (* (* n U*) (* (/ l Om) (/ l Om)))))) (sqrt (* 2.0 (* U (* n t))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (Om <= 1.9e+83) {
tmp = sqrt(((2.0 * (n * U)) * (t + ((n * U_42_) * ((l / Om) * (l / Om))))));
} 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 (om <= 1.9d+83) then
tmp = sqrt(((2.0d0 * (n * u)) * (t + ((n * u_42) * ((l / om) * (l / om))))))
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 (Om <= 1.9e+83) {
tmp = Math.sqrt(((2.0 * (n * U)) * (t + ((n * U_42_) * ((l / Om) * (l / Om))))));
} else {
tmp = Math.sqrt((2.0 * (U * (n * t))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if Om <= 1.9e+83: tmp = math.sqrt(((2.0 * (n * U)) * (t + ((n * U_42_) * ((l / Om) * (l / Om)))))) else: tmp = math.sqrt((2.0 * (U * (n * t)))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (Om <= 1.9e+83) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t + Float64(Float64(n * U_42_) * Float64(Float64(l / Om) * Float64(l / Om)))))); 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 (Om <= 1.9e+83) tmp = sqrt(((2.0 * (n * U)) * (t + ((n * U_42_) * ((l / Om) * (l / Om)))))); else tmp = sqrt((2.0 * (U * (n * t)))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[Om, 1.9e+83], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(N[(n * U$42$), $MachinePrecision] * N[(N[(l / Om), $MachinePrecision] * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $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}\;Om \leq 1.9 \cdot 10^{+83}:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t + \left(n \cdot U*\right) \cdot \left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}\\
\end{array}
\end{array}
if Om < 1.9000000000000001e83Initial program 54.9%
Simplified54.4%
Taylor expanded in U* around inf 43.5%
mul-1-neg43.5%
associate-/l*44.4%
distribute-rgt-neg-in44.4%
distribute-neg-frac244.4%
*-commutative44.4%
Simplified44.4%
*-un-lft-identity44.4%
associate-*r*46.3%
associate-*l*46.3%
associate-/l*46.4%
Applied egg-rr46.4%
*-lft-identity46.4%
distribute-frac-neg246.4%
unpow246.4%
unpow246.4%
times-frac55.1%
unpow255.1%
Simplified55.1%
*-un-lft-identity55.1%
associate-*r*53.5%
Applied egg-rr53.5%
*-lft-identity53.5%
*-commutative53.5%
sub-neg53.5%
distribute-rgt-neg-out53.5%
remove-double-neg53.5%
*-commutative53.5%
Simplified53.5%
unpow253.5%
Applied egg-rr53.5%
if 1.9000000000000001e83 < Om Initial program 43.1%
Simplified48.3%
Taylor expanded in t around inf 48.9%
Final simplification52.5%
(FPCore (n U t l Om U*) :precision binary64 (if (<= Om -8.6e+15) (sqrt (* t (* 2.0 (* n U)))) (pow (* (* 2.0 U) (* n t)) 0.5)))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (Om <= -8.6e+15) {
tmp = sqrt((t * (2.0 * (n * U))));
} else {
tmp = pow(((2.0 * U) * (n * t)), 0.5);
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (om <= (-8.6d+15)) then
tmp = sqrt((t * (2.0d0 * (n * u))))
else
tmp = ((2.0d0 * u) * (n * t)) ** 0.5d0
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (Om <= -8.6e+15) {
tmp = Math.sqrt((t * (2.0 * (n * U))));
} else {
tmp = Math.pow(((2.0 * U) * (n * t)), 0.5);
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if Om <= -8.6e+15: tmp = math.sqrt((t * (2.0 * (n * U)))) else: tmp = math.pow(((2.0 * U) * (n * t)), 0.5) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (Om <= -8.6e+15) tmp = sqrt(Float64(t * Float64(2.0 * Float64(n * U)))); else tmp = Float64(Float64(2.0 * U) * Float64(n * t)) ^ 0.5; end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (Om <= -8.6e+15) tmp = sqrt((t * (2.0 * (n * U)))); else tmp = ((2.0 * U) * (n * t)) ^ 0.5; end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[Om, -8.6e+15], N[Sqrt[N[(t * N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Power[N[(N[(2.0 * U), $MachinePrecision] * N[(n * t), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;Om \leq -8.6 \cdot 10^{+15}:\\
\;\;\;\;\sqrt{t \cdot \left(2 \cdot \left(n \cdot U\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;{\left(\left(2 \cdot U\right) \cdot \left(n \cdot t\right)\right)}^{0.5}\\
\end{array}
\end{array}
if Om < -8.6e15Initial program 64.2%
Simplified68.1%
Taylor expanded in U* around inf 43.9%
mul-1-neg43.9%
associate-/l*46.5%
distribute-rgt-neg-in46.5%
distribute-neg-frac246.5%
*-commutative46.5%
Simplified46.5%
*-un-lft-identity46.5%
associate-*r*50.4%
associate-*l*50.4%
associate-/l*50.4%
Applied egg-rr50.4%
*-lft-identity50.4%
distribute-frac-neg250.4%
unpow250.4%
unpow250.4%
times-frac52.7%
unpow252.7%
Simplified52.7%
Taylor expanded in n around 0 40.5%
associate-*r*40.5%
associate-*r*48.6%
associate-*r*48.6%
*-commutative48.6%
Simplified48.6%
if -8.6e15 < Om Initial program 47.5%
Simplified46.8%
Taylor expanded in t around inf 35.1%
pow1/237.4%
associate-*r*37.4%
Applied egg-rr37.4%
Final simplification40.7%
(FPCore (n U t l Om U*) :precision binary64 (if (<= Om -7e+15) (pow (* (* n U) (* 2.0 t)) 0.5) (pow (* (* 2.0 U) (* n t)) 0.5)))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (Om <= -7e+15) {
tmp = pow(((n * U) * (2.0 * t)), 0.5);
} else {
tmp = pow(((2.0 * U) * (n * t)), 0.5);
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (om <= (-7d+15)) then
tmp = ((n * u) * (2.0d0 * t)) ** 0.5d0
else
tmp = ((2.0d0 * u) * (n * t)) ** 0.5d0
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (Om <= -7e+15) {
tmp = Math.pow(((n * U) * (2.0 * t)), 0.5);
} else {
tmp = Math.pow(((2.0 * U) * (n * t)), 0.5);
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if Om <= -7e+15: tmp = math.pow(((n * U) * (2.0 * t)), 0.5) else: tmp = math.pow(((2.0 * U) * (n * t)), 0.5) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (Om <= -7e+15) tmp = Float64(Float64(n * U) * Float64(2.0 * t)) ^ 0.5; else tmp = Float64(Float64(2.0 * U) * Float64(n * t)) ^ 0.5; end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (Om <= -7e+15) tmp = ((n * U) * (2.0 * t)) ^ 0.5; else tmp = ((2.0 * U) * (n * t)) ^ 0.5; end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[Om, -7e+15], N[Power[N[(N[(n * U), $MachinePrecision] * N[(2.0 * t), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[Power[N[(N[(2.0 * U), $MachinePrecision] * N[(n * t), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;Om \leq -7 \cdot 10^{+15}:\\
\;\;\;\;{\left(\left(n \cdot U\right) \cdot \left(2 \cdot t\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;{\left(\left(2 \cdot U\right) \cdot \left(n \cdot t\right)\right)}^{0.5}\\
\end{array}
\end{array}
if Om < -7e15Initial program 64.2%
Simplified68.1%
Taylor expanded in U* around inf 43.9%
mul-1-neg43.9%
associate-/l*46.5%
distribute-rgt-neg-in46.5%
distribute-neg-frac246.5%
*-commutative46.5%
Simplified46.5%
*-un-lft-identity46.5%
associate-*r*50.4%
associate-*l*50.4%
associate-/l*50.4%
Applied egg-rr50.4%
*-lft-identity50.4%
distribute-frac-neg250.4%
unpow250.4%
unpow250.4%
times-frac52.7%
unpow252.7%
Simplified52.7%
Taylor expanded in n around 0 40.5%
associate-*r*40.5%
associate-*r*48.6%
associate-*r*48.6%
*-commutative48.6%
Simplified48.6%
pow1/248.7%
associate-*r*48.7%
Applied egg-rr48.7%
if -7e15 < Om Initial program 47.5%
Simplified46.8%
Taylor expanded in t around inf 35.1%
pow1/237.4%
associate-*r*37.4%
Applied egg-rr37.4%
Final simplification40.8%
(FPCore (n U t l Om U*) :precision binary64 (if (<= Om -9e+15) (sqrt (* t (* 2.0 (* n U)))) (sqrt (* 2.0 (* U (* n t))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (Om <= -9e+15) {
tmp = sqrt((t * (2.0 * (n * U))));
} 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 (om <= (-9d+15)) then
tmp = sqrt((t * (2.0d0 * (n * u))))
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 (Om <= -9e+15) {
tmp = Math.sqrt((t * (2.0 * (n * U))));
} else {
tmp = Math.sqrt((2.0 * (U * (n * t))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if Om <= -9e+15: tmp = math.sqrt((t * (2.0 * (n * U)))) else: tmp = math.sqrt((2.0 * (U * (n * t)))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (Om <= -9e+15) tmp = sqrt(Float64(t * Float64(2.0 * Float64(n * U)))); 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 (Om <= -9e+15) tmp = sqrt((t * (2.0 * (n * U)))); else tmp = sqrt((2.0 * (U * (n * t)))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[Om, -9e+15], N[Sqrt[N[(t * N[(2.0 * N[(n * U), $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}\;Om \leq -9 \cdot 10^{+15}:\\
\;\;\;\;\sqrt{t \cdot \left(2 \cdot \left(n \cdot U\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}\\
\end{array}
\end{array}
if Om < -9e15Initial program 64.2%
Simplified68.1%
Taylor expanded in U* around inf 43.9%
mul-1-neg43.9%
associate-/l*46.5%
distribute-rgt-neg-in46.5%
distribute-neg-frac246.5%
*-commutative46.5%
Simplified46.5%
*-un-lft-identity46.5%
associate-*r*50.4%
associate-*l*50.4%
associate-/l*50.4%
Applied egg-rr50.4%
*-lft-identity50.4%
distribute-frac-neg250.4%
unpow250.4%
unpow250.4%
times-frac52.7%
unpow252.7%
Simplified52.7%
Taylor expanded in n around 0 40.5%
associate-*r*40.5%
associate-*r*48.6%
associate-*r*48.6%
*-commutative48.6%
Simplified48.6%
if -9e15 < Om Initial program 47.5%
Simplified46.8%
Taylor expanded in t around inf 35.1%
Final simplification39.1%
(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 52.4%
Simplified53.1%
Taylor expanded in t around inf 36.7%
Final simplification36.7%
herbie shell --seed 2024131
(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*))))))