
(FPCore (c0 A V l) :precision binary64 (* c0 (sqrt (/ A (* V l)))))
double code(double c0, double A, double V, double l) {
return c0 * sqrt((A / (V * l)));
}
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
code = c0 * sqrt((a / (v * l)))
end function
public static double code(double c0, double A, double V, double l) {
return c0 * Math.sqrt((A / (V * l)));
}
def code(c0, A, V, l): return c0 * math.sqrt((A / (V * l)))
function code(c0, A, V, l) return Float64(c0 * sqrt(Float64(A / Float64(V * l)))) end
function tmp = code(c0, A, V, l) tmp = c0 * sqrt((A / (V * l))); end
code[c0_, A_, V_, l_] := N[(c0 * N[Sqrt[N[(A / N[(V * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
c0 \cdot \sqrt{\frac{A}{V \cdot \ell}}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 14 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (c0 A V l) :precision binary64 (* c0 (sqrt (/ A (* V l)))))
double code(double c0, double A, double V, double l) {
return c0 * sqrt((A / (V * l)));
}
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
code = c0 * sqrt((a / (v * l)))
end function
public static double code(double c0, double A, double V, double l) {
return c0 * Math.sqrt((A / (V * l)));
}
def code(c0, A, V, l): return c0 * math.sqrt((A / (V * l)))
function code(c0, A, V, l) return Float64(c0 * sqrt(Float64(A / Float64(V * l)))) end
function tmp = code(c0, A, V, l) tmp = c0 * sqrt((A / (V * l))); end
code[c0_, A_, V_, l_] := N[(c0 * N[Sqrt[N[(A / N[(V * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
c0 \cdot \sqrt{\frac{A}{V \cdot \ell}}
\end{array}
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
:precision binary64
(let* ((t_0 (pow (- A) 0.25)))
(if (<= A -5e-310)
(* c0 (* (/ t_0 (sqrt (- V))) (/ t_0 (sqrt l))))
(* (pow A 0.25) (* (/ (sqrt (sqrt A)) (sqrt (* l V))) c0)))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = pow(-A, 0.25);
double tmp;
if (A <= -5e-310) {
tmp = c0 * ((t_0 / sqrt(-V)) * (t_0 / sqrt(l)));
} else {
tmp = pow(A, 0.25) * ((sqrt(sqrt(A)) / sqrt((l * V))) * c0);
}
return tmp;
}
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
real(8) :: t_0
real(8) :: tmp
t_0 = -a ** 0.25d0
if (a <= (-5d-310)) then
tmp = c0 * ((t_0 / sqrt(-v)) * (t_0 / sqrt(l)))
else
tmp = (a ** 0.25d0) * ((sqrt(sqrt(a)) / sqrt((l * v))) * c0)
end if
code = tmp
end function
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double t_0 = Math.pow(-A, 0.25);
double tmp;
if (A <= -5e-310) {
tmp = c0 * ((t_0 / Math.sqrt(-V)) * (t_0 / Math.sqrt(l)));
} else {
tmp = Math.pow(A, 0.25) * ((Math.sqrt(Math.sqrt(A)) / Math.sqrt((l * V))) * c0);
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = math.pow(-A, 0.25) tmp = 0 if A <= -5e-310: tmp = c0 * ((t_0 / math.sqrt(-V)) * (t_0 / math.sqrt(l))) else: tmp = math.pow(A, 0.25) * ((math.sqrt(math.sqrt(A)) / math.sqrt((l * V))) * c0) return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = Float64(-A) ^ 0.25 tmp = 0.0 if (A <= -5e-310) tmp = Float64(c0 * Float64(Float64(t_0 / sqrt(Float64(-V))) * Float64(t_0 / sqrt(l)))); else tmp = Float64((A ^ 0.25) * Float64(Float64(sqrt(sqrt(A)) / sqrt(Float64(l * V))) * c0)); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
t_0 = -A ^ 0.25;
tmp = 0.0;
if (A <= -5e-310)
tmp = c0 * ((t_0 / sqrt(-V)) * (t_0 / sqrt(l)));
else
tmp = (A ^ 0.25) * ((sqrt(sqrt(A)) / sqrt((l * V))) * c0);
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
code[c0_, A_, V_, l_] := Block[{t$95$0 = N[Power[(-A), 0.25], $MachinePrecision]}, If[LessEqual[A, -5e-310], N[(c0 * N[(N[(t$95$0 / N[Sqrt[(-V)], $MachinePrecision]), $MachinePrecision] * N[(t$95$0 / N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Power[A, 0.25], $MachinePrecision] * N[(N[(N[Sqrt[N[Sqrt[A], $MachinePrecision]], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
t_0 := {\left(-A\right)}^{0.25}\\
\mathbf{if}\;A \leq -5 \cdot 10^{-310}:\\
\;\;\;\;c0 \cdot \left(\frac{t\_0}{\sqrt{-V}} \cdot \frac{t\_0}{\sqrt{\ell}}\right)\\
\mathbf{else}:\\
\;\;\;\;{A}^{0.25} \cdot \left(\frac{\sqrt{\sqrt{A}}}{\sqrt{\ell \cdot V}} \cdot c0\right)\\
\end{array}
\end{array}
if A < -4.999999999999985e-310Initial program 73.1%
lift-sqrt.f64N/A
lift-/.f64N/A
frac-2negN/A
sqrt-divN/A
pow1/2N/A
sqr-powN/A
lift-*.f64N/A
distribute-lft-neg-inN/A
sqrt-prodN/A
pow1/2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-pow.f64N/A
lower-neg.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
Applied rewrites46.5%
if -4.999999999999985e-310 < A Initial program 79.0%
lift-*.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
pow1/2N/A
sqr-powN/A
associate-/l*N/A
associate-*l*N/A
lower-*.f64N/A
lower-pow.f64N/A
metadata-evalN/A
lower-*.f64N/A
lower-/.f64N/A
lower-pow.f64N/A
metadata-evalN/A
lower-sqrt.f6489.0
lift-*.f64N/A
*-commutativeN/A
lower-*.f6489.0
Applied rewrites89.0%
rem-square-sqrtN/A
sqrt-unprodN/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-sqrN/A
metadata-evalN/A
pow1/2N/A
lift-sqrt.f64N/A
lower-sqrt.f6489.1
Applied rewrites89.1%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function. (FPCore (c0 A V l) :precision binary64 (if (<= A -5e-310) (/ (* (/ (sqrt (- A)) (sqrt (- V))) c0) (sqrt l)) (* (pow A 0.25) (* (/ (sqrt (sqrt A)) (sqrt (* l V))) c0))))
assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double tmp;
if (A <= -5e-310) {
tmp = ((sqrt(-A) / sqrt(-V)) * c0) / sqrt(l);
} else {
tmp = pow(A, 0.25) * ((sqrt(sqrt(A)) / sqrt((l * V))) * c0);
}
return tmp;
}
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
real(8) :: tmp
if (a <= (-5d-310)) then
tmp = ((sqrt(-a) / sqrt(-v)) * c0) / sqrt(l)
else
tmp = (a ** 0.25d0) * ((sqrt(sqrt(a)) / sqrt((l * v))) * c0)
end if
code = tmp
end function
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double tmp;
if (A <= -5e-310) {
tmp = ((Math.sqrt(-A) / Math.sqrt(-V)) * c0) / Math.sqrt(l);
} else {
tmp = Math.pow(A, 0.25) * ((Math.sqrt(Math.sqrt(A)) / Math.sqrt((l * V))) * c0);
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): tmp = 0 if A <= -5e-310: tmp = ((math.sqrt(-A) / math.sqrt(-V)) * c0) / math.sqrt(l) else: tmp = math.pow(A, 0.25) * ((math.sqrt(math.sqrt(A)) / math.sqrt((l * V))) * c0) return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) tmp = 0.0 if (A <= -5e-310) tmp = Float64(Float64(Float64(sqrt(Float64(-A)) / sqrt(Float64(-V))) * c0) / sqrt(l)); else tmp = Float64((A ^ 0.25) * Float64(Float64(sqrt(sqrt(A)) / sqrt(Float64(l * V))) * c0)); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
tmp = 0.0;
if (A <= -5e-310)
tmp = ((sqrt(-A) / sqrt(-V)) * c0) / sqrt(l);
else
tmp = (A ^ 0.25) * ((sqrt(sqrt(A)) / sqrt((l * V))) * c0);
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function. code[c0_, A_, V_, l_] := If[LessEqual[A, -5e-310], N[(N[(N[(N[Sqrt[(-A)], $MachinePrecision] / N[Sqrt[(-V)], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision], N[(N[Power[A, 0.25], $MachinePrecision] * N[(N[(N[Sqrt[N[Sqrt[A], $MachinePrecision]], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
\mathbf{if}\;A \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\frac{\frac{\sqrt{-A}}{\sqrt{-V}} \cdot c0}{\sqrt{\ell}}\\
\mathbf{else}:\\
\;\;\;\;{A}^{0.25} \cdot \left(\frac{\sqrt{\sqrt{A}}}{\sqrt{\ell \cdot V}} \cdot c0\right)\\
\end{array}
\end{array}
if A < -4.999999999999985e-310Initial program 73.1%
lift-*.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
associate-*l/N/A
lift-*.f64N/A
sqrt-prodN/A
associate-/r*N/A
lower-/.f64N/A
associate-*l/N/A
sqrt-divN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6440.2
Applied rewrites40.2%
lift-sqrt.f64N/A
lift-/.f64N/A
frac-2negN/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-neg.f6445.9
Applied rewrites45.9%
if -4.999999999999985e-310 < A Initial program 79.0%
lift-*.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
pow1/2N/A
sqr-powN/A
associate-/l*N/A
associate-*l*N/A
lower-*.f64N/A
lower-pow.f64N/A
metadata-evalN/A
lower-*.f64N/A
lower-/.f64N/A
lower-pow.f64N/A
metadata-evalN/A
lower-sqrt.f6489.0
lift-*.f64N/A
*-commutativeN/A
lower-*.f6489.0
Applied rewrites89.0%
rem-square-sqrtN/A
sqrt-unprodN/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-sqrN/A
metadata-evalN/A
pow1/2N/A
lift-sqrt.f64N/A
lower-sqrt.f6489.1
Applied rewrites89.1%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
:precision binary64
(let* ((t_0 (* c0 (sqrt (/ A (* V l))))))
(if (or (<= t_0 0.0) (not (<= t_0 5e+258)))
(* c0 (sqrt (/ (/ A V) l)))
t_0)))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) || !(t_0 <= 5e+258)) {
tmp = c0 * sqrt(((A / V) / l));
} else {
tmp = t_0;
}
return tmp;
}
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
real(8) :: t_0
real(8) :: tmp
t_0 = c0 * sqrt((a / (v * l)))
if ((t_0 <= 0.0d0) .or. (.not. (t_0 <= 5d+258))) then
tmp = c0 * sqrt(((a / v) / l))
else
tmp = t_0
end if
code = tmp
end function
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double t_0 = c0 * Math.sqrt((A / (V * l)));
double tmp;
if ((t_0 <= 0.0) || !(t_0 <= 5e+258)) {
tmp = c0 * Math.sqrt(((A / V) / l));
} else {
tmp = t_0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = c0 * math.sqrt((A / (V * l))) tmp = 0 if (t_0 <= 0.0) or not (t_0 <= 5e+258): tmp = c0 * math.sqrt(((A / V) / l)) else: tmp = t_0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = Float64(c0 * sqrt(Float64(A / Float64(V * l)))) tmp = 0.0 if ((t_0 <= 0.0) || !(t_0 <= 5e+258)) tmp = Float64(c0 * sqrt(Float64(Float64(A / V) / l))); else tmp = t_0; end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
t_0 = c0 * sqrt((A / (V * l)));
tmp = 0.0;
if ((t_0 <= 0.0) || ~((t_0 <= 5e+258)))
tmp = c0 * sqrt(((A / V) / l));
else
tmp = t_0;
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
code[c0_, A_, V_, l_] := Block[{t$95$0 = N[(c0 * N[Sqrt[N[(A / N[(V * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$0, 0.0], N[Not[LessEqual[t$95$0, 5e+258]], $MachinePrecision]], N[(c0 * N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], t$95$0]]
\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 \lor \neg \left(t\_0 \leq 5 \cdot 10^{+258}\right):\\
\;\;\;\;c0 \cdot \sqrt{\frac{\frac{A}{V}}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) < 0.0 or 5e258 < (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) Initial program 69.6%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6470.1
Applied rewrites70.1%
if 0.0 < (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) < 5e258Initial program 98.1%
Final simplification76.5%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
:precision binary64
(let* ((t_0 (* c0 (sqrt (/ A (* V l))))))
(if (<= t_0 5e-291)
(* c0 (sqrt (/ (/ A l) V)))
(if (<= t_0 5e+258) 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 <= 5e-291) {
tmp = c0 * sqrt(((A / l) / V));
} else if (t_0 <= 5e+258) {
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 <= 5d-291) then
tmp = c0 * sqrt(((a / l) / v))
else if (t_0 <= 5d+258) 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 <= 5e-291) {
tmp = c0 * Math.sqrt(((A / l) / V));
} else if (t_0 <= 5e+258) {
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 <= 5e-291: tmp = c0 * math.sqrt(((A / l) / V)) elif t_0 <= 5e+258: 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 <= 5e-291) tmp = Float64(c0 * sqrt(Float64(Float64(A / l) / V))); elseif (t_0 <= 5e+258) 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 <= 5e-291)
tmp = c0 * sqrt(((A / l) / V));
elseif (t_0 <= 5e+258)
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, 5e-291], N[(c0 * N[Sqrt[N[(N[(A / l), $MachinePrecision] / V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 5e+258], 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 5 \cdot 10^{-291}:\\
\;\;\;\;c0 \cdot \sqrt{\frac{\frac{A}{\ell}}{V}}\\
\mathbf{elif}\;t\_0 \leq 5 \cdot 10^{+258}:\\
\;\;\;\;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)))) < 5.0000000000000003e-291Initial program 71.2%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6470.2
Applied rewrites70.2%
if 5.0000000000000003e-291 < (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) < 5e258Initial program 98.1%
if 5e258 < (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) Initial program 65.0%
lift-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
pow-to-expN/A
sinh-+-cosh-revN/A
flip-+N/A
sinh-coshN/A
sinh---cosh-revN/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
exp-negN/A
pow-to-expN/A
pow1/2N/A
lift-sqrt.f64N/A
Applied rewrites64.9%
Taylor expanded in A around 0
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f6466.7
Applied rewrites66.7%
lift-*.f64N/A
*-rgt-identity66.7
Applied rewrites73.8%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
:precision binary64
(let* ((t_0 (* c0 (sqrt (/ A (* V l))))))
(if (<= t_0 5e-291)
(* c0 (sqrt (/ (/ A l) V)))
(if (<= t_0 5e+258) t_0 (* c0 (sqrt (/ (/ A V) l)))))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = c0 * sqrt((A / (V * l)));
double tmp;
if (t_0 <= 5e-291) {
tmp = c0 * sqrt(((A / l) / V));
} else if (t_0 <= 5e+258) {
tmp = t_0;
} else {
tmp = c0 * sqrt(((A / V) / l));
}
return tmp;
}
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
real(8) :: t_0
real(8) :: tmp
t_0 = c0 * sqrt((a / (v * l)))
if (t_0 <= 5d-291) then
tmp = c0 * sqrt(((a / l) / v))
else if (t_0 <= 5d+258) then
tmp = t_0
else
tmp = c0 * sqrt(((a / v) / l))
end if
code = tmp
end function
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double t_0 = c0 * Math.sqrt((A / (V * l)));
double tmp;
if (t_0 <= 5e-291) {
tmp = c0 * Math.sqrt(((A / l) / V));
} else if (t_0 <= 5e+258) {
tmp = t_0;
} else {
tmp = c0 * Math.sqrt(((A / V) / l));
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = c0 * math.sqrt((A / (V * l))) tmp = 0 if t_0 <= 5e-291: tmp = c0 * math.sqrt(((A / l) / V)) elif t_0 <= 5e+258: tmp = t_0 else: tmp = c0 * math.sqrt(((A / V) / l)) return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = Float64(c0 * sqrt(Float64(A / Float64(V * l)))) tmp = 0.0 if (t_0 <= 5e-291) tmp = Float64(c0 * sqrt(Float64(Float64(A / l) / V))); elseif (t_0 <= 5e+258) tmp = t_0; else tmp = Float64(c0 * sqrt(Float64(Float64(A / V) / l))); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
t_0 = c0 * sqrt((A / (V * l)));
tmp = 0.0;
if (t_0 <= 5e-291)
tmp = c0 * sqrt(((A / l) / V));
elseif (t_0 <= 5e+258)
tmp = t_0;
else
tmp = c0 * sqrt(((A / V) / l));
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
code[c0_, A_, V_, l_] := Block[{t$95$0 = N[(c0 * N[Sqrt[N[(A / N[(V * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 5e-291], N[(c0 * N[Sqrt[N[(N[(A / l), $MachinePrecision] / V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 5e+258], t$95$0, N[(c0 * N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
t_0 := c0 \cdot \sqrt{\frac{A}{V \cdot \ell}}\\
\mathbf{if}\;t\_0 \leq 5 \cdot 10^{-291}:\\
\;\;\;\;c0 \cdot \sqrt{\frac{\frac{A}{\ell}}{V}}\\
\mathbf{elif}\;t\_0 \leq 5 \cdot 10^{+258}:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;c0 \cdot \sqrt{\frac{\frac{A}{V}}{\ell}}\\
\end{array}
\end{array}
if (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) < 5.0000000000000003e-291Initial program 71.2%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6470.2
Applied rewrites70.2%
if 5.0000000000000003e-291 < (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) < 5e258Initial program 98.1%
if 5e258 < (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) Initial program 65.0%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6472.1
Applied rewrites72.1%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
:precision binary64
(let* ((t_0 (sqrt (sqrt A))))
(if (<= A -5e-310)
(/ (* (/ (sqrt (- A)) (sqrt (- V))) c0) (sqrt l))
(* t_0 (* (/ t_0 (sqrt (* l V))) c0)))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = sqrt(sqrt(A));
double tmp;
if (A <= -5e-310) {
tmp = ((sqrt(-A) / sqrt(-V)) * c0) / sqrt(l);
} else {
tmp = t_0 * ((t_0 / sqrt((l * V))) * c0);
}
return tmp;
}
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
real(8) :: t_0
real(8) :: tmp
t_0 = sqrt(sqrt(a))
if (a <= (-5d-310)) then
tmp = ((sqrt(-a) / sqrt(-v)) * c0) / sqrt(l)
else
tmp = t_0 * ((t_0 / sqrt((l * v))) * c0)
end if
code = tmp
end function
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double t_0 = Math.sqrt(Math.sqrt(A));
double tmp;
if (A <= -5e-310) {
tmp = ((Math.sqrt(-A) / Math.sqrt(-V)) * c0) / Math.sqrt(l);
} else {
tmp = t_0 * ((t_0 / Math.sqrt((l * V))) * c0);
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = math.sqrt(math.sqrt(A)) tmp = 0 if A <= -5e-310: tmp = ((math.sqrt(-A) / math.sqrt(-V)) * c0) / math.sqrt(l) else: tmp = t_0 * ((t_0 / math.sqrt((l * V))) * c0) return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = sqrt(sqrt(A)) tmp = 0.0 if (A <= -5e-310) tmp = Float64(Float64(Float64(sqrt(Float64(-A)) / sqrt(Float64(-V))) * c0) / sqrt(l)); else tmp = Float64(t_0 * Float64(Float64(t_0 / sqrt(Float64(l * V))) * c0)); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
t_0 = sqrt(sqrt(A));
tmp = 0.0;
if (A <= -5e-310)
tmp = ((sqrt(-A) / sqrt(-V)) * c0) / sqrt(l);
else
tmp = t_0 * ((t_0 / sqrt((l * V))) * c0);
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
code[c0_, A_, V_, l_] := Block[{t$95$0 = N[Sqrt[N[Sqrt[A], $MachinePrecision]], $MachinePrecision]}, If[LessEqual[A, -5e-310], N[(N[(N[(N[Sqrt[(-A)], $MachinePrecision] / N[Sqrt[(-V)], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision], N[(t$95$0 * N[(N[(t$95$0 / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
t_0 := \sqrt{\sqrt{A}}\\
\mathbf{if}\;A \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\frac{\frac{\sqrt{-A}}{\sqrt{-V}} \cdot c0}{\sqrt{\ell}}\\
\mathbf{else}:\\
\;\;\;\;t\_0 \cdot \left(\frac{t\_0}{\sqrt{\ell \cdot V}} \cdot c0\right)\\
\end{array}
\end{array}
if A < -4.999999999999985e-310Initial program 73.1%
lift-*.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
associate-*l/N/A
lift-*.f64N/A
sqrt-prodN/A
associate-/r*N/A
lower-/.f64N/A
associate-*l/N/A
sqrt-divN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6440.2
Applied rewrites40.2%
lift-sqrt.f64N/A
lift-/.f64N/A
frac-2negN/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-neg.f6445.9
Applied rewrites45.9%
if -4.999999999999985e-310 < A Initial program 79.0%
lift-*.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
pow1/2N/A
sqr-powN/A
associate-/l*N/A
associate-*l*N/A
lower-*.f64N/A
lower-pow.f64N/A
metadata-evalN/A
lower-*.f64N/A
lower-/.f64N/A
lower-pow.f64N/A
metadata-evalN/A
lower-sqrt.f6489.0
lift-*.f64N/A
*-commutativeN/A
lower-*.f6489.0
Applied rewrites89.0%
rem-square-sqrtN/A
sqrt-unprodN/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-sqrN/A
metadata-evalN/A
pow1/2N/A
lift-sqrt.f64N/A
lower-sqrt.f6489.1
Applied rewrites89.1%
lift-pow.f64N/A
metadata-evalN/A
sqrt-pow1N/A
pow1/2N/A
lift-sqrt.f64N/A
lift-sqrt.f6489.0
Applied rewrites89.0%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
:precision binary64
(if (<= (* V l) -1e+295)
(* c0 (sqrt (/ (/ A l) V)))
(if (<= (* V l) -1e-171)
(/ (* (sqrt (- A)) c0) (sqrt (* (- V) l)))
(if (<= (* V l) 4e-314)
(* c0 (sqrt (/ (/ A V) l)))
(/ (* (sqrt A) c0) (sqrt (* l V)))))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double tmp;
if ((V * l) <= -1e+295) {
tmp = c0 * sqrt(((A / l) / V));
} else if ((V * l) <= -1e-171) {
tmp = (sqrt(-A) * c0) / sqrt((-V * l));
} else if ((V * l) <= 4e-314) {
tmp = c0 * sqrt(((A / V) / l));
} else {
tmp = (sqrt(A) * c0) / sqrt((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) :: tmp
if ((v * l) <= (-1d+295)) then
tmp = c0 * sqrt(((a / l) / v))
else if ((v * l) <= (-1d-171)) then
tmp = (sqrt(-a) * c0) / sqrt((-v * l))
else if ((v * l) <= 4d-314) then
tmp = c0 * sqrt(((a / v) / l))
else
tmp = (sqrt(a) * c0) / sqrt((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 tmp;
if ((V * l) <= -1e+295) {
tmp = c0 * Math.sqrt(((A / l) / V));
} else if ((V * l) <= -1e-171) {
tmp = (Math.sqrt(-A) * c0) / Math.sqrt((-V * l));
} else if ((V * l) <= 4e-314) {
tmp = c0 * Math.sqrt(((A / V) / l));
} else {
tmp = (Math.sqrt(A) * c0) / Math.sqrt((l * V));
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): tmp = 0 if (V * l) <= -1e+295: tmp = c0 * math.sqrt(((A / l) / V)) elif (V * l) <= -1e-171: tmp = (math.sqrt(-A) * c0) / math.sqrt((-V * l)) elif (V * l) <= 4e-314: tmp = c0 * math.sqrt(((A / V) / l)) else: tmp = (math.sqrt(A) * c0) / math.sqrt((l * V)) 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+295) tmp = Float64(c0 * sqrt(Float64(Float64(A / l) / V))); elseif (Float64(V * l) <= -1e-171) tmp = Float64(Float64(sqrt(Float64(-A)) * c0) / sqrt(Float64(Float64(-V) * l))); elseif (Float64(V * l) <= 4e-314) tmp = Float64(c0 * sqrt(Float64(Float64(A / V) / l))); else tmp = Float64(Float64(sqrt(A) * c0) / sqrt(Float64(l * V))); 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+295)
tmp = c0 * sqrt(((A / l) / V));
elseif ((V * l) <= -1e-171)
tmp = (sqrt(-A) * c0) / sqrt((-V * l));
elseif ((V * l) <= 4e-314)
tmp = c0 * sqrt(((A / V) / l));
else
tmp = (sqrt(A) * c0) / sqrt((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_] := If[LessEqual[N[(V * l), $MachinePrecision], -1e+295], N[(c0 * N[Sqrt[N[(N[(A / l), $MachinePrecision] / V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], -1e-171], N[(N[(N[Sqrt[(-A)], $MachinePrecision] * c0), $MachinePrecision] / N[Sqrt[N[((-V) * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 4e-314], N[(c0 * N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[A], $MachinePrecision] * c0), $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
\mathbf{if}\;V \cdot \ell \leq -1 \cdot 10^{+295}:\\
\;\;\;\;c0 \cdot \sqrt{\frac{\frac{A}{\ell}}{V}}\\
\mathbf{elif}\;V \cdot \ell \leq -1 \cdot 10^{-171}:\\
\;\;\;\;\frac{\sqrt{-A} \cdot c0}{\sqrt{\left(-V\right) \cdot \ell}}\\
\mathbf{elif}\;V \cdot \ell \leq 4 \cdot 10^{-314}:\\
\;\;\;\;c0 \cdot \sqrt{\frac{\frac{A}{V}}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{A} \cdot c0}{\sqrt{\ell \cdot V}}\\
\end{array}
\end{array}
if (*.f64 V l) < -9.9999999999999998e294Initial program 32.9%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6450.1
Applied rewrites50.1%
if -9.9999999999999998e294 < (*.f64 V l) < -9.9999999999999998e-172Initial program 82.4%
lift-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
pow-to-expN/A
sinh-+-cosh-revN/A
flip-+N/A
sinh-coshN/A
sinh---cosh-revN/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
exp-negN/A
pow-to-expN/A
pow1/2N/A
lift-sqrt.f64N/A
Applied rewrites82.3%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l/N/A
lift-pow.f64N/A
unpow-1N/A
remove-double-divN/A
lift-sqrt.f64N/A
lift-/.f64N/A
frac-2negN/A
sqrt-divN/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f6494.5
Applied rewrites94.5%
if -9.9999999999999998e-172 < (*.f64 V l) < 3.9999999999e-314Initial program 70.4%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6478.7
Applied rewrites78.7%
if 3.9999999999e-314 < (*.f64 V l) Initial program 82.0%
lift-*.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
associate-*l/N/A
frac-2negN/A
frac-2negN/A
remove-double-negN/A
lower-/.f64N/A
distribute-lft-neg-inN/A
distribute-lft-neg-inN/A
remove-double-negN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6492.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6492.4
Applied rewrites92.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 (<= (sqrt (/ A (* V l))) 4e-155) (* c0 (sqrt (/ (/ A l) V))) (/ c0 (sqrt (/ (* V l) A)))))
assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double tmp;
if (sqrt((A / (V * l))) <= 4e-155) {
tmp = c0 * sqrt(((A / l) / V));
} else {
tmp = c0 / sqrt(((V * l) / A));
}
return tmp;
}
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
real(8) :: tmp
if (sqrt((a / (v * l))) <= 4d-155) then
tmp = c0 * sqrt(((a / l) / v))
else
tmp = c0 / sqrt(((v * l) / a))
end if
code = tmp
end function
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double tmp;
if (Math.sqrt((A / (V * l))) <= 4e-155) {
tmp = c0 * Math.sqrt(((A / l) / V));
} else {
tmp = c0 / Math.sqrt(((V * l) / A));
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): tmp = 0 if math.sqrt((A / (V * l))) <= 4e-155: tmp = c0 * math.sqrt(((A / l) / V)) else: tmp = c0 / math.sqrt(((V * l) / A)) return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) tmp = 0.0 if (sqrt(Float64(A / Float64(V * l))) <= 4e-155) tmp = Float64(c0 * sqrt(Float64(Float64(A / l) / V))); else tmp = Float64(c0 / sqrt(Float64(Float64(V * l) / A))); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
tmp = 0.0;
if (sqrt((A / (V * l))) <= 4e-155)
tmp = c0 * sqrt(((A / l) / V));
else
tmp = c0 / sqrt(((V * l) / A));
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function. code[c0_, A_, V_, l_] := If[LessEqual[N[Sqrt[N[(A / N[(V * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 4e-155], N[(c0 * N[Sqrt[N[(N[(A / l), $MachinePrecision] / V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(c0 / N[Sqrt[N[(N[(V * l), $MachinePrecision] / A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
\mathbf{if}\;\sqrt{\frac{A}{V \cdot \ell}} \leq 4 \cdot 10^{-155}:\\
\;\;\;\;c0 \cdot \sqrt{\frac{\frac{A}{\ell}}{V}}\\
\mathbf{else}:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{V \cdot \ell}{A}}}\\
\end{array}
\end{array}
if (sqrt.f64 (/.f64 A (*.f64 V l))) < 4.00000000000000006e-155Initial program 35.2%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6443.2
Applied rewrites43.2%
if 4.00000000000000006e-155 < (sqrt.f64 (/.f64 A (*.f64 V l))) Initial program 87.5%
lift-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
pow-to-expN/A
sinh-+-cosh-revN/A
flip-+N/A
sinh-coshN/A
sinh---cosh-revN/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
exp-negN/A
pow-to-expN/A
pow1/2N/A
lift-sqrt.f64N/A
Applied rewrites87.4%
Taylor expanded in A around 0
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f6488.0
Applied rewrites88.0%
lift-*.f64N/A
*-rgt-identity88.0
Applied rewrites88.0%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function. (FPCore (c0 A V l) :precision binary64 (if (<= A -5e-310) (/ (* (/ (sqrt (- A)) (sqrt (- V))) c0) (sqrt l)) (/ (* (sqrt A) c0) (sqrt (* l V)))))
assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double tmp;
if (A <= -5e-310) {
tmp = ((sqrt(-A) / sqrt(-V)) * c0) / sqrt(l);
} else {
tmp = (sqrt(A) * c0) / sqrt((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) :: tmp
if (a <= (-5d-310)) then
tmp = ((sqrt(-a) / sqrt(-v)) * c0) / sqrt(l)
else
tmp = (sqrt(a) * c0) / sqrt((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 tmp;
if (A <= -5e-310) {
tmp = ((Math.sqrt(-A) / Math.sqrt(-V)) * c0) / Math.sqrt(l);
} else {
tmp = (Math.sqrt(A) * c0) / Math.sqrt((l * V));
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): tmp = 0 if A <= -5e-310: tmp = ((math.sqrt(-A) / math.sqrt(-V)) * c0) / math.sqrt(l) else: tmp = (math.sqrt(A) * c0) / math.sqrt((l * V)) return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) tmp = 0.0 if (A <= -5e-310) tmp = Float64(Float64(Float64(sqrt(Float64(-A)) / sqrt(Float64(-V))) * c0) / sqrt(l)); else tmp = Float64(Float64(sqrt(A) * c0) / sqrt(Float64(l * V))); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
tmp = 0.0;
if (A <= -5e-310)
tmp = ((sqrt(-A) / sqrt(-V)) * c0) / sqrt(l);
else
tmp = (sqrt(A) * c0) / sqrt((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_] := If[LessEqual[A, -5e-310], N[(N[(N[(N[Sqrt[(-A)], $MachinePrecision] / N[Sqrt[(-V)], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[A], $MachinePrecision] * c0), $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
\mathbf{if}\;A \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\frac{\frac{\sqrt{-A}}{\sqrt{-V}} \cdot c0}{\sqrt{\ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{A} \cdot c0}{\sqrt{\ell \cdot V}}\\
\end{array}
\end{array}
if A < -4.999999999999985e-310Initial program 73.1%
lift-*.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
associate-*l/N/A
lift-*.f64N/A
sqrt-prodN/A
associate-/r*N/A
lower-/.f64N/A
associate-*l/N/A
sqrt-divN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6440.2
Applied rewrites40.2%
lift-sqrt.f64N/A
lift-/.f64N/A
frac-2negN/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-neg.f6445.9
Applied rewrites45.9%
if -4.999999999999985e-310 < A Initial program 79.0%
lift-*.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
associate-*l/N/A
frac-2negN/A
frac-2negN/A
remove-double-negN/A
lower-/.f64N/A
distribute-lft-neg-inN/A
distribute-lft-neg-inN/A
remove-double-negN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6488.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6488.4
Applied rewrites88.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 (<= A -5e-310) (/ (* (sqrt (- A)) c0) (* (sqrt (- V)) (sqrt l))) (/ (* (sqrt A) c0) (sqrt (* l V)))))
assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double tmp;
if (A <= -5e-310) {
tmp = (sqrt(-A) * c0) / (sqrt(-V) * sqrt(l));
} else {
tmp = (sqrt(A) * c0) / sqrt((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) :: tmp
if (a <= (-5d-310)) then
tmp = (sqrt(-a) * c0) / (sqrt(-v) * sqrt(l))
else
tmp = (sqrt(a) * c0) / sqrt((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 tmp;
if (A <= -5e-310) {
tmp = (Math.sqrt(-A) * c0) / (Math.sqrt(-V) * Math.sqrt(l));
} else {
tmp = (Math.sqrt(A) * c0) / Math.sqrt((l * V));
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): tmp = 0 if A <= -5e-310: tmp = (math.sqrt(-A) * c0) / (math.sqrt(-V) * math.sqrt(l)) else: tmp = (math.sqrt(A) * c0) / math.sqrt((l * V)) return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) tmp = 0.0 if (A <= -5e-310) tmp = Float64(Float64(sqrt(Float64(-A)) * c0) / Float64(sqrt(Float64(-V)) * sqrt(l))); else tmp = Float64(Float64(sqrt(A) * c0) / sqrt(Float64(l * V))); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
tmp = 0.0;
if (A <= -5e-310)
tmp = (sqrt(-A) * c0) / (sqrt(-V) * sqrt(l));
else
tmp = (sqrt(A) * c0) / sqrt((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_] := If[LessEqual[A, -5e-310], N[(N[(N[Sqrt[(-A)], $MachinePrecision] * c0), $MachinePrecision] / N[(N[Sqrt[(-V)], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[A], $MachinePrecision] * c0), $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
\mathbf{if}\;A \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\frac{\sqrt{-A} \cdot c0}{\sqrt{-V} \cdot \sqrt{\ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{A} \cdot c0}{\sqrt{\ell \cdot V}}\\
\end{array}
\end{array}
if A < -4.999999999999985e-310Initial program 73.1%
lift-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
pow-to-expN/A
sinh-+-cosh-revN/A
flip-+N/A
sinh-coshN/A
sinh---cosh-revN/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
exp-negN/A
pow-to-expN/A
pow1/2N/A
lift-sqrt.f64N/A
Applied rewrites73.1%
lift-/.f64N/A
lift-*.f64N/A
*-rgt-identityN/A
lift-pow.f64N/A
unpow-1N/A
associate-/r/N/A
/-rgt-identityN/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
associate-*l/N/A
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
sqrt-prodN/A
lift-sqrt.f64N/A
frac-timesN/A
frac-2negN/A
Applied rewrites44.7%
if -4.999999999999985e-310 < A Initial program 79.0%
lift-*.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
associate-*l/N/A
frac-2negN/A
frac-2negN/A
remove-double-negN/A
lower-/.f64N/A
distribute-lft-neg-inN/A
distribute-lft-neg-inN/A
remove-double-negN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6488.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6488.4
Applied rewrites88.4%
Final simplification66.6%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function. (FPCore (c0 A V l) :precision binary64 (if (<= A -5e-310) (* c0 (/ (sqrt (/ A V)) (sqrt l))) (/ (* (sqrt A) c0) (sqrt (* l V)))))
assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double tmp;
if (A <= -5e-310) {
tmp = c0 * (sqrt((A / V)) / sqrt(l));
} else {
tmp = (sqrt(A) * c0) / sqrt((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) :: tmp
if (a <= (-5d-310)) then
tmp = c0 * (sqrt((a / v)) / sqrt(l))
else
tmp = (sqrt(a) * c0) / sqrt((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 tmp;
if (A <= -5e-310) {
tmp = c0 * (Math.sqrt((A / V)) / Math.sqrt(l));
} else {
tmp = (Math.sqrt(A) * c0) / Math.sqrt((l * V));
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): tmp = 0 if A <= -5e-310: tmp = c0 * (math.sqrt((A / V)) / math.sqrt(l)) else: tmp = (math.sqrt(A) * c0) / math.sqrt((l * V)) return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) tmp = 0.0 if (A <= -5e-310) tmp = Float64(c0 * Float64(sqrt(Float64(A / V)) / sqrt(l))); else tmp = Float64(Float64(sqrt(A) * c0) / sqrt(Float64(l * V))); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
tmp = 0.0;
if (A <= -5e-310)
tmp = c0 * (sqrt((A / V)) / sqrt(l));
else
tmp = (sqrt(A) * c0) / sqrt((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_] := If[LessEqual[A, -5e-310], N[(c0 * N[(N[Sqrt[N[(A / V), $MachinePrecision]], $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[A], $MachinePrecision] * c0), $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
\mathbf{if}\;A \leq -5 \cdot 10^{-310}:\\
\;\;\;\;c0 \cdot \frac{\sqrt{\frac{A}{V}}}{\sqrt{\ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{A} \cdot c0}{\sqrt{\ell \cdot V}}\\
\end{array}
\end{array}
if A < -4.999999999999985e-310Initial program 73.1%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6441.6
Applied rewrites41.6%
if -4.999999999999985e-310 < A Initial program 79.0%
lift-*.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
associate-*l/N/A
frac-2negN/A
frac-2negN/A
remove-double-negN/A
lower-/.f64N/A
distribute-lft-neg-inN/A
distribute-lft-neg-inN/A
remove-double-negN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6488.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6488.4
Applied rewrites88.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) 4e-314) (* c0 (sqrt (/ (/ A l) V))) (/ (* (sqrt A) c0) (sqrt (* l V)))))
assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double tmp;
if ((V * l) <= 4e-314) {
tmp = c0 * sqrt(((A / l) / V));
} else {
tmp = (sqrt(A) * c0) / sqrt((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) :: tmp
if ((v * l) <= 4d-314) then
tmp = c0 * sqrt(((a / l) / v))
else
tmp = (sqrt(a) * c0) / sqrt((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 tmp;
if ((V * l) <= 4e-314) {
tmp = c0 * Math.sqrt(((A / l) / V));
} else {
tmp = (Math.sqrt(A) * c0) / Math.sqrt((l * V));
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): tmp = 0 if (V * l) <= 4e-314: tmp = c0 * math.sqrt(((A / l) / V)) else: tmp = (math.sqrt(A) * c0) / math.sqrt((l * V)) return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) tmp = 0.0 if (Float64(V * l) <= 4e-314) tmp = Float64(c0 * sqrt(Float64(Float64(A / l) / V))); else tmp = Float64(Float64(sqrt(A) * c0) / sqrt(Float64(l * V))); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
tmp = 0.0;
if ((V * l) <= 4e-314)
tmp = c0 * sqrt(((A / l) / V));
else
tmp = (sqrt(A) * c0) / sqrt((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_] := If[LessEqual[N[(V * l), $MachinePrecision], 4e-314], N[(c0 * N[Sqrt[N[(N[(A / l), $MachinePrecision] / V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[A], $MachinePrecision] * c0), $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
\mathbf{if}\;V \cdot \ell \leq 4 \cdot 10^{-314}:\\
\;\;\;\;c0 \cdot \sqrt{\frac{\frac{A}{\ell}}{V}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{A} \cdot c0}{\sqrt{\ell \cdot V}}\\
\end{array}
\end{array}
if (*.f64 V l) < 3.9999999999e-314Initial program 71.2%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6474.2
Applied rewrites74.2%
if 3.9999999999e-314 < (*.f64 V l) Initial program 82.0%
lift-*.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
associate-*l/N/A
frac-2negN/A
frac-2negN/A
remove-double-negN/A
lower-/.f64N/A
distribute-lft-neg-inN/A
distribute-lft-neg-inN/A
remove-double-negN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6492.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6492.4
Applied rewrites92.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) 4e-314) (* c0 (sqrt (/ (/ A l) V))) (* (/ c0 (sqrt (* l V))) (sqrt A))))
assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double tmp;
if ((V * l) <= 4e-314) {
tmp = c0 * sqrt(((A / l) / V));
} else {
tmp = (c0 / sqrt((l * V))) * sqrt(A);
}
return tmp;
}
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
real(8) :: tmp
if ((v * l) <= 4d-314) then
tmp = c0 * sqrt(((a / l) / v))
else
tmp = (c0 / sqrt((l * v))) * sqrt(a)
end if
code = tmp
end function
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double tmp;
if ((V * l) <= 4e-314) {
tmp = c0 * Math.sqrt(((A / l) / V));
} else {
tmp = (c0 / Math.sqrt((l * V))) * Math.sqrt(A);
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): tmp = 0 if (V * l) <= 4e-314: tmp = c0 * math.sqrt(((A / l) / V)) else: tmp = (c0 / math.sqrt((l * V))) * math.sqrt(A) return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) tmp = 0.0 if (Float64(V * l) <= 4e-314) tmp = Float64(c0 * sqrt(Float64(Float64(A / l) / V))); else tmp = Float64(Float64(c0 / sqrt(Float64(l * V))) * sqrt(A)); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
tmp = 0.0;
if ((V * l) <= 4e-314)
tmp = c0 * sqrt(((A / l) / V));
else
tmp = (c0 / sqrt((l * V))) * sqrt(A);
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function. code[c0_, A_, V_, l_] := If[LessEqual[N[(V * l), $MachinePrecision], 4e-314], N[(c0 * N[Sqrt[N[(N[(A / l), $MachinePrecision] / V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(c0 / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[A], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
\mathbf{if}\;V \cdot \ell \leq 4 \cdot 10^{-314}:\\
\;\;\;\;c0 \cdot \sqrt{\frac{\frac{A}{\ell}}{V}}\\
\mathbf{else}:\\
\;\;\;\;\frac{c0}{\sqrt{\ell \cdot V}} \cdot \sqrt{A}\\
\end{array}
\end{array}
if (*.f64 V l) < 3.9999999999e-314Initial program 71.2%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6474.2
Applied rewrites74.2%
if 3.9999999999e-314 < (*.f64 V l) Initial program 82.0%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
associate-*r/N/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f6492.4
Applied rewrites92.4%
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 76.1%
herbie shell --seed 2024332
(FPCore (c0 A V l)
:name "Henrywood and Agarwal, Equation (3)"
:precision binary64
(* c0 (sqrt (/ A (* V l)))))