
(FPCore (n U t l Om U*) :precision binary64 (sqrt (* (* (* 2.0 n) U) (- (- t (* 2.0 (/ (* l l) Om))) (* (* n (pow (/ l Om) 2.0)) (- U U*))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * pow((l / Om), 2.0)) * (U - U_42_)))));
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
code = sqrt((((2.0d0 * n) * u) * ((t - (2.0d0 * ((l * l) / om))) - ((n * ((l / om) ** 2.0d0)) * (u - u_42)))))
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * Math.pow((l / Om), 2.0)) * (U - U_42_)))));
}
def code(n, U, t, l, Om, U_42_): return math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * math.pow((l / Om), 2.0)) * (U - U_42_)))))
function code(n, U, t, l, Om, U_42_) return sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) - Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U - U_42_))))) end
function tmp = code(n, U, t, l, Om, U_42_) tmp = sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * ((l / Om) ^ 2.0)) * (U - U_42_))))); end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 16 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (n U t l Om U*) :precision binary64 (sqrt (* (* (* 2.0 n) U) (- (- t (* 2.0 (/ (* l l) Om))) (* (* n (pow (/ l Om) 2.0)) (- U U*))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * pow((l / Om), 2.0)) * (U - U_42_)))));
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
code = sqrt((((2.0d0 * n) * u) * ((t - (2.0d0 * ((l * l) / om))) - ((n * ((l / om) ** 2.0d0)) * (u - u_42)))))
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * Math.pow((l / Om), 2.0)) * (U - U_42_)))));
}
def code(n, U, t, l, Om, U_42_): return math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * math.pow((l / Om), 2.0)) * (U - U_42_)))))
function code(n, U, t, l, Om, U_42_) return sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) - Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U - U_42_))))) end
function tmp = code(n, U, t, l, Om, U_42_) tmp = sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * ((l / Om) ^ 2.0)) * (U - U_42_))))); end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)}
\end{array}
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* l (/ l Om)))
(t_2 (pow (/ l Om) 2.0))
(t_3 (* (* n t_2) (- U* U)))
(t_4 (sqrt (* (* (* 2.0 n) U) (+ (- t (* 2.0 (/ (* l l) Om))) t_3))))
(t_5 (* t_2 (* n U))))
(if (<= t_4 2e-155)
(*
(* (sqrt (fabs (* 2.0 U))) (sqrt (fabs n)))
(sqrt (fabs (- t (fma 2.0 (/ (pow l 2.0) Om) t_5)))))
(if (<= t_4 5e+141)
(sqrt (* (* 2.0 (* n U)) (+ t (- t_3 (* 2.0 t_1)))))
(*
(sqrt (fabs (* n (* 2.0 U))))
(sqrt (fabs (- t (fma 2.0 t_1 t_5)))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = l * (l / Om);
double t_2 = pow((l / Om), 2.0);
double t_3 = (n * t_2) * (U_42_ - U);
double t_4 = sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) + t_3)));
double t_5 = t_2 * (n * U);
double tmp;
if (t_4 <= 2e-155) {
tmp = (sqrt(fabs((2.0 * U))) * sqrt(fabs(n))) * sqrt(fabs((t - fma(2.0, (pow(l, 2.0) / Om), t_5))));
} else if (t_4 <= 5e+141) {
tmp = sqrt(((2.0 * (n * U)) * (t + (t_3 - (2.0 * t_1)))));
} else {
tmp = sqrt(fabs((n * (2.0 * U)))) * sqrt(fabs((t - fma(2.0, t_1, t_5))));
}
return tmp;
}
function code(n, U, t, l, Om, U_42_) t_1 = Float64(l * Float64(l / Om)) t_2 = Float64(l / Om) ^ 2.0 t_3 = Float64(Float64(n * 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))) t_5 = Float64(t_2 * Float64(n * U)) tmp = 0.0 if (t_4 <= 2e-155) tmp = Float64(Float64(sqrt(abs(Float64(2.0 * U))) * sqrt(abs(n))) * sqrt(abs(Float64(t - fma(2.0, Float64((l ^ 2.0) / Om), t_5))))); elseif (t_4 <= 5e+141) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t + Float64(t_3 - Float64(2.0 * t_1))))); else tmp = Float64(sqrt(abs(Float64(n * Float64(2.0 * U)))) * sqrt(abs(Float64(t - fma(2.0, t_1, t_5))))); 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[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]}, Block[{t$95$3 = N[(N[(n * t$95$2), $MachinePrecision] * 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]}, Block[{t$95$5 = N[(t$95$2 * N[(n * U), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$4, 2e-155], N[(N[(N[Sqrt[N[Abs[N[(2.0 * U), $MachinePrecision]], $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[Abs[n], $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[Abs[N[(t - N[(2.0 * N[(N[Power[l, 2.0], $MachinePrecision] / Om), $MachinePrecision] + t$95$5), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, 5e+141], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(t$95$3 - N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[Abs[N[(n * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[Abs[N[(t - N[(2.0 * t$95$1 + t$95$5), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \ell \cdot \frac{\ell}{Om}\\
t_2 := {\left(\frac{\ell}{Om}\right)}^{2}\\
t_3 := \left(n \cdot t\_2\right) \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)}\\
t_5 := t\_2 \cdot \left(n \cdot U\right)\\
\mathbf{if}\;t\_4 \leq 2 \cdot 10^{-155}:\\
\;\;\;\;\left(\sqrt{\left|2 \cdot U\right|} \cdot \sqrt{\left|n\right|}\right) \cdot \sqrt{\left|t - \mathsf{fma}\left(2, \frac{{\ell}^{2}}{Om}, t\_5\right)\right|}\\
\mathbf{elif}\;t\_4 \leq 5 \cdot 10^{+141}:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t + \left(t\_3 - 2 \cdot t\_1\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left|n \cdot \left(2 \cdot U\right)\right|} \cdot \sqrt{\left|t - \mathsf{fma}\left(2, t\_1, t\_5\right)\right|}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 2.00000000000000003e-155Initial program 16.7%
Simplified26.5%
Taylor expanded in U around inf 26.4%
associate-/l*26.4%
unpow226.4%
unpow226.4%
times-frac26.6%
unpow226.6%
Simplified26.6%
add-sqr-sqrt26.6%
pow1/226.6%
pow1/226.6%
pow-prod-down16.5%
Applied egg-rr9.9%
unpow1/29.9%
unpow29.9%
rem-sqrt-square16.7%
associate-*l*16.7%
*-commutative16.7%
Simplified16.7%
pow1/216.7%
fabs-mul16.7%
unpow-prod-down53.2%
associate-*r*53.5%
associate-*r*53.5%
Applied egg-rr53.5%
unpow1/253.5%
associate-*l*53.2%
*-commutative53.2%
associate-*r*53.5%
*-commutative53.5%
unpow1/253.5%
*-commutative53.5%
Simplified53.5%
pow1/253.5%
fabs-mul53.5%
unpow-prod-down97.5%
Applied egg-rr97.5%
unpow1/297.5%
*-commutative97.5%
unpow1/297.5%
Simplified97.5%
if 2.00000000000000003e-155 < (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*))))) < 5.00000000000000025e141Initial program 96.1%
Simplified96.1%
if 5.00000000000000025e141 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) Initial program 23.2%
Simplified32.6%
Taylor expanded in U around inf 7.2%
associate-/l*7.3%
unpow27.3%
unpow27.3%
times-frac16.1%
unpow216.1%
Simplified16.1%
add-sqr-sqrt16.1%
pow1/216.1%
pow1/235.8%
pow-prod-down31.1%
Applied egg-rr24.7%
unpow1/224.7%
unpow224.7%
rem-sqrt-square26.2%
associate-*l*26.2%
*-commutative26.2%
Simplified26.2%
pow1/226.2%
fabs-mul26.2%
unpow-prod-down36.7%
associate-*r*36.7%
associate-*r*35.8%
Applied egg-rr35.8%
unpow1/235.8%
associate-*l*35.8%
*-commutative35.8%
associate-*r*35.8%
*-commutative35.8%
unpow1/235.8%
*-commutative35.8%
Simplified35.8%
unpow235.8%
associate-*l/46.5%
Applied egg-rr46.5%
Final simplification71.9%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* l (/ l Om)))
(t_2 (* (* n (pow (/ l Om) 2.0)) (- U* U)))
(t_3 (* (* 2.0 n) U))
(t_4 (sqrt (* t_3 (+ (- t (* 2.0 (/ (* l l) Om))) t_2)))))
(if (<= t_4 5e-158)
(* (sqrt (* U (+ t (* t_1 -2.0)))) (sqrt (* 2.0 n)))
(if (<= t_4 INFINITY)
(sqrt (* t_3 (+ (- t (* 2.0 t_1)) t_2)))
(sqrt (fabs (* 2.0 (* n (* U (+ t (* (/ (pow l 2.0) Om) -2.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)) * (U_42_ - U);
double t_3 = (2.0 * n) * U;
double t_4 = sqrt((t_3 * ((t - (2.0 * ((l * l) / Om))) + t_2)));
double tmp;
if (t_4 <= 5e-158) {
tmp = sqrt((U * (t + (t_1 * -2.0)))) * sqrt((2.0 * n));
} else if (t_4 <= ((double) INFINITY)) {
tmp = sqrt((t_3 * ((t - (2.0 * t_1)) + t_2)));
} else {
tmp = sqrt(fabs((2.0 * (n * (U * (t + ((pow(l, 2.0) / Om) * -2.0)))))));
}
return tmp;
}
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = l * (l / Om);
double t_2 = (n * Math.pow((l / Om), 2.0)) * (U_42_ - U);
double t_3 = (2.0 * n) * U;
double t_4 = Math.sqrt((t_3 * ((t - (2.0 * ((l * l) / Om))) + t_2)));
double tmp;
if (t_4 <= 5e-158) {
tmp = Math.sqrt((U * (t + (t_1 * -2.0)))) * Math.sqrt((2.0 * n));
} else if (t_4 <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt((t_3 * ((t - (2.0 * t_1)) + t_2)));
} else {
tmp = Math.sqrt(Math.abs((2.0 * (n * (U * (t + ((Math.pow(l, 2.0) / Om) * -2.0)))))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = l * (l / Om) t_2 = (n * math.pow((l / Om), 2.0)) * (U_42_ - U) t_3 = (2.0 * n) * U t_4 = math.sqrt((t_3 * ((t - (2.0 * ((l * l) / Om))) + t_2))) tmp = 0 if t_4 <= 5e-158: tmp = math.sqrt((U * (t + (t_1 * -2.0)))) * math.sqrt((2.0 * n)) elif t_4 <= math.inf: tmp = math.sqrt((t_3 * ((t - (2.0 * t_1)) + t_2))) else: tmp = math.sqrt(math.fabs((2.0 * (n * (U * (t + ((math.pow(l, 2.0) / Om) * -2.0))))))) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(l * Float64(l / Om)) t_2 = Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U_42_ - U)) t_3 = Float64(Float64(2.0 * n) * U) t_4 = sqrt(Float64(t_3 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) + t_2))) tmp = 0.0 if (t_4 <= 5e-158) tmp = Float64(sqrt(Float64(U * Float64(t + Float64(t_1 * -2.0)))) * sqrt(Float64(2.0 * n))); elseif (t_4 <= Inf) tmp = sqrt(Float64(t_3 * Float64(Float64(t - Float64(2.0 * t_1)) + t_2))); else tmp = sqrt(abs(Float64(2.0 * Float64(n * Float64(U * Float64(t + Float64(Float64((l ^ 2.0) / Om) * -2.0))))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = l * (l / Om); t_2 = (n * ((l / Om) ^ 2.0)) * (U_42_ - U); t_3 = (2.0 * n) * U; t_4 = sqrt((t_3 * ((t - (2.0 * ((l * l) / Om))) + t_2))); tmp = 0.0; if (t_4 <= 5e-158) tmp = sqrt((U * (t + (t_1 * -2.0)))) * sqrt((2.0 * n)); elseif (t_4 <= Inf) tmp = sqrt((t_3 * ((t - (2.0 * t_1)) + t_2))); else tmp = sqrt(abs((2.0 * (n * (U * (t + (((l ^ 2.0) / Om) * -2.0))))))); end tmp_2 = 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 * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision]}, Block[{t$95$4 = N[Sqrt[N[(t$95$3 * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$4, 5e-158], N[(N[Sqrt[N[(U * N[(t + N[(t$95$1 * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[Sqrt[N[(t$95$3 * N[(N[(t - N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision] + t$95$2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[Abs[N[(2.0 * N[(n * N[(U * N[(t + N[(N[(N[Power[l, 2.0], $MachinePrecision] / Om), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \ell \cdot \frac{\ell}{Om}\\
t_2 := \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\\
t_3 := \left(2 \cdot n\right) \cdot U\\
t_4 := \sqrt{t\_3 \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) + t\_2\right)}\\
\mathbf{if}\;t\_4 \leq 5 \cdot 10^{-158}:\\
\;\;\;\;\sqrt{U \cdot \left(t + t\_1 \cdot -2\right)} \cdot \sqrt{2 \cdot n}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\sqrt{t\_3 \cdot \left(\left(t - 2 \cdot t\_1\right) + t\_2\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left|2 \cdot \left(n \cdot \left(U \cdot \left(t + \frac{{\ell}^{2}}{Om} \cdot -2\right)\right)\right)\right|}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 4.99999999999999972e-158Initial program 14.0%
Simplified24.2%
Taylor expanded in n around 0 24.3%
pow1/224.3%
*-commutative24.3%
unpow-prod-down41.8%
pow1/241.8%
cancel-sign-sub-inv41.8%
metadata-eval41.8%
pow1/241.8%
Applied egg-rr41.8%
unpow251.8%
associate-*l/51.8%
Applied egg-rr41.8%
if 4.99999999999999972e-158 < (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 67.7%
associate-*r/73.1%
*-commutative73.1%
Applied egg-rr73.1%
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%
Simplified8.2%
Taylor expanded in n around 0 4.3%
add-sqr-sqrt4.3%
pow1/24.3%
pow1/240.1%
pow-prod-down40.4%
pow240.4%
associate-*l*40.4%
cancel-sign-sub-inv40.4%
metadata-eval40.4%
Applied egg-rr40.4%
unpow1/240.4%
unpow240.4%
rem-sqrt-square40.4%
Simplified40.4%
Final simplification64.5%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* l (/ l Om)))
(t_2 (* (* n (pow (/ l Om) 2.0)) (- U* U)))
(t_3 (* (* 2.0 n) U))
(t_4 (sqrt (* t_3 (+ (- t (* 2.0 (/ (* l l) Om))) t_2)))))
(if (<= t_4 5e-158)
(* (sqrt (* U (+ t (* t_1 -2.0)))) (sqrt (* 2.0 n)))
(if (<= t_4 INFINITY)
(sqrt (* t_3 (+ (- t (* 2.0 t_1)) t_2)))
(pow (* 2.0 (* n (* U (+ t (* (/ (pow l 2.0) Om) -2.0))))) 0.5)))))
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)) * (U_42_ - U);
double t_3 = (2.0 * n) * U;
double t_4 = sqrt((t_3 * ((t - (2.0 * ((l * l) / Om))) + t_2)));
double tmp;
if (t_4 <= 5e-158) {
tmp = sqrt((U * (t + (t_1 * -2.0)))) * sqrt((2.0 * n));
} else if (t_4 <= ((double) INFINITY)) {
tmp = sqrt((t_3 * ((t - (2.0 * t_1)) + t_2)));
} else {
tmp = pow((2.0 * (n * (U * (t + ((pow(l, 2.0) / Om) * -2.0))))), 0.5);
}
return tmp;
}
public static 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 * Math.pow((l / Om), 2.0)) * (U_42_ - U);
double t_3 = (2.0 * n) * U;
double t_4 = Math.sqrt((t_3 * ((t - (2.0 * ((l * l) / Om))) + t_2)));
double tmp;
if (t_4 <= 5e-158) {
tmp = Math.sqrt((U * (t + (t_1 * -2.0)))) * Math.sqrt((2.0 * n));
} else if (t_4 <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt((t_3 * ((t - (2.0 * t_1)) + t_2)));
} else {
tmp = Math.pow((2.0 * (n * (U * (t + ((Math.pow(l, 2.0) / Om) * -2.0))))), 0.5);
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = l * (l / Om) t_2 = (n * math.pow((l / Om), 2.0)) * (U_42_ - U) t_3 = (2.0 * n) * U t_4 = math.sqrt((t_3 * ((t - (2.0 * ((l * l) / Om))) + t_2))) tmp = 0 if t_4 <= 5e-158: tmp = math.sqrt((U * (t + (t_1 * -2.0)))) * math.sqrt((2.0 * n)) elif t_4 <= math.inf: tmp = math.sqrt((t_3 * ((t - (2.0 * t_1)) + t_2))) else: tmp = math.pow((2.0 * (n * (U * (t + ((math.pow(l, 2.0) / Om) * -2.0))))), 0.5) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(l * Float64(l / Om)) t_2 = Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U_42_ - U)) t_3 = Float64(Float64(2.0 * n) * U) t_4 = sqrt(Float64(t_3 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) + t_2))) tmp = 0.0 if (t_4 <= 5e-158) tmp = Float64(sqrt(Float64(U * Float64(t + Float64(t_1 * -2.0)))) * sqrt(Float64(2.0 * n))); elseif (t_4 <= Inf) tmp = sqrt(Float64(t_3 * Float64(Float64(t - Float64(2.0 * t_1)) + t_2))); else tmp = Float64(2.0 * Float64(n * Float64(U * Float64(t + Float64(Float64((l ^ 2.0) / Om) * -2.0))))) ^ 0.5; end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = l * (l / Om); t_2 = (n * ((l / Om) ^ 2.0)) * (U_42_ - U); t_3 = (2.0 * n) * U; t_4 = sqrt((t_3 * ((t - (2.0 * ((l * l) / Om))) + t_2))); tmp = 0.0; if (t_4 <= 5e-158) tmp = sqrt((U * (t + (t_1 * -2.0)))) * sqrt((2.0 * n)); elseif (t_4 <= Inf) tmp = sqrt((t_3 * ((t - (2.0 * t_1)) + t_2))); else tmp = (2.0 * (n * (U * (t + (((l ^ 2.0) / Om) * -2.0))))) ^ 0.5; end tmp_2 = 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 * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision]}, Block[{t$95$4 = N[Sqrt[N[(t$95$3 * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$4, 5e-158], N[(N[Sqrt[N[(U * N[(t + N[(t$95$1 * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[Sqrt[N[(t$95$3 * N[(N[(t - N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision] + t$95$2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Power[N[(2.0 * N[(n * N[(U * N[(t + N[(N[(N[Power[l, 2.0], $MachinePrecision] / Om), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \ell \cdot \frac{\ell}{Om}\\
t_2 := \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\\
t_3 := \left(2 \cdot n\right) \cdot U\\
t_4 := \sqrt{t\_3 \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) + t\_2\right)}\\
\mathbf{if}\;t\_4 \leq 5 \cdot 10^{-158}:\\
\;\;\;\;\sqrt{U \cdot \left(t + t\_1 \cdot -2\right)} \cdot \sqrt{2 \cdot n}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\sqrt{t\_3 \cdot \left(\left(t - 2 \cdot t\_1\right) + t\_2\right)}\\
\mathbf{else}:\\
\;\;\;\;{\left(2 \cdot \left(n \cdot \left(U \cdot \left(t + \frac{{\ell}^{2}}{Om} \cdot -2\right)\right)\right)\right)}^{0.5}\\
\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*))))) < 4.99999999999999972e-158Initial program 14.0%
Simplified24.2%
Taylor expanded in n around 0 24.3%
pow1/224.3%
*-commutative24.3%
unpow-prod-down41.8%
pow1/241.8%
cancel-sign-sub-inv41.8%
metadata-eval41.8%
pow1/241.8%
Applied egg-rr41.8%
unpow251.8%
associate-*l/51.8%
Applied egg-rr41.8%
if 4.99999999999999972e-158 < (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 67.7%
associate-*r/73.1%
*-commutative73.1%
Applied egg-rr73.1%
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%
Simplified8.2%
Taylor expanded in n around 0 4.3%
pow1/240.1%
associate-*l*40.1%
cancel-sign-sub-inv40.1%
metadata-eval40.1%
Applied egg-rr40.1%
Final simplification64.5%
(FPCore (n U t l Om U*)
:precision binary64
(if (or (<= Om -2.6e+46) (not (<= Om 0.00094)))
(*
(sqrt (fabs (* n (* 2.0 U))))
(sqrt
(fabs (- t (fma 2.0 (* l (/ l Om)) (* (pow (/ l Om) 2.0) (* n U)))))))
(sqrt
(*
(* 2.0 (* n U))
(- t (/ (* (pow l 2.0) (+ 2.0 (/ (* n (- U U*)) Om))) Om))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if ((Om <= -2.6e+46) || !(Om <= 0.00094)) {
tmp = sqrt(fabs((n * (2.0 * U)))) * sqrt(fabs((t - fma(2.0, (l * (l / Om)), (pow((l / Om), 2.0) * (n * U))))));
} else {
tmp = sqrt(((2.0 * (n * U)) * (t - ((pow(l, 2.0) * (2.0 + ((n * (U - U_42_)) / Om))) / Om))));
}
return tmp;
}
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if ((Om <= -2.6e+46) || !(Om <= 0.00094)) tmp = Float64(sqrt(abs(Float64(n * Float64(2.0 * U)))) * sqrt(abs(Float64(t - fma(2.0, Float64(l * Float64(l / Om)), Float64((Float64(l / Om) ^ 2.0) * Float64(n * U))))))); else tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t - Float64(Float64((l ^ 2.0) * Float64(2.0 + Float64(Float64(n * Float64(U - U_42_)) / Om))) / Om)))); end return tmp end
code[n_, U_, t_, l_, Om_, U$42$_] := If[Or[LessEqual[Om, -2.6e+46], N[Not[LessEqual[Om, 0.00094]], $MachinePrecision]], N[(N[Sqrt[N[Abs[N[(n * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[Abs[N[(t - N[(2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision] + N[(N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision] * N[(n * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t - N[(N[(N[Power[l, 2.0], $MachinePrecision] * N[(2.0 + N[(N[(n * N[(U - U$42$), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;Om \leq -2.6 \cdot 10^{+46} \lor \neg \left(Om \leq 0.00094\right):\\
\;\;\;\;\sqrt{\left|n \cdot \left(2 \cdot U\right)\right|} \cdot \sqrt{\left|t - \mathsf{fma}\left(2, \ell \cdot \frac{\ell}{Om}, {\left(\frac{\ell}{Om}\right)}^{2} \cdot \left(n \cdot U\right)\right)\right|}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t - \frac{{\ell}^{2} \cdot \left(2 + \frac{n \cdot \left(U - U*\right)}{Om}\right)}{Om}\right)}\\
\end{array}
\end{array}
if Om < -2.60000000000000013e46 or 9.39999999999999972e-4 < Om Initial program 48.9%
Simplified51.4%
Taylor expanded in U around inf 42.2%
associate-/l*43.8%
unpow243.8%
unpow243.8%
times-frac51.5%
unpow251.5%
Simplified51.5%
add-sqr-sqrt51.5%
pow1/251.5%
pow1/252.3%
pow-prod-down36.2%
Applied egg-rr30.1%
unpow1/230.1%
unpow230.1%
rem-sqrt-square49.5%
associate-*l*49.5%
*-commutative49.5%
Simplified49.5%
pow1/249.5%
fabs-mul49.5%
unpow-prod-down63.3%
associate-*r*63.4%
associate-*r*62.5%
Applied egg-rr62.5%
unpow1/262.5%
associate-*l*62.5%
*-commutative62.5%
associate-*r*62.5%
*-commutative62.5%
unpow1/262.5%
*-commutative62.5%
Simplified62.5%
unpow262.5%
associate-*l/72.0%
Applied egg-rr72.0%
if -2.60000000000000013e46 < Om < 9.39999999999999972e-4Initial program 54.2%
Simplified54.2%
Taylor expanded in Om around inf 59.5%
Taylor expanded in l around 0 66.7%
Final simplification69.7%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* l (/ l Om)))
(t_2 (* (* n (pow (/ l Om) 2.0)) (- U* U)))
(t_3 (* (* 2.0 n) U))
(t_4 (* t_3 (+ (- t (* 2.0 (/ (* l l) Om))) t_2))))
(if (<= t_4 1e-315)
(* (sqrt (* U (+ t (* t_1 -2.0)))) (sqrt (* 2.0 n)))
(if (<= t_4 INFINITY)
(sqrt (* t_3 (+ (- t (* 2.0 t_1)) t_2)))
(sqrt
(*
-2.0
(*
(* U (pow l 2.0))
(* n (+ (/ 2.0 Om) (* n (/ (- U U*) (pow Om 2.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)) * (U_42_ - U);
double t_3 = (2.0 * n) * U;
double t_4 = t_3 * ((t - (2.0 * ((l * l) / Om))) + t_2);
double tmp;
if (t_4 <= 1e-315) {
tmp = sqrt((U * (t + (t_1 * -2.0)))) * sqrt((2.0 * n));
} else if (t_4 <= ((double) INFINITY)) {
tmp = sqrt((t_3 * ((t - (2.0 * t_1)) + t_2)));
} else {
tmp = sqrt((-2.0 * ((U * pow(l, 2.0)) * (n * ((2.0 / Om) + (n * ((U - U_42_) / pow(Om, 2.0))))))));
}
return tmp;
}
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = l * (l / Om);
double t_2 = (n * Math.pow((l / Om), 2.0)) * (U_42_ - U);
double t_3 = (2.0 * n) * U;
double t_4 = t_3 * ((t - (2.0 * ((l * l) / Om))) + t_2);
double tmp;
if (t_4 <= 1e-315) {
tmp = Math.sqrt((U * (t + (t_1 * -2.0)))) * Math.sqrt((2.0 * n));
} else if (t_4 <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt((t_3 * ((t - (2.0 * t_1)) + t_2)));
} else {
tmp = Math.sqrt((-2.0 * ((U * Math.pow(l, 2.0)) * (n * ((2.0 / Om) + (n * ((U - U_42_) / Math.pow(Om, 2.0))))))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = l * (l / Om) t_2 = (n * math.pow((l / Om), 2.0)) * (U_42_ - U) t_3 = (2.0 * n) * U t_4 = t_3 * ((t - (2.0 * ((l * l) / Om))) + t_2) tmp = 0 if t_4 <= 1e-315: tmp = math.sqrt((U * (t + (t_1 * -2.0)))) * math.sqrt((2.0 * n)) elif t_4 <= math.inf: tmp = math.sqrt((t_3 * ((t - (2.0 * t_1)) + t_2))) else: tmp = math.sqrt((-2.0 * ((U * math.pow(l, 2.0)) * (n * ((2.0 / Om) + (n * ((U - U_42_) / math.pow(Om, 2.0)))))))) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(l * Float64(l / Om)) t_2 = Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U_42_ - U)) t_3 = Float64(Float64(2.0 * n) * U) t_4 = Float64(t_3 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) + t_2)) tmp = 0.0 if (t_4 <= 1e-315) tmp = Float64(sqrt(Float64(U * Float64(t + Float64(t_1 * -2.0)))) * sqrt(Float64(2.0 * n))); elseif (t_4 <= Inf) tmp = sqrt(Float64(t_3 * Float64(Float64(t - Float64(2.0 * t_1)) + t_2))); else tmp = sqrt(Float64(-2.0 * Float64(Float64(U * (l ^ 2.0)) * Float64(n * Float64(Float64(2.0 / Om) + Float64(n * Float64(Float64(U - U_42_) / (Om ^ 2.0)))))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = l * (l / Om); t_2 = (n * ((l / Om) ^ 2.0)) * (U_42_ - U); t_3 = (2.0 * n) * U; t_4 = t_3 * ((t - (2.0 * ((l * l) / Om))) + t_2); tmp = 0.0; if (t_4 <= 1e-315) tmp = sqrt((U * (t + (t_1 * -2.0)))) * sqrt((2.0 * n)); elseif (t_4 <= Inf) tmp = sqrt((t_3 * ((t - (2.0 * t_1)) + t_2))); else tmp = sqrt((-2.0 * ((U * (l ^ 2.0)) * (n * ((2.0 / Om) + (n * ((U - U_42_) / (Om ^ 2.0)))))))); end tmp_2 = 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 * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision]}, Block[{t$95$4 = N[(t$95$3 * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$2), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$4, 1e-315], N[(N[Sqrt[N[(U * N[(t + N[(t$95$1 * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[Sqrt[N[(t$95$3 * N[(N[(t - N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision] + t$95$2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(-2.0 * N[(N[(U * N[Power[l, 2.0], $MachinePrecision]), $MachinePrecision] * N[(n * N[(N[(2.0 / Om), $MachinePrecision] + N[(n * N[(N[(U - U$42$), $MachinePrecision] / N[Power[Om, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \ell \cdot \frac{\ell}{Om}\\
t_2 := \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\\
t_3 := \left(2 \cdot n\right) \cdot U\\
t_4 := t\_3 \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) + t\_2\right)\\
\mathbf{if}\;t\_4 \leq 10^{-315}:\\
\;\;\;\;\sqrt{U \cdot \left(t + t\_1 \cdot -2\right)} \cdot \sqrt{2 \cdot n}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\sqrt{t\_3 \cdot \left(\left(t - 2 \cdot t\_1\right) + t\_2\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{-2 \cdot \left(\left(U \cdot {\ell}^{2}\right) \cdot \left(n \cdot \left(\frac{2}{Om} + n \cdot \frac{U - U*}{{Om}^{2}}\right)\right)\right)}\\
\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*)))) < 9.999999985e-316Initial program 12.7%
Simplified22.0%
Taylor expanded in n around 0 25.1%
pow1/225.3%
*-commutative25.3%
unpow-prod-down38.0%
pow1/237.8%
cancel-sign-sub-inv37.8%
metadata-eval37.8%
pow1/237.8%
Applied egg-rr37.8%
unpow247.3%
associate-*l/50.2%
Applied egg-rr38.0%
if 9.999999985e-316 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < +inf.0Initial program 67.7%
associate-*r/73.1%
*-commutative73.1%
Applied egg-rr73.1%
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%
Simplified8.8%
Taylor expanded in l around inf 44.9%
associate-*r*44.9%
associate-*r/44.9%
metadata-eval44.9%
associate-/l*44.9%
Simplified44.9%
Final simplification64.7%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* l (/ l Om)))
(t_2
(sqrt
(* (* (* 2.0 n) U) (+ t (* (* n (pow (/ l Om) 2.0)) (- U* U)))))))
(if (<= n -6e-174)
t_2
(if (<= n -5.5e-308)
(sqrt (* (* 2.0 n) (* U (- t (* 2.0 t_1)))))
(if (<= n 2.35e+45)
(* (sqrt (* U (+ t (* t_1 -2.0)))) (sqrt (* 2.0 n)))
t_2)))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = l * (l / Om);
double t_2 = sqrt((((2.0 * n) * U) * (t + ((n * pow((l / Om), 2.0)) * (U_42_ - U)))));
double tmp;
if (n <= -6e-174) {
tmp = t_2;
} else if (n <= -5.5e-308) {
tmp = sqrt(((2.0 * n) * (U * (t - (2.0 * t_1)))));
} else if (n <= 2.35e+45) {
tmp = sqrt((U * (t + (t_1 * -2.0)))) * sqrt((2.0 * n));
} else {
tmp = t_2;
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = l * (l / om)
t_2 = sqrt((((2.0d0 * n) * u) * (t + ((n * ((l / om) ** 2.0d0)) * (u_42 - u)))))
if (n <= (-6d-174)) then
tmp = t_2
else if (n <= (-5.5d-308)) then
tmp = sqrt(((2.0d0 * n) * (u * (t - (2.0d0 * t_1)))))
else if (n <= 2.35d+45) then
tmp = sqrt((u * (t + (t_1 * (-2.0d0))))) * sqrt((2.0d0 * n))
else
tmp = t_2
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = l * (l / Om);
double t_2 = Math.sqrt((((2.0 * n) * U) * (t + ((n * Math.pow((l / Om), 2.0)) * (U_42_ - U)))));
double tmp;
if (n <= -6e-174) {
tmp = t_2;
} else if (n <= -5.5e-308) {
tmp = Math.sqrt(((2.0 * n) * (U * (t - (2.0 * t_1)))));
} else if (n <= 2.35e+45) {
tmp = Math.sqrt((U * (t + (t_1 * -2.0)))) * Math.sqrt((2.0 * n));
} else {
tmp = t_2;
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = l * (l / Om) t_2 = math.sqrt((((2.0 * n) * U) * (t + ((n * math.pow((l / Om), 2.0)) * (U_42_ - U))))) tmp = 0 if n <= -6e-174: tmp = t_2 elif n <= -5.5e-308: tmp = math.sqrt(((2.0 * n) * (U * (t - (2.0 * t_1))))) elif n <= 2.35e+45: tmp = math.sqrt((U * (t + (t_1 * -2.0)))) * math.sqrt((2.0 * n)) else: tmp = t_2 return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(l * Float64(l / Om)) t_2 = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(t + Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U_42_ - U))))) tmp = 0.0 if (n <= -6e-174) tmp = t_2; elseif (n <= -5.5e-308) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t - Float64(2.0 * t_1))))); elseif (n <= 2.35e+45) tmp = Float64(sqrt(Float64(U * Float64(t + Float64(t_1 * -2.0)))) * sqrt(Float64(2.0 * n))); else tmp = t_2; end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = l * (l / Om); t_2 = sqrt((((2.0 * n) * U) * (t + ((n * ((l / Om) ^ 2.0)) * (U_42_ - U))))); tmp = 0.0; if (n <= -6e-174) tmp = t_2; elseif (n <= -5.5e-308) tmp = sqrt(((2.0 * n) * (U * (t - (2.0 * t_1))))); elseif (n <= 2.35e+45) tmp = sqrt((U * (t + (t_1 * -2.0)))) * sqrt((2.0 * n)); else tmp = t_2; end tmp_2 = 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[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(t + N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[n, -6e-174], t$95$2, If[LessEqual[n, -5.5e-308], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t - N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[n, 2.35e+45], N[(N[Sqrt[N[(U * N[(t + N[(t$95$1 * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], t$95$2]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \ell \cdot \frac{\ell}{Om}\\
t_2 := \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t + \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\right)}\\
\mathbf{if}\;n \leq -6 \cdot 10^{-174}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;n \leq -5.5 \cdot 10^{-308}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t - 2 \cdot t\_1\right)\right)}\\
\mathbf{elif}\;n \leq 2.35 \cdot 10^{+45}:\\
\;\;\;\;\sqrt{U \cdot \left(t + t\_1 \cdot -2\right)} \cdot \sqrt{2 \cdot n}\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if n < -6.00000000000000042e-174 or 2.35000000000000001e45 < n Initial program 56.2%
add-sqr-sqrt25.7%
times-frac28.8%
Applied egg-rr28.8%
unpow228.8%
Simplified28.8%
Taylor expanded in t around inf 64.1%
if -6.00000000000000042e-174 < n < -5.5e-308Initial program 52.4%
Simplified52.1%
Taylor expanded in n around 0 45.5%
unpow256.2%
associate-*l/69.7%
Applied egg-rr60.4%
if -5.5e-308 < n < 2.35000000000000001e45Initial program 41.4%
Simplified39.4%
Taylor expanded in n around 0 38.5%
pow1/238.6%
*-commutative38.6%
unpow-prod-down48.3%
pow1/248.1%
cancel-sign-sub-inv48.1%
metadata-eval48.1%
pow1/248.1%
Applied egg-rr48.1%
unpow248.6%
associate-*l/51.1%
Applied egg-rr51.8%
Final simplification60.0%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* 2.0 (* n U))))
(if (<= t -4.2e-112)
(sqrt
(*
t_1
(+ t (- (* (* n (pow (/ l Om) 2.0)) (- U* U)) (* 2.0 (* l (/ l Om)))))))
(if (<= t 4.65e+148)
(sqrt
(* t_1 (- t (/ (* (pow l 2.0) (+ 2.0 (/ (* n (- U U*)) Om))) Om))))
(* (sqrt (* n (* 2.0 U))) (sqrt t))))))
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 (t <= -4.2e-112) {
tmp = sqrt((t_1 * (t + (((n * pow((l / Om), 2.0)) * (U_42_ - U)) - (2.0 * (l * (l / Om)))))));
} else if (t <= 4.65e+148) {
tmp = sqrt((t_1 * (t - ((pow(l, 2.0) * (2.0 + ((n * (U - U_42_)) / Om))) / Om))));
} else {
tmp = sqrt((n * (2.0 * U))) * sqrt(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) :: t_1
real(8) :: tmp
t_1 = 2.0d0 * (n * u)
if (t <= (-4.2d-112)) then
tmp = sqrt((t_1 * (t + (((n * ((l / om) ** 2.0d0)) * (u_42 - u)) - (2.0d0 * (l * (l / om)))))))
else if (t <= 4.65d+148) then
tmp = sqrt((t_1 * (t - (((l ** 2.0d0) * (2.0d0 + ((n * (u - u_42)) / om))) / om))))
else
tmp = sqrt((n * (2.0d0 * u))) * sqrt(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 t_1 = 2.0 * (n * U);
double tmp;
if (t <= -4.2e-112) {
tmp = Math.sqrt((t_1 * (t + (((n * Math.pow((l / Om), 2.0)) * (U_42_ - U)) - (2.0 * (l * (l / Om)))))));
} else if (t <= 4.65e+148) {
tmp = Math.sqrt((t_1 * (t - ((Math.pow(l, 2.0) * (2.0 + ((n * (U - U_42_)) / Om))) / Om))));
} else {
tmp = Math.sqrt((n * (2.0 * U))) * Math.sqrt(t);
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = 2.0 * (n * U) tmp = 0 if t <= -4.2e-112: tmp = math.sqrt((t_1 * (t + (((n * math.pow((l / Om), 2.0)) * (U_42_ - U)) - (2.0 * (l * (l / Om))))))) elif t <= 4.65e+148: tmp = math.sqrt((t_1 * (t - ((math.pow(l, 2.0) * (2.0 + ((n * (U - U_42_)) / Om))) / Om)))) else: tmp = math.sqrt((n * (2.0 * U))) * math.sqrt(t) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(2.0 * Float64(n * U)) tmp = 0.0 if (t <= -4.2e-112) tmp = sqrt(Float64(t_1 * Float64(t + Float64(Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U_42_ - U)) - Float64(2.0 * Float64(l * Float64(l / Om))))))); elseif (t <= 4.65e+148) tmp = sqrt(Float64(t_1 * Float64(t - Float64(Float64((l ^ 2.0) * Float64(2.0 + Float64(Float64(n * Float64(U - U_42_)) / Om))) / Om)))); else tmp = Float64(sqrt(Float64(n * Float64(2.0 * U))) * sqrt(t)); 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 (t <= -4.2e-112) tmp = sqrt((t_1 * (t + (((n * ((l / Om) ^ 2.0)) * (U_42_ - U)) - (2.0 * (l * (l / Om))))))); elseif (t <= 4.65e+148) tmp = sqrt((t_1 * (t - (((l ^ 2.0) * (2.0 + ((n * (U - U_42_)) / Om))) / Om)))); else tmp = sqrt((n * (2.0 * U))) * sqrt(t); 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]}, If[LessEqual[t, -4.2e-112], N[Sqrt[N[(t$95$1 * N[(t + N[(N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision] - N[(2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[t, 4.65e+148], N[Sqrt[N[(t$95$1 * N[(t - N[(N[(N[Power[l, 2.0], $MachinePrecision] * N[(2.0 + N[(N[(n * N[(U - U$42$), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(n * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := 2 \cdot \left(n \cdot U\right)\\
\mathbf{if}\;t \leq -4.2 \cdot 10^{-112}:\\
\;\;\;\;\sqrt{t\_1 \cdot \left(t + \left(\left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U* - U\right) - 2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right)\right)}\\
\mathbf{elif}\;t \leq 4.65 \cdot 10^{+148}:\\
\;\;\;\;\sqrt{t\_1 \cdot \left(t - \frac{{\ell}^{2} \cdot \left(2 + \frac{n \cdot \left(U - U*\right)}{Om}\right)}{Om}\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{n \cdot \left(2 \cdot U\right)} \cdot \sqrt{t}\\
\end{array}
\end{array}
if t < -4.2000000000000001e-112Initial program 55.8%
Simplified63.3%
if -4.2000000000000001e-112 < t < 4.64999999999999992e148Initial program 50.4%
Simplified52.5%
Taylor expanded in Om around inf 50.7%
Taylor expanded in l around 0 58.8%
if 4.64999999999999992e148 < t Initial program 43.1%
Simplified34.4%
Taylor expanded in t around inf 43.5%
associate-*r*43.3%
Simplified43.3%
pow1/246.5%
associate-*r*46.5%
*-commutative46.5%
unpow-prod-down72.2%
pow1/269.1%
associate-*r*69.2%
pow1/269.2%
Applied egg-rr69.2%
associate-*l*69.1%
*-commutative69.1%
associate-*r*69.2%
*-commutative69.2%
Simplified69.2%
Final simplification61.6%
(FPCore (n U t l Om U*)
:precision binary64
(if (<= t -700.0)
(sqrt (* (* (* 2.0 n) U) (+ t (* (* n (pow (/ l Om) 2.0)) (- U* U)))))
(if (<= t 5.8e+148)
(sqrt
(*
(* 2.0 (* n U))
(- t (/ (* (pow l 2.0) (+ 2.0 (/ (* n (- U U*)) Om))) Om))))
(* (sqrt (* n (* 2.0 U))) (sqrt t)))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (t <= -700.0) {
tmp = sqrt((((2.0 * n) * U) * (t + ((n * pow((l / Om), 2.0)) * (U_42_ - U)))));
} else if (t <= 5.8e+148) {
tmp = sqrt(((2.0 * (n * U)) * (t - ((pow(l, 2.0) * (2.0 + ((n * (U - U_42_)) / Om))) / Om))));
} else {
tmp = sqrt((n * (2.0 * U))) * sqrt(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 <= (-700.0d0)) then
tmp = sqrt((((2.0d0 * n) * u) * (t + ((n * ((l / om) ** 2.0d0)) * (u_42 - u)))))
else if (t <= 5.8d+148) then
tmp = sqrt(((2.0d0 * (n * u)) * (t - (((l ** 2.0d0) * (2.0d0 + ((n * (u - u_42)) / om))) / om))))
else
tmp = sqrt((n * (2.0d0 * u))) * sqrt(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 <= -700.0) {
tmp = Math.sqrt((((2.0 * n) * U) * (t + ((n * Math.pow((l / Om), 2.0)) * (U_42_ - U)))));
} else if (t <= 5.8e+148) {
tmp = Math.sqrt(((2.0 * (n * U)) * (t - ((Math.pow(l, 2.0) * (2.0 + ((n * (U - U_42_)) / Om))) / Om))));
} else {
tmp = Math.sqrt((n * (2.0 * U))) * Math.sqrt(t);
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if t <= -700.0: tmp = math.sqrt((((2.0 * n) * U) * (t + ((n * math.pow((l / Om), 2.0)) * (U_42_ - U))))) elif t <= 5.8e+148: tmp = math.sqrt(((2.0 * (n * U)) * (t - ((math.pow(l, 2.0) * (2.0 + ((n * (U - U_42_)) / Om))) / Om)))) else: tmp = math.sqrt((n * (2.0 * U))) * math.sqrt(t) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (t <= -700.0) tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(t + Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U_42_ - U))))); elseif (t <= 5.8e+148) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t - Float64(Float64((l ^ 2.0) * Float64(2.0 + Float64(Float64(n * Float64(U - U_42_)) / Om))) / Om)))); else tmp = Float64(sqrt(Float64(n * Float64(2.0 * U))) * sqrt(t)); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (t <= -700.0) tmp = sqrt((((2.0 * n) * U) * (t + ((n * ((l / Om) ^ 2.0)) * (U_42_ - U))))); elseif (t <= 5.8e+148) tmp = sqrt(((2.0 * (n * U)) * (t - (((l ^ 2.0) * (2.0 + ((n * (U - U_42_)) / Om))) / Om)))); else tmp = sqrt((n * (2.0 * U))) * sqrt(t); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[t, -700.0], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(t + N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[t, 5.8e+148], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t - N[(N[(N[Power[l, 2.0], $MachinePrecision] * N[(2.0 + N[(N[(n * N[(U - U$42$), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(n * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;t \leq -700:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t + \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\right)}\\
\mathbf{elif}\;t \leq 5.8 \cdot 10^{+148}:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t - \frac{{\ell}^{2} \cdot \left(2 + \frac{n \cdot \left(U - U*\right)}{Om}\right)}{Om}\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{n \cdot \left(2 \cdot U\right)} \cdot \sqrt{t}\\
\end{array}
\end{array}
if t < -700Initial program 53.5%
add-sqr-sqrt26.8%
times-frac30.4%
Applied egg-rr30.4%
unpow230.4%
Simplified30.4%
Taylor expanded in t around inf 56.9%
if -700 < t < 5.7999999999999999e148Initial program 52.1%
Simplified55.8%
Taylor expanded in Om around inf 51.6%
Taylor expanded in l around 0 59.5%
if 5.7999999999999999e148 < t Initial program 43.1%
Simplified34.4%
Taylor expanded in t around inf 43.5%
associate-*r*43.3%
Simplified43.3%
pow1/246.5%
associate-*r*46.5%
*-commutative46.5%
unpow-prod-down72.2%
pow1/269.1%
associate-*r*69.2%
pow1/269.2%
Applied egg-rr69.2%
associate-*l*69.1%
*-commutative69.1%
associate-*r*69.2%
*-commutative69.2%
Simplified69.2%
Final simplification60.2%
(FPCore (n U t l Om U*) :precision binary64 (if (<= t 2.9e+137) (pow (* 2.0 (* n (* U (+ t (* (/ (pow l 2.0) Om) -2.0))))) 0.5) (* (sqrt (* n (* 2.0 U))) (sqrt t))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (t <= 2.9e+137) {
tmp = pow((2.0 * (n * (U * (t + ((pow(l, 2.0) / Om) * -2.0))))), 0.5);
} else {
tmp = sqrt((n * (2.0 * U))) * sqrt(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 <= 2.9d+137) then
tmp = (2.0d0 * (n * (u * (t + (((l ** 2.0d0) / om) * (-2.0d0)))))) ** 0.5d0
else
tmp = sqrt((n * (2.0d0 * u))) * sqrt(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 <= 2.9e+137) {
tmp = Math.pow((2.0 * (n * (U * (t + ((Math.pow(l, 2.0) / Om) * -2.0))))), 0.5);
} else {
tmp = Math.sqrt((n * (2.0 * U))) * Math.sqrt(t);
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if t <= 2.9e+137: tmp = math.pow((2.0 * (n * (U * (t + ((math.pow(l, 2.0) / Om) * -2.0))))), 0.5) else: tmp = math.sqrt((n * (2.0 * U))) * math.sqrt(t) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (t <= 2.9e+137) tmp = Float64(2.0 * Float64(n * Float64(U * Float64(t + Float64(Float64((l ^ 2.0) / Om) * -2.0))))) ^ 0.5; else tmp = Float64(sqrt(Float64(n * Float64(2.0 * U))) * sqrt(t)); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (t <= 2.9e+137) tmp = (2.0 * (n * (U * (t + (((l ^ 2.0) / Om) * -2.0))))) ^ 0.5; else tmp = sqrt((n * (2.0 * U))) * sqrt(t); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[t, 2.9e+137], N[Power[N[(2.0 * N[(n * N[(U * N[(t + N[(N[(N[Power[l, 2.0], $MachinePrecision] / Om), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[(N[Sqrt[N[(n * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;t \leq 2.9 \cdot 10^{+137}:\\
\;\;\;\;{\left(2 \cdot \left(n \cdot \left(U \cdot \left(t + \frac{{\ell}^{2}}{Om} \cdot -2\right)\right)\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{n \cdot \left(2 \cdot U\right)} \cdot \sqrt{t}\\
\end{array}
\end{array}
if t < 2.89999999999999985e137Initial program 52.2%
Simplified51.2%
Taylor expanded in n around 0 42.8%
pow1/249.7%
associate-*l*49.7%
cancel-sign-sub-inv49.7%
metadata-eval49.7%
Applied egg-rr49.7%
if 2.89999999999999985e137 < t Initial program 45.2%
Simplified37.1%
Taylor expanded in t around inf 43.0%
associate-*r*42.8%
Simplified42.8%
pow1/245.6%
associate-*r*45.6%
*-commutative45.6%
unpow-prod-down69.2%
pow1/266.3%
associate-*r*66.3%
pow1/266.3%
Applied egg-rr66.3%
associate-*l*66.3%
*-commutative66.3%
associate-*r*66.3%
*-commutative66.3%
Simplified66.3%
Final simplification52.0%
(FPCore (n U t l Om U*) :precision binary64 (if (<= t 1.05e+80) (sqrt (* (* 2.0 n) (* U (- t (* 2.0 (* l (/ l Om))))))) (* (sqrt (* n (* 2.0 U))) (sqrt t))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (t <= 1.05e+80) {
tmp = sqrt(((2.0 * n) * (U * (t - (2.0 * (l * (l / Om)))))));
} else {
tmp = sqrt((n * (2.0 * U))) * sqrt(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.05d+80) then
tmp = sqrt(((2.0d0 * n) * (u * (t - (2.0d0 * (l * (l / om)))))))
else
tmp = sqrt((n * (2.0d0 * u))) * sqrt(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.05e+80) {
tmp = Math.sqrt(((2.0 * n) * (U * (t - (2.0 * (l * (l / Om)))))));
} else {
tmp = Math.sqrt((n * (2.0 * U))) * Math.sqrt(t);
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if t <= 1.05e+80: tmp = math.sqrt(((2.0 * n) * (U * (t - (2.0 * (l * (l / Om))))))) else: tmp = math.sqrt((n * (2.0 * U))) * math.sqrt(t) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (t <= 1.05e+80) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t - Float64(2.0 * Float64(l * Float64(l / Om))))))); else tmp = Float64(sqrt(Float64(n * Float64(2.0 * U))) * sqrt(t)); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (t <= 1.05e+80) tmp = sqrt(((2.0 * n) * (U * (t - (2.0 * (l * (l / Om))))))); else tmp = sqrt((n * (2.0 * U))) * sqrt(t); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[t, 1.05e+80], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t - N[(2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(n * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;t \leq 1.05 \cdot 10^{+80}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t - 2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{n \cdot \left(2 \cdot U\right)} \cdot \sqrt{t}\\
\end{array}
\end{array}
if t < 1.05000000000000001e80Initial program 51.5%
Simplified51.4%
Taylor expanded in n around 0 42.8%
unpow254.6%
associate-*l/59.3%
Applied egg-rr46.4%
if 1.05000000000000001e80 < t Initial program 50.1%
Simplified41.0%
Taylor expanded in t around inf 48.7%
associate-*r*48.6%
Simplified48.6%
pow1/250.6%
associate-*r*50.6%
*-commutative50.6%
unpow-prod-down64.6%
pow1/262.5%
associate-*r*62.5%
pow1/262.5%
Applied egg-rr62.5%
associate-*l*62.5%
*-commutative62.5%
associate-*r*62.5%
*-commutative62.5%
Simplified62.5%
Final simplification49.7%
(FPCore (n U t l Om U*) :precision binary64 (if (<= U 7e+54) (sqrt (* (* 2.0 n) (* U (- t (* 2.0 (* l (/ l Om))))))) (* (sqrt (* 2.0 U)) (sqrt (* n t)))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (U <= 7e+54) {
tmp = sqrt(((2.0 * n) * (U * (t - (2.0 * (l * (l / Om)))))));
} else {
tmp = sqrt((2.0 * U)) * sqrt((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 (u <= 7d+54) then
tmp = sqrt(((2.0d0 * n) * (u * (t - (2.0d0 * (l * (l / om)))))))
else
tmp = sqrt((2.0d0 * u)) * sqrt((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 (U <= 7e+54) {
tmp = Math.sqrt(((2.0 * n) * (U * (t - (2.0 * (l * (l / Om)))))));
} else {
tmp = Math.sqrt((2.0 * U)) * Math.sqrt((n * t));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if U <= 7e+54: tmp = math.sqrt(((2.0 * n) * (U * (t - (2.0 * (l * (l / Om))))))) else: tmp = math.sqrt((2.0 * U)) * math.sqrt((n * t)) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (U <= 7e+54) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t - Float64(2.0 * Float64(l * Float64(l / Om))))))); else tmp = Float64(sqrt(Float64(2.0 * U)) * sqrt(Float64(n * t))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (U <= 7e+54) tmp = sqrt(((2.0 * n) * (U * (t - (2.0 * (l * (l / Om))))))); else tmp = sqrt((2.0 * U)) * sqrt((n * t)); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[U, 7e+54], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t - N[(2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(2.0 * U), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(n * t), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;U \leq 7 \cdot 10^{+54}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t - 2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot U} \cdot \sqrt{n \cdot t}\\
\end{array}
\end{array}
if U < 7.0000000000000002e54Initial program 50.6%
Simplified50.0%
Taylor expanded in n around 0 42.5%
unpow255.7%
associate-*l/60.2%
Applied egg-rr46.7%
if 7.0000000000000002e54 < U Initial program 54.9%
Simplified44.7%
Taylor expanded in t around inf 41.8%
pow1/242.2%
associate-*r*42.2%
unpow-prod-down54.1%
pow1/254.1%
Applied egg-rr54.1%
unpow1/254.1%
Simplified54.1%
Final simplification47.8%
(FPCore (n U t l Om U*) :precision binary64 (if (<= t 5.7e+79) (sqrt (* (* 2.0 n) (* U (- t (* 2.0 (* l (/ l Om))))))) (sqrt (* 2.0 (fabs (* U (* n t)))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (t <= 5.7e+79) {
tmp = sqrt(((2.0 * n) * (U * (t - (2.0 * (l * (l / Om)))))));
} else {
tmp = sqrt((2.0 * fabs((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 <= 5.7d+79) then
tmp = sqrt(((2.0d0 * n) * (u * (t - (2.0d0 * (l * (l / om)))))))
else
tmp = sqrt((2.0d0 * abs((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 <= 5.7e+79) {
tmp = Math.sqrt(((2.0 * n) * (U * (t - (2.0 * (l * (l / Om)))))));
} else {
tmp = Math.sqrt((2.0 * Math.abs((U * (n * t)))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if t <= 5.7e+79: tmp = math.sqrt(((2.0 * n) * (U * (t - (2.0 * (l * (l / Om))))))) else: tmp = math.sqrt((2.0 * math.fabs((U * (n * t))))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (t <= 5.7e+79) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t - Float64(2.0 * Float64(l * Float64(l / Om))))))); else tmp = sqrt(Float64(2.0 * abs(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 <= 5.7e+79) tmp = sqrt(((2.0 * n) * (U * (t - (2.0 * (l * (l / Om))))))); else tmp = sqrt((2.0 * abs((U * (n * t))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[t, 5.7e+79], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t - N[(2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[Abs[N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;t \leq 5.7 \cdot 10^{+79}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t - 2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left|U \cdot \left(n \cdot t\right)\right|}\\
\end{array}
\end{array}
if t < 5.6999999999999997e79Initial program 51.5%
Simplified51.4%
Taylor expanded in n around 0 42.8%
unpow254.6%
associate-*l/59.3%
Applied egg-rr46.4%
if 5.6999999999999997e79 < t Initial program 50.1%
Simplified41.0%
Taylor expanded in t around inf 48.7%
associate-*r*48.6%
add-sqr-sqrt48.5%
pow1/248.5%
pow1/250.6%
pow-prod-down39.3%
pow239.3%
associate-*r*41.3%
Applied egg-rr41.3%
unpow1/241.3%
unpow241.3%
rem-sqrt-square53.1%
Simplified53.1%
Final simplification47.7%
(FPCore (n U t l Om U*) :precision binary64 (if (<= t 1.5e+79) (sqrt (* (* 2.0 n) (* U (- t (* 2.0 (* l (/ l Om))))))) (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 (t <= 1.5e+79) {
tmp = sqrt(((2.0 * n) * (U * (t - (2.0 * (l * (l / Om)))))));
} 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 (t <= 1.5d+79) then
tmp = sqrt(((2.0d0 * n) * (u * (t - (2.0d0 * (l * (l / om)))))))
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 (t <= 1.5e+79) {
tmp = Math.sqrt(((2.0 * n) * (U * (t - (2.0 * (l * (l / Om)))))));
} 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 t <= 1.5e+79: tmp = math.sqrt(((2.0 * n) * (U * (t - (2.0 * (l * (l / Om))))))) 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 (t <= 1.5e+79) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t - Float64(2.0 * Float64(l * Float64(l / Om))))))); 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 (t <= 1.5e+79) tmp = sqrt(((2.0 * n) * (U * (t - (2.0 * (l * (l / Om))))))); else tmp = ((2.0 * U) * (n * t)) ^ 0.5; end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[t, 1.5e+79], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t - N[(2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $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}\;t \leq 1.5 \cdot 10^{+79}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t - 2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;{\left(\left(2 \cdot U\right) \cdot \left(n \cdot t\right)\right)}^{0.5}\\
\end{array}
\end{array}
if t < 1.49999999999999987e79Initial program 51.5%
Simplified51.4%
Taylor expanded in n around 0 42.8%
unpow254.6%
associate-*l/59.3%
Applied egg-rr46.4%
if 1.49999999999999987e79 < t Initial program 50.1%
Simplified41.0%
Taylor expanded in t around inf 48.7%
pow1/252.7%
pow-to-exp46.2%
Applied egg-rr46.2%
associate-*r*46.2%
log-prod31.2%
Applied egg-rr31.2%
*-commutative31.2%
Simplified31.2%
sum-log46.2%
exp-to-pow52.7%
Applied egg-rr52.7%
Final simplification47.7%
(FPCore (n U t l Om U*) :precision binary64 (pow (* (* 2.0 U) (* n t)) 0.5))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return pow(((2.0 * U) * (n * t)), 0.5);
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
code = ((2.0d0 * u) * (n * t)) ** 0.5d0
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.pow(((2.0 * U) * (n * t)), 0.5);
}
def code(n, U, t, l, Om, U_42_): return math.pow(((2.0 * U) * (n * t)), 0.5)
function code(n, U, t, l, Om, U_42_) return Float64(Float64(2.0 * U) * Float64(n * t)) ^ 0.5 end
function tmp = code(n, U, t, l, Om, U_42_) tmp = ((2.0 * U) * (n * t)) ^ 0.5; end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Power[N[(N[(2.0 * U), $MachinePrecision] * N[(n * t), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]
\begin{array}{l}
\\
{\left(\left(2 \cdot U\right) \cdot \left(n \cdot t\right)\right)}^{0.5}
\end{array}
Initial program 51.2%
Simplified49.3%
Taylor expanded in t around inf 34.2%
pow1/235.9%
pow-to-exp32.2%
Applied egg-rr32.2%
associate-*r*32.2%
log-prod19.5%
Applied egg-rr19.5%
*-commutative19.5%
Simplified19.5%
sum-log32.2%
exp-to-pow35.9%
Applied egg-rr35.9%
Final simplification35.9%
(FPCore (n U t l Om U*) :precision binary64 (pow (* 2.0 (* U (* n t))) 0.5))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return pow((2.0 * (U * (n * t))), 0.5);
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
code = (2.0d0 * (u * (n * t))) ** 0.5d0
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.pow((2.0 * (U * (n * t))), 0.5);
}
def code(n, U, t, l, Om, U_42_): return math.pow((2.0 * (U * (n * t))), 0.5)
function code(n, U, t, l, Om, U_42_) return Float64(2.0 * Float64(U * Float64(n * t))) ^ 0.5 end
function tmp = code(n, U, t, l, Om, U_42_) tmp = (2.0 * (U * (n * t))) ^ 0.5; end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Power[N[(2.0 * N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]
\begin{array}{l}
\\
{\left(2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)}^{0.5}
\end{array}
Initial program 51.2%
Simplified49.3%
Taylor expanded in t around inf 34.2%
pow1/235.9%
Applied egg-rr35.9%
(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 51.2%
Simplified49.3%
Taylor expanded in t around inf 34.2%
herbie shell --seed 2024172
(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*))))))