
(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
(if (<= (* l V) -2e+286)
(/ c0 (* (sqrt (/ V A)) (sqrt l)))
(if (<= (* l V) -2e-312)
(* (/ (sqrt (- A)) (sqrt (* l (- V)))) c0)
(if (<= (* l V) 0.0)
(/ c0 (sqrt (* (/ V A) l)))
(if (<= (* l V) 2e+293)
(* (/ (sqrt A) (sqrt (* 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) <= -2e+286) {
tmp = c0 / (sqrt((V / A)) * sqrt(l));
} else if ((l * V) <= -2e-312) {
tmp = (sqrt(-A) / sqrt((l * -V))) * c0;
} else if ((l * V) <= 0.0) {
tmp = c0 / sqrt(((V / A) * l));
} else if ((l * V) <= 2e+293) {
tmp = (sqrt(A) / sqrt((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) <= (-2d+286)) then
tmp = c0 / (sqrt((v / a)) * sqrt(l))
else if ((l * v) <= (-2d-312)) then
tmp = (sqrt(-a) / sqrt((l * -v))) * c0
else if ((l * v) <= 0.0d0) then
tmp = c0 / sqrt(((v / a) * l))
else if ((l * v) <= 2d+293) then
tmp = (sqrt(a) / sqrt((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) <= -2e+286) {
tmp = c0 / (Math.sqrt((V / A)) * Math.sqrt(l));
} else if ((l * V) <= -2e-312) {
tmp = (Math.sqrt(-A) / Math.sqrt((l * -V))) * c0;
} else if ((l * V) <= 0.0) {
tmp = c0 / Math.sqrt(((V / A) * l));
} else if ((l * V) <= 2e+293) {
tmp = (Math.sqrt(A) / Math.sqrt((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) <= -2e+286: tmp = c0 / (math.sqrt((V / A)) * math.sqrt(l)) elif (l * V) <= -2e-312: tmp = (math.sqrt(-A) / math.sqrt((l * -V))) * c0 elif (l * V) <= 0.0: tmp = c0 / math.sqrt(((V / A) * l)) elif (l * V) <= 2e+293: tmp = (math.sqrt(A) / math.sqrt((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) <= -2e+286) tmp = Float64(c0 / Float64(sqrt(Float64(V / A)) * sqrt(l))); elseif (Float64(l * V) <= -2e-312) tmp = Float64(Float64(sqrt(Float64(-A)) / sqrt(Float64(l * Float64(-V)))) * c0); elseif (Float64(l * V) <= 0.0) tmp = Float64(c0 / sqrt(Float64(Float64(V / A) * l))); elseif (Float64(l * V) <= 2e+293) tmp = Float64(Float64(sqrt(A) / sqrt(Float64(l * V))) * c0); else tmp = Float64(sqrt(Float64(Float64(1.0 / Float64(V / A)) / 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) <= -2e+286)
tmp = c0 / (sqrt((V / A)) * sqrt(l));
elseif ((l * V) <= -2e-312)
tmp = (sqrt(-A) / sqrt((l * -V))) * c0;
elseif ((l * V) <= 0.0)
tmp = c0 / sqrt(((V / A) * l));
elseif ((l * V) <= 2e+293)
tmp = (sqrt(A) / sqrt((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], -2e+286], N[(c0 / N[(N[Sqrt[N[(V / A), $MachinePrecision]], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], -2e-312], N[(N[(N[Sqrt[(-A)], $MachinePrecision] / N[Sqrt[N[(l * (-V)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 0.0], N[(c0 / N[Sqrt[N[(N[(V / A), $MachinePrecision] * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 2e+293], N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], N[(N[Sqrt[N[(N[(1.0 / N[(V / A), $MachinePrecision]), $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 -2 \cdot 10^{+286}:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{V}{A}} \cdot \sqrt{\ell}}\\
\mathbf{elif}\;\ell \cdot V \leq -2 \cdot 10^{-312}:\\
\;\;\;\;\frac{\sqrt{-A}}{\sqrt{\ell \cdot \left(-V\right)}} \cdot c0\\
\mathbf{elif}\;\ell \cdot V \leq 0:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{V}{A} \cdot \ell}}\\
\mathbf{elif}\;\ell \cdot V \leq 2 \cdot 10^{+293}:\\
\;\;\;\;\frac{\sqrt{A}}{\sqrt{\ell \cdot V}} \cdot c0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{\frac{1}{\frac{V}{A}}}{\ell}} \cdot c0\\
\end{array}
\end{array}
if (*.f64 V l) < -2.00000000000000007e286Initial program 38.6%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6479.5
Applied rewrites79.5%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
associate-*r/N/A
associate-*l/N/A
lift-/.f64N/A
clear-numN/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
frac-timesN/A
lift-sqrt.f64N/A
sqrt-prodN/A
*-commutativeN/A
associate-/r/N/A
lift-/.f64N/A
metadata-evalN/A
*-rgt-identityN/A
Applied rewrites79.4%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-*r/N/A
lift-/.f64N/A
sqrt-unprodN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
*-commutativeN/A
lower-*.f6436.1
Applied rewrites36.1%
if -2.00000000000000007e286 < (*.f64 V l) < -2.0000000000019e-312Initial program 87.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6479.6
Applied rewrites79.6%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-*.f64N/A
frac-2negN/A
sqrt-divN/A
neg-mul-1N/A
*-commutativeN/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lift-neg.f64N/A
sqrt-divN/A
frac-timesN/A
lift-/.f64N/A
associate-/r/N/A
lift-/.f64N/A
frac-2negN/A
sqrt-divN/A
pow1/2N/A
Applied rewrites99.2%
if -2.0000000000019e-312 < (*.f64 V l) < -0.0Initial program 53.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6472.2
Applied rewrites72.2%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
associate-*r/N/A
associate-*l/N/A
lift-/.f64N/A
clear-numN/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
frac-timesN/A
lift-sqrt.f64N/A
sqrt-prodN/A
*-commutativeN/A
associate-/r/N/A
lift-/.f64N/A
metadata-evalN/A
*-rgt-identityN/A
Applied rewrites74.2%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-*r/N/A
lift-/.f64N/A
*-commutativeN/A
lower-*.f6474.2
Applied rewrites74.2%
if -0.0 < (*.f64 V l) < 1.9999999999999998e293Initial program 86.7%
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6499.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6499.1
Applied rewrites99.1%
if 1.9999999999999998e293 < (*.f64 V l) Initial program 44.6%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6473.6
Applied rewrites73.6%
lift-/.f64N/A
clear-numN/A
metadata-evalN/A
lower-/.f64N/A
metadata-evalN/A
lower-/.f6473.7
Applied rewrites73.7%
Final simplification87.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 (pow (- A) 0.25)))
(if (<= A -5e-310)
(/ c0 (* (/ (sqrt l) t_0) (/ (sqrt (- V)) t_0)))
(* (/ (sqrt A) (sqrt (* l V))) c0))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = pow(-A, 0.25);
double tmp;
if (A <= -5e-310) {
tmp = c0 / ((sqrt(l) / t_0) * (sqrt(-V) / t_0));
} else {
tmp = (sqrt(A) / sqrt((l * V))) * 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 ** 0.25d0
if (a <= (-5d-310)) then
tmp = c0 / ((sqrt(l) / t_0) * (sqrt(-v) / t_0))
else
tmp = (sqrt(a) / sqrt((l * v))) * 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.pow(-A, 0.25);
double tmp;
if (A <= -5e-310) {
tmp = c0 / ((Math.sqrt(l) / t_0) * (Math.sqrt(-V) / t_0));
} else {
tmp = (Math.sqrt(A) / Math.sqrt((l * V))) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = math.pow(-A, 0.25) tmp = 0 if A <= -5e-310: tmp = c0 / ((math.sqrt(l) / t_0) * (math.sqrt(-V) / t_0)) else: tmp = (math.sqrt(A) / math.sqrt((l * V))) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = Float64(-A) ^ 0.25 tmp = 0.0 if (A <= -5e-310) tmp = Float64(c0 / Float64(Float64(sqrt(l) / t_0) * Float64(sqrt(Float64(-V)) / t_0))); else tmp = Float64(Float64(sqrt(A) / sqrt(Float64(l * V))) * 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 ^ 0.25;
tmp = 0.0;
if (A <= -5e-310)
tmp = c0 / ((sqrt(l) / t_0) * (sqrt(-V) / t_0));
else
tmp = (sqrt(A) / sqrt((l * V))) * 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[Power[(-A), 0.25], $MachinePrecision]}, If[LessEqual[A, -5e-310], N[(c0 / N[(N[(N[Sqrt[l], $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[Sqrt[(-V)], $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
t_0 := {\left(-A\right)}^{0.25}\\
\mathbf{if}\;A \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\frac{c0}{\frac{\sqrt{\ell}}{t\_0} \cdot \frac{\sqrt{-V}}{t\_0}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{A}}{\sqrt{\ell \cdot V}} \cdot c0\\
\end{array}
\end{array}
if A < -4.999999999999985e-310Initial program 72.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6478.6
Applied rewrites78.6%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
associate-*r/N/A
associate-*l/N/A
lift-/.f64N/A
clear-numN/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
frac-timesN/A
lift-sqrt.f64N/A
sqrt-prodN/A
*-commutativeN/A
associate-/r/N/A
lift-/.f64N/A
metadata-evalN/A
*-rgt-identityN/A
Applied rewrites77.4%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
associate-*l/N/A
sqrt-divN/A
distribute-lft-neg-inN/A
distribute-rgt-neg-outN/A
lift-neg.f64N/A
*-commutativeN/A
sqrt-prodN/A
pow1/2N/A
lift-sqrt.f64N/A
pow1/2N/A
sqr-powN/A
times-fracN/A
lower-*.f64N/A
Applied rewrites42.9%
if -4.999999999999985e-310 < A Initial program 76.7%
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6485.6
lift-*.f64N/A
*-commutativeN/A
lower-*.f6485.6
Applied rewrites85.6%
Final simplification63.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 (* l V))) c0)))
(if (<= t_0 4e-249)
(* (sqrt (/ (/ A l) V)) c0)
(if (<= t_0 2e+297) t_0 (/ 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 = sqrt((A / (l * V))) * c0;
double tmp;
if (t_0 <= 4e-249) {
tmp = sqrt(((A / l) / V)) * c0;
} else if (t_0 <= 2e+297) {
tmp = t_0;
} 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 = sqrt((a / (l * v))) * c0
if (t_0 <= 4d-249) then
tmp = sqrt(((a / l) / v)) * c0
else if (t_0 <= 2d+297) then
tmp = t_0
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 = Math.sqrt((A / (l * V))) * c0;
double tmp;
if (t_0 <= 4e-249) {
tmp = Math.sqrt(((A / l) / V)) * c0;
} else if (t_0 <= 2e+297) {
tmp = t_0;
} 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 = math.sqrt((A / (l * V))) * c0 tmp = 0 if t_0 <= 4e-249: tmp = math.sqrt(((A / l) / V)) * c0 elif t_0 <= 2e+297: tmp = t_0 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(sqrt(Float64(A / Float64(l * V))) * c0) tmp = 0.0 if (t_0 <= 4e-249) tmp = Float64(sqrt(Float64(Float64(A / l) / V)) * c0); elseif (t_0 <= 2e+297) tmp = t_0; 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 = sqrt((A / (l * V))) * c0;
tmp = 0.0;
if (t_0 <= 4e-249)
tmp = sqrt(((A / l) / V)) * c0;
elseif (t_0 <= 2e+297)
tmp = t_0;
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[(N[Sqrt[N[(A / N[(l * V), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]}, If[LessEqual[t$95$0, 4e-249], N[(N[Sqrt[N[(N[(A / l), $MachinePrecision] / V), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[t$95$0, 2e+297], t$95$0, 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 := \sqrt{\frac{A}{\ell \cdot V}} \cdot c0\\
\mathbf{if}\;t\_0 \leq 4 \cdot 10^{-249}:\\
\;\;\;\;\sqrt{\frac{\frac{A}{\ell}}{V}} \cdot c0\\
\mathbf{elif}\;t\_0 \leq 2 \cdot 10^{+297}:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{\ell}{A} \cdot V}}\\
\end{array}
\end{array}
if (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) < 4.00000000000000022e-249Initial program 68.2%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6480.0
Applied rewrites80.0%
if 4.00000000000000022e-249 < (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) < 2e297Initial program 99.5%
if 2e297 < (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) Initial program 56.5%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6465.9
Applied rewrites65.9%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
associate-*r/N/A
associate-*l/N/A
lift-/.f64N/A
clear-numN/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
frac-timesN/A
lift-sqrt.f64N/A
sqrt-prodN/A
*-commutativeN/A
associate-/r/N/A
lift-/.f64N/A
metadata-evalN/A
*-rgt-identityN/A
Applied rewrites67.8%
Final simplification83.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 (* l V))) c0)) (t_1 (* (sqrt (/ (/ A V) l)) c0))) (if (<= t_0 0.0) t_1 (if (<= t_0 1e+264) t_0 t_1))))
assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = sqrt((A / (l * V))) * c0;
double t_1 = sqrt(((A / V) / l)) * c0;
double tmp;
if (t_0 <= 0.0) {
tmp = t_1;
} else if (t_0 <= 1e+264) {
tmp = t_0;
} 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 = sqrt((a / (l * v))) * c0
t_1 = sqrt(((a / v) / l)) * c0
if (t_0 <= 0.0d0) then
tmp = t_1
else if (t_0 <= 1d+264) then
tmp = t_0
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 = Math.sqrt((A / (l * V))) * c0;
double t_1 = Math.sqrt(((A / V) / l)) * c0;
double tmp;
if (t_0 <= 0.0) {
tmp = t_1;
} else if (t_0 <= 1e+264) {
tmp = t_0;
} else {
tmp = t_1;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = math.sqrt((A / (l * V))) * c0 t_1 = math.sqrt(((A / V) / l)) * c0 tmp = 0 if t_0 <= 0.0: tmp = t_1 elif t_0 <= 1e+264: tmp = t_0 else: tmp = t_1 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = Float64(sqrt(Float64(A / Float64(l * V))) * c0) t_1 = Float64(sqrt(Float64(Float64(A / V) / l)) * c0) tmp = 0.0 if (t_0 <= 0.0) tmp = t_1; elseif (t_0 <= 1e+264) tmp = t_0; 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 = sqrt((A / (l * V))) * c0;
t_1 = sqrt(((A / V) / l)) * c0;
tmp = 0.0;
if (t_0 <= 0.0)
tmp = t_1;
elseif (t_0 <= 1e+264)
tmp = t_0;
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[(N[Sqrt[N[(A / N[(l * V), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * c0), $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, 1e+264], t$95$0, t$95$1]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{A}{\ell \cdot V}} \cdot c0\\
t_1 := \sqrt{\frac{\frac{A}{V}}{\ell}} \cdot c0\\
\mathbf{if}\;t\_0 \leq 0:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_0 \leq 10^{+264}:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) < 0.0 or 1.00000000000000004e264 < (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) Initial program 65.5%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6472.8
Applied rewrites72.8%
if 0.0 < (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) < 1.00000000000000004e264Initial program 99.4%
Final simplification79.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 (/ c0 (sqrt (* (/ V A) l)))))
(if (<= (* l V) -2e+286)
(/ c0 (* (sqrt (/ V A)) (sqrt l)))
(if (<= (* l V) -2e-312)
(* (/ (sqrt (- A)) (sqrt (* l (- V)))) c0)
(if (<= (* l V) 0.0)
t_0
(if (<= (* l V) 2e+293) (* (/ (sqrt A) (sqrt (* l V))) c0) t_0))))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = c0 / sqrt(((V / A) * l));
double tmp;
if ((l * V) <= -2e+286) {
tmp = c0 / (sqrt((V / A)) * sqrt(l));
} else if ((l * V) <= -2e-312) {
tmp = (sqrt(-A) / sqrt((l * -V))) * c0;
} else if ((l * V) <= 0.0) {
tmp = t_0;
} else if ((l * V) <= 2e+293) {
tmp = (sqrt(A) / sqrt((l * V))) * c0;
} else {
tmp = t_0;
}
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 = c0 / sqrt(((v / a) * l))
if ((l * v) <= (-2d+286)) then
tmp = c0 / (sqrt((v / a)) * sqrt(l))
else if ((l * v) <= (-2d-312)) then
tmp = (sqrt(-a) / sqrt((l * -v))) * c0
else if ((l * v) <= 0.0d0) then
tmp = t_0
else if ((l * v) <= 2d+293) then
tmp = (sqrt(a) / sqrt((l * v))) * c0
else
tmp = t_0
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 = c0 / Math.sqrt(((V / A) * l));
double tmp;
if ((l * V) <= -2e+286) {
tmp = c0 / (Math.sqrt((V / A)) * Math.sqrt(l));
} else if ((l * V) <= -2e-312) {
tmp = (Math.sqrt(-A) / Math.sqrt((l * -V))) * c0;
} else if ((l * V) <= 0.0) {
tmp = t_0;
} else if ((l * V) <= 2e+293) {
tmp = (Math.sqrt(A) / Math.sqrt((l * V))) * c0;
} else {
tmp = t_0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = c0 / math.sqrt(((V / A) * l)) tmp = 0 if (l * V) <= -2e+286: tmp = c0 / (math.sqrt((V / A)) * math.sqrt(l)) elif (l * V) <= -2e-312: tmp = (math.sqrt(-A) / math.sqrt((l * -V))) * c0 elif (l * V) <= 0.0: tmp = t_0 elif (l * V) <= 2e+293: tmp = (math.sqrt(A) / math.sqrt((l * V))) * c0 else: tmp = t_0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = Float64(c0 / sqrt(Float64(Float64(V / A) * l))) tmp = 0.0 if (Float64(l * V) <= -2e+286) tmp = Float64(c0 / Float64(sqrt(Float64(V / A)) * sqrt(l))); elseif (Float64(l * V) <= -2e-312) tmp = Float64(Float64(sqrt(Float64(-A)) / sqrt(Float64(l * Float64(-V)))) * c0); elseif (Float64(l * V) <= 0.0) tmp = t_0; elseif (Float64(l * V) <= 2e+293) tmp = Float64(Float64(sqrt(A) / sqrt(Float64(l * V))) * c0); else tmp = t_0; 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(((V / A) * l));
tmp = 0.0;
if ((l * V) <= -2e+286)
tmp = c0 / (sqrt((V / A)) * sqrt(l));
elseif ((l * V) <= -2e-312)
tmp = (sqrt(-A) / sqrt((l * -V))) * c0;
elseif ((l * V) <= 0.0)
tmp = t_0;
elseif ((l * V) <= 2e+293)
tmp = (sqrt(A) / sqrt((l * V))) * c0;
else
tmp = t_0;
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[(V / A), $MachinePrecision] * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(l * V), $MachinePrecision], -2e+286], N[(c0 / N[(N[Sqrt[N[(V / A), $MachinePrecision]], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], -2e-312], N[(N[(N[Sqrt[(-A)], $MachinePrecision] / N[Sqrt[N[(l * (-V)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 0.0], t$95$0, If[LessEqual[N[(l * V), $MachinePrecision], 2e+293], N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], t$95$0]]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
t_0 := \frac{c0}{\sqrt{\frac{V}{A} \cdot \ell}}\\
\mathbf{if}\;\ell \cdot V \leq -2 \cdot 10^{+286}:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{V}{A}} \cdot \sqrt{\ell}}\\
\mathbf{elif}\;\ell \cdot V \leq -2 \cdot 10^{-312}:\\
\;\;\;\;\frac{\sqrt{-A}}{\sqrt{\ell \cdot \left(-V\right)}} \cdot c0\\
\mathbf{elif}\;\ell \cdot V \leq 0:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\ell \cdot V \leq 2 \cdot 10^{+293}:\\
\;\;\;\;\frac{\sqrt{A}}{\sqrt{\ell \cdot V}} \cdot c0\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if (*.f64 V l) < -2.00000000000000007e286Initial program 38.6%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6479.5
Applied rewrites79.5%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
associate-*r/N/A
associate-*l/N/A
lift-/.f64N/A
clear-numN/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
frac-timesN/A
lift-sqrt.f64N/A
sqrt-prodN/A
*-commutativeN/A
associate-/r/N/A
lift-/.f64N/A
metadata-evalN/A
*-rgt-identityN/A
Applied rewrites79.4%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-*r/N/A
lift-/.f64N/A
sqrt-unprodN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
*-commutativeN/A
lower-*.f6436.1
Applied rewrites36.1%
if -2.00000000000000007e286 < (*.f64 V l) < -2.0000000000019e-312Initial program 87.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6479.6
Applied rewrites79.6%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-*.f64N/A
frac-2negN/A
sqrt-divN/A
neg-mul-1N/A
*-commutativeN/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lift-neg.f64N/A
sqrt-divN/A
frac-timesN/A
lift-/.f64N/A
associate-/r/N/A
lift-/.f64N/A
frac-2negN/A
sqrt-divN/A
pow1/2N/A
Applied rewrites99.2%
if -2.0000000000019e-312 < (*.f64 V l) < -0.0 or 1.9999999999999998e293 < (*.f64 V l) Initial program 50.2%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6472.8
Applied rewrites72.8%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
associate-*r/N/A
associate-*l/N/A
lift-/.f64N/A
clear-numN/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
frac-timesN/A
lift-sqrt.f64N/A
sqrt-prodN/A
*-commutativeN/A
associate-/r/N/A
lift-/.f64N/A
metadata-evalN/A
*-rgt-identityN/A
Applied rewrites74.0%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-*r/N/A
lift-/.f64N/A
*-commutativeN/A
lower-*.f6474.0
Applied rewrites74.0%
if -0.0 < (*.f64 V l) < 1.9999999999999998e293Initial program 86.7%
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6499.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6499.1
Applied rewrites99.1%
Final simplification87.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 (/ c0 (sqrt (* (/ V A) l)))))
(if (<= (* l V) (- INFINITY))
(* (/ (sqrt (/ A V)) (sqrt l)) c0)
(if (<= (* l V) -2e-312)
(* (/ (sqrt (- A)) (sqrt (* l (- V)))) c0)
(if (<= (* l V) 0.0)
t_0
(if (<= (* l V) 2e+293) (* (/ (sqrt A) (sqrt (* l V))) c0) t_0))))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = c0 / sqrt(((V / A) * l));
double tmp;
if ((l * V) <= -((double) INFINITY)) {
tmp = (sqrt((A / V)) / sqrt(l)) * c0;
} else if ((l * V) <= -2e-312) {
tmp = (sqrt(-A) / sqrt((l * -V))) * c0;
} else if ((l * V) <= 0.0) {
tmp = t_0;
} else if ((l * V) <= 2e+293) {
tmp = (sqrt(A) / sqrt((l * V))) * c0;
} else {
tmp = t_0;
}
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(((V / A) * l));
double tmp;
if ((l * V) <= -Double.POSITIVE_INFINITY) {
tmp = (Math.sqrt((A / V)) / Math.sqrt(l)) * c0;
} else if ((l * V) <= -2e-312) {
tmp = (Math.sqrt(-A) / Math.sqrt((l * -V))) * c0;
} else if ((l * V) <= 0.0) {
tmp = t_0;
} else if ((l * V) <= 2e+293) {
tmp = (Math.sqrt(A) / Math.sqrt((l * V))) * c0;
} else {
tmp = t_0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = c0 / math.sqrt(((V / A) * l)) tmp = 0 if (l * V) <= -math.inf: tmp = (math.sqrt((A / V)) / math.sqrt(l)) * c0 elif (l * V) <= -2e-312: tmp = (math.sqrt(-A) / math.sqrt((l * -V))) * c0 elif (l * V) <= 0.0: tmp = t_0 elif (l * V) <= 2e+293: tmp = (math.sqrt(A) / math.sqrt((l * V))) * c0 else: tmp = t_0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = Float64(c0 / sqrt(Float64(Float64(V / A) * l))) tmp = 0.0 if (Float64(l * V) <= Float64(-Inf)) tmp = Float64(Float64(sqrt(Float64(A / V)) / sqrt(l)) * c0); elseif (Float64(l * V) <= -2e-312) tmp = Float64(Float64(sqrt(Float64(-A)) / sqrt(Float64(l * Float64(-V)))) * c0); elseif (Float64(l * V) <= 0.0) tmp = t_0; elseif (Float64(l * V) <= 2e+293) tmp = Float64(Float64(sqrt(A) / sqrt(Float64(l * V))) * c0); else tmp = t_0; 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(((V / A) * l));
tmp = 0.0;
if ((l * V) <= -Inf)
tmp = (sqrt((A / V)) / sqrt(l)) * c0;
elseif ((l * V) <= -2e-312)
tmp = (sqrt(-A) / sqrt((l * -V))) * c0;
elseif ((l * V) <= 0.0)
tmp = t_0;
elseif ((l * V) <= 2e+293)
tmp = (sqrt(A) / sqrt((l * V))) * c0;
else
tmp = t_0;
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[(V / A), $MachinePrecision] * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(l * V), $MachinePrecision], (-Infinity)], N[(N[(N[Sqrt[N[(A / V), $MachinePrecision]], $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], -2e-312], N[(N[(N[Sqrt[(-A)], $MachinePrecision] / N[Sqrt[N[(l * (-V)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 0.0], t$95$0, If[LessEqual[N[(l * V), $MachinePrecision], 2e+293], N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], t$95$0]]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
t_0 := \frac{c0}{\sqrt{\frac{V}{A} \cdot \ell}}\\
\mathbf{if}\;\ell \cdot V \leq -\infty:\\
\;\;\;\;\frac{\sqrt{\frac{A}{V}}}{\sqrt{\ell}} \cdot c0\\
\mathbf{elif}\;\ell \cdot V \leq -2 \cdot 10^{-312}:\\
\;\;\;\;\frac{\sqrt{-A}}{\sqrt{\ell \cdot \left(-V\right)}} \cdot c0\\
\mathbf{elif}\;\ell \cdot V \leq 0:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\ell \cdot V \leq 2 \cdot 10^{+293}:\\
\;\;\;\;\frac{\sqrt{A}}{\sqrt{\ell \cdot V}} \cdot c0\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if (*.f64 V l) < -inf.0Initial program 28.5%
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.f6433.6
Applied rewrites33.6%
if -inf.0 < (*.f64 V l) < -2.0000000000019e-312Initial program 87.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6480.5
Applied rewrites80.5%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-*.f64N/A
frac-2negN/A
sqrt-divN/A
neg-mul-1N/A
*-commutativeN/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lift-neg.f64N/A
sqrt-divN/A
frac-timesN/A
lift-/.f64N/A
associate-/r/N/A
lift-/.f64N/A
frac-2negN/A
sqrt-divN/A
pow1/2N/A
Applied rewrites99.2%
if -2.0000000000019e-312 < (*.f64 V l) < -0.0 or 1.9999999999999998e293 < (*.f64 V l) Initial program 50.2%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6472.8
Applied rewrites72.8%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
associate-*r/N/A
associate-*l/N/A
lift-/.f64N/A
clear-numN/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
frac-timesN/A
lift-sqrt.f64N/A
sqrt-prodN/A
*-commutativeN/A
associate-/r/N/A
lift-/.f64N/A
metadata-evalN/A
*-rgt-identityN/A
Applied rewrites74.0%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-*r/N/A
lift-/.f64N/A
*-commutativeN/A
lower-*.f6474.0
Applied rewrites74.0%
if -0.0 < (*.f64 V l) < 1.9999999999999998e293Initial program 86.7%
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6499.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6499.1
Applied rewrites99.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 (/ c0 (sqrt (* (/ V A) l)))))
(if (<= (* l V) (- INFINITY))
(* (sqrt (/ (/ A l) V)) c0)
(if (<= (* l V) -2e-312)
(* (/ (sqrt (- A)) (sqrt (* l (- V)))) c0)
(if (<= (* l V) 0.0)
t_0
(if (<= (* l V) 2e+293) (* (/ (sqrt A) (sqrt (* l V))) c0) t_0))))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = c0 / sqrt(((V / A) * l));
double tmp;
if ((l * V) <= -((double) INFINITY)) {
tmp = sqrt(((A / l) / V)) * c0;
} else if ((l * V) <= -2e-312) {
tmp = (sqrt(-A) / sqrt((l * -V))) * c0;
} else if ((l * V) <= 0.0) {
tmp = t_0;
} else if ((l * V) <= 2e+293) {
tmp = (sqrt(A) / sqrt((l * V))) * c0;
} else {
tmp = t_0;
}
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(((V / A) * l));
double tmp;
if ((l * V) <= -Double.POSITIVE_INFINITY) {
tmp = Math.sqrt(((A / l) / V)) * c0;
} else if ((l * V) <= -2e-312) {
tmp = (Math.sqrt(-A) / Math.sqrt((l * -V))) * c0;
} else if ((l * V) <= 0.0) {
tmp = t_0;
} else if ((l * V) <= 2e+293) {
tmp = (Math.sqrt(A) / Math.sqrt((l * V))) * c0;
} else {
tmp = t_0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = c0 / math.sqrt(((V / A) * l)) tmp = 0 if (l * V) <= -math.inf: tmp = math.sqrt(((A / l) / V)) * c0 elif (l * V) <= -2e-312: tmp = (math.sqrt(-A) / math.sqrt((l * -V))) * c0 elif (l * V) <= 0.0: tmp = t_0 elif (l * V) <= 2e+293: tmp = (math.sqrt(A) / math.sqrt((l * V))) * c0 else: tmp = t_0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = Float64(c0 / sqrt(Float64(Float64(V / A) * l))) tmp = 0.0 if (Float64(l * V) <= Float64(-Inf)) tmp = Float64(sqrt(Float64(Float64(A / l) / V)) * c0); elseif (Float64(l * V) <= -2e-312) tmp = Float64(Float64(sqrt(Float64(-A)) / sqrt(Float64(l * Float64(-V)))) * c0); elseif (Float64(l * V) <= 0.0) tmp = t_0; elseif (Float64(l * V) <= 2e+293) tmp = Float64(Float64(sqrt(A) / sqrt(Float64(l * V))) * c0); else tmp = t_0; 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(((V / A) * l));
tmp = 0.0;
if ((l * V) <= -Inf)
tmp = sqrt(((A / l) / V)) * c0;
elseif ((l * V) <= -2e-312)
tmp = (sqrt(-A) / sqrt((l * -V))) * c0;
elseif ((l * V) <= 0.0)
tmp = t_0;
elseif ((l * V) <= 2e+293)
tmp = (sqrt(A) / sqrt((l * V))) * c0;
else
tmp = t_0;
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[(V / A), $MachinePrecision] * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(l * V), $MachinePrecision], (-Infinity)], N[(N[Sqrt[N[(N[(A / l), $MachinePrecision] / V), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], -2e-312], N[(N[(N[Sqrt[(-A)], $MachinePrecision] / N[Sqrt[N[(l * (-V)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 0.0], t$95$0, If[LessEqual[N[(l * V), $MachinePrecision], 2e+293], N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], t$95$0]]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
t_0 := \frac{c0}{\sqrt{\frac{V}{A} \cdot \ell}}\\
\mathbf{if}\;\ell \cdot V \leq -\infty:\\
\;\;\;\;\sqrt{\frac{\frac{A}{\ell}}{V}} \cdot c0\\
\mathbf{elif}\;\ell \cdot V \leq -2 \cdot 10^{-312}:\\
\;\;\;\;\frac{\sqrt{-A}}{\sqrt{\ell \cdot \left(-V\right)}} \cdot c0\\
\mathbf{elif}\;\ell \cdot V \leq 0:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\ell \cdot V \leq 2 \cdot 10^{+293}:\\
\;\;\;\;\frac{\sqrt{A}}{\sqrt{\ell \cdot V}} \cdot c0\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if (*.f64 V l) < -inf.0Initial program 28.5%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6476.3
Applied rewrites76.3%
if -inf.0 < (*.f64 V l) < -2.0000000000019e-312Initial program 87.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6480.5
Applied rewrites80.5%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-*.f64N/A
frac-2negN/A
sqrt-divN/A
neg-mul-1N/A
*-commutativeN/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lift-neg.f64N/A
sqrt-divN/A
frac-timesN/A
lift-/.f64N/A
associate-/r/N/A
lift-/.f64N/A
frac-2negN/A
sqrt-divN/A
pow1/2N/A
Applied rewrites99.2%
if -2.0000000000019e-312 < (*.f64 V l) < -0.0 or 1.9999999999999998e293 < (*.f64 V l) Initial program 50.2%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6472.8
Applied rewrites72.8%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
associate-*r/N/A
associate-*l/N/A
lift-/.f64N/A
clear-numN/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
frac-timesN/A
lift-sqrt.f64N/A
sqrt-prodN/A
*-commutativeN/A
associate-/r/N/A
lift-/.f64N/A
metadata-evalN/A
*-rgt-identityN/A
Applied rewrites74.0%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-*r/N/A
lift-/.f64N/A
*-commutativeN/A
lower-*.f6474.0
Applied rewrites74.0%
if -0.0 < (*.f64 V l) < 1.9999999999999998e293Initial program 86.7%
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6499.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6499.1
Applied rewrites99.1%
Final simplification92.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) -4e+119)
(* (sqrt (/ (/ A l) V)) c0)
(if (<= (* l V) -4e-187)
(* (sqrt (/ A (* l V))) c0)
(if (<= (* l V) 0.0)
(/ c0 (sqrt (* (/ l A) V)))
(if (<= (* l V) 2e+293)
(* (/ (sqrt A) (sqrt (* l V))) c0)
(/ c0 (sqrt (* (/ V A) l))))))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double tmp;
if ((l * V) <= -4e+119) {
tmp = sqrt(((A / l) / V)) * c0;
} else if ((l * V) <= -4e-187) {
tmp = sqrt((A / (l * V))) * c0;
} else if ((l * V) <= 0.0) {
tmp = c0 / sqrt(((l / A) * V));
} else if ((l * V) <= 2e+293) {
tmp = (sqrt(A) / sqrt((l * V))) * c0;
} else {
tmp = c0 / sqrt(((V / A) * l));
}
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) <= (-4d+119)) then
tmp = sqrt(((a / l) / v)) * c0
else if ((l * v) <= (-4d-187)) then
tmp = sqrt((a / (l * v))) * c0
else if ((l * v) <= 0.0d0) then
tmp = c0 / sqrt(((l / a) * v))
else if ((l * v) <= 2d+293) then
tmp = (sqrt(a) / sqrt((l * v))) * c0
else
tmp = c0 / sqrt(((v / a) * l))
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) <= -4e+119) {
tmp = Math.sqrt(((A / l) / V)) * c0;
} else if ((l * V) <= -4e-187) {
tmp = Math.sqrt((A / (l * V))) * c0;
} else if ((l * V) <= 0.0) {
tmp = c0 / Math.sqrt(((l / A) * V));
} else if ((l * V) <= 2e+293) {
tmp = (Math.sqrt(A) / Math.sqrt((l * V))) * c0;
} else {
tmp = c0 / Math.sqrt(((V / A) * l));
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): tmp = 0 if (l * V) <= -4e+119: tmp = math.sqrt(((A / l) / V)) * c0 elif (l * V) <= -4e-187: tmp = math.sqrt((A / (l * V))) * c0 elif (l * V) <= 0.0: tmp = c0 / math.sqrt(((l / A) * V)) elif (l * V) <= 2e+293: tmp = (math.sqrt(A) / math.sqrt((l * V))) * c0 else: tmp = c0 / math.sqrt(((V / A) * l)) return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) tmp = 0.0 if (Float64(l * V) <= -4e+119) tmp = Float64(sqrt(Float64(Float64(A / l) / V)) * c0); elseif (Float64(l * V) <= -4e-187) tmp = Float64(sqrt(Float64(A / Float64(l * V))) * c0); elseif (Float64(l * V) <= 0.0) tmp = Float64(c0 / sqrt(Float64(Float64(l / A) * V))); elseif (Float64(l * V) <= 2e+293) tmp = Float64(Float64(sqrt(A) / sqrt(Float64(l * V))) * c0); else tmp = Float64(c0 / sqrt(Float64(Float64(V / A) * l))); 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) <= -4e+119)
tmp = sqrt(((A / l) / V)) * c0;
elseif ((l * V) <= -4e-187)
tmp = sqrt((A / (l * V))) * c0;
elseif ((l * V) <= 0.0)
tmp = c0 / sqrt(((l / A) * V));
elseif ((l * V) <= 2e+293)
tmp = (sqrt(A) / sqrt((l * V))) * c0;
else
tmp = c0 / sqrt(((V / A) * l));
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], -4e+119], N[(N[Sqrt[N[(N[(A / l), $MachinePrecision] / V), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], -4e-187], N[(N[Sqrt[N[(A / N[(l * V), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 0.0], N[(c0 / N[Sqrt[N[(N[(l / A), $MachinePrecision] * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 2e+293], N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], N[(c0 / N[Sqrt[N[(N[(V / A), $MachinePrecision] * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \cdot V \leq -4 \cdot 10^{+119}:\\
\;\;\;\;\sqrt{\frac{\frac{A}{\ell}}{V}} \cdot c0\\
\mathbf{elif}\;\ell \cdot V \leq -4 \cdot 10^{-187}:\\
\;\;\;\;\sqrt{\frac{A}{\ell \cdot V}} \cdot c0\\
\mathbf{elif}\;\ell \cdot V \leq 0:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{\ell}{A} \cdot V}}\\
\mathbf{elif}\;\ell \cdot V \leq 2 \cdot 10^{+293}:\\
\;\;\;\;\frac{\sqrt{A}}{\sqrt{\ell \cdot V}} \cdot c0\\
\mathbf{else}:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{V}{A} \cdot \ell}}\\
\end{array}
\end{array}
if (*.f64 V l) < -3.99999999999999978e119Initial program 54.9%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6474.1
Applied rewrites74.1%
if -3.99999999999999978e119 < (*.f64 V l) < -4.0000000000000001e-187Initial program 93.9%
if -4.0000000000000001e-187 < (*.f64 V l) < -0.0Initial program 64.0%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6475.9
Applied rewrites75.9%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
associate-*r/N/A
associate-*l/N/A
lift-/.f64N/A
clear-numN/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
frac-timesN/A
lift-sqrt.f64N/A
sqrt-prodN/A
*-commutativeN/A
associate-/r/N/A
lift-/.f64N/A
metadata-evalN/A
*-rgt-identityN/A
Applied rewrites75.2%
if -0.0 < (*.f64 V l) < 1.9999999999999998e293Initial program 86.7%
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6499.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6499.1
Applied rewrites99.1%
if 1.9999999999999998e293 < (*.f64 V l) Initial program 44.6%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6473.6
Applied rewrites73.6%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
associate-*r/N/A
associate-*l/N/A
lift-/.f64N/A
clear-numN/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
frac-timesN/A
lift-sqrt.f64N/A
sqrt-prodN/A
*-commutativeN/A
associate-/r/N/A
lift-/.f64N/A
metadata-evalN/A
*-rgt-identityN/A
Applied rewrites73.6%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-*r/N/A
lift-/.f64N/A
*-commutativeN/A
lower-*.f6473.7
Applied rewrites73.7%
Final simplification86.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 (/ A (* l V))))
(if (<= t_0 5e-317)
(* (sqrt (/ (/ A l) V)) c0)
(if (<= t_0 2e+276) (* (sqrt t_0) c0) (/ c0 (sqrt (* (/ V A) l)))))))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 <= 5e-317) {
tmp = sqrt(((A / l) / V)) * c0;
} else if (t_0 <= 2e+276) {
tmp = sqrt(t_0) * c0;
} else {
tmp = c0 / sqrt(((V / A) * l));
}
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 <= 5d-317) then
tmp = sqrt(((a / l) / v)) * c0
else if (t_0 <= 2d+276) then
tmp = sqrt(t_0) * c0
else
tmp = c0 / sqrt(((v / a) * l))
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 <= 5e-317) {
tmp = Math.sqrt(((A / l) / V)) * c0;
} else if (t_0 <= 2e+276) {
tmp = Math.sqrt(t_0) * c0;
} else {
tmp = c0 / Math.sqrt(((V / A) * l));
}
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 <= 5e-317: tmp = math.sqrt(((A / l) / V)) * c0 elif t_0 <= 2e+276: tmp = math.sqrt(t_0) * c0 else: tmp = c0 / math.sqrt(((V / A) * l)) 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 <= 5e-317) tmp = Float64(sqrt(Float64(Float64(A / l) / V)) * c0); elseif (t_0 <= 2e+276) tmp = Float64(sqrt(t_0) * c0); else tmp = Float64(c0 / sqrt(Float64(Float64(V / A) * l))); 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 <= 5e-317)
tmp = sqrt(((A / l) / V)) * c0;
elseif (t_0 <= 2e+276)
tmp = sqrt(t_0) * c0;
else
tmp = c0 / sqrt(((V / A) * l));
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, 5e-317], N[(N[Sqrt[N[(N[(A / l), $MachinePrecision] / V), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[t$95$0, 2e+276], N[(N[Sqrt[t$95$0], $MachinePrecision] * c0), $MachinePrecision], N[(c0 / N[Sqrt[N[(N[(V / A), $MachinePrecision] * l), $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 5 \cdot 10^{-317}:\\
\;\;\;\;\sqrt{\frac{\frac{A}{\ell}}{V}} \cdot c0\\
\mathbf{elif}\;t\_0 \leq 2 \cdot 10^{+276}:\\
\;\;\;\;\sqrt{t\_0} \cdot c0\\
\mathbf{else}:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{V}{A} \cdot \ell}}\\
\end{array}
\end{array}
if (/.f64 A (*.f64 V l)) < 5.00000017e-317Initial program 36.4%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6463.9
Applied rewrites63.9%
if 5.00000017e-317 < (/.f64 A (*.f64 V l)) < 2.0000000000000001e276Initial program 99.5%
if 2.0000000000000001e276 < (/.f64 A (*.f64 V l)) Initial program 49.2%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6460.9
Applied rewrites60.9%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
associate-*r/N/A
associate-*l/N/A
lift-/.f64N/A
clear-numN/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
frac-timesN/A
lift-sqrt.f64N/A
sqrt-prodN/A
*-commutativeN/A
associate-/r/N/A
lift-/.f64N/A
metadata-evalN/A
*-rgt-identityN/A
Applied rewrites63.3%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-*r/N/A
lift-/.f64N/A
*-commutativeN/A
lower-*.f6462.1
Applied rewrites62.1%
Final simplification83.6%
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 l) V)) c0))) (if (<= t_0 5e-317) t_1 (if (<= t_0 1e+262) (* (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 / l) / V)) * c0;
double tmp;
if (t_0 <= 5e-317) {
tmp = t_1;
} else if (t_0 <= 1e+262) {
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 / l) / v)) * c0
if (t_0 <= 5d-317) then
tmp = t_1
else if (t_0 <= 1d+262) 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 / l) / V)) * c0;
double tmp;
if (t_0 <= 5e-317) {
tmp = t_1;
} else if (t_0 <= 1e+262) {
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 / l) / V)) * c0 tmp = 0 if t_0 <= 5e-317: tmp = t_1 elif t_0 <= 1e+262: 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 / l) / V)) * c0) tmp = 0.0 if (t_0 <= 5e-317) tmp = t_1; elseif (t_0 <= 1e+262) 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 / l) / V)) * c0;
tmp = 0.0;
if (t_0 <= 5e-317)
tmp = t_1;
elseif (t_0 <= 1e+262)
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 / l), $MachinePrecision] / V), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]}, If[LessEqual[t$95$0, 5e-317], t$95$1, If[LessEqual[t$95$0, 1e+262], 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}{\ell}}{V}} \cdot c0\\
\mathbf{if}\;t\_0 \leq 5 \cdot 10^{-317}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_0 \leq 10^{+262}:\\
\;\;\;\;\sqrt{t\_0} \cdot c0\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if (/.f64 A (*.f64 V l)) < 5.00000017e-317 or 1e262 < (/.f64 A (*.f64 V l)) Initial program 44.0%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6462.2
Applied rewrites62.2%
if 5.00000017e-317 < (/.f64 A (*.f64 V l)) < 1e262Initial program 99.5%
Final simplification82.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 (<= A -5e-310) (* (/ (sqrt (- A)) (* (sqrt l) (sqrt (- V)))) c0) (* (/ (sqrt A) (sqrt (* l V))) c0)))
assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double tmp;
if (A <= -5e-310) {
tmp = (sqrt(-A) / (sqrt(l) * sqrt(-V))) * c0;
} else {
tmp = (sqrt(A) / sqrt((l * V))) * 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 (a <= (-5d-310)) then
tmp = (sqrt(-a) / (sqrt(l) * sqrt(-v))) * c0
else
tmp = (sqrt(a) / sqrt((l * v))) * 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 (A <= -5e-310) {
tmp = (Math.sqrt(-A) / (Math.sqrt(l) * Math.sqrt(-V))) * c0;
} else {
tmp = (Math.sqrt(A) / Math.sqrt((l * V))) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): tmp = 0 if A <= -5e-310: tmp = (math.sqrt(-A) / (math.sqrt(l) * math.sqrt(-V))) * c0 else: tmp = (math.sqrt(A) / math.sqrt((l * V))) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) tmp = 0.0 if (A <= -5e-310) tmp = Float64(Float64(sqrt(Float64(-A)) / Float64(sqrt(l) * sqrt(Float64(-V)))) * c0); else tmp = Float64(Float64(sqrt(A) / sqrt(Float64(l * V))) * 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 (A <= -5e-310)
tmp = (sqrt(-A) / (sqrt(l) * sqrt(-V))) * c0;
else
tmp = (sqrt(A) / sqrt((l * V))) * 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[A, -5e-310], N[(N[(N[Sqrt[(-A)], $MachinePrecision] / N[(N[Sqrt[l], $MachinePrecision] * N[Sqrt[(-V)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
\mathbf{if}\;A \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\frac{\sqrt{-A}}{\sqrt{\ell} \cdot \sqrt{-V}} \cdot c0\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{A}}{\sqrt{\ell \cdot V}} \cdot c0\\
\end{array}
\end{array}
if A < -4.999999999999985e-310Initial program 72.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6478.6
Applied rewrites78.6%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-*.f64N/A
frac-2negN/A
sqrt-divN/A
neg-mul-1N/A
*-commutativeN/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lift-neg.f64N/A
sqrt-divN/A
frac-timesN/A
lift-/.f64N/A
associate-/r/N/A
lift-/.f64N/A
frac-2negN/A
sqrt-divN/A
pow1/2N/A
Applied rewrites80.2%
lift-sqrt.f64N/A
lift-*.f64N/A
sqrt-prodN/A
pow1/2N/A
lift-sqrt.f64N/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f6443.0
Applied rewrites43.0%
if -4.999999999999985e-310 < A Initial program 76.7%
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6485.6
lift-*.f64N/A
*-commutativeN/A
lower-*.f6485.6
Applied rewrites85.6%
Final simplification63.3%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function. (FPCore (c0 A V l) :precision binary64 (if (<= V -5e-310) (* (/ (sqrt (/ (- A) l)) (sqrt (- V))) c0) (* (/ c0 (* (sqrt V) (sqrt l))) (sqrt A))))
assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double tmp;
if (V <= -5e-310) {
tmp = (sqrt((-A / l)) / sqrt(-V)) * c0;
} else {
tmp = (c0 / (sqrt(V) * sqrt(l))) * sqrt(A);
}
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 (v <= (-5d-310)) then
tmp = (sqrt((-a / l)) / sqrt(-v)) * c0
else
tmp = (c0 / (sqrt(v) * sqrt(l))) * sqrt(a)
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 (V <= -5e-310) {
tmp = (Math.sqrt((-A / l)) / Math.sqrt(-V)) * c0;
} else {
tmp = (c0 / (Math.sqrt(V) * Math.sqrt(l))) * Math.sqrt(A);
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): tmp = 0 if V <= -5e-310: tmp = (math.sqrt((-A / l)) / math.sqrt(-V)) * c0 else: tmp = (c0 / (math.sqrt(V) * math.sqrt(l))) * math.sqrt(A) return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) tmp = 0.0 if (V <= -5e-310) tmp = Float64(Float64(sqrt(Float64(Float64(-A) / l)) / sqrt(Float64(-V))) * c0); else tmp = Float64(Float64(c0 / Float64(sqrt(V) * sqrt(l))) * sqrt(A)); 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 (V <= -5e-310)
tmp = (sqrt((-A / l)) / sqrt(-V)) * c0;
else
tmp = (c0 / (sqrt(V) * sqrt(l))) * sqrt(A);
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[V, -5e-310], N[(N[(N[Sqrt[N[((-A) / l), $MachinePrecision]], $MachinePrecision] / N[Sqrt[(-V)], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], N[(N[(c0 / N[(N[Sqrt[V], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[A], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
\mathbf{if}\;V \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\frac{\sqrt{\frac{-A}{\ell}}}{\sqrt{-V}} \cdot c0\\
\mathbf{else}:\\
\;\;\;\;\frac{c0}{\sqrt{V} \cdot \sqrt{\ell}} \cdot \sqrt{A}\\
\end{array}
\end{array}
if V < -4.999999999999985e-310Initial program 77.7%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6481.8
Applied rewrites81.8%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lift-/.f64N/A
frac-2negN/A
sqrt-divN/A
lift-/.f64N/A
distribute-frac-neg2N/A
lift-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lift-neg.f64N/A
distribute-frac-neg2N/A
distribute-neg-fracN/A
lower-/.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-neg.f6492.9
Applied rewrites92.9%
if -4.999999999999985e-310 < V Initial program 71.6%
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.f6439.8
Applied rewrites39.8%
lift-sqrt.f64N/A
lift-*.f64N/A
sqrt-prodN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lower-*.f6445.9
Applied rewrites45.9%
Final simplification67.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 (<= V -1.02e-237) (* (/ (sqrt (/ (- A) l)) (sqrt (- V))) c0) (/ c0 (* (sqrt (/ V A)) (sqrt l)))))
assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double tmp;
if (V <= -1.02e-237) {
tmp = (sqrt((-A / l)) / sqrt(-V)) * c0;
} else {
tmp = c0 / (sqrt((V / A)) * sqrt(l));
}
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 (v <= (-1.02d-237)) then
tmp = (sqrt((-a / l)) / sqrt(-v)) * c0
else
tmp = c0 / (sqrt((v / a)) * sqrt(l))
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 (V <= -1.02e-237) {
tmp = (Math.sqrt((-A / l)) / Math.sqrt(-V)) * c0;
} else {
tmp = c0 / (Math.sqrt((V / A)) * Math.sqrt(l));
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): tmp = 0 if V <= -1.02e-237: tmp = (math.sqrt((-A / l)) / math.sqrt(-V)) * c0 else: tmp = c0 / (math.sqrt((V / A)) * math.sqrt(l)) return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) tmp = 0.0 if (V <= -1.02e-237) tmp = Float64(Float64(sqrt(Float64(Float64(-A) / l)) / sqrt(Float64(-V))) * c0); else tmp = Float64(c0 / Float64(sqrt(Float64(V / A)) * sqrt(l))); 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 (V <= -1.02e-237)
tmp = (sqrt((-A / l)) / sqrt(-V)) * c0;
else
tmp = c0 / (sqrt((V / A)) * sqrt(l));
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[V, -1.02e-237], N[(N[(N[Sqrt[N[((-A) / l), $MachinePrecision]], $MachinePrecision] / N[Sqrt[(-V)], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], N[(c0 / N[(N[Sqrt[N[(V / A), $MachinePrecision]], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
\mathbf{if}\;V \leq -1.02 \cdot 10^{-237}:\\
\;\;\;\;\frac{\sqrt{\frac{-A}{\ell}}}{\sqrt{-V}} \cdot c0\\
\mathbf{else}:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{V}{A}} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if V < -1.02e-237Initial program 76.5%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6480.9
Applied rewrites80.9%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lift-/.f64N/A
frac-2negN/A
sqrt-divN/A
lift-/.f64N/A
distribute-frac-neg2N/A
lift-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lift-neg.f64N/A
distribute-frac-neg2N/A
distribute-neg-fracN/A
lower-/.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-neg.f6494.0
Applied rewrites94.0%
if -1.02e-237 < V Initial program 72.9%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6475.2
Applied rewrites75.2%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
associate-*r/N/A
associate-*l/N/A
lift-/.f64N/A
clear-numN/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
frac-timesN/A
lift-sqrt.f64N/A
sqrt-prodN/A
*-commutativeN/A
associate-/r/N/A
lift-/.f64N/A
metadata-evalN/A
*-rgt-identityN/A
Applied rewrites75.3%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-*r/N/A
lift-/.f64N/A
sqrt-unprodN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
*-commutativeN/A
lower-*.f6440.7
Applied rewrites40.7%
Final simplification62.6%
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 74.4%
Final simplification74.4%
herbie shell --seed 2024250
(FPCore (c0 A V l)
:name "Henrywood and Agarwal, Equation (3)"
:precision binary64
(* c0 (sqrt (/ A (* V l)))))