
(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 13 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.5e+60)
(* 2.0 (pow (exp (* 0.25 (- (log (- (- y) z)) (log (/ -1.0 x))))) 2.0))
(if (<= y 12.0)
(* 2.0 (sqrt (+ (+ (* y x) (* z x)) (* y z))))
(*
2.0
(*
z
(+
(sqrt (/ (+ y x) z))
(* 0.5 (* x (* y (sqrt (/ (/ 1.0 (pow z 3.0)) (+ y x))))))))))))assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -3.5e+60) {
tmp = 2.0 * pow(exp((0.25 * (log((-y - z)) - log((-1.0 / x))))), 2.0);
} else if (y <= 12.0) {
tmp = 2.0 * sqrt((((y * x) + (z * x)) + (y * z)));
} else {
tmp = 2.0 * (z * (sqrt(((y + x) / z)) + (0.5 * (x * (y * sqrt(((1.0 / pow(z, 3.0)) / (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 <= (-3.5d+60)) then
tmp = 2.0d0 * (exp((0.25d0 * (log((-y - z)) - log(((-1.0d0) / x))))) ** 2.0d0)
else if (y <= 12.0d0) then
tmp = 2.0d0 * sqrt((((y * x) + (z * x)) + (y * z)))
else
tmp = 2.0d0 * (z * (sqrt(((y + x) / z)) + (0.5d0 * (x * (y * sqrt(((1.0d0 / (z ** 3.0d0)) / (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 <= -3.5e+60) {
tmp = 2.0 * Math.pow(Math.exp((0.25 * (Math.log((-y - z)) - Math.log((-1.0 / x))))), 2.0);
} else if (y <= 12.0) {
tmp = 2.0 * Math.sqrt((((y * x) + (z * x)) + (y * z)));
} else {
tmp = 2.0 * (z * (Math.sqrt(((y + x) / z)) + (0.5 * (x * (y * Math.sqrt(((1.0 / Math.pow(z, 3.0)) / (y + x))))))));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= -3.5e+60: tmp = 2.0 * math.pow(math.exp((0.25 * (math.log((-y - z)) - math.log((-1.0 / x))))), 2.0) elif y <= 12.0: tmp = 2.0 * math.sqrt((((y * x) + (z * x)) + (y * z))) else: tmp = 2.0 * (z * (math.sqrt(((y + x) / z)) + (0.5 * (x * (y * math.sqrt(((1.0 / math.pow(z, 3.0)) / (y + x)))))))) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -3.5e+60) tmp = Float64(2.0 * (exp(Float64(0.25 * Float64(log(Float64(Float64(-y) - z)) - log(Float64(-1.0 / x))))) ^ 2.0)); elseif (y <= 12.0) tmp = Float64(2.0 * sqrt(Float64(Float64(Float64(y * x) + Float64(z * x)) + Float64(y * z)))); else tmp = Float64(2.0 * Float64(z * Float64(sqrt(Float64(Float64(y + x) / z)) + Float64(0.5 * Float64(x * Float64(y * sqrt(Float64(Float64(1.0 / (z ^ 3.0)) / 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 <= -3.5e+60)
tmp = 2.0 * (exp((0.25 * (log((-y - z)) - log((-1.0 / x))))) ^ 2.0);
elseif (y <= 12.0)
tmp = 2.0 * sqrt((((y * x) + (z * x)) + (y * z)));
else
tmp = 2.0 * (z * (sqrt(((y + x) / z)) + (0.5 * (x * (y * sqrt(((1.0 / (z ^ 3.0)) / (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, -3.5e+60], 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], If[LessEqual[y, 12.0], N[(2.0 * N[Sqrt[N[(N[(N[(y * x), $MachinePrecision] + N[(z * x), $MachinePrecision]), $MachinePrecision] + N[(y * z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(z * N[(N[Sqrt[N[(N[(y + x), $MachinePrecision] / z), $MachinePrecision]], $MachinePrecision] + N[(0.5 * N[(x * N[(y * N[Sqrt[N[(N[(1.0 / N[Power[z, 3.0], $MachinePrecision]), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -3.5 \cdot 10^{+60}:\\
\;\;\;\;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{elif}\;y \leq 12:\\
\;\;\;\;2 \cdot \sqrt{\left(y \cdot x + z \cdot x\right) + y \cdot z}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(z \cdot \left(\sqrt{\frac{y + x}{z}} + 0.5 \cdot \left(x \cdot \left(y \cdot \sqrt{\frac{\frac{1}{{z}^{3}}}{y + x}}\right)\right)\right)\right)\\
\end{array}
\end{array}
if y < -3.5000000000000002e60Initial program 50.0%
distribute-lft-out50.0%
*-commutative50.0%
Applied egg-rr50.0%
add-sqr-sqrt49.7%
pow249.7%
pow1/249.7%
sqrt-pow149.8%
+-commutative49.8%
*-commutative49.8%
fma-define50.6%
*-commutative50.6%
metadata-eval50.6%
Applied egg-rr50.6%
Taylor expanded in x around -inf 48.6%
if -3.5000000000000002e60 < y < 12Initial program 85.8%
if 12 < y Initial program 60.3%
associate-+l+60.3%
*-commutative60.3%
*-commutative60.3%
*-commutative60.3%
+-commutative60.3%
+-commutative60.3%
associate-+l+60.3%
*-commutative60.3%
*-commutative60.3%
+-commutative60.3%
+-commutative60.3%
*-commutative60.3%
associate-+l+60.3%
+-commutative60.3%
distribute-rgt-in60.3%
Simplified60.3%
Taylor expanded in z around inf 38.0%
+-commutative38.0%
associate-*l*48.7%
associate-/r*48.7%
+-commutative48.7%
Simplified48.7%
Final simplification69.4%
NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
:precision binary64
(if (<= y -4e+60)
(* 2.0 (pow (exp (* 0.25 (- (log (- y)) (log (/ -1.0 x))))) 2.0))
(if (<= y 3000000.0)
(* 2.0 (sqrt (+ (+ (* y x) (* z x)) (* y z))))
(*
2.0
(*
z
(+
(sqrt (/ (+ y x) z))
(* 0.5 (* x (* y (sqrt (/ (/ 1.0 (pow z 3.0)) (+ y x))))))))))))assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -4e+60) {
tmp = 2.0 * pow(exp((0.25 * (log(-y) - log((-1.0 / x))))), 2.0);
} else if (y <= 3000000.0) {
tmp = 2.0 * sqrt((((y * x) + (z * x)) + (y * z)));
} else {
tmp = 2.0 * (z * (sqrt(((y + x) / z)) + (0.5 * (x * (y * sqrt(((1.0 / pow(z, 3.0)) / (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 <= (-4d+60)) then
tmp = 2.0d0 * (exp((0.25d0 * (log(-y) - log(((-1.0d0) / x))))) ** 2.0d0)
else if (y <= 3000000.0d0) then
tmp = 2.0d0 * sqrt((((y * x) + (z * x)) + (y * z)))
else
tmp = 2.0d0 * (z * (sqrt(((y + x) / z)) + (0.5d0 * (x * (y * sqrt(((1.0d0 / (z ** 3.0d0)) / (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 <= -4e+60) {
tmp = 2.0 * Math.pow(Math.exp((0.25 * (Math.log(-y) - Math.log((-1.0 / x))))), 2.0);
} else if (y <= 3000000.0) {
tmp = 2.0 * Math.sqrt((((y * x) + (z * x)) + (y * z)));
} else {
tmp = 2.0 * (z * (Math.sqrt(((y + x) / z)) + (0.5 * (x * (y * Math.sqrt(((1.0 / Math.pow(z, 3.0)) / (y + x))))))));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= -4e+60: tmp = 2.0 * math.pow(math.exp((0.25 * (math.log(-y) - math.log((-1.0 / x))))), 2.0) elif y <= 3000000.0: tmp = 2.0 * math.sqrt((((y * x) + (z * x)) + (y * z))) else: tmp = 2.0 * (z * (math.sqrt(((y + x) / z)) + (0.5 * (x * (y * math.sqrt(((1.0 / math.pow(z, 3.0)) / (y + x)))))))) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -4e+60) tmp = Float64(2.0 * (exp(Float64(0.25 * Float64(log(Float64(-y)) - log(Float64(-1.0 / x))))) ^ 2.0)); elseif (y <= 3000000.0) tmp = Float64(2.0 * sqrt(Float64(Float64(Float64(y * x) + Float64(z * x)) + Float64(y * z)))); else tmp = Float64(2.0 * Float64(z * Float64(sqrt(Float64(Float64(y + x) / z)) + Float64(0.5 * Float64(x * Float64(y * sqrt(Float64(Float64(1.0 / (z ^ 3.0)) / 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 <= -4e+60)
tmp = 2.0 * (exp((0.25 * (log(-y) - log((-1.0 / x))))) ^ 2.0);
elseif (y <= 3000000.0)
tmp = 2.0 * sqrt((((y * x) + (z * x)) + (y * z)));
else
tmp = 2.0 * (z * (sqrt(((y + x) / z)) + (0.5 * (x * (y * sqrt(((1.0 / (z ^ 3.0)) / (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, -4e+60], 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, 3000000.0], N[(2.0 * N[Sqrt[N[(N[(N[(y * x), $MachinePrecision] + N[(z * x), $MachinePrecision]), $MachinePrecision] + N[(y * z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(z * N[(N[Sqrt[N[(N[(y + x), $MachinePrecision] / z), $MachinePrecision]], $MachinePrecision] + N[(0.5 * N[(x * N[(y * N[Sqrt[N[(N[(1.0 / N[Power[z, 3.0], $MachinePrecision]), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -4 \cdot 10^{+60}:\\
\;\;\;\;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 3000000:\\
\;\;\;\;2 \cdot \sqrt{\left(y \cdot x + z \cdot x\right) + y \cdot z}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(z \cdot \left(\sqrt{\frac{y + x}{z}} + 0.5 \cdot \left(x \cdot \left(y \cdot \sqrt{\frac{\frac{1}{{z}^{3}}}{y + x}}\right)\right)\right)\right)\\
\end{array}
\end{array}
if y < -3.9999999999999998e60Initial program 50.0%
associate-+l+50.0%
*-commutative50.0%
*-commutative50.0%
*-commutative50.0%
+-commutative50.0%
+-commutative50.0%
associate-+l+50.0%
*-commutative50.0%
*-commutative50.0%
+-commutative50.0%
+-commutative50.0%
*-commutative50.0%
associate-+l+50.0%
+-commutative50.0%
distribute-rgt-in50.0%
Simplified50.0%
Taylor expanded in z around 0 31.6%
*-commutative31.6%
Simplified31.6%
add-sqr-sqrt31.3%
pow231.3%
pow1/231.9%
sqrt-pow132.0%
metadata-eval32.0%
Applied egg-rr32.0%
Taylor expanded in x around -inf 46.7%
if -3.9999999999999998e60 < y < 3e6Initial program 85.8%
if 3e6 < y Initial program 60.3%
associate-+l+60.3%
*-commutative60.3%
*-commutative60.3%
*-commutative60.3%
+-commutative60.3%
+-commutative60.3%
associate-+l+60.3%
*-commutative60.3%
*-commutative60.3%
+-commutative60.3%
+-commutative60.3%
*-commutative60.3%
associate-+l+60.3%
+-commutative60.3%
distribute-rgt-in60.3%
Simplified60.3%
Taylor expanded in z around inf 38.0%
+-commutative38.0%
associate-*l*48.7%
associate-/r*48.7%
+-commutative48.7%
Simplified48.7%
Final simplification69.0%
NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
:precision binary64
(if (<= y 1.5)
(* 2.0 (sqrt (fma x z (* y (+ z x)))))
(*
2.0
(*
z
(+
(sqrt (/ (+ y x) z))
(* 0.5 (* x (* y (sqrt (/ (/ 1.0 (pow z 3.0)) (+ y x)))))))))))assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 1.5) {
tmp = 2.0 * sqrt(fma(x, z, (y * (z + x))));
} else {
tmp = 2.0 * (z * (sqrt(((y + x) / z)) + (0.5 * (x * (y * sqrt(((1.0 / pow(z, 3.0)) / (y + x))))))));
}
return tmp;
}
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 1.5) tmp = Float64(2.0 * sqrt(fma(x, z, Float64(y * Float64(z + x))))); else tmp = Float64(2.0 * Float64(z * Float64(sqrt(Float64(Float64(y + x) / z)) + Float64(0.5 * Float64(x * Float64(y * sqrt(Float64(Float64(1.0 / (z ^ 3.0)) / Float64(y + x))))))))); 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.5], N[(2.0 * N[Sqrt[N[(x * z + N[(y * N[(z + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(z * N[(N[Sqrt[N[(N[(y + x), $MachinePrecision] / z), $MachinePrecision]], $MachinePrecision] + N[(0.5 * N[(x * N[(y * N[Sqrt[N[(N[(1.0 / N[Power[z, 3.0], $MachinePrecision]), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 1.5:\\
\;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, z, y \cdot \left(z + x\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(z \cdot \left(\sqrt{\frac{y + x}{z}} + 0.5 \cdot \left(x \cdot \left(y \cdot \sqrt{\frac{\frac{1}{{z}^{3}}}{y + x}}\right)\right)\right)\right)\\
\end{array}
\end{array}
if y < 1.5Initial program 76.8%
associate-+l+76.8%
*-commutative76.8%
*-commutative76.8%
*-commutative76.8%
+-commutative76.8%
+-commutative76.8%
+-commutative76.8%
*-commutative76.8%
*-commutative76.8%
associate-+l+76.8%
+-commutative76.8%
fma-define76.8%
distribute-lft-out76.9%
Simplified76.9%
if 1.5 < y Initial program 60.3%
associate-+l+60.3%
*-commutative60.3%
*-commutative60.3%
*-commutative60.3%
+-commutative60.3%
+-commutative60.3%
associate-+l+60.3%
*-commutative60.3%
*-commutative60.3%
+-commutative60.3%
+-commutative60.3%
*-commutative60.3%
associate-+l+60.3%
+-commutative60.3%
distribute-rgt-in60.3%
Simplified60.3%
Taylor expanded in z around inf 38.0%
+-commutative38.0%
associate-*l*48.7%
associate-/r*48.7%
+-commutative48.7%
Simplified48.7%
Final simplification69.8%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 5.5e+31) (* 2.0 (sqrt (fma x z (* y (+ z x))))) (* 2.0 (* (sqrt (fma x (/ z y) (+ z x))) (sqrt y)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 5.5e+31) {
tmp = 2.0 * sqrt(fma(x, z, (y * (z + x))));
} else {
tmp = 2.0 * (sqrt(fma(x, (z / y), (z + x))) * sqrt(y));
}
return tmp;
}
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 5.5e+31) tmp = Float64(2.0 * sqrt(fma(x, z, Float64(y * Float64(z + x))))); else tmp = Float64(2.0 * Float64(sqrt(fma(x, Float64(z / y), Float64(z + x))) * 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, 5.5e+31], 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[(x * N[(z / y), $MachinePrecision] + N[(z + x), $MachinePrecision]), $MachinePrecision]], $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 5.5 \cdot 10^{+31}:\\
\;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, z, y \cdot \left(z + x\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{\mathsf{fma}\left(x, \frac{z}{y}, z + x\right)} \cdot \sqrt{y}\right)\\
\end{array}
\end{array}
if y < 5.50000000000000002e31Initial program 76.7%
associate-+l+76.7%
*-commutative76.7%
*-commutative76.7%
*-commutative76.7%
+-commutative76.7%
+-commutative76.7%
+-commutative76.7%
*-commutative76.7%
*-commutative76.7%
associate-+l+76.7%
+-commutative76.7%
fma-define76.7%
distribute-lft-out76.9%
Simplified76.9%
if 5.50000000000000002e31 < y Initial program 58.2%
associate-+l+58.2%
*-commutative58.2%
*-commutative58.2%
*-commutative58.2%
+-commutative58.2%
+-commutative58.2%
associate-+l+58.2%
*-commutative58.2%
*-commutative58.2%
+-commutative58.2%
+-commutative58.2%
*-commutative58.2%
associate-+l+58.2%
+-commutative58.2%
distribute-rgt-in58.2%
Simplified58.2%
Taylor expanded in y around inf 58.4%
associate-+r+58.4%
+-commutative58.4%
associate-/l*58.5%
Simplified58.5%
*-commutative58.5%
sqrt-prod99.4%
+-commutative99.4%
fma-define99.4%
Applied egg-rr99.4%
Final simplification81.9%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 4.2e+29) (* 2.0 (sqrt (fma x z (* y (+ z x))))) (* 2.0 (* (sqrt y) (sqrt z)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 4.2e+29) {
tmp = 2.0 * sqrt(fma(x, z, (y * (z + x))));
} else {
tmp = 2.0 * (sqrt(y) * sqrt(z));
}
return tmp;
}
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 4.2e+29) tmp = Float64(2.0 * sqrt(fma(x, z, Float64(y * Float64(z + x))))); else tmp = Float64(2.0 * Float64(sqrt(y) * 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, 4.2e+29], N[(2.0 * N[Sqrt[N[(x * z + N[(y * N[(z + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[y], $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 4.2 \cdot 10^{+29}:\\
\;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, z, y \cdot \left(z + x\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{y} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < 4.2000000000000003e29Initial program 76.6%
associate-+l+76.6%
*-commutative76.6%
*-commutative76.6%
*-commutative76.6%
+-commutative76.6%
+-commutative76.6%
+-commutative76.6%
*-commutative76.6%
*-commutative76.6%
associate-+l+76.6%
+-commutative76.6%
fma-define76.6%
distribute-lft-out76.8%
Simplified76.8%
if 4.2000000000000003e29 < y Initial program 58.9%
associate-+l+58.9%
*-commutative58.9%
*-commutative58.9%
*-commutative58.9%
+-commutative58.9%
+-commutative58.9%
associate-+l+58.9%
*-commutative58.9%
*-commutative58.9%
+-commutative58.9%
+-commutative58.9%
*-commutative58.9%
associate-+l+58.9%
+-commutative58.9%
distribute-rgt-in58.9%
Simplified58.9%
Taylor expanded in x around 0 22.2%
*-commutative22.2%
Simplified22.2%
sqrt-prod43.3%
Applied egg-rr43.3%
*-commutative43.3%
Simplified43.3%
Final simplification69.2%
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+30) (* 2.0 (sqrt (+ (* y z) (* (+ y z) x)))) (* 2.0 (* (sqrt y) (sqrt z)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 1.45e+30) {
tmp = 2.0 * sqrt(((y * z) + ((y + z) * x)));
} else {
tmp = 2.0 * (sqrt(y) * 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 <= 1.45d+30) then
tmp = 2.0d0 * sqrt(((y * z) + ((y + z) * x)))
else
tmp = 2.0d0 * (sqrt(y) * 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 <= 1.45e+30) {
tmp = 2.0 * Math.sqrt(((y * z) + ((y + z) * x)));
} else {
tmp = 2.0 * (Math.sqrt(y) * Math.sqrt(z));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= 1.45e+30: tmp = 2.0 * math.sqrt(((y * z) + ((y + z) * x))) else: tmp = 2.0 * (math.sqrt(y) * math.sqrt(z)) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 1.45e+30) tmp = Float64(2.0 * sqrt(Float64(Float64(y * z) + Float64(Float64(y + z) * x)))); else tmp = Float64(2.0 * Float64(sqrt(y) * 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 <= 1.45e+30)
tmp = 2.0 * sqrt(((y * z) + ((y + z) * x)));
else
tmp = 2.0 * (sqrt(y) * 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, 1.45e+30], N[(2.0 * N[Sqrt[N[(N[(y * z), $MachinePrecision] + N[(N[(y + z), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[y], $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 1.45 \cdot 10^{+30}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot z + \left(y + z\right) \cdot x}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{y} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < 1.4499999999999999e30Initial program 76.6%
distribute-lft-out76.6%
*-commutative76.6%
Applied egg-rr76.6%
if 1.4499999999999999e30 < y Initial program 58.9%
associate-+l+58.9%
*-commutative58.9%
*-commutative58.9%
*-commutative58.9%
+-commutative58.9%
+-commutative58.9%
associate-+l+58.9%
*-commutative58.9%
*-commutative58.9%
+-commutative58.9%
+-commutative58.9%
*-commutative58.9%
associate-+l+58.9%
+-commutative58.9%
distribute-rgt-in58.9%
Simplified58.9%
Taylor expanded in x around 0 22.2%
*-commutative22.2%
Simplified22.2%
sqrt-prod43.3%
Applied egg-rr43.3%
*-commutative43.3%
Simplified43.3%
Final simplification69.1%
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-276) (* 2.0 (sqrt (* y (+ x (* x (/ 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 <= -8.8e-276) {
tmp = 2.0 * sqrt((y * (x + (x * (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 <= (-8.8d-276)) then
tmp = 2.0d0 * sqrt((y * (x + (x * (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 <= -8.8e-276) {
tmp = 2.0 * Math.sqrt((y * (x + (x * (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 <= -8.8e-276: tmp = 2.0 * math.sqrt((y * (x + (x * (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 <= -8.8e-276) tmp = Float64(2.0 * sqrt(Float64(y * Float64(x + Float64(x * 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 <= -8.8e-276)
tmp = 2.0 * sqrt((y * (x + (x * (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, -8.8e-276], N[(2.0 * N[Sqrt[N[(y * N[(x + N[(x * 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 -8.8 \cdot 10^{-276}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot \left(x + x \cdot \frac{z}{y}\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{z \cdot \left(y + x\right)}\\
\end{array}
\end{array}
if y < -8.79999999999999923e-276Initial program 72.1%
associate-+l+72.1%
*-commutative72.1%
*-commutative72.1%
*-commutative72.1%
+-commutative72.1%
+-commutative72.1%
associate-+l+72.1%
*-commutative72.1%
*-commutative72.1%
+-commutative72.1%
+-commutative72.1%
*-commutative72.1%
associate-+l+72.1%
+-commutative72.1%
distribute-rgt-in72.1%
Simplified72.1%
Taylor expanded in y around inf 69.9%
associate-+r+69.9%
+-commutative69.9%
associate-/l*65.5%
Simplified65.5%
Taylor expanded in z around 0 44.6%
if -8.79999999999999923e-276 < y Initial program 73.1%
associate-+l+73.1%
*-commutative73.1%
*-commutative73.1%
*-commutative73.1%
+-commutative73.1%
+-commutative73.1%
associate-+l+73.1%
*-commutative73.1%
*-commutative73.1%
+-commutative73.1%
+-commutative73.1%
*-commutative73.1%
associate-+l+73.1%
+-commutative73.1%
distribute-rgt-in73.1%
Simplified73.1%
Taylor expanded in z around inf 47.8%
+-commutative47.8%
Simplified47.8%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -1e-294) (* 2.0 (sqrt (* (+ y z) x))) (* 2.0 (sqrt (* z (+ y x))))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -1e-294) {
tmp = 2.0 * sqrt(((y + z) * x));
} 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 <= (-1d-294)) then
tmp = 2.0d0 * sqrt(((y + z) * x))
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 <= -1e-294) {
tmp = 2.0 * Math.sqrt(((y + z) * x));
} 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 <= -1e-294: tmp = 2.0 * math.sqrt(((y + z) * x)) 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 <= -1e-294) tmp = Float64(2.0 * sqrt(Float64(Float64(y + z) * x))); 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 <= -1e-294)
tmp = 2.0 * sqrt(((y + z) * x));
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, -1e-294], N[(2.0 * N[Sqrt[N[(N[(y + z), $MachinePrecision] * x), $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 \cdot 10^{-294}:\\
\;\;\;\;2 \cdot \sqrt{\left(y + z\right) \cdot x}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{z \cdot \left(y + x\right)}\\
\end{array}
\end{array}
if y < -1.00000000000000002e-294Initial program 72.3%
associate-+l+72.3%
*-commutative72.3%
*-commutative72.3%
*-commutative72.3%
+-commutative72.3%
+-commutative72.3%
associate-+l+72.3%
*-commutative72.3%
*-commutative72.3%
+-commutative72.3%
+-commutative72.3%
*-commutative72.3%
associate-+l+72.3%
+-commutative72.3%
distribute-rgt-in72.3%
Simplified72.3%
Taylor expanded in x around inf 48.1%
if -1.00000000000000002e-294 < y Initial program 72.9%
associate-+l+72.9%
*-commutative72.9%
*-commutative72.9%
*-commutative72.9%
+-commutative72.9%
+-commutative72.9%
associate-+l+72.9%
*-commutative72.9%
*-commutative72.9%
+-commutative72.9%
+-commutative72.9%
*-commutative72.9%
associate-+l+72.9%
+-commutative72.9%
distribute-rgt-in72.9%
Simplified72.9%
Taylor expanded in z around inf 47.4%
+-commutative47.4%
Simplified47.4%
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 1.25e-299) (* 2.0 (sqrt (* (+ y z) x))) (* 2.0 (sqrt (* y z)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 1.25e-299) {
tmp = 2.0 * sqrt(((y + z) * 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.25d-299) then
tmp = 2.0d0 * sqrt(((y + z) * 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.25e-299) {
tmp = 2.0 * Math.sqrt(((y + z) * 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.25e-299: tmp = 2.0 * math.sqrt(((y + z) * 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.25e-299) tmp = Float64(2.0 * sqrt(Float64(Float64(y + z) * 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.25e-299)
tmp = 2.0 * sqrt(((y + z) * 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.25e-299], N[(2.0 * N[Sqrt[N[(N[(y + z), $MachinePrecision] * 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.25 \cdot 10^{-299}:\\
\;\;\;\;2 \cdot \sqrt{\left(y + z\right) \cdot x}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot z}\\
\end{array}
\end{array}
if y < 1.24999999999999989e-299Initial program 73.1%
associate-+l+73.1%
*-commutative73.1%
*-commutative73.1%
*-commutative73.1%
+-commutative73.1%
+-commutative73.1%
associate-+l+73.1%
*-commutative73.1%
*-commutative73.1%
+-commutative73.1%
+-commutative73.1%
*-commutative73.1%
associate-+l+73.1%
+-commutative73.1%
distribute-rgt-in73.1%
Simplified73.1%
Taylor expanded in x around inf 49.7%
if 1.24999999999999989e-299 < y Initial program 72.0%
associate-+l+72.0%
*-commutative72.0%
*-commutative72.0%
*-commutative72.0%
+-commutative72.0%
+-commutative72.0%
associate-+l+72.0%
*-commutative72.0%
*-commutative72.0%
+-commutative72.0%
+-commutative72.0%
*-commutative72.0%
associate-+l+72.0%
+-commutative72.0%
distribute-rgt-in72.0%
Simplified72.0%
Taylor expanded in x around 0 24.1%
*-commutative24.1%
Simplified24.1%
Final simplification37.3%
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 z) (* (+ y z) x)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
return 2.0 * sqrt(((y * z) + ((y + z) * 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 * z) + ((y + z) * x)))
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
return 2.0 * Math.sqrt(((y * z) + ((y + z) * x)));
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): return 2.0 * math.sqrt(((y * z) + ((y + z) * x)))
x, y, z = sort([x, y, z]) function code(x, y, z) return Float64(2.0 * sqrt(Float64(Float64(y * z) + Float64(Float64(y + z) * x)))) end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp = code(x, y, z)
tmp = 2.0 * sqrt(((y * z) + ((y + z) * 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 * z), $MachinePrecision] + N[(N[(y + z), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
2 \cdot \sqrt{y \cdot z + \left(y + z\right) \cdot x}
\end{array}
Initial program 72.6%
distribute-lft-out72.6%
*-commutative72.6%
Applied egg-rr72.6%
Final simplification72.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 72.6%
associate-+l+72.6%
*-commutative72.6%
*-commutative72.6%
*-commutative72.6%
+-commutative72.6%
+-commutative72.6%
associate-+l+72.6%
*-commutative72.6%
*-commutative72.6%
+-commutative72.6%
+-commutative72.6%
*-commutative72.6%
associate-+l+72.6%
+-commutative72.6%
distribute-rgt-in72.6%
Simplified72.6%
Final simplification72.6%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -5e-310) (* 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 <= -5e-310) {
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 <= (-5d-310)) 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 <= -5e-310) {
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 <= -5e-310: 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 <= -5e-310) 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 <= -5e-310)
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, -5e-310], 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 -5 \cdot 10^{-310}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot x}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot z}\\
\end{array}
\end{array}
if y < -4.999999999999985e-310Initial program 72.5%
associate-+l+72.5%
*-commutative72.5%
*-commutative72.5%
*-commutative72.5%
+-commutative72.5%
+-commutative72.5%
associate-+l+72.5%
*-commutative72.5%
*-commutative72.5%
+-commutative72.5%
+-commutative72.5%
*-commutative72.5%
associate-+l+72.5%
+-commutative72.5%
distribute-rgt-in72.5%
Simplified72.5%
Taylor expanded in z around 0 29.1%
*-commutative29.1%
Simplified29.1%
if -4.999999999999985e-310 < y Initial program 72.7%
associate-+l+72.7%
*-commutative72.7%
*-commutative72.7%
*-commutative72.7%
+-commutative72.7%
+-commutative72.7%
associate-+l+72.7%
*-commutative72.7%
*-commutative72.7%
+-commutative72.7%
+-commutative72.7%
*-commutative72.7%
associate-+l+72.7%
+-commutative72.7%
distribute-rgt-in72.7%
Simplified72.7%
Taylor expanded in x around 0 23.6%
*-commutative23.6%
Simplified23.6%
Final simplification26.4%
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 72.6%
associate-+l+72.6%
*-commutative72.6%
*-commutative72.6%
*-commutative72.6%
+-commutative72.6%
+-commutative72.6%
associate-+l+72.6%
*-commutative72.6%
*-commutative72.6%
+-commutative72.6%
+-commutative72.6%
*-commutative72.6%
associate-+l+72.6%
+-commutative72.6%
distribute-rgt-in72.6%
Simplified72.6%
Taylor expanded in z around 0 28.6%
*-commutative28.6%
Simplified28.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 2024137
(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)))))