
(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 11 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 -6.7e+47)
(pow
(*
(cbrt 2.0)
(exp (* 0.16666666666666666 (- (log (- (- x) z)) (log (/ -1.0 y))))))
3.0)
(if (<= y 2.25e-256)
(* 2.0 (sqrt (fma x y (* z (+ y x)))))
(* 2.0 (* (sqrt z) (sqrt y))))))assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -6.7e+47) {
tmp = pow((cbrt(2.0) * exp((0.16666666666666666 * (log((-x - z)) - log((-1.0 / y)))))), 3.0);
} else if (y <= 2.25e-256) {
tmp = 2.0 * sqrt(fma(x, y, (z * (y + x))));
} else {
tmp = 2.0 * (sqrt(z) * sqrt(y));
}
return tmp;
}
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -6.7e+47) tmp = Float64(cbrt(2.0) * exp(Float64(0.16666666666666666 * Float64(log(Float64(Float64(-x) - z)) - log(Float64(-1.0 / y)))))) ^ 3.0; elseif (y <= 2.25e-256) tmp = Float64(2.0 * sqrt(fma(x, y, Float64(z * Float64(y + x))))); else tmp = Float64(2.0 * Float64(sqrt(z) * sqrt(y))); end return tmp end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[y, -6.7e+47], N[Power[N[(N[Power[2.0, 1/3], $MachinePrecision] * N[Exp[N[(0.16666666666666666 * N[(N[Log[N[((-x) - z), $MachinePrecision]], $MachinePrecision] - N[Log[N[(-1.0 / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 3.0], $MachinePrecision], If[LessEqual[y, 2.25e-256], N[(2.0 * N[Sqrt[N[(x * y + N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $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 -6.7 \cdot 10^{+47}:\\
\;\;\;\;{\left(\sqrt[3]{2} \cdot e^{0.16666666666666666 \cdot \left(\log \left(\left(-x\right) - z\right) - \log \left(\frac{-1}{y}\right)\right)}\right)}^{3}\\
\mathbf{elif}\;y \leq 2.25 \cdot 10^{-256}:\\
\;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, y, z \cdot \left(y + x\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y}\right)\\
\end{array}
\end{array}
if y < -6.69999999999999973e47Initial program 46.9%
+-commutative46.9%
associate-+r+46.9%
*-commutative46.9%
+-commutative46.9%
associate-+l+46.9%
*-commutative46.9%
distribute-rgt-in46.9%
Simplified46.9%
add-sqr-sqrt46.6%
sqrt-unprod46.9%
swap-sqr46.9%
add-sqr-sqrt46.9%
distribute-rgt-in46.9%
associate-+r+46.9%
*-commutative46.9%
distribute-lft-in47.0%
+-commutative47.0%
fma-undefine47.1%
add-sqr-sqrt47.1%
swap-sqr47.1%
sqrt-unprod46.8%
add-sqr-sqrt47.1%
Applied egg-rr46.3%
Taylor expanded in y around -inf 83.8%
if -6.69999999999999973e47 < y < 2.2500000000000001e-256Initial program 84.5%
associate-+l+84.5%
*-commutative84.5%
*-commutative84.5%
*-commutative84.5%
+-commutative84.5%
+-commutative84.5%
associate-+l+84.5%
*-commutative84.5%
*-commutative84.5%
+-commutative84.5%
+-commutative84.5%
*-commutative84.5%
*-commutative84.5%
associate-+l+84.5%
+-commutative84.5%
*-commutative84.5%
fma-define84.5%
Simplified84.5%
if 2.2500000000000001e-256 < y Initial program 71.3%
+-commutative71.3%
associate-+r+71.3%
*-commutative71.3%
+-commutative71.3%
associate-+l+71.3%
*-commutative71.3%
distribute-rgt-in71.3%
Simplified71.3%
add-sqr-sqrt70.9%
sqrt-unprod70.5%
swap-sqr70.5%
add-sqr-sqrt70.5%
distribute-rgt-in70.4%
associate-+r+70.4%
*-commutative70.4%
distribute-lft-in70.5%
+-commutative70.5%
fma-undefine70.7%
add-sqr-sqrt70.7%
swap-sqr70.7%
sqrt-unprod71.1%
add-sqr-sqrt71.5%
Applied egg-rr70.0%
Taylor expanded in x around 0 27.8%
rem-cube-cbrt28.6%
Simplified28.6%
*-commutative28.6%
sqrt-prod35.5%
Applied egg-rr35.5%
Final simplification63.1%
NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
:precision binary64
(if (<= y 2.1e-268)
(pow
(*
(cbrt 2.0)
(exp (* 0.16666666666666666 (- (log (- (- y) z)) (log (/ -1.0 x))))))
3.0)
(* 2.0 (* (sqrt z) (sqrt y)))))assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 2.1e-268) {
tmp = pow((cbrt(2.0) * exp((0.16666666666666666 * (log((-y - z)) - log((-1.0 / x)))))), 3.0);
} else {
tmp = 2.0 * (sqrt(z) * sqrt(y));
}
return tmp;
}
assert x < y && y < z;
public static double code(double x, double y, double z) {
double tmp;
if (y <= 2.1e-268) {
tmp = Math.pow((Math.cbrt(2.0) * Math.exp((0.16666666666666666 * (Math.log((-y - z)) - Math.log((-1.0 / x)))))), 3.0);
} 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 <= 2.1e-268) tmp = Float64(cbrt(2.0) * exp(Float64(0.16666666666666666 * Float64(log(Float64(Float64(-y) - z)) - log(Float64(-1.0 / x)))))) ^ 3.0; else tmp = Float64(2.0 * Float64(sqrt(z) * sqrt(y))); end return tmp end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[y, 2.1e-268], N[Power[N[(N[Power[2.0, 1/3], $MachinePrecision] * N[Exp[N[(0.16666666666666666 * N[(N[Log[N[((-y) - z), $MachinePrecision]], $MachinePrecision] - N[Log[N[(-1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 3.0], $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 2.1 \cdot 10^{-268}:\\
\;\;\;\;{\left(\sqrt[3]{2} \cdot e^{0.16666666666666666 \cdot \left(\log \left(\left(-y\right) - z\right) - \log \left(\frac{-1}{x}\right)\right)}\right)}^{3}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y}\right)\\
\end{array}
\end{array}
if y < 2.09999999999999998e-268Initial program 69.0%
+-commutative69.0%
associate-+r+69.0%
*-commutative69.0%
+-commutative69.0%
associate-+l+69.0%
*-commutative69.0%
distribute-rgt-in69.0%
Simplified69.0%
add-sqr-sqrt68.6%
sqrt-unprod69.0%
swap-sqr69.0%
add-sqr-sqrt69.0%
distribute-rgt-in69.0%
associate-+r+69.0%
*-commutative69.0%
distribute-lft-in69.0%
+-commutative69.0%
fma-undefine69.1%
add-sqr-sqrt69.1%
swap-sqr69.1%
sqrt-unprod68.7%
add-sqr-sqrt69.1%
Applied egg-rr67.7%
Taylor expanded in x around -inf 40.7%
if 2.09999999999999998e-268 < y Initial program 71.5%
+-commutative71.5%
associate-+r+71.5%
*-commutative71.5%
+-commutative71.5%
associate-+l+71.5%
*-commutative71.5%
distribute-rgt-in71.6%
Simplified71.6%
add-sqr-sqrt71.1%
sqrt-unprod70.8%
swap-sqr70.8%
add-sqr-sqrt70.8%
distribute-rgt-in70.7%
associate-+r+70.7%
*-commutative70.7%
distribute-lft-in70.8%
+-commutative70.8%
fma-undefine71.0%
add-sqr-sqrt71.0%
swap-sqr71.0%
sqrt-unprod71.3%
add-sqr-sqrt71.8%
Applied egg-rr70.3%
Taylor expanded in x around 0 28.4%
rem-cube-cbrt29.2%
Simplified29.2%
*-commutative29.2%
sqrt-prod36.1%
Applied egg-rr36.1%
Final simplification38.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.45e+31)
(*
y
(-
(* (* z x) (sqrt (/ 1.0 (* (+ z x) (pow y 3.0)))))
(* 2.0 (sqrt (/ (+ z x) y)))))
(if (<= y 2.25e-256)
(* 2.0 (sqrt (fma x y (* z (+ y x)))))
(* 2.0 (* (sqrt z) (sqrt y))))))assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -1.45e+31) {
tmp = y * (((z * x) * sqrt((1.0 / ((z + x) * pow(y, 3.0))))) - (2.0 * sqrt(((z + x) / y))));
} else if (y <= 2.25e-256) {
tmp = 2.0 * sqrt(fma(x, y, (z * (y + x))));
} else {
tmp = 2.0 * (sqrt(z) * sqrt(y));
}
return tmp;
}
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -1.45e+31) tmp = Float64(y * Float64(Float64(Float64(z * x) * sqrt(Float64(1.0 / Float64(Float64(z + x) * (y ^ 3.0))))) - Float64(2.0 * sqrt(Float64(Float64(z + x) / y))))); elseif (y <= 2.25e-256) tmp = Float64(2.0 * sqrt(fma(x, y, Float64(z * Float64(y + x))))); else tmp = Float64(2.0 * Float64(sqrt(z) * sqrt(y))); end return 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.45e+31], N[(y * N[(N[(N[(z * x), $MachinePrecision] * N[Sqrt[N[(1.0 / N[(N[(z + x), $MachinePrecision] * N[Power[y, 3.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(2.0 * N[Sqrt[N[(N[(z + x), $MachinePrecision] / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 2.25e-256], N[(2.0 * N[Sqrt[N[(x * y + N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $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.45 \cdot 10^{+31}:\\
\;\;\;\;y \cdot \left(\left(z \cdot x\right) \cdot \sqrt{\frac{1}{\left(z + x\right) \cdot {y}^{3}}} - 2 \cdot \sqrt{\frac{z + x}{y}}\right)\\
\mathbf{elif}\;y \leq 2.25 \cdot 10^{-256}:\\
\;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, y, z \cdot \left(y + x\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y}\right)\\
\end{array}
\end{array}
if y < -1.45e31Initial program 50.2%
+-commutative50.2%
associate-+r+50.2%
*-commutative50.2%
+-commutative50.2%
associate-+l+50.2%
*-commutative50.2%
distribute-rgt-in50.2%
Simplified50.2%
Taylor expanded in y around inf 0.8%
Taylor expanded in y around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt81.8%
+-commutative81.8%
Simplified81.8%
if -1.45e31 < y < 2.2500000000000001e-256Initial program 83.8%
associate-+l+83.8%
*-commutative83.8%
*-commutative83.8%
*-commutative83.8%
+-commutative83.8%
+-commutative83.8%
associate-+l+83.8%
*-commutative83.8%
*-commutative83.8%
+-commutative83.8%
+-commutative83.8%
*-commutative83.8%
*-commutative83.8%
associate-+l+83.8%
+-commutative83.8%
*-commutative83.8%
fma-define83.8%
Simplified83.8%
if 2.2500000000000001e-256 < y Initial program 71.3%
+-commutative71.3%
associate-+r+71.3%
*-commutative71.3%
+-commutative71.3%
associate-+l+71.3%
*-commutative71.3%
distribute-rgt-in71.3%
Simplified71.3%
add-sqr-sqrt70.9%
sqrt-unprod70.5%
swap-sqr70.5%
add-sqr-sqrt70.5%
distribute-rgt-in70.4%
associate-+r+70.4%
*-commutative70.4%
distribute-lft-in70.5%
+-commutative70.5%
fma-undefine70.7%
add-sqr-sqrt70.7%
swap-sqr70.7%
sqrt-unprod71.1%
add-sqr-sqrt71.5%
Applied egg-rr70.0%
Taylor expanded in x around 0 27.8%
rem-cube-cbrt28.6%
Simplified28.6%
*-commutative28.6%
sqrt-prod35.5%
Applied egg-rr35.5%
Final simplification62.4%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 2.25e-256) (* 2.0 (sqrt (fma x z (* y (+ z x))))) (* 2.0 (* (sqrt z) (sqrt y)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 2.25e-256) {
tmp = 2.0 * sqrt(fma(x, z, (y * (z + x))));
} else {
tmp = 2.0 * (sqrt(z) * sqrt(y));
}
return tmp;
}
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 2.25e-256) tmp = Float64(2.0 * sqrt(fma(x, z, Float64(y * Float64(z + x))))); else tmp = Float64(2.0 * Float64(sqrt(z) * sqrt(y))); end return tmp end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[y, 2.25e-256], N[(2.0 * N[Sqrt[N[(x * z + N[(y * N[(z + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $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 2.25 \cdot 10^{-256}:\\
\;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, z, y \cdot \left(z + x\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y}\right)\\
\end{array}
\end{array}
if y < 2.2500000000000001e-256Initial program 69.2%
associate-+l+69.2%
*-commutative69.2%
*-commutative69.2%
*-commutative69.2%
+-commutative69.2%
+-commutative69.2%
+-commutative69.2%
*-commutative69.2%
*-commutative69.2%
associate-+l+69.2%
+-commutative69.2%
fma-define69.2%
distribute-lft-out69.3%
Simplified69.3%
if 2.2500000000000001e-256 < y Initial program 71.3%
+-commutative71.3%
associate-+r+71.3%
*-commutative71.3%
+-commutative71.3%
associate-+l+71.3%
*-commutative71.3%
distribute-rgt-in71.3%
Simplified71.3%
add-sqr-sqrt70.9%
sqrt-unprod70.5%
swap-sqr70.5%
add-sqr-sqrt70.5%
distribute-rgt-in70.4%
associate-+r+70.4%
*-commutative70.4%
distribute-lft-in70.5%
+-commutative70.5%
fma-undefine70.7%
add-sqr-sqrt70.7%
swap-sqr70.7%
sqrt-unprod71.1%
add-sqr-sqrt71.5%
Applied egg-rr70.0%
Taylor expanded in x around 0 27.8%
rem-cube-cbrt28.6%
Simplified28.6%
*-commutative28.6%
sqrt-prod35.5%
Applied egg-rr35.5%
Final simplification54.6%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 9.2e-269) (* 2.0 (sqrt (* x (* y (+ 1.0 (/ z y)))))) (* 2.0 (* (sqrt z) (sqrt y)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 9.2e-269) {
tmp = 2.0 * sqrt((x * (y * (1.0 + (z / y)))));
} 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 <= 9.2d-269) then
tmp = 2.0d0 * sqrt((x * (y * (1.0d0 + (z / y)))))
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 <= 9.2e-269) {
tmp = 2.0 * Math.sqrt((x * (y * (1.0 + (z / y)))));
} 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 <= 9.2e-269: tmp = 2.0 * math.sqrt((x * (y * (1.0 + (z / y))))) 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 <= 9.2e-269) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y * Float64(1.0 + Float64(z / y)))))); 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 <= 9.2e-269)
tmp = 2.0 * sqrt((x * (y * (1.0 + (z / y)))));
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, 9.2e-269], N[(2.0 * N[Sqrt[N[(x * N[(y * N[(1.0 + N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $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 9.2 \cdot 10^{-269}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y \cdot \left(1 + \frac{z}{y}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y}\right)\\
\end{array}
\end{array}
if y < 9.1999999999999999e-269Initial program 69.0%
associate-+l+69.0%
*-commutative69.0%
*-commutative69.0%
*-commutative69.0%
+-commutative69.0%
+-commutative69.0%
associate-+l+69.0%
*-commutative69.0%
*-commutative69.0%
+-commutative69.0%
+-commutative69.0%
*-commutative69.0%
*-commutative69.0%
associate-+l+69.0%
+-commutative69.0%
*-commutative69.0%
fma-define69.0%
Simplified69.2%
Taylor expanded in y around inf 59.8%
associate-+r+59.8%
+-commutative59.8%
associate-/l*54.3%
Simplified54.3%
Taylor expanded in x around inf 45.6%
if 9.1999999999999999e-269 < y Initial program 71.5%
+-commutative71.5%
associate-+r+71.5%
*-commutative71.5%
+-commutative71.5%
associate-+l+71.5%
*-commutative71.5%
distribute-rgt-in71.6%
Simplified71.6%
add-sqr-sqrt71.1%
sqrt-unprod70.8%
swap-sqr70.8%
add-sqr-sqrt70.8%
distribute-rgt-in70.7%
associate-+r+70.7%
*-commutative70.7%
distribute-lft-in70.8%
+-commutative70.8%
fma-undefine71.0%
add-sqr-sqrt71.0%
swap-sqr71.0%
sqrt-unprod71.3%
add-sqr-sqrt71.8%
Applied egg-rr70.3%
Taylor expanded in x around 0 28.4%
rem-cube-cbrt29.2%
Simplified29.2%
*-commutative29.2%
sqrt-prod36.1%
Applied egg-rr36.1%
Final simplification41.4%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -2.5e-281) (* 2.0 (sqrt (* x (* y (+ 1.0 (/ z y)))))) (* 2.0 (sqrt (* z (+ y x))))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -2.5e-281) {
tmp = 2.0 * sqrt((x * (y * (1.0 + (z / y)))));
} 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 <= (-2.5d-281)) then
tmp = 2.0d0 * sqrt((x * (y * (1.0d0 + (z / y)))))
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 <= -2.5e-281) {
tmp = 2.0 * Math.sqrt((x * (y * (1.0 + (z / y)))));
} 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 <= -2.5e-281: tmp = 2.0 * math.sqrt((x * (y * (1.0 + (z / y))))) 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 <= -2.5e-281) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y * Float64(1.0 + Float64(z / y)))))); 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 <= -2.5e-281)
tmp = 2.0 * sqrt((x * (y * (1.0 + (z / y)))));
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, -2.5e-281], N[(2.0 * N[Sqrt[N[(x * N[(y * N[(1.0 + N[(z / y), $MachinePrecision]), $MachinePrecision]), $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 -2.5 \cdot 10^{-281}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y \cdot \left(1 + \frac{z}{y}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{z \cdot \left(y + x\right)}\\
\end{array}
\end{array}
if y < -2.4999999999999999e-281Initial program 68.0%
associate-+l+68.0%
*-commutative68.0%
*-commutative68.0%
*-commutative68.0%
+-commutative68.0%
+-commutative68.0%
associate-+l+68.0%
*-commutative68.0%
*-commutative68.0%
+-commutative68.0%
+-commutative68.0%
*-commutative68.0%
*-commutative68.0%
associate-+l+68.0%
+-commutative68.0%
*-commutative68.0%
fma-define68.1%
Simplified68.3%
Taylor expanded in y around inf 62.2%
associate-+r+62.2%
+-commutative62.2%
associate-/l*57.6%
Simplified57.6%
Taylor expanded in x around inf 44.8%
if -2.4999999999999999e-281 < y Initial program 72.1%
+-commutative72.1%
associate-+r+72.1%
*-commutative72.1%
+-commutative72.1%
associate-+l+72.1%
*-commutative72.1%
distribute-rgt-in72.2%
Simplified72.2%
Taylor expanded in z around inf 50.7%
Final simplification47.7%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -2e-281) (* 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 <= -2e-281) {
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 <= (-2d-281)) 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 <= -2e-281) {
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 <= -2e-281: 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 <= -2e-281) 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 <= -2e-281)
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, -2e-281], 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 -2 \cdot 10^{-281}:\\
\;\;\;\;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 < -2e-281Initial program 68.0%
+-commutative68.0%
associate-+r+68.0%
*-commutative68.0%
+-commutative68.0%
associate-+l+68.0%
*-commutative68.0%
distribute-rgt-in68.1%
Simplified68.1%
Taylor expanded in x around inf 47.0%
+-commutative47.0%
Simplified47.0%
if -2e-281 < y Initial program 72.1%
+-commutative72.1%
associate-+r+72.1%
*-commutative72.1%
+-commutative72.1%
associate-+l+72.1%
*-commutative72.1%
distribute-rgt-in72.2%
Simplified72.2%
Taylor expanded in z around inf 50.7%
Final simplification48.9%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -6e-286) (* 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 <= -6e-286) {
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 <= (-6d-286)) 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 <= -6e-286) {
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 <= -6e-286: 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 <= -6e-286) 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 <= -6e-286)
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, -6e-286], 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 -6 \cdot 10^{-286}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot z}\\
\end{array}
\end{array}
if y < -6.0000000000000001e-286Initial program 68.3%
+-commutative68.3%
associate-+r+68.3%
*-commutative68.3%
+-commutative68.3%
associate-+l+68.3%
*-commutative68.3%
distribute-rgt-in68.3%
Simplified68.3%
Taylor expanded in x around inf 47.4%
+-commutative47.4%
Simplified47.4%
if -6.0000000000000001e-286 < y Initial program 71.9%
+-commutative71.9%
associate-+r+71.9%
*-commutative71.9%
+-commutative71.9%
associate-+l+71.9%
*-commutative71.9%
distribute-rgt-in72.0%
Simplified72.0%
Taylor expanded in x around 0 26.2%
*-commutative26.2%
Simplified26.2%
Final simplification36.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 (+ (* z (+ y x)) (* y x)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
return 2.0 * sqrt(((z * (y + x)) + (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(((z * (y + x)) + (y * x)))
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
return 2.0 * Math.sqrt(((z * (y + x)) + (y * x)));
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): return 2.0 * math.sqrt(((z * (y + x)) + (y * x)))
x, y, z = sort([x, y, z]) function code(x, y, z) return Float64(2.0 * sqrt(Float64(Float64(z * Float64(y + x)) + Float64(y * x)))) end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp = code(x, y, z)
tmp = 2.0 * sqrt(((z * (y + x)) + (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[(z * N[(y + x), $MachinePrecision]), $MachinePrecision] + N[(y * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
2 \cdot \sqrt{z \cdot \left(y + x\right) + y \cdot x}
\end{array}
Initial program 70.1%
+-commutative70.1%
associate-+r+70.1%
*-commutative70.1%
+-commutative70.1%
associate-+l+70.1%
*-commutative70.1%
distribute-rgt-in70.1%
Simplified70.1%
Final simplification70.1%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -6e-286) (* 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 <= -6e-286) {
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 <= (-6d-286)) 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 <= -6e-286) {
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 <= -6e-286: 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 <= -6e-286) 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 <= -6e-286)
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, -6e-286], 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 -6 \cdot 10^{-286}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot x}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot z}\\
\end{array}
\end{array}
if y < -6.0000000000000001e-286Initial program 68.3%
+-commutative68.3%
associate-+r+68.3%
*-commutative68.3%
+-commutative68.3%
associate-+l+68.3%
*-commutative68.3%
distribute-rgt-in68.3%
Simplified68.3%
Taylor expanded in z around 0 29.0%
if -6.0000000000000001e-286 < y Initial program 71.9%
+-commutative71.9%
associate-+r+71.9%
*-commutative71.9%
+-commutative71.9%
associate-+l+71.9%
*-commutative71.9%
distribute-rgt-in72.0%
Simplified72.0%
Taylor expanded in x around 0 26.2%
*-commutative26.2%
Simplified26.2%
Final simplification27.6%
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.1%
+-commutative70.1%
associate-+r+70.1%
*-commutative70.1%
+-commutative70.1%
associate-+l+70.1%
*-commutative70.1%
distribute-rgt-in70.1%
Simplified70.1%
Taylor expanded in z around 0 26.7%
Final simplification26.7%
(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 2024150
(FPCore (x y z)
:name "Diagrams.TwoD.Apollonian:descartes from diagrams-contrib-1.3.0.5"
:precision binary64
:alt
(! :herbie-platform default (if (< z 763695009057367500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (* 2 (sqrt (+ (* (+ x y) z) (* x y)))) (* (* (+ (* 1/4 (* (* (pow y -3/4) (* (pow z -3/4) x)) (+ y z))) (* (pow z 1/4) (pow y 1/4))) (+ (* 1/4 (* (* (pow y -3/4) (* (pow z -3/4) x)) (+ y z))) (* (pow z 1/4) (pow y 1/4)))) 2)))
(* 2.0 (sqrt (+ (+ (* x y) (* x z)) (* y z)))))