
(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 22 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (n U t l Om U*) :precision binary64 (sqrt (* (* (* 2.0 n) U) (- (- t (* 2.0 (/ (* l l) Om))) (* (* n (pow (/ l Om) 2.0)) (- U U*))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * pow((l / Om), 2.0)) * (U - U_42_)))));
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
code = sqrt((((2.0d0 * n) * u) * ((t - (2.0d0 * ((l * l) / om))) - ((n * ((l / om) ** 2.0d0)) * (u - u_42)))))
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * Math.pow((l / Om), 2.0)) * (U - U_42_)))));
}
def code(n, U, t, l, Om, U_42_): return math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * math.pow((l / Om), 2.0)) * (U - U_42_)))))
function code(n, U, t, l, Om, U_42_) return sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) - Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U - U_42_))))) end
function tmp = code(n, U, t, l, Om, U_42_) tmp = sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * ((l / Om) ^ 2.0)) * (U - U_42_))))); end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)}
\end{array}
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* l (/ l Om)))
(t_2 (* (* 2.0 n) U))
(t_3 (* n (pow (/ l Om) 2.0)))
(t_4 (* t_3 (- U* U)))
(t_5 (sqrt (* t_2 (+ (- t (* 2.0 (/ (* l l) Om))) t_4)))))
(if (<= t_5 2e-160)
(* (sqrt (* 2.0 n)) (sqrt (* U (- t (fma 2.0 t_1 (* t_3 (- U U*)))))))
(if (<= t_5 INFINITY)
(sqrt (* t_2 (+ (- t (* 2.0 t_1)) t_4)))
(sqrt
(*
-2.0
(* (* U (* l l)) (* n (- (/ 2.0 Om) (* (/ n Om) (/ U* Om)))))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = l * (l / Om);
double t_2 = (2.0 * n) * U;
double t_3 = n * pow((l / Om), 2.0);
double t_4 = t_3 * (U_42_ - U);
double t_5 = sqrt((t_2 * ((t - (2.0 * ((l * l) / Om))) + t_4)));
double tmp;
if (t_5 <= 2e-160) {
tmp = sqrt((2.0 * n)) * sqrt((U * (t - fma(2.0, t_1, (t_3 * (U - U_42_))))));
} else if (t_5 <= ((double) INFINITY)) {
tmp = sqrt((t_2 * ((t - (2.0 * t_1)) + t_4)));
} else {
tmp = sqrt((-2.0 * ((U * (l * l)) * (n * ((2.0 / Om) - ((n / Om) * (U_42_ / Om)))))));
}
return tmp;
}
function code(n, U, t, l, Om, U_42_) t_1 = Float64(l * Float64(l / Om)) t_2 = Float64(Float64(2.0 * n) * U) t_3 = Float64(n * (Float64(l / Om) ^ 2.0)) t_4 = Float64(t_3 * Float64(U_42_ - U)) t_5 = sqrt(Float64(t_2 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) + t_4))) tmp = 0.0 if (t_5 <= 2e-160) tmp = Float64(sqrt(Float64(2.0 * n)) * sqrt(Float64(U * Float64(t - fma(2.0, t_1, Float64(t_3 * Float64(U - U_42_))))))); elseif (t_5 <= Inf) tmp = sqrt(Float64(t_2 * Float64(Float64(t - Float64(2.0 * t_1)) + t_4))); else tmp = sqrt(Float64(-2.0 * Float64(Float64(U * Float64(l * l)) * Float64(n * Float64(Float64(2.0 / Om) - Float64(Float64(n / Om) * Float64(U_42_ / Om))))))); end return tmp end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision]}, Block[{t$95$3 = N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(t$95$3 * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[Sqrt[N[(t$95$2 * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$4), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$5, 2e-160], N[(N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(U * N[(t - N[(2.0 * t$95$1 + N[(t$95$3 * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$5, Infinity], N[Sqrt[N[(t$95$2 * N[(N[(t - N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision] + t$95$4), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(-2.0 * N[(N[(U * N[(l * l), $MachinePrecision]), $MachinePrecision] * N[(n * N[(N[(2.0 / Om), $MachinePrecision] - N[(N[(n / Om), $MachinePrecision] * N[(U$42$ / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \ell \cdot \frac{\ell}{Om}\\
t_2 := \left(2 \cdot n\right) \cdot U\\
t_3 := n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\\
t_4 := t_3 \cdot \left(U* - U\right)\\
t_5 := \sqrt{t_2 \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) + t_4\right)}\\
\mathbf{if}\;t_5 \leq 2 \cdot 10^{-160}:\\
\;\;\;\;\sqrt{2 \cdot n} \cdot \sqrt{U \cdot \left(t - \mathsf{fma}\left(2, t_1, t_3 \cdot \left(U - U*\right)\right)\right)}\\
\mathbf{elif}\;t_5 \leq \infty:\\
\;\;\;\;\sqrt{t_2 \cdot \left(\left(t - 2 \cdot t_1\right) + t_4\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{-2 \cdot \left(\left(U \cdot \left(\ell \cdot \ell\right)\right) \cdot \left(n \cdot \left(\frac{2}{Om} - \frac{n}{Om} \cdot \frac{U*}{Om}\right)\right)\right)}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*))))) < 2e-160Initial program 9.7%
Simplified9.7%
pow1/29.7%
fma-udef9.7%
associate-*l/9.7%
associate-*r*9.7%
*-commutative9.7%
associate--l-9.7%
associate-*r*9.7%
associate-*l*13.5%
Applied egg-rr44.2%
*-commutative44.2%
unpow1/244.2%
Simplified44.2%
if 2e-160 < (sqrt.f64 (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*))))) < +inf.0Initial program 70.4%
associate-*l/75.2%
Applied egg-rr75.2%
if +inf.0 < (sqrt.f64 (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*))))) Initial program 0.0%
associate-*l/7.1%
Applied egg-rr7.1%
Taylor expanded in n around 0 0.0%
unpow20.0%
times-frac2.5%
unpow22.5%
associate-*r/7.2%
Simplified7.2%
Taylor expanded in U around 0 2.9%
associate-/l*0.5%
associate-*r/0.5%
neg-mul-10.5%
unpow20.5%
times-frac3.1%
unpow23.1%
Simplified3.1%
Taylor expanded in l around inf 34.9%
associate-*r*34.9%
mul-1-neg34.9%
+-commutative34.9%
sub-neg34.9%
unpow234.9%
associate-*r/34.9%
metadata-eval34.9%
*-commutative34.9%
unpow234.9%
times-frac44.1%
Simplified44.1%
Final simplification65.8%
(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_3 (sqrt (* t_2 (+ (- t (* 2.0 (/ (* l l) Om))) t_1)))))
(if (<= t_3 0.0)
(* (sqrt (* 2.0 U)) (sqrt (* n t)))
(if (<= t_3 INFINITY)
(sqrt (* t_2 (+ (- t (* 2.0 (* l (/ l Om)))) t_1)))
(sqrt
(*
-2.0
(* (* U (* l l)) (* n (- (/ 2.0 Om) (* (/ n Om) (/ U* Om)))))))))))
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;
double t_3 = sqrt((t_2 * ((t - (2.0 * ((l * l) / Om))) + t_1)));
double tmp;
if (t_3 <= 0.0) {
tmp = sqrt((2.0 * U)) * sqrt((n * t));
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt((t_2 * ((t - (2.0 * (l * (l / Om)))) + t_1)));
} else {
tmp = sqrt((-2.0 * ((U * (l * l)) * (n * ((2.0 / Om) - ((n / Om) * (U_42_ / Om)))))));
}
return tmp;
}
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;
double t_3 = Math.sqrt((t_2 * ((t - (2.0 * ((l * l) / Om))) + t_1)));
double tmp;
if (t_3 <= 0.0) {
tmp = Math.sqrt((2.0 * U)) * Math.sqrt((n * t));
} else if (t_3 <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt((t_2 * ((t - (2.0 * (l * (l / Om)))) + t_1)));
} else {
tmp = Math.sqrt((-2.0 * ((U * (l * l)) * (n * ((2.0 / Om) - ((n / Om) * (U_42_ / Om)))))));
}
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_3 = math.sqrt((t_2 * ((t - (2.0 * ((l * l) / Om))) + t_1))) tmp = 0 if t_3 <= 0.0: tmp = math.sqrt((2.0 * U)) * math.sqrt((n * t)) elif t_3 <= math.inf: tmp = math.sqrt((t_2 * ((t - (2.0 * (l * (l / Om)))) + t_1))) else: tmp = math.sqrt((-2.0 * ((U * (l * l)) * (n * ((2.0 / Om) - ((n / Om) * (U_42_ / Om))))))) 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(2.0 * n) * U) t_3 = sqrt(Float64(t_2 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) + t_1))) tmp = 0.0 if (t_3 <= 0.0) tmp = Float64(sqrt(Float64(2.0 * U)) * sqrt(Float64(n * t))); elseif (t_3 <= Inf) tmp = sqrt(Float64(t_2 * Float64(Float64(t - Float64(2.0 * Float64(l * Float64(l / Om)))) + t_1))); else tmp = sqrt(Float64(-2.0 * Float64(Float64(U * Float64(l * l)) * Float64(n * Float64(Float64(2.0 / Om) - Float64(Float64(n / Om) * Float64(U_42_ / Om))))))); 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_3 = sqrt((t_2 * ((t - (2.0 * ((l * l) / Om))) + t_1))); tmp = 0.0; if (t_3 <= 0.0) tmp = sqrt((2.0 * U)) * sqrt((n * t)); elseif (t_3 <= Inf) tmp = sqrt((t_2 * ((t - (2.0 * (l * (l / Om)))) + t_1))); else tmp = sqrt((-2.0 * ((U * (l * l)) * (n * ((2.0 / Om) - ((n / Om) * (U_42_ / Om))))))); 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[(2.0 * n), $MachinePrecision] * U), $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(t$95$2 * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$3, 0.0], N[(N[Sqrt[N[(2.0 * U), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(n * t), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[Sqrt[N[(t$95$2 * N[(N[(t - N[(2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(-2.0 * N[(N[(U * N[(l * l), $MachinePrecision]), $MachinePrecision] * N[(n * N[(N[(2.0 / Om), $MachinePrecision] - N[(N[(n / Om), $MachinePrecision] * N[(U$42$ / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $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(2 \cdot n\right) \cdot U\\
t_3 := \sqrt{t_2 \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) + t_1\right)}\\
\mathbf{if}\;t_3 \leq 0:\\
\;\;\;\;\sqrt{2 \cdot U} \cdot \sqrt{n \cdot t}\\
\mathbf{elif}\;t_3 \leq \infty:\\
\;\;\;\;\sqrt{t_2 \cdot \left(\left(t - 2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right) + t_1\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{-2 \cdot \left(\left(U \cdot \left(\ell \cdot \ell\right)\right) \cdot \left(n \cdot \left(\frac{2}{Om} - \frac{n}{Om} \cdot \frac{U*}{Om}\right)\right)\right)}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*))))) < 0.0Initial program 8.7%
Simplified8.7%
Taylor expanded in t around inf 12.7%
associate-*r*12.7%
Simplified12.7%
sqrt-prod33.0%
Applied egg-rr33.0%
if 0.0 < (sqrt.f64 (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*))))) < +inf.0Initial program 70.2%
associate-*l/75.1%
Applied egg-rr75.1%
if +inf.0 < (sqrt.f64 (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*))))) Initial program 0.0%
associate-*l/7.1%
Applied egg-rr7.1%
Taylor expanded in n around 0 0.0%
unpow20.0%
times-frac2.5%
unpow22.5%
associate-*r/7.2%
Simplified7.2%
Taylor expanded in U around 0 2.9%
associate-/l*0.5%
associate-*r/0.5%
neg-mul-10.5%
unpow20.5%
times-frac3.1%
unpow23.1%
Simplified3.1%
Taylor expanded in l around inf 34.9%
associate-*r*34.9%
mul-1-neg34.9%
+-commutative34.9%
sub-neg34.9%
unpow234.9%
associate-*r/34.9%
metadata-eval34.9%
*-commutative34.9%
unpow234.9%
times-frac44.1%
Simplified44.1%
Final simplification64.3%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* 2.0 (* n U))) (t_2 (* l (/ l Om))))
(if (<= l 1.25e-253)
(sqrt
(* (* (* 2.0 n) U) (+ (- t (* 2.0 t_2)) (* (/ (* n t_2) Om) (- U* U)))))
(if (<= l 7.5e-228)
(* (sqrt t_1) (sqrt t))
(if (<= l 7e-115)
(sqrt
(*
t_1
(+
(+ t (* (/ (* l l) Om) -2.0))
(* n (* (pow (/ l Om) 2.0) (- U* U))))))
(if (<= l 3.6e+184)
(sqrt
(*
2.0
(*
(* n U)
(+ t (* l (* l (- (* (/ n Om) (/ U* Om)) (/ 2.0 Om))))))))
(sqrt
(*
2.0
(*
U
(*
(* n l)
(+
(* (/ l Om) -2.0)
(* (/ l Om) (/ (* n (- U* U)) Om)))))))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = 2.0 * (n * U);
double t_2 = l * (l / Om);
double tmp;
if (l <= 1.25e-253) {
tmp = sqrt((((2.0 * n) * U) * ((t - (2.0 * t_2)) + (((n * t_2) / Om) * (U_42_ - U)))));
} else if (l <= 7.5e-228) {
tmp = sqrt(t_1) * sqrt(t);
} else if (l <= 7e-115) {
tmp = sqrt((t_1 * ((t + (((l * l) / Om) * -2.0)) + (n * (pow((l / Om), 2.0) * (U_42_ - U))))));
} else if (l <= 3.6e+184) {
tmp = sqrt((2.0 * ((n * U) * (t + (l * (l * (((n / Om) * (U_42_ / Om)) - (2.0 / Om))))))));
} else {
tmp = sqrt((2.0 * (U * ((n * l) * (((l / Om) * -2.0) + ((l / Om) * ((n * (U_42_ - U)) / Om)))))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = 2.0d0 * (n * u)
t_2 = l * (l / om)
if (l <= 1.25d-253) then
tmp = sqrt((((2.0d0 * n) * u) * ((t - (2.0d0 * t_2)) + (((n * t_2) / om) * (u_42 - u)))))
else if (l <= 7.5d-228) then
tmp = sqrt(t_1) * sqrt(t)
else if (l <= 7d-115) then
tmp = sqrt((t_1 * ((t + (((l * l) / om) * (-2.0d0))) + (n * (((l / om) ** 2.0d0) * (u_42 - u))))))
else if (l <= 3.6d+184) then
tmp = sqrt((2.0d0 * ((n * u) * (t + (l * (l * (((n / om) * (u_42 / om)) - (2.0d0 / om))))))))
else
tmp = sqrt((2.0d0 * (u * ((n * l) * (((l / om) * (-2.0d0)) + ((l / om) * ((n * (u_42 - u)) / om)))))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = 2.0 * (n * U);
double t_2 = l * (l / Om);
double tmp;
if (l <= 1.25e-253) {
tmp = Math.sqrt((((2.0 * n) * U) * ((t - (2.0 * t_2)) + (((n * t_2) / Om) * (U_42_ - U)))));
} else if (l <= 7.5e-228) {
tmp = Math.sqrt(t_1) * Math.sqrt(t);
} else if (l <= 7e-115) {
tmp = Math.sqrt((t_1 * ((t + (((l * l) / Om) * -2.0)) + (n * (Math.pow((l / Om), 2.0) * (U_42_ - U))))));
} else if (l <= 3.6e+184) {
tmp = Math.sqrt((2.0 * ((n * U) * (t + (l * (l * (((n / Om) * (U_42_ / Om)) - (2.0 / Om))))))));
} else {
tmp = Math.sqrt((2.0 * (U * ((n * l) * (((l / Om) * -2.0) + ((l / Om) * ((n * (U_42_ - U)) / Om)))))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = 2.0 * (n * U) t_2 = l * (l / Om) tmp = 0 if l <= 1.25e-253: tmp = math.sqrt((((2.0 * n) * U) * ((t - (2.0 * t_2)) + (((n * t_2) / Om) * (U_42_ - U))))) elif l <= 7.5e-228: tmp = math.sqrt(t_1) * math.sqrt(t) elif l <= 7e-115: tmp = math.sqrt((t_1 * ((t + (((l * l) / Om) * -2.0)) + (n * (math.pow((l / Om), 2.0) * (U_42_ - U)))))) elif l <= 3.6e+184: tmp = math.sqrt((2.0 * ((n * U) * (t + (l * (l * (((n / Om) * (U_42_ / Om)) - (2.0 / Om)))))))) else: tmp = math.sqrt((2.0 * (U * ((n * l) * (((l / Om) * -2.0) + ((l / Om) * ((n * (U_42_ - U)) / Om))))))) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(2.0 * Float64(n * U)) t_2 = Float64(l * Float64(l / Om)) tmp = 0.0 if (l <= 1.25e-253) tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * t_2)) + Float64(Float64(Float64(n * t_2) / Om) * Float64(U_42_ - U))))); elseif (l <= 7.5e-228) tmp = Float64(sqrt(t_1) * sqrt(t)); elseif (l <= 7e-115) tmp = sqrt(Float64(t_1 * Float64(Float64(t + Float64(Float64(Float64(l * l) / Om) * -2.0)) + Float64(n * Float64((Float64(l / Om) ^ 2.0) * Float64(U_42_ - U)))))); elseif (l <= 3.6e+184) tmp = sqrt(Float64(2.0 * Float64(Float64(n * U) * Float64(t + Float64(l * Float64(l * Float64(Float64(Float64(n / Om) * Float64(U_42_ / Om)) - Float64(2.0 / Om)))))))); else tmp = sqrt(Float64(2.0 * Float64(U * Float64(Float64(n * l) * Float64(Float64(Float64(l / Om) * -2.0) + Float64(Float64(l / Om) * Float64(Float64(n * Float64(U_42_ - U)) / Om))))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = 2.0 * (n * U); t_2 = l * (l / Om); tmp = 0.0; if (l <= 1.25e-253) tmp = sqrt((((2.0 * n) * U) * ((t - (2.0 * t_2)) + (((n * t_2) / Om) * (U_42_ - U))))); elseif (l <= 7.5e-228) tmp = sqrt(t_1) * sqrt(t); elseif (l <= 7e-115) tmp = sqrt((t_1 * ((t + (((l * l) / Om) * -2.0)) + (n * (((l / Om) ^ 2.0) * (U_42_ - U)))))); elseif (l <= 3.6e+184) tmp = sqrt((2.0 * ((n * U) * (t + (l * (l * (((n / Om) * (U_42_ / Om)) - (2.0 / Om)))))))); else tmp = sqrt((2.0 * (U * ((n * l) * (((l / Om) * -2.0) + ((l / Om) * ((n * (U_42_ - U)) / Om))))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, 1.25e-253], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * t$95$2), $MachinePrecision]), $MachinePrecision] + N[(N[(N[(n * t$95$2), $MachinePrecision] / Om), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 7.5e-228], N[(N[Sqrt[t$95$1], $MachinePrecision] * N[Sqrt[t], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 7e-115], N[Sqrt[N[(t$95$1 * N[(N[(t + N[(N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision] + N[(n * N[(N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 3.6e+184], N[Sqrt[N[(2.0 * N[(N[(n * U), $MachinePrecision] * N[(t + N[(l * N[(l * N[(N[(N[(n / Om), $MachinePrecision] * N[(U$42$ / Om), $MachinePrecision]), $MachinePrecision] - N[(2.0 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(U * N[(N[(n * l), $MachinePrecision] * N[(N[(N[(l / Om), $MachinePrecision] * -2.0), $MachinePrecision] + N[(N[(l / Om), $MachinePrecision] * N[(N[(n * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := 2 \cdot \left(n \cdot U\right)\\
t_2 := \ell \cdot \frac{\ell}{Om}\\
\mathbf{if}\;\ell \leq 1.25 \cdot 10^{-253}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot t_2\right) + \frac{n \cdot t_2}{Om} \cdot \left(U* - U\right)\right)}\\
\mathbf{elif}\;\ell \leq 7.5 \cdot 10^{-228}:\\
\;\;\;\;\sqrt{t_1} \cdot \sqrt{t}\\
\mathbf{elif}\;\ell \leq 7 \cdot 10^{-115}:\\
\;\;\;\;\sqrt{t_1 \cdot \left(\left(t + \frac{\ell \cdot \ell}{Om} \cdot -2\right) + n \cdot \left({\left(\frac{\ell}{Om}\right)}^{2} \cdot \left(U* - U\right)\right)\right)}\\
\mathbf{elif}\;\ell \leq 3.6 \cdot 10^{+184}:\\
\;\;\;\;\sqrt{2 \cdot \left(\left(n \cdot U\right) \cdot \left(t + \ell \cdot \left(\ell \cdot \left(\frac{n}{Om} \cdot \frac{U*}{Om} - \frac{2}{Om}\right)\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(\left(n \cdot \ell\right) \cdot \left(\frac{\ell}{Om} \cdot -2 + \frac{\ell}{Om} \cdot \frac{n \cdot \left(U* - U\right)}{Om}\right)\right)\right)}\\
\end{array}
\end{array}
if l < 1.24999999999999993e-253Initial program 49.2%
associate-*l/52.6%
Applied egg-rr52.6%
Taylor expanded in n around 0 39.3%
unpow239.3%
times-frac45.2%
unpow245.2%
associate-*r/49.7%
Simplified49.7%
associate-*r/51.4%
Applied egg-rr51.4%
if 1.24999999999999993e-253 < l < 7.4999999999999999e-228Initial program 41.5%
Simplified41.5%
Taylor expanded in t around inf 41.5%
sqrt-prod64.3%
Applied egg-rr64.3%
if 7.4999999999999999e-228 < l < 7.0000000000000004e-115Initial program 65.8%
Simplified65.8%
if 7.0000000000000004e-115 < l < 3.60000000000000014e184Initial program 60.6%
Simplified56.9%
Taylor expanded in t around 0 37.4%
distribute-lft-out37.4%
unpow237.4%
associate-*r/37.4%
*-commutative37.4%
associate-*l*37.4%
unpow237.4%
unpow237.4%
Simplified37.4%
*-un-lft-identity37.4%
distribute-lft-out37.4%
associate-*l/37.4%
times-frac43.0%
associate-*l/42.9%
*-commutative42.9%
Applied egg-rr42.9%
*-lft-identity42.9%
distribute-lft-in42.9%
associate-*r*48.1%
associate-*r*55.3%
distribute-lft-out57.0%
*-commutative57.0%
associate-*l*57.2%
distribute-lft-out--62.3%
Simplified67.3%
Taylor expanded in U around 0 56.4%
mul-1-neg56.4%
associate-/l*58.1%
distribute-neg-frac58.1%
unpow258.1%
times-frac66.7%
Simplified66.7%
Taylor expanded in l around 0 57.1%
mul-1-neg57.1%
*-commutative57.1%
distribute-rgt-neg-in57.1%
mul-1-neg57.1%
+-commutative57.1%
sub-neg57.1%
associate-*r/57.1%
metadata-eval57.1%
*-commutative57.1%
unpow257.1%
times-frac71.9%
Simplified71.9%
if 3.60000000000000014e184 < l Initial program 18.7%
Simplified18.3%
Taylor expanded in t around 0 17.8%
distribute-lft-out17.8%
unpow217.8%
associate-*r/17.8%
*-commutative17.8%
associate-*l*17.8%
unpow217.8%
unpow217.8%
Simplified17.8%
*-un-lft-identity17.8%
distribute-lft-out17.8%
associate-*l/17.8%
times-frac22.5%
associate-*l/44.5%
*-commutative44.5%
Applied egg-rr44.5%
*-lft-identity44.5%
distribute-lft-in44.5%
associate-*r*44.5%
associate-*r*44.1%
distribute-lft-out44.1%
*-commutative44.1%
associate-*l*44.3%
distribute-lft-out--45.3%
Simplified45.3%
Taylor expanded in t around 0 32.1%
associate-*r*36.3%
unpow236.3%
times-frac45.5%
Simplified45.5%
Final simplification57.2%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* l (/ l Om))) (t_2 (- t (* 2.0 t_1))) (t_3 (* (* 2.0 n) U)))
(if (<= l 6.5e-253)
(sqrt (* t_3 (+ t_2 (* (/ (* n t_1) Om) (- U* U)))))
(if (<= l 3.8e-230)
(* (sqrt (* 2.0 (* n U))) (sqrt t))
(if (<= l 1.3e-31)
(sqrt (* t_3 (+ t_2 (* (* t_1 (/ n Om)) (- U* U)))))
(if (<= l 1.35e+184)
(sqrt
(*
2.0
(*
(* n U)
(+ t (* l (* l (- (* (/ n Om) (/ U* Om)) (/ 2.0 Om))))))))
(sqrt
(*
2.0
(*
U
(*
(* n l)
(+
(* (/ l Om) -2.0)
(* (/ l Om) (/ (* n (- U* U)) Om)))))))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = l * (l / Om);
double t_2 = t - (2.0 * t_1);
double t_3 = (2.0 * n) * U;
double tmp;
if (l <= 6.5e-253) {
tmp = sqrt((t_3 * (t_2 + (((n * t_1) / Om) * (U_42_ - U)))));
} else if (l <= 3.8e-230) {
tmp = sqrt((2.0 * (n * U))) * sqrt(t);
} else if (l <= 1.3e-31) {
tmp = sqrt((t_3 * (t_2 + ((t_1 * (n / Om)) * (U_42_ - U)))));
} else if (l <= 1.35e+184) {
tmp = sqrt((2.0 * ((n * U) * (t + (l * (l * (((n / Om) * (U_42_ / Om)) - (2.0 / Om))))))));
} else {
tmp = sqrt((2.0 * (U * ((n * l) * (((l / Om) * -2.0) + ((l / Om) * ((n * (U_42_ - U)) / Om)))))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: tmp
t_1 = l * (l / om)
t_2 = t - (2.0d0 * t_1)
t_3 = (2.0d0 * n) * u
if (l <= 6.5d-253) then
tmp = sqrt((t_3 * (t_2 + (((n * t_1) / om) * (u_42 - u)))))
else if (l <= 3.8d-230) then
tmp = sqrt((2.0d0 * (n * u))) * sqrt(t)
else if (l <= 1.3d-31) then
tmp = sqrt((t_3 * (t_2 + ((t_1 * (n / om)) * (u_42 - u)))))
else if (l <= 1.35d+184) then
tmp = sqrt((2.0d0 * ((n * u) * (t + (l * (l * (((n / om) * (u_42 / om)) - (2.0d0 / om))))))))
else
tmp = sqrt((2.0d0 * (u * ((n * l) * (((l / om) * (-2.0d0)) + ((l / om) * ((n * (u_42 - u)) / om)))))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = l * (l / Om);
double t_2 = t - (2.0 * t_1);
double t_3 = (2.0 * n) * U;
double tmp;
if (l <= 6.5e-253) {
tmp = Math.sqrt((t_3 * (t_2 + (((n * t_1) / Om) * (U_42_ - U)))));
} else if (l <= 3.8e-230) {
tmp = Math.sqrt((2.0 * (n * U))) * Math.sqrt(t);
} else if (l <= 1.3e-31) {
tmp = Math.sqrt((t_3 * (t_2 + ((t_1 * (n / Om)) * (U_42_ - U)))));
} else if (l <= 1.35e+184) {
tmp = Math.sqrt((2.0 * ((n * U) * (t + (l * (l * (((n / Om) * (U_42_ / Om)) - (2.0 / Om))))))));
} else {
tmp = Math.sqrt((2.0 * (U * ((n * l) * (((l / Om) * -2.0) + ((l / Om) * ((n * (U_42_ - U)) / Om)))))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = l * (l / Om) t_2 = t - (2.0 * t_1) t_3 = (2.0 * n) * U tmp = 0 if l <= 6.5e-253: tmp = math.sqrt((t_3 * (t_2 + (((n * t_1) / Om) * (U_42_ - U))))) elif l <= 3.8e-230: tmp = math.sqrt((2.0 * (n * U))) * math.sqrt(t) elif l <= 1.3e-31: tmp = math.sqrt((t_3 * (t_2 + ((t_1 * (n / Om)) * (U_42_ - U))))) elif l <= 1.35e+184: tmp = math.sqrt((2.0 * ((n * U) * (t + (l * (l * (((n / Om) * (U_42_ / Om)) - (2.0 / Om)))))))) else: tmp = math.sqrt((2.0 * (U * ((n * l) * (((l / Om) * -2.0) + ((l / Om) * ((n * (U_42_ - U)) / Om))))))) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(l * Float64(l / Om)) t_2 = Float64(t - Float64(2.0 * t_1)) t_3 = Float64(Float64(2.0 * n) * U) tmp = 0.0 if (l <= 6.5e-253) tmp = sqrt(Float64(t_3 * Float64(t_2 + Float64(Float64(Float64(n * t_1) / Om) * Float64(U_42_ - U))))); elseif (l <= 3.8e-230) tmp = Float64(sqrt(Float64(2.0 * Float64(n * U))) * sqrt(t)); elseif (l <= 1.3e-31) tmp = sqrt(Float64(t_3 * Float64(t_2 + Float64(Float64(t_1 * Float64(n / Om)) * Float64(U_42_ - U))))); elseif (l <= 1.35e+184) tmp = sqrt(Float64(2.0 * Float64(Float64(n * U) * Float64(t + Float64(l * Float64(l * Float64(Float64(Float64(n / Om) * Float64(U_42_ / Om)) - Float64(2.0 / Om)))))))); else tmp = sqrt(Float64(2.0 * Float64(U * Float64(Float64(n * l) * Float64(Float64(Float64(l / Om) * -2.0) + Float64(Float64(l / Om) * Float64(Float64(n * Float64(U_42_ - U)) / Om))))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = l * (l / Om); t_2 = t - (2.0 * t_1); t_3 = (2.0 * n) * U; tmp = 0.0; if (l <= 6.5e-253) tmp = sqrt((t_3 * (t_2 + (((n * t_1) / Om) * (U_42_ - U))))); elseif (l <= 3.8e-230) tmp = sqrt((2.0 * (n * U))) * sqrt(t); elseif (l <= 1.3e-31) tmp = sqrt((t_3 * (t_2 + ((t_1 * (n / Om)) * (U_42_ - U))))); elseif (l <= 1.35e+184) tmp = sqrt((2.0 * ((n * U) * (t + (l * (l * (((n / Om) * (U_42_ / Om)) - (2.0 / Om)))))))); else tmp = sqrt((2.0 * (U * ((n * l) * (((l / Om) * -2.0) + ((l / Om) * ((n * (U_42_ - U)) / Om))))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t - N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision]}, If[LessEqual[l, 6.5e-253], N[Sqrt[N[(t$95$3 * N[(t$95$2 + N[(N[(N[(n * t$95$1), $MachinePrecision] / Om), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 3.8e-230], N[(N[Sqrt[N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 1.3e-31], N[Sqrt[N[(t$95$3 * N[(t$95$2 + N[(N[(t$95$1 * N[(n / Om), $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 1.35e+184], N[Sqrt[N[(2.0 * N[(N[(n * U), $MachinePrecision] * N[(t + N[(l * N[(l * N[(N[(N[(n / Om), $MachinePrecision] * N[(U$42$ / Om), $MachinePrecision]), $MachinePrecision] - N[(2.0 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(U * N[(N[(n * l), $MachinePrecision] * N[(N[(N[(l / Om), $MachinePrecision] * -2.0), $MachinePrecision] + N[(N[(l / Om), $MachinePrecision] * N[(N[(n * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \ell \cdot \frac{\ell}{Om}\\
t_2 := t - 2 \cdot t_1\\
t_3 := \left(2 \cdot n\right) \cdot U\\
\mathbf{if}\;\ell \leq 6.5 \cdot 10^{-253}:\\
\;\;\;\;\sqrt{t_3 \cdot \left(t_2 + \frac{n \cdot t_1}{Om} \cdot \left(U* - U\right)\right)}\\
\mathbf{elif}\;\ell \leq 3.8 \cdot 10^{-230}:\\
\;\;\;\;\sqrt{2 \cdot \left(n \cdot U\right)} \cdot \sqrt{t}\\
\mathbf{elif}\;\ell \leq 1.3 \cdot 10^{-31}:\\
\;\;\;\;\sqrt{t_3 \cdot \left(t_2 + \left(t_1 \cdot \frac{n}{Om}\right) \cdot \left(U* - U\right)\right)}\\
\mathbf{elif}\;\ell \leq 1.35 \cdot 10^{+184}:\\
\;\;\;\;\sqrt{2 \cdot \left(\left(n \cdot U\right) \cdot \left(t + \ell \cdot \left(\ell \cdot \left(\frac{n}{Om} \cdot \frac{U*}{Om} - \frac{2}{Om}\right)\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(\left(n \cdot \ell\right) \cdot \left(\frac{\ell}{Om} \cdot -2 + \frac{\ell}{Om} \cdot \frac{n \cdot \left(U* - U\right)}{Om}\right)\right)\right)}\\
\end{array}
\end{array}
if l < 6.4999999999999998e-253Initial program 49.2%
associate-*l/52.6%
Applied egg-rr52.6%
Taylor expanded in n around 0 39.3%
unpow239.3%
times-frac45.2%
unpow245.2%
associate-*r/49.7%
Simplified49.7%
associate-*r/51.4%
Applied egg-rr51.4%
if 6.4999999999999998e-253 < l < 3.7999999999999998e-230Initial program 41.5%
Simplified41.5%
Taylor expanded in t around inf 41.5%
sqrt-prod64.3%
Applied egg-rr64.3%
if 3.7999999999999998e-230 < l < 1.29999999999999998e-31Initial program 70.7%
associate-*l/70.7%
Applied egg-rr70.7%
Taylor expanded in n around 0 69.5%
unpow269.5%
times-frac72.6%
unpow272.6%
associate-*r/72.6%
Simplified72.6%
if 1.29999999999999998e-31 < l < 1.35e184Initial program 49.7%
Simplified46.6%
Taylor expanded in t around 0 27.1%
distribute-lft-out27.1%
unpow227.1%
associate-*r/27.1%
*-commutative27.1%
associate-*l*27.1%
unpow227.1%
unpow227.1%
Simplified27.1%
*-un-lft-identity27.1%
distribute-lft-out27.1%
associate-*l/27.1%
times-frac36.7%
associate-*l/36.7%
*-commutative36.7%
Applied egg-rr36.7%
*-lft-identity36.7%
distribute-lft-in36.7%
associate-*r*42.5%
associate-*r*52.6%
distribute-lft-out55.5%
*-commutative55.5%
associate-*l*55.5%
distribute-lft-out--64.6%
Simplified64.6%
Taylor expanded in U around 0 46.7%
mul-1-neg46.7%
associate-/l*46.7%
distribute-neg-frac46.7%
unpow246.7%
times-frac61.7%
Simplified61.7%
Taylor expanded in l around 0 57.1%
mul-1-neg57.1%
*-commutative57.1%
distribute-rgt-neg-in57.1%
mul-1-neg57.1%
+-commutative57.1%
sub-neg57.1%
associate-*r/57.1%
metadata-eval57.1%
*-commutative57.1%
unpow257.1%
times-frac70.8%
Simplified70.8%
if 1.35e184 < l Initial program 18.7%
Simplified18.3%
Taylor expanded in t around 0 17.8%
distribute-lft-out17.8%
unpow217.8%
associate-*r/17.8%
*-commutative17.8%
associate-*l*17.8%
unpow217.8%
unpow217.8%
Simplified17.8%
*-un-lft-identity17.8%
distribute-lft-out17.8%
associate-*l/17.8%
times-frac22.5%
associate-*l/44.5%
*-commutative44.5%
Applied egg-rr44.5%
*-lft-identity44.5%
distribute-lft-in44.5%
associate-*r*44.5%
associate-*r*44.1%
distribute-lft-out44.1%
*-commutative44.1%
associate-*l*44.3%
distribute-lft-out--45.3%
Simplified45.3%
Taylor expanded in t around 0 32.1%
associate-*r*36.3%
unpow236.3%
times-frac45.5%
Simplified45.5%
Final simplification57.7%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* l (/ l Om))))
(if (<= l 2e-34)
(sqrt
(* (* (* 2.0 n) U) (+ (- t (* 2.0 t_1)) (* (* t_1 (/ n Om)) (- U* U)))))
(if (<= l 4e+184)
(sqrt
(*
2.0
(* (* n U) (+ t (* l (* l (- (* (/ n Om) (/ U* Om)) (/ 2.0 Om))))))))
(sqrt
(*
2.0
(*
U
(*
(* n l)
(+ (* (/ l Om) -2.0) (* (/ l Om) (/ (* n (- U* U)) Om)))))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = l * (l / Om);
double tmp;
if (l <= 2e-34) {
tmp = sqrt((((2.0 * n) * U) * ((t - (2.0 * t_1)) + ((t_1 * (n / Om)) * (U_42_ - U)))));
} else if (l <= 4e+184) {
tmp = sqrt((2.0 * ((n * U) * (t + (l * (l * (((n / Om) * (U_42_ / Om)) - (2.0 / Om))))))));
} else {
tmp = sqrt((2.0 * (U * ((n * l) * (((l / Om) * -2.0) + ((l / Om) * ((n * (U_42_ - U)) / Om)))))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: t_1
real(8) :: tmp
t_1 = l * (l / om)
if (l <= 2d-34) then
tmp = sqrt((((2.0d0 * n) * u) * ((t - (2.0d0 * t_1)) + ((t_1 * (n / om)) * (u_42 - u)))))
else if (l <= 4d+184) then
tmp = sqrt((2.0d0 * ((n * u) * (t + (l * (l * (((n / om) * (u_42 / om)) - (2.0d0 / om))))))))
else
tmp = sqrt((2.0d0 * (u * ((n * l) * (((l / om) * (-2.0d0)) + ((l / om) * ((n * (u_42 - u)) / om)))))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = l * (l / Om);
double tmp;
if (l <= 2e-34) {
tmp = Math.sqrt((((2.0 * n) * U) * ((t - (2.0 * t_1)) + ((t_1 * (n / Om)) * (U_42_ - U)))));
} else if (l <= 4e+184) {
tmp = Math.sqrt((2.0 * ((n * U) * (t + (l * (l * (((n / Om) * (U_42_ / Om)) - (2.0 / Om))))))));
} else {
tmp = Math.sqrt((2.0 * (U * ((n * l) * (((l / Om) * -2.0) + ((l / Om) * ((n * (U_42_ - U)) / Om)))))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = l * (l / Om) tmp = 0 if l <= 2e-34: tmp = math.sqrt((((2.0 * n) * U) * ((t - (2.0 * t_1)) + ((t_1 * (n / Om)) * (U_42_ - U))))) elif l <= 4e+184: tmp = math.sqrt((2.0 * ((n * U) * (t + (l * (l * (((n / Om) * (U_42_ / Om)) - (2.0 / Om)))))))) else: tmp = math.sqrt((2.0 * (U * ((n * l) * (((l / Om) * -2.0) + ((l / Om) * ((n * (U_42_ - U)) / Om))))))) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(l * Float64(l / Om)) tmp = 0.0 if (l <= 2e-34) tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * t_1)) + Float64(Float64(t_1 * Float64(n / Om)) * Float64(U_42_ - U))))); elseif (l <= 4e+184) tmp = sqrt(Float64(2.0 * Float64(Float64(n * U) * Float64(t + Float64(l * Float64(l * Float64(Float64(Float64(n / Om) * Float64(U_42_ / Om)) - Float64(2.0 / Om)))))))); else tmp = sqrt(Float64(2.0 * Float64(U * Float64(Float64(n * l) * Float64(Float64(Float64(l / Om) * -2.0) + Float64(Float64(l / Om) * Float64(Float64(n * Float64(U_42_ - U)) / Om))))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = l * (l / Om); tmp = 0.0; if (l <= 2e-34) tmp = sqrt((((2.0 * n) * U) * ((t - (2.0 * t_1)) + ((t_1 * (n / Om)) * (U_42_ - U))))); elseif (l <= 4e+184) tmp = sqrt((2.0 * ((n * U) * (t + (l * (l * (((n / Om) * (U_42_ / Om)) - (2.0 / Om)))))))); else tmp = sqrt((2.0 * (U * ((n * l) * (((l / Om) * -2.0) + ((l / Om) * ((n * (U_42_ - U)) / Om))))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, 2e-34], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision] + N[(N[(t$95$1 * N[(n / Om), $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 4e+184], N[Sqrt[N[(2.0 * N[(N[(n * U), $MachinePrecision] * N[(t + N[(l * N[(l * N[(N[(N[(n / Om), $MachinePrecision] * N[(U$42$ / Om), $MachinePrecision]), $MachinePrecision] - N[(2.0 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(U * N[(N[(n * l), $MachinePrecision] * N[(N[(N[(l / Om), $MachinePrecision] * -2.0), $MachinePrecision] + N[(N[(l / Om), $MachinePrecision] * N[(N[(n * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \ell \cdot \frac{\ell}{Om}\\
\mathbf{if}\;\ell \leq 2 \cdot 10^{-34}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot t_1\right) + \left(t_1 \cdot \frac{n}{Om}\right) \cdot \left(U* - U\right)\right)}\\
\mathbf{elif}\;\ell \leq 4 \cdot 10^{+184}:\\
\;\;\;\;\sqrt{2 \cdot \left(\left(n \cdot U\right) \cdot \left(t + \ell \cdot \left(\ell \cdot \left(\frac{n}{Om} \cdot \frac{U*}{Om} - \frac{2}{Om}\right)\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(\left(n \cdot \ell\right) \cdot \left(\frac{\ell}{Om} \cdot -2 + \frac{\ell}{Om} \cdot \frac{n \cdot \left(U* - U\right)}{Om}\right)\right)\right)}\\
\end{array}
\end{array}
if l < 1.99999999999999986e-34Initial program 54.0%
associate-*l/56.4%
Applied egg-rr56.4%
Taylor expanded in n around 0 46.5%
unpow246.5%
times-frac51.5%
unpow251.5%
associate-*r/54.8%
Simplified54.8%
if 1.99999999999999986e-34 < l < 4.00000000000000007e184Initial program 49.7%
Simplified46.6%
Taylor expanded in t around 0 27.1%
distribute-lft-out27.1%
unpow227.1%
associate-*r/27.1%
*-commutative27.1%
associate-*l*27.1%
unpow227.1%
unpow227.1%
Simplified27.1%
*-un-lft-identity27.1%
distribute-lft-out27.1%
associate-*l/27.1%
times-frac36.7%
associate-*l/36.7%
*-commutative36.7%
Applied egg-rr36.7%
*-lft-identity36.7%
distribute-lft-in36.7%
associate-*r*42.5%
associate-*r*52.6%
distribute-lft-out55.5%
*-commutative55.5%
associate-*l*55.5%
distribute-lft-out--64.6%
Simplified64.6%
Taylor expanded in U around 0 46.7%
mul-1-neg46.7%
associate-/l*46.7%
distribute-neg-frac46.7%
unpow246.7%
times-frac61.7%
Simplified61.7%
Taylor expanded in l around 0 57.1%
mul-1-neg57.1%
*-commutative57.1%
distribute-rgt-neg-in57.1%
mul-1-neg57.1%
+-commutative57.1%
sub-neg57.1%
associate-*r/57.1%
metadata-eval57.1%
*-commutative57.1%
unpow257.1%
times-frac70.8%
Simplified70.8%
if 4.00000000000000007e184 < l Initial program 18.7%
Simplified18.3%
Taylor expanded in t around 0 17.8%
distribute-lft-out17.8%
unpow217.8%
associate-*r/17.8%
*-commutative17.8%
associate-*l*17.8%
unpow217.8%
unpow217.8%
Simplified17.8%
*-un-lft-identity17.8%
distribute-lft-out17.8%
associate-*l/17.8%
times-frac22.5%
associate-*l/44.5%
*-commutative44.5%
Applied egg-rr44.5%
*-lft-identity44.5%
distribute-lft-in44.5%
associate-*r*44.5%
associate-*r*44.1%
distribute-lft-out44.1%
*-commutative44.1%
associate-*l*44.3%
distribute-lft-out--45.3%
Simplified45.3%
Taylor expanded in t around 0 32.1%
associate-*r*36.3%
unpow236.3%
times-frac45.5%
Simplified45.5%
Final simplification56.0%
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (* l (/ l Om))))
(if (<= l 2e-34)
(sqrt
(* (* (* 2.0 n) U) (+ (- t (* 2.0 t_1)) (* (/ (* n t_1) Om) (- U* U)))))
(if (<= l 1.25e+184)
(sqrt
(*
2.0
(* (* n U) (+ t (* l (* l (- (* (/ n Om) (/ U* Om)) (/ 2.0 Om))))))))
(sqrt
(*
2.0
(*
U
(*
(* n l)
(+ (* (/ l Om) -2.0) (* (/ l Om) (/ (* n (- U* U)) Om)))))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = l * (l / Om);
double tmp;
if (l <= 2e-34) {
tmp = sqrt((((2.0 * n) * U) * ((t - (2.0 * t_1)) + (((n * t_1) / Om) * (U_42_ - U)))));
} else if (l <= 1.25e+184) {
tmp = sqrt((2.0 * ((n * U) * (t + (l * (l * (((n / Om) * (U_42_ / Om)) - (2.0 / Om))))))));
} else {
tmp = sqrt((2.0 * (U * ((n * l) * (((l / Om) * -2.0) + ((l / Om) * ((n * (U_42_ - U)) / Om)))))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: t_1
real(8) :: tmp
t_1 = l * (l / om)
if (l <= 2d-34) then
tmp = sqrt((((2.0d0 * n) * u) * ((t - (2.0d0 * t_1)) + (((n * t_1) / om) * (u_42 - u)))))
else if (l <= 1.25d+184) then
tmp = sqrt((2.0d0 * ((n * u) * (t + (l * (l * (((n / om) * (u_42 / om)) - (2.0d0 / om))))))))
else
tmp = sqrt((2.0d0 * (u * ((n * l) * (((l / om) * (-2.0d0)) + ((l / om) * ((n * (u_42 - u)) / om)))))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = l * (l / Om);
double tmp;
if (l <= 2e-34) {
tmp = Math.sqrt((((2.0 * n) * U) * ((t - (2.0 * t_1)) + (((n * t_1) / Om) * (U_42_ - U)))));
} else if (l <= 1.25e+184) {
tmp = Math.sqrt((2.0 * ((n * U) * (t + (l * (l * (((n / Om) * (U_42_ / Om)) - (2.0 / Om))))))));
} else {
tmp = Math.sqrt((2.0 * (U * ((n * l) * (((l / Om) * -2.0) + ((l / Om) * ((n * (U_42_ - U)) / Om)))))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): t_1 = l * (l / Om) tmp = 0 if l <= 2e-34: tmp = math.sqrt((((2.0 * n) * U) * ((t - (2.0 * t_1)) + (((n * t_1) / Om) * (U_42_ - U))))) elif l <= 1.25e+184: tmp = math.sqrt((2.0 * ((n * U) * (t + (l * (l * (((n / Om) * (U_42_ / Om)) - (2.0 / Om)))))))) else: tmp = math.sqrt((2.0 * (U * ((n * l) * (((l / Om) * -2.0) + ((l / Om) * ((n * (U_42_ - U)) / Om))))))) return tmp
function code(n, U, t, l, Om, U_42_) t_1 = Float64(l * Float64(l / Om)) tmp = 0.0 if (l <= 2e-34) tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * t_1)) + Float64(Float64(Float64(n * t_1) / Om) * Float64(U_42_ - U))))); elseif (l <= 1.25e+184) tmp = sqrt(Float64(2.0 * Float64(Float64(n * U) * Float64(t + Float64(l * Float64(l * Float64(Float64(Float64(n / Om) * Float64(U_42_ / Om)) - Float64(2.0 / Om)))))))); else tmp = sqrt(Float64(2.0 * Float64(U * Float64(Float64(n * l) * Float64(Float64(Float64(l / Om) * -2.0) + Float64(Float64(l / Om) * Float64(Float64(n * Float64(U_42_ - U)) / Om))))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = l * (l / Om); tmp = 0.0; if (l <= 2e-34) tmp = sqrt((((2.0 * n) * U) * ((t - (2.0 * t_1)) + (((n * t_1) / Om) * (U_42_ - U))))); elseif (l <= 1.25e+184) tmp = sqrt((2.0 * ((n * U) * (t + (l * (l * (((n / Om) * (U_42_ / Om)) - (2.0 / Om)))))))); else tmp = sqrt((2.0 * (U * ((n * l) * (((l / Om) * -2.0) + ((l / Om) * ((n * (U_42_ - U)) / Om))))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, 2e-34], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision] + N[(N[(N[(n * t$95$1), $MachinePrecision] / Om), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 1.25e+184], N[Sqrt[N[(2.0 * N[(N[(n * U), $MachinePrecision] * N[(t + N[(l * N[(l * N[(N[(N[(n / Om), $MachinePrecision] * N[(U$42$ / Om), $MachinePrecision]), $MachinePrecision] - N[(2.0 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(U * N[(N[(n * l), $MachinePrecision] * N[(N[(N[(l / Om), $MachinePrecision] * -2.0), $MachinePrecision] + N[(N[(l / Om), $MachinePrecision] * N[(N[(n * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \ell \cdot \frac{\ell}{Om}\\
\mathbf{if}\;\ell \leq 2 \cdot 10^{-34}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot t_1\right) + \frac{n \cdot t_1}{Om} \cdot \left(U* - U\right)\right)}\\
\mathbf{elif}\;\ell \leq 1.25 \cdot 10^{+184}:\\
\;\;\;\;\sqrt{2 \cdot \left(\left(n \cdot U\right) \cdot \left(t + \ell \cdot \left(\ell \cdot \left(\frac{n}{Om} \cdot \frac{U*}{Om} - \frac{2}{Om}\right)\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(\left(n \cdot \ell\right) \cdot \left(\frac{\ell}{Om} \cdot -2 + \frac{\ell}{Om} \cdot \frac{n \cdot \left(U* - U\right)}{Om}\right)\right)\right)}\\
\end{array}
\end{array}
if l < 1.99999999999999986e-34Initial program 54.0%
associate-*l/56.4%
Applied egg-rr56.4%
Taylor expanded in n around 0 46.5%
unpow246.5%
times-frac51.5%
unpow251.5%
associate-*r/54.8%
Simplified54.8%
associate-*r/56.0%
Applied egg-rr56.0%
if 1.99999999999999986e-34 < l < 1.25e184Initial program 49.7%
Simplified46.6%
Taylor expanded in t around 0 27.1%
distribute-lft-out27.1%
unpow227.1%
associate-*r/27.1%
*-commutative27.1%
associate-*l*27.1%
unpow227.1%
unpow227.1%
Simplified27.1%
*-un-lft-identity27.1%
distribute-lft-out27.1%
associate-*l/27.1%
times-frac36.7%
associate-*l/36.7%
*-commutative36.7%
Applied egg-rr36.7%
*-lft-identity36.7%
distribute-lft-in36.7%
associate-*r*42.5%
associate-*r*52.6%
distribute-lft-out55.5%
*-commutative55.5%
associate-*l*55.5%
distribute-lft-out--64.6%
Simplified64.6%
Taylor expanded in U around 0 46.7%
mul-1-neg46.7%
associate-/l*46.7%
distribute-neg-frac46.7%
unpow246.7%
times-frac61.7%
Simplified61.7%
Taylor expanded in l around 0 57.1%
mul-1-neg57.1%
*-commutative57.1%
distribute-rgt-neg-in57.1%
mul-1-neg57.1%
+-commutative57.1%
sub-neg57.1%
associate-*r/57.1%
metadata-eval57.1%
*-commutative57.1%
unpow257.1%
times-frac70.8%
Simplified70.8%
if 1.25e184 < l Initial program 18.7%
Simplified18.3%
Taylor expanded in t around 0 17.8%
distribute-lft-out17.8%
unpow217.8%
associate-*r/17.8%
*-commutative17.8%
associate-*l*17.8%
unpow217.8%
unpow217.8%
Simplified17.8%
*-un-lft-identity17.8%
distribute-lft-out17.8%
associate-*l/17.8%
times-frac22.5%
associate-*l/44.5%
*-commutative44.5%
Applied egg-rr44.5%
*-lft-identity44.5%
distribute-lft-in44.5%
associate-*r*44.5%
associate-*r*44.1%
distribute-lft-out44.1%
*-commutative44.1%
associate-*l*44.3%
distribute-lft-out--45.3%
Simplified45.3%
Taylor expanded in t around 0 32.1%
associate-*r*36.3%
unpow236.3%
times-frac45.5%
Simplified45.5%
Final simplification57.0%
(FPCore (n U t l Om U*)
:precision binary64
(if (<= l 1.2e-114)
(sqrt (* 2.0 (* (* n U) (+ t (* l (* (/ U* Om) (/ (* n l) Om)))))))
(if (<= l 3.5e+184)
(sqrt
(*
2.0
(* (* n U) (+ t (* l (* l (- (* (/ n Om) (/ U* Om)) (/ 2.0 Om))))))))
(sqrt
(*
2.0
(*
U
(*
(* n l)
(+ (* (/ l Om) -2.0) (* (/ l Om) (/ (* n (- U* U)) Om))))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 1.2e-114) {
tmp = sqrt((2.0 * ((n * U) * (t + (l * ((U_42_ / Om) * ((n * l) / Om)))))));
} else if (l <= 3.5e+184) {
tmp = sqrt((2.0 * ((n * U) * (t + (l * (l * (((n / Om) * (U_42_ / Om)) - (2.0 / Om))))))));
} else {
tmp = sqrt((2.0 * (U * ((n * l) * (((l / Om) * -2.0) + ((l / Om) * ((n * (U_42_ - U)) / Om)))))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l <= 1.2d-114) then
tmp = sqrt((2.0d0 * ((n * u) * (t + (l * ((u_42 / om) * ((n * l) / om)))))))
else if (l <= 3.5d+184) then
tmp = sqrt((2.0d0 * ((n * u) * (t + (l * (l * (((n / om) * (u_42 / om)) - (2.0d0 / om))))))))
else
tmp = sqrt((2.0d0 * (u * ((n * l) * (((l / om) * (-2.0d0)) + ((l / om) * ((n * (u_42 - u)) / om)))))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 1.2e-114) {
tmp = Math.sqrt((2.0 * ((n * U) * (t + (l * ((U_42_ / Om) * ((n * l) / Om)))))));
} else if (l <= 3.5e+184) {
tmp = Math.sqrt((2.0 * ((n * U) * (t + (l * (l * (((n / Om) * (U_42_ / Om)) - (2.0 / Om))))))));
} else {
tmp = Math.sqrt((2.0 * (U * ((n * l) * (((l / Om) * -2.0) + ((l / Om) * ((n * (U_42_ - U)) / Om)))))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 1.2e-114: tmp = math.sqrt((2.0 * ((n * U) * (t + (l * ((U_42_ / Om) * ((n * l) / Om))))))) elif l <= 3.5e+184: tmp = math.sqrt((2.0 * ((n * U) * (t + (l * (l * (((n / Om) * (U_42_ / Om)) - (2.0 / Om)))))))) else: tmp = math.sqrt((2.0 * (U * ((n * l) * (((l / Om) * -2.0) + ((l / Om) * ((n * (U_42_ - U)) / Om))))))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 1.2e-114) tmp = sqrt(Float64(2.0 * Float64(Float64(n * U) * Float64(t + Float64(l * Float64(Float64(U_42_ / Om) * Float64(Float64(n * l) / Om))))))); elseif (l <= 3.5e+184) tmp = sqrt(Float64(2.0 * Float64(Float64(n * U) * Float64(t + Float64(l * Float64(l * Float64(Float64(Float64(n / Om) * Float64(U_42_ / Om)) - Float64(2.0 / Om)))))))); else tmp = sqrt(Float64(2.0 * Float64(U * Float64(Float64(n * l) * Float64(Float64(Float64(l / Om) * -2.0) + Float64(Float64(l / Om) * Float64(Float64(n * Float64(U_42_ - U)) / Om))))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 1.2e-114) tmp = sqrt((2.0 * ((n * U) * (t + (l * ((U_42_ / Om) * ((n * l) / Om))))))); elseif (l <= 3.5e+184) tmp = sqrt((2.0 * ((n * U) * (t + (l * (l * (((n / Om) * (U_42_ / Om)) - (2.0 / Om)))))))); else tmp = sqrt((2.0 * (U * ((n * l) * (((l / Om) * -2.0) + ((l / Om) * ((n * (U_42_ - U)) / Om))))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 1.2e-114], N[Sqrt[N[(2.0 * N[(N[(n * U), $MachinePrecision] * N[(t + N[(l * N[(N[(U$42$ / Om), $MachinePrecision] * N[(N[(n * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 3.5e+184], N[Sqrt[N[(2.0 * N[(N[(n * U), $MachinePrecision] * N[(t + N[(l * N[(l * N[(N[(N[(n / Om), $MachinePrecision] * N[(U$42$ / Om), $MachinePrecision]), $MachinePrecision] - N[(2.0 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(U * N[(N[(n * l), $MachinePrecision] * N[(N[(N[(l / Om), $MachinePrecision] * -2.0), $MachinePrecision] + N[(N[(l / Om), $MachinePrecision] * N[(N[(n * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 1.2 \cdot 10^{-114}:\\
\;\;\;\;\sqrt{2 \cdot \left(\left(n \cdot U\right) \cdot \left(t + \ell \cdot \left(\frac{U*}{Om} \cdot \frac{n \cdot \ell}{Om}\right)\right)\right)}\\
\mathbf{elif}\;\ell \leq 3.5 \cdot 10^{+184}:\\
\;\;\;\;\sqrt{2 \cdot \left(\left(n \cdot U\right) \cdot \left(t + \ell \cdot \left(\ell \cdot \left(\frac{n}{Om} \cdot \frac{U*}{Om} - \frac{2}{Om}\right)\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(\left(n \cdot \ell\right) \cdot \left(\frac{\ell}{Om} \cdot -2 + \frac{\ell}{Om} \cdot \frac{n \cdot \left(U* - U\right)}{Om}\right)\right)\right)}\\
\end{array}
\end{array}
if l < 1.2000000000000001e-114Initial program 51.0%
Simplified51.4%
Taylor expanded in t around 0 37.5%
distribute-lft-out37.5%
unpow237.5%
associate-*r/37.5%
*-commutative37.5%
associate-*l*37.5%
unpow237.5%
unpow237.5%
Simplified37.5%
*-un-lft-identity37.5%
distribute-lft-out37.5%
associate-*l/37.5%
times-frac42.8%
associate-*l/47.7%
*-commutative47.7%
Applied egg-rr47.7%
*-lft-identity47.7%
distribute-lft-in47.7%
associate-*r*49.3%
associate-*r*49.3%
distribute-lft-out49.3%
*-commutative49.3%
associate-*l*50.1%
distribute-lft-out--51.4%
Simplified52.0%
Taylor expanded in U around 0 47.1%
mul-1-neg47.1%
associate-/l*47.7%
distribute-neg-frac47.7%
unpow247.7%
times-frac52.5%
Simplified52.5%
Taylor expanded in Om around 0 43.7%
*-commutative43.7%
unpow243.7%
times-frac47.9%
Simplified47.9%
if 1.2000000000000001e-114 < l < 3.49999999999999978e184Initial program 60.6%
Simplified56.9%
Taylor expanded in t around 0 37.4%
distribute-lft-out37.4%
unpow237.4%
associate-*r/37.4%
*-commutative37.4%
associate-*l*37.4%
unpow237.4%
unpow237.4%
Simplified37.4%
*-un-lft-identity37.4%
distribute-lft-out37.4%
associate-*l/37.4%
times-frac43.0%
associate-*l/42.9%
*-commutative42.9%
Applied egg-rr42.9%
*-lft-identity42.9%
distribute-lft-in42.9%
associate-*r*48.1%
associate-*r*55.3%
distribute-lft-out57.0%
*-commutative57.0%
associate-*l*57.2%
distribute-lft-out--62.3%
Simplified67.3%
Taylor expanded in U around 0 56.4%
mul-1-neg56.4%
associate-/l*58.1%
distribute-neg-frac58.1%
unpow258.1%
times-frac66.7%
Simplified66.7%
Taylor expanded in l around 0 57.1%
mul-1-neg57.1%
*-commutative57.1%
distribute-rgt-neg-in57.1%
mul-1-neg57.1%
+-commutative57.1%
sub-neg57.1%
associate-*r/57.1%
metadata-eval57.1%
*-commutative57.1%
unpow257.1%
times-frac71.9%
Simplified71.9%
if 3.49999999999999978e184 < l Initial program 18.7%
Simplified18.3%
Taylor expanded in t around 0 17.8%
distribute-lft-out17.8%
unpow217.8%
associate-*r/17.8%
*-commutative17.8%
associate-*l*17.8%
unpow217.8%
unpow217.8%
Simplified17.8%
*-un-lft-identity17.8%
distribute-lft-out17.8%
associate-*l/17.8%
times-frac22.5%
associate-*l/44.5%
*-commutative44.5%
Applied egg-rr44.5%
*-lft-identity44.5%
distribute-lft-in44.5%
associate-*r*44.5%
associate-*r*44.1%
distribute-lft-out44.1%
*-commutative44.1%
associate-*l*44.3%
distribute-lft-out--45.3%
Simplified45.3%
Taylor expanded in t around 0 32.1%
associate-*r*36.3%
unpow236.3%
times-frac45.5%
Simplified45.5%
Final simplification53.1%
(FPCore (n U t l Om U*)
:precision binary64
(if (<= l 1e-114)
(sqrt
(*
2.0
(*
(* n U)
(+ t (* l (+ (/ l (/ Om -2.0)) (/ U* (* (/ Om n) (/ Om l)))))))))
(if (<= l 6.5e+182)
(sqrt
(*
2.0
(* (* n U) (+ t (* l (* l (- (* (/ n Om) (/ U* Om)) (/ 2.0 Om))))))))
(sqrt
(*
2.0
(*
U
(*
(* n l)
(+ (* (/ l Om) -2.0) (* (/ l Om) (/ (* n (- U* U)) Om))))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 1e-114) {
tmp = sqrt((2.0 * ((n * U) * (t + (l * ((l / (Om / -2.0)) + (U_42_ / ((Om / n) * (Om / l)))))))));
} else if (l <= 6.5e+182) {
tmp = sqrt((2.0 * ((n * U) * (t + (l * (l * (((n / Om) * (U_42_ / Om)) - (2.0 / Om))))))));
} else {
tmp = sqrt((2.0 * (U * ((n * l) * (((l / Om) * -2.0) + ((l / Om) * ((n * (U_42_ - U)) / Om)))))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l <= 1d-114) then
tmp = sqrt((2.0d0 * ((n * u) * (t + (l * ((l / (om / (-2.0d0))) + (u_42 / ((om / n) * (om / l)))))))))
else if (l <= 6.5d+182) then
tmp = sqrt((2.0d0 * ((n * u) * (t + (l * (l * (((n / om) * (u_42 / om)) - (2.0d0 / om))))))))
else
tmp = sqrt((2.0d0 * (u * ((n * l) * (((l / om) * (-2.0d0)) + ((l / om) * ((n * (u_42 - u)) / om)))))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 1e-114) {
tmp = Math.sqrt((2.0 * ((n * U) * (t + (l * ((l / (Om / -2.0)) + (U_42_ / ((Om / n) * (Om / l)))))))));
} else if (l <= 6.5e+182) {
tmp = Math.sqrt((2.0 * ((n * U) * (t + (l * (l * (((n / Om) * (U_42_ / Om)) - (2.0 / Om))))))));
} else {
tmp = Math.sqrt((2.0 * (U * ((n * l) * (((l / Om) * -2.0) + ((l / Om) * ((n * (U_42_ - U)) / Om)))))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 1e-114: tmp = math.sqrt((2.0 * ((n * U) * (t + (l * ((l / (Om / -2.0)) + (U_42_ / ((Om / n) * (Om / l))))))))) elif l <= 6.5e+182: tmp = math.sqrt((2.0 * ((n * U) * (t + (l * (l * (((n / Om) * (U_42_ / Om)) - (2.0 / Om)))))))) else: tmp = math.sqrt((2.0 * (U * ((n * l) * (((l / Om) * -2.0) + ((l / Om) * ((n * (U_42_ - U)) / Om))))))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 1e-114) tmp = sqrt(Float64(2.0 * Float64(Float64(n * U) * Float64(t + Float64(l * Float64(Float64(l / Float64(Om / -2.0)) + Float64(U_42_ / Float64(Float64(Om / n) * Float64(Om / l))))))))); elseif (l <= 6.5e+182) tmp = sqrt(Float64(2.0 * Float64(Float64(n * U) * Float64(t + Float64(l * Float64(l * Float64(Float64(Float64(n / Om) * Float64(U_42_ / Om)) - Float64(2.0 / Om)))))))); else tmp = sqrt(Float64(2.0 * Float64(U * Float64(Float64(n * l) * Float64(Float64(Float64(l / Om) * -2.0) + Float64(Float64(l / Om) * Float64(Float64(n * Float64(U_42_ - U)) / Om))))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 1e-114) tmp = sqrt((2.0 * ((n * U) * (t + (l * ((l / (Om / -2.0)) + (U_42_ / ((Om / n) * (Om / l))))))))); elseif (l <= 6.5e+182) tmp = sqrt((2.0 * ((n * U) * (t + (l * (l * (((n / Om) * (U_42_ / Om)) - (2.0 / Om)))))))); else tmp = sqrt((2.0 * (U * ((n * l) * (((l / Om) * -2.0) + ((l / Om) * ((n * (U_42_ - U)) / Om))))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 1e-114], N[Sqrt[N[(2.0 * N[(N[(n * U), $MachinePrecision] * N[(t + N[(l * N[(N[(l / N[(Om / -2.0), $MachinePrecision]), $MachinePrecision] + N[(U$42$ / N[(N[(Om / n), $MachinePrecision] * N[(Om / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 6.5e+182], N[Sqrt[N[(2.0 * N[(N[(n * U), $MachinePrecision] * N[(t + N[(l * N[(l * N[(N[(N[(n / Om), $MachinePrecision] * N[(U$42$ / Om), $MachinePrecision]), $MachinePrecision] - N[(2.0 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(U * N[(N[(n * l), $MachinePrecision] * N[(N[(N[(l / Om), $MachinePrecision] * -2.0), $MachinePrecision] + N[(N[(l / Om), $MachinePrecision] * N[(N[(n * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 10^{-114}:\\
\;\;\;\;\sqrt{2 \cdot \left(\left(n \cdot U\right) \cdot \left(t + \ell \cdot \left(\frac{\ell}{\frac{Om}{-2}} + \frac{U*}{\frac{Om}{n} \cdot \frac{Om}{\ell}}\right)\right)\right)}\\
\mathbf{elif}\;\ell \leq 6.5 \cdot 10^{+182}:\\
\;\;\;\;\sqrt{2 \cdot \left(\left(n \cdot U\right) \cdot \left(t + \ell \cdot \left(\ell \cdot \left(\frac{n}{Om} \cdot \frac{U*}{Om} - \frac{2}{Om}\right)\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(\left(n \cdot \ell\right) \cdot \left(\frac{\ell}{Om} \cdot -2 + \frac{\ell}{Om} \cdot \frac{n \cdot \left(U* - U\right)}{Om}\right)\right)\right)}\\
\end{array}
\end{array}
if l < 1.0000000000000001e-114Initial program 51.0%
Simplified51.4%
Taylor expanded in t around 0 37.5%
distribute-lft-out37.5%
unpow237.5%
associate-*r/37.5%
*-commutative37.5%
associate-*l*37.5%
unpow237.5%
unpow237.5%
Simplified37.5%
*-un-lft-identity37.5%
distribute-lft-out37.5%
associate-*l/37.5%
times-frac42.8%
associate-*l/47.7%
*-commutative47.7%
Applied egg-rr47.7%
*-lft-identity47.7%
distribute-lft-in47.7%
associate-*r*49.3%
associate-*r*49.3%
distribute-lft-out49.3%
*-commutative49.3%
associate-*l*50.1%
distribute-lft-out--51.4%
Simplified52.0%
Taylor expanded in U around 0 47.1%
mul-1-neg47.1%
associate-/l*47.7%
distribute-neg-frac47.7%
unpow247.7%
times-frac52.5%
Simplified52.5%
if 1.0000000000000001e-114 < l < 6.4999999999999998e182Initial program 60.6%
Simplified56.9%
Taylor expanded in t around 0 37.4%
distribute-lft-out37.4%
unpow237.4%
associate-*r/37.4%
*-commutative37.4%
associate-*l*37.4%
unpow237.4%
unpow237.4%
Simplified37.4%
*-un-lft-identity37.4%
distribute-lft-out37.4%
associate-*l/37.4%
times-frac43.0%
associate-*l/42.9%
*-commutative42.9%
Applied egg-rr42.9%
*-lft-identity42.9%
distribute-lft-in42.9%
associate-*r*48.1%
associate-*r*55.3%
distribute-lft-out57.0%
*-commutative57.0%
associate-*l*57.2%
distribute-lft-out--62.3%
Simplified67.3%
Taylor expanded in U around 0 56.4%
mul-1-neg56.4%
associate-/l*58.1%
distribute-neg-frac58.1%
unpow258.1%
times-frac66.7%
Simplified66.7%
Taylor expanded in l around 0 57.1%
mul-1-neg57.1%
*-commutative57.1%
distribute-rgt-neg-in57.1%
mul-1-neg57.1%
+-commutative57.1%
sub-neg57.1%
associate-*r/57.1%
metadata-eval57.1%
*-commutative57.1%
unpow257.1%
times-frac71.9%
Simplified71.9%
if 6.4999999999999998e182 < l Initial program 18.7%
Simplified18.3%
Taylor expanded in t around 0 17.8%
distribute-lft-out17.8%
unpow217.8%
associate-*r/17.8%
*-commutative17.8%
associate-*l*17.8%
unpow217.8%
unpow217.8%
Simplified17.8%
*-un-lft-identity17.8%
distribute-lft-out17.8%
associate-*l/17.8%
times-frac22.5%
associate-*l/44.5%
*-commutative44.5%
Applied egg-rr44.5%
*-lft-identity44.5%
distribute-lft-in44.5%
associate-*r*44.5%
associate-*r*44.1%
distribute-lft-out44.1%
*-commutative44.1%
associate-*l*44.3%
distribute-lft-out--45.3%
Simplified45.3%
Taylor expanded in t around 0 32.1%
associate-*r*36.3%
unpow236.3%
times-frac45.5%
Simplified45.5%
Final simplification56.3%
(FPCore (n U t l Om U*)
:precision binary64
(if (<= l 1.25e-41)
(sqrt
(*
(* (* 2.0 n) U)
(+ (- t (* 2.0 (* l (/ l Om)))) (/ U* (* (/ Om (* l l)) (/ Om n))))))
(if (<= l 1.65e+184)
(sqrt
(*
2.0
(* (* n U) (+ t (* l (* l (- (* (/ n Om) (/ U* Om)) (/ 2.0 Om))))))))
(sqrt
(*
2.0
(*
U
(*
(* n l)
(+ (* (/ l Om) -2.0) (* (/ l Om) (/ (* n (- U* U)) Om))))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 1.25e-41) {
tmp = sqrt((((2.0 * n) * U) * ((t - (2.0 * (l * (l / Om)))) + (U_42_ / ((Om / (l * l)) * (Om / n))))));
} else if (l <= 1.65e+184) {
tmp = sqrt((2.0 * ((n * U) * (t + (l * (l * (((n / Om) * (U_42_ / Om)) - (2.0 / Om))))))));
} else {
tmp = sqrt((2.0 * (U * ((n * l) * (((l / Om) * -2.0) + ((l / Om) * ((n * (U_42_ - U)) / Om)))))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l <= 1.25d-41) then
tmp = sqrt((((2.0d0 * n) * u) * ((t - (2.0d0 * (l * (l / om)))) + (u_42 / ((om / (l * l)) * (om / n))))))
else if (l <= 1.65d+184) then
tmp = sqrt((2.0d0 * ((n * u) * (t + (l * (l * (((n / om) * (u_42 / om)) - (2.0d0 / om))))))))
else
tmp = sqrt((2.0d0 * (u * ((n * l) * (((l / om) * (-2.0d0)) + ((l / om) * ((n * (u_42 - u)) / om)))))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 1.25e-41) {
tmp = Math.sqrt((((2.0 * n) * U) * ((t - (2.0 * (l * (l / Om)))) + (U_42_ / ((Om / (l * l)) * (Om / n))))));
} else if (l <= 1.65e+184) {
tmp = Math.sqrt((2.0 * ((n * U) * (t + (l * (l * (((n / Om) * (U_42_ / Om)) - (2.0 / Om))))))));
} else {
tmp = Math.sqrt((2.0 * (U * ((n * l) * (((l / Om) * -2.0) + ((l / Om) * ((n * (U_42_ - U)) / Om)))))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 1.25e-41: tmp = math.sqrt((((2.0 * n) * U) * ((t - (2.0 * (l * (l / Om)))) + (U_42_ / ((Om / (l * l)) * (Om / n)))))) elif l <= 1.65e+184: tmp = math.sqrt((2.0 * ((n * U) * (t + (l * (l * (((n / Om) * (U_42_ / Om)) - (2.0 / Om)))))))) else: tmp = math.sqrt((2.0 * (U * ((n * l) * (((l / Om) * -2.0) + ((l / Om) * ((n * (U_42_ - U)) / Om))))))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 1.25e-41) tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(l * Float64(l / Om)))) + Float64(U_42_ / Float64(Float64(Om / Float64(l * l)) * Float64(Om / n)))))); elseif (l <= 1.65e+184) tmp = sqrt(Float64(2.0 * Float64(Float64(n * U) * Float64(t + Float64(l * Float64(l * Float64(Float64(Float64(n / Om) * Float64(U_42_ / Om)) - Float64(2.0 / Om)))))))); else tmp = sqrt(Float64(2.0 * Float64(U * Float64(Float64(n * l) * Float64(Float64(Float64(l / Om) * -2.0) + Float64(Float64(l / Om) * Float64(Float64(n * Float64(U_42_ - U)) / Om))))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 1.25e-41) tmp = sqrt((((2.0 * n) * U) * ((t - (2.0 * (l * (l / Om)))) + (U_42_ / ((Om / (l * l)) * (Om / n)))))); elseif (l <= 1.65e+184) tmp = sqrt((2.0 * ((n * U) * (t + (l * (l * (((n / Om) * (U_42_ / Om)) - (2.0 / Om)))))))); else tmp = sqrt((2.0 * (U * ((n * l) * (((l / Om) * -2.0) + ((l / Om) * ((n * (U_42_ - U)) / Om))))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 1.25e-41], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(U$42$ / N[(N[(Om / N[(l * l), $MachinePrecision]), $MachinePrecision] * N[(Om / n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 1.65e+184], N[Sqrt[N[(2.0 * N[(N[(n * U), $MachinePrecision] * N[(t + N[(l * N[(l * N[(N[(N[(n / Om), $MachinePrecision] * N[(U$42$ / Om), $MachinePrecision]), $MachinePrecision] - N[(2.0 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(U * N[(N[(n * l), $MachinePrecision] * N[(N[(N[(l / Om), $MachinePrecision] * -2.0), $MachinePrecision] + N[(N[(l / Om), $MachinePrecision] * N[(N[(n * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 1.25 \cdot 10^{-41}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right) + \frac{U*}{\frac{Om}{\ell \cdot \ell} \cdot \frac{Om}{n}}\right)}\\
\mathbf{elif}\;\ell \leq 1.65 \cdot 10^{+184}:\\
\;\;\;\;\sqrt{2 \cdot \left(\left(n \cdot U\right) \cdot \left(t + \ell \cdot \left(\ell \cdot \left(\frac{n}{Om} \cdot \frac{U*}{Om} - \frac{2}{Om}\right)\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(\left(n \cdot \ell\right) \cdot \left(\frac{\ell}{Om} \cdot -2 + \frac{\ell}{Om} \cdot \frac{n \cdot \left(U* - U\right)}{Om}\right)\right)\right)}\\
\end{array}
\end{array}
if l < 1.2499999999999999e-41Initial program 53.3%
associate-*l/55.7%
Applied egg-rr55.7%
Taylor expanded in n around 0 45.7%
unpow245.7%
times-frac50.8%
unpow250.8%
associate-*r/54.1%
Simplified54.1%
Taylor expanded in U around 0 45.8%
associate-/l*45.8%
associate-*r/45.8%
neg-mul-145.8%
unpow245.8%
times-frac50.6%
unpow250.6%
Simplified50.6%
if 1.2499999999999999e-41 < l < 1.6499999999999999e184Initial program 53.9%
Simplified51.1%
Taylor expanded in t around 0 30.4%
distribute-lft-out30.4%
unpow230.4%
associate-*r/30.4%
*-commutative30.4%
associate-*l*30.4%
unpow230.4%
unpow230.4%
Simplified30.4%
*-un-lft-identity30.4%
distribute-lft-out30.4%
associate-*l/30.4%
times-frac39.2%
associate-*l/39.1%
*-commutative39.1%
Applied egg-rr39.1%
*-lft-identity39.1%
distribute-lft-in39.1%
associate-*r*44.5%
associate-*r*53.7%
distribute-lft-out56.5%
*-commutative56.5%
associate-*l*56.5%
distribute-lft-out--64.8%
Simplified67.6%
Taylor expanded in U around 0 48.3%
mul-1-neg48.3%
associate-/l*51.1%
distribute-neg-frac51.1%
unpow251.1%
times-frac64.9%
Simplified64.9%
Taylor expanded in l around 0 57.9%
mul-1-neg57.9%
*-commutative57.9%
distribute-rgt-neg-in57.9%
mul-1-neg57.9%
+-commutative57.9%
sub-neg57.9%
associate-*r/57.9%
metadata-eval57.9%
*-commutative57.9%
unpow257.9%
times-frac73.2%
Simplified73.2%
if 1.6499999999999999e184 < l Initial program 18.7%
Simplified18.3%
Taylor expanded in t around 0 17.8%
distribute-lft-out17.8%
unpow217.8%
associate-*r/17.8%
*-commutative17.8%
associate-*l*17.8%
unpow217.8%
unpow217.8%
Simplified17.8%
*-un-lft-identity17.8%
distribute-lft-out17.8%
associate-*l/17.8%
times-frac22.5%
associate-*l/44.5%
*-commutative44.5%
Applied egg-rr44.5%
*-lft-identity44.5%
distribute-lft-in44.5%
associate-*r*44.5%
associate-*r*44.1%
distribute-lft-out44.1%
*-commutative44.1%
associate-*l*44.3%
distribute-lft-out--45.3%
Simplified45.3%
Taylor expanded in t around 0 32.1%
associate-*r*36.3%
unpow236.3%
times-frac45.5%
Simplified45.5%
Final simplification53.3%
(FPCore (n U t l Om U*)
:precision binary64
(if (<= l 6.2e+15)
(sqrt (* 2.0 (* (* n U) (+ t (* l (* (/ U* Om) (/ (* n l) Om)))))))
(if (<= l 1.05e+152)
(sqrt
(*
-2.0
(* (* n U) (* (* l l) (- (/ 2.0 Om) (* (/ n Om) (/ (- U* U) Om)))))))
(sqrt
(*
2.0
(*
U
(* (* n l) (+ (* (/ l Om) -2.0) (* (* n l) (/ U* (* Om Om)))))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 6.2e+15) {
tmp = sqrt((2.0 * ((n * U) * (t + (l * ((U_42_ / Om) * ((n * l) / Om)))))));
} else if (l <= 1.05e+152) {
tmp = sqrt((-2.0 * ((n * U) * ((l * l) * ((2.0 / Om) - ((n / Om) * ((U_42_ - U) / Om)))))));
} else {
tmp = sqrt((2.0 * (U * ((n * l) * (((l / Om) * -2.0) + ((n * l) * (U_42_ / (Om * Om))))))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l <= 6.2d+15) then
tmp = sqrt((2.0d0 * ((n * u) * (t + (l * ((u_42 / om) * ((n * l) / om)))))))
else if (l <= 1.05d+152) then
tmp = sqrt(((-2.0d0) * ((n * u) * ((l * l) * ((2.0d0 / om) - ((n / om) * ((u_42 - u) / om)))))))
else
tmp = sqrt((2.0d0 * (u * ((n * l) * (((l / om) * (-2.0d0)) + ((n * l) * (u_42 / (om * om))))))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 6.2e+15) {
tmp = Math.sqrt((2.0 * ((n * U) * (t + (l * ((U_42_ / Om) * ((n * l) / Om)))))));
} else if (l <= 1.05e+152) {
tmp = Math.sqrt((-2.0 * ((n * U) * ((l * l) * ((2.0 / Om) - ((n / Om) * ((U_42_ - U) / Om)))))));
} else {
tmp = Math.sqrt((2.0 * (U * ((n * l) * (((l / Om) * -2.0) + ((n * l) * (U_42_ / (Om * Om))))))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 6.2e+15: tmp = math.sqrt((2.0 * ((n * U) * (t + (l * ((U_42_ / Om) * ((n * l) / Om))))))) elif l <= 1.05e+152: tmp = math.sqrt((-2.0 * ((n * U) * ((l * l) * ((2.0 / Om) - ((n / Om) * ((U_42_ - U) / Om))))))) else: tmp = math.sqrt((2.0 * (U * ((n * l) * (((l / Om) * -2.0) + ((n * l) * (U_42_ / (Om * Om)))))))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 6.2e+15) tmp = sqrt(Float64(2.0 * Float64(Float64(n * U) * Float64(t + Float64(l * Float64(Float64(U_42_ / Om) * Float64(Float64(n * l) / Om))))))); elseif (l <= 1.05e+152) tmp = sqrt(Float64(-2.0 * Float64(Float64(n * U) * Float64(Float64(l * l) * Float64(Float64(2.0 / Om) - Float64(Float64(n / Om) * Float64(Float64(U_42_ - U) / Om))))))); else tmp = sqrt(Float64(2.0 * Float64(U * Float64(Float64(n * l) * Float64(Float64(Float64(l / Om) * -2.0) + Float64(Float64(n * l) * Float64(U_42_ / Float64(Om * Om)))))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 6.2e+15) tmp = sqrt((2.0 * ((n * U) * (t + (l * ((U_42_ / Om) * ((n * l) / Om))))))); elseif (l <= 1.05e+152) tmp = sqrt((-2.0 * ((n * U) * ((l * l) * ((2.0 / Om) - ((n / Om) * ((U_42_ - U) / Om))))))); else tmp = sqrt((2.0 * (U * ((n * l) * (((l / Om) * -2.0) + ((n * l) * (U_42_ / (Om * Om)))))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 6.2e+15], N[Sqrt[N[(2.0 * N[(N[(n * U), $MachinePrecision] * N[(t + N[(l * N[(N[(U$42$ / Om), $MachinePrecision] * N[(N[(n * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 1.05e+152], N[Sqrt[N[(-2.0 * N[(N[(n * U), $MachinePrecision] * N[(N[(l * l), $MachinePrecision] * N[(N[(2.0 / Om), $MachinePrecision] - N[(N[(n / Om), $MachinePrecision] * N[(N[(U$42$ - U), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(U * N[(N[(n * l), $MachinePrecision] * N[(N[(N[(l / Om), $MachinePrecision] * -2.0), $MachinePrecision] + N[(N[(n * l), $MachinePrecision] * N[(U$42$ / N[(Om * Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 6.2 \cdot 10^{+15}:\\
\;\;\;\;\sqrt{2 \cdot \left(\left(n \cdot U\right) \cdot \left(t + \ell \cdot \left(\frac{U*}{Om} \cdot \frac{n \cdot \ell}{Om}\right)\right)\right)}\\
\mathbf{elif}\;\ell \leq 1.05 \cdot 10^{+152}:\\
\;\;\;\;\sqrt{-2 \cdot \left(\left(n \cdot U\right) \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(\frac{2}{Om} - \frac{n}{Om} \cdot \frac{U* - U}{Om}\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(\left(n \cdot \ell\right) \cdot \left(\frac{\ell}{Om} \cdot -2 + \left(n \cdot \ell\right) \cdot \frac{U*}{Om \cdot Om}\right)\right)\right)}\\
\end{array}
\end{array}
if l < 6.2e15Initial program 54.2%
Simplified54.0%
Taylor expanded in t around 0 39.2%
distribute-lft-out39.2%
unpow239.2%
associate-*r/39.2%
*-commutative39.2%
associate-*l*39.2%
unpow239.2%
unpow239.2%
Simplified39.2%
*-un-lft-identity39.2%
distribute-lft-out39.2%
associate-*l/39.2%
times-frac43.7%
associate-*l/47.8%
*-commutative47.8%
Applied egg-rr47.8%
*-lft-identity47.8%
distribute-lft-in47.8%
associate-*r*49.7%
associate-*r*50.8%
distribute-lft-out50.8%
*-commutative50.8%
associate-*l*51.5%
distribute-lft-out--52.6%
Simplified54.6%
Taylor expanded in U around 0 50.2%
mul-1-neg50.2%
associate-/l*51.2%
distribute-neg-frac51.2%
unpow251.2%
times-frac55.2%
Simplified55.2%
Taylor expanded in Om around 0 46.3%
*-commutative46.3%
unpow246.3%
times-frac50.3%
Simplified50.3%
if 6.2e15 < l < 1.0500000000000001e152Initial program 63.9%
Simplified63.9%
Taylor expanded in t around 0 32.1%
associate-*r*32.1%
*-commutative32.1%
associate-*r/32.1%
*-commutative32.1%
associate-*r/32.1%
metadata-eval32.1%
associate-*r/32.1%
associate-*r/32.5%
distribute-lft-in43.0%
unpow243.0%
associate-*r/43.0%
metadata-eval43.0%
*-commutative43.0%
unpow243.0%
times-frac63.7%
Simplified63.7%
if 1.0500000000000001e152 < l Initial program 14.7%
Simplified14.4%
Taylor expanded in t around 0 13.8%
distribute-lft-out13.8%
unpow213.8%
associate-*r/13.8%
*-commutative13.8%
associate-*l*13.8%
unpow213.8%
unpow213.8%
Simplified13.8%
*-un-lft-identity13.8%
distribute-lft-out13.8%
associate-*l/13.8%
times-frac17.6%
associate-*l/34.5%
*-commutative34.5%
Applied egg-rr34.5%
*-lft-identity34.5%
distribute-lft-in34.5%
associate-*r*34.5%
associate-*r*37.3%
distribute-lft-out37.3%
*-commutative37.3%
associate-*l*37.5%
distribute-lft-out--41.5%
Simplified41.5%
Taylor expanded in U around 0 34.4%
mul-1-neg34.4%
associate-/l*34.5%
distribute-neg-frac34.5%
unpow234.5%
times-frac41.5%
Simplified41.5%
Taylor expanded in t around 0 28.2%
associate-*r*31.4%
mul-1-neg31.4%
associate-*l/34.7%
distribute-lft-neg-in34.7%
distribute-frac-neg34.7%
unpow234.7%
Simplified34.7%
Final simplification49.5%
(FPCore (n U t l Om U*) :precision binary64 (if (or (<= n -1.7e-96) (not (<= n 9.4e+54))) (sqrt (* 2.0 (* (* n U) (+ t (* l (* (/ U* Om) (/ (* n l) Om))))))) (sqrt (* 2.0 (* (* n U) (+ t (* (* l (/ l Om)) -2.0)))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if ((n <= -1.7e-96) || !(n <= 9.4e+54)) {
tmp = sqrt((2.0 * ((n * U) * (t + (l * ((U_42_ / Om) * ((n * l) / Om)))))));
} else {
tmp = sqrt((2.0 * ((n * U) * (t + ((l * (l / Om)) * -2.0)))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if ((n <= (-1.7d-96)) .or. (.not. (n <= 9.4d+54))) then
tmp = sqrt((2.0d0 * ((n * u) * (t + (l * ((u_42 / om) * ((n * l) / om)))))))
else
tmp = sqrt((2.0d0 * ((n * u) * (t + ((l * (l / om)) * (-2.0d0))))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if ((n <= -1.7e-96) || !(n <= 9.4e+54)) {
tmp = Math.sqrt((2.0 * ((n * U) * (t + (l * ((U_42_ / Om) * ((n * l) / Om)))))));
} else {
tmp = Math.sqrt((2.0 * ((n * U) * (t + ((l * (l / Om)) * -2.0)))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if (n <= -1.7e-96) or not (n <= 9.4e+54): tmp = math.sqrt((2.0 * ((n * U) * (t + (l * ((U_42_ / Om) * ((n * l) / Om))))))) else: tmp = math.sqrt((2.0 * ((n * U) * (t + ((l * (l / Om)) * -2.0))))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if ((n <= -1.7e-96) || !(n <= 9.4e+54)) tmp = sqrt(Float64(2.0 * Float64(Float64(n * U) * Float64(t + Float64(l * Float64(Float64(U_42_ / Om) * Float64(Float64(n * l) / Om))))))); else tmp = sqrt(Float64(2.0 * Float64(Float64(n * U) * Float64(t + Float64(Float64(l * Float64(l / Om)) * -2.0))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if ((n <= -1.7e-96) || ~((n <= 9.4e+54))) tmp = sqrt((2.0 * ((n * U) * (t + (l * ((U_42_ / Om) * ((n * l) / Om))))))); else tmp = sqrt((2.0 * ((n * U) * (t + ((l * (l / Om)) * -2.0))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[Or[LessEqual[n, -1.7e-96], N[Not[LessEqual[n, 9.4e+54]], $MachinePrecision]], N[Sqrt[N[(2.0 * N[(N[(n * U), $MachinePrecision] * N[(t + N[(l * N[(N[(U$42$ / Om), $MachinePrecision] * N[(N[(n * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(N[(n * U), $MachinePrecision] * N[(t + N[(N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;n \leq -1.7 \cdot 10^{-96} \lor \neg \left(n \leq 9.4 \cdot 10^{+54}\right):\\
\;\;\;\;\sqrt{2 \cdot \left(\left(n \cdot U\right) \cdot \left(t + \ell \cdot \left(\frac{U*}{Om} \cdot \frac{n \cdot \ell}{Om}\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(\left(n \cdot U\right) \cdot \left(t + \left(\ell \cdot \frac{\ell}{Om}\right) \cdot -2\right)\right)}\\
\end{array}
\end{array}
if n < -1.7e-96 or 9.39999999999999985e54 < n Initial program 56.6%
Simplified57.1%
Taylor expanded in t around 0 32.4%
distribute-lft-out32.4%
unpow232.4%
associate-*r/32.4%
*-commutative32.4%
associate-*l*32.4%
unpow232.4%
unpow232.4%
Simplified32.4%
*-un-lft-identity32.4%
distribute-lft-out32.4%
associate-*l/32.4%
times-frac41.2%
associate-*l/44.4%
*-commutative44.4%
Applied egg-rr44.4%
*-lft-identity44.4%
distribute-lft-in44.4%
associate-*r*48.9%
associate-*r*51.2%
distribute-lft-out52.0%
*-commutative52.0%
associate-*l*53.0%
distribute-lft-out--57.0%
Simplified63.4%
Taylor expanded in U around 0 50.8%
mul-1-neg50.8%
associate-/l*52.3%
distribute-neg-frac52.3%
unpow252.3%
times-frac59.6%
Simplified59.6%
Taylor expanded in Om around 0 52.4%
*-commutative52.4%
unpow252.4%
times-frac59.6%
Simplified59.6%
if -1.7e-96 < n < 9.39999999999999985e54Initial program 43.9%
associate-*l/50.0%
Applied egg-rr50.0%
Taylor expanded in n around 0 42.1%
associate-*r*43.0%
*-commutative43.0%
unpow243.0%
associate-*r/49.1%
cancel-sign-sub-inv49.1%
metadata-eval49.1%
Simplified49.1%
Final simplification54.4%
(FPCore (n U t l Om U*) :precision binary64 (sqrt (* 2.0 (* (* n U) (+ t (* l (* l (- (* (/ n Om) (/ U* Om)) (/ 2.0 Om)))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return sqrt((2.0 * ((n * U) * (t + (l * (l * (((n / Om) * (U_42_ / Om)) - (2.0 / Om))))))));
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
code = sqrt((2.0d0 * ((n * u) * (t + (l * (l * (((n / om) * (u_42 / om)) - (2.0d0 / om))))))))
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.sqrt((2.0 * ((n * U) * (t + (l * (l * (((n / Om) * (U_42_ / Om)) - (2.0 / Om))))))));
}
def code(n, U, t, l, Om, U_42_): return math.sqrt((2.0 * ((n * U) * (t + (l * (l * (((n / Om) * (U_42_ / Om)) - (2.0 / Om))))))))
function code(n, U, t, l, Om, U_42_) return sqrt(Float64(2.0 * Float64(Float64(n * U) * Float64(t + Float64(l * Float64(l * Float64(Float64(Float64(n / Om) * Float64(U_42_ / Om)) - Float64(2.0 / Om)))))))) end
function tmp = code(n, U, t, l, Om, U_42_) tmp = sqrt((2.0 * ((n * U) * (t + (l * (l * (((n / Om) * (U_42_ / Om)) - (2.0 / Om)))))))); end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Sqrt[N[(2.0 * N[(N[(n * U), $MachinePrecision] * N[(t + N[(l * N[(l * N[(N[(N[(n / Om), $MachinePrecision] * N[(U$42$ / Om), $MachinePrecision]), $MachinePrecision] - N[(2.0 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{2 \cdot \left(\left(n \cdot U\right) \cdot \left(t + \ell \cdot \left(\ell \cdot \left(\frac{n}{Om} \cdot \frac{U*}{Om} - \frac{2}{Om}\right)\right)\right)\right)}
\end{array}
Initial program 50.3%
Simplified49.7%
Taylor expanded in t around 0 35.7%
distribute-lft-out35.7%
unpow235.7%
associate-*r/35.7%
*-commutative35.7%
associate-*l*35.7%
unpow235.7%
unpow235.7%
Simplified35.7%
*-un-lft-identity35.7%
distribute-lft-out35.7%
associate-*l/35.7%
times-frac41.1%
associate-*l/46.3%
*-commutative46.3%
Applied egg-rr46.3%
*-lft-identity46.3%
distribute-lft-in46.3%
associate-*r*48.6%
associate-*r*50.2%
distribute-lft-out50.6%
*-commutative50.6%
associate-*l*51.2%
distribute-lft-out--53.3%
Simplified54.9%
Taylor expanded in U around 0 48.6%
mul-1-neg48.6%
associate-/l*49.4%
distribute-neg-frac49.4%
unpow249.4%
times-frac55.1%
Simplified55.1%
Taylor expanded in l around 0 50.5%
mul-1-neg50.5%
*-commutative50.5%
distribute-rgt-neg-in50.5%
mul-1-neg50.5%
+-commutative50.5%
sub-neg50.5%
associate-*r/50.5%
metadata-eval50.5%
*-commutative50.5%
unpow250.5%
times-frac56.3%
Simplified56.3%
Final simplification56.3%
(FPCore (n U t l Om U*)
:precision binary64
(if (<= n -4e+50)
(sqrt (* 2.0 (* (* n U) (+ t (* l (* (* n l) (/ U* (* Om Om))))))))
(if (<= n 7.2e+130)
(sqrt (* 2.0 (* (* n U) (+ t (* (* l (/ l Om)) -2.0)))))
(sqrt (* (* (* 2.0 n) U) (* (/ n Om) (/ U* (/ Om (* l l)))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (n <= -4e+50) {
tmp = sqrt((2.0 * ((n * U) * (t + (l * ((n * l) * (U_42_ / (Om * Om))))))));
} else if (n <= 7.2e+130) {
tmp = sqrt((2.0 * ((n * U) * (t + ((l * (l / Om)) * -2.0)))));
} else {
tmp = sqrt((((2.0 * n) * U) * ((n / Om) * (U_42_ / (Om / (l * l))))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (n <= (-4d+50)) then
tmp = sqrt((2.0d0 * ((n * u) * (t + (l * ((n * l) * (u_42 / (om * om))))))))
else if (n <= 7.2d+130) then
tmp = sqrt((2.0d0 * ((n * u) * (t + ((l * (l / om)) * (-2.0d0))))))
else
tmp = sqrt((((2.0d0 * n) * u) * ((n / om) * (u_42 / (om / (l * l))))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (n <= -4e+50) {
tmp = Math.sqrt((2.0 * ((n * U) * (t + (l * ((n * l) * (U_42_ / (Om * Om))))))));
} else if (n <= 7.2e+130) {
tmp = Math.sqrt((2.0 * ((n * U) * (t + ((l * (l / Om)) * -2.0)))));
} else {
tmp = Math.sqrt((((2.0 * n) * U) * ((n / Om) * (U_42_ / (Om / (l * l))))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if n <= -4e+50: tmp = math.sqrt((2.0 * ((n * U) * (t + (l * ((n * l) * (U_42_ / (Om * Om)))))))) elif n <= 7.2e+130: tmp = math.sqrt((2.0 * ((n * U) * (t + ((l * (l / Om)) * -2.0))))) else: tmp = math.sqrt((((2.0 * n) * U) * ((n / Om) * (U_42_ / (Om / (l * l)))))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (n <= -4e+50) tmp = sqrt(Float64(2.0 * Float64(Float64(n * U) * Float64(t + Float64(l * Float64(Float64(n * l) * Float64(U_42_ / Float64(Om * Om)))))))); elseif (n <= 7.2e+130) tmp = sqrt(Float64(2.0 * Float64(Float64(n * U) * Float64(t + Float64(Float64(l * Float64(l / Om)) * -2.0))))); else tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(n / Om) * Float64(U_42_ / Float64(Om / Float64(l * l)))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (n <= -4e+50) tmp = sqrt((2.0 * ((n * U) * (t + (l * ((n * l) * (U_42_ / (Om * Om)))))))); elseif (n <= 7.2e+130) tmp = sqrt((2.0 * ((n * U) * (t + ((l * (l / Om)) * -2.0))))); else tmp = sqrt((((2.0 * n) * U) * ((n / Om) * (U_42_ / (Om / (l * l)))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[n, -4e+50], N[Sqrt[N[(2.0 * N[(N[(n * U), $MachinePrecision] * N[(t + N[(l * N[(N[(n * l), $MachinePrecision] * N[(U$42$ / N[(Om * Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[n, 7.2e+130], N[Sqrt[N[(2.0 * N[(N[(n * U), $MachinePrecision] * N[(t + N[(N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(n / Om), $MachinePrecision] * N[(U$42$ / N[(Om / N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;n \leq -4 \cdot 10^{+50}:\\
\;\;\;\;\sqrt{2 \cdot \left(\left(n \cdot U\right) \cdot \left(t + \ell \cdot \left(\left(n \cdot \ell\right) \cdot \frac{U*}{Om \cdot Om}\right)\right)\right)}\\
\mathbf{elif}\;n \leq 7.2 \cdot 10^{+130}:\\
\;\;\;\;\sqrt{2 \cdot \left(\left(n \cdot U\right) \cdot \left(t + \left(\ell \cdot \frac{\ell}{Om}\right) \cdot -2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\frac{n}{Om} \cdot \frac{U*}{\frac{Om}{\ell \cdot \ell}}\right)}\\
\end{array}
\end{array}
if n < -4.0000000000000003e50Initial program 47.9%
Simplified49.4%
Taylor expanded in t around 0 26.2%
distribute-lft-out26.2%
unpow226.2%
associate-*r/26.2%
*-commutative26.2%
associate-*l*26.2%
unpow226.2%
unpow226.2%
Simplified26.2%
*-un-lft-identity26.2%
distribute-lft-out26.2%
associate-*l/26.2%
times-frac28.2%
associate-*l/30.3%
*-commutative30.3%
Applied egg-rr30.3%
*-lft-identity30.3%
distribute-lft-in30.3%
associate-*r*37.5%
associate-*r*37.5%
distribute-lft-out39.4%
*-commutative39.4%
associate-*l*41.6%
distribute-lft-out--47.2%
Simplified55.1%
Taylor expanded in U around 0 47.5%
mul-1-neg47.5%
associate-/l*49.4%
distribute-neg-frac49.4%
unpow249.4%
times-frac51.6%
Simplified51.6%
Taylor expanded in Om around 0 53.2%
associate-*l/55.0%
unpow255.0%
Simplified55.0%
if -4.0000000000000003e50 < n < 7.2000000000000002e130Initial program 49.9%
associate-*l/55.4%
Applied egg-rr55.4%
Taylor expanded in n around 0 43.4%
associate-*r*45.2%
*-commutative45.2%
unpow245.2%
associate-*r/50.2%
cancel-sign-sub-inv50.2%
metadata-eval50.2%
Simplified50.2%
if 7.2000000000000002e130 < n Initial program 57.1%
Simplified57.1%
Taylor expanded in U* around inf 33.8%
associate-*r*33.8%
unpow233.8%
unpow233.8%
Simplified33.8%
*-un-lft-identity33.8%
associate-*l*33.8%
times-frac49.6%
Applied egg-rr49.6%
*-lft-identity49.6%
associate-*r*49.6%
associate-*r*49.6%
unpow249.6%
associate-/l*49.7%
unpow249.7%
Simplified49.7%
Final simplification51.1%
(FPCore (n U t l Om U*) :precision binary64 (if (<= U* 2.1e+164) (sqrt (* 2.0 (* (* n U) (+ t (* (* l (/ l Om)) -2.0))))) (sqrt (* 2.0 (* (/ U Om) (/ (* U* (* (* l l) (* n n))) Om))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (U_42_ <= 2.1e+164) {
tmp = sqrt((2.0 * ((n * U) * (t + ((l * (l / Om)) * -2.0)))));
} else {
tmp = sqrt((2.0 * ((U / Om) * ((U_42_ * ((l * l) * (n * n))) / Om))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (u_42 <= 2.1d+164) then
tmp = sqrt((2.0d0 * ((n * u) * (t + ((l * (l / om)) * (-2.0d0))))))
else
tmp = sqrt((2.0d0 * ((u / om) * ((u_42 * ((l * l) * (n * n))) / om))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (U_42_ <= 2.1e+164) {
tmp = Math.sqrt((2.0 * ((n * U) * (t + ((l * (l / Om)) * -2.0)))));
} else {
tmp = Math.sqrt((2.0 * ((U / Om) * ((U_42_ * ((l * l) * (n * n))) / Om))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if U_42_ <= 2.1e+164: tmp = math.sqrt((2.0 * ((n * U) * (t + ((l * (l / Om)) * -2.0))))) else: tmp = math.sqrt((2.0 * ((U / Om) * ((U_42_ * ((l * l) * (n * n))) / Om)))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (U_42_ <= 2.1e+164) tmp = sqrt(Float64(2.0 * Float64(Float64(n * U) * Float64(t + Float64(Float64(l * Float64(l / Om)) * -2.0))))); else tmp = sqrt(Float64(2.0 * Float64(Float64(U / Om) * Float64(Float64(U_42_ * Float64(Float64(l * l) * Float64(n * n))) / Om)))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (U_42_ <= 2.1e+164) tmp = sqrt((2.0 * ((n * U) * (t + ((l * (l / Om)) * -2.0))))); else tmp = sqrt((2.0 * ((U / Om) * ((U_42_ * ((l * l) * (n * n))) / Om)))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[U$42$, 2.1e+164], N[Sqrt[N[(2.0 * N[(N[(n * U), $MachinePrecision] * N[(t + N[(N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(N[(U / Om), $MachinePrecision] * N[(N[(U$42$ * N[(N[(l * l), $MachinePrecision] * N[(n * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;U* \leq 2.1 \cdot 10^{+164}:\\
\;\;\;\;\sqrt{2 \cdot \left(\left(n \cdot U\right) \cdot \left(t + \left(\ell \cdot \frac{\ell}{Om}\right) \cdot -2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(\frac{U}{Om} \cdot \frac{U* \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot n\right)\right)}{Om}\right)}\\
\end{array}
\end{array}
if U* < 2.0999999999999999e164Initial program 52.1%
associate-*l/56.4%
Applied egg-rr56.4%
Taylor expanded in n around 0 41.1%
associate-*r*44.5%
*-commutative44.5%
unpow244.5%
associate-*r/48.1%
cancel-sign-sub-inv48.1%
metadata-eval48.1%
Simplified48.1%
if 2.0999999999999999e164 < U* Initial program 36.5%
Simplified39.7%
Taylor expanded in U* around inf 28.6%
unpow228.6%
times-frac35.4%
unpow235.4%
unpow235.4%
Simplified35.4%
Final simplification46.6%
(FPCore (n U t l Om U*) :precision binary64 (if (<= U* 2.1e+164) (sqrt (* 2.0 (* (* n U) (+ t (* (* l (/ l Om)) -2.0))))) (sqrt (* 2.0 (/ U (* (/ Om (* (* l l) U*)) (/ Om (* n n))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (U_42_ <= 2.1e+164) {
tmp = sqrt((2.0 * ((n * U) * (t + ((l * (l / Om)) * -2.0)))));
} else {
tmp = sqrt((2.0 * (U / ((Om / ((l * l) * U_42_)) * (Om / (n * 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 (u_42 <= 2.1d+164) then
tmp = sqrt((2.0d0 * ((n * u) * (t + ((l * (l / om)) * (-2.0d0))))))
else
tmp = sqrt((2.0d0 * (u / ((om / ((l * l) * u_42)) * (om / (n * 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 (U_42_ <= 2.1e+164) {
tmp = Math.sqrt((2.0 * ((n * U) * (t + ((l * (l / Om)) * -2.0)))));
} else {
tmp = Math.sqrt((2.0 * (U / ((Om / ((l * l) * U_42_)) * (Om / (n * n))))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if U_42_ <= 2.1e+164: tmp = math.sqrt((2.0 * ((n * U) * (t + ((l * (l / Om)) * -2.0))))) else: tmp = math.sqrt((2.0 * (U / ((Om / ((l * l) * U_42_)) * (Om / (n * n)))))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (U_42_ <= 2.1e+164) tmp = sqrt(Float64(2.0 * Float64(Float64(n * U) * Float64(t + Float64(Float64(l * Float64(l / Om)) * -2.0))))); else tmp = sqrt(Float64(2.0 * Float64(U / Float64(Float64(Om / Float64(Float64(l * l) * U_42_)) * Float64(Om / Float64(n * n)))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (U_42_ <= 2.1e+164) tmp = sqrt((2.0 * ((n * U) * (t + ((l * (l / Om)) * -2.0))))); else tmp = sqrt((2.0 * (U / ((Om / ((l * l) * U_42_)) * (Om / (n * n)))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[U$42$, 2.1e+164], N[Sqrt[N[(2.0 * N[(N[(n * U), $MachinePrecision] * N[(t + N[(N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(U / N[(N[(Om / N[(N[(l * l), $MachinePrecision] * U$42$), $MachinePrecision]), $MachinePrecision] * N[(Om / N[(n * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;U* \leq 2.1 \cdot 10^{+164}:\\
\;\;\;\;\sqrt{2 \cdot \left(\left(n \cdot U\right) \cdot \left(t + \left(\ell \cdot \frac{\ell}{Om}\right) \cdot -2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \frac{U}{\frac{Om}{\left(\ell \cdot \ell\right) \cdot U*} \cdot \frac{Om}{n \cdot n}}}\\
\end{array}
\end{array}
if U* < 2.0999999999999999e164Initial program 52.1%
associate-*l/56.4%
Applied egg-rr56.4%
Taylor expanded in n around 0 41.1%
associate-*r*44.5%
*-commutative44.5%
unpow244.5%
associate-*r/48.1%
cancel-sign-sub-inv48.1%
metadata-eval48.1%
Simplified48.1%
if 2.0999999999999999e164 < U* Initial program 36.5%
Simplified36.4%
Taylor expanded in t around 0 22.0%
distribute-lft-out22.0%
unpow222.0%
associate-*r/22.0%
*-commutative22.0%
associate-*l*22.0%
unpow222.0%
unpow222.0%
Simplified22.0%
*-un-lft-identity22.0%
distribute-lft-out22.0%
associate-*l/22.0%
times-frac32.2%
associate-*l/35.6%
*-commutative35.6%
Applied egg-rr35.6%
*-lft-identity35.6%
distribute-lft-in35.6%
associate-*r*33.6%
associate-*r*33.2%
distribute-lft-out36.5%
*-commutative36.5%
associate-*l*36.7%
distribute-lft-out--40.2%
Simplified43.3%
Taylor expanded in U* around inf 28.6%
associate-/l*28.6%
unpow228.6%
associate-*r*28.6%
times-frac38.6%
unpow238.6%
unpow238.6%
Simplified38.6%
Final simplification47.0%
(FPCore (n U t l Om U*) :precision binary64 (if (<= U* 2.1e+164) (sqrt (* 2.0 (* (* n U) (+ t (* (* l (/ l Om)) -2.0))))) (sqrt (* (* (* 2.0 n) U) (* (/ n Om) (/ U* (/ Om (* l l))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (U_42_ <= 2.1e+164) {
tmp = sqrt((2.0 * ((n * U) * (t + ((l * (l / Om)) * -2.0)))));
} else {
tmp = sqrt((((2.0 * n) * U) * ((n / Om) * (U_42_ / (Om / (l * l))))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (u_42 <= 2.1d+164) then
tmp = sqrt((2.0d0 * ((n * u) * (t + ((l * (l / om)) * (-2.0d0))))))
else
tmp = sqrt((((2.0d0 * n) * u) * ((n / om) * (u_42 / (om / (l * l))))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (U_42_ <= 2.1e+164) {
tmp = Math.sqrt((2.0 * ((n * U) * (t + ((l * (l / Om)) * -2.0)))));
} else {
tmp = Math.sqrt((((2.0 * n) * U) * ((n / Om) * (U_42_ / (Om / (l * l))))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if U_42_ <= 2.1e+164: tmp = math.sqrt((2.0 * ((n * U) * (t + ((l * (l / Om)) * -2.0))))) else: tmp = math.sqrt((((2.0 * n) * U) * ((n / Om) * (U_42_ / (Om / (l * l)))))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (U_42_ <= 2.1e+164) tmp = sqrt(Float64(2.0 * Float64(Float64(n * U) * Float64(t + Float64(Float64(l * Float64(l / Om)) * -2.0))))); else tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(n / Om) * Float64(U_42_ / Float64(Om / Float64(l * l)))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (U_42_ <= 2.1e+164) tmp = sqrt((2.0 * ((n * U) * (t + ((l * (l / Om)) * -2.0))))); else tmp = sqrt((((2.0 * n) * U) * ((n / Om) * (U_42_ / (Om / (l * l)))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[U$42$, 2.1e+164], N[Sqrt[N[(2.0 * N[(N[(n * U), $MachinePrecision] * N[(t + N[(N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(n / Om), $MachinePrecision] * N[(U$42$ / N[(Om / N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;U* \leq 2.1 \cdot 10^{+164}:\\
\;\;\;\;\sqrt{2 \cdot \left(\left(n \cdot U\right) \cdot \left(t + \left(\ell \cdot \frac{\ell}{Om}\right) \cdot -2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\frac{n}{Om} \cdot \frac{U*}{\frac{Om}{\ell \cdot \ell}}\right)}\\
\end{array}
\end{array}
if U* < 2.0999999999999999e164Initial program 52.1%
associate-*l/56.4%
Applied egg-rr56.4%
Taylor expanded in n around 0 41.1%
associate-*r*44.5%
*-commutative44.5%
unpow244.5%
associate-*r/48.1%
cancel-sign-sub-inv48.1%
metadata-eval48.1%
Simplified48.1%
if 2.0999999999999999e164 < U* Initial program 36.5%
Simplified36.4%
Taylor expanded in U* around inf 31.8%
associate-*r*31.8%
unpow231.8%
unpow231.8%
Simplified31.8%
*-un-lft-identity31.8%
associate-*l*31.8%
times-frac41.9%
Applied egg-rr41.9%
*-lft-identity41.9%
associate-*r*41.9%
associate-*r*41.9%
unpow241.9%
associate-/l*42.0%
unpow242.0%
Simplified42.0%
Final simplification47.4%
(FPCore (n U t l Om U*) :precision binary64 (if (<= U* 5e+163) (sqrt (* 2.0 (* (* n U) (+ t (* (* l (/ l Om)) -2.0))))) (sqrt (* (/ (* (* 2.0 n) U) Om) (* (/ n Om) (* (* l l) U*))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (U_42_ <= 5e+163) {
tmp = sqrt((2.0 * ((n * U) * (t + ((l * (l / Om)) * -2.0)))));
} else {
tmp = sqrt(((((2.0 * n) * U) / Om) * ((n / Om) * ((l * l) * U_42_))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (u_42 <= 5d+163) then
tmp = sqrt((2.0d0 * ((n * u) * (t + ((l * (l / om)) * (-2.0d0))))))
else
tmp = sqrt(((((2.0d0 * n) * u) / om) * ((n / om) * ((l * l) * u_42))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (U_42_ <= 5e+163) {
tmp = Math.sqrt((2.0 * ((n * U) * (t + ((l * (l / Om)) * -2.0)))));
} else {
tmp = Math.sqrt(((((2.0 * n) * U) / Om) * ((n / Om) * ((l * l) * U_42_))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if U_42_ <= 5e+163: tmp = math.sqrt((2.0 * ((n * U) * (t + ((l * (l / Om)) * -2.0))))) else: tmp = math.sqrt(((((2.0 * n) * U) / Om) * ((n / Om) * ((l * l) * U_42_)))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (U_42_ <= 5e+163) tmp = sqrt(Float64(2.0 * Float64(Float64(n * U) * Float64(t + Float64(Float64(l * Float64(l / Om)) * -2.0))))); else tmp = sqrt(Float64(Float64(Float64(Float64(2.0 * n) * U) / Om) * Float64(Float64(n / Om) * Float64(Float64(l * l) * U_42_)))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (U_42_ <= 5e+163) tmp = sqrt((2.0 * ((n * U) * (t + ((l * (l / Om)) * -2.0))))); else tmp = sqrt(((((2.0 * n) * U) / Om) * ((n / Om) * ((l * l) * U_42_)))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[U$42$, 5e+163], N[Sqrt[N[(2.0 * N[(N[(n * U), $MachinePrecision] * N[(t + N[(N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] / Om), $MachinePrecision] * N[(N[(n / Om), $MachinePrecision] * N[(N[(l * l), $MachinePrecision] * U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;U* \leq 5 \cdot 10^{+163}:\\
\;\;\;\;\sqrt{2 \cdot \left(\left(n \cdot U\right) \cdot \left(t + \left(\ell \cdot \frac{\ell}{Om}\right) \cdot -2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{\left(2 \cdot n\right) \cdot U}{Om} \cdot \left(\frac{n}{Om} \cdot \left(\left(\ell \cdot \ell\right) \cdot U*\right)\right)}\\
\end{array}
\end{array}
if U* < 5e163Initial program 52.1%
associate-*l/56.4%
Applied egg-rr56.4%
Taylor expanded in n around 0 41.1%
associate-*r*44.5%
*-commutative44.5%
unpow244.5%
associate-*r/48.1%
cancel-sign-sub-inv48.1%
metadata-eval48.1%
Simplified48.1%
if 5e163 < U* Initial program 36.5%
Simplified36.4%
Taylor expanded in U* around inf 31.8%
associate-*r*31.8%
unpow231.8%
unpow231.8%
Simplified31.8%
associate-*r/31.8%
*-commutative31.8%
Applied egg-rr31.8%
times-frac42.1%
associate-*r*42.1%
*-commutative42.1%
associate-*r/42.1%
Simplified42.1%
Final simplification47.4%
(FPCore (n U t l Om U*) :precision binary64 (if (<= l 5.5e-86) (sqrt (* t (* 2.0 (* n U)))) (sqrt (* 2.0 (* U (* n (+ t (* (* l (/ l Om)) -2.0))))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 5.5e-86) {
tmp = sqrt((t * (2.0 * (n * U))));
} else {
tmp = sqrt((2.0 * (U * (n * (t + ((l * (l / Om)) * -2.0))))));
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l <= 5.5d-86) then
tmp = sqrt((t * (2.0d0 * (n * u))))
else
tmp = sqrt((2.0d0 * (u * (n * (t + ((l * (l / om)) * (-2.0d0)))))))
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 5.5e-86) {
tmp = Math.sqrt((t * (2.0 * (n * U))));
} else {
tmp = Math.sqrt((2.0 * (U * (n * (t + ((l * (l / Om)) * -2.0))))));
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 5.5e-86: tmp = math.sqrt((t * (2.0 * (n * U)))) else: tmp = math.sqrt((2.0 * (U * (n * (t + ((l * (l / Om)) * -2.0)))))) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 5.5e-86) tmp = sqrt(Float64(t * Float64(2.0 * Float64(n * U)))); else tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(t + Float64(Float64(l * Float64(l / Om)) * -2.0)))))); end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 5.5e-86) tmp = sqrt((t * (2.0 * (n * U)))); else tmp = sqrt((2.0 * (U * (n * (t + ((l * (l / Om)) * -2.0)))))); end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 5.5e-86], N[Sqrt[N[(t * N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(t + N[(N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 5.5 \cdot 10^{-86}:\\
\;\;\;\;\sqrt{t \cdot \left(2 \cdot \left(n \cdot U\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(t + \left(\ell \cdot \frac{\ell}{Om}\right) \cdot -2\right)\right)\right)}\\
\end{array}
\end{array}
if l < 5.5e-86Initial program 51.1%
Simplified51.4%
Taylor expanded in t around inf 38.0%
if 5.5e-86 < l Initial program 48.2%
Simplified45.3%
Taylor expanded in t around 0 30.9%
distribute-lft-out30.9%
unpow230.9%
associate-*r/30.9%
*-commutative30.9%
associate-*l*30.9%
unpow230.9%
unpow230.9%
Simplified30.9%
*-un-lft-identity30.9%
distribute-lft-out30.9%
associate-*l/30.9%
times-frac36.9%
associate-*l/43.8%
*-commutative43.8%
Applied egg-rr43.8%
*-lft-identity43.8%
distribute-lft-in43.8%
associate-*r*47.8%
associate-*r*53.5%
distribute-lft-out54.8%
*-commutative54.8%
associate-*l*55.0%
distribute-lft-out--59.4%
Simplified60.7%
Taylor expanded in U around 0 50.4%
mul-1-neg50.4%
associate-/l*51.8%
distribute-neg-frac51.8%
unpow251.8%
times-frac60.2%
Simplified60.2%
Taylor expanded in n around 0 31.1%
unpow231.1%
associate-*r/37.8%
Simplified37.8%
Final simplification37.9%
(FPCore (n U t l Om U*) :precision binary64 (sqrt (* 2.0 (* (* n U) (+ t (* (* l (/ l Om)) -2.0))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return sqrt((2.0 * ((n * U) * (t + ((l * (l / Om)) * -2.0)))));
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
code = sqrt((2.0d0 * ((n * u) * (t + ((l * (l / om)) * (-2.0d0))))))
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 + ((l * (l / Om)) * -2.0)))));
}
def code(n, U, t, l, Om, U_42_): return math.sqrt((2.0 * ((n * U) * (t + ((l * (l / Om)) * -2.0)))))
function code(n, U, t, l, Om, U_42_) return sqrt(Float64(2.0 * Float64(Float64(n * U) * Float64(t + Float64(Float64(l * Float64(l / Om)) * -2.0))))) end
function tmp = code(n, U, t, l, Om, U_42_) tmp = sqrt((2.0 * ((n * U) * (t + ((l * (l / Om)) * -2.0))))); end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Sqrt[N[(2.0 * N[(N[(n * U), $MachinePrecision] * N[(t + N[(N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{2 \cdot \left(\left(n \cdot U\right) \cdot \left(t + \left(\ell \cdot \frac{\ell}{Om}\right) \cdot -2\right)\right)}
\end{array}
Initial program 50.3%
associate-*l/54.8%
Applied egg-rr54.8%
Taylor expanded in n around 0 38.5%
associate-*r*41.2%
*-commutative41.2%
unpow241.2%
associate-*r/44.7%
cancel-sign-sub-inv44.7%
metadata-eval44.7%
Simplified44.7%
Final simplification44.7%
(FPCore (n U t l Om U*) :precision binary64 (if (<= l 6e-86) (sqrt (* t (* 2.0 (* n U)))) (pow (* 2.0 (* U (* n t))) 0.5)))
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 6e-86) {
tmp = sqrt((t * (2.0 * (n * U))));
} else {
tmp = pow((2.0 * (U * (n * t))), 0.5);
}
return tmp;
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l <= 6d-86) then
tmp = sqrt((t * (2.0d0 * (n * u))))
else
tmp = (2.0d0 * (u * (n * t))) ** 0.5d0
end if
code = tmp
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 6e-86) {
tmp = Math.sqrt((t * (2.0 * (n * U))));
} else {
tmp = Math.pow((2.0 * (U * (n * t))), 0.5);
}
return tmp;
}
def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 6e-86: tmp = math.sqrt((t * (2.0 * (n * U)))) else: tmp = math.pow((2.0 * (U * (n * t))), 0.5) return tmp
function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 6e-86) tmp = sqrt(Float64(t * Float64(2.0 * Float64(n * U)))); else tmp = Float64(2.0 * Float64(U * Float64(n * t))) ^ 0.5; end return tmp end
function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 6e-86) tmp = sqrt((t * (2.0 * (n * U)))); else tmp = (2.0 * (U * (n * t))) ^ 0.5; end tmp_2 = tmp; end
code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 6e-86], N[Sqrt[N[(t * N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Power[N[(2.0 * N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 6 \cdot 10^{-86}:\\
\;\;\;\;\sqrt{t \cdot \left(2 \cdot \left(n \cdot U\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;{\left(2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)}^{0.5}\\
\end{array}
\end{array}
if l < 6.0000000000000002e-86Initial program 51.1%
Simplified51.4%
Taylor expanded in t around inf 38.0%
if 6.0000000000000002e-86 < l Initial program 48.2%
Simplified54.8%
Taylor expanded in t around inf 22.9%
associate-*r*22.9%
Simplified22.9%
pow1/227.0%
associate-*l*27.0%
Applied egg-rr27.0%
Final simplification34.9%
(FPCore (n U t l Om U*) :precision binary64 (sqrt (* (* 2.0 U) (* n t))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return sqrt(((2.0 * U) * (n * t)));
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
code = sqrt(((2.0d0 * u) * (n * t)))
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.sqrt(((2.0 * U) * (n * t)));
}
def code(n, U, t, l, Om, U_42_): return math.sqrt(((2.0 * U) * (n * t)))
function code(n, U, t, l, Om, U_42_) return sqrt(Float64(Float64(2.0 * 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[(N[(2.0 * U), $MachinePrecision] * N[(n * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\left(2 \cdot U\right) \cdot \left(n \cdot t\right)}
\end{array}
Initial program 50.3%
Simplified51.9%
Taylor expanded in t around inf 32.1%
associate-*r*32.1%
Simplified32.1%
Final simplification32.1%
(FPCore (n U t l Om U*) :precision binary64 (sqrt (* t (* 2.0 (* n U)))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return sqrt((t * (2.0 * (n * U))));
}
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((t * (2.0d0 * (n * u))))
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.sqrt((t * (2.0 * (n * U))));
}
def code(n, U, t, l, Om, U_42_): return math.sqrt((t * (2.0 * (n * U))))
function code(n, U, t, l, Om, U_42_) return sqrt(Float64(t * Float64(2.0 * Float64(n * U)))) end
function tmp = code(n, U, t, l, Om, U_42_) tmp = sqrt((t * (2.0 * (n * U)))); end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Sqrt[N[(t * N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{t \cdot \left(2 \cdot \left(n \cdot U\right)\right)}
\end{array}
Initial program 50.3%
Simplified49.7%
Taylor expanded in t around inf 33.7%
Final simplification33.7%
herbie shell --seed 2023285
(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*))))))