
(FPCore (c0 A V l) :precision binary64 (* c0 (sqrt (/ A (* V l)))))
double code(double c0, double A, double V, double l) {
return c0 * sqrt((A / (V * l)));
}
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
code = c0 * sqrt((a / (v * l)))
end function
public static double code(double c0, double A, double V, double l) {
return c0 * Math.sqrt((A / (V * l)));
}
def code(c0, A, V, l): return c0 * math.sqrt((A / (V * l)))
function code(c0, A, V, l) return Float64(c0 * sqrt(Float64(A / Float64(V * l)))) end
function tmp = code(c0, A, V, l) tmp = c0 * sqrt((A / (V * l))); end
code[c0_, A_, V_, l_] := N[(c0 * N[Sqrt[N[(A / N[(V * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
c0 \cdot \sqrt{\frac{A}{V \cdot \ell}}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 14 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (c0 A V l) :precision binary64 (* c0 (sqrt (/ A (* V l)))))
double code(double c0, double A, double V, double l) {
return c0 * sqrt((A / (V * l)));
}
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
code = c0 * sqrt((a / (v * l)))
end function
public static double code(double c0, double A, double V, double l) {
return c0 * Math.sqrt((A / (V * l)));
}
def code(c0, A, V, l): return c0 * math.sqrt((A / (V * l)))
function code(c0, A, V, l) return Float64(c0 * sqrt(Float64(A / Float64(V * l)))) end
function tmp = code(c0, A, V, l) tmp = c0 * sqrt((A / (V * l))); end
code[c0_, A_, V_, l_] := N[(c0 * N[Sqrt[N[(A / N[(V * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
c0 \cdot \sqrt{\frac{A}{V \cdot \ell}}
\end{array}
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
:precision binary64
(let* ((t_0 (sqrt (- A))))
(if (<= (* l V) -2e+273)
(/ (* c0 t_0) (* (sqrt l) (sqrt (- V))))
(if (<= (* l V) -5e-250)
(* (/ t_0 (sqrt (* (- l) V))) c0)
(if (<= (* l V) 5e-292)
(* (/ (sqrt (/ A V)) (sqrt l)) c0)
(if (<= (* l V) 5e+291)
(* (* (sqrt A) (sqrt (/ 1.0 (* l V)))) c0)
(* (sqrt (/ (* (/ -1.0 V) A) (- l))) c0)))))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = sqrt(-A);
double tmp;
if ((l * V) <= -2e+273) {
tmp = (c0 * t_0) / (sqrt(l) * sqrt(-V));
} else if ((l * V) <= -5e-250) {
tmp = (t_0 / sqrt((-l * V))) * c0;
} else if ((l * V) <= 5e-292) {
tmp = (sqrt((A / V)) / sqrt(l)) * c0;
} else if ((l * V) <= 5e+291) {
tmp = (sqrt(A) * sqrt((1.0 / (l * V)))) * c0;
} else {
tmp = sqrt((((-1.0 / V) * A) / -l)) * c0;
}
return tmp;
}
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
real(8) :: t_0
real(8) :: tmp
t_0 = sqrt(-a)
if ((l * v) <= (-2d+273)) then
tmp = (c0 * t_0) / (sqrt(l) * sqrt(-v))
else if ((l * v) <= (-5d-250)) then
tmp = (t_0 / sqrt((-l * v))) * c0
else if ((l * v) <= 5d-292) then
tmp = (sqrt((a / v)) / sqrt(l)) * c0
else if ((l * v) <= 5d+291) then
tmp = (sqrt(a) * sqrt((1.0d0 / (l * v)))) * c0
else
tmp = sqrt(((((-1.0d0) / v) * a) / -l)) * c0
end if
code = tmp
end function
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double t_0 = Math.sqrt(-A);
double tmp;
if ((l * V) <= -2e+273) {
tmp = (c0 * t_0) / (Math.sqrt(l) * Math.sqrt(-V));
} else if ((l * V) <= -5e-250) {
tmp = (t_0 / Math.sqrt((-l * V))) * c0;
} else if ((l * V) <= 5e-292) {
tmp = (Math.sqrt((A / V)) / Math.sqrt(l)) * c0;
} else if ((l * V) <= 5e+291) {
tmp = (Math.sqrt(A) * Math.sqrt((1.0 / (l * V)))) * c0;
} else {
tmp = Math.sqrt((((-1.0 / V) * A) / -l)) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = math.sqrt(-A) tmp = 0 if (l * V) <= -2e+273: tmp = (c0 * t_0) / (math.sqrt(l) * math.sqrt(-V)) elif (l * V) <= -5e-250: tmp = (t_0 / math.sqrt((-l * V))) * c0 elif (l * V) <= 5e-292: tmp = (math.sqrt((A / V)) / math.sqrt(l)) * c0 elif (l * V) <= 5e+291: tmp = (math.sqrt(A) * math.sqrt((1.0 / (l * V)))) * c0 else: tmp = math.sqrt((((-1.0 / V) * A) / -l)) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = sqrt(Float64(-A)) tmp = 0.0 if (Float64(l * V) <= -2e+273) tmp = Float64(Float64(c0 * t_0) / Float64(sqrt(l) * sqrt(Float64(-V)))); elseif (Float64(l * V) <= -5e-250) tmp = Float64(Float64(t_0 / sqrt(Float64(Float64(-l) * V))) * c0); elseif (Float64(l * V) <= 5e-292) tmp = Float64(Float64(sqrt(Float64(A / V)) / sqrt(l)) * c0); elseif (Float64(l * V) <= 5e+291) tmp = Float64(Float64(sqrt(A) * sqrt(Float64(1.0 / Float64(l * V)))) * c0); else tmp = Float64(sqrt(Float64(Float64(Float64(-1.0 / V) * A) / Float64(-l))) * c0); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
t_0 = sqrt(-A);
tmp = 0.0;
if ((l * V) <= -2e+273)
tmp = (c0 * t_0) / (sqrt(l) * sqrt(-V));
elseif ((l * V) <= -5e-250)
tmp = (t_0 / sqrt((-l * V))) * c0;
elseif ((l * V) <= 5e-292)
tmp = (sqrt((A / V)) / sqrt(l)) * c0;
elseif ((l * V) <= 5e+291)
tmp = (sqrt(A) * sqrt((1.0 / (l * V)))) * c0;
else
tmp = sqrt((((-1.0 / V) * A) / -l)) * c0;
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
code[c0_, A_, V_, l_] := Block[{t$95$0 = N[Sqrt[(-A)], $MachinePrecision]}, If[LessEqual[N[(l * V), $MachinePrecision], -2e+273], N[(N[(c0 * t$95$0), $MachinePrecision] / N[(N[Sqrt[l], $MachinePrecision] * N[Sqrt[(-V)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], -5e-250], N[(N[(t$95$0 / N[Sqrt[N[((-l) * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 5e-292], N[(N[(N[Sqrt[N[(A / V), $MachinePrecision]], $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 5e+291], N[(N[(N[Sqrt[A], $MachinePrecision] * N[Sqrt[N[(1.0 / N[(l * V), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(-1.0 / V), $MachinePrecision] * A), $MachinePrecision] / (-l)), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]]]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
t_0 := \sqrt{-A}\\
\mathbf{if}\;\ell \cdot V \leq -2 \cdot 10^{+273}:\\
\;\;\;\;\frac{c0 \cdot t\_0}{\sqrt{\ell} \cdot \sqrt{-V}}\\
\mathbf{elif}\;\ell \cdot V \leq -5 \cdot 10^{-250}:\\
\;\;\;\;\frac{t\_0}{\sqrt{\left(-\ell\right) \cdot V}} \cdot c0\\
\mathbf{elif}\;\ell \cdot V \leq 5 \cdot 10^{-292}:\\
\;\;\;\;\frac{\sqrt{\frac{A}{V}}}{\sqrt{\ell}} \cdot c0\\
\mathbf{elif}\;\ell \cdot V \leq 5 \cdot 10^{+291}:\\
\;\;\;\;\left(\sqrt{A} \cdot \sqrt{\frac{1}{\ell \cdot V}}\right) \cdot c0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{\frac{-1}{V} \cdot A}{-\ell}} \cdot c0\\
\end{array}
\end{array}
if (*.f64 V l) < -1.99999999999999989e273Initial program 32.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6457.5
Applied rewrites57.5%
lift-/.f64N/A
clear-numN/A
frac-2negN/A
associate-/r/N/A
lower-*.f64N/A
metadata-evalN/A
frac-2negN/A
lower-/.f64N/A
lower-neg.f6457.5
Applied rewrites57.5%
lift-*.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
sqrt-divN/A
neg-mul-1N/A
lift-neg.f64N/A
remove-double-negN/A
sqrt-divN/A
lift-/.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
associate-*l/N/A
associate-*r/N/A
Applied rewrites47.0%
if -1.99999999999999989e273 < (*.f64 V l) < -5.00000000000000027e-250Initial program 83.7%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6474.9
Applied rewrites74.9%
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
div-invN/A
lift-sqrt.f64N/A
lift-/.f64N/A
frac-2negN/A
sqrt-divN/A
frac-timesN/A
metadata-evalN/A
sqrt-prodN/A
*-rgt-identityN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-neg.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
distribute-lft-neg-inN/A
lower-sqrt.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f6499.5
Applied rewrites99.5%
if -5.00000000000000027e-250 < (*.f64 V l) < 4.99999999999999981e-292Initial program 43.7%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6453.5
Applied rewrites53.5%
if 4.99999999999999981e-292 < (*.f64 V l) < 5.0000000000000001e291Initial program 83.2%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6474.9
Applied rewrites74.9%
lift-/.f64N/A
clear-numN/A
frac-2negN/A
associate-/r/N/A
lower-*.f64N/A
metadata-evalN/A
frac-2negN/A
lower-/.f64N/A
lower-neg.f6474.9
Applied rewrites74.9%
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
neg-mul-1N/A
lift-neg.f64N/A
remove-double-negN/A
associate-/r/N/A
associate-*l/N/A
sqrt-divN/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-sqrt.f6499.3
Applied rewrites99.3%
Taylor expanded in V around 0
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6499.3
Applied rewrites99.3%
if 5.0000000000000001e291 < (*.f64 V l) Initial program 44.4%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6469.0
Applied rewrites69.0%
lift-/.f64N/A
clear-numN/A
frac-2negN/A
associate-/r/N/A
lower-*.f64N/A
metadata-evalN/A
frac-2negN/A
lower-/.f64N/A
lower-neg.f6469.1
Applied rewrites69.1%
Final simplification87.6%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
:precision binary64
(if (<= (* l V) (- INFINITY))
(/ (* (sqrt (/ (- A) l)) c0) (sqrt (- V)))
(if (<= (* l V) -5e-250)
(* (/ (sqrt (- A)) (sqrt (* (- l) V))) c0)
(if (<= (* l V) 5e-292)
(* (/ (sqrt (/ A V)) (sqrt l)) c0)
(if (<= (* l V) 5e+291)
(* (* (sqrt A) (sqrt (/ 1.0 (* l V)))) c0)
(* (sqrt (/ (* (/ -1.0 V) A) (- l))) c0))))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double tmp;
if ((l * V) <= -((double) INFINITY)) {
tmp = (sqrt((-A / l)) * c0) / sqrt(-V);
} else if ((l * V) <= -5e-250) {
tmp = (sqrt(-A) / sqrt((-l * V))) * c0;
} else if ((l * V) <= 5e-292) {
tmp = (sqrt((A / V)) / sqrt(l)) * c0;
} else if ((l * V) <= 5e+291) {
tmp = (sqrt(A) * sqrt((1.0 / (l * V)))) * c0;
} else {
tmp = sqrt((((-1.0 / V) * A) / -l)) * c0;
}
return tmp;
}
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double tmp;
if ((l * V) <= -Double.POSITIVE_INFINITY) {
tmp = (Math.sqrt((-A / l)) * c0) / Math.sqrt(-V);
} else if ((l * V) <= -5e-250) {
tmp = (Math.sqrt(-A) / Math.sqrt((-l * V))) * c0;
} else if ((l * V) <= 5e-292) {
tmp = (Math.sqrt((A / V)) / Math.sqrt(l)) * c0;
} else if ((l * V) <= 5e+291) {
tmp = (Math.sqrt(A) * Math.sqrt((1.0 / (l * V)))) * c0;
} else {
tmp = Math.sqrt((((-1.0 / V) * A) / -l)) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): tmp = 0 if (l * V) <= -math.inf: tmp = (math.sqrt((-A / l)) * c0) / math.sqrt(-V) elif (l * V) <= -5e-250: tmp = (math.sqrt(-A) / math.sqrt((-l * V))) * c0 elif (l * V) <= 5e-292: tmp = (math.sqrt((A / V)) / math.sqrt(l)) * c0 elif (l * V) <= 5e+291: tmp = (math.sqrt(A) * math.sqrt((1.0 / (l * V)))) * c0 else: tmp = math.sqrt((((-1.0 / V) * A) / -l)) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) tmp = 0.0 if (Float64(l * V) <= Float64(-Inf)) tmp = Float64(Float64(sqrt(Float64(Float64(-A) / l)) * c0) / sqrt(Float64(-V))); elseif (Float64(l * V) <= -5e-250) tmp = Float64(Float64(sqrt(Float64(-A)) / sqrt(Float64(Float64(-l) * V))) * c0); elseif (Float64(l * V) <= 5e-292) tmp = Float64(Float64(sqrt(Float64(A / V)) / sqrt(l)) * c0); elseif (Float64(l * V) <= 5e+291) tmp = Float64(Float64(sqrt(A) * sqrt(Float64(1.0 / Float64(l * V)))) * c0); else tmp = Float64(sqrt(Float64(Float64(Float64(-1.0 / V) * A) / Float64(-l))) * c0); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
tmp = 0.0;
if ((l * V) <= -Inf)
tmp = (sqrt((-A / l)) * c0) / sqrt(-V);
elseif ((l * V) <= -5e-250)
tmp = (sqrt(-A) / sqrt((-l * V))) * c0;
elseif ((l * V) <= 5e-292)
tmp = (sqrt((A / V)) / sqrt(l)) * c0;
elseif ((l * V) <= 5e+291)
tmp = (sqrt(A) * sqrt((1.0 / (l * V)))) * c0;
else
tmp = sqrt((((-1.0 / V) * A) / -l)) * c0;
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function. code[c0_, A_, V_, l_] := If[LessEqual[N[(l * V), $MachinePrecision], (-Infinity)], N[(N[(N[Sqrt[N[((-A) / l), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision] / N[Sqrt[(-V)], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], -5e-250], N[(N[(N[Sqrt[(-A)], $MachinePrecision] / N[Sqrt[N[((-l) * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 5e-292], N[(N[(N[Sqrt[N[(A / V), $MachinePrecision]], $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 5e+291], N[(N[(N[Sqrt[A], $MachinePrecision] * N[Sqrt[N[(1.0 / N[(l * V), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(-1.0 / V), $MachinePrecision] * A), $MachinePrecision] / (-l)), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \cdot V \leq -\infty:\\
\;\;\;\;\frac{\sqrt{\frac{-A}{\ell}} \cdot c0}{\sqrt{-V}}\\
\mathbf{elif}\;\ell \cdot V \leq -5 \cdot 10^{-250}:\\
\;\;\;\;\frac{\sqrt{-A}}{\sqrt{\left(-\ell\right) \cdot V}} \cdot c0\\
\mathbf{elif}\;\ell \cdot V \leq 5 \cdot 10^{-292}:\\
\;\;\;\;\frac{\sqrt{\frac{A}{V}}}{\sqrt{\ell}} \cdot c0\\
\mathbf{elif}\;\ell \cdot V \leq 5 \cdot 10^{+291}:\\
\;\;\;\;\left(\sqrt{A} \cdot \sqrt{\frac{1}{\ell \cdot V}}\right) \cdot c0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{\frac{-1}{V} \cdot A}{-\ell}} \cdot c0\\
\end{array}
\end{array}
if (*.f64 V l) < -inf.0Initial program 27.5%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6457.5
Applied rewrites57.5%
lift-*.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
div-invN/A
div-invN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-divN/A
div-invN/A
lift-/.f64N/A
associate-*l/N/A
div-invN/A
lift-/.f64N/A
frac-2negN/A
sqrt-divN/A
associate-*l/N/A
lower-/.f64N/A
Applied rewrites43.9%
if -inf.0 < (*.f64 V l) < -5.00000000000000027e-250Initial program 82.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6474.3
Applied rewrites74.3%
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
div-invN/A
lift-sqrt.f64N/A
lift-/.f64N/A
frac-2negN/A
sqrt-divN/A
frac-timesN/A
metadata-evalN/A
sqrt-prodN/A
*-rgt-identityN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-neg.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
distribute-lft-neg-inN/A
lower-sqrt.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f6499.4
Applied rewrites99.4%
if -5.00000000000000027e-250 < (*.f64 V l) < 4.99999999999999981e-292Initial program 43.7%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6453.5
Applied rewrites53.5%
if 4.99999999999999981e-292 < (*.f64 V l) < 5.0000000000000001e291Initial program 83.2%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6474.9
Applied rewrites74.9%
lift-/.f64N/A
clear-numN/A
frac-2negN/A
associate-/r/N/A
lower-*.f64N/A
metadata-evalN/A
frac-2negN/A
lower-/.f64N/A
lower-neg.f6474.9
Applied rewrites74.9%
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
neg-mul-1N/A
lift-neg.f64N/A
remove-double-negN/A
associate-/r/N/A
associate-*l/N/A
sqrt-divN/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-sqrt.f6499.3
Applied rewrites99.3%
Taylor expanded in V around 0
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6499.3
Applied rewrites99.3%
if 5.0000000000000001e291 < (*.f64 V l) Initial program 44.4%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6469.0
Applied rewrites69.0%
lift-/.f64N/A
clear-numN/A
frac-2negN/A
associate-/r/N/A
lower-*.f64N/A
metadata-evalN/A
frac-2negN/A
lower-/.f64N/A
lower-neg.f6469.1
Applied rewrites69.1%
Final simplification88.0%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
:precision binary64
(if (<= (* l V) -5e+300)
(* (/ (sqrt (/ (- A) l)) (sqrt (- V))) c0)
(if (<= (* l V) -5e-250)
(* (/ (sqrt (- A)) (sqrt (* (- l) V))) c0)
(if (<= (* l V) 5e-292)
(* (/ (sqrt (/ A V)) (sqrt l)) c0)
(if (<= (* l V) 5e+291)
(* (* (sqrt A) (sqrt (/ 1.0 (* l V)))) c0)
(* (sqrt (/ (* (/ -1.0 V) A) (- l))) c0))))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double tmp;
if ((l * V) <= -5e+300) {
tmp = (sqrt((-A / l)) / sqrt(-V)) * c0;
} else if ((l * V) <= -5e-250) {
tmp = (sqrt(-A) / sqrt((-l * V))) * c0;
} else if ((l * V) <= 5e-292) {
tmp = (sqrt((A / V)) / sqrt(l)) * c0;
} else if ((l * V) <= 5e+291) {
tmp = (sqrt(A) * sqrt((1.0 / (l * V)))) * c0;
} else {
tmp = sqrt((((-1.0 / V) * A) / -l)) * c0;
}
return tmp;
}
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
real(8) :: tmp
if ((l * v) <= (-5d+300)) then
tmp = (sqrt((-a / l)) / sqrt(-v)) * c0
else if ((l * v) <= (-5d-250)) then
tmp = (sqrt(-a) / sqrt((-l * v))) * c0
else if ((l * v) <= 5d-292) then
tmp = (sqrt((a / v)) / sqrt(l)) * c0
else if ((l * v) <= 5d+291) then
tmp = (sqrt(a) * sqrt((1.0d0 / (l * v)))) * c0
else
tmp = sqrt(((((-1.0d0) / v) * a) / -l)) * c0
end if
code = tmp
end function
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double tmp;
if ((l * V) <= -5e+300) {
tmp = (Math.sqrt((-A / l)) / Math.sqrt(-V)) * c0;
} else if ((l * V) <= -5e-250) {
tmp = (Math.sqrt(-A) / Math.sqrt((-l * V))) * c0;
} else if ((l * V) <= 5e-292) {
tmp = (Math.sqrt((A / V)) / Math.sqrt(l)) * c0;
} else if ((l * V) <= 5e+291) {
tmp = (Math.sqrt(A) * Math.sqrt((1.0 / (l * V)))) * c0;
} else {
tmp = Math.sqrt((((-1.0 / V) * A) / -l)) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): tmp = 0 if (l * V) <= -5e+300: tmp = (math.sqrt((-A / l)) / math.sqrt(-V)) * c0 elif (l * V) <= -5e-250: tmp = (math.sqrt(-A) / math.sqrt((-l * V))) * c0 elif (l * V) <= 5e-292: tmp = (math.sqrt((A / V)) / math.sqrt(l)) * c0 elif (l * V) <= 5e+291: tmp = (math.sqrt(A) * math.sqrt((1.0 / (l * V)))) * c0 else: tmp = math.sqrt((((-1.0 / V) * A) / -l)) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) tmp = 0.0 if (Float64(l * V) <= -5e+300) tmp = Float64(Float64(sqrt(Float64(Float64(-A) / l)) / sqrt(Float64(-V))) * c0); elseif (Float64(l * V) <= -5e-250) tmp = Float64(Float64(sqrt(Float64(-A)) / sqrt(Float64(Float64(-l) * V))) * c0); elseif (Float64(l * V) <= 5e-292) tmp = Float64(Float64(sqrt(Float64(A / V)) / sqrt(l)) * c0); elseif (Float64(l * V) <= 5e+291) tmp = Float64(Float64(sqrt(A) * sqrt(Float64(1.0 / Float64(l * V)))) * c0); else tmp = Float64(sqrt(Float64(Float64(Float64(-1.0 / V) * A) / Float64(-l))) * c0); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
tmp = 0.0;
if ((l * V) <= -5e+300)
tmp = (sqrt((-A / l)) / sqrt(-V)) * c0;
elseif ((l * V) <= -5e-250)
tmp = (sqrt(-A) / sqrt((-l * V))) * c0;
elseif ((l * V) <= 5e-292)
tmp = (sqrt((A / V)) / sqrt(l)) * c0;
elseif ((l * V) <= 5e+291)
tmp = (sqrt(A) * sqrt((1.0 / (l * V)))) * c0;
else
tmp = sqrt((((-1.0 / V) * A) / -l)) * c0;
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function. code[c0_, A_, V_, l_] := If[LessEqual[N[(l * V), $MachinePrecision], -5e+300], N[(N[(N[Sqrt[N[((-A) / l), $MachinePrecision]], $MachinePrecision] / N[Sqrt[(-V)], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], -5e-250], N[(N[(N[Sqrt[(-A)], $MachinePrecision] / N[Sqrt[N[((-l) * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 5e-292], N[(N[(N[Sqrt[N[(A / V), $MachinePrecision]], $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 5e+291], N[(N[(N[Sqrt[A], $MachinePrecision] * N[Sqrt[N[(1.0 / N[(l * V), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(-1.0 / V), $MachinePrecision] * A), $MachinePrecision] / (-l)), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \cdot V \leq -5 \cdot 10^{+300}:\\
\;\;\;\;\frac{\sqrt{\frac{-A}{\ell}}}{\sqrt{-V}} \cdot c0\\
\mathbf{elif}\;\ell \cdot V \leq -5 \cdot 10^{-250}:\\
\;\;\;\;\frac{\sqrt{-A}}{\sqrt{\left(-\ell\right) \cdot V}} \cdot c0\\
\mathbf{elif}\;\ell \cdot V \leq 5 \cdot 10^{-292}:\\
\;\;\;\;\frac{\sqrt{\frac{A}{V}}}{\sqrt{\ell}} \cdot c0\\
\mathbf{elif}\;\ell \cdot V \leq 5 \cdot 10^{+291}:\\
\;\;\;\;\left(\sqrt{A} \cdot \sqrt{\frac{1}{\ell \cdot V}}\right) \cdot c0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{\frac{-1}{V} \cdot A}{-\ell}} \cdot c0\\
\end{array}
\end{array}
if (*.f64 V l) < -5.00000000000000026e300Initial program 30.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6458.2
Applied rewrites58.2%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r*N/A
associate-/l/N/A
lift-/.f64N/A
frac-2negN/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lift-/.f64N/A
distribute-neg-fracN/A
lower-/.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-neg.f6446.9
Applied rewrites46.9%
if -5.00000000000000026e300 < (*.f64 V l) < -5.00000000000000027e-250Initial program 83.0%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6474.4
Applied rewrites74.4%
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
div-invN/A
lift-sqrt.f64N/A
lift-/.f64N/A
frac-2negN/A
sqrt-divN/A
frac-timesN/A
metadata-evalN/A
sqrt-prodN/A
*-rgt-identityN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-neg.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
distribute-lft-neg-inN/A
lower-sqrt.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f6499.5
Applied rewrites99.5%
if -5.00000000000000027e-250 < (*.f64 V l) < 4.99999999999999981e-292Initial program 43.7%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6453.5
Applied rewrites53.5%
if 4.99999999999999981e-292 < (*.f64 V l) < 5.0000000000000001e291Initial program 83.2%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6474.9
Applied rewrites74.9%
lift-/.f64N/A
clear-numN/A
frac-2negN/A
associate-/r/N/A
lower-*.f64N/A
metadata-evalN/A
frac-2negN/A
lower-/.f64N/A
lower-neg.f6474.9
Applied rewrites74.9%
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
neg-mul-1N/A
lift-neg.f64N/A
remove-double-negN/A
associate-/r/N/A
associate-*l/N/A
sqrt-divN/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-sqrt.f6499.3
Applied rewrites99.3%
Taylor expanded in V around 0
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6499.3
Applied rewrites99.3%
if 5.0000000000000001e291 < (*.f64 V l) Initial program 44.4%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6469.0
Applied rewrites69.0%
lift-/.f64N/A
clear-numN/A
frac-2negN/A
associate-/r/N/A
lower-*.f64N/A
metadata-evalN/A
frac-2negN/A
lower-/.f64N/A
lower-neg.f6469.1
Applied rewrites69.1%
Final simplification88.0%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
:precision binary64
(let* ((t_0 (sqrt (/ A V))))
(if (<= (* l V) -5e+300)
(* (/ t_0 (sqrt l)) c0)
(if (<= (* l V) -5e-303)
(* (/ (sqrt (- A)) (sqrt (* (- l) V))) c0)
(if (<= (* l V) 1e-293)
(/ (* t_0 c0) (sqrt l))
(if (<= (* l V) 5e+291)
(* (* (sqrt A) (sqrt (/ 1.0 (* l V)))) c0)
(* (sqrt (/ (* (/ -1.0 V) A) (- l))) c0)))))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = sqrt((A / V));
double tmp;
if ((l * V) <= -5e+300) {
tmp = (t_0 / sqrt(l)) * c0;
} else if ((l * V) <= -5e-303) {
tmp = (sqrt(-A) / sqrt((-l * V))) * c0;
} else if ((l * V) <= 1e-293) {
tmp = (t_0 * c0) / sqrt(l);
} else if ((l * V) <= 5e+291) {
tmp = (sqrt(A) * sqrt((1.0 / (l * V)))) * c0;
} else {
tmp = sqrt((((-1.0 / V) * A) / -l)) * c0;
}
return tmp;
}
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
real(8) :: t_0
real(8) :: tmp
t_0 = sqrt((a / v))
if ((l * v) <= (-5d+300)) then
tmp = (t_0 / sqrt(l)) * c0
else if ((l * v) <= (-5d-303)) then
tmp = (sqrt(-a) / sqrt((-l * v))) * c0
else if ((l * v) <= 1d-293) then
tmp = (t_0 * c0) / sqrt(l)
else if ((l * v) <= 5d+291) then
tmp = (sqrt(a) * sqrt((1.0d0 / (l * v)))) * c0
else
tmp = sqrt(((((-1.0d0) / v) * a) / -l)) * c0
end if
code = tmp
end function
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double t_0 = Math.sqrt((A / V));
double tmp;
if ((l * V) <= -5e+300) {
tmp = (t_0 / Math.sqrt(l)) * c0;
} else if ((l * V) <= -5e-303) {
tmp = (Math.sqrt(-A) / Math.sqrt((-l * V))) * c0;
} else if ((l * V) <= 1e-293) {
tmp = (t_0 * c0) / Math.sqrt(l);
} else if ((l * V) <= 5e+291) {
tmp = (Math.sqrt(A) * Math.sqrt((1.0 / (l * V)))) * c0;
} else {
tmp = Math.sqrt((((-1.0 / V) * A) / -l)) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = math.sqrt((A / V)) tmp = 0 if (l * V) <= -5e+300: tmp = (t_0 / math.sqrt(l)) * c0 elif (l * V) <= -5e-303: tmp = (math.sqrt(-A) / math.sqrt((-l * V))) * c0 elif (l * V) <= 1e-293: tmp = (t_0 * c0) / math.sqrt(l) elif (l * V) <= 5e+291: tmp = (math.sqrt(A) * math.sqrt((1.0 / (l * V)))) * c0 else: tmp = math.sqrt((((-1.0 / V) * A) / -l)) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = sqrt(Float64(A / V)) tmp = 0.0 if (Float64(l * V) <= -5e+300) tmp = Float64(Float64(t_0 / sqrt(l)) * c0); elseif (Float64(l * V) <= -5e-303) tmp = Float64(Float64(sqrt(Float64(-A)) / sqrt(Float64(Float64(-l) * V))) * c0); elseif (Float64(l * V) <= 1e-293) tmp = Float64(Float64(t_0 * c0) / sqrt(l)); elseif (Float64(l * V) <= 5e+291) tmp = Float64(Float64(sqrt(A) * sqrt(Float64(1.0 / Float64(l * V)))) * c0); else tmp = Float64(sqrt(Float64(Float64(Float64(-1.0 / V) * A) / Float64(-l))) * c0); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
t_0 = sqrt((A / V));
tmp = 0.0;
if ((l * V) <= -5e+300)
tmp = (t_0 / sqrt(l)) * c0;
elseif ((l * V) <= -5e-303)
tmp = (sqrt(-A) / sqrt((-l * V))) * c0;
elseif ((l * V) <= 1e-293)
tmp = (t_0 * c0) / sqrt(l);
elseif ((l * V) <= 5e+291)
tmp = (sqrt(A) * sqrt((1.0 / (l * V)))) * c0;
else
tmp = sqrt((((-1.0 / V) * A) / -l)) * c0;
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
code[c0_, A_, V_, l_] := Block[{t$95$0 = N[Sqrt[N[(A / V), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[N[(l * V), $MachinePrecision], -5e+300], N[(N[(t$95$0 / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], -5e-303], N[(N[(N[Sqrt[(-A)], $MachinePrecision] / N[Sqrt[N[((-l) * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 1e-293], N[(N[(t$95$0 * c0), $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 5e+291], N[(N[(N[Sqrt[A], $MachinePrecision] * N[Sqrt[N[(1.0 / N[(l * V), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(-1.0 / V), $MachinePrecision] * A), $MachinePrecision] / (-l)), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]]]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{A}{V}}\\
\mathbf{if}\;\ell \cdot V \leq -5 \cdot 10^{+300}:\\
\;\;\;\;\frac{t\_0}{\sqrt{\ell}} \cdot c0\\
\mathbf{elif}\;\ell \cdot V \leq -5 \cdot 10^{-303}:\\
\;\;\;\;\frac{\sqrt{-A}}{\sqrt{\left(-\ell\right) \cdot V}} \cdot c0\\
\mathbf{elif}\;\ell \cdot V \leq 10^{-293}:\\
\;\;\;\;\frac{t\_0 \cdot c0}{\sqrt{\ell}}\\
\mathbf{elif}\;\ell \cdot V \leq 5 \cdot 10^{+291}:\\
\;\;\;\;\left(\sqrt{A} \cdot \sqrt{\frac{1}{\ell \cdot V}}\right) \cdot c0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{\frac{-1}{V} \cdot A}{-\ell}} \cdot c0\\
\end{array}
\end{array}
if (*.f64 V l) < -5.00000000000000026e300Initial program 30.1%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6441.4
Applied rewrites41.4%
if -5.00000000000000026e300 < (*.f64 V l) < -4.9999999999999998e-303Initial program 83.0%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6475.0
Applied rewrites75.0%
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
div-invN/A
lift-sqrt.f64N/A
lift-/.f64N/A
frac-2negN/A
sqrt-divN/A
frac-timesN/A
metadata-evalN/A
sqrt-prodN/A
*-rgt-identityN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-neg.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
distribute-lft-neg-inN/A
lower-sqrt.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f6499.5
Applied rewrites99.5%
if -4.9999999999999998e-303 < (*.f64 V l) < 1.0000000000000001e-293Initial program 31.8%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
sqrt-divN/A
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6456.5
Applied rewrites56.5%
if 1.0000000000000001e-293 < (*.f64 V l) < 5.0000000000000001e291Initial program 83.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6475.2
Applied rewrites75.2%
lift-/.f64N/A
clear-numN/A
frac-2negN/A
associate-/r/N/A
lower-*.f64N/A
metadata-evalN/A
frac-2negN/A
lower-/.f64N/A
lower-neg.f6475.2
Applied rewrites75.2%
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
neg-mul-1N/A
lift-neg.f64N/A
remove-double-negN/A
associate-/r/N/A
associate-*l/N/A
sqrt-divN/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-sqrt.f6499.3
Applied rewrites99.3%
Taylor expanded in V around 0
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6499.3
Applied rewrites99.3%
if 5.0000000000000001e291 < (*.f64 V l) Initial program 44.4%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6469.0
Applied rewrites69.0%
lift-/.f64N/A
clear-numN/A
frac-2negN/A
associate-/r/N/A
lower-*.f64N/A
metadata-evalN/A
frac-2negN/A
lower-/.f64N/A
lower-neg.f6469.1
Applied rewrites69.1%
Final simplification89.2%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
:precision binary64
(let* ((t_0 (* (/ (sqrt (/ A V)) (sqrt l)) c0)))
(if (<= (* l V) -5e+300)
t_0
(if (<= (* l V) -5e-250)
(* (/ (sqrt (- A)) (sqrt (* (- l) V))) c0)
(if (<= (* l V) 5e-292)
t_0
(if (<= (* l V) 5e+291)
(* (* (sqrt A) (sqrt (/ 1.0 (* l V)))) c0)
(* (sqrt (/ (* (/ -1.0 V) A) (- l))) c0)))))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = (sqrt((A / V)) / sqrt(l)) * c0;
double tmp;
if ((l * V) <= -5e+300) {
tmp = t_0;
} else if ((l * V) <= -5e-250) {
tmp = (sqrt(-A) / sqrt((-l * V))) * c0;
} else if ((l * V) <= 5e-292) {
tmp = t_0;
} else if ((l * V) <= 5e+291) {
tmp = (sqrt(A) * sqrt((1.0 / (l * V)))) * c0;
} else {
tmp = sqrt((((-1.0 / V) * A) / -l)) * c0;
}
return tmp;
}
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
real(8) :: t_0
real(8) :: tmp
t_0 = (sqrt((a / v)) / sqrt(l)) * c0
if ((l * v) <= (-5d+300)) then
tmp = t_0
else if ((l * v) <= (-5d-250)) then
tmp = (sqrt(-a) / sqrt((-l * v))) * c0
else if ((l * v) <= 5d-292) then
tmp = t_0
else if ((l * v) <= 5d+291) then
tmp = (sqrt(a) * sqrt((1.0d0 / (l * v)))) * c0
else
tmp = sqrt(((((-1.0d0) / v) * a) / -l)) * c0
end if
code = tmp
end function
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double t_0 = (Math.sqrt((A / V)) / Math.sqrt(l)) * c0;
double tmp;
if ((l * V) <= -5e+300) {
tmp = t_0;
} else if ((l * V) <= -5e-250) {
tmp = (Math.sqrt(-A) / Math.sqrt((-l * V))) * c0;
} else if ((l * V) <= 5e-292) {
tmp = t_0;
} else if ((l * V) <= 5e+291) {
tmp = (Math.sqrt(A) * Math.sqrt((1.0 / (l * V)))) * c0;
} else {
tmp = Math.sqrt((((-1.0 / V) * A) / -l)) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = (math.sqrt((A / V)) / math.sqrt(l)) * c0 tmp = 0 if (l * V) <= -5e+300: tmp = t_0 elif (l * V) <= -5e-250: tmp = (math.sqrt(-A) / math.sqrt((-l * V))) * c0 elif (l * V) <= 5e-292: tmp = t_0 elif (l * V) <= 5e+291: tmp = (math.sqrt(A) * math.sqrt((1.0 / (l * V)))) * c0 else: tmp = math.sqrt((((-1.0 / V) * A) / -l)) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = Float64(Float64(sqrt(Float64(A / V)) / sqrt(l)) * c0) tmp = 0.0 if (Float64(l * V) <= -5e+300) tmp = t_0; elseif (Float64(l * V) <= -5e-250) tmp = Float64(Float64(sqrt(Float64(-A)) / sqrt(Float64(Float64(-l) * V))) * c0); elseif (Float64(l * V) <= 5e-292) tmp = t_0; elseif (Float64(l * V) <= 5e+291) tmp = Float64(Float64(sqrt(A) * sqrt(Float64(1.0 / Float64(l * V)))) * c0); else tmp = Float64(sqrt(Float64(Float64(Float64(-1.0 / V) * A) / Float64(-l))) * c0); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
t_0 = (sqrt((A / V)) / sqrt(l)) * c0;
tmp = 0.0;
if ((l * V) <= -5e+300)
tmp = t_0;
elseif ((l * V) <= -5e-250)
tmp = (sqrt(-A) / sqrt((-l * V))) * c0;
elseif ((l * V) <= 5e-292)
tmp = t_0;
elseif ((l * V) <= 5e+291)
tmp = (sqrt(A) * sqrt((1.0 / (l * V)))) * c0;
else
tmp = sqrt((((-1.0 / V) * A) / -l)) * c0;
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
code[c0_, A_, V_, l_] := Block[{t$95$0 = N[(N[(N[Sqrt[N[(A / V), $MachinePrecision]], $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision]}, If[LessEqual[N[(l * V), $MachinePrecision], -5e+300], t$95$0, If[LessEqual[N[(l * V), $MachinePrecision], -5e-250], N[(N[(N[Sqrt[(-A)], $MachinePrecision] / N[Sqrt[N[((-l) * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 5e-292], t$95$0, If[LessEqual[N[(l * V), $MachinePrecision], 5e+291], N[(N[(N[Sqrt[A], $MachinePrecision] * N[Sqrt[N[(1.0 / N[(l * V), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(-1.0 / V), $MachinePrecision] * A), $MachinePrecision] / (-l)), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]]]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
t_0 := \frac{\sqrt{\frac{A}{V}}}{\sqrt{\ell}} \cdot c0\\
\mathbf{if}\;\ell \cdot V \leq -5 \cdot 10^{+300}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\ell \cdot V \leq -5 \cdot 10^{-250}:\\
\;\;\;\;\frac{\sqrt{-A}}{\sqrt{\left(-\ell\right) \cdot V}} \cdot c0\\
\mathbf{elif}\;\ell \cdot V \leq 5 \cdot 10^{-292}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\ell \cdot V \leq 5 \cdot 10^{+291}:\\
\;\;\;\;\left(\sqrt{A} \cdot \sqrt{\frac{1}{\ell \cdot V}}\right) \cdot c0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{\frac{-1}{V} \cdot A}{-\ell}} \cdot c0\\
\end{array}
\end{array}
if (*.f64 V l) < -5.00000000000000026e300 or -5.00000000000000027e-250 < (*.f64 V l) < 4.99999999999999981e-292Initial program 38.9%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6449.3
Applied rewrites49.3%
if -5.00000000000000026e300 < (*.f64 V l) < -5.00000000000000027e-250Initial program 83.0%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6474.4
Applied rewrites74.4%
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
div-invN/A
lift-sqrt.f64N/A
lift-/.f64N/A
frac-2negN/A
sqrt-divN/A
frac-timesN/A
metadata-evalN/A
sqrt-prodN/A
*-rgt-identityN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-neg.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
distribute-lft-neg-inN/A
lower-sqrt.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f6499.5
Applied rewrites99.5%
if 4.99999999999999981e-292 < (*.f64 V l) < 5.0000000000000001e291Initial program 83.2%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6474.9
Applied rewrites74.9%
lift-/.f64N/A
clear-numN/A
frac-2negN/A
associate-/r/N/A
lower-*.f64N/A
metadata-evalN/A
frac-2negN/A
lower-/.f64N/A
lower-neg.f6474.9
Applied rewrites74.9%
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
neg-mul-1N/A
lift-neg.f64N/A
remove-double-negN/A
associate-/r/N/A
associate-*l/N/A
sqrt-divN/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-sqrt.f6499.3
Applied rewrites99.3%
Taylor expanded in V around 0
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6499.3
Applied rewrites99.3%
if 5.0000000000000001e291 < (*.f64 V l) Initial program 44.4%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6469.0
Applied rewrites69.0%
lift-/.f64N/A
clear-numN/A
frac-2negN/A
associate-/r/N/A
lower-*.f64N/A
metadata-evalN/A
frac-2negN/A
lower-/.f64N/A
lower-neg.f6469.1
Applied rewrites69.1%
Final simplification87.7%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
:precision binary64
(let* ((t_0 (/ c0 (sqrt (* (/ l A) V)))))
(if (<= (* l V) (- INFINITY))
t_0
(if (<= (* l V) -5e-303)
(* (/ (sqrt (- A)) (sqrt (* (- l) V))) c0)
(if (<= (* l V) 1e-256)
t_0
(if (<= (* l V) 5e+291)
(* (* (/ 1.0 (sqrt (* l V))) (sqrt A)) c0)
(* (sqrt (/ (* (/ -1.0 V) A) (- l))) c0)))))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = c0 / sqrt(((l / A) * V));
double tmp;
if ((l * V) <= -((double) INFINITY)) {
tmp = t_0;
} else if ((l * V) <= -5e-303) {
tmp = (sqrt(-A) / sqrt((-l * V))) * c0;
} else if ((l * V) <= 1e-256) {
tmp = t_0;
} else if ((l * V) <= 5e+291) {
tmp = ((1.0 / sqrt((l * V))) * sqrt(A)) * c0;
} else {
tmp = sqrt((((-1.0 / V) * A) / -l)) * c0;
}
return tmp;
}
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double t_0 = c0 / Math.sqrt(((l / A) * V));
double tmp;
if ((l * V) <= -Double.POSITIVE_INFINITY) {
tmp = t_0;
} else if ((l * V) <= -5e-303) {
tmp = (Math.sqrt(-A) / Math.sqrt((-l * V))) * c0;
} else if ((l * V) <= 1e-256) {
tmp = t_0;
} else if ((l * V) <= 5e+291) {
tmp = ((1.0 / Math.sqrt((l * V))) * Math.sqrt(A)) * c0;
} else {
tmp = Math.sqrt((((-1.0 / V) * A) / -l)) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = c0 / math.sqrt(((l / A) * V)) tmp = 0 if (l * V) <= -math.inf: tmp = t_0 elif (l * V) <= -5e-303: tmp = (math.sqrt(-A) / math.sqrt((-l * V))) * c0 elif (l * V) <= 1e-256: tmp = t_0 elif (l * V) <= 5e+291: tmp = ((1.0 / math.sqrt((l * V))) * math.sqrt(A)) * c0 else: tmp = math.sqrt((((-1.0 / V) * A) / -l)) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = Float64(c0 / sqrt(Float64(Float64(l / A) * V))) tmp = 0.0 if (Float64(l * V) <= Float64(-Inf)) tmp = t_0; elseif (Float64(l * V) <= -5e-303) tmp = Float64(Float64(sqrt(Float64(-A)) / sqrt(Float64(Float64(-l) * V))) * c0); elseif (Float64(l * V) <= 1e-256) tmp = t_0; elseif (Float64(l * V) <= 5e+291) tmp = Float64(Float64(Float64(1.0 / sqrt(Float64(l * V))) * sqrt(A)) * c0); else tmp = Float64(sqrt(Float64(Float64(Float64(-1.0 / V) * A) / Float64(-l))) * c0); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
t_0 = c0 / sqrt(((l / A) * V));
tmp = 0.0;
if ((l * V) <= -Inf)
tmp = t_0;
elseif ((l * V) <= -5e-303)
tmp = (sqrt(-A) / sqrt((-l * V))) * c0;
elseif ((l * V) <= 1e-256)
tmp = t_0;
elseif ((l * V) <= 5e+291)
tmp = ((1.0 / sqrt((l * V))) * sqrt(A)) * c0;
else
tmp = sqrt((((-1.0 / V) * A) / -l)) * c0;
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
code[c0_, A_, V_, l_] := Block[{t$95$0 = N[(c0 / N[Sqrt[N[(N[(l / A), $MachinePrecision] * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(l * V), $MachinePrecision], (-Infinity)], t$95$0, If[LessEqual[N[(l * V), $MachinePrecision], -5e-303], N[(N[(N[Sqrt[(-A)], $MachinePrecision] / N[Sqrt[N[((-l) * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 1e-256], t$95$0, If[LessEqual[N[(l * V), $MachinePrecision], 5e+291], N[(N[(N[(1.0 / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[A], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(-1.0 / V), $MachinePrecision] * A), $MachinePrecision] / (-l)), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]]]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
t_0 := \frac{c0}{\sqrt{\frac{\ell}{A} \cdot V}}\\
\mathbf{if}\;\ell \cdot V \leq -\infty:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\ell \cdot V \leq -5 \cdot 10^{-303}:\\
\;\;\;\;\frac{\sqrt{-A}}{\sqrt{\left(-\ell\right) \cdot V}} \cdot c0\\
\mathbf{elif}\;\ell \cdot V \leq 10^{-256}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\ell \cdot V \leq 5 \cdot 10^{+291}:\\
\;\;\;\;\left(\frac{1}{\sqrt{\ell \cdot V}} \cdot \sqrt{A}\right) \cdot c0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{\frac{-1}{V} \cdot A}{-\ell}} \cdot c0\\
\end{array}
\end{array}
if (*.f64 V l) < -inf.0 or -4.9999999999999998e-303 < (*.f64 V l) < 9.99999999999999977e-257Initial program 40.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6467.8
Applied rewrites67.8%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
lift-/.f64N/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f6467.9
Applied rewrites67.9%
if -inf.0 < (*.f64 V l) < -4.9999999999999998e-303Initial program 82.9%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6474.9
Applied rewrites74.9%
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
div-invN/A
lift-sqrt.f64N/A
lift-/.f64N/A
frac-2negN/A
sqrt-divN/A
frac-timesN/A
metadata-evalN/A
sqrt-prodN/A
*-rgt-identityN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-neg.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
distribute-lft-neg-inN/A
lower-sqrt.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f6499.5
Applied rewrites99.5%
if 9.99999999999999977e-257 < (*.f64 V l) < 5.0000000000000001e291Initial program 82.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6473.4
Applied rewrites73.4%
lift-/.f64N/A
clear-numN/A
frac-2negN/A
associate-/r/N/A
lower-*.f64N/A
metadata-evalN/A
frac-2negN/A
lower-/.f64N/A
lower-neg.f6473.3
Applied rewrites73.3%
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
neg-mul-1N/A
lift-neg.f64N/A
remove-double-negN/A
associate-/r/N/A
associate-*l/N/A
sqrt-divN/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-sqrt.f6499.3
Applied rewrites99.3%
if 5.0000000000000001e291 < (*.f64 V l) Initial program 44.4%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6469.0
Applied rewrites69.0%
lift-/.f64N/A
clear-numN/A
frac-2negN/A
associate-/r/N/A
lower-*.f64N/A
metadata-evalN/A
frac-2negN/A
lower-/.f64N/A
lower-neg.f6469.1
Applied rewrites69.1%
Final simplification91.3%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
:precision binary64
(let* ((t_0 (/ c0 (sqrt (* (/ l A) V)))))
(if (<= (* l V) (- INFINITY))
t_0
(if (<= (* l V) -5e-303)
(* (/ (sqrt (- A)) (sqrt (* (- l) V))) c0)
(if (<= (* l V) 1e-256)
t_0
(if (<= (* l V) 5e+291)
(* (* (sqrt A) (sqrt (/ 1.0 (* l V)))) c0)
(* (sqrt (/ (* (/ -1.0 V) A) (- l))) c0)))))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = c0 / sqrt(((l / A) * V));
double tmp;
if ((l * V) <= -((double) INFINITY)) {
tmp = t_0;
} else if ((l * V) <= -5e-303) {
tmp = (sqrt(-A) / sqrt((-l * V))) * c0;
} else if ((l * V) <= 1e-256) {
tmp = t_0;
} else if ((l * V) <= 5e+291) {
tmp = (sqrt(A) * sqrt((1.0 / (l * V)))) * c0;
} else {
tmp = sqrt((((-1.0 / V) * A) / -l)) * c0;
}
return tmp;
}
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double t_0 = c0 / Math.sqrt(((l / A) * V));
double tmp;
if ((l * V) <= -Double.POSITIVE_INFINITY) {
tmp = t_0;
} else if ((l * V) <= -5e-303) {
tmp = (Math.sqrt(-A) / Math.sqrt((-l * V))) * c0;
} else if ((l * V) <= 1e-256) {
tmp = t_0;
} else if ((l * V) <= 5e+291) {
tmp = (Math.sqrt(A) * Math.sqrt((1.0 / (l * V)))) * c0;
} else {
tmp = Math.sqrt((((-1.0 / V) * A) / -l)) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = c0 / math.sqrt(((l / A) * V)) tmp = 0 if (l * V) <= -math.inf: tmp = t_0 elif (l * V) <= -5e-303: tmp = (math.sqrt(-A) / math.sqrt((-l * V))) * c0 elif (l * V) <= 1e-256: tmp = t_0 elif (l * V) <= 5e+291: tmp = (math.sqrt(A) * math.sqrt((1.0 / (l * V)))) * c0 else: tmp = math.sqrt((((-1.0 / V) * A) / -l)) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = Float64(c0 / sqrt(Float64(Float64(l / A) * V))) tmp = 0.0 if (Float64(l * V) <= Float64(-Inf)) tmp = t_0; elseif (Float64(l * V) <= -5e-303) tmp = Float64(Float64(sqrt(Float64(-A)) / sqrt(Float64(Float64(-l) * V))) * c0); elseif (Float64(l * V) <= 1e-256) tmp = t_0; elseif (Float64(l * V) <= 5e+291) tmp = Float64(Float64(sqrt(A) * sqrt(Float64(1.0 / Float64(l * V)))) * c0); else tmp = Float64(sqrt(Float64(Float64(Float64(-1.0 / V) * A) / Float64(-l))) * c0); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
t_0 = c0 / sqrt(((l / A) * V));
tmp = 0.0;
if ((l * V) <= -Inf)
tmp = t_0;
elseif ((l * V) <= -5e-303)
tmp = (sqrt(-A) / sqrt((-l * V))) * c0;
elseif ((l * V) <= 1e-256)
tmp = t_0;
elseif ((l * V) <= 5e+291)
tmp = (sqrt(A) * sqrt((1.0 / (l * V)))) * c0;
else
tmp = sqrt((((-1.0 / V) * A) / -l)) * c0;
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
code[c0_, A_, V_, l_] := Block[{t$95$0 = N[(c0 / N[Sqrt[N[(N[(l / A), $MachinePrecision] * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(l * V), $MachinePrecision], (-Infinity)], t$95$0, If[LessEqual[N[(l * V), $MachinePrecision], -5e-303], N[(N[(N[Sqrt[(-A)], $MachinePrecision] / N[Sqrt[N[((-l) * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 1e-256], t$95$0, If[LessEqual[N[(l * V), $MachinePrecision], 5e+291], N[(N[(N[Sqrt[A], $MachinePrecision] * N[Sqrt[N[(1.0 / N[(l * V), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(-1.0 / V), $MachinePrecision] * A), $MachinePrecision] / (-l)), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]]]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
t_0 := \frac{c0}{\sqrt{\frac{\ell}{A} \cdot V}}\\
\mathbf{if}\;\ell \cdot V \leq -\infty:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\ell \cdot V \leq -5 \cdot 10^{-303}:\\
\;\;\;\;\frac{\sqrt{-A}}{\sqrt{\left(-\ell\right) \cdot V}} \cdot c0\\
\mathbf{elif}\;\ell \cdot V \leq 10^{-256}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\ell \cdot V \leq 5 \cdot 10^{+291}:\\
\;\;\;\;\left(\sqrt{A} \cdot \sqrt{\frac{1}{\ell \cdot V}}\right) \cdot c0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{\frac{-1}{V} \cdot A}{-\ell}} \cdot c0\\
\end{array}
\end{array}
if (*.f64 V l) < -inf.0 or -4.9999999999999998e-303 < (*.f64 V l) < 9.99999999999999977e-257Initial program 40.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6467.8
Applied rewrites67.8%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
lift-/.f64N/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f6467.9
Applied rewrites67.9%
if -inf.0 < (*.f64 V l) < -4.9999999999999998e-303Initial program 82.9%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6474.9
Applied rewrites74.9%
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
div-invN/A
lift-sqrt.f64N/A
lift-/.f64N/A
frac-2negN/A
sqrt-divN/A
frac-timesN/A
metadata-evalN/A
sqrt-prodN/A
*-rgt-identityN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-neg.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
distribute-lft-neg-inN/A
lower-sqrt.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f6499.5
Applied rewrites99.5%
if 9.99999999999999977e-257 < (*.f64 V l) < 5.0000000000000001e291Initial program 82.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6473.4
Applied rewrites73.4%
lift-/.f64N/A
clear-numN/A
frac-2negN/A
associate-/r/N/A
lower-*.f64N/A
metadata-evalN/A
frac-2negN/A
lower-/.f64N/A
lower-neg.f6473.3
Applied rewrites73.3%
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
neg-mul-1N/A
lift-neg.f64N/A
remove-double-negN/A
associate-/r/N/A
associate-*l/N/A
sqrt-divN/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-sqrt.f6499.3
Applied rewrites99.3%
Taylor expanded in V around 0
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6499.3
Applied rewrites99.3%
if 5.0000000000000001e291 < (*.f64 V l) Initial program 44.4%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6469.0
Applied rewrites69.0%
lift-/.f64N/A
clear-numN/A
frac-2negN/A
associate-/r/N/A
lower-*.f64N/A
metadata-evalN/A
frac-2negN/A
lower-/.f64N/A
lower-neg.f6469.1
Applied rewrites69.1%
Final simplification91.3%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
:precision binary64
(let* ((t_0 (/ c0 (sqrt (* (/ l A) V)))))
(if (<= (* l V) (- INFINITY))
t_0
(if (<= (* l V) -5e-303)
(* (/ (sqrt (- A)) (sqrt (* (- l) V))) c0)
(if (<= (* l V) 5e-292)
t_0
(if (<= (* l V) 5e+291)
(* (/ c0 (sqrt (* l V))) (sqrt A))
(* (sqrt (/ (* (/ -1.0 V) A) (- l))) c0)))))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = c0 / sqrt(((l / A) * V));
double tmp;
if ((l * V) <= -((double) INFINITY)) {
tmp = t_0;
} else if ((l * V) <= -5e-303) {
tmp = (sqrt(-A) / sqrt((-l * V))) * c0;
} else if ((l * V) <= 5e-292) {
tmp = t_0;
} else if ((l * V) <= 5e+291) {
tmp = (c0 / sqrt((l * V))) * sqrt(A);
} else {
tmp = sqrt((((-1.0 / V) * A) / -l)) * c0;
}
return tmp;
}
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double t_0 = c0 / Math.sqrt(((l / A) * V));
double tmp;
if ((l * V) <= -Double.POSITIVE_INFINITY) {
tmp = t_0;
} else if ((l * V) <= -5e-303) {
tmp = (Math.sqrt(-A) / Math.sqrt((-l * V))) * c0;
} else if ((l * V) <= 5e-292) {
tmp = t_0;
} else if ((l * V) <= 5e+291) {
tmp = (c0 / Math.sqrt((l * V))) * Math.sqrt(A);
} else {
tmp = Math.sqrt((((-1.0 / V) * A) / -l)) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = c0 / math.sqrt(((l / A) * V)) tmp = 0 if (l * V) <= -math.inf: tmp = t_0 elif (l * V) <= -5e-303: tmp = (math.sqrt(-A) / math.sqrt((-l * V))) * c0 elif (l * V) <= 5e-292: tmp = t_0 elif (l * V) <= 5e+291: tmp = (c0 / math.sqrt((l * V))) * math.sqrt(A) else: tmp = math.sqrt((((-1.0 / V) * A) / -l)) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = Float64(c0 / sqrt(Float64(Float64(l / A) * V))) tmp = 0.0 if (Float64(l * V) <= Float64(-Inf)) tmp = t_0; elseif (Float64(l * V) <= -5e-303) tmp = Float64(Float64(sqrt(Float64(-A)) / sqrt(Float64(Float64(-l) * V))) * c0); elseif (Float64(l * V) <= 5e-292) tmp = t_0; elseif (Float64(l * V) <= 5e+291) tmp = Float64(Float64(c0 / sqrt(Float64(l * V))) * sqrt(A)); else tmp = Float64(sqrt(Float64(Float64(Float64(-1.0 / V) * A) / Float64(-l))) * c0); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
t_0 = c0 / sqrt(((l / A) * V));
tmp = 0.0;
if ((l * V) <= -Inf)
tmp = t_0;
elseif ((l * V) <= -5e-303)
tmp = (sqrt(-A) / sqrt((-l * V))) * c0;
elseif ((l * V) <= 5e-292)
tmp = t_0;
elseif ((l * V) <= 5e+291)
tmp = (c0 / sqrt((l * V))) * sqrt(A);
else
tmp = sqrt((((-1.0 / V) * A) / -l)) * c0;
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
code[c0_, A_, V_, l_] := Block[{t$95$0 = N[(c0 / N[Sqrt[N[(N[(l / A), $MachinePrecision] * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(l * V), $MachinePrecision], (-Infinity)], t$95$0, If[LessEqual[N[(l * V), $MachinePrecision], -5e-303], N[(N[(N[Sqrt[(-A)], $MachinePrecision] / N[Sqrt[N[((-l) * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 5e-292], t$95$0, If[LessEqual[N[(l * V), $MachinePrecision], 5e+291], N[(N[(c0 / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[A], $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(-1.0 / V), $MachinePrecision] * A), $MachinePrecision] / (-l)), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]]]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
t_0 := \frac{c0}{\sqrt{\frac{\ell}{A} \cdot V}}\\
\mathbf{if}\;\ell \cdot V \leq -\infty:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\ell \cdot V \leq -5 \cdot 10^{-303}:\\
\;\;\;\;\frac{\sqrt{-A}}{\sqrt{\left(-\ell\right) \cdot V}} \cdot c0\\
\mathbf{elif}\;\ell \cdot V \leq 5 \cdot 10^{-292}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\ell \cdot V \leq 5 \cdot 10^{+291}:\\
\;\;\;\;\frac{c0}{\sqrt{\ell \cdot V}} \cdot \sqrt{A}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{\frac{-1}{V} \cdot A}{-\ell}} \cdot c0\\
\end{array}
\end{array}
if (*.f64 V l) < -inf.0 or -4.9999999999999998e-303 < (*.f64 V l) < 4.99999999999999981e-292Initial program 31.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6463.2
Applied rewrites63.2%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
lift-/.f64N/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f6463.3
Applied rewrites63.3%
if -inf.0 < (*.f64 V l) < -4.9999999999999998e-303Initial program 82.9%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6474.9
Applied rewrites74.9%
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
div-invN/A
lift-sqrt.f64N/A
lift-/.f64N/A
frac-2negN/A
sqrt-divN/A
frac-timesN/A
metadata-evalN/A
sqrt-prodN/A
*-rgt-identityN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-neg.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
distribute-lft-neg-inN/A
lower-sqrt.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f6499.5
Applied rewrites99.5%
if 4.99999999999999981e-292 < (*.f64 V l) < 5.0000000000000001e291Initial program 83.2%
lift-*.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
associate-*l/N/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f6498.4
Applied rewrites98.4%
if 5.0000000000000001e291 < (*.f64 V l) Initial program 44.4%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6469.0
Applied rewrites69.0%
lift-/.f64N/A
clear-numN/A
frac-2negN/A
associate-/r/N/A
lower-*.f64N/A
metadata-evalN/A
frac-2negN/A
lower-/.f64N/A
lower-neg.f6469.1
Applied rewrites69.1%
Final simplification91.0%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
:precision binary64
(let* ((t_0 (/ A (* l V))))
(if (<= t_0 4e-295)
(* (sqrt (/ (/ A l) V)) c0)
(if (<= t_0 2e+303) (* (sqrt t_0) c0) (/ c0 (sqrt (* (/ l A) V)))))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = A / (l * V);
double tmp;
if (t_0 <= 4e-295) {
tmp = sqrt(((A / l) / V)) * c0;
} else if (t_0 <= 2e+303) {
tmp = sqrt(t_0) * c0;
} else {
tmp = c0 / sqrt(((l / A) * V));
}
return tmp;
}
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
real(8) :: t_0
real(8) :: tmp
t_0 = a / (l * v)
if (t_0 <= 4d-295) then
tmp = sqrt(((a / l) / v)) * c0
else if (t_0 <= 2d+303) then
tmp = sqrt(t_0) * c0
else
tmp = c0 / sqrt(((l / a) * v))
end if
code = tmp
end function
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double t_0 = A / (l * V);
double tmp;
if (t_0 <= 4e-295) {
tmp = Math.sqrt(((A / l) / V)) * c0;
} else if (t_0 <= 2e+303) {
tmp = Math.sqrt(t_0) * c0;
} else {
tmp = c0 / Math.sqrt(((l / A) * V));
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = A / (l * V) tmp = 0 if t_0 <= 4e-295: tmp = math.sqrt(((A / l) / V)) * c0 elif t_0 <= 2e+303: tmp = math.sqrt(t_0) * c0 else: tmp = c0 / math.sqrt(((l / A) * V)) return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = Float64(A / Float64(l * V)) tmp = 0.0 if (t_0 <= 4e-295) tmp = Float64(sqrt(Float64(Float64(A / l) / V)) * c0); elseif (t_0 <= 2e+303) tmp = Float64(sqrt(t_0) * c0); else tmp = Float64(c0 / sqrt(Float64(Float64(l / A) * V))); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
t_0 = A / (l * V);
tmp = 0.0;
if (t_0 <= 4e-295)
tmp = sqrt(((A / l) / V)) * c0;
elseif (t_0 <= 2e+303)
tmp = sqrt(t_0) * c0;
else
tmp = c0 / sqrt(((l / A) * V));
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
code[c0_, A_, V_, l_] := Block[{t$95$0 = N[(A / N[(l * V), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 4e-295], N[(N[Sqrt[N[(N[(A / l), $MachinePrecision] / V), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[t$95$0, 2e+303], N[(N[Sqrt[t$95$0], $MachinePrecision] * c0), $MachinePrecision], N[(c0 / N[Sqrt[N[(N[(l / A), $MachinePrecision] * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
t_0 := \frac{A}{\ell \cdot V}\\
\mathbf{if}\;t\_0 \leq 4 \cdot 10^{-295}:\\
\;\;\;\;\sqrt{\frac{\frac{A}{\ell}}{V}} \cdot c0\\
\mathbf{elif}\;t\_0 \leq 2 \cdot 10^{+303}:\\
\;\;\;\;\sqrt{t\_0} \cdot c0\\
\mathbf{else}:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{\ell}{A} \cdot V}}\\
\end{array}
\end{array}
if (/.f64 A (*.f64 V l)) < 4.00000000000000024e-295Initial program 36.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6449.3
Applied rewrites49.3%
if 4.00000000000000024e-295 < (/.f64 A (*.f64 V l)) < 2e303Initial program 99.6%
if 2e303 < (/.f64 A (*.f64 V l)) Initial program 32.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6450.9
Applied rewrites50.9%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
lift-/.f64N/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f6453.9
Applied rewrites53.9%
Final simplification79.0%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
:precision binary64
(let* ((t_0 (/ A (* l V))))
(if (<= t_0 4e-295)
(* (sqrt (/ (/ A l) V)) c0)
(if (<= t_0 5e+266) (* (sqrt t_0) c0) (* (sqrt (/ (/ A V) l)) c0)))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = A / (l * V);
double tmp;
if (t_0 <= 4e-295) {
tmp = sqrt(((A / l) / V)) * c0;
} else if (t_0 <= 5e+266) {
tmp = sqrt(t_0) * c0;
} else {
tmp = sqrt(((A / V) / l)) * c0;
}
return tmp;
}
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
real(8) :: t_0
real(8) :: tmp
t_0 = a / (l * v)
if (t_0 <= 4d-295) then
tmp = sqrt(((a / l) / v)) * c0
else if (t_0 <= 5d+266) then
tmp = sqrt(t_0) * c0
else
tmp = sqrt(((a / v) / l)) * c0
end if
code = tmp
end function
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double t_0 = A / (l * V);
double tmp;
if (t_0 <= 4e-295) {
tmp = Math.sqrt(((A / l) / V)) * c0;
} else if (t_0 <= 5e+266) {
tmp = Math.sqrt(t_0) * c0;
} else {
tmp = Math.sqrt(((A / V) / l)) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = A / (l * V) tmp = 0 if t_0 <= 4e-295: tmp = math.sqrt(((A / l) / V)) * c0 elif t_0 <= 5e+266: tmp = math.sqrt(t_0) * c0 else: tmp = math.sqrt(((A / V) / l)) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = Float64(A / Float64(l * V)) tmp = 0.0 if (t_0 <= 4e-295) tmp = Float64(sqrt(Float64(Float64(A / l) / V)) * c0); elseif (t_0 <= 5e+266) tmp = Float64(sqrt(t_0) * c0); else tmp = Float64(sqrt(Float64(Float64(A / V) / l)) * c0); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
t_0 = A / (l * V);
tmp = 0.0;
if (t_0 <= 4e-295)
tmp = sqrt(((A / l) / V)) * c0;
elseif (t_0 <= 5e+266)
tmp = sqrt(t_0) * c0;
else
tmp = sqrt(((A / V) / l)) * c0;
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
code[c0_, A_, V_, l_] := Block[{t$95$0 = N[(A / N[(l * V), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 4e-295], N[(N[Sqrt[N[(N[(A / l), $MachinePrecision] / V), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[t$95$0, 5e+266], N[(N[Sqrt[t$95$0], $MachinePrecision] * c0), $MachinePrecision], N[(N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
t_0 := \frac{A}{\ell \cdot V}\\
\mathbf{if}\;t\_0 \leq 4 \cdot 10^{-295}:\\
\;\;\;\;\sqrt{\frac{\frac{A}{\ell}}{V}} \cdot c0\\
\mathbf{elif}\;t\_0 \leq 5 \cdot 10^{+266}:\\
\;\;\;\;\sqrt{t\_0} \cdot c0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{\frac{A}{V}}{\ell}} \cdot c0\\
\end{array}
\end{array}
if (/.f64 A (*.f64 V l)) < 4.00000000000000024e-295Initial program 36.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6449.3
Applied rewrites49.3%
if 4.00000000000000024e-295 < (/.f64 A (*.f64 V l)) < 4.9999999999999999e266Initial program 99.6%
if 4.9999999999999999e266 < (/.f64 A (*.f64 V l)) Initial program 42.5%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6454.8
Applied rewrites54.8%
Final simplification77.8%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function. (FPCore (c0 A V l) :precision binary64 (let* ((t_0 (/ A (* l V))) (t_1 (* (sqrt (/ (/ A V) l)) c0))) (if (<= t_0 0.0) t_1 (if (<= t_0 5e+266) (* (sqrt t_0) c0) t_1))))
assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = A / (l * V);
double t_1 = sqrt(((A / V) / l)) * c0;
double tmp;
if (t_0 <= 0.0) {
tmp = t_1;
} else if (t_0 <= 5e+266) {
tmp = sqrt(t_0) * c0;
} else {
tmp = t_1;
}
return tmp;
}
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = a / (l * v)
t_1 = sqrt(((a / v) / l)) * c0
if (t_0 <= 0.0d0) then
tmp = t_1
else if (t_0 <= 5d+266) then
tmp = sqrt(t_0) * c0
else
tmp = t_1
end if
code = tmp
end function
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double t_0 = A / (l * V);
double t_1 = Math.sqrt(((A / V) / l)) * c0;
double tmp;
if (t_0 <= 0.0) {
tmp = t_1;
} else if (t_0 <= 5e+266) {
tmp = Math.sqrt(t_0) * c0;
} else {
tmp = t_1;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = A / (l * V) t_1 = math.sqrt(((A / V) / l)) * c0 tmp = 0 if t_0 <= 0.0: tmp = t_1 elif t_0 <= 5e+266: tmp = math.sqrt(t_0) * c0 else: tmp = t_1 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = Float64(A / Float64(l * V)) t_1 = Float64(sqrt(Float64(Float64(A / V) / l)) * c0) tmp = 0.0 if (t_0 <= 0.0) tmp = t_1; elseif (t_0 <= 5e+266) tmp = Float64(sqrt(t_0) * c0); else tmp = t_1; end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
t_0 = A / (l * V);
t_1 = sqrt(((A / V) / l)) * c0;
tmp = 0.0;
if (t_0 <= 0.0)
tmp = t_1;
elseif (t_0 <= 5e+266)
tmp = sqrt(t_0) * c0;
else
tmp = t_1;
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
code[c0_, A_, V_, l_] := Block[{t$95$0 = N[(A / N[(l * V), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]}, If[LessEqual[t$95$0, 0.0], t$95$1, If[LessEqual[t$95$0, 5e+266], N[(N[Sqrt[t$95$0], $MachinePrecision] * c0), $MachinePrecision], t$95$1]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
t_0 := \frac{A}{\ell \cdot V}\\
t_1 := \sqrt{\frac{\frac{A}{V}}{\ell}} \cdot c0\\
\mathbf{if}\;t\_0 \leq 0:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_0 \leq 5 \cdot 10^{+266}:\\
\;\;\;\;\sqrt{t\_0} \cdot c0\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if (/.f64 A (*.f64 V l)) < 0.0 or 4.9999999999999999e266 < (/.f64 A (*.f64 V l)) Initial program 36.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6450.6
Applied rewrites50.6%
if 0.0 < (/.f64 A (*.f64 V l)) < 4.9999999999999999e266Initial program 98.8%
Final simplification78.1%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
:precision binary64
(if (<= (* l V) 5e-292)
(/ c0 (sqrt (* (/ l A) V)))
(if (<= (* l V) 5e+291)
(* (/ c0 (sqrt (* l V))) (sqrt A))
(* (sqrt (/ (* (/ -1.0 V) A) (- l))) c0))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double tmp;
if ((l * V) <= 5e-292) {
tmp = c0 / sqrt(((l / A) * V));
} else if ((l * V) <= 5e+291) {
tmp = (c0 / sqrt((l * V))) * sqrt(A);
} else {
tmp = sqrt((((-1.0 / V) * A) / -l)) * c0;
}
return tmp;
}
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
real(8) :: tmp
if ((l * v) <= 5d-292) then
tmp = c0 / sqrt(((l / a) * v))
else if ((l * v) <= 5d+291) then
tmp = (c0 / sqrt((l * v))) * sqrt(a)
else
tmp = sqrt(((((-1.0d0) / v) * a) / -l)) * c0
end if
code = tmp
end function
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double tmp;
if ((l * V) <= 5e-292) {
tmp = c0 / Math.sqrt(((l / A) * V));
} else if ((l * V) <= 5e+291) {
tmp = (c0 / Math.sqrt((l * V))) * Math.sqrt(A);
} else {
tmp = Math.sqrt((((-1.0 / V) * A) / -l)) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): tmp = 0 if (l * V) <= 5e-292: tmp = c0 / math.sqrt(((l / A) * V)) elif (l * V) <= 5e+291: tmp = (c0 / math.sqrt((l * V))) * math.sqrt(A) else: tmp = math.sqrt((((-1.0 / V) * A) / -l)) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) tmp = 0.0 if (Float64(l * V) <= 5e-292) tmp = Float64(c0 / sqrt(Float64(Float64(l / A) * V))); elseif (Float64(l * V) <= 5e+291) tmp = Float64(Float64(c0 / sqrt(Float64(l * V))) * sqrt(A)); else tmp = Float64(sqrt(Float64(Float64(Float64(-1.0 / V) * A) / Float64(-l))) * c0); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
tmp = 0.0;
if ((l * V) <= 5e-292)
tmp = c0 / sqrt(((l / A) * V));
elseif ((l * V) <= 5e+291)
tmp = (c0 / sqrt((l * V))) * sqrt(A);
else
tmp = sqrt((((-1.0 / V) * A) / -l)) * c0;
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function. code[c0_, A_, V_, l_] := If[LessEqual[N[(l * V), $MachinePrecision], 5e-292], N[(c0 / N[Sqrt[N[(N[(l / A), $MachinePrecision] * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 5e+291], N[(N[(c0 / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[A], $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(-1.0 / V), $MachinePrecision] * A), $MachinePrecision] / (-l)), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \cdot V \leq 5 \cdot 10^{-292}:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{\ell}{A} \cdot V}}\\
\mathbf{elif}\;\ell \cdot V \leq 5 \cdot 10^{+291}:\\
\;\;\;\;\frac{c0}{\sqrt{\ell \cdot V}} \cdot \sqrt{A}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{\frac{-1}{V} \cdot A}{-\ell}} \cdot c0\\
\end{array}
\end{array}
if (*.f64 V l) < 4.99999999999999981e-292Initial program 67.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6471.4
Applied rewrites71.4%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
lift-/.f64N/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f6471.3
Applied rewrites71.3%
if 4.99999999999999981e-292 < (*.f64 V l) < 5.0000000000000001e291Initial program 83.2%
lift-*.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
associate-*l/N/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f6498.4
Applied rewrites98.4%
if 5.0000000000000001e291 < (*.f64 V l) Initial program 44.4%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6469.0
Applied rewrites69.0%
lift-/.f64N/A
clear-numN/A
frac-2negN/A
associate-/r/N/A
lower-*.f64N/A
metadata-evalN/A
frac-2negN/A
lower-/.f64N/A
lower-neg.f6469.1
Applied rewrites69.1%
Final simplification81.7%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
:precision binary64
(if (<= (* l V) 5e-292)
(/ c0 (sqrt (* (/ l A) V)))
(if (<= (* l V) 5e+291)
(* (/ c0 (sqrt (* l V))) (sqrt A))
(* (sqrt (/ (/ A V) l)) c0))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double tmp;
if ((l * V) <= 5e-292) {
tmp = c0 / sqrt(((l / A) * V));
} else if ((l * V) <= 5e+291) {
tmp = (c0 / sqrt((l * V))) * sqrt(A);
} else {
tmp = sqrt(((A / V) / l)) * c0;
}
return tmp;
}
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
real(8) :: tmp
if ((l * v) <= 5d-292) then
tmp = c0 / sqrt(((l / a) * v))
else if ((l * v) <= 5d+291) then
tmp = (c0 / sqrt((l * v))) * sqrt(a)
else
tmp = sqrt(((a / v) / l)) * c0
end if
code = tmp
end function
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double tmp;
if ((l * V) <= 5e-292) {
tmp = c0 / Math.sqrt(((l / A) * V));
} else if ((l * V) <= 5e+291) {
tmp = (c0 / Math.sqrt((l * V))) * Math.sqrt(A);
} else {
tmp = Math.sqrt(((A / V) / l)) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): tmp = 0 if (l * V) <= 5e-292: tmp = c0 / math.sqrt(((l / A) * V)) elif (l * V) <= 5e+291: tmp = (c0 / math.sqrt((l * V))) * math.sqrt(A) else: tmp = math.sqrt(((A / V) / l)) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) tmp = 0.0 if (Float64(l * V) <= 5e-292) tmp = Float64(c0 / sqrt(Float64(Float64(l / A) * V))); elseif (Float64(l * V) <= 5e+291) tmp = Float64(Float64(c0 / sqrt(Float64(l * V))) * sqrt(A)); else tmp = Float64(sqrt(Float64(Float64(A / V) / l)) * c0); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
tmp = 0.0;
if ((l * V) <= 5e-292)
tmp = c0 / sqrt(((l / A) * V));
elseif ((l * V) <= 5e+291)
tmp = (c0 / sqrt((l * V))) * sqrt(A);
else
tmp = sqrt(((A / V) / l)) * c0;
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function. code[c0_, A_, V_, l_] := If[LessEqual[N[(l * V), $MachinePrecision], 5e-292], N[(c0 / N[Sqrt[N[(N[(l / A), $MachinePrecision] * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 5e+291], N[(N[(c0 / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[A], $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \cdot V \leq 5 \cdot 10^{-292}:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{\ell}{A} \cdot V}}\\
\mathbf{elif}\;\ell \cdot V \leq 5 \cdot 10^{+291}:\\
\;\;\;\;\frac{c0}{\sqrt{\ell \cdot V}} \cdot \sqrt{A}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{\frac{A}{V}}{\ell}} \cdot c0\\
\end{array}
\end{array}
if (*.f64 V l) < 4.99999999999999981e-292Initial program 67.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6471.4
Applied rewrites71.4%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
lift-/.f64N/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f6471.3
Applied rewrites71.3%
if 4.99999999999999981e-292 < (*.f64 V l) < 5.0000000000000001e291Initial program 83.2%
lift-*.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
associate-*l/N/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f6498.4
Applied rewrites98.4%
if 5.0000000000000001e291 < (*.f64 V l) Initial program 44.4%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6469.0
Applied rewrites69.0%
Final simplification81.7%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function. (FPCore (c0 A V l) :precision binary64 (* (sqrt (/ A (* l V))) c0))
assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
return sqrt((A / (l * V))) * c0;
}
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
code = sqrt((a / (l * v))) * c0
end function
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
return Math.sqrt((A / (l * V))) * c0;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): return math.sqrt((A / (l * V))) * c0
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) return Float64(sqrt(Float64(A / Float64(l * V))) * c0) end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp = code(c0, A, V, l)
tmp = sqrt((A / (l * V))) * c0;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function. code[c0_, A_, V_, l_] := N[(N[Sqrt[N[(A / N[(l * V), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\sqrt{\frac{A}{\ell \cdot V}} \cdot c0
\end{array}
Initial program 71.9%
Final simplification71.9%
herbie shell --seed 2024268
(FPCore (c0 A V l)
:name "Henrywood and Agarwal, Equation (3)"
:precision binary64
(* c0 (sqrt (/ A (* V l)))))