
(FPCore (x y z) :precision binary64 (* 2.0 (sqrt (+ (+ (* x y) (* x z)) (* y z)))))
double code(double x, double y, double z) {
return 2.0 * sqrt((((x * y) + (x * z)) + (y * z)));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = 2.0d0 * sqrt((((x * y) + (x * z)) + (y * z)))
end function
public static double code(double x, double y, double z) {
return 2.0 * Math.sqrt((((x * y) + (x * z)) + (y * z)));
}
def code(x, y, z): return 2.0 * math.sqrt((((x * y) + (x * z)) + (y * z)))
function code(x, y, z) return Float64(2.0 * sqrt(Float64(Float64(Float64(x * y) + Float64(x * z)) + Float64(y * z)))) end
function tmp = code(x, y, z) tmp = 2.0 * sqrt((((x * y) + (x * z)) + (y * z))); end
code[x_, y_, z_] := N[(2.0 * N[Sqrt[N[(N[(N[(x * y), $MachinePrecision] + N[(x * z), $MachinePrecision]), $MachinePrecision] + N[(y * z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
2 \cdot \sqrt{\left(x \cdot y + x \cdot z\right) + y \cdot z}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 10 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z) :precision binary64 (* 2.0 (sqrt (+ (+ (* x y) (* x z)) (* y z)))))
double code(double x, double y, double z) {
return 2.0 * sqrt((((x * y) + (x * z)) + (y * z)));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = 2.0d0 * sqrt((((x * y) + (x * z)) + (y * z)))
end function
public static double code(double x, double y, double z) {
return 2.0 * Math.sqrt((((x * y) + (x * z)) + (y * z)));
}
def code(x, y, z): return 2.0 * math.sqrt((((x * y) + (x * z)) + (y * z)))
function code(x, y, z) return Float64(2.0 * sqrt(Float64(Float64(Float64(x * y) + Float64(x * z)) + Float64(y * z)))) end
function tmp = code(x, y, z) tmp = 2.0 * sqrt((((x * y) + (x * z)) + (y * z))); end
code[x_, y_, z_] := N[(2.0 * N[Sqrt[N[(N[(N[(x * y), $MachinePrecision] + N[(x * z), $MachinePrecision]), $MachinePrecision] + N[(y * z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
2 \cdot \sqrt{\left(x \cdot y + x \cdot z\right) + y \cdot z}
\end{array}
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -8.8e-287) (* 2.0 (* (pow (/ -1.0 y) -0.5) (pow (/ 1.0 (- z x)) -0.5))) (* 2.0 (* (sqrt (+ y x)) (sqrt z)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -8.8e-287) {
tmp = 2.0 * (pow((-1.0 / y), -0.5) * pow((1.0 / (z - x)), -0.5));
} else {
tmp = 2.0 * (sqrt((y + x)) * sqrt(z));
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if (y <= (-8.8d-287)) then
tmp = 2.0d0 * ((((-1.0d0) / y) ** (-0.5d0)) * ((1.0d0 / (z - x)) ** (-0.5d0)))
else
tmp = 2.0d0 * (sqrt((y + x)) * sqrt(z))
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double tmp;
if (y <= -8.8e-287) {
tmp = 2.0 * (Math.pow((-1.0 / y), -0.5) * Math.pow((1.0 / (z - x)), -0.5));
} else {
tmp = 2.0 * (Math.sqrt((y + x)) * Math.sqrt(z));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= -8.8e-287: tmp = 2.0 * (math.pow((-1.0 / y), -0.5) * math.pow((1.0 / (z - x)), -0.5)) else: tmp = 2.0 * (math.sqrt((y + x)) * math.sqrt(z)) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -8.8e-287) tmp = Float64(2.0 * Float64((Float64(-1.0 / y) ^ -0.5) * (Float64(1.0 / Float64(z - x)) ^ -0.5))); else tmp = Float64(2.0 * Float64(sqrt(Float64(y + x)) * sqrt(z))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if (y <= -8.8e-287)
tmp = 2.0 * (((-1.0 / y) ^ -0.5) * ((1.0 / (z - x)) ^ -0.5));
else
tmp = 2.0 * (sqrt((y + x)) * sqrt(z));
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[y, -8.8e-287], N[(2.0 * N[(N[Power[N[(-1.0 / y), $MachinePrecision], -0.5], $MachinePrecision] * N[Power[N[(1.0 / N[(z - x), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[N[(y + x), $MachinePrecision]], $MachinePrecision] * N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -8.8 \cdot 10^{-287}:\\
\;\;\;\;2 \cdot \left({\left(\frac{-1}{y}\right)}^{-0.5} \cdot {\left(\frac{1}{z - x}\right)}^{-0.5}\right)\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{y + x} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < -8.8000000000000001e-287Initial program 69.5%
+-commutative69.5%
associate-+r+69.5%
*-commutative69.5%
+-commutative69.5%
associate-+l+69.5%
*-commutative69.5%
*-commutative69.5%
*-commutative69.5%
distribute-lft-out69.5%
Simplified69.5%
flip-+38.5%
clear-num38.5%
+-commutative38.5%
pow238.5%
pow238.5%
+-commutative38.5%
Applied egg-rr38.5%
inv-pow38.5%
sqrt-pow138.5%
clear-num38.5%
unpow238.5%
unpow238.5%
flip-+69.4%
fma-def69.5%
metadata-eval69.5%
Applied egg-rr69.5%
Taylor expanded in y around -inf 42.7%
associate-/r*43.7%
neg-mul-143.7%
+-commutative43.7%
unsub-neg43.7%
mul-1-neg43.7%
Simplified43.7%
div-inv43.7%
unpow-prod-down62.0%
add-sqr-sqrt48.6%
sqrt-unprod49.9%
sqr-neg49.9%
sqrt-unprod14.3%
add-sqr-sqrt24.1%
Applied egg-rr24.1%
if -8.8000000000000001e-287 < y Initial program 70.9%
+-commutative70.9%
associate-+r+70.9%
*-commutative70.9%
+-commutative70.9%
associate-+l+70.9%
*-commutative70.9%
*-commutative70.9%
*-commutative70.9%
distribute-lft-out71.0%
Simplified71.0%
Taylor expanded in z around inf 42.9%
+-commutative42.9%
Simplified42.9%
+-commutative42.9%
*-commutative42.9%
sqrt-prod43.1%
Applied egg-rr43.1%
Final simplification34.8%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 7.2e-304) (* 2.0 (pow (/ (/ -1.0 x) (- (- y) z)) -0.5)) (* 2.0 (* (sqrt (+ y x)) (sqrt z)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 7.2e-304) {
tmp = 2.0 * pow(((-1.0 / x) / (-y - z)), -0.5);
} else {
tmp = 2.0 * (sqrt((y + x)) * sqrt(z));
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if (y <= 7.2d-304) then
tmp = 2.0d0 * ((((-1.0d0) / x) / (-y - z)) ** (-0.5d0))
else
tmp = 2.0d0 * (sqrt((y + x)) * sqrt(z))
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double tmp;
if (y <= 7.2e-304) {
tmp = 2.0 * Math.pow(((-1.0 / x) / (-y - z)), -0.5);
} else {
tmp = 2.0 * (Math.sqrt((y + x)) * Math.sqrt(z));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= 7.2e-304: tmp = 2.0 * math.pow(((-1.0 / x) / (-y - z)), -0.5) else: tmp = 2.0 * (math.sqrt((y + x)) * math.sqrt(z)) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 7.2e-304) tmp = Float64(2.0 * (Float64(Float64(-1.0 / x) / Float64(Float64(-y) - z)) ^ -0.5)); else tmp = Float64(2.0 * Float64(sqrt(Float64(y + x)) * sqrt(z))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if (y <= 7.2e-304)
tmp = 2.0 * (((-1.0 / x) / (-y - z)) ^ -0.5);
else
tmp = 2.0 * (sqrt((y + x)) * sqrt(z));
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[y, 7.2e-304], N[(2.0 * N[Power[N[(N[(-1.0 / x), $MachinePrecision] / N[((-y) - z), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[N[(y + x), $MachinePrecision]], $MachinePrecision] * N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 7.2 \cdot 10^{-304}:\\
\;\;\;\;2 \cdot {\left(\frac{\frac{-1}{x}}{\left(-y\right) - z}\right)}^{-0.5}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{y + x} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < 7.2000000000000003e-304Initial program 70.5%
+-commutative70.5%
associate-+r+70.5%
*-commutative70.5%
+-commutative70.5%
associate-+l+70.5%
*-commutative70.5%
*-commutative70.5%
*-commutative70.5%
distribute-lft-out70.6%
Simplified70.6%
flip-+38.2%
clear-num38.1%
+-commutative38.1%
pow238.1%
pow238.1%
+-commutative38.1%
Applied egg-rr38.1%
inv-pow38.1%
sqrt-pow138.1%
clear-num38.1%
unpow238.1%
unpow238.1%
flip-+70.5%
fma-def70.5%
metadata-eval70.5%
Applied egg-rr70.5%
Taylor expanded in x around -inf 48.0%
associate-/r*49.1%
mul-1-neg49.1%
unsub-neg49.1%
mul-1-neg49.1%
Simplified49.1%
if 7.2000000000000003e-304 < y Initial program 70.1%
+-commutative70.1%
associate-+r+70.1%
*-commutative70.1%
+-commutative70.1%
associate-+l+70.1%
*-commutative70.1%
*-commutative70.1%
*-commutative70.1%
distribute-lft-out70.1%
Simplified70.1%
Taylor expanded in z around inf 41.3%
+-commutative41.3%
Simplified41.3%
+-commutative41.3%
*-commutative41.3%
sqrt-prod42.9%
Applied egg-rr42.9%
Final simplification45.8%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 1.25e-303) (* 2.0 (pow (/ (/ -1.0 x) (- (- y) z)) -0.5)) (* 2.0 (* (sqrt z) (sqrt y)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 1.25e-303) {
tmp = 2.0 * pow(((-1.0 / x) / (-y - z)), -0.5);
} else {
tmp = 2.0 * (sqrt(z) * sqrt(y));
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if (y <= 1.25d-303) then
tmp = 2.0d0 * ((((-1.0d0) / x) / (-y - z)) ** (-0.5d0))
else
tmp = 2.0d0 * (sqrt(z) * sqrt(y))
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double tmp;
if (y <= 1.25e-303) {
tmp = 2.0 * Math.pow(((-1.0 / x) / (-y - z)), -0.5);
} else {
tmp = 2.0 * (Math.sqrt(z) * Math.sqrt(y));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= 1.25e-303: tmp = 2.0 * math.pow(((-1.0 / x) / (-y - z)), -0.5) else: tmp = 2.0 * (math.sqrt(z) * math.sqrt(y)) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 1.25e-303) tmp = Float64(2.0 * (Float64(Float64(-1.0 / x) / Float64(Float64(-y) - z)) ^ -0.5)); else tmp = Float64(2.0 * Float64(sqrt(z) * sqrt(y))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if (y <= 1.25e-303)
tmp = 2.0 * (((-1.0 / x) / (-y - z)) ^ -0.5);
else
tmp = 2.0 * (sqrt(z) * sqrt(y));
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[y, 1.25e-303], N[(2.0 * N[Power[N[(N[(-1.0 / x), $MachinePrecision] / N[((-y) - z), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[z], $MachinePrecision] * N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 1.25 \cdot 10^{-303}:\\
\;\;\;\;2 \cdot {\left(\frac{\frac{-1}{x}}{\left(-y\right) - z}\right)}^{-0.5}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y}\right)\\
\end{array}
\end{array}
if y < 1.25e-303Initial program 70.5%
+-commutative70.5%
associate-+r+70.5%
*-commutative70.5%
+-commutative70.5%
associate-+l+70.5%
*-commutative70.5%
*-commutative70.5%
*-commutative70.5%
distribute-lft-out70.6%
Simplified70.6%
flip-+38.2%
clear-num38.1%
+-commutative38.1%
pow238.1%
pow238.1%
+-commutative38.1%
Applied egg-rr38.1%
inv-pow38.1%
sqrt-pow138.1%
clear-num38.1%
unpow238.1%
unpow238.1%
flip-+70.5%
fma-def70.5%
metadata-eval70.5%
Applied egg-rr70.5%
Taylor expanded in x around -inf 48.0%
associate-/r*49.1%
mul-1-neg49.1%
unsub-neg49.1%
mul-1-neg49.1%
Simplified49.1%
if 1.25e-303 < y Initial program 70.1%
+-commutative70.1%
associate-+r+70.1%
*-commutative70.1%
+-commutative70.1%
associate-+l+70.1%
*-commutative70.1%
*-commutative70.1%
*-commutative70.1%
distribute-lft-out70.1%
Simplified70.1%
Taylor expanded in x around 0 20.9%
sqrt-prod29.4%
Applied egg-rr29.4%
Final simplification38.3%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= x -7.5e-147) (* 2.0 (pow (/ (/ 1.0 y) (+ z x)) -0.5)) (* 2.0 (pow (/ (/ 1.0 z) (+ y x)) -0.5))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (x <= -7.5e-147) {
tmp = 2.0 * pow(((1.0 / y) / (z + x)), -0.5);
} else {
tmp = 2.0 * pow(((1.0 / z) / (y + x)), -0.5);
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if (x <= (-7.5d-147)) then
tmp = 2.0d0 * (((1.0d0 / y) / (z + x)) ** (-0.5d0))
else
tmp = 2.0d0 * (((1.0d0 / z) / (y + x)) ** (-0.5d0))
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double tmp;
if (x <= -7.5e-147) {
tmp = 2.0 * Math.pow(((1.0 / y) / (z + x)), -0.5);
} else {
tmp = 2.0 * Math.pow(((1.0 / z) / (y + x)), -0.5);
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if x <= -7.5e-147: tmp = 2.0 * math.pow(((1.0 / y) / (z + x)), -0.5) else: tmp = 2.0 * math.pow(((1.0 / z) / (y + x)), -0.5) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (x <= -7.5e-147) tmp = Float64(2.0 * (Float64(Float64(1.0 / y) / Float64(z + x)) ^ -0.5)); else tmp = Float64(2.0 * (Float64(Float64(1.0 / z) / Float64(y + x)) ^ -0.5)); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if (x <= -7.5e-147)
tmp = 2.0 * (((1.0 / y) / (z + x)) ^ -0.5);
else
tmp = 2.0 * (((1.0 / z) / (y + x)) ^ -0.5);
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[x, -7.5e-147], N[(2.0 * N[Power[N[(N[(1.0 / y), $MachinePrecision] / N[(z + x), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[Power[N[(N[(1.0 / z), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -7.5 \cdot 10^{-147}:\\
\;\;\;\;2 \cdot {\left(\frac{\frac{1}{y}}{z + x}\right)}^{-0.5}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot {\left(\frac{\frac{1}{z}}{y + x}\right)}^{-0.5}\\
\end{array}
\end{array}
if x < -7.50000000000000047e-147Initial program 64.5%
+-commutative64.5%
associate-+r+64.5%
*-commutative64.5%
+-commutative64.5%
associate-+l+64.5%
*-commutative64.5%
*-commutative64.5%
*-commutative64.5%
distribute-lft-out64.5%
Simplified64.5%
flip-+29.6%
clear-num29.6%
+-commutative29.6%
pow229.6%
pow229.6%
+-commutative29.6%
Applied egg-rr29.6%
inv-pow29.6%
sqrt-pow129.6%
clear-num29.6%
unpow229.6%
unpow229.6%
flip-+64.4%
fma-def64.6%
metadata-eval64.6%
Applied egg-rr64.6%
Taylor expanded in y around -inf 34.4%
associate-/r*34.4%
neg-mul-134.4%
+-commutative34.4%
unsub-neg34.4%
mul-1-neg34.4%
Simplified34.4%
Taylor expanded in y around 0 34.4%
associate-/r*34.4%
Simplified34.4%
if -7.50000000000000047e-147 < x Initial program 73.4%
+-commutative73.4%
associate-+r+73.4%
*-commutative73.4%
+-commutative73.4%
associate-+l+73.4%
*-commutative73.4%
*-commutative73.4%
*-commutative73.4%
distribute-lft-out73.4%
Simplified73.4%
flip-+39.3%
clear-num39.2%
+-commutative39.2%
pow239.2%
pow239.2%
+-commutative39.2%
Applied egg-rr39.2%
inv-pow39.2%
sqrt-pow139.2%
clear-num39.2%
unpow239.2%
unpow239.2%
flip-+73.4%
fma-def73.5%
metadata-eval73.5%
Applied egg-rr73.5%
Taylor expanded in z around inf 49.2%
associate-/r*50.4%
+-commutative50.4%
Simplified50.4%
Final simplification44.9%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (* 2.0 (sqrt (+ (* y x) (* z (+ y x))))))
assert(x < y && y < z);
double code(double x, double y, double z) {
return 2.0 * sqrt(((y * x) + (z * (y + x))));
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = 2.0d0 * sqrt(((y * x) + (z * (y + x))))
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
return 2.0 * Math.sqrt(((y * x) + (z * (y + x))));
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): return 2.0 * math.sqrt(((y * x) + (z * (y + x))))
x, y, z = sort([x, y, z]) function code(x, y, z) return Float64(2.0 * sqrt(Float64(Float64(y * x) + Float64(z * Float64(y + x))))) end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp = code(x, y, z)
tmp = 2.0 * sqrt(((y * x) + (z * (y + x))));
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := N[(2.0 * N[Sqrt[N[(N[(y * x), $MachinePrecision] + N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
2 \cdot \sqrt{y \cdot x + z \cdot \left(y + x\right)}
\end{array}
Initial program 70.3%
+-commutative70.3%
associate-+r+70.3%
*-commutative70.3%
+-commutative70.3%
associate-+l+70.3%
*-commutative70.3%
*-commutative70.3%
*-commutative70.3%
distribute-lft-out70.3%
Simplified70.3%
Final simplification70.3%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (* 2.0 (pow (/ (/ 1.0 y) (+ z x)) -0.5)))
assert(x < y && y < z);
double code(double x, double y, double z) {
return 2.0 * pow(((1.0 / y) / (z + x)), -0.5);
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = 2.0d0 * (((1.0d0 / y) / (z + x)) ** (-0.5d0))
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
return 2.0 * Math.pow(((1.0 / y) / (z + x)), -0.5);
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): return 2.0 * math.pow(((1.0 / y) / (z + x)), -0.5)
x, y, z = sort([x, y, z]) function code(x, y, z) return Float64(2.0 * (Float64(Float64(1.0 / y) / Float64(z + x)) ^ -0.5)) end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp = code(x, y, z)
tmp = 2.0 * (((1.0 / y) / (z + x)) ^ -0.5);
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := N[(2.0 * N[Power[N[(N[(1.0 / y), $MachinePrecision] / N[(z + x), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
2 \cdot {\left(\frac{\frac{1}{y}}{z + x}\right)}^{-0.5}
\end{array}
Initial program 70.3%
+-commutative70.3%
associate-+r+70.3%
*-commutative70.3%
+-commutative70.3%
associate-+l+70.3%
*-commutative70.3%
*-commutative70.3%
*-commutative70.3%
distribute-lft-out70.3%
Simplified70.3%
flip-+35.9%
clear-num35.9%
+-commutative35.9%
pow235.9%
pow235.9%
+-commutative35.9%
Applied egg-rr35.9%
inv-pow35.9%
sqrt-pow135.9%
clear-num35.9%
unpow235.9%
unpow235.9%
flip-+70.3%
fma-def70.5%
metadata-eval70.5%
Applied egg-rr70.5%
Taylor expanded in y around -inf 45.3%
associate-/r*45.7%
neg-mul-145.7%
+-commutative45.7%
unsub-neg45.7%
mul-1-neg45.7%
Simplified45.7%
Taylor expanded in y around 0 45.3%
associate-/r*45.7%
Simplified45.7%
Final simplification45.7%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -1.65e-265) (* 2.0 (sqrt (* x (+ y z)))) (* 2.0 (sqrt (* y z)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -1.65e-265) {
tmp = 2.0 * sqrt((x * (y + z)));
} else {
tmp = 2.0 * sqrt((y * z));
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if (y <= (-1.65d-265)) then
tmp = 2.0d0 * sqrt((x * (y + z)))
else
tmp = 2.0d0 * sqrt((y * z))
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double tmp;
if (y <= -1.65e-265) {
tmp = 2.0 * Math.sqrt((x * (y + z)));
} else {
tmp = 2.0 * Math.sqrt((y * z));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= -1.65e-265: tmp = 2.0 * math.sqrt((x * (y + z))) else: tmp = 2.0 * math.sqrt((y * z)) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -1.65e-265) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z)))); else tmp = Float64(2.0 * sqrt(Float64(y * z))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if (y <= -1.65e-265)
tmp = 2.0 * sqrt((x * (y + z)));
else
tmp = 2.0 * sqrt((y * z));
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[y, -1.65e-265], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[Sqrt[N[(y * z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -1.65 \cdot 10^{-265}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot z}\\
\end{array}
\end{array}
if y < -1.65000000000000001e-265Initial program 70.1%
+-commutative70.1%
associate-+r+70.1%
*-commutative70.1%
+-commutative70.1%
associate-+l+70.1%
*-commutative70.1%
*-commutative70.1%
*-commutative70.1%
distribute-lft-out70.2%
Simplified70.2%
Taylor expanded in x around inf 45.6%
if -1.65000000000000001e-265 < y Initial program 70.4%
+-commutative70.4%
associate-+r+70.4%
*-commutative70.4%
+-commutative70.4%
associate-+l+70.4%
*-commutative70.4%
*-commutative70.4%
*-commutative70.4%
distribute-lft-out70.4%
Simplified70.4%
Taylor expanded in x around 0 19.7%
Final simplification30.3%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -1.65e-265) (* 2.0 (sqrt (* x (+ y z)))) (* 2.0 (sqrt (* z (+ y x))))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -1.65e-265) {
tmp = 2.0 * sqrt((x * (y + z)));
} else {
tmp = 2.0 * sqrt((z * (y + x)));
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if (y <= (-1.65d-265)) then
tmp = 2.0d0 * sqrt((x * (y + z)))
else
tmp = 2.0d0 * sqrt((z * (y + x)))
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double tmp;
if (y <= -1.65e-265) {
tmp = 2.0 * Math.sqrt((x * (y + z)));
} else {
tmp = 2.0 * Math.sqrt((z * (y + x)));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= -1.65e-265: tmp = 2.0 * math.sqrt((x * (y + z))) else: tmp = 2.0 * math.sqrt((z * (y + x))) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -1.65e-265) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z)))); else tmp = Float64(2.0 * sqrt(Float64(z * Float64(y + x)))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if (y <= -1.65e-265)
tmp = 2.0 * sqrt((x * (y + z)));
else
tmp = 2.0 * sqrt((z * (y + x)));
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[y, -1.65e-265], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[Sqrt[N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -1.65 \cdot 10^{-265}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{z \cdot \left(y + x\right)}\\
\end{array}
\end{array}
if y < -1.65000000000000001e-265Initial program 70.1%
+-commutative70.1%
associate-+r+70.1%
*-commutative70.1%
+-commutative70.1%
associate-+l+70.1%
*-commutative70.1%
*-commutative70.1%
*-commutative70.1%
distribute-lft-out70.2%
Simplified70.2%
Taylor expanded in x around inf 45.6%
if -1.65000000000000001e-265 < y Initial program 70.4%
+-commutative70.4%
associate-+r+70.4%
*-commutative70.4%
+-commutative70.4%
associate-+l+70.4%
*-commutative70.4%
*-commutative70.4%
*-commutative70.4%
distribute-lft-out70.4%
Simplified70.4%
Taylor expanded in z around inf 43.7%
+-commutative43.7%
Simplified43.7%
Final simplification44.5%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -1.65e-265) (* 2.0 (sqrt (* y x))) (* 2.0 (sqrt (* y z)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -1.65e-265) {
tmp = 2.0 * sqrt((y * x));
} else {
tmp = 2.0 * sqrt((y * z));
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if (y <= (-1.65d-265)) then
tmp = 2.0d0 * sqrt((y * x))
else
tmp = 2.0d0 * sqrt((y * z))
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double tmp;
if (y <= -1.65e-265) {
tmp = 2.0 * Math.sqrt((y * x));
} else {
tmp = 2.0 * Math.sqrt((y * z));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= -1.65e-265: tmp = 2.0 * math.sqrt((y * x)) else: tmp = 2.0 * math.sqrt((y * z)) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -1.65e-265) tmp = Float64(2.0 * sqrt(Float64(y * x))); else tmp = Float64(2.0 * sqrt(Float64(y * z))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if (y <= -1.65e-265)
tmp = 2.0 * sqrt((y * x));
else
tmp = 2.0 * sqrt((y * z));
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[y, -1.65e-265], N[(2.0 * N[Sqrt[N[(y * x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[Sqrt[N[(y * z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -1.65 \cdot 10^{-265}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot x}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot z}\\
\end{array}
\end{array}
if y < -1.65000000000000001e-265Initial program 70.1%
+-commutative70.1%
associate-+r+70.1%
*-commutative70.1%
+-commutative70.1%
associate-+l+70.1%
*-commutative70.1%
*-commutative70.1%
*-commutative70.1%
distribute-lft-out70.2%
Simplified70.2%
Taylor expanded in z around 0 20.5%
*-commutative20.5%
Simplified20.5%
if -1.65000000000000001e-265 < y Initial program 70.4%
+-commutative70.4%
associate-+r+70.4%
*-commutative70.4%
+-commutative70.4%
associate-+l+70.4%
*-commutative70.4%
*-commutative70.4%
*-commutative70.4%
distribute-lft-out70.4%
Simplified70.4%
Taylor expanded in x around 0 19.7%
Final simplification20.0%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (* 2.0 (sqrt (* y x))))
assert(x < y && y < z);
double code(double x, double y, double z) {
return 2.0 * sqrt((y * x));
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = 2.0d0 * sqrt((y * x))
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
return 2.0 * Math.sqrt((y * x));
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): return 2.0 * math.sqrt((y * x))
x, y, z = sort([x, y, z]) function code(x, y, z) return Float64(2.0 * sqrt(Float64(y * x))) end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp = code(x, y, z)
tmp = 2.0 * sqrt((y * x));
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := N[(2.0 * N[Sqrt[N[(y * x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
2 \cdot \sqrt{y \cdot x}
\end{array}
Initial program 70.3%
+-commutative70.3%
associate-+r+70.3%
*-commutative70.3%
+-commutative70.3%
associate-+l+70.3%
*-commutative70.3%
*-commutative70.3%
*-commutative70.3%
distribute-lft-out70.3%
Simplified70.3%
Taylor expanded in z around 0 24.6%
*-commutative24.6%
Simplified24.6%
Final simplification24.6%
(FPCore (x y z)
:precision binary64
(let* ((t_0
(+
(* 0.25 (* (* (pow y -0.75) (* (pow z -0.75) x)) (+ y z)))
(* (pow z 0.25) (pow y 0.25)))))
(if (< z 7.636950090573675e+176)
(* 2.0 (sqrt (+ (* (+ x y) z) (* x y))))
(* (* t_0 t_0) 2.0))))
double code(double x, double y, double z) {
double t_0 = (0.25 * ((pow(y, -0.75) * (pow(z, -0.75) * x)) * (y + z))) + (pow(z, 0.25) * pow(y, 0.25));
double tmp;
if (z < 7.636950090573675e+176) {
tmp = 2.0 * sqrt((((x + y) * z) + (x * y)));
} else {
tmp = (t_0 * t_0) * 2.0;
}
return tmp;
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: t_0
real(8) :: tmp
t_0 = (0.25d0 * (((y ** (-0.75d0)) * ((z ** (-0.75d0)) * x)) * (y + z))) + ((z ** 0.25d0) * (y ** 0.25d0))
if (z < 7.636950090573675d+176) then
tmp = 2.0d0 * sqrt((((x + y) * z) + (x * y)))
else
tmp = (t_0 * t_0) * 2.0d0
end if
code = tmp
end function
public static double code(double x, double y, double z) {
double t_0 = (0.25 * ((Math.pow(y, -0.75) * (Math.pow(z, -0.75) * x)) * (y + z))) + (Math.pow(z, 0.25) * Math.pow(y, 0.25));
double tmp;
if (z < 7.636950090573675e+176) {
tmp = 2.0 * Math.sqrt((((x + y) * z) + (x * y)));
} else {
tmp = (t_0 * t_0) * 2.0;
}
return tmp;
}
def code(x, y, z): t_0 = (0.25 * ((math.pow(y, -0.75) * (math.pow(z, -0.75) * x)) * (y + z))) + (math.pow(z, 0.25) * math.pow(y, 0.25)) tmp = 0 if z < 7.636950090573675e+176: tmp = 2.0 * math.sqrt((((x + y) * z) + (x * y))) else: tmp = (t_0 * t_0) * 2.0 return tmp
function code(x, y, z) t_0 = Float64(Float64(0.25 * Float64(Float64((y ^ -0.75) * Float64((z ^ -0.75) * x)) * Float64(y + z))) + Float64((z ^ 0.25) * (y ^ 0.25))) tmp = 0.0 if (z < 7.636950090573675e+176) tmp = Float64(2.0 * sqrt(Float64(Float64(Float64(x + y) * z) + Float64(x * y)))); else tmp = Float64(Float64(t_0 * t_0) * 2.0); end return tmp end
function tmp_2 = code(x, y, z) t_0 = (0.25 * (((y ^ -0.75) * ((z ^ -0.75) * x)) * (y + z))) + ((z ^ 0.25) * (y ^ 0.25)); tmp = 0.0; if (z < 7.636950090573675e+176) tmp = 2.0 * sqrt((((x + y) * z) + (x * y))); else tmp = (t_0 * t_0) * 2.0; end tmp_2 = tmp; end
code[x_, y_, z_] := Block[{t$95$0 = N[(N[(0.25 * N[(N[(N[Power[y, -0.75], $MachinePrecision] * N[(N[Power[z, -0.75], $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision] * N[(y + z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Power[z, 0.25], $MachinePrecision] * N[Power[y, 0.25], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[Less[z, 7.636950090573675e+176], N[(2.0 * N[Sqrt[N[(N[(N[(x + y), $MachinePrecision] * z), $MachinePrecision] + N[(x * y), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(t$95$0 * t$95$0), $MachinePrecision] * 2.0), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := 0.25 \cdot \left(\left({y}^{-0.75} \cdot \left({z}^{-0.75} \cdot x\right)\right) \cdot \left(y + z\right)\right) + {z}^{0.25} \cdot {y}^{0.25}\\
\mathbf{if}\;z < 7.636950090573675 \cdot 10^{+176}:\\
\;\;\;\;2 \cdot \sqrt{\left(x + y\right) \cdot z + x \cdot y}\\
\mathbf{else}:\\
\;\;\;\;\left(t_0 \cdot t_0\right) \cdot 2\\
\end{array}
\end{array}
herbie shell --seed 2023279
(FPCore (x y z)
:name "Diagrams.TwoD.Apollonian:descartes from diagrams-contrib-1.3.0.5"
:precision binary64
:herbie-target
(if (< z 7.636950090573675e+176) (* 2.0 (sqrt (+ (* (+ x y) z) (* x y)))) (* (* (+ (* 0.25 (* (* (pow y -0.75) (* (pow z -0.75) x)) (+ y z))) (* (pow z 0.25) (pow y 0.25))) (+ (* 0.25 (* (* (pow y -0.75) (* (pow z -0.75) x)) (+ y z))) (* (pow z 0.25) (pow y 0.25)))) 2.0))
(* 2.0 (sqrt (+ (+ (* x y) (* x z)) (* y z)))))