
(FPCore (x y z) :precision binary64 (* 2.0 (sqrt (+ (+ (* x y) (* x z)) (* y z)))))
double code(double x, double y, double z) {
return 2.0 * sqrt((((x * y) + (x * z)) + (y * z)));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = 2.0d0 * sqrt((((x * y) + (x * z)) + (y * z)))
end function
public static double code(double x, double y, double z) {
return 2.0 * Math.sqrt((((x * y) + (x * z)) + (y * z)));
}
def code(x, y, z): return 2.0 * math.sqrt((((x * y) + (x * z)) + (y * z)))
function code(x, y, z) return Float64(2.0 * sqrt(Float64(Float64(Float64(x * y) + Float64(x * z)) + Float64(y * z)))) end
function tmp = code(x, y, z) tmp = 2.0 * sqrt((((x * y) + (x * z)) + (y * z))); end
code[x_, y_, z_] := N[(2.0 * N[Sqrt[N[(N[(N[(x * y), $MachinePrecision] + N[(x * z), $MachinePrecision]), $MachinePrecision] + N[(y * z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
2 \cdot \sqrt{\left(x \cdot y + x \cdot z\right) + y \cdot z}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 11 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z) :precision binary64 (* 2.0 (sqrt (+ (+ (* x y) (* x z)) (* y z)))))
double code(double x, double y, double z) {
return 2.0 * sqrt((((x * y) + (x * z)) + (y * z)));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = 2.0d0 * sqrt((((x * y) + (x * z)) + (y * z)))
end function
public static double code(double x, double y, double z) {
return 2.0 * Math.sqrt((((x * y) + (x * z)) + (y * z)));
}
def code(x, y, z): return 2.0 * math.sqrt((((x * y) + (x * z)) + (y * z)))
function code(x, y, z) return Float64(2.0 * sqrt(Float64(Float64(Float64(x * y) + Float64(x * z)) + Float64(y * z)))) end
function tmp = code(x, y, z) tmp = 2.0 * sqrt((((x * y) + (x * z)) + (y * z))); end
code[x_, y_, z_] := N[(2.0 * N[Sqrt[N[(N[(N[(x * y), $MachinePrecision] + N[(x * z), $MachinePrecision]), $MachinePrecision] + N[(y * z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
2 \cdot \sqrt{\left(x \cdot y + x \cdot z\right) + y \cdot z}
\end{array}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
:precision binary64
(if (<= y -1.05e+75)
(* 2.0 (pow (exp (* 0.25 (- (log (- y)) (log (/ -1.0 x))))) 2.0))
(if (<= y -1.9e-305)
(* 2.0 (sqrt (* x (+ (+ y 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 <= -1.05e+75) {
tmp = 2.0 * pow(exp((0.25 * (log(-y) - log((-1.0 / x))))), 2.0);
} else if (y <= -1.9e-305) {
tmp = 2.0 * sqrt((x * ((y + z) + (y * (z / 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 <= (-1.05d+75)) then
tmp = 2.0d0 * (exp((0.25d0 * (log(-y) - log(((-1.0d0) / x))))) ** 2.0d0)
else if (y <= (-1.9d-305)) then
tmp = 2.0d0 * sqrt((x * ((y + z) + (y * (z / 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 <= -1.05e+75) {
tmp = 2.0 * Math.pow(Math.exp((0.25 * (Math.log(-y) - Math.log((-1.0 / x))))), 2.0);
} else if (y <= -1.9e-305) {
tmp = 2.0 * Math.sqrt((x * ((y + z) + (y * (z / 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 <= -1.05e+75: tmp = 2.0 * math.pow(math.exp((0.25 * (math.log(-y) - math.log((-1.0 / x))))), 2.0) elif y <= -1.9e-305: tmp = 2.0 * math.sqrt((x * ((y + z) + (y * (z / 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 <= -1.05e+75) tmp = Float64(2.0 * (exp(Float64(0.25 * Float64(log(Float64(-y)) - log(Float64(-1.0 / x))))) ^ 2.0)); elseif (y <= -1.9e-305) tmp = Float64(2.0 * sqrt(Float64(x * Float64(Float64(y + z) + Float64(y * Float64(z / 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 <= -1.05e+75)
tmp = 2.0 * (exp((0.25 * (log(-y) - log((-1.0 / x))))) ^ 2.0);
elseif (y <= -1.9e-305)
tmp = 2.0 * sqrt((x * ((y + z) + (y * (z / 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, -1.05e+75], 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, -1.9e-305], N[(2.0 * N[Sqrt[N[(x * N[(N[(y + z), $MachinePrecision] + N[(y * N[(z / x), $MachinePrecision]), $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 -1.05 \cdot 10^{+75}:\\
\;\;\;\;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 -1.9 \cdot 10^{-305}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(\left(y + z\right) + y \cdot \frac{z}{x}\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{y + x} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < -1.04999999999999999e75Initial program 53.1%
associate-+l+53.1%
*-commutative53.1%
*-commutative53.1%
*-commutative53.1%
+-commutative53.1%
+-commutative53.1%
associate-+l+53.1%
*-commutative53.1%
*-commutative53.1%
+-commutative53.1%
+-commutative53.1%
*-commutative53.1%
associate-+l+53.1%
+-commutative53.1%
distribute-rgt-in53.2%
Simplified53.2%
Taylor expanded in z around 0 35.6%
*-commutative35.6%
Simplified35.6%
add-sqr-sqrt35.5%
pow235.5%
pow1/235.7%
*-commutative35.7%
sqrt-pow135.8%
*-commutative35.8%
metadata-eval35.8%
Applied egg-rr35.8%
Taylor expanded in x around -inf 51.5%
if -1.04999999999999999e75 < y < -1.9e-305Initial program 80.4%
associate-+l+80.4%
*-commutative80.4%
*-commutative80.4%
*-commutative80.4%
+-commutative80.4%
+-commutative80.4%
associate-+l+80.4%
*-commutative80.4%
*-commutative80.4%
+-commutative80.4%
+-commutative80.4%
*-commutative80.4%
associate-+l+80.4%
+-commutative80.4%
distribute-rgt-in80.5%
Simplified80.5%
Taylor expanded in x around inf 75.5%
associate-+r+75.5%
associate-/l*71.8%
Simplified71.8%
if -1.9e-305 < y Initial program 66.4%
associate-+l+66.4%
*-commutative66.4%
*-commutative66.4%
*-commutative66.4%
+-commutative66.4%
+-commutative66.4%
associate-+l+66.4%
*-commutative66.4%
*-commutative66.4%
+-commutative66.4%
+-commutative66.4%
*-commutative66.4%
associate-+l+66.4%
+-commutative66.4%
distribute-rgt-in66.5%
Simplified66.5%
Taylor expanded in z around inf 60.4%
associate-+r+60.4%
+-commutative60.4%
associate-/l*58.9%
Simplified58.9%
*-commutative58.9%
sqrt-prod58.1%
+-commutative58.1%
+-commutative58.1%
fma-define58.1%
+-commutative58.1%
Applied egg-rr58.1%
Taylor expanded in z around inf 48.5%
+-commutative48.5%
Simplified48.5%
Final simplification56.2%
NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
:precision binary64
(if (<= z -5.6e-210)
(* 2.0 (* (sqrt (+ 1.0 (/ y z))) (sqrt (* x z))))
(if (<= z 1.35e+63)
(* 2.0 (sqrt (fma x z (* y (+ x z)))))
(* 2.0 (* (sqrt z) (sqrt (fma x (/ y z) (+ y x))))))))assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (z <= -5.6e-210) {
tmp = 2.0 * (sqrt((1.0 + (y / z))) * sqrt((x * z)));
} else if (z <= 1.35e+63) {
tmp = 2.0 * sqrt(fma(x, z, (y * (x + z))));
} else {
tmp = 2.0 * (sqrt(z) * sqrt(fma(x, (y / z), (y + x))));
}
return tmp;
}
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (z <= -5.6e-210) tmp = Float64(2.0 * Float64(sqrt(Float64(1.0 + Float64(y / z))) * sqrt(Float64(x * z)))); elseif (z <= 1.35e+63) tmp = Float64(2.0 * sqrt(fma(x, z, Float64(y * Float64(x + z))))); else tmp = Float64(2.0 * Float64(sqrt(z) * sqrt(fma(x, Float64(y / z), 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[z, -5.6e-210], N[(2.0 * N[(N[Sqrt[N[(1.0 + N[(y / z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(x * z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.35e+63], N[(2.0 * N[Sqrt[N[(x * z + N[(y * N[(x + z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[z], $MachinePrecision] * N[Sqrt[N[(x * N[(y / z), $MachinePrecision] + N[(y + x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -5.6 \cdot 10^{-210}:\\
\;\;\;\;2 \cdot \left(\sqrt{1 + \frac{y}{z}} \cdot \sqrt{x \cdot z}\right)\\
\mathbf{elif}\;z \leq 1.35 \cdot 10^{+63}:\\
\;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, z, y \cdot \left(x + z\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{\mathsf{fma}\left(x, \frac{y}{z}, y + x\right)}\right)\\
\end{array}
\end{array}
if z < -5.6e-210Initial program 68.6%
associate-+l+68.6%
*-commutative68.6%
*-commutative68.6%
*-commutative68.6%
+-commutative68.6%
+-commutative68.6%
associate-+l+68.6%
*-commutative68.6%
*-commutative68.6%
+-commutative68.6%
+-commutative68.6%
*-commutative68.6%
associate-+l+68.6%
+-commutative68.6%
distribute-rgt-in68.7%
Simplified68.7%
Taylor expanded in z around inf 66.7%
associate-+r+66.7%
+-commutative66.7%
associate-/l*63.8%
Simplified63.8%
Taylor expanded in x around inf 43.0%
associate-*r*43.0%
Simplified43.0%
*-commutative43.0%
sqrt-prod37.6%
Applied egg-rr37.6%
if -5.6e-210 < z < 1.35000000000000009e63Initial program 79.6%
associate-+l+79.6%
*-commutative79.6%
*-commutative79.6%
*-commutative79.6%
+-commutative79.6%
+-commutative79.6%
+-commutative79.6%
*-commutative79.6%
*-commutative79.6%
associate-+l+79.6%
+-commutative79.6%
fma-define79.6%
distribute-lft-out79.7%
Simplified79.7%
if 1.35000000000000009e63 < z Initial program 42.0%
associate-+l+42.0%
*-commutative42.0%
*-commutative42.0%
*-commutative42.0%
+-commutative42.0%
+-commutative42.0%
associate-+l+42.0%
*-commutative42.0%
*-commutative42.0%
+-commutative42.0%
+-commutative42.0%
*-commutative42.0%
associate-+l+42.0%
+-commutative42.0%
distribute-rgt-in42.3%
Simplified42.3%
Taylor expanded in z around inf 42.4%
associate-+r+42.4%
+-commutative42.4%
associate-/l*42.6%
Simplified42.6%
*-commutative42.6%
sqrt-prod95.7%
+-commutative95.7%
+-commutative95.7%
fma-define95.7%
+-commutative95.7%
Applied egg-rr95.7%
Final simplification66.9%
NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
:precision binary64
(if (<= z -5.6e-210)
(* 2.0 (* (sqrt (+ 1.0 (/ y z))) (sqrt (* x z))))
(if (<= z 2.5e+160)
(* 2.0 (sqrt (fma x z (* y (+ x z)))))
(* 2.0 (* (sqrt (+ y x)) (sqrt z))))))assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (z <= -5.6e-210) {
tmp = 2.0 * (sqrt((1.0 + (y / z))) * sqrt((x * z)));
} else if (z <= 2.5e+160) {
tmp = 2.0 * sqrt(fma(x, z, (y * (x + z))));
} 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 (z <= -5.6e-210) tmp = Float64(2.0 * Float64(sqrt(Float64(1.0 + Float64(y / z))) * sqrt(Float64(x * z)))); elseif (z <= 2.5e+160) tmp = Float64(2.0 * sqrt(fma(x, z, Float64(y * Float64(x + z))))); 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[z, -5.6e-210], N[(2.0 * N[(N[Sqrt[N[(1.0 + N[(y / z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(x * z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 2.5e+160], N[(2.0 * N[Sqrt[N[(x * z + N[(y * N[(x + z), $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}\;z \leq -5.6 \cdot 10^{-210}:\\
\;\;\;\;2 \cdot \left(\sqrt{1 + \frac{y}{z}} \cdot \sqrt{x \cdot z}\right)\\
\mathbf{elif}\;z \leq 2.5 \cdot 10^{+160}:\\
\;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, z, y \cdot \left(x + z\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{y + x} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if z < -5.6e-210Initial program 68.6%
associate-+l+68.6%
*-commutative68.6%
*-commutative68.6%
*-commutative68.6%
+-commutative68.6%
+-commutative68.6%
associate-+l+68.6%
*-commutative68.6%
*-commutative68.6%
+-commutative68.6%
+-commutative68.6%
*-commutative68.6%
associate-+l+68.6%
+-commutative68.6%
distribute-rgt-in68.7%
Simplified68.7%
Taylor expanded in z around inf 66.7%
associate-+r+66.7%
+-commutative66.7%
associate-/l*63.8%
Simplified63.8%
Taylor expanded in x around inf 43.0%
associate-*r*43.0%
Simplified43.0%
*-commutative43.0%
sqrt-prod37.6%
Applied egg-rr37.6%
if -5.6e-210 < z < 2.5000000000000001e160Initial program 75.7%
associate-+l+75.7%
*-commutative75.7%
*-commutative75.7%
*-commutative75.7%
+-commutative75.7%
+-commutative75.7%
+-commutative75.7%
*-commutative75.7%
*-commutative75.7%
associate-+l+75.7%
+-commutative75.7%
fma-define75.7%
distribute-lft-out75.8%
Simplified75.8%
if 2.5000000000000001e160 < z Initial program 30.8%
associate-+l+30.8%
*-commutative30.8%
*-commutative30.8%
*-commutative30.8%
+-commutative30.8%
+-commutative30.8%
associate-+l+30.8%
*-commutative30.8%
*-commutative30.8%
+-commutative30.8%
+-commutative30.8%
*-commutative30.8%
associate-+l+30.8%
+-commutative30.8%
distribute-rgt-in31.4%
Simplified31.4%
Taylor expanded in z around inf 31.4%
associate-+r+31.4%
+-commutative31.4%
associate-/l*31.8%
Simplified31.8%
*-commutative31.8%
sqrt-prod99.4%
+-commutative99.4%
+-commutative99.4%
fma-define99.4%
+-commutative99.4%
Applied egg-rr99.4%
Taylor expanded in z around inf 96.4%
+-commutative96.4%
Simplified96.4%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 3.15e-307) (* 2.0 (sqrt (* x (+ (+ y 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 <= 3.15e-307) {
tmp = 2.0 * sqrt((x * ((y + z) + (y * (z / 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.15d-307) then
tmp = 2.0d0 * sqrt((x * ((y + z) + (y * (z / 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.15e-307) {
tmp = 2.0 * Math.sqrt((x * ((y + z) + (y * (z / 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.15e-307: tmp = 2.0 * math.sqrt((x * ((y + z) + (y * (z / 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.15e-307) tmp = Float64(2.0 * sqrt(Float64(x * Float64(Float64(y + z) + Float64(y * Float64(z / 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.15e-307)
tmp = 2.0 * sqrt((x * ((y + z) + (y * (z / 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.15e-307], N[(2.0 * N[Sqrt[N[(x * N[(N[(y + z), $MachinePrecision] + N[(y * N[(z / x), $MachinePrecision]), $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.15 \cdot 10^{-307}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(\left(y + z\right) + y \cdot \frac{z}{x}\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{y + x} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < 3.1500000000000002e-307Initial program 69.4%
associate-+l+69.4%
*-commutative69.4%
*-commutative69.4%
*-commutative69.4%
+-commutative69.4%
+-commutative69.4%
associate-+l+69.4%
*-commutative69.4%
*-commutative69.4%
+-commutative69.4%
+-commutative69.4%
*-commutative69.4%
associate-+l+69.4%
+-commutative69.4%
distribute-rgt-in69.5%
Simplified69.5%
Taylor expanded in x around inf 63.6%
associate-+r+63.6%
associate-/l*61.6%
Simplified61.6%
if 3.1500000000000002e-307 < y Initial program 66.4%
associate-+l+66.4%
*-commutative66.4%
*-commutative66.4%
*-commutative66.4%
+-commutative66.4%
+-commutative66.4%
associate-+l+66.4%
*-commutative66.4%
*-commutative66.4%
+-commutative66.4%
+-commutative66.4%
*-commutative66.4%
associate-+l+66.4%
+-commutative66.4%
distribute-rgt-in66.5%
Simplified66.5%
Taylor expanded in z around inf 60.4%
associate-+r+60.4%
+-commutative60.4%
associate-/l*58.9%
Simplified58.9%
*-commutative58.9%
sqrt-prod58.1%
+-commutative58.1%
+-commutative58.1%
fma-define58.1%
+-commutative58.1%
Applied egg-rr58.1%
Taylor expanded in z around inf 48.5%
+-commutative48.5%
Simplified48.5%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 8.5e+50) (* 2.0 (sqrt (+ (* x z) (* y (+ x z))))) (* 2.0 (* (sqrt z) (sqrt y)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 8.5e+50) {
tmp = 2.0 * sqrt(((x * z) + (y * (x + z))));
} 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 <= 8.5d+50) then
tmp = 2.0d0 * sqrt(((x * z) + (y * (x + z))))
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 <= 8.5e+50) {
tmp = 2.0 * Math.sqrt(((x * z) + (y * (x + z))));
} 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 <= 8.5e+50: tmp = 2.0 * math.sqrt(((x * z) + (y * (x + z)))) 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 <= 8.5e+50) tmp = Float64(2.0 * sqrt(Float64(Float64(x * z) + Float64(y * Float64(x + z))))); 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 <= 8.5e+50)
tmp = 2.0 * sqrt(((x * z) + (y * (x + z))));
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, 8.5e+50], N[(2.0 * N[Sqrt[N[(N[(x * z), $MachinePrecision] + N[(y * N[(x + z), $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 8.5 \cdot 10^{+50}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot z + y \cdot \left(x + z\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y}\right)\\
\end{array}
\end{array}
if y < 8.49999999999999961e50Initial program 75.3%
associate-+l+75.3%
*-commutative75.3%
*-commutative75.3%
*-commutative75.3%
+-commutative75.3%
+-commutative75.3%
+-commutative75.3%
*-commutative75.3%
*-commutative75.3%
associate-+l+75.3%
+-commutative75.3%
fma-define75.3%
distribute-lft-out75.4%
Simplified75.4%
fma-undefine75.3%
+-commutative75.3%
Applied egg-rr75.3%
if 8.49999999999999961e50 < y Initial program 40.4%
associate-+l+40.4%
*-commutative40.4%
*-commutative40.4%
*-commutative40.4%
+-commutative40.4%
+-commutative40.4%
associate-+l+40.4%
*-commutative40.4%
*-commutative40.4%
+-commutative40.4%
+-commutative40.4%
*-commutative40.4%
associate-+l+40.4%
+-commutative40.4%
distribute-rgt-in40.6%
Simplified40.6%
Taylor expanded in x around 0 21.9%
*-commutative21.9%
Simplified21.9%
*-commutative21.9%
sqrt-prod42.3%
Applied egg-rr42.3%
Final simplification68.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-293) (* 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 <= -4e-293) {
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 <= (-4d-293)) 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 <= -4e-293) {
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 <= -4e-293: 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 <= -4e-293) 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 <= -4e-293)
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, -4e-293], 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 -4 \cdot 10^{-293}:\\
\;\;\;\;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 < -4.0000000000000002e-293Initial program 68.6%
associate-+l+68.6%
*-commutative68.6%
*-commutative68.6%
*-commutative68.6%
+-commutative68.6%
+-commutative68.6%
associate-+l+68.6%
*-commutative68.6%
*-commutative68.6%
+-commutative68.6%
+-commutative68.6%
*-commutative68.6%
associate-+l+68.6%
+-commutative68.6%
distribute-rgt-in68.8%
Simplified68.8%
Taylor expanded in x around inf 49.1%
if -4.0000000000000002e-293 < y Initial program 67.2%
associate-+l+67.2%
*-commutative67.2%
*-commutative67.2%
*-commutative67.2%
+-commutative67.2%
+-commutative67.2%
associate-+l+67.2%
*-commutative67.2%
*-commutative67.2%
+-commutative67.2%
+-commutative67.2%
*-commutative67.2%
associate-+l+67.2%
+-commutative67.2%
distribute-rgt-in67.3%
Simplified67.3%
Taylor expanded in z around inf 46.5%
+-commutative46.5%
Simplified46.5%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 2.15e-285) (* 2.0 (sqrt (* x (+ y z)))) (sqrt (* y (* z 4.0)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 2.15e-285) {
tmp = 2.0 * sqrt((x * (y + z)));
} else {
tmp = sqrt((y * (z * 4.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.15d-285) then
tmp = 2.0d0 * sqrt((x * (y + z)))
else
tmp = sqrt((y * (z * 4.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.15e-285) {
tmp = 2.0 * Math.sqrt((x * (y + z)));
} else {
tmp = Math.sqrt((y * (z * 4.0)));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= 2.15e-285: tmp = 2.0 * math.sqrt((x * (y + z))) else: tmp = math.sqrt((y * (z * 4.0))) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 2.15e-285) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z)))); else tmp = sqrt(Float64(y * Float64(z * 4.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.15e-285)
tmp = 2.0 * sqrt((x * (y + z)));
else
tmp = sqrt((y * (z * 4.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.15e-285], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(y * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 2.15 \cdot 10^{-285}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{y \cdot \left(z \cdot 4\right)}\\
\end{array}
\end{array}
if y < 2.15000000000000006e-285Initial program 69.9%
associate-+l+69.9%
*-commutative69.9%
*-commutative69.9%
*-commutative69.9%
+-commutative69.9%
+-commutative69.9%
associate-+l+69.9%
*-commutative69.9%
*-commutative69.9%
+-commutative69.9%
+-commutative69.9%
*-commutative69.9%
associate-+l+69.9%
+-commutative69.9%
distribute-rgt-in70.0%
Simplified70.0%
Taylor expanded in x around inf 51.2%
if 2.15000000000000006e-285 < y Initial program 65.7%
associate-+l+65.7%
*-commutative65.7%
*-commutative65.7%
*-commutative65.7%
+-commutative65.7%
+-commutative65.7%
associate-+l+65.7%
*-commutative65.7%
*-commutative65.7%
+-commutative65.7%
+-commutative65.7%
*-commutative65.7%
associate-+l+65.7%
+-commutative65.7%
distribute-rgt-in65.8%
Simplified65.8%
Taylor expanded in x around 0 19.6%
*-commutative19.6%
Simplified19.6%
pow119.6%
add-sqr-sqrt19.5%
sqrt-unprod19.6%
swap-sqr19.6%
add-sqr-sqrt19.6%
metadata-eval19.6%
Applied egg-rr19.6%
unpow119.6%
associate-*l*19.6%
Simplified19.6%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -2e-310) (* 2.0 (pow (* y x) 0.5)) (sqrt (* y (* z 4.0)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -2e-310) {
tmp = 2.0 * pow((y * x), 0.5);
} else {
tmp = sqrt((y * (z * 4.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 <= (-2d-310)) then
tmp = 2.0d0 * ((y * x) ** 0.5d0)
else
tmp = sqrt((y * (z * 4.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 <= -2e-310) {
tmp = 2.0 * Math.pow((y * x), 0.5);
} else {
tmp = Math.sqrt((y * (z * 4.0)));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= -2e-310: tmp = 2.0 * math.pow((y * x), 0.5) else: tmp = math.sqrt((y * (z * 4.0))) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -2e-310) tmp = Float64(2.0 * (Float64(y * x) ^ 0.5)); else tmp = sqrt(Float64(y * Float64(z * 4.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 <= -2e-310)
tmp = 2.0 * ((y * x) ^ 0.5);
else
tmp = sqrt((y * (z * 4.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, -2e-310], N[(2.0 * N[Power[N[(y * x), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(y * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -2 \cdot 10^{-310}:\\
\;\;\;\;2 \cdot {\left(y \cdot x\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{y \cdot \left(z \cdot 4\right)}\\
\end{array}
\end{array}
if y < -1.999999999999994e-310Initial program 69.4%
associate-+l+69.4%
*-commutative69.4%
*-commutative69.4%
*-commutative69.4%
+-commutative69.4%
+-commutative69.4%
associate-+l+69.4%
*-commutative69.4%
*-commutative69.4%
+-commutative69.4%
+-commutative69.4%
*-commutative69.4%
associate-+l+69.4%
+-commutative69.4%
distribute-rgt-in69.5%
Simplified69.5%
Taylor expanded in z around 0 28.8%
*-commutative28.8%
Simplified28.8%
pow1/228.9%
Applied egg-rr28.9%
if -1.999999999999994e-310 < y Initial program 66.4%
associate-+l+66.4%
*-commutative66.4%
*-commutative66.4%
*-commutative66.4%
+-commutative66.4%
+-commutative66.4%
associate-+l+66.4%
*-commutative66.4%
*-commutative66.4%
+-commutative66.4%
+-commutative66.4%
*-commutative66.4%
associate-+l+66.4%
+-commutative66.4%
distribute-rgt-in66.5%
Simplified66.5%
Taylor expanded in x around 0 19.3%
*-commutative19.3%
Simplified19.3%
pow119.3%
add-sqr-sqrt19.1%
sqrt-unprod19.3%
swap-sqr19.3%
add-sqr-sqrt19.3%
metadata-eval19.3%
Applied egg-rr19.3%
unpow119.3%
associate-*l*19.3%
Simplified19.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 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 67.9%
associate-+l+67.9%
*-commutative67.9%
*-commutative67.9%
*-commutative67.9%
+-commutative67.9%
+-commutative67.9%
associate-+l+67.9%
*-commutative67.9%
*-commutative67.9%
+-commutative67.9%
+-commutative67.9%
*-commutative67.9%
associate-+l+67.9%
+-commutative67.9%
distribute-rgt-in68.0%
Simplified68.0%
Final simplification68.0%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -2e-310) (* 2.0 (sqrt (* y x))) (sqrt (* y (* z 4.0)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -2e-310) {
tmp = 2.0 * sqrt((y * x));
} else {
tmp = sqrt((y * (z * 4.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 <= (-2d-310)) then
tmp = 2.0d0 * sqrt((y * x))
else
tmp = sqrt((y * (z * 4.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 <= -2e-310) {
tmp = 2.0 * Math.sqrt((y * x));
} else {
tmp = Math.sqrt((y * (z * 4.0)));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= -2e-310: tmp = 2.0 * math.sqrt((y * x)) else: tmp = math.sqrt((y * (z * 4.0))) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -2e-310) tmp = Float64(2.0 * sqrt(Float64(y * x))); else tmp = sqrt(Float64(y * Float64(z * 4.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 <= -2e-310)
tmp = 2.0 * sqrt((y * x));
else
tmp = sqrt((y * (z * 4.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, -2e-310], N[(2.0 * N[Sqrt[N[(y * x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(y * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -2 \cdot 10^{-310}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot x}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{y \cdot \left(z \cdot 4\right)}\\
\end{array}
\end{array}
if y < -1.999999999999994e-310Initial program 69.4%
associate-+l+69.4%
*-commutative69.4%
*-commutative69.4%
*-commutative69.4%
+-commutative69.4%
+-commutative69.4%
associate-+l+69.4%
*-commutative69.4%
*-commutative69.4%
+-commutative69.4%
+-commutative69.4%
*-commutative69.4%
associate-+l+69.4%
+-commutative69.4%
distribute-rgt-in69.5%
Simplified69.5%
Taylor expanded in z around 0 28.8%
*-commutative28.8%
Simplified28.8%
if -1.999999999999994e-310 < y Initial program 66.4%
associate-+l+66.4%
*-commutative66.4%
*-commutative66.4%
*-commutative66.4%
+-commutative66.4%
+-commutative66.4%
associate-+l+66.4%
*-commutative66.4%
*-commutative66.4%
+-commutative66.4%
+-commutative66.4%
*-commutative66.4%
associate-+l+66.4%
+-commutative66.4%
distribute-rgt-in66.5%
Simplified66.5%
Taylor expanded in x around 0 19.3%
*-commutative19.3%
Simplified19.3%
pow119.3%
add-sqr-sqrt19.1%
sqrt-unprod19.3%
swap-sqr19.3%
add-sqr-sqrt19.3%
metadata-eval19.3%
Applied egg-rr19.3%
unpow119.3%
associate-*l*19.3%
Simplified19.3%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (sqrt (* y (* z 4.0))))
assert(x < y && y < z);
double code(double x, double y, double z) {
return sqrt((y * (z * 4.0)));
}
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 = sqrt((y * (z * 4.0d0)))
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
return Math.sqrt((y * (z * 4.0)));
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): return math.sqrt((y * (z * 4.0)))
x, y, z = sort([x, y, z]) function code(x, y, z) return sqrt(Float64(y * Float64(z * 4.0))) end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp = code(x, y, z)
tmp = sqrt((y * (z * 4.0)));
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := N[Sqrt[N[(y * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\sqrt{y \cdot \left(z \cdot 4\right)}
\end{array}
Initial program 67.9%
associate-+l+67.9%
*-commutative67.9%
*-commutative67.9%
*-commutative67.9%
+-commutative67.9%
+-commutative67.9%
associate-+l+67.9%
*-commutative67.9%
*-commutative67.9%
+-commutative67.9%
+-commutative67.9%
*-commutative67.9%
associate-+l+67.9%
+-commutative67.9%
distribute-rgt-in68.0%
Simplified68.0%
Taylor expanded in x around 0 19.8%
*-commutative19.8%
Simplified19.8%
pow119.8%
add-sqr-sqrt19.7%
sqrt-unprod19.8%
swap-sqr19.8%
add-sqr-sqrt19.8%
metadata-eval19.8%
Applied egg-rr19.8%
unpow119.8%
associate-*l*19.8%
Simplified19.8%
(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 2024110
(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)))))