
(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 15 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
(let* ((t_0
(*
2.0
(pow (exp (* 0.25 (- (log (- (- y) z)) (log (/ -1.0 x))))) 2.0))))
(if (<= y -2.25e+14)
t_0
(if (<= y -8.2e-176)
(* 2.0 (sqrt (* x (+ y z))))
(if (<= y 1.38e-300)
t_0
(* 2.0 (* (sqrt (+ x (fma z (/ x y) z))) (sqrt y))))))))assert(x < y && y < z);
double code(double x, double y, double z) {
double t_0 = 2.0 * pow(exp((0.25 * (log((-y - z)) - log((-1.0 / x))))), 2.0);
double tmp;
if (y <= -2.25e+14) {
tmp = t_0;
} else if (y <= -8.2e-176) {
tmp = 2.0 * sqrt((x * (y + z)));
} else if (y <= 1.38e-300) {
tmp = t_0;
} else {
tmp = 2.0 * (sqrt((x + fma(z, (x / y), z))) * sqrt(y));
}
return tmp;
}
x, y, z = sort([x, y, z]) function code(x, y, z) t_0 = Float64(2.0 * (exp(Float64(0.25 * Float64(log(Float64(Float64(-y) - z)) - log(Float64(-1.0 / x))))) ^ 2.0)) tmp = 0.0 if (y <= -2.25e+14) tmp = t_0; elseif (y <= -8.2e-176) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z)))); elseif (y <= 1.38e-300) tmp = t_0; else tmp = Float64(2.0 * Float64(sqrt(Float64(x + fma(z, Float64(x / y), 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_] := Block[{t$95$0 = 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, -2.25e+14], t$95$0, If[LessEqual[y, -8.2e-176], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.38e-300], t$95$0, N[(2.0 * N[(N[Sqrt[N[(x + N[(z * N[(x / y), $MachinePrecision] + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
t_0 := 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{if}\;y \leq -2.25 \cdot 10^{+14}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;y \leq -8.2 \cdot 10^{-176}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{elif}\;y \leq 1.38 \cdot 10^{-300}:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{x + \mathsf{fma}\left(z, \frac{x}{y}, z\right)} \cdot \sqrt{y}\right)\\
\end{array}
\end{array}
if y < -2.25e14 or -8.2000000000000005e-176 < y < 1.3799999999999999e-300Initial 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-in59.0%
Simplified59.0%
+-commutative59.0%
distribute-rgt-in58.9%
associate-+l+58.9%
+-commutative58.9%
associate-+r+58.9%
*-commutative58.9%
distribute-lft-in58.9%
fma-undefine59.1%
add-sqr-sqrt58.7%
pow258.7%
Applied egg-rr58.9%
Taylor expanded in x around -inf 42.3%
if -2.25e14 < y < -8.2000000000000005e-176Initial program 86.7%
associate-+l+86.7%
*-commutative86.7%
*-commutative86.7%
*-commutative86.7%
+-commutative86.7%
+-commutative86.7%
associate-+l+86.7%
*-commutative86.7%
*-commutative86.7%
+-commutative86.7%
+-commutative86.7%
*-commutative86.7%
associate-+l+86.7%
+-commutative86.7%
distribute-rgt-in86.7%
Simplified86.7%
Taylor expanded in x around inf 48.4%
if 1.3799999999999999e-300 < y Initial program 69.9%
distribute-lft-out70.0%
*-commutative70.0%
Applied egg-rr70.0%
Taylor expanded in y around inf 63.1%
*-commutative63.1%
Simplified63.1%
*-commutative63.1%
sqrt-prod78.1%
+-commutative78.1%
associate-/l*79.4%
fma-define79.4%
Applied egg-rr79.4%
Final simplification61.2%
NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
:precision binary64
(if (<= y -2.9e+14)
(* 2.0 (pow (exp (* 0.25 (- (log (- y)) (log (/ -1.0 x))))) 2.0))
(if (<= y 2.2e-294)
(* 2.0 (pow (fma x y (* z (+ y x))) 0.5))
(* 2.0 (* (sqrt (+ x (fma z (/ x y) z))) (sqrt y))))))assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -2.9e+14) {
tmp = 2.0 * pow(exp((0.25 * (log(-y) - log((-1.0 / x))))), 2.0);
} else if (y <= 2.2e-294) {
tmp = 2.0 * pow(fma(x, y, (z * (y + x))), 0.5);
} else {
tmp = 2.0 * (sqrt((x + fma(z, (x / y), z))) * sqrt(y));
}
return tmp;
}
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -2.9e+14) tmp = Float64(2.0 * (exp(Float64(0.25 * Float64(log(Float64(-y)) - log(Float64(-1.0 / x))))) ^ 2.0)); elseif (y <= 2.2e-294) tmp = Float64(2.0 * (fma(x, y, Float64(z * Float64(y + x))) ^ 0.5)); else tmp = Float64(2.0 * Float64(sqrt(Float64(x + fma(z, Float64(x / y), 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.9e+14], 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, 2.2e-294], N[(2.0 * N[Power[N[(x * y + N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[N[(x + N[(z * N[(x / y), $MachinePrecision] + z), $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 -2.9 \cdot 10^{+14}:\\
\;\;\;\;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 2.2 \cdot 10^{-294}:\\
\;\;\;\;2 \cdot {\left(\mathsf{fma}\left(x, y, z \cdot \left(y + x\right)\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{x + \mathsf{fma}\left(z, \frac{x}{y}, z\right)} \cdot \sqrt{y}\right)\\
\end{array}
\end{array}
if y < -2.9e14Initial program 47.8%
associate-+l+47.8%
*-commutative47.8%
*-commutative47.8%
*-commutative47.8%
+-commutative47.8%
+-commutative47.8%
associate-+l+47.8%
*-commutative47.8%
*-commutative47.8%
+-commutative47.8%
+-commutative47.8%
*-commutative47.8%
associate-+l+47.8%
+-commutative47.8%
distribute-rgt-in47.9%
Simplified47.9%
+-commutative47.9%
distribute-rgt-in47.8%
associate-+l+47.8%
+-commutative47.8%
associate-+r+47.8%
*-commutative47.8%
distribute-lft-in47.8%
fma-undefine48.1%
add-sqr-sqrt47.8%
pow247.8%
Applied egg-rr48.0%
Taylor expanded in z around 0 24.3%
*-lft-identity24.3%
*-commutative24.3%
Simplified24.3%
Taylor expanded in x around -inf 40.1%
if -2.9e14 < y < 2.2e-294Initial program 85.6%
associate-+l+85.6%
*-commutative85.6%
*-commutative85.6%
*-commutative85.6%
+-commutative85.6%
+-commutative85.6%
associate-+l+85.6%
*-commutative85.6%
*-commutative85.6%
+-commutative85.6%
+-commutative85.6%
*-commutative85.6%
associate-+l+85.6%
+-commutative85.6%
distribute-rgt-in85.7%
Simplified85.7%
pow1/285.7%
+-commutative85.7%
fma-undefine85.7%
Applied egg-rr85.7%
if 2.2e-294 < y Initial program 70.2%
distribute-lft-out70.3%
*-commutative70.3%
Applied egg-rr70.3%
Taylor expanded in y around inf 64.1%
*-commutative64.1%
Simplified64.1%
*-commutative64.1%
sqrt-prod79.2%
+-commutative79.2%
associate-/l*79.8%
fma-define79.8%
Applied egg-rr79.8%
Final simplification71.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+14)
(* 2.0 (exp (* (- (log (- y)) (log (/ -1.0 x))) 0.5)))
(if (<= y 2.2e-294)
(* 2.0 (pow (fma x y (* z (+ y x))) 0.5))
(* 2.0 (* (sqrt (+ x (fma z (/ x y) z))) (sqrt y))))))assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -6e+14) {
tmp = 2.0 * exp(((log(-y) - log((-1.0 / x))) * 0.5));
} else if (y <= 2.2e-294) {
tmp = 2.0 * pow(fma(x, y, (z * (y + x))), 0.5);
} else {
tmp = 2.0 * (sqrt((x + fma(z, (x / y), z))) * sqrt(y));
}
return tmp;
}
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -6e+14) tmp = Float64(2.0 * exp(Float64(Float64(log(Float64(-y)) - log(Float64(-1.0 / x))) * 0.5))); elseif (y <= 2.2e-294) tmp = Float64(2.0 * (fma(x, y, Float64(z * Float64(y + x))) ^ 0.5)); else tmp = Float64(2.0 * Float64(sqrt(Float64(x + fma(z, Float64(x / y), 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, -6e+14], N[(2.0 * N[Exp[N[(N[(N[Log[(-y)], $MachinePrecision] - N[Log[N[(-1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 2.2e-294], N[(2.0 * N[Power[N[(x * y + N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[N[(x + N[(z * N[(x / y), $MachinePrecision] + z), $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 -6 \cdot 10^{+14}:\\
\;\;\;\;2 \cdot e^{\left(\log \left(-y\right) - \log \left(\frac{-1}{x}\right)\right) \cdot 0.5}\\
\mathbf{elif}\;y \leq 2.2 \cdot 10^{-294}:\\
\;\;\;\;2 \cdot {\left(\mathsf{fma}\left(x, y, z \cdot \left(y + x\right)\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{x + \mathsf{fma}\left(z, \frac{x}{y}, z\right)} \cdot \sqrt{y}\right)\\
\end{array}
\end{array}
if y < -6e14Initial program 47.8%
associate-+l+47.8%
*-commutative47.8%
*-commutative47.8%
*-commutative47.8%
+-commutative47.8%
+-commutative47.8%
associate-+l+47.8%
*-commutative47.8%
*-commutative47.8%
+-commutative47.8%
+-commutative47.8%
*-commutative47.8%
associate-+l+47.8%
+-commutative47.8%
distribute-rgt-in47.9%
Simplified47.9%
Taylor expanded in z around 0 24.1%
*-commutative24.1%
Simplified24.1%
pow1/224.5%
pow-to-exp22.7%
*-commutative22.7%
Applied egg-rr22.7%
Taylor expanded in x around -inf 40.1%
mul-1-neg40.1%
unsub-neg40.1%
mul-1-neg40.1%
Simplified40.1%
if -6e14 < y < 2.2e-294Initial program 85.6%
associate-+l+85.6%
*-commutative85.6%
*-commutative85.6%
*-commutative85.6%
+-commutative85.6%
+-commutative85.6%
associate-+l+85.6%
*-commutative85.6%
*-commutative85.6%
+-commutative85.6%
+-commutative85.6%
*-commutative85.6%
associate-+l+85.6%
+-commutative85.6%
distribute-rgt-in85.7%
Simplified85.7%
pow1/285.7%
+-commutative85.7%
fma-undefine85.7%
Applied egg-rr85.7%
if 2.2e-294 < y Initial program 70.2%
distribute-lft-out70.3%
*-commutative70.3%
Applied egg-rr70.3%
Taylor expanded in y around inf 64.1%
*-commutative64.1%
Simplified64.1%
*-commutative64.1%
sqrt-prod79.2%
+-commutative79.2%
associate-/l*79.8%
fma-define79.8%
Applied egg-rr79.8%
Final simplification71.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.6e+14)
(* 2.0 (exp (* (- (log (- y)) (log (/ -1.0 x))) 0.5)))
(if (<= y 900000000.0)
(* 2.0 (sqrt (* y (+ x (+ z (/ (* z x) y))))))
(* 2.0 (* (sqrt y) (sqrt z))))))assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -4.6e+14) {
tmp = 2.0 * exp(((log(-y) - log((-1.0 / x))) * 0.5));
} else if (y <= 900000000.0) {
tmp = 2.0 * sqrt((y * (x + (z + ((z * x) / y)))));
} 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 <= (-4.6d+14)) then
tmp = 2.0d0 * exp(((log(-y) - log(((-1.0d0) / x))) * 0.5d0))
else if (y <= 900000000.0d0) then
tmp = 2.0d0 * sqrt((y * (x + (z + ((z * x) / y)))))
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 <= -4.6e+14) {
tmp = 2.0 * Math.exp(((Math.log(-y) - Math.log((-1.0 / x))) * 0.5));
} else if (y <= 900000000.0) {
tmp = 2.0 * Math.sqrt((y * (x + (z + ((z * x) / y)))));
} 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 <= -4.6e+14: tmp = 2.0 * math.exp(((math.log(-y) - math.log((-1.0 / x))) * 0.5)) elif y <= 900000000.0: tmp = 2.0 * math.sqrt((y * (x + (z + ((z * x) / y))))) 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 <= -4.6e+14) tmp = Float64(2.0 * exp(Float64(Float64(log(Float64(-y)) - log(Float64(-1.0 / x))) * 0.5))); elseif (y <= 900000000.0) tmp = Float64(2.0 * sqrt(Float64(y * Float64(x + Float64(z + Float64(Float64(z * x) / y)))))); 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 <= -4.6e+14)
tmp = 2.0 * exp(((log(-y) - log((-1.0 / x))) * 0.5));
elseif (y <= 900000000.0)
tmp = 2.0 * sqrt((y * (x + (z + ((z * x) / y)))));
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, -4.6e+14], N[(2.0 * N[Exp[N[(N[(N[Log[(-y)], $MachinePrecision] - N[Log[N[(-1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 900000000.0], N[(2.0 * N[Sqrt[N[(y * N[(x + N[(z + N[(N[(z * x), $MachinePrecision] / y), $MachinePrecision]), $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.6 \cdot 10^{+14}:\\
\;\;\;\;2 \cdot e^{\left(\log \left(-y\right) - \log \left(\frac{-1}{x}\right)\right) \cdot 0.5}\\
\mathbf{elif}\;y \leq 900000000:\\
\;\;\;\;2 \cdot \sqrt{y \cdot \left(x + \left(z + \frac{z \cdot x}{y}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{y} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < -4.6e14Initial program 47.8%
associate-+l+47.8%
*-commutative47.8%
*-commutative47.8%
*-commutative47.8%
+-commutative47.8%
+-commutative47.8%
associate-+l+47.8%
*-commutative47.8%
*-commutative47.8%
+-commutative47.8%
+-commutative47.8%
*-commutative47.8%
associate-+l+47.8%
+-commutative47.8%
distribute-rgt-in47.9%
Simplified47.9%
Taylor expanded in z around 0 24.1%
*-commutative24.1%
Simplified24.1%
pow1/224.5%
pow-to-exp22.7%
*-commutative22.7%
Applied egg-rr22.7%
Taylor expanded in x around -inf 40.1%
mul-1-neg40.1%
unsub-neg40.1%
mul-1-neg40.1%
Simplified40.1%
if -4.6e14 < y < 9e8Initial program 82.4%
associate-+l+82.4%
*-commutative82.4%
*-commutative82.4%
*-commutative82.4%
+-commutative82.4%
+-commutative82.4%
associate-+l+82.4%
*-commutative82.4%
*-commutative82.4%
+-commutative82.4%
+-commutative82.4%
*-commutative82.4%
associate-+l+82.4%
+-commutative82.4%
distribute-rgt-in82.4%
Simplified82.4%
Taylor expanded in y around inf 67.5%
if 9e8 < y Initial program 61.5%
associate-+l+61.5%
*-commutative61.5%
*-commutative61.5%
*-commutative61.5%
+-commutative61.5%
+-commutative61.5%
associate-+l+61.5%
*-commutative61.5%
*-commutative61.5%
+-commutative61.5%
+-commutative61.5%
*-commutative61.5%
associate-+l+61.5%
+-commutative61.5%
distribute-rgt-in61.5%
Simplified61.5%
Taylor expanded in x around 0 30.1%
*-commutative30.1%
sqrt-prod47.7%
Applied egg-rr47.7%
Final simplification56.3%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 650000000000.0) (* 2.0 (pow (fma x y (* z (+ y x))) 0.5)) (* 2.0 (* (sqrt y) (sqrt z)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 650000000000.0) {
tmp = 2.0 * pow(fma(x, y, (z * (y + x))), 0.5);
} 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 <= 650000000000.0) tmp = Float64(2.0 * (fma(x, y, Float64(z * Float64(y + x))) ^ 0.5)); 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, 650000000000.0], N[(2.0 * N[Power[N[(x * y + N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $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 650000000000:\\
\;\;\;\;2 \cdot {\left(\mathsf{fma}\left(x, y, z \cdot \left(y + x\right)\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{y} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < 6.5e11Initial program 71.5%
associate-+l+71.5%
*-commutative71.5%
*-commutative71.5%
*-commutative71.5%
+-commutative71.5%
+-commutative71.5%
associate-+l+71.5%
*-commutative71.5%
*-commutative71.5%
+-commutative71.5%
+-commutative71.5%
*-commutative71.5%
associate-+l+71.5%
+-commutative71.5%
distribute-rgt-in71.5%
Simplified71.5%
pow1/271.5%
+-commutative71.5%
fma-undefine71.7%
Applied egg-rr71.7%
if 6.5e11 < y Initial program 61.5%
associate-+l+61.5%
*-commutative61.5%
*-commutative61.5%
*-commutative61.5%
+-commutative61.5%
+-commutative61.5%
associate-+l+61.5%
*-commutative61.5%
*-commutative61.5%
+-commutative61.5%
+-commutative61.5%
*-commutative61.5%
associate-+l+61.5%
+-commutative61.5%
distribute-rgt-in61.5%
Simplified61.5%
Taylor expanded in x around 0 30.1%
*-commutative30.1%
sqrt-prod47.7%
Applied egg-rr47.7%
Final simplification66.1%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 1150000000.0) (* 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 <= 1150000000.0) {
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 <= 1150000000.0) 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, 1150000000.0], 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 1150000000:\\
\;\;\;\;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 < 1.15e9Initial program 71.5%
associate-+l+71.5%
*-commutative71.5%
*-commutative71.5%
*-commutative71.5%
+-commutative71.5%
+-commutative71.5%
+-commutative71.5%
*-commutative71.5%
*-commutative71.5%
associate-+l+71.5%
+-commutative71.5%
fma-define71.5%
distribute-lft-out71.6%
Simplified71.6%
if 1.15e9 < y Initial program 61.5%
associate-+l+61.5%
*-commutative61.5%
*-commutative61.5%
*-commutative61.5%
+-commutative61.5%
+-commutative61.5%
associate-+l+61.5%
*-commutative61.5%
*-commutative61.5%
+-commutative61.5%
+-commutative61.5%
*-commutative61.5%
associate-+l+61.5%
+-commutative61.5%
distribute-rgt-in61.5%
Simplified61.5%
Taylor expanded in x around 0 30.1%
*-commutative30.1%
sqrt-prod47.7%
Applied egg-rr47.7%
Final simplification66.1%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 210000000.0) (* 2.0 (sqrt (+ (* x (+ y z)) (* y z)))) (* 2.0 (* (sqrt y) (sqrt z)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 210000000.0) {
tmp = 2.0 * sqrt(((x * (y + z)) + (y * z)));
} 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 <= 210000000.0d0) then
tmp = 2.0d0 * sqrt(((x * (y + z)) + (y * z)))
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 <= 210000000.0) {
tmp = 2.0 * Math.sqrt(((x * (y + z)) + (y * z)));
} 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 <= 210000000.0: tmp = 2.0 * math.sqrt(((x * (y + z)) + (y * z))) 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 <= 210000000.0) tmp = Float64(2.0 * sqrt(Float64(Float64(x * Float64(y + z)) + Float64(y * z)))); 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 <= 210000000.0)
tmp = 2.0 * sqrt(((x * (y + z)) + (y * z)));
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, 210000000.0], N[(2.0 * N[Sqrt[N[(N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision] + N[(y * z), $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 210000000:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right) + y \cdot z}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{y} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < 2.1e8Initial program 71.5%
distribute-lft-out71.5%
*-commutative71.5%
Applied egg-rr71.5%
if 2.1e8 < y Initial program 61.5%
associate-+l+61.5%
*-commutative61.5%
*-commutative61.5%
*-commutative61.5%
+-commutative61.5%
+-commutative61.5%
associate-+l+61.5%
*-commutative61.5%
*-commutative61.5%
+-commutative61.5%
+-commutative61.5%
*-commutative61.5%
associate-+l+61.5%
+-commutative61.5%
distribute-rgt-in61.5%
Simplified61.5%
Taylor expanded in x around 0 30.1%
*-commutative30.1%
sqrt-prod47.7%
Applied egg-rr47.7%
Final simplification66.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.2e-294) (* 2.0 (sqrt (* x (+ y z)))) (* 2.0 (sqrt (* y (* z (+ (/ x y) 1.0)))))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 2.2e-294) {
tmp = 2.0 * sqrt((x * (y + z)));
} else {
tmp = 2.0 * sqrt((y * (z * ((x / y) + 1.0))));
}
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.2d-294) then
tmp = 2.0d0 * sqrt((x * (y + z)))
else
tmp = 2.0d0 * sqrt((y * (z * ((x / y) + 1.0d0))))
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.2e-294) {
tmp = 2.0 * Math.sqrt((x * (y + z)));
} else {
tmp = 2.0 * Math.sqrt((y * (z * ((x / y) + 1.0))));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= 2.2e-294: tmp = 2.0 * math.sqrt((x * (y + z))) else: tmp = 2.0 * math.sqrt((y * (z * ((x / y) + 1.0)))) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 2.2e-294) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z)))); else tmp = Float64(2.0 * sqrt(Float64(y * Float64(z * Float64(Float64(x / y) + 1.0))))); 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.2e-294)
tmp = 2.0 * sqrt((x * (y + z)));
else
tmp = 2.0 * sqrt((y * (z * ((x / y) + 1.0))));
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.2e-294], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[Sqrt[N[(y * N[(z * N[(N[(x / y), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 2.2 \cdot 10^{-294}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot \left(z \cdot \left(\frac{x}{y} + 1\right)\right)}\\
\end{array}
\end{array}
if y < 2.2e-294Initial program 68.3%
associate-+l+68.3%
*-commutative68.3%
*-commutative68.3%
*-commutative68.3%
+-commutative68.3%
+-commutative68.3%
associate-+l+68.3%
*-commutative68.3%
*-commutative68.3%
+-commutative68.3%
+-commutative68.3%
*-commutative68.3%
associate-+l+68.3%
+-commutative68.3%
distribute-rgt-in68.3%
Simplified68.3%
Taylor expanded in x around inf 42.5%
if 2.2e-294 < y Initial program 70.2%
distribute-lft-out70.3%
*-commutative70.3%
Applied egg-rr70.3%
Taylor expanded in y around inf 64.1%
*-commutative64.1%
Simplified64.1%
Taylor expanded in z around inf 39.3%
Final simplification41.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.2e-294) (* 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 <= 2.2e-294) {
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 <= 2.2d-294) 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 <= 2.2e-294) {
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 <= 2.2e-294: 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 <= 2.2e-294) 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 <= 2.2e-294)
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, 2.2e-294], 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 2.2 \cdot 10^{-294}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot z}\\
\end{array}
\end{array}
if y < 2.2e-294Initial program 68.3%
associate-+l+68.3%
*-commutative68.3%
*-commutative68.3%
*-commutative68.3%
+-commutative68.3%
+-commutative68.3%
associate-+l+68.3%
*-commutative68.3%
*-commutative68.3%
+-commutative68.3%
+-commutative68.3%
*-commutative68.3%
associate-+l+68.3%
+-commutative68.3%
distribute-rgt-in68.3%
Simplified68.3%
Taylor expanded in x around inf 42.5%
if 2.2e-294 < y Initial program 70.2%
associate-+l+70.2%
*-commutative70.2%
*-commutative70.2%
*-commutative70.2%
+-commutative70.2%
+-commutative70.2%
associate-+l+70.2%
*-commutative70.2%
*-commutative70.2%
+-commutative70.2%
+-commutative70.2%
*-commutative70.2%
associate-+l+70.2%
+-commutative70.2%
distribute-rgt-in70.2%
Simplified70.2%
Taylor expanded in x around 0 27.4%
Final simplification35.3%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -2e-294) (* 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-294) {
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-294)) 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-294) {
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-294: 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-294) 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-294)
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-294], 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^{-294}:\\
\;\;\;\;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 < -2.00000000000000003e-294Initial program 68.2%
associate-+l+68.2%
*-commutative68.2%
*-commutative68.2%
*-commutative68.2%
+-commutative68.2%
+-commutative68.2%
associate-+l+68.2%
*-commutative68.2%
*-commutative68.2%
+-commutative68.2%
+-commutative68.2%
*-commutative68.2%
associate-+l+68.2%
+-commutative68.2%
distribute-rgt-in68.3%
Simplified68.3%
Taylor expanded in x around inf 41.2%
if -2.00000000000000003e-294 < y Initial program 70.2%
associate-+l+70.2%
*-commutative70.2%
*-commutative70.2%
*-commutative70.2%
+-commutative70.2%
+-commutative70.2%
associate-+l+70.2%
*-commutative70.2%
*-commutative70.2%
+-commutative70.2%
+-commutative70.2%
*-commutative70.2%
associate-+l+70.2%
+-commutative70.2%
distribute-rgt-in70.2%
Simplified70.2%
Taylor expanded in z around inf 48.3%
+-commutative48.3%
Simplified48.3%
Final simplification44.8%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (* 2.0 (pow (+ (* y x) (* z (+ y x))) 0.5)))
assert(x < y && y < z);
double code(double x, double y, double z) {
return 2.0 * pow(((y * x) + (z * (y + x))), 0.5);
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = 2.0d0 * (((y * x) + (z * (y + x))) ** 0.5d0)
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
return 2.0 * Math.pow(((y * x) + (z * (y + x))), 0.5);
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): return 2.0 * math.pow(((y * x) + (z * (y + x))), 0.5)
x, y, z = sort([x, y, z]) function code(x, y, z) return Float64(2.0 * (Float64(Float64(y * x) + Float64(z * Float64(y + x))) ^ 0.5)) end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp = code(x, y, z)
tmp = 2.0 * (((y * x) + (z * (y + x))) ^ 0.5);
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := N[(2.0 * N[Power[N[(N[(y * x), $MachinePrecision] + N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
2 \cdot {\left(y \cdot x + z \cdot \left(y + x\right)\right)}^{0.5}
\end{array}
Initial program 69.2%
associate-+l+69.2%
*-commutative69.2%
*-commutative69.2%
*-commutative69.2%
+-commutative69.2%
+-commutative69.2%
associate-+l+69.2%
*-commutative69.2%
*-commutative69.2%
+-commutative69.2%
+-commutative69.2%
*-commutative69.2%
associate-+l+69.2%
+-commutative69.2%
distribute-rgt-in69.2%
Simplified69.2%
pow1/269.2%
+-commutative69.2%
fma-undefine69.4%
Applied egg-rr69.4%
fma-undefine69.2%
+-commutative69.2%
+-commutative69.2%
+-commutative69.2%
Applied egg-rr69.2%
Final simplification69.2%
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 69.2%
associate-+l+69.2%
*-commutative69.2%
*-commutative69.2%
*-commutative69.2%
+-commutative69.2%
+-commutative69.2%
associate-+l+69.2%
*-commutative69.2%
*-commutative69.2%
+-commutative69.2%
+-commutative69.2%
*-commutative69.2%
associate-+l+69.2%
+-commutative69.2%
distribute-rgt-in69.2%
Simplified69.2%
Final simplification69.2%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (* 2.0 (sqrt (+ (* x (+ y z)) (* y z)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
return 2.0 * sqrt(((x * (y + z)) + (y * z)));
}
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(((x * (y + z)) + (y * z)))
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
return 2.0 * Math.sqrt(((x * (y + z)) + (y * z)));
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): return 2.0 * math.sqrt(((x * (y + z)) + (y * z)))
x, y, z = sort([x, y, z]) function code(x, y, z) return Float64(2.0 * sqrt(Float64(Float64(x * Float64(y + z)) + Float64(y * z)))) end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp = code(x, y, z)
tmp = 2.0 * sqrt(((x * (y + z)) + (y * z)));
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[(x * N[(y + z), $MachinePrecision]), $MachinePrecision] + N[(y * z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
2 \cdot \sqrt{x \cdot \left(y + z\right) + y \cdot z}
\end{array}
Initial program 69.2%
distribute-lft-out69.2%
*-commutative69.2%
Applied egg-rr69.2%
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 -1e-309) (* 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 <= -1e-309) {
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 <= (-1d-309)) 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 <= -1e-309) {
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 <= -1e-309: 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 <= -1e-309) 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 <= -1e-309)
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, -1e-309], N[(2.0 * N[Sqrt[N[(y * x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[Sqrt[N[(y * z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -1 \cdot 10^{-309}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot x}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot z}\\
\end{array}
\end{array}
if y < -1.000000000000002e-309Initial program 68.3%
associate-+l+68.3%
*-commutative68.3%
*-commutative68.3%
*-commutative68.3%
+-commutative68.3%
+-commutative68.3%
associate-+l+68.3%
*-commutative68.3%
*-commutative68.3%
+-commutative68.3%
+-commutative68.3%
*-commutative68.3%
associate-+l+68.3%
+-commutative68.3%
distribute-rgt-in68.3%
Simplified68.3%
Taylor expanded in z around 0 20.4%
*-commutative20.4%
Simplified20.4%
if -1.000000000000002e-309 < y Initial program 70.2%
associate-+l+70.2%
*-commutative70.2%
*-commutative70.2%
*-commutative70.2%
+-commutative70.2%
+-commutative70.2%
associate-+l+70.2%
*-commutative70.2%
*-commutative70.2%
+-commutative70.2%
+-commutative70.2%
*-commutative70.2%
associate-+l+70.2%
+-commutative70.2%
distribute-rgt-in70.2%
Simplified70.2%
Taylor expanded in x around 0 26.8%
Final simplification23.5%
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 69.2%
associate-+l+69.2%
*-commutative69.2%
*-commutative69.2%
*-commutative69.2%
+-commutative69.2%
+-commutative69.2%
associate-+l+69.2%
*-commutative69.2%
*-commutative69.2%
+-commutative69.2%
+-commutative69.2%
*-commutative69.2%
associate-+l+69.2%
+-commutative69.2%
distribute-rgt-in69.2%
Simplified69.2%
Taylor expanded in z around 0 22.0%
*-commutative22.0%
Simplified22.0%
Final simplification22.0%
(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 2024072
(FPCore (x y z)
:name "Diagrams.TwoD.Apollonian:descartes from diagrams-contrib-1.3.0.5"
:precision binary64
:alt
(if (< z 7.636950090573675e+176) (* 2.0 (sqrt (+ (* (+ x y) z) (* x y)))) (* (* (+ (* 0.25 (* (* (pow y -0.75) (* (pow z -0.75) x)) (+ y z))) (* (pow z 0.25) (pow y 0.25))) (+ (* 0.25 (* (* (pow y -0.75) (* (pow z -0.75) x)) (+ y z))) (* (pow z 0.25) (pow y 0.25)))) 2.0))
(* 2.0 (sqrt (+ (+ (* x y) (* x z)) (* y z)))))