
(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 19 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 (sqrt 2.0)))
(t_2 (* (* n (pow (/ l Om) 2.0)) (- U* U)))
(t_3 (* (* (* 2.0 n) U) (+ (- t (* 2.0 (/ (* l l) Om))) t_2))))
(if (<= t_3 0.0)
(sqrt (* (* 2.0 n) (* U (- t (* t_1 (/ t_1 Om))))))
(if (<= t_3 5e+293)
(sqrt (* (* 2.0 (* n U)) (+ t (- t_2 (* 2.0 (* l (/ l Om)))))))
(fabs (/ (* l (sqrt (* U* (* 2.0 U)))) (/ Om n)))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = l * sqrt(2.0);
double t_2 = (n * pow((l / Om), 2.0)) * (U_42_ - U);
double t_3 = ((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) + t_2);
double tmp;
if (t_3 <= 0.0) {
tmp = sqrt(((2.0 * n) * (U * (t - (t_1 * (t_1 / Om))))));
} else if (t_3 <= 5e+293) {
tmp = sqrt(((2.0 * (n * U)) * (t + (t_2 - (2.0 * (l * (l / Om)))))));
} else {
tmp = fabs(((l * sqrt((U_42_ * (2.0 * U)))) / (Om / n)));
}
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) :: t_3
real(8) :: tmp
t_1 = l * sqrt(2.0d0)
t_2 = (n * ((l / om) ** 2.0d0)) * (u_42 - u)
t_3 = ((2.0d0 * n) * u) * ((t - (2.0d0 * ((l * l) / om))) + t_2)
if (t_3 <= 0.0d0) then
tmp = sqrt(((2.0d0 * n) * (u * (t - (t_1 * (t_1 / om))))))
else if (t_3 <= 5d+293) then
tmp = sqrt(((2.0d0 * (n * u)) * (t + (t_2 - (2.0d0 * (l * (l / om)))))))
else
tmp = abs(((l * sqrt((u_42 * (2.0d0 * u)))) / (om / n)))
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 * Math.sqrt(2.0);
double t_2 = (n * Math.pow((l / Om), 2.0)) * (U_42_ - U);
double t_3 = ((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) + t_2);
double tmp;
if (t_3 <= 0.0) {
tmp = Math.sqrt(((2.0 * n) * (U * (t - (t_1 * (t_1 / Om))))));
} else if (t_3 <= 5e+293) {
tmp = Math.sqrt(((2.0 * (n * U)) * (t + (t_2 - (2.0 * (l * (l / Om)))))));
} else {
tmp = Math.abs(((l * Math.sqrt((U_42_ * (2.0 * U)))) / (Om / n)));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = l * math.sqrt(2.0) t_2 = (n * math.pow((l / Om), 2.0)) * (U_42_ - U) t_3 = ((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) + t_2) tmp = 0 if t_3 <= 0.0: tmp = math.sqrt(((2.0 * n) * (U * (t - (t_1 * (t_1 / Om)))))) elif t_3 <= 5e+293: tmp = math.sqrt(((2.0 * (n * U)) * (t + (t_2 - (2.0 * (l * (l / Om))))))) else: tmp = math.fabs(((l * math.sqrt((U_42_ * (2.0 * U)))) / (Om / n))) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(l * sqrt(2.0)) t_2 = Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U_42_ - U)) t_3 = 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(Float64(2.0 * n) * Float64(U * Float64(t - Float64(t_1 * Float64(t_1 / Om)))))); elseif (t_3 <= 5e+293) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t + Float64(t_2 - Float64(2.0 * Float64(l * Float64(l / Om))))))); else tmp = abs(Float64(Float64(l * sqrt(Float64(U_42_ * Float64(2.0 * U)))) / Float64(Om / n))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = l * sqrt(2.0); t_2 = (n * ((l / Om) ^ 2.0)) * (U_42_ - U); t_3 = ((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) + t_2); tmp = 0.0; if (t_3 <= 0.0) tmp = sqrt(((2.0 * n) * (U * (t - (t_1 * (t_1 / Om)))))); elseif (t_3 <= 5e+293) tmp = sqrt(((2.0 * (n * U)) * (t + (t_2 - (2.0 * (l * (l / Om))))))); else tmp = abs(((l * sqrt((U_42_ * (2.0 * U)))) / (Om / n))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(l * N[Sqrt[2.0], $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[(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]}, If[LessEqual[t$95$3, 0.0], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t - N[(t$95$1 * N[(t$95$1 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$3, 5e+293], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(t$95$2 - N[(2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Abs[N[(N[(l * N[Sqrt[N[(U$42$ * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(Om / n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \ell \cdot \sqrt{2}\\
t_2 := \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\\
t_3 := \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{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t - t\_1 \cdot \frac{t\_1}{Om}\right)\right)}\\
\mathbf{elif}\;t\_3 \leq 5 \cdot 10^{+293}:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t + \left(t\_2 - 2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\left|\frac{\ell \cdot \sqrt{U* \cdot \left(2 \cdot U\right)}}{\frac{Om}{n}}\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*)))) < 0.0Initial program 11.6%
Simplified42.5%
Taylor expanded in Om around inf 42.6%
associate-*r/42.6%
Simplified42.6%
add-sqr-sqrt42.6%
*-un-lft-identity42.6%
times-frac42.6%
*-commutative42.6%
sqrt-prod42.6%
sqrt-pow142.7%
metadata-eval42.7%
pow142.7%
*-commutative42.7%
sqrt-prod42.7%
sqrt-pow146.2%
metadata-eval46.2%
pow146.2%
Applied egg-rr46.2%
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*)))) < 5.00000000000000033e293Initial program 97.8%
Simplified97.8%
if 5.00000000000000033e293 < (*.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 18.7%
Simplified27.7%
associate-*r*27.7%
fma-define31.5%
associate-*r*32.1%
Applied egg-rr32.1%
Taylor expanded in U around 0 20.5%
mul-1-neg20.5%
associate-/l*20.6%
unpow220.6%
unpow220.6%
times-frac32.3%
unpow232.3%
Simplified32.3%
Taylor expanded in n around inf 24.4%
associate-*r/24.4%
associate-*r*24.2%
Simplified24.2%
pow1/224.3%
Applied egg-rr33.9%
unpow1/233.9%
unpow233.9%
rem-sqrt-square44.7%
associate-/l*44.0%
*-commutative44.0%
associate-/l*45.8%
Simplified45.8%
associate-*r*45.7%
clear-num45.7%
un-div-inv45.7%
associate-*r*45.9%
Applied egg-rr45.9%
Final simplification65.6%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* (* n (pow (/ l Om) 2.0)) (- U* U)))
(t_2 (* (* (* 2.0 n) U) (+ (- t (* 2.0 (/ (* l l) Om))) t_1))))
(if (<= t_2 0.0)
(sqrt (* 2.0 (* U (* n t))))
(if (<= t_2 5e+293)
(sqrt (* (* 2.0 (* n U)) (+ t (- t_1 (* 2.0 (* l (/ l Om)))))))
(fabs (/ (* l (sqrt (* U* (* 2.0 U)))) (/ Om n)))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (n * pow((l / Om), 2.0)) * (U_42_ - U);
double t_2 = ((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) + t_1);
double tmp;
if (t_2 <= 0.0) {
tmp = sqrt((2.0 * (U * (n * t))));
} else if (t_2 <= 5e+293) {
tmp = sqrt(((2.0 * (n * U)) * (t + (t_1 - (2.0 * (l * (l / Om)))))));
} else {
tmp = fabs(((l * sqrt((U_42_ * (2.0 * U)))) / (Om / n)));
}
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 = (n * ((l / om) ** 2.0d0)) * (u_42 - u)
t_2 = ((2.0d0 * n) * u) * ((t - (2.0d0 * ((l * l) / om))) + t_1)
if (t_2 <= 0.0d0) then
tmp = sqrt((2.0d0 * (u * (n * t))))
else if (t_2 <= 5d+293) then
tmp = sqrt(((2.0d0 * (n * u)) * (t + (t_1 - (2.0d0 * (l * (l / om)))))))
else
tmp = abs(((l * sqrt((u_42 * (2.0d0 * u)))) / (om / n)))
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 = (n * Math.pow((l / Om), 2.0)) * (U_42_ - U);
double t_2 = ((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) + t_1);
double tmp;
if (t_2 <= 0.0) {
tmp = Math.sqrt((2.0 * (U * (n * t))));
} else if (t_2 <= 5e+293) {
tmp = Math.sqrt(((2.0 * (n * U)) * (t + (t_1 - (2.0 * (l * (l / Om)))))));
} else {
tmp = Math.abs(((l * Math.sqrt((U_42_ * (2.0 * U)))) / (Om / n)));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = (n * math.pow((l / Om), 2.0)) * (U_42_ - U) t_2 = ((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) + t_1) tmp = 0 if t_2 <= 0.0: tmp = math.sqrt((2.0 * (U * (n * t)))) elif t_2 <= 5e+293: tmp = math.sqrt(((2.0 * (n * U)) * (t + (t_1 - (2.0 * (l * (l / Om))))))) else: tmp = math.fabs(((l * math.sqrt((U_42_ * (2.0 * U)))) / (Om / n))) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U_42_ - U)) t_2 = Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) + t_1)) tmp = 0.0 if (t_2 <= 0.0) tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * t)))); elseif (t_2 <= 5e+293) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t + Float64(t_1 - Float64(2.0 * Float64(l * Float64(l / Om))))))); else tmp = abs(Float64(Float64(l * sqrt(Float64(U_42_ * Float64(2.0 * U)))) / Float64(Om / n))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = (n * ((l / Om) ^ 2.0)) * (U_42_ - U); t_2 = ((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) + t_1); tmp = 0.0; if (t_2 <= 0.0) tmp = sqrt((2.0 * (U * (n * t)))); elseif (t_2 <= 5e+293) tmp = sqrt(((2.0 * (n * U)) * (t + (t_1 - (2.0 * (l * (l / Om))))))); else tmp = abs(((l * sqrt((U_42_ * (2.0 * U)))) / (Om / n))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = 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$1), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, 0.0], N[Sqrt[N[(2.0 * N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$2, 5e+293], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(t$95$1 - N[(2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Abs[N[(N[(l * N[Sqrt[N[(U$42$ * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(Om / n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\\
t_2 := \left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) + t\_1\right)\\
\mathbf{if}\;t\_2 \leq 0:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}\\
\mathbf{elif}\;t\_2 \leq 5 \cdot 10^{+293}:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t + \left(t\_1 - 2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\left|\frac{\ell \cdot \sqrt{U* \cdot \left(2 \cdot U\right)}}{\frac{Om}{n}}\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*)))) < 0.0Initial program 11.6%
Simplified42.5%
Taylor expanded in t around inf 46.1%
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*)))) < 5.00000000000000033e293Initial program 97.8%
Simplified97.8%
if 5.00000000000000033e293 < (*.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 18.7%
Simplified27.7%
associate-*r*27.7%
fma-define31.5%
associate-*r*32.1%
Applied egg-rr32.1%
Taylor expanded in U around 0 20.5%
mul-1-neg20.5%
associate-/l*20.6%
unpow220.6%
unpow220.6%
times-frac32.3%
unpow232.3%
Simplified32.3%
Taylor expanded in n around inf 24.4%
associate-*r/24.4%
associate-*r*24.2%
Simplified24.2%
pow1/224.3%
Applied egg-rr33.9%
unpow1/233.9%
unpow233.9%
rem-sqrt-square44.7%
associate-/l*44.0%
*-commutative44.0%
associate-/l*45.8%
Simplified45.8%
associate-*r*45.7%
clear-num45.7%
un-div-inv45.7%
associate-*r*45.9%
Applied egg-rr45.9%
Final simplification65.6%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (sqrt (* 2.0 (* U U*))))
(t_2 (* 2.0 (* n U)))
(t_3 (* n (pow l 2.0))))
(if (<= l 1.25e+45)
(sqrt (* 2.0 (fabs (* U (* n t)))))
(if (<= l 7.6e+58)
(pow (/ (* (* U -4.0) t_3) Om) 0.5)
(if (<= l 1.45e+83)
(fabs (* t_1 (/ 1.0 (/ Om (* n l)))))
(if (<= l 2.25e+108)
(fabs (/ (* l (sqrt (* U* (* 2.0 U)))) (/ Om n)))
(if (<= l 2.5e+111)
(sqrt (* -4.0 (* U (/ t_3 Om))))
(if (<= l 8.2e+132)
(fabs (* t_1 (* l (/ n Om))))
(if (<= l 6.6e+148)
(pow (* t_2 (* (pow l 2.0) (/ -2.0 Om))) 0.5)
(if (<= l 1.95e+275)
(fabs (* t_1 (/ l (/ Om n))))
(* l (* (sqrt (/ -2.0 Om)) (sqrt t_2)))))))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = sqrt((2.0 * (U * U_42_)));
double t_2 = 2.0 * (n * U);
double t_3 = n * pow(l, 2.0);
double tmp;
if (l <= 1.25e+45) {
tmp = sqrt((2.0 * fabs((U * (n * t)))));
} else if (l <= 7.6e+58) {
tmp = pow((((U * -4.0) * t_3) / Om), 0.5);
} else if (l <= 1.45e+83) {
tmp = fabs((t_1 * (1.0 / (Om / (n * l)))));
} else if (l <= 2.25e+108) {
tmp = fabs(((l * sqrt((U_42_ * (2.0 * U)))) / (Om / n)));
} else if (l <= 2.5e+111) {
tmp = sqrt((-4.0 * (U * (t_3 / Om))));
} else if (l <= 8.2e+132) {
tmp = fabs((t_1 * (l * (n / Om))));
} else if (l <= 6.6e+148) {
tmp = pow((t_2 * (pow(l, 2.0) * (-2.0 / Om))), 0.5);
} else if (l <= 1.95e+275) {
tmp = fabs((t_1 * (l / (Om / n))));
} else {
tmp = l * (sqrt((-2.0 / Om)) * sqrt(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) :: t_3
real(8) :: tmp
t_1 = sqrt((2.0d0 * (u * u_42)))
t_2 = 2.0d0 * (n * u)
t_3 = n * (l ** 2.0d0)
if (l <= 1.25d+45) then
tmp = sqrt((2.0d0 * abs((u * (n * t)))))
else if (l <= 7.6d+58) then
tmp = (((u * (-4.0d0)) * t_3) / om) ** 0.5d0
else if (l <= 1.45d+83) then
tmp = abs((t_1 * (1.0d0 / (om / (n * l)))))
else if (l <= 2.25d+108) then
tmp = abs(((l * sqrt((u_42 * (2.0d0 * u)))) / (om / n)))
else if (l <= 2.5d+111) then
tmp = sqrt(((-4.0d0) * (u * (t_3 / om))))
else if (l <= 8.2d+132) then
tmp = abs((t_1 * (l * (n / om))))
else if (l <= 6.6d+148) then
tmp = (t_2 * ((l ** 2.0d0) * ((-2.0d0) / om))) ** 0.5d0
else if (l <= 1.95d+275) then
tmp = abs((t_1 * (l / (om / n))))
else
tmp = l * (sqrt(((-2.0d0) / om)) * sqrt(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 = Math.sqrt((2.0 * (U * U_42_)));
double t_2 = 2.0 * (n * U);
double t_3 = n * Math.pow(l, 2.0);
double tmp;
if (l <= 1.25e+45) {
tmp = Math.sqrt((2.0 * Math.abs((U * (n * t)))));
} else if (l <= 7.6e+58) {
tmp = Math.pow((((U * -4.0) * t_3) / Om), 0.5);
} else if (l <= 1.45e+83) {
tmp = Math.abs((t_1 * (1.0 / (Om / (n * l)))));
} else if (l <= 2.25e+108) {
tmp = Math.abs(((l * Math.sqrt((U_42_ * (2.0 * U)))) / (Om / n)));
} else if (l <= 2.5e+111) {
tmp = Math.sqrt((-4.0 * (U * (t_3 / Om))));
} else if (l <= 8.2e+132) {
tmp = Math.abs((t_1 * (l * (n / Om))));
} else if (l <= 6.6e+148) {
tmp = Math.pow((t_2 * (Math.pow(l, 2.0) * (-2.0 / Om))), 0.5);
} else if (l <= 1.95e+275) {
tmp = Math.abs((t_1 * (l / (Om / n))));
} else {
tmp = l * (Math.sqrt((-2.0 / Om)) * Math.sqrt(t_2));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = math.sqrt((2.0 * (U * U_42_))) t_2 = 2.0 * (n * U) t_3 = n * math.pow(l, 2.0) tmp = 0 if l <= 1.25e+45: tmp = math.sqrt((2.0 * math.fabs((U * (n * t))))) elif l <= 7.6e+58: tmp = math.pow((((U * -4.0) * t_3) / Om), 0.5) elif l <= 1.45e+83: tmp = math.fabs((t_1 * (1.0 / (Om / (n * l))))) elif l <= 2.25e+108: tmp = math.fabs(((l * math.sqrt((U_42_ * (2.0 * U)))) / (Om / n))) elif l <= 2.5e+111: tmp = math.sqrt((-4.0 * (U * (t_3 / Om)))) elif l <= 8.2e+132: tmp = math.fabs((t_1 * (l * (n / Om)))) elif l <= 6.6e+148: tmp = math.pow((t_2 * (math.pow(l, 2.0) * (-2.0 / Om))), 0.5) elif l <= 1.95e+275: tmp = math.fabs((t_1 * (l / (Om / n)))) else: tmp = l * (math.sqrt((-2.0 / Om)) * math.sqrt(t_2)) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = sqrt(Float64(2.0 * Float64(U * U_42_))) t_2 = Float64(2.0 * Float64(n * U)) t_3 = Float64(n * (l ^ 2.0)) tmp = 0.0 if (l <= 1.25e+45) tmp = sqrt(Float64(2.0 * abs(Float64(U * Float64(n * t))))); elseif (l <= 7.6e+58) tmp = Float64(Float64(Float64(U * -4.0) * t_3) / Om) ^ 0.5; elseif (l <= 1.45e+83) tmp = abs(Float64(t_1 * Float64(1.0 / Float64(Om / Float64(n * l))))); elseif (l <= 2.25e+108) tmp = abs(Float64(Float64(l * sqrt(Float64(U_42_ * Float64(2.0 * U)))) / Float64(Om / n))); elseif (l <= 2.5e+111) tmp = sqrt(Float64(-4.0 * Float64(U * Float64(t_3 / Om)))); elseif (l <= 8.2e+132) tmp = abs(Float64(t_1 * Float64(l * Float64(n / Om)))); elseif (l <= 6.6e+148) tmp = Float64(t_2 * Float64((l ^ 2.0) * Float64(-2.0 / Om))) ^ 0.5; elseif (l <= 1.95e+275) tmp = abs(Float64(t_1 * Float64(l / Float64(Om / n)))); else tmp = Float64(l * Float64(sqrt(Float64(-2.0 / Om)) * sqrt(t_2))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = sqrt((2.0 * (U * U_42_))); t_2 = 2.0 * (n * U); t_3 = n * (l ^ 2.0); tmp = 0.0; if (l <= 1.25e+45) tmp = sqrt((2.0 * abs((U * (n * t))))); elseif (l <= 7.6e+58) tmp = (((U * -4.0) * t_3) / Om) ^ 0.5; elseif (l <= 1.45e+83) tmp = abs((t_1 * (1.0 / (Om / (n * l))))); elseif (l <= 2.25e+108) tmp = abs(((l * sqrt((U_42_ * (2.0 * U)))) / (Om / n))); elseif (l <= 2.5e+111) tmp = sqrt((-4.0 * (U * (t_3 / Om)))); elseif (l <= 8.2e+132) tmp = abs((t_1 * (l * (n / Om)))); elseif (l <= 6.6e+148) tmp = (t_2 * ((l ^ 2.0) * (-2.0 / Om))) ^ 0.5; elseif (l <= 1.95e+275) tmp = abs((t_1 * (l / (Om / n)))); else tmp = l * (sqrt((-2.0 / Om)) * sqrt(t_2)); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[Sqrt[N[(2.0 * N[(U * U$42$), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(n * N[Power[l, 2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, 1.25e+45], N[Sqrt[N[(2.0 * N[Abs[N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 7.6e+58], N[Power[N[(N[(N[(U * -4.0), $MachinePrecision] * t$95$3), $MachinePrecision] / Om), $MachinePrecision], 0.5], $MachinePrecision], If[LessEqual[l, 1.45e+83], N[Abs[N[(t$95$1 * N[(1.0 / N[(Om / N[(n * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 2.25e+108], N[Abs[N[(N[(l * N[Sqrt[N[(U$42$ * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(Om / n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 2.5e+111], N[Sqrt[N[(-4.0 * N[(U * N[(t$95$3 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 8.2e+132], N[Abs[N[(t$95$1 * N[(l * N[(n / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 6.6e+148], N[Power[N[(t$95$2 * N[(N[Power[l, 2.0], $MachinePrecision] * N[(-2.0 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], If[LessEqual[l, 1.95e+275], N[Abs[N[(t$95$1 * N[(l / N[(Om / n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(l * N[(N[Sqrt[N[(-2.0 / Om), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t$95$2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \sqrt{2 \cdot \left(U \cdot U*\right)}\\
t_2 := 2 \cdot \left(n \cdot U\right)\\
t_3 := n \cdot {\ell}^{2}\\
\mathbf{if}\;\ell \leq 1.25 \cdot 10^{+45}:\\
\;\;\;\;\sqrt{2 \cdot \left|U \cdot \left(n \cdot t\right)\right|}\\
\mathbf{elif}\;\ell \leq 7.6 \cdot 10^{+58}:\\
\;\;\;\;{\left(\frac{\left(U \cdot -4\right) \cdot t\_3}{Om}\right)}^{0.5}\\
\mathbf{elif}\;\ell \leq 1.45 \cdot 10^{+83}:\\
\;\;\;\;\left|t\_1 \cdot \frac{1}{\frac{Om}{n \cdot \ell}}\right|\\
\mathbf{elif}\;\ell \leq 2.25 \cdot 10^{+108}:\\
\;\;\;\;\left|\frac{\ell \cdot \sqrt{U* \cdot \left(2 \cdot U\right)}}{\frac{Om}{n}}\right|\\
\mathbf{elif}\;\ell \leq 2.5 \cdot 10^{+111}:\\
\;\;\;\;\sqrt{-4 \cdot \left(U \cdot \frac{t\_3}{Om}\right)}\\
\mathbf{elif}\;\ell \leq 8.2 \cdot 10^{+132}:\\
\;\;\;\;\left|t\_1 \cdot \left(\ell \cdot \frac{n}{Om}\right)\right|\\
\mathbf{elif}\;\ell \leq 6.6 \cdot 10^{+148}:\\
\;\;\;\;{\left(t\_2 \cdot \left({\ell}^{2} \cdot \frac{-2}{Om}\right)\right)}^{0.5}\\
\mathbf{elif}\;\ell \leq 1.95 \cdot 10^{+275}:\\
\;\;\;\;\left|t\_1 \cdot \frac{\ell}{\frac{Om}{n}}\right|\\
\mathbf{else}:\\
\;\;\;\;\ell \cdot \left(\sqrt{\frac{-2}{Om}} \cdot \sqrt{t\_2}\right)\\
\end{array}
\end{array}
if l < 1.25e45Initial program 53.7%
Simplified53.6%
Taylor expanded in t around inf 42.9%
add-cube-cbrt42.5%
pow342.5%
associate-*r*42.1%
*-commutative42.1%
Applied egg-rr42.1%
rem-cube-cbrt42.5%
add-sqr-sqrt42.4%
sqrt-unprod28.4%
pow228.4%
associate-*l*27.9%
Applied egg-rr27.9%
unpow227.9%
rem-sqrt-square41.5%
associate-*r*44.1%
*-commutative44.1%
associate-*r*44.6%
Simplified44.6%
if 1.25e45 < l < 7.5999999999999997e58Initial program 76.7%
Simplified85.3%
Taylor expanded in n around 0 57.3%
associate-*r*62.4%
cancel-sign-sub-inv62.4%
metadata-eval62.4%
*-commutative62.4%
associate-*l/62.4%
Simplified62.4%
pow1/277.6%
associate-*r*77.6%
*-commutative77.6%
+-commutative77.6%
associate-/l*77.6%
fma-define77.6%
Applied egg-rr77.6%
Taylor expanded in l around inf 72.1%
associate-*r/72.1%
associate-*r*72.1%
*-commutative72.1%
Simplified72.1%
if 7.5999999999999997e58 < l < 1.45e83Initial program 36.8%
Simplified36.8%
associate-*r*36.8%
fma-define36.8%
associate-*r*36.8%
Applied egg-rr36.8%
Taylor expanded in U around 0 4.8%
mul-1-neg4.8%
associate-/l*36.8%
unpow236.8%
unpow236.8%
times-frac36.8%
unpow236.8%
Simplified36.8%
Taylor expanded in n around inf 3.4%
associate-*r/3.4%
associate-*r*2.8%
Simplified2.8%
pow1/22.8%
Applied egg-rr36.7%
unpow1/236.7%
unpow236.7%
rem-sqrt-square40.7%
associate-/l*40.7%
*-commutative40.7%
associate-/l*40.7%
Simplified40.7%
associate-*r/40.7%
clear-num40.7%
Applied egg-rr40.7%
if 1.45e83 < l < 2.25e108Initial program 35.9%
Simplified35.9%
associate-*r*35.9%
fma-define52.6%
associate-*r*52.6%
Applied egg-rr52.6%
Taylor expanded in U around 0 35.9%
mul-1-neg35.9%
associate-/l*52.6%
unpow252.6%
unpow252.6%
times-frac52.6%
unpow252.6%
Simplified52.6%
Taylor expanded in n around inf 35.6%
associate-*r/35.6%
associate-*r*35.6%
Simplified35.6%
pow1/235.6%
Applied egg-rr35.6%
unpow1/235.6%
unpow235.6%
rem-sqrt-square51.3%
associate-/l*51.3%
*-commutative51.3%
associate-/l*51.1%
Simplified51.1%
associate-*r*50.9%
clear-num50.9%
un-div-inv51.1%
associate-*r*51.1%
Applied egg-rr51.1%
if 2.25e108 < l < 2.4999999999999998e111Initial program 98.4%
Simplified100.0%
Taylor expanded in Om around inf 100.0%
associate-*r/100.0%
Simplified100.0%
Taylor expanded in t around 0 100.0%
associate-/l*100.0%
*-commutative100.0%
Simplified100.0%
if 2.4999999999999998e111 < l < 8.19999999999999983e132Initial program 44.2%
Simplified44.2%
associate-*r*44.2%
fma-define58.5%
associate-*r*58.5%
Applied egg-rr58.5%
Taylor expanded in U around 0 44.2%
mul-1-neg44.2%
associate-/l*58.5%
unpow258.5%
unpow258.5%
times-frac58.5%
unpow258.5%
Simplified58.5%
Taylor expanded in n around inf 30.7%
associate-*r/30.7%
associate-*r*30.2%
Simplified30.2%
pow1/230.2%
Applied egg-rr45.3%
unpow1/245.3%
unpow245.3%
rem-sqrt-square58.7%
associate-/l*58.3%
*-commutative58.3%
associate-/l*71.9%
Simplified71.9%
if 8.19999999999999983e132 < l < 6.60000000000000021e148Initial program 50.0%
Simplified98.4%
Taylor expanded in n around 0 51.7%
associate-*r*99.2%
cancel-sign-sub-inv99.2%
metadata-eval99.2%
*-commutative99.2%
associate-*l/99.2%
Simplified99.2%
pow1/299.2%
associate-*r*99.2%
*-commutative99.2%
+-commutative99.2%
associate-/l*100.0%
fma-define100.0%
Applied egg-rr100.0%
Taylor expanded in l around inf 99.2%
associate-*r/99.2%
*-commutative99.2%
associate-*r/100.0%
Simplified100.0%
if 6.60000000000000021e148 < l < 1.95e275Initial program 15.0%
Simplified31.2%
associate-*r*31.2%
fma-define34.4%
associate-*r*34.1%
Applied egg-rr34.1%
Taylor expanded in U around 0 17.1%
mul-1-neg17.1%
associate-/l*17.1%
unpow217.1%
unpow217.1%
times-frac34.2%
unpow234.2%
Simplified34.2%
Taylor expanded in n around inf 30.1%
associate-*r/30.1%
associate-*r*29.9%
Simplified29.9%
pow1/229.9%
Applied egg-rr34.5%
unpow1/234.5%
unpow234.5%
rem-sqrt-square34.6%
associate-/l*37.5%
*-commutative37.5%
associate-/l*46.5%
Simplified46.5%
clear-num46.6%
un-div-inv46.6%
Applied egg-rr46.6%
if 1.95e275 < l Initial program 16.7%
Simplified29.9%
Taylor expanded in n around 0 18.4%
associate-*r*18.4%
cancel-sign-sub-inv18.4%
metadata-eval18.4%
*-commutative18.4%
associate-*l/18.4%
Simplified18.4%
pow1/218.4%
associate-*r*18.4%
*-commutative18.4%
+-commutative18.4%
associate-/l*18.4%
fma-define18.4%
Applied egg-rr18.4%
Taylor expanded in l around inf 18.4%
associate-*r/18.4%
*-commutative18.4%
associate-*r/18.4%
Simplified18.4%
*-un-lft-identity18.4%
unpow1/218.4%
*-commutative18.4%
sqrt-prod17.3%
sqrt-prod17.3%
sqrt-pow144.4%
metadata-eval44.4%
pow144.4%
Applied egg-rr44.4%
*-lft-identity44.4%
associate-*l*57.5%
*-commutative57.5%
Simplified57.5%
Final simplification47.4%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (sqrt (* 2.0 (* U U*)))) (t_2 (* n (pow l 2.0))))
(if (<= l 1e+45)
(sqrt (* 2.0 (fabs (* U (* n t)))))
(if (<= l 8.5e+58)
(pow (/ (* (* U -4.0) t_2) Om) 0.5)
(if (<= l 9.6e+81)
(fabs (* t_1 (/ 1.0 (/ Om (* n l)))))
(if (<= l 1e+108)
(fabs (/ (* l (sqrt (* U* (* 2.0 U)))) (/ Om n)))
(if (<= l 2.05e+110)
(sqrt (* -4.0 (* U (/ t_2 Om))))
(if (<= l 1.12e+133)
(fabs (* t_1 (* l (/ n Om))))
(if (<= l 2.7e+150)
(pow (* -4.0 (/ (* (pow l 2.0) (* n U)) Om)) 0.5)
(if (<= l 1.8e+275)
(fabs (* t_1 (/ l (/ Om n))))
(*
l
(* (sqrt (/ -2.0 Om)) (sqrt (* 2.0 (* n U)))))))))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = sqrt((2.0 * (U * U_42_)));
double t_2 = n * pow(l, 2.0);
double tmp;
if (l <= 1e+45) {
tmp = sqrt((2.0 * fabs((U * (n * t)))));
} else if (l <= 8.5e+58) {
tmp = pow((((U * -4.0) * t_2) / Om), 0.5);
} else if (l <= 9.6e+81) {
tmp = fabs((t_1 * (1.0 / (Om / (n * l)))));
} else if (l <= 1e+108) {
tmp = fabs(((l * sqrt((U_42_ * (2.0 * U)))) / (Om / n)));
} else if (l <= 2.05e+110) {
tmp = sqrt((-4.0 * (U * (t_2 / Om))));
} else if (l <= 1.12e+133) {
tmp = fabs((t_1 * (l * (n / Om))));
} else if (l <= 2.7e+150) {
tmp = pow((-4.0 * ((pow(l, 2.0) * (n * U)) / Om)), 0.5);
} else if (l <= 1.8e+275) {
tmp = fabs((t_1 * (l / (Om / n))));
} else {
tmp = l * (sqrt((-2.0 / Om)) * sqrt((2.0 * (n * U))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = sqrt((2.0d0 * (u * u_42)))
t_2 = n * (l ** 2.0d0)
if (l <= 1d+45) then
tmp = sqrt((2.0d0 * abs((u * (n * t)))))
else if (l <= 8.5d+58) then
tmp = (((u * (-4.0d0)) * t_2) / om) ** 0.5d0
else if (l <= 9.6d+81) then
tmp = abs((t_1 * (1.0d0 / (om / (n * l)))))
else if (l <= 1d+108) then
tmp = abs(((l * sqrt((u_42 * (2.0d0 * u)))) / (om / n)))
else if (l <= 2.05d+110) then
tmp = sqrt(((-4.0d0) * (u * (t_2 / om))))
else if (l <= 1.12d+133) then
tmp = abs((t_1 * (l * (n / om))))
else if (l <= 2.7d+150) then
tmp = ((-4.0d0) * (((l ** 2.0d0) * (n * u)) / om)) ** 0.5d0
else if (l <= 1.8d+275) then
tmp = abs((t_1 * (l / (om / n))))
else
tmp = l * (sqrt(((-2.0d0) / om)) * sqrt((2.0d0 * (n * u))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = Math.sqrt((2.0 * (U * U_42_)));
double t_2 = n * Math.pow(l, 2.0);
double tmp;
if (l <= 1e+45) {
tmp = Math.sqrt((2.0 * Math.abs((U * (n * t)))));
} else if (l <= 8.5e+58) {
tmp = Math.pow((((U * -4.0) * t_2) / Om), 0.5);
} else if (l <= 9.6e+81) {
tmp = Math.abs((t_1 * (1.0 / (Om / (n * l)))));
} else if (l <= 1e+108) {
tmp = Math.abs(((l * Math.sqrt((U_42_ * (2.0 * U)))) / (Om / n)));
} else if (l <= 2.05e+110) {
tmp = Math.sqrt((-4.0 * (U * (t_2 / Om))));
} else if (l <= 1.12e+133) {
tmp = Math.abs((t_1 * (l * (n / Om))));
} else if (l <= 2.7e+150) {
tmp = Math.pow((-4.0 * ((Math.pow(l, 2.0) * (n * U)) / Om)), 0.5);
} else if (l <= 1.8e+275) {
tmp = Math.abs((t_1 * (l / (Om / n))));
} else {
tmp = l * (Math.sqrt((-2.0 / Om)) * Math.sqrt((2.0 * (n * U))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = math.sqrt((2.0 * (U * U_42_))) t_2 = n * math.pow(l, 2.0) tmp = 0 if l <= 1e+45: tmp = math.sqrt((2.0 * math.fabs((U * (n * t))))) elif l <= 8.5e+58: tmp = math.pow((((U * -4.0) * t_2) / Om), 0.5) elif l <= 9.6e+81: tmp = math.fabs((t_1 * (1.0 / (Om / (n * l))))) elif l <= 1e+108: tmp = math.fabs(((l * math.sqrt((U_42_ * (2.0 * U)))) / (Om / n))) elif l <= 2.05e+110: tmp = math.sqrt((-4.0 * (U * (t_2 / Om)))) elif l <= 1.12e+133: tmp = math.fabs((t_1 * (l * (n / Om)))) elif l <= 2.7e+150: tmp = math.pow((-4.0 * ((math.pow(l, 2.0) * (n * U)) / Om)), 0.5) elif l <= 1.8e+275: tmp = math.fabs((t_1 * (l / (Om / n)))) else: tmp = l * (math.sqrt((-2.0 / Om)) * math.sqrt((2.0 * (n * U)))) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = sqrt(Float64(2.0 * Float64(U * U_42_))) t_2 = Float64(n * (l ^ 2.0)) tmp = 0.0 if (l <= 1e+45) tmp = sqrt(Float64(2.0 * abs(Float64(U * Float64(n * t))))); elseif (l <= 8.5e+58) tmp = Float64(Float64(Float64(U * -4.0) * t_2) / Om) ^ 0.5; elseif (l <= 9.6e+81) tmp = abs(Float64(t_1 * Float64(1.0 / Float64(Om / Float64(n * l))))); elseif (l <= 1e+108) tmp = abs(Float64(Float64(l * sqrt(Float64(U_42_ * Float64(2.0 * U)))) / Float64(Om / n))); elseif (l <= 2.05e+110) tmp = sqrt(Float64(-4.0 * Float64(U * Float64(t_2 / Om)))); elseif (l <= 1.12e+133) tmp = abs(Float64(t_1 * Float64(l * Float64(n / Om)))); elseif (l <= 2.7e+150) tmp = Float64(-4.0 * Float64(Float64((l ^ 2.0) * Float64(n * U)) / Om)) ^ 0.5; elseif (l <= 1.8e+275) tmp = abs(Float64(t_1 * Float64(l / Float64(Om / n)))); else tmp = Float64(l * Float64(sqrt(Float64(-2.0 / Om)) * sqrt(Float64(2.0 * Float64(n * U))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = sqrt((2.0 * (U * U_42_))); t_2 = n * (l ^ 2.0); tmp = 0.0; if (l <= 1e+45) tmp = sqrt((2.0 * abs((U * (n * t))))); elseif (l <= 8.5e+58) tmp = (((U * -4.0) * t_2) / Om) ^ 0.5; elseif (l <= 9.6e+81) tmp = abs((t_1 * (1.0 / (Om / (n * l))))); elseif (l <= 1e+108) tmp = abs(((l * sqrt((U_42_ * (2.0 * U)))) / (Om / n))); elseif (l <= 2.05e+110) tmp = sqrt((-4.0 * (U * (t_2 / Om)))); elseif (l <= 1.12e+133) tmp = abs((t_1 * (l * (n / Om)))); elseif (l <= 2.7e+150) tmp = (-4.0 * (((l ^ 2.0) * (n * U)) / Om)) ^ 0.5; elseif (l <= 1.8e+275) tmp = abs((t_1 * (l / (Om / n)))); else tmp = l * (sqrt((-2.0 / Om)) * sqrt((2.0 * (n * U)))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[Sqrt[N[(2.0 * N[(U * U$42$), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(n * N[Power[l, 2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, 1e+45], N[Sqrt[N[(2.0 * N[Abs[N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 8.5e+58], N[Power[N[(N[(N[(U * -4.0), $MachinePrecision] * t$95$2), $MachinePrecision] / Om), $MachinePrecision], 0.5], $MachinePrecision], If[LessEqual[l, 9.6e+81], N[Abs[N[(t$95$1 * N[(1.0 / N[(Om / N[(n * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 1e+108], N[Abs[N[(N[(l * N[Sqrt[N[(U$42$ * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(Om / n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 2.05e+110], N[Sqrt[N[(-4.0 * N[(U * N[(t$95$2 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 1.12e+133], N[Abs[N[(t$95$1 * N[(l * N[(n / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 2.7e+150], N[Power[N[(-4.0 * N[(N[(N[Power[l, 2.0], $MachinePrecision] * N[(n * U), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], If[LessEqual[l, 1.8e+275], N[Abs[N[(t$95$1 * N[(l / N[(Om / n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(l * N[(N[Sqrt[N[(-2.0 / Om), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \sqrt{2 \cdot \left(U \cdot U*\right)}\\
t_2 := n \cdot {\ell}^{2}\\
\mathbf{if}\;\ell \leq 10^{+45}:\\
\;\;\;\;\sqrt{2 \cdot \left|U \cdot \left(n \cdot t\right)\right|}\\
\mathbf{elif}\;\ell \leq 8.5 \cdot 10^{+58}:\\
\;\;\;\;{\left(\frac{\left(U \cdot -4\right) \cdot t\_2}{Om}\right)}^{0.5}\\
\mathbf{elif}\;\ell \leq 9.6 \cdot 10^{+81}:\\
\;\;\;\;\left|t\_1 \cdot \frac{1}{\frac{Om}{n \cdot \ell}}\right|\\
\mathbf{elif}\;\ell \leq 10^{+108}:\\
\;\;\;\;\left|\frac{\ell \cdot \sqrt{U* \cdot \left(2 \cdot U\right)}}{\frac{Om}{n}}\right|\\
\mathbf{elif}\;\ell \leq 2.05 \cdot 10^{+110}:\\
\;\;\;\;\sqrt{-4 \cdot \left(U \cdot \frac{t\_2}{Om}\right)}\\
\mathbf{elif}\;\ell \leq 1.12 \cdot 10^{+133}:\\
\;\;\;\;\left|t\_1 \cdot \left(\ell \cdot \frac{n}{Om}\right)\right|\\
\mathbf{elif}\;\ell \leq 2.7 \cdot 10^{+150}:\\
\;\;\;\;{\left(-4 \cdot \frac{{\ell}^{2} \cdot \left(n \cdot U\right)}{Om}\right)}^{0.5}\\
\mathbf{elif}\;\ell \leq 1.8 \cdot 10^{+275}:\\
\;\;\;\;\left|t\_1 \cdot \frac{\ell}{\frac{Om}{n}}\right|\\
\mathbf{else}:\\
\;\;\;\;\ell \cdot \left(\sqrt{\frac{-2}{Om}} \cdot \sqrt{2 \cdot \left(n \cdot U\right)}\right)\\
\end{array}
\end{array}
if l < 9.9999999999999993e44Initial program 53.7%
Simplified53.6%
Taylor expanded in t around inf 42.9%
add-cube-cbrt42.5%
pow342.5%
associate-*r*42.1%
*-commutative42.1%
Applied egg-rr42.1%
rem-cube-cbrt42.5%
add-sqr-sqrt42.4%
sqrt-unprod28.4%
pow228.4%
associate-*l*27.9%
Applied egg-rr27.9%
unpow227.9%
rem-sqrt-square41.5%
associate-*r*44.1%
*-commutative44.1%
associate-*r*44.6%
Simplified44.6%
if 9.9999999999999993e44 < l < 8.50000000000000015e58Initial program 76.7%
Simplified85.3%
Taylor expanded in n around 0 57.3%
associate-*r*62.4%
cancel-sign-sub-inv62.4%
metadata-eval62.4%
*-commutative62.4%
associate-*l/62.4%
Simplified62.4%
pow1/277.6%
associate-*r*77.6%
*-commutative77.6%
+-commutative77.6%
associate-/l*77.6%
fma-define77.6%
Applied egg-rr77.6%
Taylor expanded in l around inf 72.1%
associate-*r/72.1%
associate-*r*72.1%
*-commutative72.1%
Simplified72.1%
if 8.50000000000000015e58 < l < 9.59999999999999958e81Initial program 36.8%
Simplified36.8%
associate-*r*36.8%
fma-define36.8%
associate-*r*36.8%
Applied egg-rr36.8%
Taylor expanded in U around 0 4.8%
mul-1-neg4.8%
associate-/l*36.8%
unpow236.8%
unpow236.8%
times-frac36.8%
unpow236.8%
Simplified36.8%
Taylor expanded in n around inf 3.4%
associate-*r/3.4%
associate-*r*2.8%
Simplified2.8%
pow1/22.8%
Applied egg-rr36.7%
unpow1/236.7%
unpow236.7%
rem-sqrt-square40.7%
associate-/l*40.7%
*-commutative40.7%
associate-/l*40.7%
Simplified40.7%
associate-*r/40.7%
clear-num40.7%
Applied egg-rr40.7%
if 9.59999999999999958e81 < l < 1e108Initial program 35.9%
Simplified35.9%
associate-*r*35.9%
fma-define52.6%
associate-*r*52.6%
Applied egg-rr52.6%
Taylor expanded in U around 0 35.9%
mul-1-neg35.9%
associate-/l*52.6%
unpow252.6%
unpow252.6%
times-frac52.6%
unpow252.6%
Simplified52.6%
Taylor expanded in n around inf 35.6%
associate-*r/35.6%
associate-*r*35.6%
Simplified35.6%
pow1/235.6%
Applied egg-rr35.6%
unpow1/235.6%
unpow235.6%
rem-sqrt-square51.3%
associate-/l*51.3%
*-commutative51.3%
associate-/l*51.1%
Simplified51.1%
associate-*r*50.9%
clear-num50.9%
un-div-inv51.1%
associate-*r*51.1%
Applied egg-rr51.1%
if 1e108 < l < 2.0499999999999999e110Initial program 98.4%
Simplified100.0%
Taylor expanded in Om around inf 100.0%
associate-*r/100.0%
Simplified100.0%
Taylor expanded in t around 0 100.0%
associate-/l*100.0%
*-commutative100.0%
Simplified100.0%
if 2.0499999999999999e110 < l < 1.12e133Initial program 44.2%
Simplified44.2%
associate-*r*44.2%
fma-define58.5%
associate-*r*58.5%
Applied egg-rr58.5%
Taylor expanded in U around 0 44.2%
mul-1-neg44.2%
associate-/l*58.5%
unpow258.5%
unpow258.5%
times-frac58.5%
unpow258.5%
Simplified58.5%
Taylor expanded in n around inf 30.7%
associate-*r/30.7%
associate-*r*30.2%
Simplified30.2%
pow1/230.2%
Applied egg-rr45.3%
unpow1/245.3%
unpow245.3%
rem-sqrt-square58.7%
associate-/l*58.3%
*-commutative58.3%
associate-/l*71.9%
Simplified71.9%
if 1.12e133 < l < 2.70000000000000008e150Initial program 50.0%
Simplified98.4%
Taylor expanded in n around 0 51.7%
associate-*r*99.2%
cancel-sign-sub-inv99.2%
metadata-eval99.2%
*-commutative99.2%
associate-*l/99.2%
Simplified99.2%
pow1/299.2%
associate-*r*99.2%
*-commutative99.2%
+-commutative99.2%
associate-/l*100.0%
fma-define100.0%
Applied egg-rr100.0%
Taylor expanded in l around inf 3.3%
*-commutative3.3%
associate-*r*99.2%
Simplified99.2%
if 2.70000000000000008e150 < l < 1.7999999999999999e275Initial program 15.0%
Simplified31.2%
associate-*r*31.2%
fma-define34.4%
associate-*r*34.1%
Applied egg-rr34.1%
Taylor expanded in U around 0 17.1%
mul-1-neg17.1%
associate-/l*17.1%
unpow217.1%
unpow217.1%
times-frac34.2%
unpow234.2%
Simplified34.2%
Taylor expanded in n around inf 30.1%
associate-*r/30.1%
associate-*r*29.9%
Simplified29.9%
pow1/229.9%
Applied egg-rr34.5%
unpow1/234.5%
unpow234.5%
rem-sqrt-square34.6%
associate-/l*37.5%
*-commutative37.5%
associate-/l*46.5%
Simplified46.5%
clear-num46.6%
un-div-inv46.6%
Applied egg-rr46.6%
if 1.7999999999999999e275 < l Initial program 16.7%
Simplified29.9%
Taylor expanded in n around 0 18.4%
associate-*r*18.4%
cancel-sign-sub-inv18.4%
metadata-eval18.4%
*-commutative18.4%
associate-*l/18.4%
Simplified18.4%
pow1/218.4%
associate-*r*18.4%
*-commutative18.4%
+-commutative18.4%
associate-/l*18.4%
fma-define18.4%
Applied egg-rr18.4%
Taylor expanded in l around inf 18.4%
associate-*r/18.4%
*-commutative18.4%
associate-*r/18.4%
Simplified18.4%
*-un-lft-identity18.4%
unpow1/218.4%
*-commutative18.4%
sqrt-prod17.3%
sqrt-prod17.3%
sqrt-pow144.4%
metadata-eval44.4%
pow144.4%
Applied egg-rr44.4%
*-lft-identity44.4%
associate-*l*57.5%
*-commutative57.5%
Simplified57.5%
Final simplification47.4%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (fabs (/ (* l (sqrt (* U* (* 2.0 U)))) (/ Om n))))
(t_2 (* 2.0 (* n U))))
(if (<= l 2.02e-128)
(pow (* t t_2) 0.5)
(if (<= l 1.35e+55)
(sqrt (* (* 2.0 n) (* U (- t (/ (* 2.0 (pow l 2.0)) Om)))))
(if (<= l 2.3e+124)
t_1
(if (<= l 7.2e+155)
(pow (* t_2 (* (pow l 2.0) (/ -2.0 Om))) 0.5)
(if (<= l 6.2e+211)
t_1
(* l (* (sqrt (/ -2.0 Om)) (sqrt t_2))))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = fabs(((l * sqrt((U_42_ * (2.0 * U)))) / (Om / n)));
double t_2 = 2.0 * (n * U);
double tmp;
if (l <= 2.02e-128) {
tmp = pow((t * t_2), 0.5);
} else if (l <= 1.35e+55) {
tmp = sqrt(((2.0 * n) * (U * (t - ((2.0 * pow(l, 2.0)) / Om)))));
} else if (l <= 2.3e+124) {
tmp = t_1;
} else if (l <= 7.2e+155) {
tmp = pow((t_2 * (pow(l, 2.0) * (-2.0 / Om))), 0.5);
} else if (l <= 6.2e+211) {
tmp = t_1;
} else {
tmp = l * (sqrt((-2.0 / Om)) * sqrt(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 = abs(((l * sqrt((u_42 * (2.0d0 * u)))) / (om / n)))
t_2 = 2.0d0 * (n * u)
if (l <= 2.02d-128) then
tmp = (t * t_2) ** 0.5d0
else if (l <= 1.35d+55) then
tmp = sqrt(((2.0d0 * n) * (u * (t - ((2.0d0 * (l ** 2.0d0)) / om)))))
else if (l <= 2.3d+124) then
tmp = t_1
else if (l <= 7.2d+155) then
tmp = (t_2 * ((l ** 2.0d0) * ((-2.0d0) / om))) ** 0.5d0
else if (l <= 6.2d+211) then
tmp = t_1
else
tmp = l * (sqrt(((-2.0d0) / om)) * sqrt(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 = Math.abs(((l * Math.sqrt((U_42_ * (2.0 * U)))) / (Om / n)));
double t_2 = 2.0 * (n * U);
double tmp;
if (l <= 2.02e-128) {
tmp = Math.pow((t * t_2), 0.5);
} else if (l <= 1.35e+55) {
tmp = Math.sqrt(((2.0 * n) * (U * (t - ((2.0 * Math.pow(l, 2.0)) / Om)))));
} else if (l <= 2.3e+124) {
tmp = t_1;
} else if (l <= 7.2e+155) {
tmp = Math.pow((t_2 * (Math.pow(l, 2.0) * (-2.0 / Om))), 0.5);
} else if (l <= 6.2e+211) {
tmp = t_1;
} else {
tmp = l * (Math.sqrt((-2.0 / Om)) * Math.sqrt(t_2));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = math.fabs(((l * math.sqrt((U_42_ * (2.0 * U)))) / (Om / n))) t_2 = 2.0 * (n * U) tmp = 0 if l <= 2.02e-128: tmp = math.pow((t * t_2), 0.5) elif l <= 1.35e+55: tmp = math.sqrt(((2.0 * n) * (U * (t - ((2.0 * math.pow(l, 2.0)) / Om))))) elif l <= 2.3e+124: tmp = t_1 elif l <= 7.2e+155: tmp = math.pow((t_2 * (math.pow(l, 2.0) * (-2.0 / Om))), 0.5) elif l <= 6.2e+211: tmp = t_1 else: tmp = l * (math.sqrt((-2.0 / Om)) * math.sqrt(t_2)) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = abs(Float64(Float64(l * sqrt(Float64(U_42_ * Float64(2.0 * U)))) / Float64(Om / n))) t_2 = Float64(2.0 * Float64(n * U)) tmp = 0.0 if (l <= 2.02e-128) tmp = Float64(t * t_2) ^ 0.5; elseif (l <= 1.35e+55) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t - Float64(Float64(2.0 * (l ^ 2.0)) / Om))))); elseif (l <= 2.3e+124) tmp = t_1; elseif (l <= 7.2e+155) tmp = Float64(t_2 * Float64((l ^ 2.0) * Float64(-2.0 / Om))) ^ 0.5; elseif (l <= 6.2e+211) tmp = t_1; else tmp = Float64(l * Float64(sqrt(Float64(-2.0 / Om)) * sqrt(t_2))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = abs(((l * sqrt((U_42_ * (2.0 * U)))) / (Om / n))); t_2 = 2.0 * (n * U); tmp = 0.0; if (l <= 2.02e-128) tmp = (t * t_2) ^ 0.5; elseif (l <= 1.35e+55) tmp = sqrt(((2.0 * n) * (U * (t - ((2.0 * (l ^ 2.0)) / Om))))); elseif (l <= 2.3e+124) tmp = t_1; elseif (l <= 7.2e+155) tmp = (t_2 * ((l ^ 2.0) * (-2.0 / Om))) ^ 0.5; elseif (l <= 6.2e+211) tmp = t_1; else tmp = l * (sqrt((-2.0 / Om)) * sqrt(t_2)); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[Abs[N[(N[(l * N[Sqrt[N[(U$42$ * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(Om / n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, 2.02e-128], N[Power[N[(t * t$95$2), $MachinePrecision], 0.5], $MachinePrecision], If[LessEqual[l, 1.35e+55], 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[l, 2.3e+124], t$95$1, If[LessEqual[l, 7.2e+155], N[Power[N[(t$95$2 * N[(N[Power[l, 2.0], $MachinePrecision] * N[(-2.0 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], If[LessEqual[l, 6.2e+211], t$95$1, N[(l * N[(N[Sqrt[N[(-2.0 / Om), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t$95$2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \left|\frac{\ell \cdot \sqrt{U* \cdot \left(2 \cdot U\right)}}{\frac{Om}{n}}\right|\\
t_2 := 2 \cdot \left(n \cdot U\right)\\
\mathbf{if}\;\ell \leq 2.02 \cdot 10^{-128}:\\
\;\;\;\;{\left(t \cdot t\_2\right)}^{0.5}\\
\mathbf{elif}\;\ell \leq 1.35 \cdot 10^{+55}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t - \frac{2 \cdot {\ell}^{2}}{Om}\right)\right)}\\
\mathbf{elif}\;\ell \leq 2.3 \cdot 10^{+124}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;\ell \leq 7.2 \cdot 10^{+155}:\\
\;\;\;\;{\left(t\_2 \cdot \left({\ell}^{2} \cdot \frac{-2}{Om}\right)\right)}^{0.5}\\
\mathbf{elif}\;\ell \leq 6.2 \cdot 10^{+211}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\ell \cdot \left(\sqrt{\frac{-2}{Om}} \cdot \sqrt{t\_2}\right)\\
\end{array}
\end{array}
if l < 2.0199999999999999e-128Initial program 51.6%
Simplified51.5%
Taylor expanded in n around 0 42.1%
associate-*r*41.6%
cancel-sign-sub-inv41.6%
metadata-eval41.6%
*-commutative41.6%
associate-*l/41.6%
Simplified41.6%
pow1/246.1%
associate-*r*46.1%
*-commutative46.1%
+-commutative46.1%
associate-/l*46.1%
fma-define46.1%
Applied egg-rr46.1%
Taylor expanded in l around 0 40.8%
if 2.0199999999999999e-128 < l < 1.34999999999999988e55Initial program 66.0%
Simplified65.9%
Taylor expanded in Om around inf 63.4%
associate-*r/63.4%
Simplified63.4%
if 1.34999999999999988e55 < l < 2.29999999999999985e124 or 7.20000000000000015e155 < l < 6.2000000000000003e211Initial program 36.5%
Simplified43.3%
associate-*r*43.3%
fma-define49.9%
associate-*r*49.8%
Applied egg-rr49.8%
Taylor expanded in U around 0 29.4%
mul-1-neg29.4%
associate-/l*42.6%
unpow242.6%
unpow242.6%
times-frac49.8%
unpow249.8%
Simplified49.8%
Taylor expanded in n around inf 28.3%
associate-*r/28.3%
associate-*r*28.1%
Simplified28.1%
pow1/228.1%
Applied egg-rr38.6%
unpow1/238.6%
unpow238.6%
rem-sqrt-square42.2%
associate-/l*42.1%
*-commutative42.1%
associate-/l*48.2%
Simplified48.2%
associate-*r*48.2%
clear-num48.2%
un-div-inv48.3%
associate-*r*48.3%
Applied egg-rr48.3%
if 2.29999999999999985e124 < l < 7.20000000000000015e155Initial program 43.5%
Simplified57.6%
Taylor expanded in n around 0 44.0%
associate-*r*57.6%
cancel-sign-sub-inv57.6%
metadata-eval57.6%
*-commutative57.6%
associate-*l/57.6%
Simplified57.6%
pow1/286.2%
associate-*r*86.2%
*-commutative86.2%
+-commutative86.2%
associate-/l*86.4%
fma-define86.4%
Applied egg-rr86.4%
Taylor expanded in l around inf 86.2%
associate-*r/86.2%
*-commutative86.2%
associate-*r/86.4%
Simplified86.4%
if 6.2000000000000003e211 < l Initial program 7.0%
Simplified33.5%
Taylor expanded in n around 0 12.8%
associate-*r*7.8%
cancel-sign-sub-inv7.8%
metadata-eval7.8%
*-commutative7.8%
associate-*l/7.8%
Simplified7.8%
pow1/212.7%
associate-*r*12.7%
*-commutative12.7%
+-commutative12.7%
associate-/l*12.7%
fma-define12.7%
Applied egg-rr12.7%
Taylor expanded in l around inf 12.7%
associate-*r/12.7%
*-commutative12.7%
associate-*r/12.7%
Simplified12.7%
*-un-lft-identity12.7%
unpow1/27.8%
*-commutative7.8%
sqrt-prod6.5%
sqrt-prod6.5%
sqrt-pow132.8%
metadata-eval32.8%
pow132.8%
Applied egg-rr32.8%
*-lft-identity32.8%
associate-*l*37.0%
*-commutative37.0%
Simplified37.0%
Final simplification45.8%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* n (* U t))) (t_2 (* 2.0 (* n U))))
(if (<= l 7.5e+64)
(sqrt (* 2.0 (* (* n U) (+ t (/ (* -2.0 (pow l 2.0)) Om)))))
(if (<= l 1.75e+126)
(fabs (/ (* l (sqrt (* U* (* 2.0 U)))) (/ Om n)))
(if (<= l 3.6e+151)
(pow (* t_2 (* (pow l 2.0) (/ -2.0 Om))) 0.5)
(if (<= l 2.7e+156)
(pow (* (* t_1 t_1) 4.0) 0.25)
(if (<= l 1.36e+206)
(fabs (* (sqrt (* 2.0 (* U U*))) (/ l (/ Om n))))
(* l (* (sqrt (/ -2.0 Om)) (sqrt t_2))))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = n * (U * t);
double t_2 = 2.0 * (n * U);
double tmp;
if (l <= 7.5e+64) {
tmp = sqrt((2.0 * ((n * U) * (t + ((-2.0 * pow(l, 2.0)) / Om)))));
} else if (l <= 1.75e+126) {
tmp = fabs(((l * sqrt((U_42_ * (2.0 * U)))) / (Om / n)));
} else if (l <= 3.6e+151) {
tmp = pow((t_2 * (pow(l, 2.0) * (-2.0 / Om))), 0.5);
} else if (l <= 2.7e+156) {
tmp = pow(((t_1 * t_1) * 4.0), 0.25);
} else if (l <= 1.36e+206) {
tmp = fabs((sqrt((2.0 * (U * U_42_))) * (l / (Om / n))));
} else {
tmp = l * (sqrt((-2.0 / Om)) * sqrt(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 = n * (u * t)
t_2 = 2.0d0 * (n * u)
if (l <= 7.5d+64) then
tmp = sqrt((2.0d0 * ((n * u) * (t + (((-2.0d0) * (l ** 2.0d0)) / om)))))
else if (l <= 1.75d+126) then
tmp = abs(((l * sqrt((u_42 * (2.0d0 * u)))) / (om / n)))
else if (l <= 3.6d+151) then
tmp = (t_2 * ((l ** 2.0d0) * ((-2.0d0) / om))) ** 0.5d0
else if (l <= 2.7d+156) then
tmp = ((t_1 * t_1) * 4.0d0) ** 0.25d0
else if (l <= 1.36d+206) then
tmp = abs((sqrt((2.0d0 * (u * u_42))) * (l / (om / n))))
else
tmp = l * (sqrt(((-2.0d0) / om)) * sqrt(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 = n * (U * t);
double t_2 = 2.0 * (n * U);
double tmp;
if (l <= 7.5e+64) {
tmp = Math.sqrt((2.0 * ((n * U) * (t + ((-2.0 * Math.pow(l, 2.0)) / Om)))));
} else if (l <= 1.75e+126) {
tmp = Math.abs(((l * Math.sqrt((U_42_ * (2.0 * U)))) / (Om / n)));
} else if (l <= 3.6e+151) {
tmp = Math.pow((t_2 * (Math.pow(l, 2.0) * (-2.0 / Om))), 0.5);
} else if (l <= 2.7e+156) {
tmp = Math.pow(((t_1 * t_1) * 4.0), 0.25);
} else if (l <= 1.36e+206) {
tmp = Math.abs((Math.sqrt((2.0 * (U * U_42_))) * (l / (Om / n))));
} else {
tmp = l * (Math.sqrt((-2.0 / Om)) * Math.sqrt(t_2));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = n * (U * t) t_2 = 2.0 * (n * U) tmp = 0 if l <= 7.5e+64: tmp = math.sqrt((2.0 * ((n * U) * (t + ((-2.0 * math.pow(l, 2.0)) / Om))))) elif l <= 1.75e+126: tmp = math.fabs(((l * math.sqrt((U_42_ * (2.0 * U)))) / (Om / n))) elif l <= 3.6e+151: tmp = math.pow((t_2 * (math.pow(l, 2.0) * (-2.0 / Om))), 0.5) elif l <= 2.7e+156: tmp = math.pow(((t_1 * t_1) * 4.0), 0.25) elif l <= 1.36e+206: tmp = math.fabs((math.sqrt((2.0 * (U * U_42_))) * (l / (Om / n)))) else: tmp = l * (math.sqrt((-2.0 / Om)) * math.sqrt(t_2)) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(n * Float64(U * t)) t_2 = Float64(2.0 * Float64(n * U)) tmp = 0.0 if (l <= 7.5e+64) tmp = sqrt(Float64(2.0 * Float64(Float64(n * U) * Float64(t + Float64(Float64(-2.0 * (l ^ 2.0)) / Om))))); elseif (l <= 1.75e+126) tmp = abs(Float64(Float64(l * sqrt(Float64(U_42_ * Float64(2.0 * U)))) / Float64(Om / n))); elseif (l <= 3.6e+151) tmp = Float64(t_2 * Float64((l ^ 2.0) * Float64(-2.0 / Om))) ^ 0.5; elseif (l <= 2.7e+156) tmp = Float64(Float64(t_1 * t_1) * 4.0) ^ 0.25; elseif (l <= 1.36e+206) tmp = abs(Float64(sqrt(Float64(2.0 * Float64(U * U_42_))) * Float64(l / Float64(Om / n)))); else tmp = Float64(l * Float64(sqrt(Float64(-2.0 / Om)) * sqrt(t_2))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = n * (U * t); t_2 = 2.0 * (n * U); tmp = 0.0; if (l <= 7.5e+64) tmp = sqrt((2.0 * ((n * U) * (t + ((-2.0 * (l ^ 2.0)) / Om))))); elseif (l <= 1.75e+126) tmp = abs(((l * sqrt((U_42_ * (2.0 * U)))) / (Om / n))); elseif (l <= 3.6e+151) tmp = (t_2 * ((l ^ 2.0) * (-2.0 / Om))) ^ 0.5; elseif (l <= 2.7e+156) tmp = ((t_1 * t_1) * 4.0) ^ 0.25; elseif (l <= 1.36e+206) tmp = abs((sqrt((2.0 * (U * U_42_))) * (l / (Om / n)))); else tmp = l * (sqrt((-2.0 / Om)) * sqrt(t_2)); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(n * N[(U * t), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, 7.5e+64], N[Sqrt[N[(2.0 * N[(N[(n * U), $MachinePrecision] * N[(t + N[(N[(-2.0 * N[Power[l, 2.0], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 1.75e+126], N[Abs[N[(N[(l * N[Sqrt[N[(U$42$ * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(Om / n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 3.6e+151], N[Power[N[(t$95$2 * N[(N[Power[l, 2.0], $MachinePrecision] * N[(-2.0 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], If[LessEqual[l, 2.7e+156], N[Power[N[(N[(t$95$1 * t$95$1), $MachinePrecision] * 4.0), $MachinePrecision], 0.25], $MachinePrecision], If[LessEqual[l, 1.36e+206], N[Abs[N[(N[Sqrt[N[(2.0 * N[(U * U$42$), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(l / N[(Om / n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(l * N[(N[Sqrt[N[(-2.0 / Om), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t$95$2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := n \cdot \left(U \cdot t\right)\\
t_2 := 2 \cdot \left(n \cdot U\right)\\
\mathbf{if}\;\ell \leq 7.5 \cdot 10^{+64}:\\
\;\;\;\;\sqrt{2 \cdot \left(\left(n \cdot U\right) \cdot \left(t + \frac{-2 \cdot {\ell}^{2}}{Om}\right)\right)}\\
\mathbf{elif}\;\ell \leq 1.75 \cdot 10^{+126}:\\
\;\;\;\;\left|\frac{\ell \cdot \sqrt{U* \cdot \left(2 \cdot U\right)}}{\frac{Om}{n}}\right|\\
\mathbf{elif}\;\ell \leq 3.6 \cdot 10^{+151}:\\
\;\;\;\;{\left(t\_2 \cdot \left({\ell}^{2} \cdot \frac{-2}{Om}\right)\right)}^{0.5}\\
\mathbf{elif}\;\ell \leq 2.7 \cdot 10^{+156}:\\
\;\;\;\;{\left(\left(t\_1 \cdot t\_1\right) \cdot 4\right)}^{0.25}\\
\mathbf{elif}\;\ell \leq 1.36 \cdot 10^{+206}:\\
\;\;\;\;\left|\sqrt{2 \cdot \left(U \cdot U*\right)} \cdot \frac{\ell}{\frac{Om}{n}}\right|\\
\mathbf{else}:\\
\;\;\;\;\ell \cdot \left(\sqrt{\frac{-2}{Om}} \cdot \sqrt{t\_2}\right)\\
\end{array}
\end{array}
if l < 7.5000000000000005e64Initial program 54.5%
Simplified54.7%
Taylor expanded in n around 0 47.1%
associate-*r*45.9%
cancel-sign-sub-inv45.9%
metadata-eval45.9%
*-commutative45.9%
associate-*l/45.9%
Simplified45.9%
if 7.5000000000000005e64 < l < 1.7500000000000001e126Initial program 35.7%
Simplified35.8%
associate-*r*35.8%
fma-define49.2%
associate-*r*49.2%
Applied egg-rr49.2%
Taylor expanded in U around 0 22.7%
mul-1-neg22.7%
associate-/l*49.2%
unpow249.2%
unpow249.2%
times-frac49.2%
unpow249.2%
Simplified49.2%
Taylor expanded in n around inf 22.6%
associate-*r/22.6%
associate-*r*22.2%
Simplified22.2%
pow1/222.2%
Applied egg-rr36.0%
unpow1/236.0%
unpow236.0%
rem-sqrt-square49.4%
associate-/l*49.2%
*-commutative49.2%
associate-/l*55.2%
Simplified55.2%
associate-*r*55.2%
clear-num55.2%
un-div-inv55.1%
associate-*r*55.1%
Applied egg-rr55.1%
if 1.7500000000000001e126 < l < 3.6e151Initial program 74.6%
Simplified99.2%
Taylor expanded in n around 0 75.5%
associate-*r*99.2%
cancel-sign-sub-inv99.2%
metadata-eval99.2%
*-commutative99.2%
associate-*l/99.2%
Simplified99.2%
pow1/299.2%
associate-*r*99.2%
*-commutative99.2%
+-commutative99.2%
associate-/l*99.6%
fma-define99.6%
Applied egg-rr99.6%
Taylor expanded in l around inf 99.2%
associate-*r/99.2%
*-commutative99.2%
associate-*r/99.6%
Simplified99.6%
if 3.6e151 < l < 2.7e156Initial program 0.0%
Simplified0.0%
Taylor expanded in t around inf 100.0%
add-cube-cbrt100.0%
pow3100.0%
associate-*r*100.0%
*-commutative100.0%
Applied egg-rr100.0%
pow1/2100.0%
rem-cube-cbrt100.0%
associate-*l*100.0%
sqr-pow100.0%
pow-prod-down100.0%
associate-*l*100.0%
associate-*l*100.0%
*-commutative100.0%
*-commutative100.0%
swap-sqr100.0%
pow2100.0%
associate-*l*100.0%
metadata-eval100.0%
metadata-eval100.0%
Applied egg-rr100.0%
unpow2100.0%
Applied egg-rr100.0%
if 2.7e156 < l < 1.36e206Initial program 23.4%
Simplified37.7%
associate-*r*37.7%
fma-define44.9%
associate-*r*44.5%
Applied egg-rr44.5%
Taylor expanded in U around 0 29.3%
mul-1-neg29.3%
associate-/l*29.3%
unpow229.3%
unpow229.3%
times-frac44.5%
unpow244.5%
Simplified44.5%
Taylor expanded in n around inf 36.4%
associate-*r/36.4%
associate-*r*36.4%
Simplified36.4%
pow1/236.4%
Applied egg-rr44.1%
unpow1/244.1%
unpow244.1%
rem-sqrt-square44.1%
associate-/l*44.1%
*-commutative44.1%
associate-/l*50.7%
Simplified50.7%
clear-num50.9%
un-div-inv50.9%
Applied egg-rr50.9%
if 1.36e206 < l Initial program 11.1%
Simplified36.3%
Taylor expanded in n around 0 16.6%
associate-*r*11.8%
cancel-sign-sub-inv11.8%
metadata-eval11.8%
*-commutative11.8%
associate-*l/11.8%
Simplified11.8%
pow1/216.5%
associate-*r*16.5%
*-commutative16.5%
+-commutative16.5%
associate-/l*16.5%
fma-define16.5%
Applied egg-rr16.5%
Taylor expanded in l around inf 16.5%
associate-*r/16.5%
*-commutative16.5%
associate-*r/16.5%
Simplified16.5%
*-un-lft-identity16.5%
unpow1/211.8%
*-commutative11.8%
sqrt-prod6.2%
sqrt-prod6.2%
sqrt-pow131.4%
metadata-eval31.4%
pow131.4%
Applied egg-rr31.4%
*-lft-identity31.4%
associate-*l*35.4%
*-commutative35.4%
Simplified35.4%
Final simplification46.8%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (pow (* 2.0 (* U (* n (+ t (* -2.0 (/ (pow l 2.0) Om)))))) 0.5)))
(if (<= l 1.12e+61)
t_1
(if (<= l 1.6e+108)
(fabs (/ (* l (sqrt (* U* (* 2.0 U)))) (/ Om n)))
(if (<= l 7.5e+136)
t_1
(if (<= l 1.95e+275)
(fabs (* (sqrt (* 2.0 (* U U*))) (/ l (/ Om n))))
(* l (* (sqrt (/ -2.0 Om)) (sqrt (* 2.0 (* n U)))))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = pow((2.0 * (U * (n * (t + (-2.0 * (pow(l, 2.0) / Om)))))), 0.5);
double tmp;
if (l <= 1.12e+61) {
tmp = t_1;
} else if (l <= 1.6e+108) {
tmp = fabs(((l * sqrt((U_42_ * (2.0 * U)))) / (Om / n)));
} else if (l <= 7.5e+136) {
tmp = t_1;
} else if (l <= 1.95e+275) {
tmp = fabs((sqrt((2.0 * (U * U_42_))) * (l / (Om / n))));
} else {
tmp = l * (sqrt((-2.0 / Om)) * sqrt((2.0 * (n * U))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: t_1
real(8) :: tmp
t_1 = (2.0d0 * (u * (n * (t + ((-2.0d0) * ((l ** 2.0d0) / om)))))) ** 0.5d0
if (l <= 1.12d+61) then
tmp = t_1
else if (l <= 1.6d+108) then
tmp = abs(((l * sqrt((u_42 * (2.0d0 * u)))) / (om / n)))
else if (l <= 7.5d+136) then
tmp = t_1
else if (l <= 1.95d+275) then
tmp = abs((sqrt((2.0d0 * (u * u_42))) * (l / (om / n))))
else
tmp = l * (sqrt(((-2.0d0) / om)) * sqrt((2.0d0 * (n * u))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = Math.pow((2.0 * (U * (n * (t + (-2.0 * (Math.pow(l, 2.0) / Om)))))), 0.5);
double tmp;
if (l <= 1.12e+61) {
tmp = t_1;
} else if (l <= 1.6e+108) {
tmp = Math.abs(((l * Math.sqrt((U_42_ * (2.0 * U)))) / (Om / n)));
} else if (l <= 7.5e+136) {
tmp = t_1;
} else if (l <= 1.95e+275) {
tmp = Math.abs((Math.sqrt((2.0 * (U * U_42_))) * (l / (Om / n))));
} else {
tmp = l * (Math.sqrt((-2.0 / Om)) * Math.sqrt((2.0 * (n * U))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = math.pow((2.0 * (U * (n * (t + (-2.0 * (math.pow(l, 2.0) / Om)))))), 0.5) tmp = 0 if l <= 1.12e+61: tmp = t_1 elif l <= 1.6e+108: tmp = math.fabs(((l * math.sqrt((U_42_ * (2.0 * U)))) / (Om / n))) elif l <= 7.5e+136: tmp = t_1 elif l <= 1.95e+275: tmp = math.fabs((math.sqrt((2.0 * (U * U_42_))) * (l / (Om / n)))) else: tmp = l * (math.sqrt((-2.0 / Om)) * math.sqrt((2.0 * (n * U)))) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(2.0 * Float64(U * Float64(n * Float64(t + Float64(-2.0 * Float64((l ^ 2.0) / Om)))))) ^ 0.5 tmp = 0.0 if (l <= 1.12e+61) tmp = t_1; elseif (l <= 1.6e+108) tmp = abs(Float64(Float64(l * sqrt(Float64(U_42_ * Float64(2.0 * U)))) / Float64(Om / n))); elseif (l <= 7.5e+136) tmp = t_1; elseif (l <= 1.95e+275) tmp = abs(Float64(sqrt(Float64(2.0 * Float64(U * U_42_))) * Float64(l / Float64(Om / n)))); else tmp = Float64(l * Float64(sqrt(Float64(-2.0 / Om)) * sqrt(Float64(2.0 * Float64(n * U))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = (2.0 * (U * (n * (t + (-2.0 * ((l ^ 2.0) / Om)))))) ^ 0.5; tmp = 0.0; if (l <= 1.12e+61) tmp = t_1; elseif (l <= 1.6e+108) tmp = abs(((l * sqrt((U_42_ * (2.0 * U)))) / (Om / n))); elseif (l <= 7.5e+136) tmp = t_1; elseif (l <= 1.95e+275) tmp = abs((sqrt((2.0 * (U * U_42_))) * (l / (Om / n)))); else tmp = l * (sqrt((-2.0 / Om)) * sqrt((2.0 * (n * U)))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[Power[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], 0.5], $MachinePrecision]}, If[LessEqual[l, 1.12e+61], t$95$1, If[LessEqual[l, 1.6e+108], N[Abs[N[(N[(l * N[Sqrt[N[(U$42$ * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(Om / n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 7.5e+136], t$95$1, If[LessEqual[l, 1.95e+275], N[Abs[N[(N[Sqrt[N[(2.0 * N[(U * U$42$), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(l / N[(Om / n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(l * N[(N[Sqrt[N[(-2.0 / Om), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := {\left(2 \cdot \left(U \cdot \left(n \cdot \left(t + -2 \cdot \frac{{\ell}^{2}}{Om}\right)\right)\right)\right)}^{0.5}\\
\mathbf{if}\;\ell \leq 1.12 \cdot 10^{+61}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;\ell \leq 1.6 \cdot 10^{+108}:\\
\;\;\;\;\left|\frac{\ell \cdot \sqrt{U* \cdot \left(2 \cdot U\right)}}{\frac{Om}{n}}\right|\\
\mathbf{elif}\;\ell \leq 7.5 \cdot 10^{+136}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;\ell \leq 1.95 \cdot 10^{+275}:\\
\;\;\;\;\left|\sqrt{2 \cdot \left(U \cdot U*\right)} \cdot \frac{\ell}{\frac{Om}{n}}\right|\\
\mathbf{else}:\\
\;\;\;\;\ell \cdot \left(\sqrt{\frac{-2}{Om}} \cdot \sqrt{2 \cdot \left(n \cdot U\right)}\right)\\
\end{array}
\end{array}
if l < 1.12e61 or 1.6e108 < l < 7.5000000000000002e136Initial program 54.3%
Simplified54.6%
Taylor expanded in n around 0 47.1%
associate-*r*46.1%
cancel-sign-sub-inv46.1%
metadata-eval46.1%
*-commutative46.1%
associate-*l/46.1%
Simplified46.1%
pow1/250.6%
associate-*r*50.6%
*-commutative50.6%
+-commutative50.6%
associate-/l*50.6%
fma-define50.6%
Applied egg-rr50.6%
Taylor expanded in n around 0 51.7%
if 1.12e61 < l < 1.6e108Initial program 36.2%
Simplified36.2%
associate-*r*36.2%
fma-define47.3%
associate-*r*47.3%
Applied egg-rr47.3%
Taylor expanded in U around 0 25.5%
mul-1-neg25.5%
associate-/l*47.3%
unpow247.3%
unpow247.3%
times-frac47.3%
unpow247.3%
Simplified47.3%
Taylor expanded in n around inf 24.9%
associate-*r/24.9%
associate-*r*24.7%
Simplified24.7%
pow1/224.7%
Applied egg-rr36.0%
unpow1/236.0%
unpow236.0%
rem-sqrt-square47.8%
associate-/l*47.8%
*-commutative47.8%
associate-/l*47.6%
Simplified47.6%
associate-*r*47.5%
clear-num47.5%
un-div-inv47.6%
associate-*r*47.6%
Applied egg-rr47.6%
if 7.5000000000000002e136 < l < 1.95e275Initial program 17.1%
Simplified32.3%
associate-*r*32.3%
fma-define35.3%
associate-*r*38.0%
Applied egg-rr38.0%
Taylor expanded in U around 0 22.1%
mul-1-neg22.1%
associate-/l*22.1%
unpow222.1%
unpow222.1%
times-frac38.1%
unpow238.1%
Simplified38.1%
Taylor expanded in n around inf 28.2%
associate-*r/28.2%
associate-*r*28.1%
Simplified28.1%
pow1/228.1%
Applied egg-rr32.6%
unpow1/232.6%
unpow232.6%
rem-sqrt-square32.7%
associate-/l*35.5%
*-commutative35.5%
associate-/l*44.0%
Simplified44.0%
clear-num44.0%
un-div-inv44.0%
Applied egg-rr44.0%
if 1.95e275 < l Initial program 16.7%
Simplified29.9%
Taylor expanded in n around 0 18.4%
associate-*r*18.4%
cancel-sign-sub-inv18.4%
metadata-eval18.4%
*-commutative18.4%
associate-*l/18.4%
Simplified18.4%
pow1/218.4%
associate-*r*18.4%
*-commutative18.4%
+-commutative18.4%
associate-/l*18.4%
fma-define18.4%
Applied egg-rr18.4%
Taylor expanded in l around inf 18.4%
associate-*r/18.4%
*-commutative18.4%
associate-*r/18.4%
Simplified18.4%
*-un-lft-identity18.4%
unpow1/218.4%
*-commutative18.4%
sqrt-prod17.3%
sqrt-prod17.3%
sqrt-pow144.4%
metadata-eval44.4%
pow144.4%
Applied egg-rr44.4%
*-lft-identity44.4%
associate-*l*57.5%
*-commutative57.5%
Simplified57.5%
Final simplification50.7%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (sqrt (* 2.0 (fabs (* U (* n t)))))))
(if (<= Om -3.8e-75)
t_1
(if (<= Om 1.65e+15)
(fabs (/ (* l (sqrt (* U* (* 2.0 U)))) (/ Om n)))
(if (<= Om 1.05e+242) t_1 (* (sqrt (* (* 2.0 n) U)) (sqrt t)))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = sqrt((2.0 * fabs((U * (n * t)))));
double tmp;
if (Om <= -3.8e-75) {
tmp = t_1;
} else if (Om <= 1.65e+15) {
tmp = fabs(((l * sqrt((U_42_ * (2.0 * U)))) / (Om / n)));
} else if (Om <= 1.05e+242) {
tmp = t_1;
} else {
tmp = sqrt(((2.0 * n) * 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 = sqrt((2.0d0 * abs((u * (n * t)))))
if (om <= (-3.8d-75)) then
tmp = t_1
else if (om <= 1.65d+15) then
tmp = abs(((l * sqrt((u_42 * (2.0d0 * u)))) / (om / n)))
else if (om <= 1.05d+242) then
tmp = t_1
else
tmp = sqrt(((2.0d0 * n) * 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 = Math.sqrt((2.0 * Math.abs((U * (n * t)))));
double tmp;
if (Om <= -3.8e-75) {
tmp = t_1;
} else if (Om <= 1.65e+15) {
tmp = Math.abs(((l * Math.sqrt((U_42_ * (2.0 * U)))) / (Om / n)));
} else if (Om <= 1.05e+242) {
tmp = t_1;
} else {
tmp = Math.sqrt(((2.0 * n) * U)) * Math.sqrt(t);
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = math.sqrt((2.0 * math.fabs((U * (n * t))))) tmp = 0 if Om <= -3.8e-75: tmp = t_1 elif Om <= 1.65e+15: tmp = math.fabs(((l * math.sqrt((U_42_ * (2.0 * U)))) / (Om / n))) elif Om <= 1.05e+242: tmp = t_1 else: tmp = math.sqrt(((2.0 * n) * U)) * math.sqrt(t) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = sqrt(Float64(2.0 * abs(Float64(U * Float64(n * t))))) tmp = 0.0 if (Om <= -3.8e-75) tmp = t_1; elseif (Om <= 1.65e+15) tmp = abs(Float64(Float64(l * sqrt(Float64(U_42_ * Float64(2.0 * U)))) / Float64(Om / n))); elseif (Om <= 1.05e+242) tmp = t_1; else tmp = Float64(sqrt(Float64(Float64(2.0 * n) * U)) * sqrt(t)); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = sqrt((2.0 * abs((U * (n * t))))); tmp = 0.0; if (Om <= -3.8e-75) tmp = t_1; elseif (Om <= 1.65e+15) tmp = abs(((l * sqrt((U_42_ * (2.0 * U)))) / (Om / n))); elseif (Om <= 1.05e+242) tmp = t_1; else tmp = sqrt(((2.0 * n) * U)) * sqrt(t); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[Sqrt[N[(2.0 * N[Abs[N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[Om, -3.8e-75], t$95$1, If[LessEqual[Om, 1.65e+15], N[Abs[N[(N[(l * N[Sqrt[N[(U$42$ * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(Om / n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[Om, 1.05e+242], t$95$1, N[(N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \sqrt{2 \cdot \left|U \cdot \left(n \cdot t\right)\right|}\\
\mathbf{if}\;Om \leq -3.8 \cdot 10^{-75}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;Om \leq 1.65 \cdot 10^{+15}:\\
\;\;\;\;\left|\frac{\ell \cdot \sqrt{U* \cdot \left(2 \cdot U\right)}}{\frac{Om}{n}}\right|\\
\mathbf{elif}\;Om \leq 1.05 \cdot 10^{+242}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot U} \cdot \sqrt{t}\\
\end{array}
\end{array}
if Om < -3.79999999999999994e-75 or 1.65e15 < Om < 1.05e242Initial program 55.7%
Simplified62.5%
Taylor expanded in t around inf 49.6%
add-cube-cbrt49.1%
pow349.1%
associate-*r*45.5%
*-commutative45.5%
Applied egg-rr45.5%
rem-cube-cbrt46.0%
add-sqr-sqrt45.9%
sqrt-unprod27.1%
pow227.1%
associate-*l*27.8%
Applied egg-rr27.8%
unpow227.8%
rem-sqrt-square46.1%
associate-*r*46.8%
*-commutative46.8%
associate-*r*50.5%
Simplified50.5%
if -3.79999999999999994e-75 < Om < 1.65e15Initial program 38.8%
Simplified38.8%
associate-*r*38.8%
fma-define42.9%
associate-*r*41.9%
Applied egg-rr41.9%
Taylor expanded in U around 0 28.2%
mul-1-neg28.2%
associate-/l*27.2%
unpow227.2%
unpow227.2%
times-frac42.1%
unpow242.1%
Simplified42.1%
Taylor expanded in n around inf 26.7%
associate-*r/26.7%
associate-*r*26.4%
Simplified26.4%
pow1/226.5%
Applied egg-rr46.9%
unpow1/246.9%
unpow246.9%
rem-sqrt-square59.5%
associate-/l*57.6%
*-commutative57.6%
associate-/l*59.1%
Simplified59.1%
associate-*r*59.2%
clear-num59.2%
un-div-inv59.2%
associate-*r*59.4%
Applied egg-rr59.4%
if 1.05e242 < Om Initial program 43.2%
Simplified49.2%
Taylor expanded in t around inf 29.7%
*-un-lft-identity29.7%
associate-*r*35.4%
*-commutative35.4%
Applied egg-rr35.4%
*-lft-identity35.4%
associate-*r*35.4%
associate-*r*35.4%
Simplified35.4%
sqrt-prod40.0%
*-commutative40.0%
*-commutative40.0%
Applied egg-rr40.0%
Final simplification52.9%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (sqrt (* 2.0 (fabs (* U (* n t)))))))
(if (<= Om -2.3e-74)
t_1
(if (<= Om 3200000000000.0)
(fabs (* (sqrt (* 2.0 (* U U*))) (/ l (/ Om n))))
(if (<= Om 8.2e+273) t_1 (* (sqrt (* (* 2.0 n) U)) (sqrt t)))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = sqrt((2.0 * fabs((U * (n * t)))));
double tmp;
if (Om <= -2.3e-74) {
tmp = t_1;
} else if (Om <= 3200000000000.0) {
tmp = fabs((sqrt((2.0 * (U * U_42_))) * (l / (Om / n))));
} else if (Om <= 8.2e+273) {
tmp = t_1;
} else {
tmp = sqrt(((2.0 * n) * 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 = sqrt((2.0d0 * abs((u * (n * t)))))
if (om <= (-2.3d-74)) then
tmp = t_1
else if (om <= 3200000000000.0d0) then
tmp = abs((sqrt((2.0d0 * (u * u_42))) * (l / (om / n))))
else if (om <= 8.2d+273) then
tmp = t_1
else
tmp = sqrt(((2.0d0 * n) * 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 = Math.sqrt((2.0 * Math.abs((U * (n * t)))));
double tmp;
if (Om <= -2.3e-74) {
tmp = t_1;
} else if (Om <= 3200000000000.0) {
tmp = Math.abs((Math.sqrt((2.0 * (U * U_42_))) * (l / (Om / n))));
} else if (Om <= 8.2e+273) {
tmp = t_1;
} else {
tmp = Math.sqrt(((2.0 * n) * U)) * Math.sqrt(t);
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = math.sqrt((2.0 * math.fabs((U * (n * t))))) tmp = 0 if Om <= -2.3e-74: tmp = t_1 elif Om <= 3200000000000.0: tmp = math.fabs((math.sqrt((2.0 * (U * U_42_))) * (l / (Om / n)))) elif Om <= 8.2e+273: tmp = t_1 else: tmp = math.sqrt(((2.0 * n) * U)) * math.sqrt(t) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = sqrt(Float64(2.0 * abs(Float64(U * Float64(n * t))))) tmp = 0.0 if (Om <= -2.3e-74) tmp = t_1; elseif (Om <= 3200000000000.0) tmp = abs(Float64(sqrt(Float64(2.0 * Float64(U * U_42_))) * Float64(l / Float64(Om / n)))); elseif (Om <= 8.2e+273) tmp = t_1; else tmp = Float64(sqrt(Float64(Float64(2.0 * n) * U)) * sqrt(t)); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = sqrt((2.0 * abs((U * (n * t))))); tmp = 0.0; if (Om <= -2.3e-74) tmp = t_1; elseif (Om <= 3200000000000.0) tmp = abs((sqrt((2.0 * (U * U_42_))) * (l / (Om / n)))); elseif (Om <= 8.2e+273) tmp = t_1; else tmp = sqrt(((2.0 * n) * U)) * sqrt(t); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[Sqrt[N[(2.0 * N[Abs[N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[Om, -2.3e-74], t$95$1, If[LessEqual[Om, 3200000000000.0], N[Abs[N[(N[Sqrt[N[(2.0 * N[(U * U$42$), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(l / N[(Om / n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[Om, 8.2e+273], t$95$1, N[(N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \sqrt{2 \cdot \left|U \cdot \left(n \cdot t\right)\right|}\\
\mathbf{if}\;Om \leq -2.3 \cdot 10^{-74}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;Om \leq 3200000000000:\\
\;\;\;\;\left|\sqrt{2 \cdot \left(U \cdot U*\right)} \cdot \frac{\ell}{\frac{Om}{n}}\right|\\
\mathbf{elif}\;Om \leq 8.2 \cdot 10^{+273}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot U} \cdot \sqrt{t}\\
\end{array}
\end{array}
if Om < -2.2999999999999998e-74 or 3.2e12 < Om < 8.19999999999999982e273Initial program 55.7%
Simplified63.1%
Taylor expanded in t around inf 47.8%
add-cube-cbrt47.3%
pow347.3%
associate-*r*44.9%
*-commutative44.9%
Applied egg-rr44.9%
rem-cube-cbrt45.5%
add-sqr-sqrt45.4%
sqrt-unprod27.4%
pow227.4%
associate-*l*28.0%
Applied egg-rr28.0%
unpow228.0%
rem-sqrt-square45.3%
associate-*r*46.3%
*-commutative46.3%
associate-*r*48.7%
Simplified48.7%
if -2.2999999999999998e-74 < Om < 3.2e12Initial program 38.8%
Simplified38.8%
associate-*r*38.8%
fma-define42.9%
associate-*r*41.9%
Applied egg-rr41.9%
Taylor expanded in U around 0 28.2%
mul-1-neg28.2%
associate-/l*27.2%
unpow227.2%
unpow227.2%
times-frac42.1%
unpow242.1%
Simplified42.1%
Taylor expanded in n around inf 26.7%
associate-*r/26.7%
associate-*r*26.4%
Simplified26.4%
pow1/226.5%
Applied egg-rr46.9%
unpow1/246.9%
unpow246.9%
rem-sqrt-square59.5%
associate-/l*57.6%
*-commutative57.6%
associate-/l*59.1%
Simplified59.1%
clear-num59.1%
un-div-inv59.2%
Applied egg-rr59.2%
if 8.19999999999999982e273 < Om Initial program 32.7%
Simplified32.8%
Taylor expanded in t around inf 32.6%
*-un-lft-identity32.6%
associate-*r*32.6%
*-commutative32.6%
Applied egg-rr32.6%
*-lft-identity32.6%
associate-*r*32.6%
associate-*r*32.6%
Simplified32.6%
sqrt-prod57.2%
*-commutative57.2%
*-commutative57.2%
Applied egg-rr57.2%
Final simplification53.2%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (sqrt (* 2.0 (fabs (* U (* n t)))))))
(if (<= Om -2.1e-75)
t_1
(if (<= Om 1.25e+83)
(fabs (* (sqrt (* 2.0 (* U U*))) (* l (/ n Om))))
(if (<= Om 5.6e+250) t_1 (* (sqrt (* (* 2.0 n) U)) (sqrt t)))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = sqrt((2.0 * fabs((U * (n * t)))));
double tmp;
if (Om <= -2.1e-75) {
tmp = t_1;
} else if (Om <= 1.25e+83) {
tmp = fabs((sqrt((2.0 * (U * U_42_))) * (l * (n / Om))));
} else if (Om <= 5.6e+250) {
tmp = t_1;
} else {
tmp = sqrt(((2.0 * n) * 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 = sqrt((2.0d0 * abs((u * (n * t)))))
if (om <= (-2.1d-75)) then
tmp = t_1
else if (om <= 1.25d+83) then
tmp = abs((sqrt((2.0d0 * (u * u_42))) * (l * (n / om))))
else if (om <= 5.6d+250) then
tmp = t_1
else
tmp = sqrt(((2.0d0 * n) * 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 = Math.sqrt((2.0 * Math.abs((U * (n * t)))));
double tmp;
if (Om <= -2.1e-75) {
tmp = t_1;
} else if (Om <= 1.25e+83) {
tmp = Math.abs((Math.sqrt((2.0 * (U * U_42_))) * (l * (n / Om))));
} else if (Om <= 5.6e+250) {
tmp = t_1;
} else {
tmp = Math.sqrt(((2.0 * n) * U)) * Math.sqrt(t);
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = math.sqrt((2.0 * math.fabs((U * (n * t))))) tmp = 0 if Om <= -2.1e-75: tmp = t_1 elif Om <= 1.25e+83: tmp = math.fabs((math.sqrt((2.0 * (U * U_42_))) * (l * (n / Om)))) elif Om <= 5.6e+250: tmp = t_1 else: tmp = math.sqrt(((2.0 * n) * U)) * math.sqrt(t) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = sqrt(Float64(2.0 * abs(Float64(U * Float64(n * t))))) tmp = 0.0 if (Om <= -2.1e-75) tmp = t_1; elseif (Om <= 1.25e+83) tmp = abs(Float64(sqrt(Float64(2.0 * Float64(U * U_42_))) * Float64(l * Float64(n / Om)))); elseif (Om <= 5.6e+250) tmp = t_1; else tmp = Float64(sqrt(Float64(Float64(2.0 * n) * U)) * sqrt(t)); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = sqrt((2.0 * abs((U * (n * t))))); tmp = 0.0; if (Om <= -2.1e-75) tmp = t_1; elseif (Om <= 1.25e+83) tmp = abs((sqrt((2.0 * (U * U_42_))) * (l * (n / Om)))); elseif (Om <= 5.6e+250) tmp = t_1; else tmp = sqrt(((2.0 * n) * U)) * sqrt(t); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[Sqrt[N[(2.0 * N[Abs[N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[Om, -2.1e-75], t$95$1, If[LessEqual[Om, 1.25e+83], N[Abs[N[(N[Sqrt[N[(2.0 * N[(U * U$42$), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(l * N[(n / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[Om, 5.6e+250], t$95$1, N[(N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \sqrt{2 \cdot \left|U \cdot \left(n \cdot t\right)\right|}\\
\mathbf{if}\;Om \leq -2.1 \cdot 10^{-75}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;Om \leq 1.25 \cdot 10^{+83}:\\
\;\;\;\;\left|\sqrt{2 \cdot \left(U \cdot U*\right)} \cdot \left(\ell \cdot \frac{n}{Om}\right)\right|\\
\mathbf{elif}\;Om \leq 5.6 \cdot 10^{+250}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot U} \cdot \sqrt{t}\\
\end{array}
\end{array}
if Om < -2.1000000000000001e-75 or 1.25000000000000007e83 < Om < 5.60000000000000019e250Initial program 56.4%
Simplified64.3%
Taylor expanded in t around inf 53.6%
add-cube-cbrt52.9%
pow353.0%
associate-*r*48.6%
*-commutative48.6%
Applied egg-rr48.6%
rem-cube-cbrt49.2%
add-sqr-sqrt49.1%
sqrt-unprod29.1%
pow229.1%
associate-*l*29.9%
Applied egg-rr29.9%
unpow229.9%
rem-sqrt-square49.5%
associate-*r*49.9%
*-commutative49.9%
associate-*r*54.3%
Simplified54.3%
if -2.1000000000000001e-75 < Om < 1.25000000000000007e83Initial program 39.9%
Simplified39.9%
associate-*r*39.9%
fma-define43.5%
associate-*r*42.6%
Applied egg-rr42.6%
Taylor expanded in U around 0 29.6%
mul-1-neg29.6%
associate-/l*29.6%
unpow229.6%
unpow229.6%
times-frac42.8%
unpow242.8%
Simplified42.8%
Taylor expanded in n around inf 24.9%
associate-*r/24.9%
associate-*r*24.6%
Simplified24.6%
pow1/224.7%
Applied egg-rr43.7%
unpow1/243.7%
unpow243.7%
rem-sqrt-square54.8%
associate-/l*53.1%
*-commutative53.1%
associate-/l*55.3%
Simplified55.3%
if 5.60000000000000019e250 < Om Initial program 42.4%
Simplified46.6%
Taylor expanded in t around inf 25.5%
*-un-lft-identity25.5%
associate-*r*34.0%
*-commutative34.0%
Applied egg-rr34.0%
*-lft-identity34.0%
associate-*r*34.0%
associate-*r*34.0%
Simplified34.0%
sqrt-prod43.5%
*-commutative43.5%
*-commutative43.5%
Applied egg-rr43.5%
Final simplification53.8%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* l (/ n Om))))
(if (<= l 5.6e+27)
(sqrt (* 2.0 (fabs (* U (* n t)))))
(sqrt (* (* U* (* 2.0 U)) (* t_1 t_1))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = l * (n / Om);
double tmp;
if (l <= 5.6e+27) {
tmp = sqrt((2.0 * fabs((U * (n * t)))));
} else {
tmp = sqrt(((U_42_ * (2.0 * U)) * (t_1 * t_1)));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: t_1
real(8) :: tmp
t_1 = l * (n / om)
if (l <= 5.6d+27) then
tmp = sqrt((2.0d0 * abs((u * (n * t)))))
else
tmp = sqrt(((u_42 * (2.0d0 * u)) * (t_1 * t_1)))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = l * (n / Om);
double tmp;
if (l <= 5.6e+27) {
tmp = Math.sqrt((2.0 * Math.abs((U * (n * t)))));
} else {
tmp = Math.sqrt(((U_42_ * (2.0 * U)) * (t_1 * t_1)));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = l * (n / Om) tmp = 0 if l <= 5.6e+27: tmp = math.sqrt((2.0 * math.fabs((U * (n * t))))) else: tmp = math.sqrt(((U_42_ * (2.0 * U)) * (t_1 * t_1))) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(l * Float64(n / Om)) tmp = 0.0 if (l <= 5.6e+27) tmp = sqrt(Float64(2.0 * abs(Float64(U * Float64(n * t))))); else tmp = sqrt(Float64(Float64(U_42_ * Float64(2.0 * U)) * Float64(t_1 * t_1))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = l * (n / Om); tmp = 0.0; if (l <= 5.6e+27) tmp = sqrt((2.0 * abs((U * (n * t))))); else tmp = sqrt(((U_42_ * (2.0 * U)) * (t_1 * t_1))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(l * N[(n / Om), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, 5.6e+27], N[Sqrt[N[(2.0 * N[Abs[N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(U$42$ * N[(2.0 * U), $MachinePrecision]), $MachinePrecision] * N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \ell \cdot \frac{n}{Om}\\
\mathbf{if}\;\ell \leq 5.6 \cdot 10^{+27}:\\
\;\;\;\;\sqrt{2 \cdot \left|U \cdot \left(n \cdot t\right)\right|}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(U* \cdot \left(2 \cdot U\right)\right) \cdot \left(t\_1 \cdot t\_1\right)}\\
\end{array}
\end{array}
if l < 5.5999999999999999e27Initial program 53.2%
Simplified53.1%
Taylor expanded in t around inf 42.8%
add-cube-cbrt42.4%
pow342.4%
associate-*r*41.5%
*-commutative41.5%
Applied egg-rr41.5%
rem-cube-cbrt41.9%
add-sqr-sqrt41.8%
sqrt-unprod28.7%
pow228.7%
associate-*l*28.2%
Applied egg-rr28.2%
unpow228.2%
rem-sqrt-square40.8%
associate-*r*43.5%
*-commutative43.5%
associate-*r*44.5%
Simplified44.5%
if 5.5999999999999999e27 < l Initial program 32.6%
Simplified44.6%
associate-*r*44.6%
fma-define49.1%
associate-*r*50.4%
Applied egg-rr50.4%
Taylor expanded in U around 0 30.4%
mul-1-neg30.4%
associate-/l*37.9%
unpow237.9%
unpow237.9%
times-frac50.5%
unpow250.5%
Simplified50.5%
Taylor expanded in n around inf 24.2%
associate-*r/24.2%
associate-*r*23.9%
Simplified23.9%
*-un-lft-identity23.9%
sqrt-div23.9%
associate-*r*23.9%
sqrt-prod23.9%
*-commutative23.9%
sqrt-prod24.0%
sqrt-pow113.1%
metadata-eval13.1%
pow113.1%
sqrt-pow113.6%
metadata-eval13.6%
pow113.6%
sqrt-pow113.8%
metadata-eval13.8%
pow113.8%
Applied egg-rr13.8%
*-lft-identity13.8%
associate-/l*13.8%
*-commutative13.8%
associate-/l*18.1%
Simplified18.1%
add-sqr-sqrt17.9%
sqrt-unprod30.8%
swap-sqr27.8%
add-sqr-sqrt27.9%
associate-*r*27.9%
pow227.9%
Applied egg-rr27.9%
unpow227.9%
Applied egg-rr27.9%
Final simplification40.2%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* n (* U t))))
(if (<= l 3.45e+92)
(pow (* t (* 2.0 (* n U))) 0.5)
(if (<= l 2.1e+108)
(* (sqrt (* 2.0 (* U U*))) (* n (/ l Om)))
(if (<= l 1.02e+127)
(pow (* (* t_1 t_1) 4.0) 0.25)
(* l (/ (sqrt (* U* (* 2.0 U))) (/ Om n))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = n * (U * t);
double tmp;
if (l <= 3.45e+92) {
tmp = pow((t * (2.0 * (n * U))), 0.5);
} else if (l <= 2.1e+108) {
tmp = sqrt((2.0 * (U * U_42_))) * (n * (l / Om));
} else if (l <= 1.02e+127) {
tmp = pow(((t_1 * t_1) * 4.0), 0.25);
} else {
tmp = l * (sqrt((U_42_ * (2.0 * U))) / (Om / n));
}
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 = n * (u * t)
if (l <= 3.45d+92) then
tmp = (t * (2.0d0 * (n * u))) ** 0.5d0
else if (l <= 2.1d+108) then
tmp = sqrt((2.0d0 * (u * u_42))) * (n * (l / om))
else if (l <= 1.02d+127) then
tmp = ((t_1 * t_1) * 4.0d0) ** 0.25d0
else
tmp = l * (sqrt((u_42 * (2.0d0 * u))) / (om / n))
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 = n * (U * t);
double tmp;
if (l <= 3.45e+92) {
tmp = Math.pow((t * (2.0 * (n * U))), 0.5);
} else if (l <= 2.1e+108) {
tmp = Math.sqrt((2.0 * (U * U_42_))) * (n * (l / Om));
} else if (l <= 1.02e+127) {
tmp = Math.pow(((t_1 * t_1) * 4.0), 0.25);
} else {
tmp = l * (Math.sqrt((U_42_ * (2.0 * U))) / (Om / n));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = n * (U * t) tmp = 0 if l <= 3.45e+92: tmp = math.pow((t * (2.0 * (n * U))), 0.5) elif l <= 2.1e+108: tmp = math.sqrt((2.0 * (U * U_42_))) * (n * (l / Om)) elif l <= 1.02e+127: tmp = math.pow(((t_1 * t_1) * 4.0), 0.25) else: tmp = l * (math.sqrt((U_42_ * (2.0 * U))) / (Om / n)) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(n * Float64(U * t)) tmp = 0.0 if (l <= 3.45e+92) tmp = Float64(t * Float64(2.0 * Float64(n * U))) ^ 0.5; elseif (l <= 2.1e+108) tmp = Float64(sqrt(Float64(2.0 * Float64(U * U_42_))) * Float64(n * Float64(l / Om))); elseif (l <= 1.02e+127) tmp = Float64(Float64(t_1 * t_1) * 4.0) ^ 0.25; else tmp = Float64(l * Float64(sqrt(Float64(U_42_ * Float64(2.0 * U))) / Float64(Om / n))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = n * (U * t); tmp = 0.0; if (l <= 3.45e+92) tmp = (t * (2.0 * (n * U))) ^ 0.5; elseif (l <= 2.1e+108) tmp = sqrt((2.0 * (U * U_42_))) * (n * (l / Om)); elseif (l <= 1.02e+127) tmp = ((t_1 * t_1) * 4.0) ^ 0.25; else tmp = l * (sqrt((U_42_ * (2.0 * U))) / (Om / n)); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(n * N[(U * t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, 3.45e+92], N[Power[N[(t * N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], If[LessEqual[l, 2.1e+108], N[(N[Sqrt[N[(2.0 * N[(U * U$42$), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(n * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 1.02e+127], N[Power[N[(N[(t$95$1 * t$95$1), $MachinePrecision] * 4.0), $MachinePrecision], 0.25], $MachinePrecision], N[(l * N[(N[Sqrt[N[(U$42$ * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(Om / n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := n \cdot \left(U \cdot t\right)\\
\mathbf{if}\;\ell \leq 3.45 \cdot 10^{+92}:\\
\;\;\;\;{\left(t \cdot \left(2 \cdot \left(n \cdot U\right)\right)\right)}^{0.5}\\
\mathbf{elif}\;\ell \leq 2.1 \cdot 10^{+108}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot U*\right)} \cdot \left(n \cdot \frac{\ell}{Om}\right)\\
\mathbf{elif}\;\ell \leq 1.02 \cdot 10^{+127}:\\
\;\;\;\;{\left(\left(t\_1 \cdot t\_1\right) \cdot 4\right)}^{0.25}\\
\mathbf{else}:\\
\;\;\;\;\ell \cdot \frac{\sqrt{U* \cdot \left(2 \cdot U\right)}}{\frac{Om}{n}}\\
\end{array}
\end{array}
if l < 3.45000000000000012e92Initial program 54.4%
Simplified54.2%
Taylor expanded in n around 0 47.2%
associate-*r*46.0%
cancel-sign-sub-inv46.0%
metadata-eval46.0%
*-commutative46.0%
associate-*l/46.0%
Simplified46.0%
pow1/250.2%
associate-*r*50.2%
*-commutative50.2%
+-commutative50.2%
associate-/l*50.2%
fma-define50.2%
Applied egg-rr50.2%
Taylor expanded in l around 0 43.3%
if 3.45000000000000012e92 < l < 2.1000000000000001e108Initial program 23.1%
Simplified23.1%
associate-*r*23.1%
fma-define43.1%
associate-*r*43.1%
Applied egg-rr43.1%
Taylor expanded in U around 0 43.1%
mul-1-neg43.1%
associate-/l*43.1%
unpow243.1%
unpow243.1%
times-frac43.1%
unpow243.1%
Simplified43.1%
Taylor expanded in n around inf 42.1%
associate-*r/42.1%
associate-*r*42.1%
Simplified42.1%
*-un-lft-identity42.1%
sqrt-div42.1%
associate-*r*42.1%
sqrt-prod42.1%
*-commutative42.1%
sqrt-prod42.1%
sqrt-pow141.0%
metadata-eval41.0%
pow141.0%
sqrt-pow141.0%
metadata-eval41.0%
pow141.0%
sqrt-pow140.9%
metadata-eval40.9%
pow140.9%
Applied egg-rr40.9%
*-lft-identity40.9%
associate-/l*40.9%
*-commutative40.9%
associate-/l*40.6%
Simplified40.6%
associate-*r*60.4%
clear-num60.4%
un-div-inv60.6%
associate-*r*60.6%
Applied egg-rr40.6%
associate-/l*40.6%
associate-*l*40.6%
associate-/r/40.9%
Simplified40.9%
if 2.1000000000000001e108 < l < 1.02e127Initial program 35.0%
Simplified35.8%
Taylor expanded in t around inf 3.1%
add-cube-cbrt3.1%
pow33.1%
associate-*r*3.5%
*-commutative3.5%
Applied egg-rr3.5%
pow1/23.5%
rem-cube-cbrt3.5%
associate-*l*3.5%
sqr-pow3.5%
pow-prod-down20.1%
associate-*l*20.1%
associate-*l*20.1%
*-commutative20.1%
*-commutative20.1%
swap-sqr20.1%
pow220.1%
associate-*l*20.1%
metadata-eval20.1%
metadata-eval20.1%
Applied egg-rr20.1%
unpow220.1%
Applied egg-rr20.1%
if 1.02e127 < l Initial program 21.0%
Simplified39.7%
associate-*r*39.7%
fma-define42.1%
associate-*r*44.1%
Applied egg-rr44.1%
Taylor expanded in U around 0 24.5%
mul-1-neg24.5%
associate-/l*24.5%
unpow224.5%
unpow224.5%
times-frac44.2%
unpow244.2%
Simplified44.2%
Taylor expanded in n around inf 26.9%
associate-*r/26.9%
associate-*r*26.9%
Simplified26.9%
*-un-lft-identity26.9%
sqrt-div26.9%
associate-*r*26.9%
sqrt-prod26.9%
*-commutative26.9%
sqrt-prod27.1%
sqrt-pow115.0%
metadata-eval15.0%
pow115.0%
sqrt-pow115.8%
metadata-eval15.8%
pow115.8%
sqrt-pow18.7%
metadata-eval8.7%
pow18.7%
Applied egg-rr8.7%
*-lft-identity8.7%
associate-/l*8.7%
*-commutative8.7%
associate-/l*15.5%
Simplified15.5%
associate-*r*37.2%
clear-num37.2%
un-div-inv37.3%
associate-*r*37.3%
Applied egg-rr15.4%
*-commutative15.4%
associate-/l*15.5%
*-commutative15.5%
*-commutative15.5%
Simplified15.5%
Final simplification38.2%
(FPCore (n U t l Om U*)
:precision binary64
(if (<= l 3.8e+90)
(pow (* t (* 2.0 (* n U))) 0.5)
(if (or (<= l 1.15e+108) (not (<= l 9.2e+126)))
(* l (/ (sqrt (* U* (* 2.0 U))) (/ Om n)))
(sqrt (* 2.0 (* n (* U t)))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 3.8e+90) {
tmp = pow((t * (2.0 * (n * U))), 0.5);
} else if ((l <= 1.15e+108) || !(l <= 9.2e+126)) {
tmp = l * (sqrt((U_42_ * (2.0 * U))) / (Om / n));
} else {
tmp = sqrt((2.0 * (n * (U * 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 (l <= 3.8d+90) then
tmp = (t * (2.0d0 * (n * u))) ** 0.5d0
else if ((l <= 1.15d+108) .or. (.not. (l <= 9.2d+126))) then
tmp = l * (sqrt((u_42 * (2.0d0 * u))) / (om / n))
else
tmp = sqrt((2.0d0 * (n * (u * 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 (l <= 3.8e+90) {
tmp = Math.pow((t * (2.0 * (n * U))), 0.5);
} else if ((l <= 1.15e+108) || !(l <= 9.2e+126)) {
tmp = l * (Math.sqrt((U_42_ * (2.0 * U))) / (Om / n));
} else {
tmp = Math.sqrt((2.0 * (n * (U * t))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 3.8e+90: tmp = math.pow((t * (2.0 * (n * U))), 0.5) elif (l <= 1.15e+108) or not (l <= 9.2e+126): tmp = l * (math.sqrt((U_42_ * (2.0 * U))) / (Om / n)) else: tmp = math.sqrt((2.0 * (n * (U * t)))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 3.8e+90) tmp = Float64(t * Float64(2.0 * Float64(n * U))) ^ 0.5; elseif ((l <= 1.15e+108) || !(l <= 9.2e+126)) tmp = Float64(l * Float64(sqrt(Float64(U_42_ * Float64(2.0 * U))) / Float64(Om / n))); else tmp = sqrt(Float64(2.0 * Float64(n * Float64(U * t)))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 3.8e+90) tmp = (t * (2.0 * (n * U))) ^ 0.5; elseif ((l <= 1.15e+108) || ~((l <= 9.2e+126))) tmp = l * (sqrt((U_42_ * (2.0 * U))) / (Om / n)); else tmp = sqrt((2.0 * (n * (U * t)))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 3.8e+90], N[Power[N[(t * N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], If[Or[LessEqual[l, 1.15e+108], N[Not[LessEqual[l, 9.2e+126]], $MachinePrecision]], N[(l * N[(N[Sqrt[N[(U$42$ * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(Om / n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(2.0 * N[(n * N[(U * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 3.8 \cdot 10^{+90}:\\
\;\;\;\;{\left(t \cdot \left(2 \cdot \left(n \cdot U\right)\right)\right)}^{0.5}\\
\mathbf{elif}\;\ell \leq 1.15 \cdot 10^{+108} \lor \neg \left(\ell \leq 9.2 \cdot 10^{+126}\right):\\
\;\;\;\;\ell \cdot \frac{\sqrt{U* \cdot \left(2 \cdot U\right)}}{\frac{Om}{n}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(n \cdot \left(U \cdot t\right)\right)}\\
\end{array}
\end{array}
if l < 3.8000000000000001e90Initial program 54.4%
Simplified54.2%
Taylor expanded in n around 0 47.2%
associate-*r*46.0%
cancel-sign-sub-inv46.0%
metadata-eval46.0%
*-commutative46.0%
associate-*l/46.0%
Simplified46.0%
pow1/250.2%
associate-*r*50.2%
*-commutative50.2%
+-commutative50.2%
associate-/l*50.2%
fma-define50.2%
Applied egg-rr50.2%
Taylor expanded in l around 0 43.3%
if 3.8000000000000001e90 < l < 1.1499999999999999e108 or 9.2000000000000002e126 < l Initial program 21.2%
Simplified37.9%
associate-*r*37.9%
fma-define42.2%
associate-*r*44.0%
Applied egg-rr44.0%
Taylor expanded in U around 0 26.4%
mul-1-neg26.4%
associate-/l*26.4%
unpow226.4%
unpow226.4%
times-frac44.1%
unpow244.1%
Simplified44.1%
Taylor expanded in n around inf 28.6%
associate-*r/28.6%
associate-*r*28.5%
Simplified28.5%
*-un-lft-identity28.5%
sqrt-div28.5%
associate-*r*28.5%
sqrt-prod28.5%
*-commutative28.5%
sqrt-prod28.7%
sqrt-pow117.8%
metadata-eval17.8%
pow117.8%
sqrt-pow118.5%
metadata-eval18.5%
pow118.5%
sqrt-pow112.2%
metadata-eval12.2%
pow112.2%
Applied egg-rr12.2%
*-lft-identity12.2%
associate-/l*12.2%
*-commutative12.2%
associate-/l*18.1%
Simplified18.1%
associate-*r*39.7%
clear-num39.7%
un-div-inv39.7%
associate-*r*39.7%
Applied egg-rr18.1%
*-commutative18.1%
associate-/l*18.2%
*-commutative18.2%
*-commutative18.2%
Simplified18.2%
if 1.1499999999999999e108 < l < 9.2000000000000002e126Initial program 35.0%
Simplified35.8%
Taylor expanded in t around inf 3.1%
pow13.1%
associate-*r*3.5%
*-commutative3.5%
Applied egg-rr3.5%
unpow13.5%
associate-*l*3.9%
Simplified3.9%
Final simplification37.8%
(FPCore (n U t l Om U*)
:precision binary64
(if (<= l 5.2e+91)
(pow (* t (* 2.0 (* n U))) 0.5)
(if (or (<= l 1.9e+108) (not (<= l 6e+127)))
(* l (* (/ n Om) (sqrt (* U* (* 2.0 U)))))
(sqrt (* 2.0 (* n (* U t)))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 5.2e+91) {
tmp = pow((t * (2.0 * (n * U))), 0.5);
} else if ((l <= 1.9e+108) || !(l <= 6e+127)) {
tmp = l * ((n / Om) * sqrt((U_42_ * (2.0 * U))));
} else {
tmp = sqrt((2.0 * (n * (U * 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 (l <= 5.2d+91) then
tmp = (t * (2.0d0 * (n * u))) ** 0.5d0
else if ((l <= 1.9d+108) .or. (.not. (l <= 6d+127))) then
tmp = l * ((n / om) * sqrt((u_42 * (2.0d0 * u))))
else
tmp = sqrt((2.0d0 * (n * (u * 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 (l <= 5.2e+91) {
tmp = Math.pow((t * (2.0 * (n * U))), 0.5);
} else if ((l <= 1.9e+108) || !(l <= 6e+127)) {
tmp = l * ((n / Om) * Math.sqrt((U_42_ * (2.0 * U))));
} else {
tmp = Math.sqrt((2.0 * (n * (U * t))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 5.2e+91: tmp = math.pow((t * (2.0 * (n * U))), 0.5) elif (l <= 1.9e+108) or not (l <= 6e+127): tmp = l * ((n / Om) * math.sqrt((U_42_ * (2.0 * U)))) else: tmp = math.sqrt((2.0 * (n * (U * t)))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 5.2e+91) tmp = Float64(t * Float64(2.0 * Float64(n * U))) ^ 0.5; elseif ((l <= 1.9e+108) || !(l <= 6e+127)) tmp = Float64(l * Float64(Float64(n / Om) * sqrt(Float64(U_42_ * Float64(2.0 * U))))); else tmp = sqrt(Float64(2.0 * Float64(n * Float64(U * t)))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 5.2e+91) tmp = (t * (2.0 * (n * U))) ^ 0.5; elseif ((l <= 1.9e+108) || ~((l <= 6e+127))) tmp = l * ((n / Om) * sqrt((U_42_ * (2.0 * U)))); else tmp = sqrt((2.0 * (n * (U * t)))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 5.2e+91], N[Power[N[(t * N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], If[Or[LessEqual[l, 1.9e+108], N[Not[LessEqual[l, 6e+127]], $MachinePrecision]], N[(l * N[(N[(n / Om), $MachinePrecision] * N[Sqrt[N[(U$42$ * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(2.0 * N[(n * N[(U * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 5.2 \cdot 10^{+91}:\\
\;\;\;\;{\left(t \cdot \left(2 \cdot \left(n \cdot U\right)\right)\right)}^{0.5}\\
\mathbf{elif}\;\ell \leq 1.9 \cdot 10^{+108} \lor \neg \left(\ell \leq 6 \cdot 10^{+127}\right):\\
\;\;\;\;\ell \cdot \left(\frac{n}{Om} \cdot \sqrt{U* \cdot \left(2 \cdot U\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(n \cdot \left(U \cdot t\right)\right)}\\
\end{array}
\end{array}
if l < 5.2000000000000001e91Initial program 54.4%
Simplified54.2%
Taylor expanded in n around 0 47.2%
associate-*r*46.0%
cancel-sign-sub-inv46.0%
metadata-eval46.0%
*-commutative46.0%
associate-*l/46.0%
Simplified46.0%
pow1/250.2%
associate-*r*50.2%
*-commutative50.2%
+-commutative50.2%
associate-/l*50.2%
fma-define50.2%
Applied egg-rr50.2%
Taylor expanded in l around 0 43.3%
if 5.2000000000000001e91 < l < 1.90000000000000004e108 or 6.0000000000000005e127 < l Initial program 21.2%
Simplified37.9%
associate-*r*37.9%
fma-define42.2%
associate-*r*44.0%
Applied egg-rr44.0%
Taylor expanded in U around 0 26.4%
mul-1-neg26.4%
associate-/l*26.4%
unpow226.4%
unpow226.4%
times-frac44.1%
unpow244.1%
Simplified44.1%
Taylor expanded in n around inf 28.6%
associate-*r/28.6%
associate-*r*28.5%
Simplified28.5%
*-un-lft-identity28.5%
sqrt-div28.5%
associate-*r*28.5%
sqrt-prod28.5%
*-commutative28.5%
sqrt-prod28.7%
sqrt-pow117.8%
metadata-eval17.8%
pow117.8%
sqrt-pow118.5%
metadata-eval18.5%
pow118.5%
sqrt-pow112.2%
metadata-eval12.2%
pow112.2%
Applied egg-rr12.2%
*-lft-identity12.2%
associate-/l*12.2%
*-commutative12.2%
associate-/l*18.1%
Simplified18.1%
associate-*r*39.7%
clear-num39.7%
un-div-inv39.7%
associate-*r*39.7%
Applied egg-rr18.1%
*-commutative18.1%
associate-/l*18.2%
*-commutative18.2%
*-commutative18.2%
Simplified18.2%
associate-*r/18.1%
*-commutative18.1%
*-commutative18.1%
associate-*l*18.1%
Applied egg-rr18.1%
associate-/l*18.2%
associate-/r/18.1%
associate-*l/18.2%
associate-*r/18.2%
associate-*r*18.2%
*-commutative18.2%
Simplified18.2%
if 1.90000000000000004e108 < l < 6.0000000000000005e127Initial program 35.0%
Simplified35.8%
Taylor expanded in t around inf 3.1%
pow13.1%
associate-*r*3.5%
*-commutative3.5%
Applied egg-rr3.5%
unpow13.5%
associate-*l*3.9%
Simplified3.9%
Final simplification37.8%
(FPCore (n U t l Om U*)
:precision binary64
(if (<= l 3.6e+91)
(pow (* t (* 2.0 (* n U))) 0.5)
(if (<= l 1.06e+108)
(* (sqrt (* 2.0 (* U U*))) (* n (/ l Om)))
(if (<= l 1.75e+127)
(sqrt (* 2.0 (* n (* U t))))
(* l (/ (sqrt (* U* (* 2.0 U))) (/ Om n)))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 3.6e+91) {
tmp = pow((t * (2.0 * (n * U))), 0.5);
} else if (l <= 1.06e+108) {
tmp = sqrt((2.0 * (U * U_42_))) * (n * (l / Om));
} else if (l <= 1.75e+127) {
tmp = sqrt((2.0 * (n * (U * t))));
} else {
tmp = l * (sqrt((U_42_ * (2.0 * U))) / (Om / n));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l <= 3.6d+91) then
tmp = (t * (2.0d0 * (n * u))) ** 0.5d0
else if (l <= 1.06d+108) then
tmp = sqrt((2.0d0 * (u * u_42))) * (n * (l / om))
else if (l <= 1.75d+127) then
tmp = sqrt((2.0d0 * (n * (u * t))))
else
tmp = l * (sqrt((u_42 * (2.0d0 * u))) / (om / n))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 3.6e+91) {
tmp = Math.pow((t * (2.0 * (n * U))), 0.5);
} else if (l <= 1.06e+108) {
tmp = Math.sqrt((2.0 * (U * U_42_))) * (n * (l / Om));
} else if (l <= 1.75e+127) {
tmp = Math.sqrt((2.0 * (n * (U * t))));
} else {
tmp = l * (Math.sqrt((U_42_ * (2.0 * U))) / (Om / n));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 3.6e+91: tmp = math.pow((t * (2.0 * (n * U))), 0.5) elif l <= 1.06e+108: tmp = math.sqrt((2.0 * (U * U_42_))) * (n * (l / Om)) elif l <= 1.75e+127: tmp = math.sqrt((2.0 * (n * (U * t)))) else: tmp = l * (math.sqrt((U_42_ * (2.0 * U))) / (Om / n)) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 3.6e+91) tmp = Float64(t * Float64(2.0 * Float64(n * U))) ^ 0.5; elseif (l <= 1.06e+108) tmp = Float64(sqrt(Float64(2.0 * Float64(U * U_42_))) * Float64(n * Float64(l / Om))); elseif (l <= 1.75e+127) tmp = sqrt(Float64(2.0 * Float64(n * Float64(U * t)))); else tmp = Float64(l * Float64(sqrt(Float64(U_42_ * Float64(2.0 * U))) / Float64(Om / n))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 3.6e+91) tmp = (t * (2.0 * (n * U))) ^ 0.5; elseif (l <= 1.06e+108) tmp = sqrt((2.0 * (U * U_42_))) * (n * (l / Om)); elseif (l <= 1.75e+127) tmp = sqrt((2.0 * (n * (U * t)))); else tmp = l * (sqrt((U_42_ * (2.0 * U))) / (Om / n)); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 3.6e+91], N[Power[N[(t * N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], If[LessEqual[l, 1.06e+108], N[(N[Sqrt[N[(2.0 * N[(U * U$42$), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(n * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 1.75e+127], N[Sqrt[N[(2.0 * N[(n * N[(U * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(l * N[(N[Sqrt[N[(U$42$ * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(Om / n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 3.6 \cdot 10^{+91}:\\
\;\;\;\;{\left(t \cdot \left(2 \cdot \left(n \cdot U\right)\right)\right)}^{0.5}\\
\mathbf{elif}\;\ell \leq 1.06 \cdot 10^{+108}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot U*\right)} \cdot \left(n \cdot \frac{\ell}{Om}\right)\\
\mathbf{elif}\;\ell \leq 1.75 \cdot 10^{+127}:\\
\;\;\;\;\sqrt{2 \cdot \left(n \cdot \left(U \cdot t\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\ell \cdot \frac{\sqrt{U* \cdot \left(2 \cdot U\right)}}{\frac{Om}{n}}\\
\end{array}
\end{array}
if l < 3.6e91Initial program 54.4%
Simplified54.2%
Taylor expanded in n around 0 47.2%
associate-*r*46.0%
cancel-sign-sub-inv46.0%
metadata-eval46.0%
*-commutative46.0%
associate-*l/46.0%
Simplified46.0%
pow1/250.2%
associate-*r*50.2%
*-commutative50.2%
+-commutative50.2%
associate-/l*50.2%
fma-define50.2%
Applied egg-rr50.2%
Taylor expanded in l around 0 43.3%
if 3.6e91 < l < 1.06e108Initial program 23.1%
Simplified23.1%
associate-*r*23.1%
fma-define43.1%
associate-*r*43.1%
Applied egg-rr43.1%
Taylor expanded in U around 0 43.1%
mul-1-neg43.1%
associate-/l*43.1%
unpow243.1%
unpow243.1%
times-frac43.1%
unpow243.1%
Simplified43.1%
Taylor expanded in n around inf 42.1%
associate-*r/42.1%
associate-*r*42.1%
Simplified42.1%
*-un-lft-identity42.1%
sqrt-div42.1%
associate-*r*42.1%
sqrt-prod42.1%
*-commutative42.1%
sqrt-prod42.1%
sqrt-pow141.0%
metadata-eval41.0%
pow141.0%
sqrt-pow141.0%
metadata-eval41.0%
pow141.0%
sqrt-pow140.9%
metadata-eval40.9%
pow140.9%
Applied egg-rr40.9%
*-lft-identity40.9%
associate-/l*40.9%
*-commutative40.9%
associate-/l*40.6%
Simplified40.6%
associate-*r*60.4%
clear-num60.4%
un-div-inv60.6%
associate-*r*60.6%
Applied egg-rr40.6%
associate-/l*40.6%
associate-*l*40.6%
associate-/r/40.9%
Simplified40.9%
if 1.06e108 < l < 1.74999999999999989e127Initial program 35.0%
Simplified35.8%
Taylor expanded in t around inf 3.1%
pow13.1%
associate-*r*3.5%
*-commutative3.5%
Applied egg-rr3.5%
unpow13.5%
associate-*l*3.9%
Simplified3.9%
if 1.74999999999999989e127 < l Initial program 21.0%
Simplified39.7%
associate-*r*39.7%
fma-define42.1%
associate-*r*44.1%
Applied egg-rr44.1%
Taylor expanded in U around 0 24.5%
mul-1-neg24.5%
associate-/l*24.5%
unpow224.5%
unpow224.5%
times-frac44.2%
unpow244.2%
Simplified44.2%
Taylor expanded in n around inf 26.9%
associate-*r/26.9%
associate-*r*26.9%
Simplified26.9%
*-un-lft-identity26.9%
sqrt-div26.9%
associate-*r*26.9%
sqrt-prod26.9%
*-commutative26.9%
sqrt-prod27.1%
sqrt-pow115.0%
metadata-eval15.0%
pow115.0%
sqrt-pow115.8%
metadata-eval15.8%
pow115.8%
sqrt-pow18.7%
metadata-eval8.7%
pow18.7%
Applied egg-rr8.7%
*-lft-identity8.7%
associate-/l*8.7%
*-commutative8.7%
associate-/l*15.5%
Simplified15.5%
associate-*r*37.2%
clear-num37.2%
un-div-inv37.3%
associate-*r*37.3%
Applied egg-rr15.4%
*-commutative15.4%
associate-/l*15.5%
*-commutative15.5%
*-commutative15.5%
Simplified15.5%
Final simplification37.8%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* l (/ n Om))))
(if (<= l 4.3e+26)
(pow (* (* n t) (* 2.0 U)) 0.5)
(sqrt (* (* U* (* 2.0 U)) (* t_1 t_1))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = l * (n / Om);
double tmp;
if (l <= 4.3e+26) {
tmp = pow(((n * t) * (2.0 * U)), 0.5);
} else {
tmp = sqrt(((U_42_ * (2.0 * U)) * (t_1 * t_1)));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: t_1
real(8) :: tmp
t_1 = l * (n / om)
if (l <= 4.3d+26) then
tmp = ((n * t) * (2.0d0 * u)) ** 0.5d0
else
tmp = sqrt(((u_42 * (2.0d0 * u)) * (t_1 * t_1)))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = l * (n / Om);
double tmp;
if (l <= 4.3e+26) {
tmp = Math.pow(((n * t) * (2.0 * U)), 0.5);
} else {
tmp = Math.sqrt(((U_42_ * (2.0 * U)) * (t_1 * t_1)));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = l * (n / Om) tmp = 0 if l <= 4.3e+26: tmp = math.pow(((n * t) * (2.0 * U)), 0.5) else: tmp = math.sqrt(((U_42_ * (2.0 * U)) * (t_1 * t_1))) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(l * Float64(n / Om)) tmp = 0.0 if (l <= 4.3e+26) tmp = Float64(Float64(n * t) * Float64(2.0 * U)) ^ 0.5; else tmp = sqrt(Float64(Float64(U_42_ * Float64(2.0 * U)) * Float64(t_1 * t_1))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = l * (n / Om); tmp = 0.0; if (l <= 4.3e+26) tmp = ((n * t) * (2.0 * U)) ^ 0.5; else tmp = sqrt(((U_42_ * (2.0 * U)) * (t_1 * t_1))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(l * N[(n / Om), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, 4.3e+26], N[Power[N[(N[(n * t), $MachinePrecision] * N[(2.0 * U), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[Sqrt[N[(N[(U$42$ * N[(2.0 * U), $MachinePrecision]), $MachinePrecision] * N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \ell \cdot \frac{n}{Om}\\
\mathbf{if}\;\ell \leq 4.3 \cdot 10^{+26}:\\
\;\;\;\;{\left(\left(n \cdot t\right) \cdot \left(2 \cdot U\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(U* \cdot \left(2 \cdot U\right)\right) \cdot \left(t\_1 \cdot t\_1\right)}\\
\end{array}
\end{array}
if l < 4.2999999999999998e26Initial program 52.9%
Simplified52.8%
Taylor expanded in n around 0 46.4%
associate-*r*44.4%
cancel-sign-sub-inv44.4%
metadata-eval44.4%
*-commutative44.4%
associate-*l/44.4%
Simplified44.4%
pow1/248.3%
associate-*r*48.3%
*-commutative48.3%
+-commutative48.3%
associate-/l*48.3%
fma-define48.3%
Applied egg-rr48.3%
Taylor expanded in l around 0 43.2%
Taylor expanded in n around 0 44.2%
associate-*r*44.2%
*-commutative44.2%
Simplified44.2%
if 4.2999999999999998e26 < l Initial program 33.6%
Simplified45.4%
associate-*r*45.4%
fma-define49.9%
associate-*r*51.1%
Applied egg-rr51.1%
Taylor expanded in U around 0 31.4%
mul-1-neg31.4%
associate-/l*38.8%
unpow238.8%
unpow238.8%
times-frac51.2%
unpow251.2%
Simplified51.2%
Taylor expanded in n around inf 23.8%
associate-*r/23.8%
associate-*r*23.6%
Simplified23.6%
*-un-lft-identity23.6%
sqrt-div23.6%
associate-*r*23.6%
sqrt-prod23.6%
*-commutative23.6%
sqrt-prod23.7%
sqrt-pow113.0%
metadata-eval13.0%
pow113.0%
sqrt-pow113.4%
metadata-eval13.4%
pow113.4%
sqrt-pow113.6%
metadata-eval13.6%
pow113.6%
Applied egg-rr13.6%
*-lft-identity13.6%
associate-/l*13.6%
*-commutative13.6%
associate-/l*17.8%
Simplified17.8%
add-sqr-sqrt17.6%
sqrt-unprod30.4%
swap-sqr27.4%
add-sqr-sqrt27.6%
associate-*r*27.6%
pow227.6%
Applied egg-rr27.6%
unpow227.6%
Applied egg-rr27.6%
Final simplification39.9%
(FPCore (n U t l Om U*) :precision binary64 (if (<= n 8.5e-141) (sqrt (* 2.0 (* U (* n t)))) (pow (* 2.0 (* t (* n U))) 0.5)))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (n <= 8.5e-141) {
tmp = sqrt((2.0 * (U * (n * t))));
} else {
tmp = pow((2.0 * (t * (n * U))), 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 (n <= 8.5d-141) then
tmp = sqrt((2.0d0 * (u * (n * t))))
else
tmp = (2.0d0 * (t * (n * u))) ** 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 (n <= 8.5e-141) {
tmp = Math.sqrt((2.0 * (U * (n * t))));
} else {
tmp = Math.pow((2.0 * (t * (n * U))), 0.5);
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if n <= 8.5e-141: tmp = math.sqrt((2.0 * (U * (n * t)))) else: tmp = math.pow((2.0 * (t * (n * U))), 0.5) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (n <= 8.5e-141) tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * t)))); else tmp = Float64(2.0 * Float64(t * Float64(n * U))) ^ 0.5; end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (n <= 8.5e-141) tmp = sqrt((2.0 * (U * (n * t)))); else tmp = (2.0 * (t * (n * U))) ^ 0.5; end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[n, 8.5e-141], N[Sqrt[N[(2.0 * N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Power[N[(2.0 * N[(t * N[(n * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;n \leq 8.5 \cdot 10^{-141}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;{\left(2 \cdot \left(t \cdot \left(n \cdot U\right)\right)\right)}^{0.5}\\
\end{array}
\end{array}
if n < 8.50000000000000021e-141Initial program 47.4%
Simplified53.6%
Taylor expanded in t around inf 40.5%
if 8.50000000000000021e-141 < n Initial program 48.9%
Simplified47.3%
Taylor expanded in t around inf 26.5%
pow1/230.3%
associate-*r*32.9%
*-commutative32.9%
Applied egg-rr32.9%
Final simplification38.0%
(FPCore (n U t l Om U*) :precision binary64 (pow (* (* n t) (* 2.0 U)) 0.5))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return pow(((n * t) * (2.0 * U)), 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 = ((n * t) * (2.0d0 * u)) ** 0.5d0
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.pow(((n * t) * (2.0 * U)), 0.5);
}
def code(n, U, t, l, Om, U_42_): return math.pow(((n * t) * (2.0 * U)), 0.5)
function code(n, U, t, l, Om, U_42_) return Float64(Float64(n * t) * Float64(2.0 * U)) ^ 0.5 end
function tmp = code(n, U, t, l, Om, U_42_) tmp = ((n * t) * (2.0 * U)) ^ 0.5; end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Power[N[(N[(n * t), $MachinePrecision] * N[(2.0 * U), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]
\begin{array}{l}
\\
{\left(\left(n \cdot t\right) \cdot \left(2 \cdot U\right)\right)}^{0.5}
\end{array}
Initial program 47.9%
Simplified51.5%
Taylor expanded in n around 0 42.9%
associate-*r*41.7%
cancel-sign-sub-inv41.7%
metadata-eval41.7%
*-commutative41.7%
associate-*l/41.7%
Simplified41.7%
pow1/247.3%
associate-*r*47.3%
*-commutative47.3%
+-commutative47.3%
associate-/l*47.3%
fma-define47.3%
Applied egg-rr47.3%
Taylor expanded in l around 0 36.1%
Taylor expanded in n around 0 37.5%
associate-*r*37.5%
*-commutative37.5%
Simplified37.5%
Final simplification37.5%
(FPCore (n U t l Om U*) :precision binary64 (sqrt (* 2.0 (* U (* n t)))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return sqrt((2.0 * (U * (n * t))));
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
code = sqrt((2.0d0 * (u * (n * t))))
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.sqrt((2.0 * (U * (n * t))));
}
def code(n, U, t, l, Om, U_42_): return math.sqrt((2.0 * (U * (n * t))))
function code(n, U, t, l, Om, U_42_) return sqrt(Float64(2.0 * Float64(U * Float64(n * t)))) end
function tmp = code(n, U, t, l, Om, U_42_) tmp = sqrt((2.0 * (U * (n * t)))); end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Sqrt[N[(2.0 * N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}
\end{array}
Initial program 47.9%
Simplified51.5%
Taylor expanded in t around inf 35.9%
herbie shell --seed 2024105
(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*))))))