
(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 -3.3e+81)
(* 2.0 (pow (exp (* 0.25 (- (log (- y)) (log (/ -1.0 x))))) 2.0))
(if (<= y 3.8e-223)
(* 2.0 (sqrt (+ (* y x) (* z (+ y x)))))
(* 2.0 (* (sqrt (+ y x)) (sqrt z))))))assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -3.3e+81) {
tmp = 2.0 * pow(exp((0.25 * (log(-y) - log((-1.0 / x))))), 2.0);
} else if (y <= 3.8e-223) {
tmp = 2.0 * sqrt(((y * x) + (z * (y + x))));
} 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 <= (-3.3d+81)) then
tmp = 2.0d0 * (exp((0.25d0 * (log(-y) - log(((-1.0d0) / x))))) ** 2.0d0)
else if (y <= 3.8d-223) then
tmp = 2.0d0 * sqrt(((y * x) + (z * (y + x))))
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 <= -3.3e+81) {
tmp = 2.0 * Math.pow(Math.exp((0.25 * (Math.log(-y) - Math.log((-1.0 / x))))), 2.0);
} else if (y <= 3.8e-223) {
tmp = 2.0 * Math.sqrt(((y * x) + (z * (y + x))));
} 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 <= -3.3e+81: tmp = 2.0 * math.pow(math.exp((0.25 * (math.log(-y) - math.log((-1.0 / x))))), 2.0) elif y <= 3.8e-223: tmp = 2.0 * math.sqrt(((y * x) + (z * (y + x)))) 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 <= -3.3e+81) tmp = Float64(2.0 * (exp(Float64(0.25 * Float64(log(Float64(-y)) - log(Float64(-1.0 / x))))) ^ 2.0)); elseif (y <= 3.8e-223) tmp = Float64(2.0 * sqrt(Float64(Float64(y * x) + Float64(z * Float64(y + x))))); 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 <= -3.3e+81)
tmp = 2.0 * (exp((0.25 * (log(-y) - log((-1.0 / x))))) ^ 2.0);
elseif (y <= 3.8e-223)
tmp = 2.0 * sqrt(((y * x) + (z * (y + x))));
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, -3.3e+81], N[(2.0 * N[Power[N[Exp[N[(0.25 * N[(N[Log[(-y)], $MachinePrecision] - N[Log[N[(-1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 3.8e-223], N[(2.0 * N[Sqrt[N[(N[(y * x), $MachinePrecision] + N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]), $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 -3.3 \cdot 10^{+81}:\\
\;\;\;\;2 \cdot {\left(e^{0.25 \cdot \left(\log \left(-y\right) - \log \left(\frac{-1}{x}\right)\right)}\right)}^{2}\\
\mathbf{elif}\;y \leq 3.8 \cdot 10^{-223}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot x + z \cdot \left(y + x\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{y + x} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < -3.3e81Initial program 56.7%
associate-+l+56.7%
*-commutative56.7%
*-commutative56.7%
*-commutative56.7%
+-commutative56.7%
+-commutative56.7%
associate-+l+56.7%
*-commutative56.7%
*-commutative56.7%
+-commutative56.7%
+-commutative56.7%
*-commutative56.7%
associate-+l+56.7%
+-commutative56.7%
distribute-rgt-in56.7%
Simplified56.7%
add-sqr-sqrt56.2%
pow256.2%
pow1/256.2%
sqrt-pow156.2%
distribute-rgt-in56.2%
associate-+r+56.2%
*-commutative56.2%
distribute-lft-in56.2%
+-commutative56.2%
fma-undefine57.1%
metadata-eval57.1%
Applied egg-rr57.1%
Taylor expanded in z around 0 31.3%
*-lft-identity31.3%
Simplified31.3%
Taylor expanded in x around -inf 47.6%
if -3.3e81 < y < 3.80000000000000012e-223Initial program 85.0%
associate-+l+85.0%
*-commutative85.0%
*-commutative85.0%
*-commutative85.0%
+-commutative85.0%
+-commutative85.0%
associate-+l+85.0%
*-commutative85.0%
*-commutative85.0%
+-commutative85.0%
+-commutative85.0%
*-commutative85.0%
associate-+l+85.0%
+-commutative85.0%
distribute-rgt-in85.0%
Simplified85.0%
if 3.80000000000000012e-223 < y Initial program 65.4%
associate-+l+65.4%
*-commutative65.4%
*-commutative65.4%
*-commutative65.4%
+-commutative65.4%
+-commutative65.4%
associate-+l+65.4%
*-commutative65.4%
*-commutative65.4%
+-commutative65.4%
+-commutative65.4%
*-commutative65.4%
associate-+l+65.4%
+-commutative65.4%
distribute-rgt-in65.5%
Simplified65.5%
Taylor expanded in z around inf 38.9%
+-commutative38.9%
Simplified38.9%
+-commutative38.9%
*-commutative38.9%
sqrt-prod52.1%
Applied egg-rr52.1%
+-commutative52.1%
Simplified52.1%
Final simplification62.9%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -3.8e-307) (* 2.0 (pow (exp (* 0.25 (- (log (- (- y) z)) (log (/ -1.0 x))))) 2.0)) (* 2.0 (* (sqrt (+ y x)) (sqrt z)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -3.8e-307) {
tmp = 2.0 * pow(exp((0.25 * (log((-y - z)) - log((-1.0 / x))))), 2.0);
} 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 <= (-3.8d-307)) then
tmp = 2.0d0 * (exp((0.25d0 * (log((-y - z)) - log(((-1.0d0) / x))))) ** 2.0d0)
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 <= -3.8e-307) {
tmp = 2.0 * Math.pow(Math.exp((0.25 * (Math.log((-y - z)) - Math.log((-1.0 / x))))), 2.0);
} 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 <= -3.8e-307: tmp = 2.0 * math.pow(math.exp((0.25 * (math.log((-y - z)) - math.log((-1.0 / x))))), 2.0) 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 <= -3.8e-307) tmp = Float64(2.0 * (exp(Float64(0.25 * Float64(log(Float64(Float64(-y) - z)) - log(Float64(-1.0 / x))))) ^ 2.0)); 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 <= -3.8e-307)
tmp = 2.0 * (exp((0.25 * (log((-y - z)) - log((-1.0 / x))))) ^ 2.0);
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, -3.8e-307], N[(2.0 * N[Power[N[Exp[N[(0.25 * N[(N[Log[N[((-y) - z), $MachinePrecision]], $MachinePrecision] - N[Log[N[(-1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 2.0], $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 -3.8 \cdot 10^{-307}:\\
\;\;\;\;2 \cdot {\left(e^{0.25 \cdot \left(\log \left(\left(-y\right) - z\right) - \log \left(\frac{-1}{x}\right)\right)}\right)}^{2}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{y + x} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < -3.79999999999999985e-307Initial program 79.4%
associate-+l+79.4%
*-commutative79.4%
*-commutative79.4%
*-commutative79.4%
+-commutative79.4%
+-commutative79.4%
associate-+l+79.4%
*-commutative79.4%
*-commutative79.4%
+-commutative79.4%
+-commutative79.4%
*-commutative79.4%
associate-+l+79.4%
+-commutative79.4%
distribute-rgt-in79.4%
Simplified79.4%
add-sqr-sqrt78.9%
pow278.9%
pow1/278.9%
sqrt-pow178.9%
distribute-rgt-in78.9%
associate-+r+78.9%
*-commutative78.9%
distribute-lft-in78.9%
+-commutative78.9%
fma-undefine79.2%
metadata-eval79.2%
Applied egg-rr79.2%
Taylor expanded in x around -inf 50.7%
if -3.79999999999999985e-307 < y Initial program 65.6%
associate-+l+65.6%
*-commutative65.6%
*-commutative65.6%
*-commutative65.6%
+-commutative65.6%
+-commutative65.6%
associate-+l+65.6%
*-commutative65.6%
*-commutative65.6%
+-commutative65.6%
+-commutative65.6%
*-commutative65.6%
associate-+l+65.6%
+-commutative65.6%
distribute-rgt-in65.6%
Simplified65.6%
Taylor expanded in z around inf 42.0%
+-commutative42.0%
Simplified42.0%
+-commutative42.0%
*-commutative42.0%
sqrt-prod49.6%
Applied egg-rr49.6%
+-commutative49.6%
Simplified49.6%
Final simplification50.0%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 2.35e-265) (* 2.0 (sqrt (fma x z (* y (+ z x))))) (* 2.0 (* (sqrt (+ y x)) (sqrt z)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 2.35e-265) {
tmp = 2.0 * sqrt(fma(x, z, (y * (z + x))));
} else {
tmp = 2.0 * (sqrt((y + x)) * sqrt(z));
}
return tmp;
}
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 2.35e-265) tmp = Float64(2.0 * sqrt(fma(x, z, Float64(y * Float64(z + x))))); else tmp = Float64(2.0 * Float64(sqrt(Float64(y + x)) * sqrt(z))); 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.35e-265], N[(2.0 * N[Sqrt[N[(x * z + N[(y * N[(z + x), $MachinePrecision]), $MachinePrecision]), $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 2.35 \cdot 10^{-265}:\\
\;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, z, y \cdot \left(z + x\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{y + x} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < 2.34999999999999993e-265Initial program 77.5%
associate-+l+77.5%
*-commutative77.5%
*-commutative77.5%
*-commutative77.5%
+-commutative77.5%
+-commutative77.5%
+-commutative77.5%
*-commutative77.5%
*-commutative77.5%
associate-+l+77.5%
+-commutative77.5%
fma-define77.5%
distribute-lft-out77.6%
Simplified77.6%
if 2.34999999999999993e-265 < y Initial program 66.0%
associate-+l+66.0%
*-commutative66.0%
*-commutative66.0%
*-commutative66.0%
+-commutative66.0%
+-commutative66.0%
associate-+l+66.0%
*-commutative66.0%
*-commutative66.0%
+-commutative66.0%
+-commutative66.0%
*-commutative66.0%
associate-+l+66.0%
+-commutative66.0%
distribute-rgt-in66.0%
Simplified66.0%
Taylor expanded in z around inf 40.3%
+-commutative40.3%
Simplified40.3%
+-commutative40.3%
*-commutative40.3%
sqrt-prod51.7%
Applied egg-rr51.7%
+-commutative51.7%
Simplified51.7%
Final simplification63.2%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 8.2e-266) (* 2.0 (sqrt (* x (+ y z)))) (* 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.2e-266) {
tmp = 2.0 * sqrt((x * (y + z)));
} 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.2d-266) then
tmp = 2.0d0 * sqrt((x * (y + z)))
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.2e-266) {
tmp = 2.0 * Math.sqrt((x * (y + z)));
} 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.2e-266: tmp = 2.0 * math.sqrt((x * (y + z))) 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.2e-266) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z)))); 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.2e-266)
tmp = 2.0 * sqrt((x * (y + z)));
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.2e-266], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $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.2 \cdot 10^{-266}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{y + x} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < 8.2000000000000006e-266Initial program 77.5%
associate-+l+77.5%
*-commutative77.5%
*-commutative77.5%
*-commutative77.5%
+-commutative77.5%
+-commutative77.5%
associate-+l+77.5%
*-commutative77.5%
*-commutative77.5%
+-commutative77.5%
+-commutative77.5%
*-commutative77.5%
associate-+l+77.5%
+-commutative77.5%
distribute-rgt-in77.5%
Simplified77.5%
Taylor expanded in x around inf 57.7%
if 8.2000000000000006e-266 < y Initial program 66.0%
associate-+l+66.0%
*-commutative66.0%
*-commutative66.0%
*-commutative66.0%
+-commutative66.0%
+-commutative66.0%
associate-+l+66.0%
*-commutative66.0%
*-commutative66.0%
+-commutative66.0%
+-commutative66.0%
*-commutative66.0%
associate-+l+66.0%
+-commutative66.0%
distribute-rgt-in66.0%
Simplified66.0%
Taylor expanded in z around inf 40.3%
+-commutative40.3%
Simplified40.3%
+-commutative40.3%
*-commutative40.3%
sqrt-prod51.7%
Applied egg-rr51.7%
+-commutative51.7%
Simplified51.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.7e+36) (* 2.0 (sqrt (+ (* y x) (* 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.7e+36) {
tmp = 2.0 * sqrt(((y * x) + (z * (y + x))));
} 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.7d+36) then
tmp = 2.0d0 * sqrt(((y * x) + (z * (y + x))))
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.7e+36) {
tmp = 2.0 * Math.sqrt(((y * x) + (z * (y + x))));
} 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.7e+36: tmp = 2.0 * math.sqrt(((y * x) + (z * (y + x)))) 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.7e+36) tmp = Float64(2.0 * sqrt(Float64(Float64(y * x) + Float64(z * Float64(y + x))))); 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.7e+36)
tmp = 2.0 * sqrt(((y * x) + (z * (y + x))));
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.7e+36], N[(2.0 * N[Sqrt[N[(N[(y * x), $MachinePrecision] + 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.7 \cdot 10^{+36}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot x + z \cdot \left(y + x\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y}\right)\\
\end{array}
\end{array}
if y < 1.6999999999999999e36Initial program 79.7%
associate-+l+79.7%
*-commutative79.7%
*-commutative79.7%
*-commutative79.7%
+-commutative79.7%
+-commutative79.7%
associate-+l+79.7%
*-commutative79.7%
*-commutative79.7%
+-commutative79.7%
+-commutative79.7%
*-commutative79.7%
associate-+l+79.7%
+-commutative79.7%
distribute-rgt-in79.7%
Simplified79.7%
if 1.6999999999999999e36 < y Initial program 49.4%
associate-+l+49.4%
*-commutative49.4%
*-commutative49.4%
*-commutative49.4%
+-commutative49.4%
+-commutative49.4%
associate-+l+49.4%
*-commutative49.4%
*-commutative49.4%
+-commutative49.4%
+-commutative49.4%
*-commutative49.4%
associate-+l+49.4%
+-commutative49.4%
distribute-rgt-in49.5%
Simplified49.5%
Taylor expanded in x around 0 21.3%
*-commutative21.3%
Simplified21.3%
*-commutative21.3%
sqrt-prod39.6%
Applied egg-rr39.6%
Final simplification68.3%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -7.8e-292) (* 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 <= -7.8e-292) {
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 <= (-7.8d-292)) 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 <= -7.8e-292) {
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 <= -7.8e-292: 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 <= -7.8e-292) 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 <= -7.8e-292)
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, -7.8e-292], 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 -7.8 \cdot 10^{-292}:\\
\;\;\;\;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 < -7.8e-292Initial program 78.8%
associate-+l+78.8%
*-commutative78.8%
*-commutative78.8%
*-commutative78.8%
+-commutative78.8%
+-commutative78.8%
associate-+l+78.8%
*-commutative78.8%
*-commutative78.8%
+-commutative78.8%
+-commutative78.8%
*-commutative78.8%
associate-+l+78.8%
+-commutative78.8%
distribute-rgt-in78.8%
Simplified78.8%
Taylor expanded in x around inf 56.4%
if -7.8e-292 < y Initial program 66.2%
associate-+l+66.2%
*-commutative66.2%
*-commutative66.2%
*-commutative66.2%
+-commutative66.2%
+-commutative66.2%
associate-+l+66.2%
*-commutative66.2%
*-commutative66.2%
+-commutative66.2%
+-commutative66.2%
*-commutative66.2%
associate-+l+66.2%
+-commutative66.2%
distribute-rgt-in66.3%
Simplified66.3%
Taylor expanded in z around inf 43.1%
+-commutative43.1%
Simplified43.1%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -3.9e-292) (* 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 <= -3.9e-292) {
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 <= (-3.9d-292)) 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 <= -3.9e-292) {
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 <= -3.9e-292: 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 <= -3.9e-292) 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 <= -3.9e-292)
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, -3.9e-292], 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 -3.9 \cdot 10^{-292}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot z}\\
\end{array}
\end{array}
if y < -3.9e-292Initial program 78.8%
associate-+l+78.8%
*-commutative78.8%
*-commutative78.8%
*-commutative78.8%
+-commutative78.8%
+-commutative78.8%
associate-+l+78.8%
*-commutative78.8%
*-commutative78.8%
+-commutative78.8%
+-commutative78.8%
*-commutative78.8%
associate-+l+78.8%
+-commutative78.8%
distribute-rgt-in78.8%
Simplified78.8%
Taylor expanded in x around inf 56.4%
if -3.9e-292 < y Initial program 66.2%
associate-+l+66.2%
*-commutative66.2%
*-commutative66.2%
*-commutative66.2%
+-commutative66.2%
+-commutative66.2%
associate-+l+66.2%
*-commutative66.2%
*-commutative66.2%
+-commutative66.2%
+-commutative66.2%
*-commutative66.2%
associate-+l+66.2%
+-commutative66.2%
distribute-rgt-in66.3%
Simplified66.3%
Taylor expanded in x around 0 22.5%
*-commutative22.5%
Simplified22.5%
Final simplification35.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) (* 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 71.1%
associate-+l+71.1%
*-commutative71.1%
*-commutative71.1%
*-commutative71.1%
+-commutative71.1%
+-commutative71.1%
associate-+l+71.1%
*-commutative71.1%
*-commutative71.1%
+-commutative71.1%
+-commutative71.1%
*-commutative71.1%
associate-+l+71.1%
+-commutative71.1%
distribute-rgt-in71.1%
Simplified71.1%
Final simplification71.1%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -3.9e-292) (* 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 <= -3.9e-292) {
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 <= (-3.9d-292)) 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 <= -3.9e-292) {
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 <= -3.9e-292: 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 <= -3.9e-292) 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 <= -3.9e-292)
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, -3.9e-292], 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 -3.9 \cdot 10^{-292}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot x}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot z}\\
\end{array}
\end{array}
if y < -3.9e-292Initial program 78.8%
associate-+l+78.8%
*-commutative78.8%
*-commutative78.8%
*-commutative78.8%
+-commutative78.8%
+-commutative78.8%
associate-+l+78.8%
*-commutative78.8%
*-commutative78.8%
+-commutative78.8%
+-commutative78.8%
*-commutative78.8%
associate-+l+78.8%
+-commutative78.8%
distribute-rgt-in78.8%
Simplified78.8%
Taylor expanded in z around 0 28.1%
*-commutative28.1%
Simplified28.1%
if -3.9e-292 < y Initial program 66.2%
associate-+l+66.2%
*-commutative66.2%
*-commutative66.2%
*-commutative66.2%
+-commutative66.2%
+-commutative66.2%
associate-+l+66.2%
*-commutative66.2%
*-commutative66.2%
+-commutative66.2%
+-commutative66.2%
*-commutative66.2%
associate-+l+66.2%
+-commutative66.2%
distribute-rgt-in66.3%
Simplified66.3%
Taylor expanded in x around 0 22.5%
*-commutative22.5%
Simplified22.5%
Final simplification24.7%
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 71.1%
associate-+l+71.1%
*-commutative71.1%
*-commutative71.1%
*-commutative71.1%
+-commutative71.1%
+-commutative71.1%
associate-+l+71.1%
*-commutative71.1%
*-commutative71.1%
+-commutative71.1%
+-commutative71.1%
*-commutative71.1%
associate-+l+71.1%
+-commutative71.1%
distribute-rgt-in71.1%
Simplified71.1%
Taylor expanded in z around 0 25.6%
*-commutative25.6%
Simplified25.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 2024116
(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)))))