
(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 11 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) -2e-308)
(/ (* (sqrt (- A)) c0) (* (sqrt (- V)) (sqrt l)))
(if (<= (* V l) 1e-309)
(/ c0 (sqrt (* (* (/ -1.0 A) V) (- l))))
(if (<= (* V l) 1e+277)
(* c0 (/ (sqrt A) (sqrt (* l V))))
(/ 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) <= -2e-308) {
tmp = (sqrt(-A) * c0) / (sqrt(-V) * sqrt(l));
} else if ((V * l) <= 1e-309) {
tmp = c0 / sqrt((((-1.0 / A) * V) * -l));
} else if ((V * l) <= 1e+277) {
tmp = c0 * (sqrt(A) / sqrt((l * V)));
} 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 ((v * l) <= (-2d-308)) then
tmp = (sqrt(-a) * c0) / (sqrt(-v) * sqrt(l))
else if ((v * l) <= 1d-309) then
tmp = c0 / sqrt(((((-1.0d0) / a) * v) * -l))
else if ((v * l) <= 1d+277) then
tmp = c0 * (sqrt(a) / sqrt((l * v)))
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 ((V * l) <= -2e-308) {
tmp = (Math.sqrt(-A) * c0) / (Math.sqrt(-V) * Math.sqrt(l));
} else if ((V * l) <= 1e-309) {
tmp = c0 / Math.sqrt((((-1.0 / A) * V) * -l));
} else if ((V * l) <= 1e+277) {
tmp = c0 * (Math.sqrt(A) / Math.sqrt((l * V)));
} 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 (V * l) <= -2e-308: tmp = (math.sqrt(-A) * c0) / (math.sqrt(-V) * math.sqrt(l)) elif (V * l) <= 1e-309: tmp = c0 / math.sqrt((((-1.0 / A) * V) * -l)) elif (V * l) <= 1e+277: tmp = c0 * (math.sqrt(A) / math.sqrt((l * V))) 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(V * l) <= -2e-308) tmp = Float64(Float64(sqrt(Float64(-A)) * c0) / Float64(sqrt(Float64(-V)) * sqrt(l))); elseif (Float64(V * l) <= 1e-309) tmp = Float64(c0 / sqrt(Float64(Float64(Float64(-1.0 / A) * V) * Float64(-l)))); elseif (Float64(V * l) <= 1e+277) tmp = Float64(c0 * Float64(sqrt(A) / sqrt(Float64(l * V)))); 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 ((V * l) <= -2e-308)
tmp = (sqrt(-A) * c0) / (sqrt(-V) * sqrt(l));
elseif ((V * l) <= 1e-309)
tmp = c0 / sqrt((((-1.0 / A) * V) * -l));
elseif ((V * l) <= 1e+277)
tmp = c0 * (sqrt(A) / sqrt((l * V)));
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[(V * l), $MachinePrecision], -2e-308], N[(N[(N[Sqrt[(-A)], $MachinePrecision] * c0), $MachinePrecision] / N[(N[Sqrt[(-V)], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 1e-309], N[(c0 / N[Sqrt[N[(N[(N[(-1.0 / A), $MachinePrecision] * V), $MachinePrecision] * (-l)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 1e+277], N[(c0 * N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $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}\;V \cdot \ell \leq -2 \cdot 10^{-308}:\\
\;\;\;\;\frac{\sqrt{-A} \cdot c0}{\sqrt{-V} \cdot \sqrt{\ell}}\\
\mathbf{elif}\;V \cdot \ell \leq 10^{-309}:\\
\;\;\;\;\frac{c0}{\sqrt{\left(\frac{-1}{A} \cdot V\right) \cdot \left(-\ell\right)}}\\
\mathbf{elif}\;V \cdot \ell \leq 10^{+277}:\\
\;\;\;\;c0 \cdot \frac{\sqrt{A}}{\sqrt{\ell \cdot V}}\\
\mathbf{else}:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{V}{A} \cdot \ell}}\\
\end{array}
\end{array}
if (*.f64 V l) < -1.9999999999999998e-308Initial program 79.5%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6474.4
Applied rewrites74.4%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
lift-sqrt.f64N/A
lift-/.f64N/A
frac-2negN/A
sqrt-divN/A
frac-timesN/A
lift-sqrt.f64N/A
sqrt-prodN/A
distribute-lft-neg-inN/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
distribute-rgt-neg-inN/A
sqrt-prodN/A
lift-sqrt.f64N/A
Applied rewrites88.6%
lift-sqrt.f64N/A
lift-*.f64N/A
sqrt-prodN/A
lift-sqrt.f64N/A
lower-*.f64N/A
lower-sqrt.f6447.7
Applied rewrites47.7%
if -1.9999999999999998e-308 < (*.f64 V l) < 1.000000000000002e-309Initial program 41.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6467.2
Applied rewrites67.2%
lift-/.f64N/A
clear-numN/A
frac-2negN/A
associate-/r/N/A
lower-*.f64N/A
distribute-frac-neg2N/A
distribute-neg-fracN/A
metadata-evalN/A
lower-/.f64N/A
lower-neg.f6467.2
Applied rewrites67.2%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
clear-numN/A
sqrt-divN/A
div-invN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
neg-mul-1N/A
lift-neg.f64N/A
remove-double-negN/A
clear-numN/A
lift-/.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-sqrt.f64N/A
Applied rewrites67.4%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
div-invN/A
*-commutativeN/A
lower-*.f64N/A
metadata-evalN/A
lift-neg.f64N/A
neg-mul-1N/A
associate-/r*N/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
lower-neg.f6467.4
Applied rewrites67.4%
if 1.000000000000002e-309 < (*.f64 V l) < 1e277Initial program 82.2%
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6499.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6499.4
Applied rewrites99.4%
if 1e277 < (*.f64 V l) Initial program 36.7%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6464.3
Applied rewrites64.3%
lift-/.f64N/A
clear-numN/A
frac-2negN/A
associate-/r/N/A
lower-*.f64N/A
distribute-frac-neg2N/A
distribute-neg-fracN/A
metadata-evalN/A
lower-/.f64N/A
lower-neg.f6464.3
Applied rewrites64.3%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
clear-numN/A
sqrt-divN/A
div-invN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
neg-mul-1N/A
lift-neg.f64N/A
remove-double-negN/A
clear-numN/A
lift-/.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-sqrt.f64N/A
Applied rewrites64.5%
Final simplification70.9%
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 (/ A (* V l))))))
(if (<= t_0 0.0)
(* c0 (sqrt (/ (/ A V) l)))
(if (<= t_0 1e+252) t_0 (/ 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 = c0 * sqrt((A / (V * l)));
double tmp;
if (t_0 <= 0.0) {
tmp = c0 * sqrt(((A / V) / l));
} else if (t_0 <= 1e+252) {
tmp = t_0;
} 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 = c0 * sqrt((a / (v * l)))
if (t_0 <= 0.0d0) then
tmp = c0 * sqrt(((a / v) / l))
else if (t_0 <= 1d+252) then
tmp = t_0
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 = c0 * Math.sqrt((A / (V * l)));
double tmp;
if (t_0 <= 0.0) {
tmp = c0 * Math.sqrt(((A / V) / l));
} else if (t_0 <= 1e+252) {
tmp = t_0;
} 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 = c0 * math.sqrt((A / (V * l))) tmp = 0 if t_0 <= 0.0: tmp = c0 * math.sqrt(((A / V) / l)) elif t_0 <= 1e+252: tmp = t_0 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(c0 * sqrt(Float64(A / Float64(V * l)))) tmp = 0.0 if (t_0 <= 0.0) tmp = Float64(c0 * sqrt(Float64(Float64(A / V) / l))); elseif (t_0 <= 1e+252) tmp = t_0; 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 = c0 * sqrt((A / (V * l)));
tmp = 0.0;
if (t_0 <= 0.0)
tmp = c0 * sqrt(((A / V) / l));
elseif (t_0 <= 1e+252)
tmp = t_0;
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[(c0 * N[Sqrt[N[(A / N[(V * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 0.0], N[(c0 * N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 1e+252], t$95$0, 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 := c0 \cdot \sqrt{\frac{A}{V \cdot \ell}}\\
\mathbf{if}\;t\_0 \leq 0:\\
\;\;\;\;c0 \cdot \sqrt{\frac{\frac{A}{V}}{\ell}}\\
\mathbf{elif}\;t\_0 \leq 10^{+252}:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{V}{A} \cdot \ell}}\\
\end{array}
\end{array}
if (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) < 0.0Initial program 67.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6471.4
Applied rewrites71.4%
if 0.0 < (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) < 1.0000000000000001e252Initial program 97.4%
if 1.0000000000000001e252 < (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) Initial program 37.4%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6454.2
Applied rewrites54.2%
lift-/.f64N/A
clear-numN/A
frac-2negN/A
associate-/r/N/A
lower-*.f64N/A
distribute-frac-neg2N/A
distribute-neg-fracN/A
metadata-evalN/A
lower-/.f64N/A
lower-neg.f6454.1
Applied rewrites54.1%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
clear-numN/A
sqrt-divN/A
div-invN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
neg-mul-1N/A
lift-neg.f64N/A
remove-double-negN/A
clear-numN/A
lift-/.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-sqrt.f64N/A
Applied rewrites54.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 (/ A (* V l))))))
(if (<= t_0 0.0)
(* c0 (sqrt (/ (/ A V) l)))
(if (<= t_0 1e+252) 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 = c0 * sqrt((A / (V * l)));
double tmp;
if (t_0 <= 0.0) {
tmp = c0 * sqrt(((A / V) / l));
} else if (t_0 <= 1e+252) {
tmp = 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 = c0 * sqrt((a / (v * l)))
if (t_0 <= 0.0d0) then
tmp = c0 * sqrt(((a / v) / l))
else if (t_0 <= 1d+252) then
tmp = 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 = c0 * Math.sqrt((A / (V * l)));
double tmp;
if (t_0 <= 0.0) {
tmp = c0 * Math.sqrt(((A / V) / l));
} else if (t_0 <= 1e+252) {
tmp = 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 = c0 * math.sqrt((A / (V * l))) tmp = 0 if t_0 <= 0.0: tmp = c0 * math.sqrt(((A / V) / l)) elif t_0 <= 1e+252: tmp = 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(c0 * sqrt(Float64(A / Float64(V * l)))) tmp = 0.0 if (t_0 <= 0.0) tmp = Float64(c0 * sqrt(Float64(Float64(A / V) / l))); elseif (t_0 <= 1e+252) tmp = 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 = c0 * sqrt((A / (V * l)));
tmp = 0.0;
if (t_0 <= 0.0)
tmp = c0 * sqrt(((A / V) / l));
elseif (t_0 <= 1e+252)
tmp = 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[(c0 * N[Sqrt[N[(A / N[(V * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 0.0], N[(c0 * N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 1e+252], t$95$0, 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 := c0 \cdot \sqrt{\frac{A}{V \cdot \ell}}\\
\mathbf{if}\;t\_0 \leq 0:\\
\;\;\;\;c0 \cdot \sqrt{\frac{\frac{A}{V}}{\ell}}\\
\mathbf{elif}\;t\_0 \leq 10^{+252}:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;c0 \cdot \sqrt{\frac{\frac{A}{\ell}}{V}}\\
\end{array}
\end{array}
if (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) < 0.0Initial program 67.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6471.4
Applied rewrites71.4%
if 0.0 < (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) < 1.0000000000000001e252Initial program 97.4%
if 1.0000000000000001e252 < (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) Initial program 37.4%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6454.2
Applied rewrites54.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) (- INFINITY))
(* c0 (/ (sqrt (/ (- A) l)) (sqrt (- V))))
(if (<= (* V l) -2e-308)
(* c0 (* (sqrt (- A)) (sqrt (/ -1.0 (* V l)))))
(if (<= (* V l) 1e-309)
(/ c0 (sqrt (* (* (/ -1.0 A) V) (- l))))
(if (<= (* V l) 1e+277)
(* c0 (/ (sqrt A) (sqrt (* l V))))
(/ 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) <= -((double) INFINITY)) {
tmp = c0 * (sqrt((-A / l)) / sqrt(-V));
} else if ((V * l) <= -2e-308) {
tmp = c0 * (sqrt(-A) * sqrt((-1.0 / (V * l))));
} else if ((V * l) <= 1e-309) {
tmp = c0 / sqrt((((-1.0 / A) * V) * -l));
} else if ((V * l) <= 1e+277) {
tmp = c0 * (sqrt(A) / sqrt((l * V)));
} else {
tmp = c0 / sqrt(((V / A) * l));
}
return tmp;
}
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double tmp;
if ((V * l) <= -Double.POSITIVE_INFINITY) {
tmp = c0 * (Math.sqrt((-A / l)) / Math.sqrt(-V));
} else if ((V * l) <= -2e-308) {
tmp = c0 * (Math.sqrt(-A) * Math.sqrt((-1.0 / (V * l))));
} else if ((V * l) <= 1e-309) {
tmp = c0 / Math.sqrt((((-1.0 / A) * V) * -l));
} else if ((V * l) <= 1e+277) {
tmp = c0 * (Math.sqrt(A) / Math.sqrt((l * V)));
} 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 (V * l) <= -math.inf: tmp = c0 * (math.sqrt((-A / l)) / math.sqrt(-V)) elif (V * l) <= -2e-308: tmp = c0 * (math.sqrt(-A) * math.sqrt((-1.0 / (V * l)))) elif (V * l) <= 1e-309: tmp = c0 / math.sqrt((((-1.0 / A) * V) * -l)) elif (V * l) <= 1e+277: tmp = c0 * (math.sqrt(A) / math.sqrt((l * V))) 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(V * l) <= Float64(-Inf)) tmp = Float64(c0 * Float64(sqrt(Float64(Float64(-A) / l)) / sqrt(Float64(-V)))); elseif (Float64(V * l) <= -2e-308) tmp = Float64(c0 * Float64(sqrt(Float64(-A)) * sqrt(Float64(-1.0 / Float64(V * l))))); elseif (Float64(V * l) <= 1e-309) tmp = Float64(c0 / sqrt(Float64(Float64(Float64(-1.0 / A) * V) * Float64(-l)))); elseif (Float64(V * l) <= 1e+277) tmp = Float64(c0 * Float64(sqrt(A) / sqrt(Float64(l * V)))); 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 ((V * l) <= -Inf)
tmp = c0 * (sqrt((-A / l)) / sqrt(-V));
elseif ((V * l) <= -2e-308)
tmp = c0 * (sqrt(-A) * sqrt((-1.0 / (V * l))));
elseif ((V * l) <= 1e-309)
tmp = c0 / sqrt((((-1.0 / A) * V) * -l));
elseif ((V * l) <= 1e+277)
tmp = c0 * (sqrt(A) / sqrt((l * V)));
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[(V * l), $MachinePrecision], (-Infinity)], N[(c0 * N[(N[Sqrt[N[((-A) / l), $MachinePrecision]], $MachinePrecision] / N[Sqrt[(-V)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], -2e-308], 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-309], N[(c0 / N[Sqrt[N[(N[(N[(-1.0 / A), $MachinePrecision] * V), $MachinePrecision] * (-l)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 1e+277], N[(c0 * N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $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}\;V \cdot \ell \leq -\infty:\\
\;\;\;\;c0 \cdot \frac{\sqrt{\frac{-A}{\ell}}}{\sqrt{-V}}\\
\mathbf{elif}\;V \cdot \ell \leq -2 \cdot 10^{-308}:\\
\;\;\;\;c0 \cdot \left(\sqrt{-A} \cdot \sqrt{\frac{-1}{V \cdot \ell}}\right)\\
\mathbf{elif}\;V \cdot \ell \leq 10^{-309}:\\
\;\;\;\;\frac{c0}{\sqrt{\left(\frac{-1}{A} \cdot V\right) \cdot \left(-\ell\right)}}\\
\mathbf{elif}\;V \cdot \ell \leq 10^{+277}:\\
\;\;\;\;c0 \cdot \frac{\sqrt{A}}{\sqrt{\ell \cdot V}}\\
\mathbf{else}:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{V}{A} \cdot \ell}}\\
\end{array}
\end{array}
if (*.f64 V l) < -inf.0Initial program 41.4%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6466.9
Applied rewrites66.9%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r*N/A
associate-/l/N/A
lift-/.f64N/A
frac-2negN/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lift-/.f64N/A
distribute-neg-fracN/A
lower-/.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-neg.f6431.7
Applied rewrites31.7%
if -inf.0 < (*.f64 V l) < -1.9999999999999998e-308Initial program 86.5%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6475.9
Applied rewrites75.9%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r*N/A
associate-/l/N/A
lift-/.f64N/A
lift-/.f64N/A
frac-2negN/A
div-invN/A
associate-/l*N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
distribute-frac-neg2N/A
distribute-neg-fracN/A
metadata-evalN/A
lower-/.f6499.5
Applied rewrites99.5%
Applied rewrites99.5%
if -1.9999999999999998e-308 < (*.f64 V l) < 1.000000000000002e-309Initial program 41.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6467.2
Applied rewrites67.2%
lift-/.f64N/A
clear-numN/A
frac-2negN/A
associate-/r/N/A
lower-*.f64N/A
distribute-frac-neg2N/A
distribute-neg-fracN/A
metadata-evalN/A
lower-/.f64N/A
lower-neg.f6467.2
Applied rewrites67.2%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
clear-numN/A
sqrt-divN/A
div-invN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
neg-mul-1N/A
lift-neg.f64N/A
remove-double-negN/A
clear-numN/A
lift-/.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-sqrt.f64N/A
Applied rewrites67.4%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
div-invN/A
*-commutativeN/A
lower-*.f64N/A
metadata-evalN/A
lift-neg.f64N/A
neg-mul-1N/A
associate-/r*N/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
lower-neg.f6467.4
Applied rewrites67.4%
if 1.000000000000002e-309 < (*.f64 V l) < 1e277Initial program 82.2%
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6499.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6499.4
Applied rewrites99.4%
if 1e277 < (*.f64 V l) Initial program 36.7%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6464.3
Applied rewrites64.3%
lift-/.f64N/A
clear-numN/A
frac-2negN/A
associate-/r/N/A
lower-*.f64N/A
distribute-frac-neg2N/A
distribute-neg-fracN/A
metadata-evalN/A
lower-/.f64N/A
lower-neg.f6464.3
Applied rewrites64.3%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
clear-numN/A
sqrt-divN/A
div-invN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
neg-mul-1N/A
lift-neg.f64N/A
remove-double-negN/A
clear-numN/A
lift-/.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-sqrt.f64N/A
Applied rewrites64.5%
Final simplification87.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) (- INFINITY))
(/ c0 (* (sqrt (/ V A)) (sqrt l)))
(if (<= (* V l) -2e-308)
(* c0 (* (sqrt (- A)) (sqrt (/ -1.0 (* V l)))))
(if (<= (* V l) 1e-309)
(/ c0 (sqrt (* (* (/ -1.0 A) V) (- l))))
(if (<= (* V l) 1e+277)
(* c0 (/ (sqrt A) (sqrt (* l V))))
(/ 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) <= -((double) INFINITY)) {
tmp = c0 / (sqrt((V / A)) * sqrt(l));
} else if ((V * l) <= -2e-308) {
tmp = c0 * (sqrt(-A) * sqrt((-1.0 / (V * l))));
} else if ((V * l) <= 1e-309) {
tmp = c0 / sqrt((((-1.0 / A) * V) * -l));
} else if ((V * l) <= 1e+277) {
tmp = c0 * (sqrt(A) / sqrt((l * V)));
} else {
tmp = c0 / sqrt(((V / A) * l));
}
return tmp;
}
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double tmp;
if ((V * l) <= -Double.POSITIVE_INFINITY) {
tmp = c0 / (Math.sqrt((V / A)) * Math.sqrt(l));
} else if ((V * l) <= -2e-308) {
tmp = c0 * (Math.sqrt(-A) * Math.sqrt((-1.0 / (V * l))));
} else if ((V * l) <= 1e-309) {
tmp = c0 / Math.sqrt((((-1.0 / A) * V) * -l));
} else if ((V * l) <= 1e+277) {
tmp = c0 * (Math.sqrt(A) / Math.sqrt((l * V)));
} 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 (V * l) <= -math.inf: tmp = c0 / (math.sqrt((V / A)) * math.sqrt(l)) elif (V * l) <= -2e-308: tmp = c0 * (math.sqrt(-A) * math.sqrt((-1.0 / (V * l)))) elif (V * l) <= 1e-309: tmp = c0 / math.sqrt((((-1.0 / A) * V) * -l)) elif (V * l) <= 1e+277: tmp = c0 * (math.sqrt(A) / math.sqrt((l * V))) 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(V * l) <= Float64(-Inf)) tmp = Float64(c0 / Float64(sqrt(Float64(V / A)) * sqrt(l))); elseif (Float64(V * l) <= -2e-308) tmp = Float64(c0 * Float64(sqrt(Float64(-A)) * sqrt(Float64(-1.0 / Float64(V * l))))); elseif (Float64(V * l) <= 1e-309) tmp = Float64(c0 / sqrt(Float64(Float64(Float64(-1.0 / A) * V) * Float64(-l)))); elseif (Float64(V * l) <= 1e+277) tmp = Float64(c0 * Float64(sqrt(A) / sqrt(Float64(l * V)))); 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 ((V * l) <= -Inf)
tmp = c0 / (sqrt((V / A)) * sqrt(l));
elseif ((V * l) <= -2e-308)
tmp = c0 * (sqrt(-A) * sqrt((-1.0 / (V * l))));
elseif ((V * l) <= 1e-309)
tmp = c0 / sqrt((((-1.0 / A) * V) * -l));
elseif ((V * l) <= 1e+277)
tmp = c0 * (sqrt(A) / sqrt((l * V)));
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[(V * l), $MachinePrecision], (-Infinity)], N[(c0 / N[(N[Sqrt[N[(V / A), $MachinePrecision]], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], -2e-308], 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-309], N[(c0 / N[Sqrt[N[(N[(N[(-1.0 / A), $MachinePrecision] * V), $MachinePrecision] * (-l)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 1e+277], N[(c0 * N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $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}\;V \cdot \ell \leq -\infty:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{V}{A}} \cdot \sqrt{\ell}}\\
\mathbf{elif}\;V \cdot \ell \leq -2 \cdot 10^{-308}:\\
\;\;\;\;c0 \cdot \left(\sqrt{-A} \cdot \sqrt{\frac{-1}{V \cdot \ell}}\right)\\
\mathbf{elif}\;V \cdot \ell \leq 10^{-309}:\\
\;\;\;\;\frac{c0}{\sqrt{\left(\frac{-1}{A} \cdot V\right) \cdot \left(-\ell\right)}}\\
\mathbf{elif}\;V \cdot \ell \leq 10^{+277}:\\
\;\;\;\;c0 \cdot \frac{\sqrt{A}}{\sqrt{\ell \cdot V}}\\
\mathbf{else}:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{V}{A} \cdot \ell}}\\
\end{array}
\end{array}
if (*.f64 V l) < -inf.0Initial program 41.4%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6466.9
Applied rewrites66.9%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
associate-*r/N/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
lift-sqrt.f64N/A
div-invN/A
associate-/r*N/A
lower-/.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
lift-/.f64N/A
clear-numN/A
lift-/.f64N/A
Applied rewrites64.3%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
frac-2negN/A
distribute-rgt-neg-outN/A
lift-neg.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-neg.f64N/A
sqrt-divN/A
lift-*.f64N/A
sqrt-prodN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
associate-*l/N/A
lower-*.f64N/A
Applied rewrites31.7%
if -inf.0 < (*.f64 V l) < -1.9999999999999998e-308Initial program 86.5%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6475.9
Applied rewrites75.9%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r*N/A
associate-/l/N/A
lift-/.f64N/A
lift-/.f64N/A
frac-2negN/A
div-invN/A
associate-/l*N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
distribute-frac-neg2N/A
distribute-neg-fracN/A
metadata-evalN/A
lower-/.f6499.5
Applied rewrites99.5%
Applied rewrites99.5%
if -1.9999999999999998e-308 < (*.f64 V l) < 1.000000000000002e-309Initial program 41.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6467.2
Applied rewrites67.2%
lift-/.f64N/A
clear-numN/A
frac-2negN/A
associate-/r/N/A
lower-*.f64N/A
distribute-frac-neg2N/A
distribute-neg-fracN/A
metadata-evalN/A
lower-/.f64N/A
lower-neg.f6467.2
Applied rewrites67.2%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
clear-numN/A
sqrt-divN/A
div-invN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
neg-mul-1N/A
lift-neg.f64N/A
remove-double-negN/A
clear-numN/A
lift-/.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-sqrt.f64N/A
Applied rewrites67.4%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
div-invN/A
*-commutativeN/A
lower-*.f64N/A
metadata-evalN/A
lift-neg.f64N/A
neg-mul-1N/A
associate-/r*N/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
lower-neg.f6467.4
Applied rewrites67.4%
if 1.000000000000002e-309 < (*.f64 V l) < 1e277Initial program 82.2%
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6499.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6499.4
Applied rewrites99.4%
if 1e277 < (*.f64 V l) Initial program 36.7%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6464.3
Applied rewrites64.3%
lift-/.f64N/A
clear-numN/A
frac-2negN/A
associate-/r/N/A
lower-*.f64N/A
distribute-frac-neg2N/A
distribute-neg-fracN/A
metadata-evalN/A
lower-/.f64N/A
lower-neg.f6464.3
Applied rewrites64.3%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
clear-numN/A
sqrt-divN/A
div-invN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
neg-mul-1N/A
lift-neg.f64N/A
remove-double-negN/A
clear-numN/A
lift-/.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-sqrt.f64N/A
Applied rewrites64.5%
Final simplification87.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) (- INFINITY))
(/ c0 (* (sqrt (/ V A)) (sqrt l)))
(if (<= (* V l) -2e-308)
(/ (* (sqrt (- A)) c0) (sqrt (* (- V) l)))
(if (<= (* V l) 1e-309)
(/ c0 (sqrt (* (* (/ -1.0 A) V) (- l))))
(if (<= (* V l) 1e+277)
(* c0 (/ (sqrt A) (sqrt (* l V))))
(/ 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) <= -((double) INFINITY)) {
tmp = c0 / (sqrt((V / A)) * sqrt(l));
} else if ((V * l) <= -2e-308) {
tmp = (sqrt(-A) * c0) / sqrt((-V * l));
} else if ((V * l) <= 1e-309) {
tmp = c0 / sqrt((((-1.0 / A) * V) * -l));
} else if ((V * l) <= 1e+277) {
tmp = c0 * (sqrt(A) / sqrt((l * V)));
} else {
tmp = c0 / sqrt(((V / A) * l));
}
return tmp;
}
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double tmp;
if ((V * l) <= -Double.POSITIVE_INFINITY) {
tmp = c0 / (Math.sqrt((V / A)) * Math.sqrt(l));
} else if ((V * l) <= -2e-308) {
tmp = (Math.sqrt(-A) * c0) / Math.sqrt((-V * l));
} else if ((V * l) <= 1e-309) {
tmp = c0 / Math.sqrt((((-1.0 / A) * V) * -l));
} else if ((V * l) <= 1e+277) {
tmp = c0 * (Math.sqrt(A) / Math.sqrt((l * V)));
} 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 (V * l) <= -math.inf: tmp = c0 / (math.sqrt((V / A)) * math.sqrt(l)) elif (V * l) <= -2e-308: tmp = (math.sqrt(-A) * c0) / math.sqrt((-V * l)) elif (V * l) <= 1e-309: tmp = c0 / math.sqrt((((-1.0 / A) * V) * -l)) elif (V * l) <= 1e+277: tmp = c0 * (math.sqrt(A) / math.sqrt((l * V))) 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(V * l) <= Float64(-Inf)) tmp = Float64(c0 / Float64(sqrt(Float64(V / A)) * sqrt(l))); elseif (Float64(V * l) <= -2e-308) tmp = Float64(Float64(sqrt(Float64(-A)) * c0) / sqrt(Float64(Float64(-V) * l))); elseif (Float64(V * l) <= 1e-309) tmp = Float64(c0 / sqrt(Float64(Float64(Float64(-1.0 / A) * V) * Float64(-l)))); elseif (Float64(V * l) <= 1e+277) tmp = Float64(c0 * Float64(sqrt(A) / sqrt(Float64(l * V)))); 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 ((V * l) <= -Inf)
tmp = c0 / (sqrt((V / A)) * sqrt(l));
elseif ((V * l) <= -2e-308)
tmp = (sqrt(-A) * c0) / sqrt((-V * l));
elseif ((V * l) <= 1e-309)
tmp = c0 / sqrt((((-1.0 / A) * V) * -l));
elseif ((V * l) <= 1e+277)
tmp = c0 * (sqrt(A) / sqrt((l * V)));
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[(V * l), $MachinePrecision], (-Infinity)], N[(c0 / N[(N[Sqrt[N[(V / A), $MachinePrecision]], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], -2e-308], N[(N[(N[Sqrt[(-A)], $MachinePrecision] * c0), $MachinePrecision] / N[Sqrt[N[((-V) * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 1e-309], N[(c0 / N[Sqrt[N[(N[(N[(-1.0 / A), $MachinePrecision] * V), $MachinePrecision] * (-l)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 1e+277], N[(c0 * N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $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}\;V \cdot \ell \leq -\infty:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{V}{A}} \cdot \sqrt{\ell}}\\
\mathbf{elif}\;V \cdot \ell \leq -2 \cdot 10^{-308}:\\
\;\;\;\;\frac{\sqrt{-A} \cdot c0}{\sqrt{\left(-V\right) \cdot \ell}}\\
\mathbf{elif}\;V \cdot \ell \leq 10^{-309}:\\
\;\;\;\;\frac{c0}{\sqrt{\left(\frac{-1}{A} \cdot V\right) \cdot \left(-\ell\right)}}\\
\mathbf{elif}\;V \cdot \ell \leq 10^{+277}:\\
\;\;\;\;c0 \cdot \frac{\sqrt{A}}{\sqrt{\ell \cdot V}}\\
\mathbf{else}:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{V}{A} \cdot \ell}}\\
\end{array}
\end{array}
if (*.f64 V l) < -inf.0Initial program 41.4%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6466.9
Applied rewrites66.9%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
associate-*r/N/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
lift-sqrt.f64N/A
div-invN/A
associate-/r*N/A
lower-/.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
lift-/.f64N/A
clear-numN/A
lift-/.f64N/A
Applied rewrites64.3%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
frac-2negN/A
distribute-rgt-neg-outN/A
lift-neg.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-neg.f64N/A
sqrt-divN/A
lift-*.f64N/A
sqrt-prodN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
associate-*l/N/A
lower-*.f64N/A
Applied rewrites31.7%
if -inf.0 < (*.f64 V l) < -1.9999999999999998e-308Initial program 86.5%
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
lift-sqrt.f64N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
lift-sqrt.f64N/A
lift-/.f64N/A
frac-2negN/A
sqrt-divN/A
frac-timesN/A
lift-sqrt.f64N/A
sqrt-prodN/A
distribute-lft-neg-inN/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
distribute-rgt-neg-inN/A
sqrt-prodN/A
lift-sqrt.f64N/A
Applied rewrites97.3%
if -1.9999999999999998e-308 < (*.f64 V l) < 1.000000000000002e-309Initial program 41.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6467.2
Applied rewrites67.2%
lift-/.f64N/A
clear-numN/A
frac-2negN/A
associate-/r/N/A
lower-*.f64N/A
distribute-frac-neg2N/A
distribute-neg-fracN/A
metadata-evalN/A
lower-/.f64N/A
lower-neg.f6467.2
Applied rewrites67.2%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
clear-numN/A
sqrt-divN/A
div-invN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
neg-mul-1N/A
lift-neg.f64N/A
remove-double-negN/A
clear-numN/A
lift-/.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-sqrt.f64N/A
Applied rewrites67.4%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
div-invN/A
*-commutativeN/A
lower-*.f64N/A
metadata-evalN/A
lift-neg.f64N/A
neg-mul-1N/A
associate-/r*N/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
lower-neg.f6467.4
Applied rewrites67.4%
if 1.000000000000002e-309 < (*.f64 V l) < 1e277Initial program 82.2%
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6499.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6499.4
Applied rewrites99.4%
if 1e277 < (*.f64 V l) Initial program 36.7%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6464.3
Applied rewrites64.3%
lift-/.f64N/A
clear-numN/A
frac-2negN/A
associate-/r/N/A
lower-*.f64N/A
distribute-frac-neg2N/A
distribute-neg-fracN/A
metadata-evalN/A
lower-/.f64N/A
lower-neg.f6464.3
Applied rewrites64.3%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
clear-numN/A
sqrt-divN/A
div-invN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
neg-mul-1N/A
lift-neg.f64N/A
remove-double-negN/A
clear-numN/A
lift-/.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-sqrt.f64N/A
Applied rewrites64.5%
Final simplification86.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 (<= (* V l) (- INFINITY))
(* c0 (sqrt (/ (* (/ -1.0 l) A) (- V))))
(if (<= (* V l) -2e-308)
(/ (* (sqrt (- A)) c0) (sqrt (* (- V) l)))
(if (<= (* V l) 1e-309)
(/ c0 (sqrt (* (* (/ -1.0 A) V) (- l))))
(if (<= (* V l) 1e+277)
(* c0 (/ (sqrt A) (sqrt (* l V))))
(/ 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) <= -((double) INFINITY)) {
tmp = c0 * sqrt((((-1.0 / l) * A) / -V));
} else if ((V * l) <= -2e-308) {
tmp = (sqrt(-A) * c0) / sqrt((-V * l));
} else if ((V * l) <= 1e-309) {
tmp = c0 / sqrt((((-1.0 / A) * V) * -l));
} else if ((V * l) <= 1e+277) {
tmp = c0 * (sqrt(A) / sqrt((l * V)));
} else {
tmp = c0 / sqrt(((V / A) * l));
}
return tmp;
}
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double tmp;
if ((V * l) <= -Double.POSITIVE_INFINITY) {
tmp = c0 * Math.sqrt((((-1.0 / l) * A) / -V));
} else if ((V * l) <= -2e-308) {
tmp = (Math.sqrt(-A) * c0) / Math.sqrt((-V * l));
} else if ((V * l) <= 1e-309) {
tmp = c0 / Math.sqrt((((-1.0 / A) * V) * -l));
} else if ((V * l) <= 1e+277) {
tmp = c0 * (Math.sqrt(A) / Math.sqrt((l * V)));
} 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 (V * l) <= -math.inf: tmp = c0 * math.sqrt((((-1.0 / l) * A) / -V)) elif (V * l) <= -2e-308: tmp = (math.sqrt(-A) * c0) / math.sqrt((-V * l)) elif (V * l) <= 1e-309: tmp = c0 / math.sqrt((((-1.0 / A) * V) * -l)) elif (V * l) <= 1e+277: tmp = c0 * (math.sqrt(A) / math.sqrt((l * V))) 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(V * l) <= Float64(-Inf)) tmp = Float64(c0 * sqrt(Float64(Float64(Float64(-1.0 / l) * A) / Float64(-V)))); elseif (Float64(V * l) <= -2e-308) tmp = Float64(Float64(sqrt(Float64(-A)) * c0) / sqrt(Float64(Float64(-V) * l))); elseif (Float64(V * l) <= 1e-309) tmp = Float64(c0 / sqrt(Float64(Float64(Float64(-1.0 / A) * V) * Float64(-l)))); elseif (Float64(V * l) <= 1e+277) tmp = Float64(c0 * Float64(sqrt(A) / sqrt(Float64(l * V)))); 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 ((V * l) <= -Inf)
tmp = c0 * sqrt((((-1.0 / l) * A) / -V));
elseif ((V * l) <= -2e-308)
tmp = (sqrt(-A) * c0) / sqrt((-V * l));
elseif ((V * l) <= 1e-309)
tmp = c0 / sqrt((((-1.0 / A) * V) * -l));
elseif ((V * l) <= 1e+277)
tmp = c0 * (sqrt(A) / sqrt((l * V)));
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[(V * l), $MachinePrecision], (-Infinity)], N[(c0 * N[Sqrt[N[(N[(N[(-1.0 / l), $MachinePrecision] * A), $MachinePrecision] / (-V)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], -2e-308], N[(N[(N[Sqrt[(-A)], $MachinePrecision] * c0), $MachinePrecision] / N[Sqrt[N[((-V) * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 1e-309], N[(c0 / N[Sqrt[N[(N[(N[(-1.0 / A), $MachinePrecision] * V), $MachinePrecision] * (-l)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 1e+277], N[(c0 * N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $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}\;V \cdot \ell \leq -\infty:\\
\;\;\;\;c0 \cdot \sqrt{\frac{\frac{-1}{\ell} \cdot A}{-V}}\\
\mathbf{elif}\;V \cdot \ell \leq -2 \cdot 10^{-308}:\\
\;\;\;\;\frac{\sqrt{-A} \cdot c0}{\sqrt{\left(-V\right) \cdot \ell}}\\
\mathbf{elif}\;V \cdot \ell \leq 10^{-309}:\\
\;\;\;\;\frac{c0}{\sqrt{\left(\frac{-1}{A} \cdot V\right) \cdot \left(-\ell\right)}}\\
\mathbf{elif}\;V \cdot \ell \leq 10^{+277}:\\
\;\;\;\;c0 \cdot \frac{\sqrt{A}}{\sqrt{\ell \cdot V}}\\
\mathbf{else}:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{V}{A} \cdot \ell}}\\
\end{array}
\end{array}
if (*.f64 V l) < -inf.0Initial program 41.4%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6466.9
Applied rewrites66.9%
lift-/.f64N/A
clear-numN/A
frac-2negN/A
associate-/r/N/A
lower-*.f64N/A
distribute-frac-neg2N/A
distribute-neg-fracN/A
metadata-evalN/A
lower-/.f64N/A
lower-neg.f6466.9
Applied rewrites66.9%
if -inf.0 < (*.f64 V l) < -1.9999999999999998e-308Initial program 86.5%
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
lift-sqrt.f64N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
lift-sqrt.f64N/A
lift-/.f64N/A
frac-2negN/A
sqrt-divN/A
frac-timesN/A
lift-sqrt.f64N/A
sqrt-prodN/A
distribute-lft-neg-inN/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
distribute-rgt-neg-inN/A
sqrt-prodN/A
lift-sqrt.f64N/A
Applied rewrites97.3%
if -1.9999999999999998e-308 < (*.f64 V l) < 1.000000000000002e-309Initial program 41.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6467.2
Applied rewrites67.2%
lift-/.f64N/A
clear-numN/A
frac-2negN/A
associate-/r/N/A
lower-*.f64N/A
distribute-frac-neg2N/A
distribute-neg-fracN/A
metadata-evalN/A
lower-/.f64N/A
lower-neg.f6467.2
Applied rewrites67.2%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
clear-numN/A
sqrt-divN/A
div-invN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
neg-mul-1N/A
lift-neg.f64N/A
remove-double-negN/A
clear-numN/A
lift-/.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-sqrt.f64N/A
Applied rewrites67.4%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
div-invN/A
*-commutativeN/A
lower-*.f64N/A
metadata-evalN/A
lift-neg.f64N/A
neg-mul-1N/A
associate-/r*N/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
lower-neg.f6467.4
Applied rewrites67.4%
if 1.000000000000002e-309 < (*.f64 V l) < 1e277Initial program 82.2%
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6499.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6499.4
Applied rewrites99.4%
if 1e277 < (*.f64 V l) Initial program 36.7%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6464.3
Applied rewrites64.3%
lift-/.f64N/A
clear-numN/A
frac-2negN/A
associate-/r/N/A
lower-*.f64N/A
distribute-frac-neg2N/A
distribute-neg-fracN/A
metadata-evalN/A
lower-/.f64N/A
lower-neg.f6464.3
Applied rewrites64.3%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
clear-numN/A
sqrt-divN/A
div-invN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
neg-mul-1N/A
lift-neg.f64N/A
remove-double-negN/A
clear-numN/A
lift-/.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-sqrt.f64N/A
Applied rewrites64.5%
Final simplification88.7%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
:precision binary64
(if (<= (* V l) (- INFINITY))
(* c0 (sqrt (/ (* (/ -1.0 l) A) (- V))))
(if (<= (* V l) -2e-308)
(* (/ c0 (sqrt (* (- l) V))) (sqrt (- A)))
(if (<= (* V l) 1e-309)
(/ c0 (sqrt (* (* (/ -1.0 A) V) (- l))))
(if (<= (* V l) 1e+277)
(* c0 (/ (sqrt A) (sqrt (* l V))))
(/ 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) <= -((double) INFINITY)) {
tmp = c0 * sqrt((((-1.0 / l) * A) / -V));
} else if ((V * l) <= -2e-308) {
tmp = (c0 / sqrt((-l * V))) * sqrt(-A);
} else if ((V * l) <= 1e-309) {
tmp = c0 / sqrt((((-1.0 / A) * V) * -l));
} else if ((V * l) <= 1e+277) {
tmp = c0 * (sqrt(A) / sqrt((l * V)));
} else {
tmp = c0 / sqrt(((V / A) * l));
}
return tmp;
}
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double tmp;
if ((V * l) <= -Double.POSITIVE_INFINITY) {
tmp = c0 * Math.sqrt((((-1.0 / l) * A) / -V));
} else if ((V * l) <= -2e-308) {
tmp = (c0 / Math.sqrt((-l * V))) * Math.sqrt(-A);
} else if ((V * l) <= 1e-309) {
tmp = c0 / Math.sqrt((((-1.0 / A) * V) * -l));
} else if ((V * l) <= 1e+277) {
tmp = c0 * (Math.sqrt(A) / Math.sqrt((l * V)));
} 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 (V * l) <= -math.inf: tmp = c0 * math.sqrt((((-1.0 / l) * A) / -V)) elif (V * l) <= -2e-308: tmp = (c0 / math.sqrt((-l * V))) * math.sqrt(-A) elif (V * l) <= 1e-309: tmp = c0 / math.sqrt((((-1.0 / A) * V) * -l)) elif (V * l) <= 1e+277: tmp = c0 * (math.sqrt(A) / math.sqrt((l * V))) 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(V * l) <= Float64(-Inf)) tmp = Float64(c0 * sqrt(Float64(Float64(Float64(-1.0 / l) * A) / Float64(-V)))); elseif (Float64(V * l) <= -2e-308) tmp = Float64(Float64(c0 / sqrt(Float64(Float64(-l) * V))) * sqrt(Float64(-A))); elseif (Float64(V * l) <= 1e-309) tmp = Float64(c0 / sqrt(Float64(Float64(Float64(-1.0 / A) * V) * Float64(-l)))); elseif (Float64(V * l) <= 1e+277) tmp = Float64(c0 * Float64(sqrt(A) / sqrt(Float64(l * V)))); 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 ((V * l) <= -Inf)
tmp = c0 * sqrt((((-1.0 / l) * A) / -V));
elseif ((V * l) <= -2e-308)
tmp = (c0 / sqrt((-l * V))) * sqrt(-A);
elseif ((V * l) <= 1e-309)
tmp = c0 / sqrt((((-1.0 / A) * V) * -l));
elseif ((V * l) <= 1e+277)
tmp = c0 * (sqrt(A) / sqrt((l * V)));
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[(V * l), $MachinePrecision], (-Infinity)], N[(c0 * N[Sqrt[N[(N[(N[(-1.0 / l), $MachinePrecision] * A), $MachinePrecision] / (-V)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], -2e-308], N[(N[(c0 / N[Sqrt[N[((-l) * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[(-A)], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 1e-309], N[(c0 / N[Sqrt[N[(N[(N[(-1.0 / A), $MachinePrecision] * V), $MachinePrecision] * (-l)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 1e+277], N[(c0 * N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $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}\;V \cdot \ell \leq -\infty:\\
\;\;\;\;c0 \cdot \sqrt{\frac{\frac{-1}{\ell} \cdot A}{-V}}\\
\mathbf{elif}\;V \cdot \ell \leq -2 \cdot 10^{-308}:\\
\;\;\;\;\frac{c0}{\sqrt{\left(-\ell\right) \cdot V}} \cdot \sqrt{-A}\\
\mathbf{elif}\;V \cdot \ell \leq 10^{-309}:\\
\;\;\;\;\frac{c0}{\sqrt{\left(\frac{-1}{A} \cdot V\right) \cdot \left(-\ell\right)}}\\
\mathbf{elif}\;V \cdot \ell \leq 10^{+277}:\\
\;\;\;\;c0 \cdot \frac{\sqrt{A}}{\sqrt{\ell \cdot V}}\\
\mathbf{else}:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{V}{A} \cdot \ell}}\\
\end{array}
\end{array}
if (*.f64 V l) < -inf.0Initial program 41.4%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6466.9
Applied rewrites66.9%
lift-/.f64N/A
clear-numN/A
frac-2negN/A
associate-/r/N/A
lower-*.f64N/A
distribute-frac-neg2N/A
distribute-neg-fracN/A
metadata-evalN/A
lower-/.f64N/A
lower-neg.f6466.9
Applied rewrites66.9%
if -inf.0 < (*.f64 V l) < -1.9999999999999998e-308Initial program 86.5%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6474.3
Applied rewrites74.3%
lift-/.f64N/A
clear-numN/A
frac-2negN/A
associate-/r/N/A
lower-*.f64N/A
distribute-frac-neg2N/A
distribute-neg-fracN/A
metadata-evalN/A
lower-/.f64N/A
lower-neg.f6474.3
Applied rewrites74.3%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
clear-numN/A
sqrt-divN/A
div-invN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
neg-mul-1N/A
lift-neg.f64N/A
remove-double-negN/A
clear-numN/A
lift-/.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-sqrt.f64N/A
Applied rewrites74.2%
Applied rewrites94.9%
if -1.9999999999999998e-308 < (*.f64 V l) < 1.000000000000002e-309Initial program 41.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6467.2
Applied rewrites67.2%
lift-/.f64N/A
clear-numN/A
frac-2negN/A
associate-/r/N/A
lower-*.f64N/A
distribute-frac-neg2N/A
distribute-neg-fracN/A
metadata-evalN/A
lower-/.f64N/A
lower-neg.f6467.2
Applied rewrites67.2%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
clear-numN/A
sqrt-divN/A
div-invN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
neg-mul-1N/A
lift-neg.f64N/A
remove-double-negN/A
clear-numN/A
lift-/.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-sqrt.f64N/A
Applied rewrites67.4%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
div-invN/A
*-commutativeN/A
lower-*.f64N/A
metadata-evalN/A
lift-neg.f64N/A
neg-mul-1N/A
associate-/r*N/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
lower-neg.f6467.4
Applied rewrites67.4%
if 1.000000000000002e-309 < (*.f64 V l) < 1e277Initial program 82.2%
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6499.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6499.4
Applied rewrites99.4%
if 1e277 < (*.f64 V l) Initial program 36.7%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6464.3
Applied rewrites64.3%
lift-/.f64N/A
clear-numN/A
frac-2negN/A
associate-/r/N/A
lower-*.f64N/A
distribute-frac-neg2N/A
distribute-neg-fracN/A
metadata-evalN/A
lower-/.f64N/A
lower-neg.f6464.3
Applied rewrites64.3%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
clear-numN/A
sqrt-divN/A
div-invN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
neg-mul-1N/A
lift-neg.f64N/A
remove-double-negN/A
clear-numN/A
lift-/.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-sqrt.f64N/A
Applied rewrites64.5%
Final simplification87.9%
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 (or (<= t_0 0.0) (not (<= t_0 2e+307)))
(* c0 (sqrt (/ (/ A V) 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) || !(t_0 <= 2e+307)) {
tmp = c0 * sqrt(((A / V) / 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) .or. (.not. (t_0 <= 2d+307))) then
tmp = c0 * sqrt(((a / v) / 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) || !(t_0 <= 2e+307)) {
tmp = c0 * Math.sqrt(((A / V) / 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) or not (t_0 <= 2e+307): tmp = c0 * math.sqrt(((A / V) / 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) || !(t_0 <= 2e+307)) tmp = Float64(c0 * sqrt(Float64(Float64(A / V) / 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) || ~((t_0 <= 2e+307)))
tmp = c0 * sqrt(((A / V) / 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[Or[LessEqual[t$95$0, 0.0], N[Not[LessEqual[t$95$0, 2e+307]], $MachinePrecision]], N[(c0 * N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $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 \lor \neg \left(t\_0 \leq 2 \cdot 10^{+307}\right):\\
\;\;\;\;c0 \cdot \sqrt{\frac{\frac{A}{V}}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;c0 \cdot \sqrt{t\_0}\\
\end{array}
\end{array}
if (/.f64 A (*.f64 V l)) < 0.0 or 1.99999999999999997e307 < (/.f64 A (*.f64 V l)) Initial program 35.2%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6452.6
Applied rewrites52.6%
if 0.0 < (/.f64 A (*.f64 V l)) < 1.99999999999999997e307Initial program 97.5%
Final simplification78.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-309)
(* c0 (sqrt (/ (/ A V) l)))
(if (<= (* V l) 1e+277)
(* c0 (/ (sqrt A) (sqrt (* l V))))
(/ 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-309) {
tmp = c0 * sqrt(((A / V) / l));
} else if ((V * l) <= 1e+277) {
tmp = c0 * (sqrt(A) / sqrt((l * V)));
} 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 ((v * l) <= 1d-309) then
tmp = c0 * sqrt(((a / v) / l))
else if ((v * l) <= 1d+277) then
tmp = c0 * (sqrt(a) / sqrt((l * v)))
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 ((V * l) <= 1e-309) {
tmp = c0 * Math.sqrt(((A / V) / l));
} else if ((V * l) <= 1e+277) {
tmp = c0 * (Math.sqrt(A) / Math.sqrt((l * V)));
} 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 (V * l) <= 1e-309: tmp = c0 * math.sqrt(((A / V) / l)) elif (V * l) <= 1e+277: tmp = c0 * (math.sqrt(A) / math.sqrt((l * V))) 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(V * l) <= 1e-309) tmp = Float64(c0 * sqrt(Float64(Float64(A / V) / l))); elseif (Float64(V * l) <= 1e+277) tmp = Float64(c0 * Float64(sqrt(A) / sqrt(Float64(l * V)))); 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 ((V * l) <= 1e-309)
tmp = c0 * sqrt(((A / V) / l));
elseif ((V * l) <= 1e+277)
tmp = c0 * (sqrt(A) / sqrt((l * V)));
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[(V * l), $MachinePrecision], 1e-309], N[(c0 * N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 1e+277], N[(c0 * N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $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}\;V \cdot \ell \leq 10^{-309}:\\
\;\;\;\;c0 \cdot \sqrt{\frac{\frac{A}{V}}{\ell}}\\
\mathbf{elif}\;V \cdot \ell \leq 10^{+277}:\\
\;\;\;\;c0 \cdot \frac{\sqrt{A}}{\sqrt{\ell \cdot V}}\\
\mathbf{else}:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{V}{A} \cdot \ell}}\\
\end{array}
\end{array}
if (*.f64 V l) < 1.000000000000002e-309Initial program 69.9%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6472.6
Applied rewrites72.6%
if 1.000000000000002e-309 < (*.f64 V l) < 1e277Initial program 82.2%
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6499.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6499.4
Applied rewrites99.4%
if 1e277 < (*.f64 V l) Initial program 36.7%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6464.3
Applied rewrites64.3%
lift-/.f64N/A
clear-numN/A
frac-2negN/A
associate-/r/N/A
lower-*.f64N/A
distribute-frac-neg2N/A
distribute-neg-fracN/A
metadata-evalN/A
lower-/.f64N/A
lower-neg.f6464.3
Applied rewrites64.3%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
clear-numN/A
sqrt-divN/A
div-invN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
neg-mul-1N/A
lift-neg.f64N/A
remove-double-negN/A
clear-numN/A
lift-/.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-sqrt.f64N/A
Applied rewrites64.5%
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 71.0%
herbie shell --seed 2024321
(FPCore (c0 A V l)
:name "Henrywood and Agarwal, Equation (3)"
:precision binary64
(* c0 (sqrt (/ A (* V l)))))