
(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 13 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 (<= (* V l) -1e+305)
(* (/ c0 (sqrt l)) (sqrt (/ A V)))
(if (<= (* V l) -4e-315)
(* c0 (* (sqrt (- A)) (/ 1.0 (sqrt (- (* V l))))))
(if (<= (* V l) 1e-241)
(/ c0 (sqrt (* l (/ V A))))
(if (<= (* V l) 5e+274)
(* c0 (/ (sqrt A) (sqrt (* V l))))
(* A (/ 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 ((V * l) <= -1e+305) {
tmp = (c0 / sqrt(l)) * sqrt((A / V));
} else if ((V * l) <= -4e-315) {
tmp = c0 * (sqrt(-A) * (1.0 / sqrt(-(V * l))));
} else if ((V * l) <= 1e-241) {
tmp = c0 / sqrt((l * (V / A)));
} else if ((V * l) <= 5e+274) {
tmp = c0 * (sqrt(A) / sqrt((V * l)));
} else {
tmp = A * (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 ((v * l) <= (-1d+305)) then
tmp = (c0 / sqrt(l)) * sqrt((a / v))
else if ((v * l) <= (-4d-315)) then
tmp = c0 * (sqrt(-a) * (1.0d0 / sqrt(-(v * l))))
else if ((v * l) <= 1d-241) then
tmp = c0 / sqrt((l * (v / a)))
else if ((v * l) <= 5d+274) then
tmp = c0 * (sqrt(a) / sqrt((v * l)))
else
tmp = a * (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 ((V * l) <= -1e+305) {
tmp = (c0 / Math.sqrt(l)) * Math.sqrt((A / V));
} else if ((V * l) <= -4e-315) {
tmp = c0 * (Math.sqrt(-A) * (1.0 / Math.sqrt(-(V * l))));
} else if ((V * l) <= 1e-241) {
tmp = c0 / Math.sqrt((l * (V / A)));
} else if ((V * l) <= 5e+274) {
tmp = c0 * (Math.sqrt(A) / Math.sqrt((V * l)));
} else {
tmp = A * (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 (V * l) <= -1e+305: tmp = (c0 / math.sqrt(l)) * math.sqrt((A / V)) elif (V * l) <= -4e-315: tmp = c0 * (math.sqrt(-A) * (1.0 / math.sqrt(-(V * l)))) elif (V * l) <= 1e-241: tmp = c0 / math.sqrt((l * (V / A))) elif (V * l) <= 5e+274: tmp = c0 * (math.sqrt(A) / math.sqrt((V * l))) else: tmp = A * (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(V * l) <= -1e+305) tmp = Float64(Float64(c0 / sqrt(l)) * sqrt(Float64(A / V))); elseif (Float64(V * l) <= -4e-315) tmp = Float64(c0 * Float64(sqrt(Float64(-A)) * Float64(1.0 / sqrt(Float64(-Float64(V * l)))))); elseif (Float64(V * l) <= 1e-241) tmp = Float64(c0 / sqrt(Float64(l * Float64(V / A)))); elseif (Float64(V * l) <= 5e+274) tmp = Float64(c0 * Float64(sqrt(A) / sqrt(Float64(V * l)))); else tmp = Float64(A * Float64(c0 / sqrt(Float64(V * Float64(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 ((V * l) <= -1e+305)
tmp = (c0 / sqrt(l)) * sqrt((A / V));
elseif ((V * l) <= -4e-315)
tmp = c0 * (sqrt(-A) * (1.0 / sqrt(-(V * l))));
elseif ((V * l) <= 1e-241)
tmp = c0 / sqrt((l * (V / A)));
elseif ((V * l) <= 5e+274)
tmp = c0 * (sqrt(A) / sqrt((V * l)));
else
tmp = A * (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[(V * l), $MachinePrecision], -1e+305], N[(N[(c0 / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(A / V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], -4e-315], N[(c0 * N[(N[Sqrt[(-A)], $MachinePrecision] * N[(1.0 / N[Sqrt[(-N[(V * l), $MachinePrecision])], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 1e-241], N[(c0 / N[Sqrt[N[(l * N[(V / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 5e+274], N[(c0 * N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(V * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(A * N[(c0 / N[Sqrt[N[(V * N[(A * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
\mathbf{if}\;V \cdot \ell \leq -1 \cdot 10^{+305}:\\
\;\;\;\;\frac{c0}{\sqrt{\ell}} \cdot \sqrt{\frac{A}{V}}\\
\mathbf{elif}\;V \cdot \ell \leq -4 \cdot 10^{-315}:\\
\;\;\;\;c0 \cdot \left(\sqrt{-A} \cdot \frac{1}{\sqrt{-V \cdot \ell}}\right)\\
\mathbf{elif}\;V \cdot \ell \leq 10^{-241}:\\
\;\;\;\;\frac{c0}{\sqrt{\ell \cdot \frac{V}{A}}}\\
\mathbf{elif}\;V \cdot \ell \leq 5 \cdot 10^{+274}:\\
\;\;\;\;c0 \cdot \frac{\sqrt{A}}{\sqrt{V \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;A \cdot \frac{c0}{\sqrt{V \cdot \left(A \cdot \ell\right)}}\\
\end{array}
\end{array}
if (*.f64 V l) < -9.9999999999999994e304Initial program 31.6%
associate-/r*N/A
sqrt-divN/A
associate-*r/N/A
associate-*l/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6440.0
Applied egg-rr40.0%
if -9.9999999999999994e304 < (*.f64 V l) < -3.9999999989e-315Initial program 82.3%
*-commutativeN/A
/-rgt-identityN/A
associate-/r/N/A
/-lowering-/.f64N/A
/-lowering-/.f6482.2
Applied egg-rr82.2%
associate-/r/N/A
un-div-invN/A
associate-/l/N/A
frac-2negN/A
sqrt-divN/A
div-invN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
neg-lowering-neg.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
neg-lowering-neg.f6499.0
Applied egg-rr99.0%
if -3.9999999989e-315 < (*.f64 V l) < 9.9999999999999997e-242Initial program 54.3%
*-commutativeN/A
/-rgt-identityN/A
associate-/r/N/A
/-lowering-/.f64N/A
/-lowering-/.f6454.3
Applied egg-rr54.3%
associate-/r/N/A
frac-timesN/A
*-commutativeN/A
associate-*l/N/A
sqrt-prodN/A
*-inversesN/A
sqrt-prodN/A
times-fracN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-/l*N/A
associate-/r*N/A
*-inversesN/A
div-invN/A
/-lowering-/.f64N/A
Applied egg-rr54.4%
associate-/l*N/A
clear-numN/A
metadata-evalN/A
div-invN/A
metadata-evalN/A
*-inversesN/A
clear-numN/A
times-fracN/A
*-commutativeN/A
*-lowering-*.f64N/A
clear-numN/A
times-fracN/A
*-inversesN/A
*-lft-identityN/A
clear-numN/A
/-lowering-/.f6473.9
Applied egg-rr73.9%
if 9.9999999999999997e-242 < (*.f64 V l) < 4.9999999999999998e274Initial program 88.7%
sqrt-divN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6499.4
Applied egg-rr99.4%
if 4.9999999999999998e274 < (*.f64 V l) Initial program 44.0%
*-commutativeN/A
/-rgt-identityN/A
associate-/r/N/A
/-lowering-/.f64N/A
/-lowering-/.f6444.0
Applied egg-rr44.0%
associate-/r/N/A
frac-timesN/A
*-commutativeN/A
associate-*l/N/A
sqrt-prodN/A
*-inversesN/A
sqrt-prodN/A
times-fracN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
associate-*r/N/A
sqrt-divN/A
associate-*r/N/A
clear-numN/A
Applied egg-rr72.7%
Final simplification90.2%
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 l) -1e+305)
(* (/ c0 (sqrt l)) (sqrt (/ A V)))
(if (<= (* V l) -2e-307)
(* c0 (* (sqrt (- A)) (sqrt (/ -1.0 (* V l)))))
(if (<= (* V l) 1e-241)
(/ c0 (sqrt (* l (/ V A))))
(if (<= (* V l) 5e+274)
(* c0 (/ (sqrt A) (sqrt (* V l))))
(* A (/ 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 ((V * l) <= -1e+305) {
tmp = (c0 / sqrt(l)) * sqrt((A / V));
} else if ((V * l) <= -2e-307) {
tmp = c0 * (sqrt(-A) * sqrt((-1.0 / (V * l))));
} else if ((V * l) <= 1e-241) {
tmp = c0 / sqrt((l * (V / A)));
} else if ((V * l) <= 5e+274) {
tmp = c0 * (sqrt(A) / sqrt((V * l)));
} else {
tmp = A * (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 ((v * l) <= (-1d+305)) then
tmp = (c0 / sqrt(l)) * sqrt((a / v))
else if ((v * l) <= (-2d-307)) then
tmp = c0 * (sqrt(-a) * sqrt(((-1.0d0) / (v * l))))
else if ((v * l) <= 1d-241) then
tmp = c0 / sqrt((l * (v / a)))
else if ((v * l) <= 5d+274) then
tmp = c0 * (sqrt(a) / sqrt((v * l)))
else
tmp = a * (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 ((V * l) <= -1e+305) {
tmp = (c0 / Math.sqrt(l)) * Math.sqrt((A / V));
} else if ((V * l) <= -2e-307) {
tmp = c0 * (Math.sqrt(-A) * Math.sqrt((-1.0 / (V * l))));
} else if ((V * l) <= 1e-241) {
tmp = c0 / Math.sqrt((l * (V / A)));
} else if ((V * l) <= 5e+274) {
tmp = c0 * (Math.sqrt(A) / Math.sqrt((V * l)));
} else {
tmp = A * (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 (V * l) <= -1e+305: tmp = (c0 / math.sqrt(l)) * math.sqrt((A / V)) elif (V * l) <= -2e-307: tmp = c0 * (math.sqrt(-A) * math.sqrt((-1.0 / (V * l)))) elif (V * l) <= 1e-241: tmp = c0 / math.sqrt((l * (V / A))) elif (V * l) <= 5e+274: tmp = c0 * (math.sqrt(A) / math.sqrt((V * l))) else: tmp = A * (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(V * l) <= -1e+305) tmp = Float64(Float64(c0 / sqrt(l)) * sqrt(Float64(A / V))); elseif (Float64(V * l) <= -2e-307) tmp = Float64(c0 * Float64(sqrt(Float64(-A)) * sqrt(Float64(-1.0 / Float64(V * l))))); elseif (Float64(V * l) <= 1e-241) tmp = Float64(c0 / sqrt(Float64(l * Float64(V / A)))); elseif (Float64(V * l) <= 5e+274) tmp = Float64(c0 * Float64(sqrt(A) / sqrt(Float64(V * l)))); else tmp = Float64(A * Float64(c0 / sqrt(Float64(V * Float64(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 ((V * l) <= -1e+305)
tmp = (c0 / sqrt(l)) * sqrt((A / V));
elseif ((V * l) <= -2e-307)
tmp = c0 * (sqrt(-A) * sqrt((-1.0 / (V * l))));
elseif ((V * l) <= 1e-241)
tmp = c0 / sqrt((l * (V / A)));
elseif ((V * l) <= 5e+274)
tmp = c0 * (sqrt(A) / sqrt((V * l)));
else
tmp = A * (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[(V * l), $MachinePrecision], -1e+305], N[(N[(c0 / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(A / V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], -2e-307], N[(c0 * N[(N[Sqrt[(-A)], $MachinePrecision] * N[Sqrt[N[(-1.0 / N[(V * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 1e-241], N[(c0 / N[Sqrt[N[(l * N[(V / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 5e+274], N[(c0 * N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(V * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(A * N[(c0 / N[Sqrt[N[(V * N[(A * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
\mathbf{if}\;V \cdot \ell \leq -1 \cdot 10^{+305}:\\
\;\;\;\;\frac{c0}{\sqrt{\ell}} \cdot \sqrt{\frac{A}{V}}\\
\mathbf{elif}\;V \cdot \ell \leq -2 \cdot 10^{-307}:\\
\;\;\;\;c0 \cdot \left(\sqrt{-A} \cdot \sqrt{\frac{-1}{V \cdot \ell}}\right)\\
\mathbf{elif}\;V \cdot \ell \leq 10^{-241}:\\
\;\;\;\;\frac{c0}{\sqrt{\ell \cdot \frac{V}{A}}}\\
\mathbf{elif}\;V \cdot \ell \leq 5 \cdot 10^{+274}:\\
\;\;\;\;c0 \cdot \frac{\sqrt{A}}{\sqrt{V \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;A \cdot \frac{c0}{\sqrt{V \cdot \left(A \cdot \ell\right)}}\\
\end{array}
\end{array}
if (*.f64 V l) < -9.9999999999999994e304Initial program 31.6%
associate-/r*N/A
sqrt-divN/A
associate-*r/N/A
associate-*l/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6440.0
Applied egg-rr40.0%
if -9.9999999999999994e304 < (*.f64 V l) < -1.99999999999999982e-307Initial program 83.0%
*-commutativeN/A
/-rgt-identityN/A
associate-/r/N/A
/-lowering-/.f64N/A
/-lowering-/.f6482.9
Applied egg-rr82.9%
frac-2negN/A
frac-2negN/A
associate-/r/N/A
un-div-invN/A
associate-/l/N/A
frac-2negN/A
div-invN/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
metadata-evalN/A
frac-2negN/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6499.4
Applied egg-rr99.4%
if -1.99999999999999982e-307 < (*.f64 V l) < 9.9999999999999997e-242Initial program 53.4%
*-commutativeN/A
/-rgt-identityN/A
associate-/r/N/A
/-lowering-/.f64N/A
/-lowering-/.f6453.4
Applied egg-rr53.4%
associate-/r/N/A
frac-timesN/A
*-commutativeN/A
associate-*l/N/A
sqrt-prodN/A
*-inversesN/A
sqrt-prodN/A
times-fracN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-/l*N/A
associate-/r*N/A
*-inversesN/A
div-invN/A
/-lowering-/.f64N/A
Applied egg-rr53.5%
associate-/l*N/A
clear-numN/A
metadata-evalN/A
div-invN/A
metadata-evalN/A
*-inversesN/A
clear-numN/A
times-fracN/A
*-commutativeN/A
*-lowering-*.f64N/A
clear-numN/A
times-fracN/A
*-inversesN/A
*-lft-identityN/A
clear-numN/A
/-lowering-/.f6472.6
Applied egg-rr72.6%
if 9.9999999999999997e-242 < (*.f64 V l) < 4.9999999999999998e274Initial program 88.7%
sqrt-divN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6499.4
Applied egg-rr99.4%
if 4.9999999999999998e274 < (*.f64 V l) Initial program 44.0%
*-commutativeN/A
/-rgt-identityN/A
associate-/r/N/A
/-lowering-/.f64N/A
/-lowering-/.f6444.0
Applied egg-rr44.0%
associate-/r/N/A
frac-timesN/A
*-commutativeN/A
associate-*l/N/A
sqrt-prodN/A
*-inversesN/A
sqrt-prodN/A
times-fracN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
associate-*r/N/A
sqrt-divN/A
associate-*r/N/A
clear-numN/A
Applied egg-rr72.7%
Final simplification90.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 l) -1e+305)
(* (/ c0 (sqrt l)) (sqrt (/ A V)))
(if (<= (* V l) -4e-315)
(/ (* c0 (sqrt (- A))) (sqrt (- (* V l))))
(if (<= (* V l) 1e-241)
(/ c0 (sqrt (* l (/ V A))))
(if (<= (* V l) 5e+274)
(* c0 (/ (sqrt A) (sqrt (* V l))))
(* A (/ 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 ((V * l) <= -1e+305) {
tmp = (c0 / sqrt(l)) * sqrt((A / V));
} else if ((V * l) <= -4e-315) {
tmp = (c0 * sqrt(-A)) / sqrt(-(V * l));
} else if ((V * l) <= 1e-241) {
tmp = c0 / sqrt((l * (V / A)));
} else if ((V * l) <= 5e+274) {
tmp = c0 * (sqrt(A) / sqrt((V * l)));
} else {
tmp = A * (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 ((v * l) <= (-1d+305)) then
tmp = (c0 / sqrt(l)) * sqrt((a / v))
else if ((v * l) <= (-4d-315)) then
tmp = (c0 * sqrt(-a)) / sqrt(-(v * l))
else if ((v * l) <= 1d-241) then
tmp = c0 / sqrt((l * (v / a)))
else if ((v * l) <= 5d+274) then
tmp = c0 * (sqrt(a) / sqrt((v * l)))
else
tmp = a * (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 ((V * l) <= -1e+305) {
tmp = (c0 / Math.sqrt(l)) * Math.sqrt((A / V));
} else if ((V * l) <= -4e-315) {
tmp = (c0 * Math.sqrt(-A)) / Math.sqrt(-(V * l));
} else if ((V * l) <= 1e-241) {
tmp = c0 / Math.sqrt((l * (V / A)));
} else if ((V * l) <= 5e+274) {
tmp = c0 * (Math.sqrt(A) / Math.sqrt((V * l)));
} else {
tmp = A * (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 (V * l) <= -1e+305: tmp = (c0 / math.sqrt(l)) * math.sqrt((A / V)) elif (V * l) <= -4e-315: tmp = (c0 * math.sqrt(-A)) / math.sqrt(-(V * l)) elif (V * l) <= 1e-241: tmp = c0 / math.sqrt((l * (V / A))) elif (V * l) <= 5e+274: tmp = c0 * (math.sqrt(A) / math.sqrt((V * l))) else: tmp = A * (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(V * l) <= -1e+305) tmp = Float64(Float64(c0 / sqrt(l)) * sqrt(Float64(A / V))); elseif (Float64(V * l) <= -4e-315) tmp = Float64(Float64(c0 * sqrt(Float64(-A))) / sqrt(Float64(-Float64(V * l)))); elseif (Float64(V * l) <= 1e-241) tmp = Float64(c0 / sqrt(Float64(l * Float64(V / A)))); elseif (Float64(V * l) <= 5e+274) tmp = Float64(c0 * Float64(sqrt(A) / sqrt(Float64(V * l)))); else tmp = Float64(A * Float64(c0 / sqrt(Float64(V * Float64(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 ((V * l) <= -1e+305)
tmp = (c0 / sqrt(l)) * sqrt((A / V));
elseif ((V * l) <= -4e-315)
tmp = (c0 * sqrt(-A)) / sqrt(-(V * l));
elseif ((V * l) <= 1e-241)
tmp = c0 / sqrt((l * (V / A)));
elseif ((V * l) <= 5e+274)
tmp = c0 * (sqrt(A) / sqrt((V * l)));
else
tmp = A * (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[(V * l), $MachinePrecision], -1e+305], N[(N[(c0 / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(A / V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], -4e-315], N[(N[(c0 * N[Sqrt[(-A)], $MachinePrecision]), $MachinePrecision] / N[Sqrt[(-N[(V * l), $MachinePrecision])], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 1e-241], N[(c0 / N[Sqrt[N[(l * N[(V / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 5e+274], N[(c0 * N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(V * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(A * N[(c0 / N[Sqrt[N[(V * N[(A * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
\mathbf{if}\;V \cdot \ell \leq -1 \cdot 10^{+305}:\\
\;\;\;\;\frac{c0}{\sqrt{\ell}} \cdot \sqrt{\frac{A}{V}}\\
\mathbf{elif}\;V \cdot \ell \leq -4 \cdot 10^{-315}:\\
\;\;\;\;\frac{c0 \cdot \sqrt{-A}}{\sqrt{-V \cdot \ell}}\\
\mathbf{elif}\;V \cdot \ell \leq 10^{-241}:\\
\;\;\;\;\frac{c0}{\sqrt{\ell \cdot \frac{V}{A}}}\\
\mathbf{elif}\;V \cdot \ell \leq 5 \cdot 10^{+274}:\\
\;\;\;\;c0 \cdot \frac{\sqrt{A}}{\sqrt{V \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;A \cdot \frac{c0}{\sqrt{V \cdot \left(A \cdot \ell\right)}}\\
\end{array}
\end{array}
if (*.f64 V l) < -9.9999999999999994e304Initial program 31.6%
associate-/r*N/A
sqrt-divN/A
associate-*r/N/A
associate-*l/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6440.0
Applied egg-rr40.0%
if -9.9999999999999994e304 < (*.f64 V l) < -3.9999999989e-315Initial program 82.3%
*-commutativeN/A
/-rgt-identityN/A
associate-/r/N/A
/-lowering-/.f64N/A
/-lowering-/.f6482.2
Applied egg-rr82.2%
*-commutativeN/A
associate-/r/N/A
un-div-invN/A
associate-/l/N/A
frac-2negN/A
sqrt-divN/A
associate-*l/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
neg-lowering-neg.f6496.9
Applied egg-rr96.9%
if -3.9999999989e-315 < (*.f64 V l) < 9.9999999999999997e-242Initial program 54.3%
*-commutativeN/A
/-rgt-identityN/A
associate-/r/N/A
/-lowering-/.f64N/A
/-lowering-/.f6454.3
Applied egg-rr54.3%
associate-/r/N/A
frac-timesN/A
*-commutativeN/A
associate-*l/N/A
sqrt-prodN/A
*-inversesN/A
sqrt-prodN/A
times-fracN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-/l*N/A
associate-/r*N/A
*-inversesN/A
div-invN/A
/-lowering-/.f64N/A
Applied egg-rr54.4%
associate-/l*N/A
clear-numN/A
metadata-evalN/A
div-invN/A
metadata-evalN/A
*-inversesN/A
clear-numN/A
times-fracN/A
*-commutativeN/A
*-lowering-*.f64N/A
clear-numN/A
times-fracN/A
*-inversesN/A
*-lft-identityN/A
clear-numN/A
/-lowering-/.f6473.9
Applied egg-rr73.9%
if 9.9999999999999997e-242 < (*.f64 V l) < 4.9999999999999998e274Initial program 88.7%
sqrt-divN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6499.4
Applied egg-rr99.4%
if 4.9999999999999998e274 < (*.f64 V l) Initial program 44.0%
*-commutativeN/A
/-rgt-identityN/A
associate-/r/N/A
/-lowering-/.f64N/A
/-lowering-/.f6444.0
Applied egg-rr44.0%
associate-/r/N/A
frac-timesN/A
*-commutativeN/A
associate-*l/N/A
sqrt-prodN/A
*-inversesN/A
sqrt-prodN/A
times-fracN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
associate-*r/N/A
sqrt-divN/A
associate-*r/N/A
clear-numN/A
Applied egg-rr72.7%
Final simplification89.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 l) -1e+305)
(* c0 (sqrt (/ (/ A V) l)))
(if (<= (* V l) -4e-315)
(/ (* c0 (sqrt (- A))) (sqrt (- (* V l))))
(if (<= (* V l) 1e-241)
(/ c0 (sqrt (* l (/ V A))))
(if (<= (* V l) 5e+274)
(* c0 (/ (sqrt A) (sqrt (* V l))))
(* A (/ 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 ((V * l) <= -1e+305) {
tmp = c0 * sqrt(((A / V) / l));
} else if ((V * l) <= -4e-315) {
tmp = (c0 * sqrt(-A)) / sqrt(-(V * l));
} else if ((V * l) <= 1e-241) {
tmp = c0 / sqrt((l * (V / A)));
} else if ((V * l) <= 5e+274) {
tmp = c0 * (sqrt(A) / sqrt((V * l)));
} else {
tmp = A * (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 ((v * l) <= (-1d+305)) then
tmp = c0 * sqrt(((a / v) / l))
else if ((v * l) <= (-4d-315)) then
tmp = (c0 * sqrt(-a)) / sqrt(-(v * l))
else if ((v * l) <= 1d-241) then
tmp = c0 / sqrt((l * (v / a)))
else if ((v * l) <= 5d+274) then
tmp = c0 * (sqrt(a) / sqrt((v * l)))
else
tmp = a * (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 ((V * l) <= -1e+305) {
tmp = c0 * Math.sqrt(((A / V) / l));
} else if ((V * l) <= -4e-315) {
tmp = (c0 * Math.sqrt(-A)) / Math.sqrt(-(V * l));
} else if ((V * l) <= 1e-241) {
tmp = c0 / Math.sqrt((l * (V / A)));
} else if ((V * l) <= 5e+274) {
tmp = c0 * (Math.sqrt(A) / Math.sqrt((V * l)));
} else {
tmp = A * (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 (V * l) <= -1e+305: tmp = c0 * math.sqrt(((A / V) / l)) elif (V * l) <= -4e-315: tmp = (c0 * math.sqrt(-A)) / math.sqrt(-(V * l)) elif (V * l) <= 1e-241: tmp = c0 / math.sqrt((l * (V / A))) elif (V * l) <= 5e+274: tmp = c0 * (math.sqrt(A) / math.sqrt((V * l))) else: tmp = A * (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(V * l) <= -1e+305) tmp = Float64(c0 * sqrt(Float64(Float64(A / V) / l))); elseif (Float64(V * l) <= -4e-315) tmp = Float64(Float64(c0 * sqrt(Float64(-A))) / sqrt(Float64(-Float64(V * l)))); elseif (Float64(V * l) <= 1e-241) tmp = Float64(c0 / sqrt(Float64(l * Float64(V / A)))); elseif (Float64(V * l) <= 5e+274) tmp = Float64(c0 * Float64(sqrt(A) / sqrt(Float64(V * l)))); else tmp = Float64(A * Float64(c0 / sqrt(Float64(V * Float64(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 ((V * l) <= -1e+305)
tmp = c0 * sqrt(((A / V) / l));
elseif ((V * l) <= -4e-315)
tmp = (c0 * sqrt(-A)) / sqrt(-(V * l));
elseif ((V * l) <= 1e-241)
tmp = c0 / sqrt((l * (V / A)));
elseif ((V * l) <= 5e+274)
tmp = c0 * (sqrt(A) / sqrt((V * l)));
else
tmp = A * (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[(V * l), $MachinePrecision], -1e+305], N[(c0 * N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], -4e-315], N[(N[(c0 * N[Sqrt[(-A)], $MachinePrecision]), $MachinePrecision] / N[Sqrt[(-N[(V * l), $MachinePrecision])], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 1e-241], N[(c0 / N[Sqrt[N[(l * N[(V / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 5e+274], N[(c0 * N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(V * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(A * N[(c0 / N[Sqrt[N[(V * N[(A * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
\mathbf{if}\;V \cdot \ell \leq -1 \cdot 10^{+305}:\\
\;\;\;\;c0 \cdot \sqrt{\frac{\frac{A}{V}}{\ell}}\\
\mathbf{elif}\;V \cdot \ell \leq -4 \cdot 10^{-315}:\\
\;\;\;\;\frac{c0 \cdot \sqrt{-A}}{\sqrt{-V \cdot \ell}}\\
\mathbf{elif}\;V \cdot \ell \leq 10^{-241}:\\
\;\;\;\;\frac{c0}{\sqrt{\ell \cdot \frac{V}{A}}}\\
\mathbf{elif}\;V \cdot \ell \leq 5 \cdot 10^{+274}:\\
\;\;\;\;c0 \cdot \frac{\sqrt{A}}{\sqrt{V \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;A \cdot \frac{c0}{\sqrt{V \cdot \left(A \cdot \ell\right)}}\\
\end{array}
\end{array}
if (*.f64 V l) < -9.9999999999999994e304Initial program 31.6%
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f6470.2
Applied egg-rr70.2%
if -9.9999999999999994e304 < (*.f64 V l) < -3.9999999989e-315Initial program 82.3%
*-commutativeN/A
/-rgt-identityN/A
associate-/r/N/A
/-lowering-/.f64N/A
/-lowering-/.f6482.2
Applied egg-rr82.2%
*-commutativeN/A
associate-/r/N/A
un-div-invN/A
associate-/l/N/A
frac-2negN/A
sqrt-divN/A
associate-*l/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
neg-lowering-neg.f6496.9
Applied egg-rr96.9%
if -3.9999999989e-315 < (*.f64 V l) < 9.9999999999999997e-242Initial program 54.3%
*-commutativeN/A
/-rgt-identityN/A
associate-/r/N/A
/-lowering-/.f64N/A
/-lowering-/.f6454.3
Applied egg-rr54.3%
associate-/r/N/A
frac-timesN/A
*-commutativeN/A
associate-*l/N/A
sqrt-prodN/A
*-inversesN/A
sqrt-prodN/A
times-fracN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-/l*N/A
associate-/r*N/A
*-inversesN/A
div-invN/A
/-lowering-/.f64N/A
Applied egg-rr54.4%
associate-/l*N/A
clear-numN/A
metadata-evalN/A
div-invN/A
metadata-evalN/A
*-inversesN/A
clear-numN/A
times-fracN/A
*-commutativeN/A
*-lowering-*.f64N/A
clear-numN/A
times-fracN/A
*-inversesN/A
*-lft-identityN/A
clear-numN/A
/-lowering-/.f6473.9
Applied egg-rr73.9%
if 9.9999999999999997e-242 < (*.f64 V l) < 4.9999999999999998e274Initial program 88.7%
sqrt-divN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6499.4
Applied egg-rr99.4%
if 4.9999999999999998e274 < (*.f64 V l) Initial program 44.0%
*-commutativeN/A
/-rgt-identityN/A
associate-/r/N/A
/-lowering-/.f64N/A
/-lowering-/.f6444.0
Applied egg-rr44.0%
associate-/r/N/A
frac-timesN/A
*-commutativeN/A
associate-*l/N/A
sqrt-prodN/A
*-inversesN/A
sqrt-prodN/A
times-fracN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
associate-*r/N/A
sqrt-divN/A
associate-*r/N/A
clear-numN/A
Applied egg-rr72.7%
Final simplification90.5%
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 (* V l))))
(if (<= t_0 0.0)
(* A (/ c0 (sqrt (* V (* A l)))))
(if (<= t_0 4e+291) (* c0 (sqrt t_0)) (/ c0 (sqrt (* l (/ V A))))))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = A / (V * l);
double tmp;
if (t_0 <= 0.0) {
tmp = A * (c0 / sqrt((V * (A * l))));
} else if (t_0 <= 4e+291) {
tmp = c0 * sqrt(t_0);
} else {
tmp = c0 / sqrt((l * (V / 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) :: t_0
real(8) :: tmp
t_0 = a / (v * l)
if (t_0 <= 0.0d0) then
tmp = a * (c0 / sqrt((v * (a * l))))
else if (t_0 <= 4d+291) then
tmp = c0 * sqrt(t_0)
else
tmp = c0 / sqrt((l * (v / 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 t_0 = A / (V * l);
double tmp;
if (t_0 <= 0.0) {
tmp = A * (c0 / Math.sqrt((V * (A * l))));
} else if (t_0 <= 4e+291) {
tmp = c0 * Math.sqrt(t_0);
} else {
tmp = c0 / Math.sqrt((l * (V / A)));
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = A / (V * l) tmp = 0 if t_0 <= 0.0: tmp = A * (c0 / math.sqrt((V * (A * l)))) elif t_0 <= 4e+291: tmp = c0 * math.sqrt(t_0) else: tmp = c0 / math.sqrt((l * (V / A))) return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = Float64(A / Float64(V * l)) tmp = 0.0 if (t_0 <= 0.0) tmp = Float64(A * Float64(c0 / sqrt(Float64(V * Float64(A * l))))); elseif (t_0 <= 4e+291) tmp = Float64(c0 * sqrt(t_0)); else tmp = Float64(c0 / sqrt(Float64(l * Float64(V / A)))); 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 / (V * l);
tmp = 0.0;
if (t_0 <= 0.0)
tmp = A * (c0 / sqrt((V * (A * l))));
elseif (t_0 <= 4e+291)
tmp = c0 * sqrt(t_0);
else
tmp = c0 / sqrt((l * (V / 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_] := Block[{t$95$0 = N[(A / N[(V * l), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 0.0], N[(A * N[(c0 / N[Sqrt[N[(V * N[(A * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 4e+291], N[(c0 * N[Sqrt[t$95$0], $MachinePrecision]), $MachinePrecision], N[(c0 / N[Sqrt[N[(l * N[(V / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
t_0 := \frac{A}{V \cdot \ell}\\
\mathbf{if}\;t\_0 \leq 0:\\
\;\;\;\;A \cdot \frac{c0}{\sqrt{V \cdot \left(A \cdot \ell\right)}}\\
\mathbf{elif}\;t\_0 \leq 4 \cdot 10^{+291}:\\
\;\;\;\;c0 \cdot \sqrt{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{c0}{\sqrt{\ell \cdot \frac{V}{A}}}\\
\end{array}
\end{array}
if (/.f64 A (*.f64 V l)) < 0.0Initial program 33.0%
*-commutativeN/A
/-rgt-identityN/A
associate-/r/N/A
/-lowering-/.f64N/A
/-lowering-/.f6433.0
Applied egg-rr33.0%
associate-/r/N/A
frac-timesN/A
*-commutativeN/A
associate-*l/N/A
sqrt-prodN/A
*-inversesN/A
sqrt-prodN/A
times-fracN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
associate-*r/N/A
sqrt-divN/A
associate-*r/N/A
clear-numN/A
Applied egg-rr54.1%
if 0.0 < (/.f64 A (*.f64 V l)) < 3.9999999999999998e291Initial program 98.8%
if 3.9999999999999998e291 < (/.f64 A (*.f64 V l)) Initial program 47.3%
*-commutativeN/A
/-rgt-identityN/A
associate-/r/N/A
/-lowering-/.f64N/A
/-lowering-/.f6447.3
Applied egg-rr47.3%
associate-/r/N/A
frac-timesN/A
*-commutativeN/A
associate-*l/N/A
sqrt-prodN/A
*-inversesN/A
sqrt-prodN/A
times-fracN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-/l*N/A
associate-/r*N/A
*-inversesN/A
div-invN/A
/-lowering-/.f64N/A
Applied egg-rr47.3%
associate-/l*N/A
clear-numN/A
metadata-evalN/A
div-invN/A
metadata-evalN/A
*-inversesN/A
clear-numN/A
times-fracN/A
*-commutativeN/A
*-lowering-*.f64N/A
clear-numN/A
times-fracN/A
*-inversesN/A
*-lft-identityN/A
clear-numN/A
/-lowering-/.f6458.9
Applied egg-rr58.9%
Final simplification80.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 (* V l))))
(if (<= t_0 0.0)
(* A (/ c0 (sqrt (* V (* A l)))))
(if (<= t_0 2e+296) (* c0 (sqrt t_0)) (/ c0 (sqrt (* V (/ l A))))))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = A / (V * l);
double tmp;
if (t_0 <= 0.0) {
tmp = A * (c0 / sqrt((V * (A * l))));
} else if (t_0 <= 2e+296) {
tmp = c0 * sqrt(t_0);
} else {
tmp = c0 / sqrt((V * (l / 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) :: t_0
real(8) :: tmp
t_0 = a / (v * l)
if (t_0 <= 0.0d0) then
tmp = a * (c0 / sqrt((v * (a * l))))
else if (t_0 <= 2d+296) then
tmp = c0 * sqrt(t_0)
else
tmp = c0 / sqrt((v * (l / 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 t_0 = A / (V * l);
double tmp;
if (t_0 <= 0.0) {
tmp = A * (c0 / Math.sqrt((V * (A * l))));
} else if (t_0 <= 2e+296) {
tmp = c0 * Math.sqrt(t_0);
} else {
tmp = c0 / Math.sqrt((V * (l / A)));
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = A / (V * l) tmp = 0 if t_0 <= 0.0: tmp = A * (c0 / math.sqrt((V * (A * l)))) elif t_0 <= 2e+296: tmp = c0 * math.sqrt(t_0) else: tmp = c0 / math.sqrt((V * (l / A))) return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = Float64(A / Float64(V * l)) tmp = 0.0 if (t_0 <= 0.0) tmp = Float64(A * Float64(c0 / sqrt(Float64(V * Float64(A * l))))); elseif (t_0 <= 2e+296) tmp = Float64(c0 * sqrt(t_0)); else tmp = Float64(c0 / sqrt(Float64(V * Float64(l / A)))); 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 / (V * l);
tmp = 0.0;
if (t_0 <= 0.0)
tmp = A * (c0 / sqrt((V * (A * l))));
elseif (t_0 <= 2e+296)
tmp = c0 * sqrt(t_0);
else
tmp = c0 / sqrt((V * (l / 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_] := Block[{t$95$0 = N[(A / N[(V * l), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 0.0], N[(A * N[(c0 / N[Sqrt[N[(V * N[(A * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 2e+296], N[(c0 * N[Sqrt[t$95$0], $MachinePrecision]), $MachinePrecision], N[(c0 / N[Sqrt[N[(V * N[(l / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
t_0 := \frac{A}{V \cdot \ell}\\
\mathbf{if}\;t\_0 \leq 0:\\
\;\;\;\;A \cdot \frac{c0}{\sqrt{V \cdot \left(A \cdot \ell\right)}}\\
\mathbf{elif}\;t\_0 \leq 2 \cdot 10^{+296}:\\
\;\;\;\;c0 \cdot \sqrt{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{c0}{\sqrt{V \cdot \frac{\ell}{A}}}\\
\end{array}
\end{array}
if (/.f64 A (*.f64 V l)) < 0.0Initial program 33.0%
*-commutativeN/A
/-rgt-identityN/A
associate-/r/N/A
/-lowering-/.f64N/A
/-lowering-/.f6433.0
Applied egg-rr33.0%
associate-/r/N/A
frac-timesN/A
*-commutativeN/A
associate-*l/N/A
sqrt-prodN/A
*-inversesN/A
sqrt-prodN/A
times-fracN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
associate-*r/N/A
sqrt-divN/A
associate-*r/N/A
clear-numN/A
Applied egg-rr54.1%
if 0.0 < (/.f64 A (*.f64 V l)) < 1.99999999999999996e296Initial program 98.8%
if 1.99999999999999996e296 < (/.f64 A (*.f64 V l)) Initial program 46.5%
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6459.7
Applied egg-rr59.7%
Final simplification81.1%
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 (* V l))))
(if (<= t_0 0.0)
(* A (/ c0 (sqrt (* V (* A l)))))
(if (<= t_0 2e+296) (* c0 (sqrt t_0)) (* c0 (sqrt (/ (/ A l) V)))))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = A / (V * l);
double tmp;
if (t_0 <= 0.0) {
tmp = A * (c0 / sqrt((V * (A * l))));
} else if (t_0 <= 2e+296) {
tmp = c0 * sqrt(t_0);
} else {
tmp = c0 * sqrt(((A / l) / 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 / (v * l)
if (t_0 <= 0.0d0) then
tmp = a * (c0 / sqrt((v * (a * l))))
else if (t_0 <= 2d+296) then
tmp = c0 * sqrt(t_0)
else
tmp = c0 * sqrt(((a / l) / 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 / (V * l);
double tmp;
if (t_0 <= 0.0) {
tmp = A * (c0 / Math.sqrt((V * (A * l))));
} else if (t_0 <= 2e+296) {
tmp = c0 * Math.sqrt(t_0);
} else {
tmp = c0 * Math.sqrt(((A / l) / V));
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = A / (V * l) tmp = 0 if t_0 <= 0.0: tmp = A * (c0 / math.sqrt((V * (A * l)))) elif t_0 <= 2e+296: tmp = c0 * math.sqrt(t_0) else: tmp = c0 * math.sqrt(((A / l) / V)) return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = Float64(A / Float64(V * l)) tmp = 0.0 if (t_0 <= 0.0) tmp = Float64(A * Float64(c0 / sqrt(Float64(V * Float64(A * l))))); elseif (t_0 <= 2e+296) tmp = Float64(c0 * sqrt(t_0)); else tmp = Float64(c0 * sqrt(Float64(Float64(A / l) / 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 / (V * l);
tmp = 0.0;
if (t_0 <= 0.0)
tmp = A * (c0 / sqrt((V * (A * l))));
elseif (t_0 <= 2e+296)
tmp = c0 * sqrt(t_0);
else
tmp = c0 * sqrt(((A / l) / 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[(V * l), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 0.0], N[(A * N[(c0 / N[Sqrt[N[(V * N[(A * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 2e+296], N[(c0 * N[Sqrt[t$95$0], $MachinePrecision]), $MachinePrecision], N[(c0 * N[Sqrt[N[(N[(A / l), $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}{V \cdot \ell}\\
\mathbf{if}\;t\_0 \leq 0:\\
\;\;\;\;A \cdot \frac{c0}{\sqrt{V \cdot \left(A \cdot \ell\right)}}\\
\mathbf{elif}\;t\_0 \leq 2 \cdot 10^{+296}:\\
\;\;\;\;c0 \cdot \sqrt{t\_0}\\
\mathbf{else}:\\
\;\;\;\;c0 \cdot \sqrt{\frac{\frac{A}{\ell}}{V}}\\
\end{array}
\end{array}
if (/.f64 A (*.f64 V l)) < 0.0Initial program 33.0%
*-commutativeN/A
/-rgt-identityN/A
associate-/r/N/A
/-lowering-/.f64N/A
/-lowering-/.f6433.0
Applied egg-rr33.0%
associate-/r/N/A
frac-timesN/A
*-commutativeN/A
associate-*l/N/A
sqrt-prodN/A
*-inversesN/A
sqrt-prodN/A
times-fracN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
associate-*r/N/A
sqrt-divN/A
associate-*r/N/A
clear-numN/A
Applied egg-rr54.1%
if 0.0 < (/.f64 A (*.f64 V l)) < 1.99999999999999996e296Initial program 98.8%
if 1.99999999999999996e296 < (/.f64 A (*.f64 V l)) Initial program 46.5%
associate-/l/N/A
/-lowering-/.f64N/A
/-lowering-/.f6457.9
Applied egg-rr57.9%
Final simplification80.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 (* V l))))
(if (<= t_0 0.0)
(* A (/ c0 (sqrt (* V (* A l)))))
(if (<= t_0 4e+291) (* c0 (sqrt t_0)) (* c0 (sqrt (/ (/ A V) l)))))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = A / (V * l);
double tmp;
if (t_0 <= 0.0) {
tmp = A * (c0 / sqrt((V * (A * l))));
} else if (t_0 <= 4e+291) {
tmp = c0 * sqrt(t_0);
} else {
tmp = c0 * sqrt(((A / V) / 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 / (v * l)
if (t_0 <= 0.0d0) then
tmp = a * (c0 / sqrt((v * (a * l))))
else if (t_0 <= 4d+291) then
tmp = c0 * sqrt(t_0)
else
tmp = c0 * sqrt(((a / v) / 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 / (V * l);
double tmp;
if (t_0 <= 0.0) {
tmp = A * (c0 / Math.sqrt((V * (A * l))));
} else if (t_0 <= 4e+291) {
tmp = c0 * Math.sqrt(t_0);
} else {
tmp = c0 * Math.sqrt(((A / V) / l));
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = A / (V * l) tmp = 0 if t_0 <= 0.0: tmp = A * (c0 / math.sqrt((V * (A * l)))) elif t_0 <= 4e+291: tmp = c0 * math.sqrt(t_0) else: tmp = c0 * math.sqrt(((A / V) / l)) return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = Float64(A / Float64(V * l)) tmp = 0.0 if (t_0 <= 0.0) tmp = Float64(A * Float64(c0 / sqrt(Float64(V * Float64(A * l))))); elseif (t_0 <= 4e+291) tmp = Float64(c0 * sqrt(t_0)); else tmp = Float64(c0 * sqrt(Float64(Float64(A / V) / 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 / (V * l);
tmp = 0.0;
if (t_0 <= 0.0)
tmp = A * (c0 / sqrt((V * (A * l))));
elseif (t_0 <= 4e+291)
tmp = c0 * sqrt(t_0);
else
tmp = c0 * sqrt(((A / V) / 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[(V * l), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 0.0], N[(A * N[(c0 / N[Sqrt[N[(V * N[(A * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 4e+291], N[(c0 * N[Sqrt[t$95$0], $MachinePrecision]), $MachinePrecision], N[(c0 * N[Sqrt[N[(N[(A / V), $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}{V \cdot \ell}\\
\mathbf{if}\;t\_0 \leq 0:\\
\;\;\;\;A \cdot \frac{c0}{\sqrt{V \cdot \left(A \cdot \ell\right)}}\\
\mathbf{elif}\;t\_0 \leq 4 \cdot 10^{+291}:\\
\;\;\;\;c0 \cdot \sqrt{t\_0}\\
\mathbf{else}:\\
\;\;\;\;c0 \cdot \sqrt{\frac{\frac{A}{V}}{\ell}}\\
\end{array}
\end{array}
if (/.f64 A (*.f64 V l)) < 0.0Initial program 33.0%
*-commutativeN/A
/-rgt-identityN/A
associate-/r/N/A
/-lowering-/.f64N/A
/-lowering-/.f6433.0
Applied egg-rr33.0%
associate-/r/N/A
frac-timesN/A
*-commutativeN/A
associate-*l/N/A
sqrt-prodN/A
*-inversesN/A
sqrt-prodN/A
times-fracN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
associate-*r/N/A
sqrt-divN/A
associate-*r/N/A
clear-numN/A
Applied egg-rr54.1%
if 0.0 < (/.f64 A (*.f64 V l)) < 3.9999999999999998e291Initial program 98.8%
if 3.9999999999999998e291 < (/.f64 A (*.f64 V l)) Initial program 47.3%
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f6457.1
Applied egg-rr57.1%
Final simplification80.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 l) -4e-315)
(* (sqrt (- A)) (/ c0 (sqrt (- (* V l)))))
(if (<= (* V l) 1e-241)
(/ c0 (sqrt (* l (/ V A))))
(if (<= (* V l) 5e+274)
(* c0 (/ (sqrt A) (sqrt (* V l))))
(* A (/ 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 ((V * l) <= -4e-315) {
tmp = sqrt(-A) * (c0 / sqrt(-(V * l)));
} else if ((V * l) <= 1e-241) {
tmp = c0 / sqrt((l * (V / A)));
} else if ((V * l) <= 5e+274) {
tmp = c0 * (sqrt(A) / sqrt((V * l)));
} else {
tmp = A * (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 ((v * l) <= (-4d-315)) then
tmp = sqrt(-a) * (c0 / sqrt(-(v * l)))
else if ((v * l) <= 1d-241) then
tmp = c0 / sqrt((l * (v / a)))
else if ((v * l) <= 5d+274) then
tmp = c0 * (sqrt(a) / sqrt((v * l)))
else
tmp = a * (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 ((V * l) <= -4e-315) {
tmp = Math.sqrt(-A) * (c0 / Math.sqrt(-(V * l)));
} else if ((V * l) <= 1e-241) {
tmp = c0 / Math.sqrt((l * (V / A)));
} else if ((V * l) <= 5e+274) {
tmp = c0 * (Math.sqrt(A) / Math.sqrt((V * l)));
} else {
tmp = A * (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 (V * l) <= -4e-315: tmp = math.sqrt(-A) * (c0 / math.sqrt(-(V * l))) elif (V * l) <= 1e-241: tmp = c0 / math.sqrt((l * (V / A))) elif (V * l) <= 5e+274: tmp = c0 * (math.sqrt(A) / math.sqrt((V * l))) else: tmp = A * (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(V * l) <= -4e-315) tmp = Float64(sqrt(Float64(-A)) * Float64(c0 / sqrt(Float64(-Float64(V * l))))); elseif (Float64(V * l) <= 1e-241) tmp = Float64(c0 / sqrt(Float64(l * Float64(V / A)))); elseif (Float64(V * l) <= 5e+274) tmp = Float64(c0 * Float64(sqrt(A) / sqrt(Float64(V * l)))); else tmp = Float64(A * Float64(c0 / sqrt(Float64(V * Float64(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 ((V * l) <= -4e-315)
tmp = sqrt(-A) * (c0 / sqrt(-(V * l)));
elseif ((V * l) <= 1e-241)
tmp = c0 / sqrt((l * (V / A)));
elseif ((V * l) <= 5e+274)
tmp = c0 * (sqrt(A) / sqrt((V * l)));
else
tmp = A * (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[(V * l), $MachinePrecision], -4e-315], N[(N[Sqrt[(-A)], $MachinePrecision] * N[(c0 / N[Sqrt[(-N[(V * l), $MachinePrecision])], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 1e-241], N[(c0 / N[Sqrt[N[(l * N[(V / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 5e+274], N[(c0 * N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(V * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(A * N[(c0 / N[Sqrt[N[(V * N[(A * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
\mathbf{if}\;V \cdot \ell \leq -4 \cdot 10^{-315}:\\
\;\;\;\;\sqrt{-A} \cdot \frac{c0}{\sqrt{-V \cdot \ell}}\\
\mathbf{elif}\;V \cdot \ell \leq 10^{-241}:\\
\;\;\;\;\frac{c0}{\sqrt{\ell \cdot \frac{V}{A}}}\\
\mathbf{elif}\;V \cdot \ell \leq 5 \cdot 10^{+274}:\\
\;\;\;\;c0 \cdot \frac{\sqrt{A}}{\sqrt{V \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;A \cdot \frac{c0}{\sqrt{V \cdot \left(A \cdot \ell\right)}}\\
\end{array}
\end{array}
if (*.f64 V l) < -3.9999999989e-315Initial program 77.9%
*-commutativeN/A
/-rgt-identityN/A
associate-/r/N/A
/-lowering-/.f64N/A
/-lowering-/.f6477.8
Applied egg-rr77.8%
associate-/r/N/A
frac-timesN/A
*-commutativeN/A
associate-*l/N/A
sqrt-prodN/A
*-inversesN/A
sqrt-prodN/A
times-fracN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-/l*N/A
associate-/r*N/A
*-inversesN/A
div-invN/A
/-lowering-/.f64N/A
Applied egg-rr77.3%
frac-2negN/A
sqrt-divN/A
associate-/r/N/A
un-div-invN/A
metadata-evalN/A
metadata-evalN/A
sqrt-divN/A
frac-2negN/A
*-commutativeN/A
*-lowering-*.f64N/A
Applied egg-rr89.9%
if -3.9999999989e-315 < (*.f64 V l) < 9.9999999999999997e-242Initial program 54.3%
*-commutativeN/A
/-rgt-identityN/A
associate-/r/N/A
/-lowering-/.f64N/A
/-lowering-/.f6454.3
Applied egg-rr54.3%
associate-/r/N/A
frac-timesN/A
*-commutativeN/A
associate-*l/N/A
sqrt-prodN/A
*-inversesN/A
sqrt-prodN/A
times-fracN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-/l*N/A
associate-/r*N/A
*-inversesN/A
div-invN/A
/-lowering-/.f64N/A
Applied egg-rr54.4%
associate-/l*N/A
clear-numN/A
metadata-evalN/A
div-invN/A
metadata-evalN/A
*-inversesN/A
clear-numN/A
times-fracN/A
*-commutativeN/A
*-lowering-*.f64N/A
clear-numN/A
times-fracN/A
*-inversesN/A
*-lft-identityN/A
clear-numN/A
/-lowering-/.f6473.9
Applied egg-rr73.9%
if 9.9999999999999997e-242 < (*.f64 V l) < 4.9999999999999998e274Initial program 88.7%
sqrt-divN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6499.4
Applied egg-rr99.4%
if 4.9999999999999998e274 < (*.f64 V l) Initial program 44.0%
*-commutativeN/A
/-rgt-identityN/A
associate-/r/N/A
/-lowering-/.f64N/A
/-lowering-/.f6444.0
Applied egg-rr44.0%
associate-/r/N/A
frac-timesN/A
*-commutativeN/A
associate-*l/N/A
sqrt-prodN/A
*-inversesN/A
sqrt-prodN/A
times-fracN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
associate-*r/N/A
sqrt-divN/A
associate-*r/N/A
clear-numN/A
Applied egg-rr72.7%
Final simplification88.4%
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 l) -1e-114)
(* c0 (sqrt (/ A (* V l))))
(if (<= (* V l) 1e-241)
(/ c0 (sqrt (* l (/ V A))))
(if (<= (* V l) 5e+274)
(* c0 (/ (sqrt A) (sqrt (* V l))))
(* A (/ 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 ((V * l) <= -1e-114) {
tmp = c0 * sqrt((A / (V * l)));
} else if ((V * l) <= 1e-241) {
tmp = c0 / sqrt((l * (V / A)));
} else if ((V * l) <= 5e+274) {
tmp = c0 * (sqrt(A) / sqrt((V * l)));
} else {
tmp = A * (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 ((v * l) <= (-1d-114)) then
tmp = c0 * sqrt((a / (v * l)))
else if ((v * l) <= 1d-241) then
tmp = c0 / sqrt((l * (v / a)))
else if ((v * l) <= 5d+274) then
tmp = c0 * (sqrt(a) / sqrt((v * l)))
else
tmp = a * (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 ((V * l) <= -1e-114) {
tmp = c0 * Math.sqrt((A / (V * l)));
} else if ((V * l) <= 1e-241) {
tmp = c0 / Math.sqrt((l * (V / A)));
} else if ((V * l) <= 5e+274) {
tmp = c0 * (Math.sqrt(A) / Math.sqrt((V * l)));
} else {
tmp = A * (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 (V * l) <= -1e-114: tmp = c0 * math.sqrt((A / (V * l))) elif (V * l) <= 1e-241: tmp = c0 / math.sqrt((l * (V / A))) elif (V * l) <= 5e+274: tmp = c0 * (math.sqrt(A) / math.sqrt((V * l))) else: tmp = A * (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(V * l) <= -1e-114) tmp = Float64(c0 * sqrt(Float64(A / Float64(V * l)))); elseif (Float64(V * l) <= 1e-241) tmp = Float64(c0 / sqrt(Float64(l * Float64(V / A)))); elseif (Float64(V * l) <= 5e+274) tmp = Float64(c0 * Float64(sqrt(A) / sqrt(Float64(V * l)))); else tmp = Float64(A * Float64(c0 / sqrt(Float64(V * Float64(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 ((V * l) <= -1e-114)
tmp = c0 * sqrt((A / (V * l)));
elseif ((V * l) <= 1e-241)
tmp = c0 / sqrt((l * (V / A)));
elseif ((V * l) <= 5e+274)
tmp = c0 * (sqrt(A) / sqrt((V * l)));
else
tmp = A * (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[(V * l), $MachinePrecision], -1e-114], N[(c0 * N[Sqrt[N[(A / N[(V * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 1e-241], N[(c0 / N[Sqrt[N[(l * N[(V / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 5e+274], N[(c0 * N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(V * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(A * N[(c0 / N[Sqrt[N[(V * N[(A * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
\mathbf{if}\;V \cdot \ell \leq -1 \cdot 10^{-114}:\\
\;\;\;\;c0 \cdot \sqrt{\frac{A}{V \cdot \ell}}\\
\mathbf{elif}\;V \cdot \ell \leq 10^{-241}:\\
\;\;\;\;\frac{c0}{\sqrt{\ell \cdot \frac{V}{A}}}\\
\mathbf{elif}\;V \cdot \ell \leq 5 \cdot 10^{+274}:\\
\;\;\;\;c0 \cdot \frac{\sqrt{A}}{\sqrt{V \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;A \cdot \frac{c0}{\sqrt{V \cdot \left(A \cdot \ell\right)}}\\
\end{array}
\end{array}
if (*.f64 V l) < -1.0000000000000001e-114Initial program 81.8%
if -1.0000000000000001e-114 < (*.f64 V l) < 9.9999999999999997e-242Initial program 58.4%
*-commutativeN/A
/-rgt-identityN/A
associate-/r/N/A
/-lowering-/.f64N/A
/-lowering-/.f6458.3
Applied egg-rr58.3%
associate-/r/N/A
frac-timesN/A
*-commutativeN/A
associate-*l/N/A
sqrt-prodN/A
*-inversesN/A
sqrt-prodN/A
times-fracN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-/l*N/A
associate-/r*N/A
*-inversesN/A
div-invN/A
/-lowering-/.f64N/A
Applied egg-rr58.5%
associate-/l*N/A
clear-numN/A
metadata-evalN/A
div-invN/A
metadata-evalN/A
*-inversesN/A
clear-numN/A
times-fracN/A
*-commutativeN/A
*-lowering-*.f64N/A
clear-numN/A
times-fracN/A
*-inversesN/A
*-lft-identityN/A
clear-numN/A
/-lowering-/.f6471.0
Applied egg-rr71.0%
if 9.9999999999999997e-242 < (*.f64 V l) < 4.9999999999999998e274Initial program 88.7%
sqrt-divN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6499.4
Applied egg-rr99.4%
if 4.9999999999999998e274 < (*.f64 V l) Initial program 44.0%
*-commutativeN/A
/-rgt-identityN/A
associate-/r/N/A
/-lowering-/.f64N/A
/-lowering-/.f6444.0
Applied egg-rr44.0%
associate-/r/N/A
frac-timesN/A
*-commutativeN/A
associate-*l/N/A
sqrt-prodN/A
*-inversesN/A
sqrt-prodN/A
times-fracN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
associate-*r/N/A
sqrt-divN/A
associate-*r/N/A
clear-numN/A
Applied egg-rr72.7%
Final simplification82.9%
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 -2e-310) (* c0 (* (sqrt (- A)) (/ 1.0 (* (sqrt (- V)) (sqrt l))))) (* c0 (/ (sqrt A) (sqrt (* V l))))))
assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double tmp;
if (A <= -2e-310) {
tmp = c0 * (sqrt(-A) * (1.0 / (sqrt(-V) * sqrt(l))));
} else {
tmp = c0 * (sqrt(A) / sqrt((V * 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 (a <= (-2d-310)) then
tmp = c0 * (sqrt(-a) * (1.0d0 / (sqrt(-v) * sqrt(l))))
else
tmp = c0 * (sqrt(a) / sqrt((v * 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 (A <= -2e-310) {
tmp = c0 * (Math.sqrt(-A) * (1.0 / (Math.sqrt(-V) * Math.sqrt(l))));
} else {
tmp = c0 * (Math.sqrt(A) / Math.sqrt((V * l)));
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): tmp = 0 if A <= -2e-310: tmp = c0 * (math.sqrt(-A) * (1.0 / (math.sqrt(-V) * math.sqrt(l)))) else: tmp = c0 * (math.sqrt(A) / math.sqrt((V * l))) return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) tmp = 0.0 if (A <= -2e-310) tmp = Float64(c0 * Float64(sqrt(Float64(-A)) * Float64(1.0 / Float64(sqrt(Float64(-V)) * sqrt(l))))); else tmp = Float64(c0 * Float64(sqrt(A) / sqrt(Float64(V * 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 (A <= -2e-310)
tmp = c0 * (sqrt(-A) * (1.0 / (sqrt(-V) * sqrt(l))));
else
tmp = c0 * (sqrt(A) / sqrt((V * 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[A, -2e-310], N[(c0 * N[(N[Sqrt[(-A)], $MachinePrecision] * N[(1.0 / N[(N[Sqrt[(-V)], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(c0 * N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(V * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
\mathbf{if}\;A \leq -2 \cdot 10^{-310}:\\
\;\;\;\;c0 \cdot \left(\sqrt{-A} \cdot \frac{1}{\sqrt{-V} \cdot \sqrt{\ell}}\right)\\
\mathbf{else}:\\
\;\;\;\;c0 \cdot \frac{\sqrt{A}}{\sqrt{V \cdot \ell}}\\
\end{array}
\end{array}
if A < -1.999999999999994e-310Initial program 72.7%
*-commutativeN/A
/-rgt-identityN/A
associate-/r/N/A
/-lowering-/.f64N/A
/-lowering-/.f6472.6
Applied egg-rr72.6%
frac-2negN/A
frac-2negN/A
associate-/r/N/A
un-div-invN/A
associate-/l/N/A
frac-2negN/A
div-invN/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f64N/A
metadata-evalN/A
frac-2negN/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6484.6
Applied egg-rr84.6%
frac-2negN/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
/-lowering-/.f64N/A
metadata-evalN/A
/-rgt-identityN/A
metadata-evalN/A
frac-2negN/A
sqrt-lowering-sqrt.f64N/A
frac-2negN/A
metadata-evalN/A
/-rgt-identityN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
neg-lowering-neg.f6485.2
Applied egg-rr85.2%
*-commutativeN/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
neg-lowering-neg.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f6452.8
Applied egg-rr52.8%
if -1.999999999999994e-310 < A Initial program 75.9%
sqrt-divN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6483.4
Applied egg-rr83.4%
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 (* V l)))) (if (<= t_0 0.0) (* A (/ c0 (sqrt (* V (* A l))))) (* c0 (sqrt t_0)))))
assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = A / (V * l);
double tmp;
if (t_0 <= 0.0) {
tmp = A * (c0 / sqrt((V * (A * l))));
} else {
tmp = c0 * sqrt(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 = a / (v * l)
if (t_0 <= 0.0d0) then
tmp = a * (c0 / sqrt((v * (a * l))))
else
tmp = c0 * sqrt(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 = A / (V * l);
double tmp;
if (t_0 <= 0.0) {
tmp = A * (c0 / Math.sqrt((V * (A * l))));
} else {
tmp = c0 * Math.sqrt(t_0);
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = A / (V * l) tmp = 0 if t_0 <= 0.0: tmp = A * (c0 / math.sqrt((V * (A * l)))) else: tmp = c0 * math.sqrt(t_0) return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = Float64(A / Float64(V * l)) tmp = 0.0 if (t_0 <= 0.0) tmp = Float64(A * Float64(c0 / sqrt(Float64(V * Float64(A * l))))); else tmp = Float64(c0 * sqrt(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 = A / (V * l);
tmp = 0.0;
if (t_0 <= 0.0)
tmp = A * (c0 / sqrt((V * (A * l))));
else
tmp = c0 * sqrt(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[(A / N[(V * l), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 0.0], N[(A * N[(c0 / N[Sqrt[N[(V * N[(A * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(c0 * N[Sqrt[t$95$0], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
t_0 := \frac{A}{V \cdot \ell}\\
\mathbf{if}\;t\_0 \leq 0:\\
\;\;\;\;A \cdot \frac{c0}{\sqrt{V \cdot \left(A \cdot \ell\right)}}\\
\mathbf{else}:\\
\;\;\;\;c0 \cdot \sqrt{t\_0}\\
\end{array}
\end{array}
if (/.f64 A (*.f64 V l)) < 0.0Initial program 33.0%
*-commutativeN/A
/-rgt-identityN/A
associate-/r/N/A
/-lowering-/.f64N/A
/-lowering-/.f6433.0
Applied egg-rr33.0%
associate-/r/N/A
frac-timesN/A
*-commutativeN/A
associate-*l/N/A
sqrt-prodN/A
*-inversesN/A
sqrt-prodN/A
times-fracN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
associate-*r/N/A
sqrt-divN/A
associate-*r/N/A
clear-numN/A
Applied egg-rr54.1%
if 0.0 < (/.f64 A (*.f64 V l)) Initial program 82.2%
Final simplification77.6%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function. (FPCore (c0 A V l) :precision binary64 (* c0 (sqrt (/ A (* V l)))))
assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
return c0 * sqrt((A / (V * l)));
}
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 = c0 * sqrt((a / (v * l)))
end function
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
return c0 * Math.sqrt((A / (V * l)));
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): return c0 * math.sqrt((A / (V * l)))
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) return Float64(c0 * sqrt(Float64(A / Float64(V * l)))) end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp = code(c0, A, V, l)
tmp = c0 * sqrt((A / (V * l)));
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function. code[c0_, A_, V_, l_] := N[(c0 * N[Sqrt[N[(A / N[(V * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
c0 \cdot \sqrt{\frac{A}{V \cdot \ell}}
\end{array}
Initial program 74.1%
herbie shell --seed 2024198
(FPCore (c0 A V l)
:name "Henrywood and Agarwal, Equation (3)"
:precision binary64
(* c0 (sqrt (/ A (* V l)))))