
(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 15 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (c0 A V l) :precision binary64 (* c0 (sqrt (/ A (* V l)))))
double code(double c0, double A, double V, double l) {
return c0 * sqrt((A / (V * l)));
}
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
code = c0 * sqrt((a / (v * l)))
end function
public static double code(double c0, double A, double V, double l) {
return c0 * Math.sqrt((A / (V * l)));
}
def code(c0, A, V, l): return c0 * math.sqrt((A / (V * l)))
function code(c0, A, V, l) return Float64(c0 * sqrt(Float64(A / Float64(V * l)))) end
function tmp = code(c0, A, V, l) tmp = c0 * sqrt((A / (V * l))); end
code[c0_, A_, V_, l_] := N[(c0 * N[Sqrt[N[(A / N[(V * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
c0 \cdot \sqrt{\frac{A}{V \cdot \ell}}
\end{array}
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
:precision binary64
(if (<= (* l V) -2e-228)
(/ (* c0 (sqrt (- A))) (* (sqrt l) (sqrt (- V))))
(if (<= (* l V) 0.0)
(* (sqrt (/ A V)) (* (sqrt (/ 1.0 l)) c0))
(if (<= (* l V) 1e+274)
(* (* (sqrt A) (pow (* l V) -0.5)) c0)
(* (sqrt (/ (/ A V) l)) c0)))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double tmp;
if ((l * V) <= -2e-228) {
tmp = (c0 * sqrt(-A)) / (sqrt(l) * sqrt(-V));
} else if ((l * V) <= 0.0) {
tmp = sqrt((A / V)) * (sqrt((1.0 / l)) * c0);
} else if ((l * V) <= 1e+274) {
tmp = (sqrt(A) * pow((l * V), -0.5)) * c0;
} else {
tmp = sqrt(((A / V) / l)) * c0;
}
return tmp;
}
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
real(8) :: tmp
if ((l * v) <= (-2d-228)) then
tmp = (c0 * sqrt(-a)) / (sqrt(l) * sqrt(-v))
else if ((l * v) <= 0.0d0) then
tmp = sqrt((a / v)) * (sqrt((1.0d0 / l)) * c0)
else if ((l * v) <= 1d+274) then
tmp = (sqrt(a) * ((l * v) ** (-0.5d0))) * c0
else
tmp = sqrt(((a / v) / l)) * c0
end if
code = tmp
end function
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double tmp;
if ((l * V) <= -2e-228) {
tmp = (c0 * Math.sqrt(-A)) / (Math.sqrt(l) * Math.sqrt(-V));
} else if ((l * V) <= 0.0) {
tmp = Math.sqrt((A / V)) * (Math.sqrt((1.0 / l)) * c0);
} else if ((l * V) <= 1e+274) {
tmp = (Math.sqrt(A) * Math.pow((l * V), -0.5)) * c0;
} else {
tmp = Math.sqrt(((A / V) / l)) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): tmp = 0 if (l * V) <= -2e-228: tmp = (c0 * math.sqrt(-A)) / (math.sqrt(l) * math.sqrt(-V)) elif (l * V) <= 0.0: tmp = math.sqrt((A / V)) * (math.sqrt((1.0 / l)) * c0) elif (l * V) <= 1e+274: tmp = (math.sqrt(A) * math.pow((l * V), -0.5)) * c0 else: tmp = math.sqrt(((A / V) / l)) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) tmp = 0.0 if (Float64(l * V) <= -2e-228) tmp = Float64(Float64(c0 * sqrt(Float64(-A))) / Float64(sqrt(l) * sqrt(Float64(-V)))); elseif (Float64(l * V) <= 0.0) tmp = Float64(sqrt(Float64(A / V)) * Float64(sqrt(Float64(1.0 / l)) * c0)); elseif (Float64(l * V) <= 1e+274) tmp = Float64(Float64(sqrt(A) * (Float64(l * V) ^ -0.5)) * c0); else tmp = Float64(sqrt(Float64(Float64(A / V) / l)) * c0); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
tmp = 0.0;
if ((l * V) <= -2e-228)
tmp = (c0 * sqrt(-A)) / (sqrt(l) * sqrt(-V));
elseif ((l * V) <= 0.0)
tmp = sqrt((A / V)) * (sqrt((1.0 / l)) * c0);
elseif ((l * V) <= 1e+274)
tmp = (sqrt(A) * ((l * V) ^ -0.5)) * c0;
else
tmp = sqrt(((A / V) / l)) * c0;
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function. code[c0_, A_, V_, l_] := If[LessEqual[N[(l * V), $MachinePrecision], -2e-228], N[(N[(c0 * N[Sqrt[(-A)], $MachinePrecision]), $MachinePrecision] / N[(N[Sqrt[l], $MachinePrecision] * N[Sqrt[(-V)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 0.0], N[(N[Sqrt[N[(A / V), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(1.0 / l), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 1e+274], N[(N[(N[Sqrt[A], $MachinePrecision] * N[Power[N[(l * V), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], N[(N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \cdot V \leq -2 \cdot 10^{-228}:\\
\;\;\;\;\frac{c0 \cdot \sqrt{-A}}{\sqrt{\ell} \cdot \sqrt{-V}}\\
\mathbf{elif}\;\ell \cdot V \leq 0:\\
\;\;\;\;\sqrt{\frac{A}{V}} \cdot \left(\sqrt{\frac{1}{\ell}} \cdot c0\right)\\
\mathbf{elif}\;\ell \cdot V \leq 10^{+274}:\\
\;\;\;\;\left(\sqrt{A} \cdot {\left(\ell \cdot V\right)}^{-0.5}\right) \cdot c0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{\frac{A}{V}}{\ell}} \cdot c0\\
\end{array}
\end{array}
if (*.f64 V l) < -2.00000000000000007e-228Initial program 74.5%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
frac-2negN/A
div-invN/A
*-commutativeN/A
neg-mul-1N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
metadata-evalN/A
frac-2negN/A
lower-/.f64N/A
lower-/.f6472.5
Applied rewrites72.5%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
metadata-eval72.5
Applied rewrites72.5%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
sqrt-prodN/A
pow1/2N/A
lift-sqrt.f64N/A
associate-*r*N/A
pow1/2N/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
lift-sqrt.f64N/A
div-invN/A
lift-/.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
sqrt-divN/A
pow1/2N/A
lift-/.f64N/A
Applied rewrites84.1%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-neg.f64N/A
distribute-lft-neg-outN/A
distribute-rgt-neg-inN/A
lift-neg.f64N/A
sqrt-prodN/A
pow1/2N/A
lift-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f6454.8
Applied rewrites54.8%
if -2.00000000000000007e-228 < (*.f64 V l) < -0.0Initial program 45.2%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
sqrt-divN/A
associate-*r/N/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6439.8
Applied rewrites39.8%
Taylor expanded in c0 around 0
remove-double-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
distribute-rgt-neg-outN/A
neg-mul-1N/A
rem-square-sqrtN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites39.8%
if -0.0 < (*.f64 V l) < 9.99999999999999921e273Initial program 82.4%
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
inv-powN/A
pow-powN/A
lower-pow.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
metadata-evalN/A
lower-sqrt.f6499.4
Applied rewrites99.4%
if 9.99999999999999921e273 < (*.f64 V l) Initial program 52.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6484.6
Applied rewrites84.6%
Final simplification71.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 (* (sqrt (/ A (* l V))) c0)))
(if (<= t_0 2e-276)
(* (sqrt (/ (/ A V) l)) c0)
(if (<= t_0 2e+305) t_0 (/ c0 (sqrt (* (/ l A) V)))))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = sqrt((A / (l * V))) * c0;
double tmp;
if (t_0 <= 2e-276) {
tmp = sqrt(((A / V) / l)) * c0;
} else if (t_0 <= 2e+305) {
tmp = t_0;
} else {
tmp = c0 / sqrt(((l / A) * V));
}
return tmp;
}
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
real(8) :: t_0
real(8) :: tmp
t_0 = sqrt((a / (l * v))) * c0
if (t_0 <= 2d-276) then
tmp = sqrt(((a / v) / l)) * c0
else if (t_0 <= 2d+305) then
tmp = t_0
else
tmp = c0 / sqrt(((l / a) * v))
end if
code = tmp
end function
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double t_0 = Math.sqrt((A / (l * V))) * c0;
double tmp;
if (t_0 <= 2e-276) {
tmp = Math.sqrt(((A / V) / l)) * c0;
} else if (t_0 <= 2e+305) {
tmp = t_0;
} else {
tmp = c0 / Math.sqrt(((l / A) * V));
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = math.sqrt((A / (l * V))) * c0 tmp = 0 if t_0 <= 2e-276: tmp = math.sqrt(((A / V) / l)) * c0 elif t_0 <= 2e+305: tmp = t_0 else: tmp = c0 / math.sqrt(((l / A) * V)) return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = Float64(sqrt(Float64(A / Float64(l * V))) * c0) tmp = 0.0 if (t_0 <= 2e-276) tmp = Float64(sqrt(Float64(Float64(A / V) / l)) * c0); elseif (t_0 <= 2e+305) tmp = t_0; else tmp = Float64(c0 / sqrt(Float64(Float64(l / A) * V))); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
t_0 = sqrt((A / (l * V))) * c0;
tmp = 0.0;
if (t_0 <= 2e-276)
tmp = sqrt(((A / V) / l)) * c0;
elseif (t_0 <= 2e+305)
tmp = t_0;
else
tmp = c0 / sqrt(((l / A) * V));
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
code[c0_, A_, V_, l_] := Block[{t$95$0 = N[(N[Sqrt[N[(A / N[(l * V), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]}, If[LessEqual[t$95$0, 2e-276], N[(N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[t$95$0, 2e+305], t$95$0, N[(c0 / N[Sqrt[N[(N[(l / A), $MachinePrecision] * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{A}{\ell \cdot V}} \cdot c0\\
\mathbf{if}\;t\_0 \leq 2 \cdot 10^{-276}:\\
\;\;\;\;\sqrt{\frac{\frac{A}{V}}{\ell}} \cdot c0\\
\mathbf{elif}\;t\_0 \leq 2 \cdot 10^{+305}:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{\ell}{A} \cdot V}}\\
\end{array}
\end{array}
if (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) < 2e-276Initial program 65.5%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6470.9
Applied rewrites70.9%
if 2e-276 < (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) < 1.9999999999999999e305Initial program 99.5%
if 1.9999999999999999e305 < (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) Initial program 41.2%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f6445.3
lift-*.f64N/A
*-commutativeN/A
lower-*.f6445.3
Applied rewrites45.3%
lift-/.f64N/A
lift-*.f64N/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f6458.6
Applied rewrites58.6%
Final simplification77.0%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
:precision binary64
(let* ((t_0 (* (sqrt (/ A (* l V))) c0)))
(if (<= t_0 2e-276)
(* (sqrt (/ (/ A V) l)) c0)
(if (<= t_0 2e+305) 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 = sqrt((A / (l * V))) * c0;
double tmp;
if (t_0 <= 2e-276) {
tmp = sqrt(((A / V) / l)) * c0;
} else if (t_0 <= 2e+305) {
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 = sqrt((a / (l * v))) * c0
if (t_0 <= 2d-276) then
tmp = sqrt(((a / v) / l)) * c0
else if (t_0 <= 2d+305) 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 = Math.sqrt((A / (l * V))) * c0;
double tmp;
if (t_0 <= 2e-276) {
tmp = Math.sqrt(((A / V) / l)) * c0;
} else if (t_0 <= 2e+305) {
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 = math.sqrt((A / (l * V))) * c0 tmp = 0 if t_0 <= 2e-276: tmp = math.sqrt(((A / V) / l)) * c0 elif t_0 <= 2e+305: 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(sqrt(Float64(A / Float64(l * V))) * c0) tmp = 0.0 if (t_0 <= 2e-276) tmp = Float64(sqrt(Float64(Float64(A / V) / l)) * c0); elseif (t_0 <= 2e+305) 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 = sqrt((A / (l * V))) * c0;
tmp = 0.0;
if (t_0 <= 2e-276)
tmp = sqrt(((A / V) / l)) * c0;
elseif (t_0 <= 2e+305)
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[(N[Sqrt[N[(A / N[(l * V), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]}, If[LessEqual[t$95$0, 2e-276], N[(N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[t$95$0, 2e+305], 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 := \sqrt{\frac{A}{\ell \cdot V}} \cdot c0\\
\mathbf{if}\;t\_0 \leq 2 \cdot 10^{-276}:\\
\;\;\;\;\sqrt{\frac{\frac{A}{V}}{\ell}} \cdot c0\\
\mathbf{elif}\;t\_0 \leq 2 \cdot 10^{+305}:\\
\;\;\;\;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)))) < 2e-276Initial program 65.5%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6470.9
Applied rewrites70.9%
if 2e-276 < (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) < 1.9999999999999999e305Initial program 99.5%
if 1.9999999999999999e305 < (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) Initial program 41.2%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f6445.3
lift-*.f64N/A
*-commutativeN/A
lower-*.f6445.3
Applied rewrites45.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
lift-/.f64N/A
*-commutativeN/A
lower-*.f6458.7
Applied rewrites58.7%
Final simplification77.0%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function. (FPCore (c0 A V l) :precision binary64 (let* ((t_0 (* (sqrt (/ A (* l V))) c0)) (t_1 (* (sqrt (/ (/ A V) l)) c0))) (if (<= t_0 2e-276) t_1 (if (<= t_0 1e+238) t_0 t_1))))
assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = sqrt((A / (l * V))) * c0;
double t_1 = sqrt(((A / V) / l)) * c0;
double tmp;
if (t_0 <= 2e-276) {
tmp = t_1;
} else if (t_0 <= 1e+238) {
tmp = t_0;
} else {
tmp = t_1;
}
return tmp;
}
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = sqrt((a / (l * v))) * c0
t_1 = sqrt(((a / v) / l)) * c0
if (t_0 <= 2d-276) then
tmp = t_1
else if (t_0 <= 1d+238) then
tmp = t_0
else
tmp = t_1
end if
code = tmp
end function
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double t_0 = Math.sqrt((A / (l * V))) * c0;
double t_1 = Math.sqrt(((A / V) / l)) * c0;
double tmp;
if (t_0 <= 2e-276) {
tmp = t_1;
} else if (t_0 <= 1e+238) {
tmp = t_0;
} else {
tmp = t_1;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = math.sqrt((A / (l * V))) * c0 t_1 = math.sqrt(((A / V) / l)) * c0 tmp = 0 if t_0 <= 2e-276: tmp = t_1 elif t_0 <= 1e+238: tmp = t_0 else: tmp = t_1 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = Float64(sqrt(Float64(A / Float64(l * V))) * c0) t_1 = Float64(sqrt(Float64(Float64(A / V) / l)) * c0) tmp = 0.0 if (t_0 <= 2e-276) tmp = t_1; elseif (t_0 <= 1e+238) tmp = t_0; else tmp = t_1; end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
t_0 = sqrt((A / (l * V))) * c0;
t_1 = sqrt(((A / V) / l)) * c0;
tmp = 0.0;
if (t_0 <= 2e-276)
tmp = t_1;
elseif (t_0 <= 1e+238)
tmp = t_0;
else
tmp = t_1;
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
code[c0_, A_, V_, l_] := Block[{t$95$0 = N[(N[Sqrt[N[(A / N[(l * V), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]}, If[LessEqual[t$95$0, 2e-276], t$95$1, If[LessEqual[t$95$0, 1e+238], t$95$0, t$95$1]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{A}{\ell \cdot V}} \cdot c0\\
t_1 := \sqrt{\frac{\frac{A}{V}}{\ell}} \cdot c0\\
\mathbf{if}\;t\_0 \leq 2 \cdot 10^{-276}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_0 \leq 10^{+238}:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) < 2e-276 or 1e238 < (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) Initial program 63.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6469.9
Applied rewrites69.9%
if 2e-276 < (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) < 1e238Initial program 99.5%
Final simplification76.7%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
:precision binary64
(if (<= (* l V) (- INFINITY))
(* (/ (sqrt (/ (- A) l)) (sqrt (- V))) c0)
(if (<= (* l V) -2e-265)
(* (/ (sqrt (- A)) (sqrt (* (- l) V))) c0)
(if (<= (* l V) 0.0)
(* (sqrt (/ A V)) (* (sqrt (/ 1.0 l)) c0))
(if (<= (* l V) 1e+274)
(* (/ (sqrt A) (sqrt (* l V))) c0)
(* (sqrt (/ (/ A V) l)) c0))))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double tmp;
if ((l * V) <= -((double) INFINITY)) {
tmp = (sqrt((-A / l)) / sqrt(-V)) * c0;
} else if ((l * V) <= -2e-265) {
tmp = (sqrt(-A) / sqrt((-l * V))) * c0;
} else if ((l * V) <= 0.0) {
tmp = sqrt((A / V)) * (sqrt((1.0 / l)) * c0);
} else if ((l * V) <= 1e+274) {
tmp = (sqrt(A) / sqrt((l * V))) * c0;
} else {
tmp = sqrt(((A / V) / l)) * c0;
}
return tmp;
}
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double tmp;
if ((l * V) <= -Double.POSITIVE_INFINITY) {
tmp = (Math.sqrt((-A / l)) / Math.sqrt(-V)) * c0;
} else if ((l * V) <= -2e-265) {
tmp = (Math.sqrt(-A) / Math.sqrt((-l * V))) * c0;
} else if ((l * V) <= 0.0) {
tmp = Math.sqrt((A / V)) * (Math.sqrt((1.0 / l)) * c0);
} else if ((l * V) <= 1e+274) {
tmp = (Math.sqrt(A) / Math.sqrt((l * V))) * c0;
} else {
tmp = Math.sqrt(((A / V) / l)) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): tmp = 0 if (l * V) <= -math.inf: tmp = (math.sqrt((-A / l)) / math.sqrt(-V)) * c0 elif (l * V) <= -2e-265: tmp = (math.sqrt(-A) / math.sqrt((-l * V))) * c0 elif (l * V) <= 0.0: tmp = math.sqrt((A / V)) * (math.sqrt((1.0 / l)) * c0) elif (l * V) <= 1e+274: tmp = (math.sqrt(A) / math.sqrt((l * V))) * c0 else: tmp = math.sqrt(((A / V) / l)) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) tmp = 0.0 if (Float64(l * V) <= Float64(-Inf)) tmp = Float64(Float64(sqrt(Float64(Float64(-A) / l)) / sqrt(Float64(-V))) * c0); elseif (Float64(l * V) <= -2e-265) tmp = Float64(Float64(sqrt(Float64(-A)) / sqrt(Float64(Float64(-l) * V))) * c0); elseif (Float64(l * V) <= 0.0) tmp = Float64(sqrt(Float64(A / V)) * Float64(sqrt(Float64(1.0 / l)) * c0)); elseif (Float64(l * V) <= 1e+274) tmp = Float64(Float64(sqrt(A) / sqrt(Float64(l * V))) * c0); else tmp = Float64(sqrt(Float64(Float64(A / V) / l)) * c0); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
tmp = 0.0;
if ((l * V) <= -Inf)
tmp = (sqrt((-A / l)) / sqrt(-V)) * c0;
elseif ((l * V) <= -2e-265)
tmp = (sqrt(-A) / sqrt((-l * V))) * c0;
elseif ((l * V) <= 0.0)
tmp = sqrt((A / V)) * (sqrt((1.0 / l)) * c0);
elseif ((l * V) <= 1e+274)
tmp = (sqrt(A) / sqrt((l * V))) * c0;
else
tmp = sqrt(((A / V) / l)) * c0;
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function. code[c0_, A_, V_, l_] := If[LessEqual[N[(l * V), $MachinePrecision], (-Infinity)], N[(N[(N[Sqrt[N[((-A) / l), $MachinePrecision]], $MachinePrecision] / N[Sqrt[(-V)], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], -2e-265], N[(N[(N[Sqrt[(-A)], $MachinePrecision] / N[Sqrt[N[((-l) * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 0.0], N[(N[Sqrt[N[(A / V), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(1.0 / l), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 1e+274], N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], N[(N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \cdot V \leq -\infty:\\
\;\;\;\;\frac{\sqrt{\frac{-A}{\ell}}}{\sqrt{-V}} \cdot c0\\
\mathbf{elif}\;\ell \cdot V \leq -2 \cdot 10^{-265}:\\
\;\;\;\;\frac{\sqrt{-A}}{\sqrt{\left(-\ell\right) \cdot V}} \cdot c0\\
\mathbf{elif}\;\ell \cdot V \leq 0:\\
\;\;\;\;\sqrt{\frac{A}{V}} \cdot \left(\sqrt{\frac{1}{\ell}} \cdot c0\right)\\
\mathbf{elif}\;\ell \cdot V \leq 10^{+274}:\\
\;\;\;\;\frac{\sqrt{A}}{\sqrt{\ell \cdot V}} \cdot c0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{\frac{A}{V}}{\ell}} \cdot c0\\
\end{array}
\end{array}
if (*.f64 V l) < -inf.0Initial program 35.9%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
frac-2negN/A
div-invN/A
*-commutativeN/A
neg-mul-1N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
metadata-evalN/A
frac-2negN/A
lower-/.f64N/A
lower-/.f6469.3
Applied rewrites69.3%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
metadata-eval69.3
Applied rewrites69.3%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
frac-timesN/A
*-lft-identityN/A
associate-/r*N/A
sqrt-divN/A
pow1/2N/A
lower-/.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-neg.f6429.5
Applied rewrites29.5%
if -inf.0 < (*.f64 V l) < -1.99999999999999997e-265Initial program 85.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
frac-2negN/A
div-invN/A
*-commutativeN/A
neg-mul-1N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
metadata-evalN/A
frac-2negN/A
lower-/.f64N/A
lower-/.f6473.1
Applied rewrites73.1%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
metadata-eval73.1
Applied rewrites73.1%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-timesN/A
*-lft-identityN/A
lift-*.f64N/A
frac-2negN/A
lift-neg.f64N/A
*-rgt-identityN/A
sqrt-divN/A
*-rgt-identityN/A
pow1/2N/A
lower-/.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f6499.5
Applied rewrites99.5%
if -1.99999999999999997e-265 < (*.f64 V l) < -0.0Initial program 40.5%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
sqrt-divN/A
associate-*r/N/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6448.0
Applied rewrites48.0%
Taylor expanded in c0 around 0
remove-double-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
distribute-rgt-neg-outN/A
neg-mul-1N/A
rem-square-sqrtN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites48.1%
if -0.0 < (*.f64 V l) < 9.99999999999999921e273Initial program 82.4%
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 9.99999999999999921e273 < (*.f64 V l) Initial program 52.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6484.6
Applied rewrites84.6%
Final simplification85.8%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
:precision binary64
(let* ((t_0 (* (/ (sqrt (/ (- A) l)) (sqrt (- V))) c0)))
(if (<= (* l V) (- INFINITY))
t_0
(if (<= (* l V) -2e-242)
(* (/ (sqrt (- A)) (sqrt (* (- l) V))) c0)
(if (<= (* l V) 1e-283)
t_0
(if (<= (* l V) 1e+274)
(* (/ (sqrt A) (sqrt (* l V))) c0)
(* (sqrt (/ (/ A V) l)) c0)))))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = (sqrt((-A / l)) / sqrt(-V)) * c0;
double tmp;
if ((l * V) <= -((double) INFINITY)) {
tmp = t_0;
} else if ((l * V) <= -2e-242) {
tmp = (sqrt(-A) / sqrt((-l * V))) * c0;
} else if ((l * V) <= 1e-283) {
tmp = t_0;
} else if ((l * V) <= 1e+274) {
tmp = (sqrt(A) / sqrt((l * V))) * c0;
} else {
tmp = sqrt(((A / V) / l)) * c0;
}
return tmp;
}
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double t_0 = (Math.sqrt((-A / l)) / Math.sqrt(-V)) * c0;
double tmp;
if ((l * V) <= -Double.POSITIVE_INFINITY) {
tmp = t_0;
} else if ((l * V) <= -2e-242) {
tmp = (Math.sqrt(-A) / Math.sqrt((-l * V))) * c0;
} else if ((l * V) <= 1e-283) {
tmp = t_0;
} else if ((l * V) <= 1e+274) {
tmp = (Math.sqrt(A) / Math.sqrt((l * V))) * c0;
} else {
tmp = Math.sqrt(((A / V) / l)) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = (math.sqrt((-A / l)) / math.sqrt(-V)) * c0 tmp = 0 if (l * V) <= -math.inf: tmp = t_0 elif (l * V) <= -2e-242: tmp = (math.sqrt(-A) / math.sqrt((-l * V))) * c0 elif (l * V) <= 1e-283: tmp = t_0 elif (l * V) <= 1e+274: tmp = (math.sqrt(A) / math.sqrt((l * V))) * c0 else: tmp = math.sqrt(((A / V) / l)) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = Float64(Float64(sqrt(Float64(Float64(-A) / l)) / sqrt(Float64(-V))) * c0) tmp = 0.0 if (Float64(l * V) <= Float64(-Inf)) tmp = t_0; elseif (Float64(l * V) <= -2e-242) tmp = Float64(Float64(sqrt(Float64(-A)) / sqrt(Float64(Float64(-l) * V))) * c0); elseif (Float64(l * V) <= 1e-283) tmp = t_0; elseif (Float64(l * V) <= 1e+274) tmp = Float64(Float64(sqrt(A) / sqrt(Float64(l * V))) * c0); else tmp = Float64(sqrt(Float64(Float64(A / V) / l)) * c0); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
t_0 = (sqrt((-A / l)) / sqrt(-V)) * c0;
tmp = 0.0;
if ((l * V) <= -Inf)
tmp = t_0;
elseif ((l * V) <= -2e-242)
tmp = (sqrt(-A) / sqrt((-l * V))) * c0;
elseif ((l * V) <= 1e-283)
tmp = t_0;
elseif ((l * V) <= 1e+274)
tmp = (sqrt(A) / sqrt((l * V))) * c0;
else
tmp = sqrt(((A / V) / l)) * c0;
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
code[c0_, A_, V_, l_] := Block[{t$95$0 = N[(N[(N[Sqrt[N[((-A) / l), $MachinePrecision]], $MachinePrecision] / N[Sqrt[(-V)], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision]}, If[LessEqual[N[(l * V), $MachinePrecision], (-Infinity)], t$95$0, If[LessEqual[N[(l * V), $MachinePrecision], -2e-242], N[(N[(N[Sqrt[(-A)], $MachinePrecision] / N[Sqrt[N[((-l) * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 1e-283], t$95$0, If[LessEqual[N[(l * V), $MachinePrecision], 1e+274], N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], N[(N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]]]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
t_0 := \frac{\sqrt{\frac{-A}{\ell}}}{\sqrt{-V}} \cdot c0\\
\mathbf{if}\;\ell \cdot V \leq -\infty:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\ell \cdot V \leq -2 \cdot 10^{-242}:\\
\;\;\;\;\frac{\sqrt{-A}}{\sqrt{\left(-\ell\right) \cdot V}} \cdot c0\\
\mathbf{elif}\;\ell \cdot V \leq 10^{-283}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\ell \cdot V \leq 10^{+274}:\\
\;\;\;\;\frac{\sqrt{A}}{\sqrt{\ell \cdot V}} \cdot c0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{\frac{A}{V}}{\ell}} \cdot c0\\
\end{array}
\end{array}
if (*.f64 V l) < -inf.0 or -2e-242 < (*.f64 V l) < 9.99999999999999947e-284Initial program 41.9%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
frac-2negN/A
div-invN/A
*-commutativeN/A
neg-mul-1N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
metadata-evalN/A
frac-2negN/A
lower-/.f64N/A
lower-/.f6468.9
Applied rewrites68.9%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
metadata-eval68.9
Applied rewrites68.9%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
frac-timesN/A
*-lft-identityN/A
associate-/r*N/A
sqrt-divN/A
pow1/2N/A
lower-/.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-neg.f6439.4
Applied rewrites39.4%
if -inf.0 < (*.f64 V l) < -2e-242Initial program 85.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
frac-2negN/A
div-invN/A
*-commutativeN/A
neg-mul-1N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
metadata-evalN/A
frac-2negN/A
lower-/.f64N/A
lower-/.f6473.0
Applied rewrites73.0%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
metadata-eval73.0
Applied rewrites73.0%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-timesN/A
*-lft-identityN/A
lift-*.f64N/A
frac-2negN/A
lift-neg.f64N/A
*-rgt-identityN/A
sqrt-divN/A
*-rgt-identityN/A
pow1/2N/A
lower-/.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f6499.5
Applied rewrites99.5%
if 9.99999999999999947e-284 < (*.f64 V l) < 9.99999999999999921e273Initial 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 9.99999999999999921e273 < (*.f64 V l) Initial program 52.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6484.6
Applied rewrites84.6%
Final simplification84.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 (sqrt (/ A V))))
(if (<= (* l V) (- INFINITY))
(/ (* t_0 c0) (sqrt l))
(if (<= (* l V) -1e-211)
(* (/ (sqrt (- A)) (sqrt (* (- l) V))) c0)
(if (<= (* l V) 0.0)
(* (/ t_0 (sqrt l)) c0)
(if (<= (* l V) 1e+274)
(* (/ (sqrt A) (sqrt (* l V))) c0)
(* (sqrt (/ (/ A V) l)) c0)))))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = sqrt((A / V));
double tmp;
if ((l * V) <= -((double) INFINITY)) {
tmp = (t_0 * c0) / sqrt(l);
} else if ((l * V) <= -1e-211) {
tmp = (sqrt(-A) / sqrt((-l * V))) * c0;
} else if ((l * V) <= 0.0) {
tmp = (t_0 / sqrt(l)) * c0;
} else if ((l * V) <= 1e+274) {
tmp = (sqrt(A) / sqrt((l * V))) * c0;
} else {
tmp = sqrt(((A / V) / l)) * c0;
}
return tmp;
}
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double t_0 = Math.sqrt((A / V));
double tmp;
if ((l * V) <= -Double.POSITIVE_INFINITY) {
tmp = (t_0 * c0) / Math.sqrt(l);
} else if ((l * V) <= -1e-211) {
tmp = (Math.sqrt(-A) / Math.sqrt((-l * V))) * c0;
} else if ((l * V) <= 0.0) {
tmp = (t_0 / Math.sqrt(l)) * c0;
} else if ((l * V) <= 1e+274) {
tmp = (Math.sqrt(A) / Math.sqrt((l * V))) * c0;
} else {
tmp = Math.sqrt(((A / V) / l)) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = math.sqrt((A / V)) tmp = 0 if (l * V) <= -math.inf: tmp = (t_0 * c0) / math.sqrt(l) elif (l * V) <= -1e-211: tmp = (math.sqrt(-A) / math.sqrt((-l * V))) * c0 elif (l * V) <= 0.0: tmp = (t_0 / math.sqrt(l)) * c0 elif (l * V) <= 1e+274: tmp = (math.sqrt(A) / math.sqrt((l * V))) * c0 else: tmp = math.sqrt(((A / V) / l)) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = sqrt(Float64(A / V)) tmp = 0.0 if (Float64(l * V) <= Float64(-Inf)) tmp = Float64(Float64(t_0 * c0) / sqrt(l)); elseif (Float64(l * V) <= -1e-211) tmp = Float64(Float64(sqrt(Float64(-A)) / sqrt(Float64(Float64(-l) * V))) * c0); elseif (Float64(l * V) <= 0.0) tmp = Float64(Float64(t_0 / sqrt(l)) * c0); elseif (Float64(l * V) <= 1e+274) tmp = Float64(Float64(sqrt(A) / sqrt(Float64(l * V))) * c0); else tmp = Float64(sqrt(Float64(Float64(A / V) / l)) * c0); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
t_0 = sqrt((A / V));
tmp = 0.0;
if ((l * V) <= -Inf)
tmp = (t_0 * c0) / sqrt(l);
elseif ((l * V) <= -1e-211)
tmp = (sqrt(-A) / sqrt((-l * V))) * c0;
elseif ((l * V) <= 0.0)
tmp = (t_0 / sqrt(l)) * c0;
elseif ((l * V) <= 1e+274)
tmp = (sqrt(A) / sqrt((l * V))) * c0;
else
tmp = sqrt(((A / V) / l)) * c0;
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
code[c0_, A_, V_, l_] := Block[{t$95$0 = N[Sqrt[N[(A / V), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[N[(l * V), $MachinePrecision], (-Infinity)], N[(N[(t$95$0 * c0), $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], -1e-211], N[(N[(N[Sqrt[(-A)], $MachinePrecision] / N[Sqrt[N[((-l) * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 0.0], N[(N[(t$95$0 / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 1e+274], N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], N[(N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]]]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{A}{V}}\\
\mathbf{if}\;\ell \cdot V \leq -\infty:\\
\;\;\;\;\frac{t\_0 \cdot c0}{\sqrt{\ell}}\\
\mathbf{elif}\;\ell \cdot V \leq -1 \cdot 10^{-211}:\\
\;\;\;\;\frac{\sqrt{-A}}{\sqrt{\left(-\ell\right) \cdot V}} \cdot c0\\
\mathbf{elif}\;\ell \cdot V \leq 0:\\
\;\;\;\;\frac{t\_0}{\sqrt{\ell}} \cdot c0\\
\mathbf{elif}\;\ell \cdot V \leq 10^{+274}:\\
\;\;\;\;\frac{\sqrt{A}}{\sqrt{\ell \cdot V}} \cdot c0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{\frac{A}{V}}{\ell}} \cdot c0\\
\end{array}
\end{array}
if (*.f64 V l) < -inf.0Initial program 35.9%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
sqrt-divN/A
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6425.7
Applied rewrites25.7%
if -inf.0 < (*.f64 V l) < -1.00000000000000009e-211Initial program 86.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
frac-2negN/A
div-invN/A
*-commutativeN/A
neg-mul-1N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
metadata-evalN/A
frac-2negN/A
lower-/.f64N/A
lower-/.f6472.8
Applied rewrites72.8%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
metadata-eval72.8
Applied rewrites72.8%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-timesN/A
*-lft-identityN/A
lift-*.f64N/A
frac-2negN/A
lift-neg.f64N/A
*-rgt-identityN/A
sqrt-divN/A
*-rgt-identityN/A
pow1/2N/A
lower-/.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f6499.5
Applied rewrites99.5%
if -1.00000000000000009e-211 < (*.f64 V l) < -0.0Initial program 48.1%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6443.0
Applied rewrites43.0%
if -0.0 < (*.f64 V l) < 9.99999999999999921e273Initial program 82.4%
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 9.99999999999999921e273 < (*.f64 V l) Initial program 52.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6484.6
Applied rewrites84.6%
Final simplification83.0%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
:precision binary64
(let* ((t_0 (sqrt (/ A V))))
(if (<= (* l V) (- INFINITY))
(* (/ c0 (sqrt l)) t_0)
(if (<= (* l V) -1e-211)
(* (/ (sqrt (- A)) (sqrt (* (- l) V))) c0)
(if (<= (* l V) 0.0)
(* (/ t_0 (sqrt l)) c0)
(if (<= (* l V) 1e+274)
(* (/ (sqrt A) (sqrt (* l V))) c0)
(* (sqrt (/ (/ A V) l)) c0)))))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = sqrt((A / V));
double tmp;
if ((l * V) <= -((double) INFINITY)) {
tmp = (c0 / sqrt(l)) * t_0;
} else if ((l * V) <= -1e-211) {
tmp = (sqrt(-A) / sqrt((-l * V))) * c0;
} else if ((l * V) <= 0.0) {
tmp = (t_0 / sqrt(l)) * c0;
} else if ((l * V) <= 1e+274) {
tmp = (sqrt(A) / sqrt((l * V))) * c0;
} else {
tmp = sqrt(((A / V) / l)) * c0;
}
return tmp;
}
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double t_0 = Math.sqrt((A / V));
double tmp;
if ((l * V) <= -Double.POSITIVE_INFINITY) {
tmp = (c0 / Math.sqrt(l)) * t_0;
} else if ((l * V) <= -1e-211) {
tmp = (Math.sqrt(-A) / Math.sqrt((-l * V))) * c0;
} else if ((l * V) <= 0.0) {
tmp = (t_0 / Math.sqrt(l)) * c0;
} else if ((l * V) <= 1e+274) {
tmp = (Math.sqrt(A) / Math.sqrt((l * V))) * c0;
} else {
tmp = Math.sqrt(((A / V) / l)) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = math.sqrt((A / V)) tmp = 0 if (l * V) <= -math.inf: tmp = (c0 / math.sqrt(l)) * t_0 elif (l * V) <= -1e-211: tmp = (math.sqrt(-A) / math.sqrt((-l * V))) * c0 elif (l * V) <= 0.0: tmp = (t_0 / math.sqrt(l)) * c0 elif (l * V) <= 1e+274: tmp = (math.sqrt(A) / math.sqrt((l * V))) * c0 else: tmp = math.sqrt(((A / V) / l)) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = sqrt(Float64(A / V)) tmp = 0.0 if (Float64(l * V) <= Float64(-Inf)) tmp = Float64(Float64(c0 / sqrt(l)) * t_0); elseif (Float64(l * V) <= -1e-211) tmp = Float64(Float64(sqrt(Float64(-A)) / sqrt(Float64(Float64(-l) * V))) * c0); elseif (Float64(l * V) <= 0.0) tmp = Float64(Float64(t_0 / sqrt(l)) * c0); elseif (Float64(l * V) <= 1e+274) tmp = Float64(Float64(sqrt(A) / sqrt(Float64(l * V))) * c0); else tmp = Float64(sqrt(Float64(Float64(A / V) / l)) * c0); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
t_0 = sqrt((A / V));
tmp = 0.0;
if ((l * V) <= -Inf)
tmp = (c0 / sqrt(l)) * t_0;
elseif ((l * V) <= -1e-211)
tmp = (sqrt(-A) / sqrt((-l * V))) * c0;
elseif ((l * V) <= 0.0)
tmp = (t_0 / sqrt(l)) * c0;
elseif ((l * V) <= 1e+274)
tmp = (sqrt(A) / sqrt((l * V))) * c0;
else
tmp = sqrt(((A / V) / l)) * c0;
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
code[c0_, A_, V_, l_] := Block[{t$95$0 = N[Sqrt[N[(A / V), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[N[(l * V), $MachinePrecision], (-Infinity)], N[(N[(c0 / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], -1e-211], N[(N[(N[Sqrt[(-A)], $MachinePrecision] / N[Sqrt[N[((-l) * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 0.0], N[(N[(t$95$0 / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 1e+274], N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], N[(N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]]]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{A}{V}}\\
\mathbf{if}\;\ell \cdot V \leq -\infty:\\
\;\;\;\;\frac{c0}{\sqrt{\ell}} \cdot t\_0\\
\mathbf{elif}\;\ell \cdot V \leq -1 \cdot 10^{-211}:\\
\;\;\;\;\frac{\sqrt{-A}}{\sqrt{\left(-\ell\right) \cdot V}} \cdot c0\\
\mathbf{elif}\;\ell \cdot V \leq 0:\\
\;\;\;\;\frac{t\_0}{\sqrt{\ell}} \cdot c0\\
\mathbf{elif}\;\ell \cdot V \leq 10^{+274}:\\
\;\;\;\;\frac{\sqrt{A}}{\sqrt{\ell \cdot V}} \cdot c0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{\frac{A}{V}}{\ell}} \cdot c0\\
\end{array}
\end{array}
if (*.f64 V l) < -inf.0Initial program 35.9%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
sqrt-divN/A
associate-*r/N/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6425.7
Applied rewrites25.7%
if -inf.0 < (*.f64 V l) < -1.00000000000000009e-211Initial program 86.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
frac-2negN/A
div-invN/A
*-commutativeN/A
neg-mul-1N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
metadata-evalN/A
frac-2negN/A
lower-/.f64N/A
lower-/.f6472.8
Applied rewrites72.8%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
metadata-eval72.8
Applied rewrites72.8%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-timesN/A
*-lft-identityN/A
lift-*.f64N/A
frac-2negN/A
lift-neg.f64N/A
*-rgt-identityN/A
sqrt-divN/A
*-rgt-identityN/A
pow1/2N/A
lower-/.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f6499.5
Applied rewrites99.5%
if -1.00000000000000009e-211 < (*.f64 V l) < -0.0Initial program 48.1%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6443.0
Applied rewrites43.0%
if -0.0 < (*.f64 V l) < 9.99999999999999921e273Initial program 82.4%
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 9.99999999999999921e273 < (*.f64 V l) Initial program 52.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6484.6
Applied rewrites84.6%
Final simplification83.0%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
:precision binary64
(let* ((t_0 (* (/ (sqrt (/ A V)) (sqrt l)) c0)))
(if (<= (* l V) (- INFINITY))
t_0
(if (<= (* l V) -1e-211)
(* (/ (sqrt (- A)) (sqrt (* (- l) V))) c0)
(if (<= (* l V) 0.0)
t_0
(if (<= (* l V) 1e+274)
(* (/ (sqrt A) (sqrt (* l V))) c0)
(* (sqrt (/ (/ A V) l)) c0)))))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = (sqrt((A / V)) / sqrt(l)) * c0;
double tmp;
if ((l * V) <= -((double) INFINITY)) {
tmp = t_0;
} else if ((l * V) <= -1e-211) {
tmp = (sqrt(-A) / sqrt((-l * V))) * c0;
} else if ((l * V) <= 0.0) {
tmp = t_0;
} else if ((l * V) <= 1e+274) {
tmp = (sqrt(A) / sqrt((l * V))) * c0;
} else {
tmp = sqrt(((A / V) / l)) * c0;
}
return tmp;
}
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double t_0 = (Math.sqrt((A / V)) / Math.sqrt(l)) * c0;
double tmp;
if ((l * V) <= -Double.POSITIVE_INFINITY) {
tmp = t_0;
} else if ((l * V) <= -1e-211) {
tmp = (Math.sqrt(-A) / Math.sqrt((-l * V))) * c0;
} else if ((l * V) <= 0.0) {
tmp = t_0;
} else if ((l * V) <= 1e+274) {
tmp = (Math.sqrt(A) / Math.sqrt((l * V))) * c0;
} else {
tmp = Math.sqrt(((A / V) / l)) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = (math.sqrt((A / V)) / math.sqrt(l)) * c0 tmp = 0 if (l * V) <= -math.inf: tmp = t_0 elif (l * V) <= -1e-211: tmp = (math.sqrt(-A) / math.sqrt((-l * V))) * c0 elif (l * V) <= 0.0: tmp = t_0 elif (l * V) <= 1e+274: tmp = (math.sqrt(A) / math.sqrt((l * V))) * c0 else: tmp = math.sqrt(((A / V) / l)) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = Float64(Float64(sqrt(Float64(A / V)) / sqrt(l)) * c0) tmp = 0.0 if (Float64(l * V) <= Float64(-Inf)) tmp = t_0; elseif (Float64(l * V) <= -1e-211) tmp = Float64(Float64(sqrt(Float64(-A)) / sqrt(Float64(Float64(-l) * V))) * c0); elseif (Float64(l * V) <= 0.0) tmp = t_0; elseif (Float64(l * V) <= 1e+274) tmp = Float64(Float64(sqrt(A) / sqrt(Float64(l * V))) * c0); else tmp = Float64(sqrt(Float64(Float64(A / V) / l)) * c0); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
t_0 = (sqrt((A / V)) / sqrt(l)) * c0;
tmp = 0.0;
if ((l * V) <= -Inf)
tmp = t_0;
elseif ((l * V) <= -1e-211)
tmp = (sqrt(-A) / sqrt((-l * V))) * c0;
elseif ((l * V) <= 0.0)
tmp = t_0;
elseif ((l * V) <= 1e+274)
tmp = (sqrt(A) / sqrt((l * V))) * c0;
else
tmp = sqrt(((A / V) / l)) * c0;
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
code[c0_, A_, V_, l_] := Block[{t$95$0 = N[(N[(N[Sqrt[N[(A / V), $MachinePrecision]], $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision]}, If[LessEqual[N[(l * V), $MachinePrecision], (-Infinity)], t$95$0, If[LessEqual[N[(l * V), $MachinePrecision], -1e-211], N[(N[(N[Sqrt[(-A)], $MachinePrecision] / N[Sqrt[N[((-l) * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 0.0], t$95$0, If[LessEqual[N[(l * V), $MachinePrecision], 1e+274], N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], N[(N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]]]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
t_0 := \frac{\sqrt{\frac{A}{V}}}{\sqrt{\ell}} \cdot c0\\
\mathbf{if}\;\ell \cdot V \leq -\infty:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\ell \cdot V \leq -1 \cdot 10^{-211}:\\
\;\;\;\;\frac{\sqrt{-A}}{\sqrt{\left(-\ell\right) \cdot V}} \cdot c0\\
\mathbf{elif}\;\ell \cdot V \leq 0:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\ell \cdot V \leq 10^{+274}:\\
\;\;\;\;\frac{\sqrt{A}}{\sqrt{\ell \cdot V}} \cdot c0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{\frac{A}{V}}{\ell}} \cdot c0\\
\end{array}
\end{array}
if (*.f64 V l) < -inf.0 or -1.00000000000000009e-211 < (*.f64 V l) < -0.0Initial program 43.2%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6436.0
Applied rewrites36.0%
if -inf.0 < (*.f64 V l) < -1.00000000000000009e-211Initial program 86.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
frac-2negN/A
div-invN/A
*-commutativeN/A
neg-mul-1N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
metadata-evalN/A
frac-2negN/A
lower-/.f64N/A
lower-/.f6472.8
Applied rewrites72.8%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
metadata-eval72.8
Applied rewrites72.8%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-timesN/A
*-lft-identityN/A
lift-*.f64N/A
frac-2negN/A
lift-neg.f64N/A
*-rgt-identityN/A
sqrt-divN/A
*-rgt-identityN/A
pow1/2N/A
lower-/.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f6499.5
Applied rewrites99.5%
if -0.0 < (*.f64 V l) < 9.99999999999999921e273Initial program 82.4%
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 9.99999999999999921e273 < (*.f64 V l) Initial program 52.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6484.6
Applied rewrites84.6%
Final simplification83.0%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
:precision binary64
(let* ((t_0 (* (sqrt (/ (/ A V) l)) c0)))
(if (<= (* l V) (- INFINITY))
t_0
(if (<= (* l V) -5e-322)
(* (/ (sqrt (- A)) (sqrt (* (- l) V))) c0)
(if (<= (* l V) 1e-283)
(/ c0 (sqrt (* (/ V A) l)))
(if (<= (* l V) 1e+274) (* (/ (sqrt A) (sqrt (* l V))) c0) t_0))))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = sqrt(((A / V) / l)) * c0;
double tmp;
if ((l * V) <= -((double) INFINITY)) {
tmp = t_0;
} else if ((l * V) <= -5e-322) {
tmp = (sqrt(-A) / sqrt((-l * V))) * c0;
} else if ((l * V) <= 1e-283) {
tmp = c0 / sqrt(((V / A) * l));
} else if ((l * V) <= 1e+274) {
tmp = (sqrt(A) / sqrt((l * V))) * c0;
} else {
tmp = t_0;
}
return tmp;
}
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double t_0 = Math.sqrt(((A / V) / l)) * c0;
double tmp;
if ((l * V) <= -Double.POSITIVE_INFINITY) {
tmp = t_0;
} else if ((l * V) <= -5e-322) {
tmp = (Math.sqrt(-A) / Math.sqrt((-l * V))) * c0;
} else if ((l * V) <= 1e-283) {
tmp = c0 / Math.sqrt(((V / A) * l));
} else if ((l * V) <= 1e+274) {
tmp = (Math.sqrt(A) / Math.sqrt((l * V))) * c0;
} else {
tmp = t_0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = math.sqrt(((A / V) / l)) * c0 tmp = 0 if (l * V) <= -math.inf: tmp = t_0 elif (l * V) <= -5e-322: tmp = (math.sqrt(-A) / math.sqrt((-l * V))) * c0 elif (l * V) <= 1e-283: tmp = c0 / math.sqrt(((V / A) * l)) elif (l * V) <= 1e+274: tmp = (math.sqrt(A) / math.sqrt((l * V))) * c0 else: tmp = t_0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = Float64(sqrt(Float64(Float64(A / V) / l)) * c0) tmp = 0.0 if (Float64(l * V) <= Float64(-Inf)) tmp = t_0; elseif (Float64(l * V) <= -5e-322) tmp = Float64(Float64(sqrt(Float64(-A)) / sqrt(Float64(Float64(-l) * V))) * c0); elseif (Float64(l * V) <= 1e-283) tmp = Float64(c0 / sqrt(Float64(Float64(V / A) * l))); elseif (Float64(l * V) <= 1e+274) tmp = Float64(Float64(sqrt(A) / sqrt(Float64(l * V))) * c0); else tmp = t_0; end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
t_0 = sqrt(((A / V) / l)) * c0;
tmp = 0.0;
if ((l * V) <= -Inf)
tmp = t_0;
elseif ((l * V) <= -5e-322)
tmp = (sqrt(-A) / sqrt((-l * V))) * c0;
elseif ((l * V) <= 1e-283)
tmp = c0 / sqrt(((V / A) * l));
elseif ((l * V) <= 1e+274)
tmp = (sqrt(A) / sqrt((l * V))) * c0;
else
tmp = t_0;
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
code[c0_, A_, V_, l_] := Block[{t$95$0 = N[(N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]}, If[LessEqual[N[(l * V), $MachinePrecision], (-Infinity)], t$95$0, If[LessEqual[N[(l * V), $MachinePrecision], -5e-322], N[(N[(N[Sqrt[(-A)], $MachinePrecision] / N[Sqrt[N[((-l) * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 1e-283], N[(c0 / N[Sqrt[N[(N[(V / A), $MachinePrecision] * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 1e+274], N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], t$95$0]]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{\frac{A}{V}}{\ell}} \cdot c0\\
\mathbf{if}\;\ell \cdot V \leq -\infty:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\ell \cdot V \leq -5 \cdot 10^{-322}:\\
\;\;\;\;\frac{\sqrt{-A}}{\sqrt{\left(-\ell\right) \cdot V}} \cdot c0\\
\mathbf{elif}\;\ell \cdot V \leq 10^{-283}:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{V}{A} \cdot \ell}}\\
\mathbf{elif}\;\ell \cdot V \leq 10^{+274}:\\
\;\;\;\;\frac{\sqrt{A}}{\sqrt{\ell \cdot V}} \cdot c0\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if (*.f64 V l) < -inf.0 or 9.99999999999999921e273 < (*.f64 V l) Initial program 43.0%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6475.7
Applied rewrites75.7%
if -inf.0 < (*.f64 V l) < -4.99006e-322Initial program 84.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
frac-2negN/A
div-invN/A
*-commutativeN/A
neg-mul-1N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
metadata-evalN/A
frac-2negN/A
lower-/.f64N/A
lower-/.f6473.0
Applied rewrites73.0%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
metadata-eval73.0
Applied rewrites73.0%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-timesN/A
*-lft-identityN/A
lift-*.f64N/A
frac-2negN/A
lift-neg.f64N/A
*-rgt-identityN/A
sqrt-divN/A
*-rgt-identityN/A
pow1/2N/A
lower-/.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f6498.5
Applied rewrites98.5%
if -4.99006e-322 < (*.f64 V l) < 9.99999999999999947e-284Initial program 33.4%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f6433.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6433.4
Applied rewrites33.4%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
lift-/.f64N/A
*-commutativeN/A
lower-*.f6466.6
Applied rewrites66.6%
if 9.99999999999999947e-284 < (*.f64 V l) < 9.99999999999999921e273Initial 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%
Final simplification92.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 (<= (* l V) -2e-228)
(/ (* c0 (sqrt (- A))) (* (sqrt l) (sqrt (- V))))
(if (<= (* l V) 0.0)
(* (sqrt (/ A V)) (* (sqrt (/ 1.0 l)) c0))
(if (<= (* l V) 1e+274)
(* (/ (sqrt A) (sqrt (* l V))) c0)
(* (sqrt (/ (/ A V) l)) c0)))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double tmp;
if ((l * V) <= -2e-228) {
tmp = (c0 * sqrt(-A)) / (sqrt(l) * sqrt(-V));
} else if ((l * V) <= 0.0) {
tmp = sqrt((A / V)) * (sqrt((1.0 / l)) * c0);
} else if ((l * V) <= 1e+274) {
tmp = (sqrt(A) / sqrt((l * V))) * c0;
} else {
tmp = sqrt(((A / V) / l)) * c0;
}
return tmp;
}
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
real(8) :: tmp
if ((l * v) <= (-2d-228)) then
tmp = (c0 * sqrt(-a)) / (sqrt(l) * sqrt(-v))
else if ((l * v) <= 0.0d0) then
tmp = sqrt((a / v)) * (sqrt((1.0d0 / l)) * c0)
else if ((l * v) <= 1d+274) then
tmp = (sqrt(a) / sqrt((l * v))) * c0
else
tmp = sqrt(((a / v) / l)) * c0
end if
code = tmp
end function
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double tmp;
if ((l * V) <= -2e-228) {
tmp = (c0 * Math.sqrt(-A)) / (Math.sqrt(l) * Math.sqrt(-V));
} else if ((l * V) <= 0.0) {
tmp = Math.sqrt((A / V)) * (Math.sqrt((1.0 / l)) * c0);
} else if ((l * V) <= 1e+274) {
tmp = (Math.sqrt(A) / Math.sqrt((l * V))) * c0;
} else {
tmp = Math.sqrt(((A / V) / l)) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): tmp = 0 if (l * V) <= -2e-228: tmp = (c0 * math.sqrt(-A)) / (math.sqrt(l) * math.sqrt(-V)) elif (l * V) <= 0.0: tmp = math.sqrt((A / V)) * (math.sqrt((1.0 / l)) * c0) elif (l * V) <= 1e+274: tmp = (math.sqrt(A) / math.sqrt((l * V))) * c0 else: tmp = math.sqrt(((A / V) / l)) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) tmp = 0.0 if (Float64(l * V) <= -2e-228) tmp = Float64(Float64(c0 * sqrt(Float64(-A))) / Float64(sqrt(l) * sqrt(Float64(-V)))); elseif (Float64(l * V) <= 0.0) tmp = Float64(sqrt(Float64(A / V)) * Float64(sqrt(Float64(1.0 / l)) * c0)); elseif (Float64(l * V) <= 1e+274) tmp = Float64(Float64(sqrt(A) / sqrt(Float64(l * V))) * c0); else tmp = Float64(sqrt(Float64(Float64(A / V) / l)) * c0); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
tmp = 0.0;
if ((l * V) <= -2e-228)
tmp = (c0 * sqrt(-A)) / (sqrt(l) * sqrt(-V));
elseif ((l * V) <= 0.0)
tmp = sqrt((A / V)) * (sqrt((1.0 / l)) * c0);
elseif ((l * V) <= 1e+274)
tmp = (sqrt(A) / sqrt((l * V))) * c0;
else
tmp = sqrt(((A / V) / l)) * c0;
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function. code[c0_, A_, V_, l_] := If[LessEqual[N[(l * V), $MachinePrecision], -2e-228], N[(N[(c0 * N[Sqrt[(-A)], $MachinePrecision]), $MachinePrecision] / N[(N[Sqrt[l], $MachinePrecision] * N[Sqrt[(-V)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 0.0], N[(N[Sqrt[N[(A / V), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(1.0 / l), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 1e+274], N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], N[(N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \cdot V \leq -2 \cdot 10^{-228}:\\
\;\;\;\;\frac{c0 \cdot \sqrt{-A}}{\sqrt{\ell} \cdot \sqrt{-V}}\\
\mathbf{elif}\;\ell \cdot V \leq 0:\\
\;\;\;\;\sqrt{\frac{A}{V}} \cdot \left(\sqrt{\frac{1}{\ell}} \cdot c0\right)\\
\mathbf{elif}\;\ell \cdot V \leq 10^{+274}:\\
\;\;\;\;\frac{\sqrt{A}}{\sqrt{\ell \cdot V}} \cdot c0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{\frac{A}{V}}{\ell}} \cdot c0\\
\end{array}
\end{array}
if (*.f64 V l) < -2.00000000000000007e-228Initial program 74.5%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
frac-2negN/A
div-invN/A
*-commutativeN/A
neg-mul-1N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
metadata-evalN/A
frac-2negN/A
lower-/.f64N/A
lower-/.f6472.5
Applied rewrites72.5%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
metadata-eval72.5
Applied rewrites72.5%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
sqrt-prodN/A
pow1/2N/A
lift-sqrt.f64N/A
associate-*r*N/A
pow1/2N/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
lift-sqrt.f64N/A
div-invN/A
lift-/.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
sqrt-divN/A
pow1/2N/A
lift-/.f64N/A
Applied rewrites84.1%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-neg.f64N/A
distribute-lft-neg-outN/A
distribute-rgt-neg-inN/A
lift-neg.f64N/A
sqrt-prodN/A
pow1/2N/A
lift-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f6454.8
Applied rewrites54.8%
if -2.00000000000000007e-228 < (*.f64 V l) < -0.0Initial program 45.2%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
sqrt-divN/A
associate-*r/N/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6439.8
Applied rewrites39.8%
Taylor expanded in c0 around 0
remove-double-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
distribute-rgt-neg-outN/A
neg-mul-1N/A
rem-square-sqrtN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites39.8%
if -0.0 < (*.f64 V l) < 9.99999999999999921e273Initial program 82.4%
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 9.99999999999999921e273 < (*.f64 V l) Initial program 52.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6484.6
Applied rewrites84.6%
Final simplification71.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 (<= (* l V) 0.0)
(* (sqrt (* (/ A V) (/ 1.0 l))) c0)
(if (<= (* l V) 1e+274)
(* (/ (sqrt A) (sqrt (* l V))) c0)
(* (sqrt (/ (/ A V) l)) c0))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double tmp;
if ((l * V) <= 0.0) {
tmp = sqrt(((A / V) * (1.0 / l))) * c0;
} else if ((l * V) <= 1e+274) {
tmp = (sqrt(A) / sqrt((l * V))) * c0;
} else {
tmp = sqrt(((A / V) / l)) * c0;
}
return tmp;
}
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
real(8) :: tmp
if ((l * v) <= 0.0d0) then
tmp = sqrt(((a / v) * (1.0d0 / l))) * c0
else if ((l * v) <= 1d+274) then
tmp = (sqrt(a) / sqrt((l * v))) * c0
else
tmp = sqrt(((a / v) / l)) * c0
end if
code = tmp
end function
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double tmp;
if ((l * V) <= 0.0) {
tmp = Math.sqrt(((A / V) * (1.0 / l))) * c0;
} else if ((l * V) <= 1e+274) {
tmp = (Math.sqrt(A) / Math.sqrt((l * V))) * c0;
} else {
tmp = Math.sqrt(((A / V) / l)) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): tmp = 0 if (l * V) <= 0.0: tmp = math.sqrt(((A / V) * (1.0 / l))) * c0 elif (l * V) <= 1e+274: tmp = (math.sqrt(A) / math.sqrt((l * V))) * c0 else: tmp = math.sqrt(((A / V) / l)) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) tmp = 0.0 if (Float64(l * V) <= 0.0) tmp = Float64(sqrt(Float64(Float64(A / V) * Float64(1.0 / l))) * c0); elseif (Float64(l * V) <= 1e+274) tmp = Float64(Float64(sqrt(A) / sqrt(Float64(l * V))) * c0); else tmp = Float64(sqrt(Float64(Float64(A / V) / l)) * c0); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
tmp = 0.0;
if ((l * V) <= 0.0)
tmp = sqrt(((A / V) * (1.0 / l))) * c0;
elseif ((l * V) <= 1e+274)
tmp = (sqrt(A) / sqrt((l * V))) * c0;
else
tmp = sqrt(((A / V) / l)) * c0;
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function. code[c0_, A_, V_, l_] := If[LessEqual[N[(l * V), $MachinePrecision], 0.0], N[(N[Sqrt[N[(N[(A / V), $MachinePrecision] * N[(1.0 / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 1e+274], N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], N[(N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \cdot V \leq 0:\\
\;\;\;\;\sqrt{\frac{A}{V} \cdot \frac{1}{\ell}} \cdot c0\\
\mathbf{elif}\;\ell \cdot V \leq 10^{+274}:\\
\;\;\;\;\frac{\sqrt{A}}{\sqrt{\ell \cdot V}} \cdot c0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{\frac{A}{V}}{\ell}} \cdot c0\\
\end{array}
\end{array}
if (*.f64 V l) < -0.0Initial program 67.2%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
frac-2negN/A
div-invN/A
*-commutativeN/A
neg-mul-1N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
metadata-evalN/A
frac-2negN/A
lower-/.f64N/A
lower-/.f6471.1
Applied rewrites71.1%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
metadata-eval71.1
Applied rewrites71.1%
if -0.0 < (*.f64 V l) < 9.99999999999999921e273Initial program 82.4%
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 9.99999999999999921e273 < (*.f64 V l) Initial program 52.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6484.6
Applied rewrites84.6%
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
(let* ((t_0 (* (sqrt (/ (/ A V) l)) c0)))
(if (<= (* l V) 0.0)
t_0
(if (<= (* l V) 1e+274) (* (/ (sqrt A) (sqrt (* l V))) c0) t_0))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = sqrt(((A / V) / l)) * c0;
double tmp;
if ((l * V) <= 0.0) {
tmp = t_0;
} else if ((l * V) <= 1e+274) {
tmp = (sqrt(A) / sqrt((l * V))) * c0;
} else {
tmp = t_0;
}
return tmp;
}
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
real(8) :: t_0
real(8) :: tmp
t_0 = sqrt(((a / v) / l)) * c0
if ((l * v) <= 0.0d0) then
tmp = t_0
else if ((l * v) <= 1d+274) then
tmp = (sqrt(a) / sqrt((l * v))) * c0
else
tmp = t_0
end if
code = tmp
end function
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double t_0 = Math.sqrt(((A / V) / l)) * c0;
double tmp;
if ((l * V) <= 0.0) {
tmp = t_0;
} else if ((l * V) <= 1e+274) {
tmp = (Math.sqrt(A) / Math.sqrt((l * V))) * c0;
} else {
tmp = t_0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = math.sqrt(((A / V) / l)) * c0 tmp = 0 if (l * V) <= 0.0: tmp = t_0 elif (l * V) <= 1e+274: tmp = (math.sqrt(A) / math.sqrt((l * V))) * c0 else: tmp = t_0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = Float64(sqrt(Float64(Float64(A / V) / l)) * c0) tmp = 0.0 if (Float64(l * V) <= 0.0) tmp = t_0; elseif (Float64(l * V) <= 1e+274) tmp = Float64(Float64(sqrt(A) / sqrt(Float64(l * V))) * c0); else tmp = t_0; end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
t_0 = sqrt(((A / V) / l)) * c0;
tmp = 0.0;
if ((l * V) <= 0.0)
tmp = t_0;
elseif ((l * V) <= 1e+274)
tmp = (sqrt(A) / sqrt((l * V))) * c0;
else
tmp = t_0;
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
code[c0_, A_, V_, l_] := Block[{t$95$0 = N[(N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]}, If[LessEqual[N[(l * V), $MachinePrecision], 0.0], t$95$0, If[LessEqual[N[(l * V), $MachinePrecision], 1e+274], N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], t$95$0]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{\frac{A}{V}}{\ell}} \cdot c0\\
\mathbf{if}\;\ell \cdot V \leq 0:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\ell \cdot V \leq 10^{+274}:\\
\;\;\;\;\frac{\sqrt{A}}{\sqrt{\ell \cdot V}} \cdot c0\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if (*.f64 V l) < -0.0 or 9.99999999999999921e273 < (*.f64 V l) Initial program 65.6%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6472.6
Applied rewrites72.6%
if -0.0 < (*.f64 V l) < 9.99999999999999921e273Initial program 82.4%
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%
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 (<= l -5e-310) (* (/ (sqrt A) (* (sqrt (- l)) (sqrt (- V)))) c0) (/ c0 (* (sqrt (/ V A)) (sqrt l)))))
assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double tmp;
if (l <= -5e-310) {
tmp = (sqrt(A) / (sqrt(-l) * sqrt(-V))) * c0;
} else {
tmp = c0 / (sqrt((V / A)) * sqrt(l));
}
return tmp;
}
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
real(8) :: tmp
if (l <= (-5d-310)) then
tmp = (sqrt(a) / (sqrt(-l) * sqrt(-v))) * c0
else
tmp = c0 / (sqrt((v / a)) * sqrt(l))
end if
code = tmp
end function
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double tmp;
if (l <= -5e-310) {
tmp = (Math.sqrt(A) / (Math.sqrt(-l) * Math.sqrt(-V))) * c0;
} else {
tmp = c0 / (Math.sqrt((V / A)) * Math.sqrt(l));
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): tmp = 0 if l <= -5e-310: tmp = (math.sqrt(A) / (math.sqrt(-l) * math.sqrt(-V))) * c0 else: tmp = c0 / (math.sqrt((V / A)) * math.sqrt(l)) return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) tmp = 0.0 if (l <= -5e-310) tmp = Float64(Float64(sqrt(A) / Float64(sqrt(Float64(-l)) * sqrt(Float64(-V)))) * c0); else tmp = Float64(c0 / Float64(sqrt(Float64(V / A)) * sqrt(l))); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
tmp = 0.0;
if (l <= -5e-310)
tmp = (sqrt(A) / (sqrt(-l) * sqrt(-V))) * c0;
else
tmp = c0 / (sqrt((V / A)) * sqrt(l));
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function. code[c0_, A_, V_, l_] := If[LessEqual[l, -5e-310], N[(N[(N[Sqrt[A], $MachinePrecision] / N[(N[Sqrt[(-l)], $MachinePrecision] * N[Sqrt[(-V)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], N[(c0 / N[(N[Sqrt[N[(V / A), $MachinePrecision]], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\frac{\sqrt{A}}{\sqrt{-\ell} \cdot \sqrt{-V}} \cdot c0\\
\mathbf{else}:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{V}{A}} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if l < -4.999999999999985e-310Initial program 71.2%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
frac-2negN/A
div-invN/A
*-commutativeN/A
neg-mul-1N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
metadata-evalN/A
frac-2negN/A
lower-/.f64N/A
lower-/.f6475.6
Applied rewrites75.6%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
metadata-eval75.6
Applied rewrites75.6%
lift-sqrt.f64N/A
lift-*.f64N/A
sqrt-prodN/A
lift-/.f64N/A
frac-2negN/A
metadata-evalN/A
sqrt-divN/A
pow1/2N/A
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
sqrt-divN/A
pow1/2N/A
frac-timesN/A
unpow-prod-downN/A
mul-1-negN/A
lift-neg.f64N/A
remove-double-negN/A
pow1/2N/A
lower-/.f64N/A
lower-sqrt.f64N/A
Applied rewrites50.5%
if -4.999999999999985e-310 < l Initial program 72.8%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f6471.9
lift-*.f64N/A
*-commutativeN/A
lower-*.f6471.9
Applied rewrites71.9%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
lift-/.f64N/A
sqrt-prodN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
*-commutativeN/A
lower-*.f6481.5
Applied rewrites81.5%
Final simplification66.2%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function. (FPCore (c0 A V l) :precision binary64 (* (sqrt (/ A (* l V))) c0))
assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
return sqrt((A / (l * V))) * c0;
}
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
code = sqrt((a / (l * v))) * c0
end function
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
return Math.sqrt((A / (l * V))) * c0;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): return math.sqrt((A / (l * V))) * c0
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) return Float64(sqrt(Float64(A / Float64(l * V))) * c0) end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp = code(c0, A, V, l)
tmp = sqrt((A / (l * V))) * c0;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function. code[c0_, A_, V_, l_] := N[(N[Sqrt[N[(A / N[(l * V), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\sqrt{\frac{A}{\ell \cdot V}} \cdot c0
\end{array}
Initial program 72.0%
Final simplification72.0%
herbie shell --seed 2024248
(FPCore (c0 A V l)
:name "Henrywood and Agarwal, Equation (3)"
:precision binary64
(* c0 (sqrt (/ A (* V l)))))