
(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 2.15e-305) (* 2.0 (pow (exp (* 0.25 (- (log (- (- 0.0 y) z)) (log (/ -1.0 x))))) 2.0)) (* 2.0 (/ 1.0 (* (pow (+ y x) -0.5) (pow z -0.5))))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 2.15e-305) {
tmp = 2.0 * pow(exp((0.25 * (log(((0.0 - y) - z)) - log((-1.0 / x))))), 2.0);
} else {
tmp = 2.0 * (1.0 / (pow((y + x), -0.5) * pow(z, -0.5)));
}
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-305) then
tmp = 2.0d0 * (exp((0.25d0 * (log(((0.0d0 - y) - z)) - log(((-1.0d0) / x))))) ** 2.0d0)
else
tmp = 2.0d0 * (1.0d0 / (((y + x) ** (-0.5d0)) * (z ** (-0.5d0))))
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-305) {
tmp = 2.0 * Math.pow(Math.exp((0.25 * (Math.log(((0.0 - y) - z)) - Math.log((-1.0 / x))))), 2.0);
} else {
tmp = 2.0 * (1.0 / (Math.pow((y + x), -0.5) * Math.pow(z, -0.5)));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= 2.15e-305: tmp = 2.0 * math.pow(math.exp((0.25 * (math.log(((0.0 - y) - z)) - math.log((-1.0 / x))))), 2.0) else: tmp = 2.0 * (1.0 / (math.pow((y + x), -0.5) * math.pow(z, -0.5))) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 2.15e-305) tmp = Float64(2.0 * (exp(Float64(0.25 * Float64(log(Float64(Float64(0.0 - y) - z)) - log(Float64(-1.0 / x))))) ^ 2.0)); else tmp = Float64(2.0 * Float64(1.0 / Float64((Float64(y + x) ^ -0.5) * (z ^ -0.5)))); 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-305)
tmp = 2.0 * (exp((0.25 * (log(((0.0 - y) - z)) - log((-1.0 / x))))) ^ 2.0);
else
tmp = 2.0 * (1.0 / (((y + x) ^ -0.5) * (z ^ -0.5)));
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-305], N[(2.0 * N[Power[N[Exp[N[(0.25 * N[(N[Log[N[(N[(0.0 - y), $MachinePrecision] - z), $MachinePrecision]], $MachinePrecision] - N[Log[N[(-1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(1.0 / N[(N[Power[N[(y + x), $MachinePrecision], -0.5], $MachinePrecision] * N[Power[z, -0.5], $MachinePrecision]), $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^{-305}:\\
\;\;\;\;2 \cdot {\left(e^{0.25 \cdot \left(\log \left(\left(0 - y\right) - z\right) - \log \left(\frac{-1}{x}\right)\right)}\right)}^{2}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \frac{1}{{\left(y + x\right)}^{-0.5} \cdot {z}^{-0.5}}\\
\end{array}
\end{array}
if y < 2.1500000000000001e-305Initial program 67.8%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6467.8%
Simplified67.8%
pow1/2N/A
distribute-rgt-inN/A
associate-+l+N/A
sqr-powN/A
pow2N/A
pow-lowering-pow.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
distribute-rgt-inN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
metadata-eval67.4%
Applied egg-rr67.4%
Taylor expanded in x around -inf
exp-lowering-exp.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
log-lowering-log.f64N/A
fma-defineN/A
mul-1-negN/A
fmm-undefN/A
--lowering--.f64N/A
mul-1-negN/A
neg-lowering-neg.f64N/A
mul-1-negN/A
neg-lowering-neg.f64N/A
log-lowering-log.f64N/A
/-lowering-/.f6440.8%
Simplified40.8%
if 2.1500000000000001e-305 < y Initial program 67.6%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6467.7%
Simplified67.7%
Taylor expanded in z around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6441.5%
Simplified41.5%
+-commutativeN/A
flip-+N/A
associate-*r/N/A
*-commutativeN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
clear-numN/A
associate-*l/N/A
flip-+N/A
*-commutativeN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f6440.1%
Applied egg-rr40.1%
inv-powN/A
sqrt-pow1N/A
metadata-evalN/A
metadata-evalN/A
*-commutativeN/A
unpow-prod-downN/A
metadata-evalN/A
metadata-evalN/A
sqrt-pow1N/A
inv-powN/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
inv-powN/A
sqrt-pow1N/A
metadata-evalN/A
metadata-evalN/A
pow-lowering-pow.f64N/A
metadata-eval45.6%
Applied egg-rr45.6%
Final simplification43.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.1e-293) (* 2.0 (pow (exp (* (- (log (- (- 0.0 y) z)) (log (/ -1.0 x))) 0.125)) 4.0)) (* 2.0 (/ 1.0 (* (pow (+ y x) -0.5) (pow z -0.5))))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 2.1e-293) {
tmp = 2.0 * pow(exp(((log(((0.0 - y) - z)) - log((-1.0 / x))) * 0.125)), 4.0);
} else {
tmp = 2.0 * (1.0 / (pow((y + x), -0.5) * pow(z, -0.5)));
}
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.1d-293) then
tmp = 2.0d0 * (exp(((log(((0.0d0 - y) - z)) - log(((-1.0d0) / x))) * 0.125d0)) ** 4.0d0)
else
tmp = 2.0d0 * (1.0d0 / (((y + x) ** (-0.5d0)) * (z ** (-0.5d0))))
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.1e-293) {
tmp = 2.0 * Math.pow(Math.exp(((Math.log(((0.0 - y) - z)) - Math.log((-1.0 / x))) * 0.125)), 4.0);
} else {
tmp = 2.0 * (1.0 / (Math.pow((y + x), -0.5) * Math.pow(z, -0.5)));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= 2.1e-293: tmp = 2.0 * math.pow(math.exp(((math.log(((0.0 - y) - z)) - math.log((-1.0 / x))) * 0.125)), 4.0) else: tmp = 2.0 * (1.0 / (math.pow((y + x), -0.5) * math.pow(z, -0.5))) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 2.1e-293) tmp = Float64(2.0 * (exp(Float64(Float64(log(Float64(Float64(0.0 - y) - z)) - log(Float64(-1.0 / x))) * 0.125)) ^ 4.0)); else tmp = Float64(2.0 * Float64(1.0 / Float64((Float64(y + x) ^ -0.5) * (z ^ -0.5)))); 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.1e-293)
tmp = 2.0 * (exp(((log(((0.0 - y) - z)) - log((-1.0 / x))) * 0.125)) ^ 4.0);
else
tmp = 2.0 * (1.0 / (((y + x) ^ -0.5) * (z ^ -0.5)));
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.1e-293], N[(2.0 * N[Power[N[Exp[N[(N[(N[Log[N[(N[(0.0 - y), $MachinePrecision] - z), $MachinePrecision]], $MachinePrecision] - N[Log[N[(-1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * 0.125), $MachinePrecision]], $MachinePrecision], 4.0], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(1.0 / N[(N[Power[N[(y + x), $MachinePrecision], -0.5], $MachinePrecision] * N[Power[z, -0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 2.1 \cdot 10^{-293}:\\
\;\;\;\;2 \cdot {\left(e^{\left(\log \left(\left(0 - y\right) - z\right) - \log \left(\frac{-1}{x}\right)\right) \cdot 0.125}\right)}^{4}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \frac{1}{{\left(y + x\right)}^{-0.5} \cdot {z}^{-0.5}}\\
\end{array}
\end{array}
if y < 2.10000000000000005e-293Initial program 67.8%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6467.8%
Simplified67.8%
pow1/2N/A
distribute-rgt-inN/A
associate-+l+N/A
sqr-powN/A
pow2N/A
pow-lowering-pow.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
distribute-rgt-inN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
metadata-eval67.4%
Applied egg-rr67.4%
sqr-powN/A
unpow-prod-downN/A
pow-prod-upN/A
pow-lowering-pow.f64N/A
pow-lowering-pow.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
metadata-eval67.1%
Applied egg-rr67.1%
Taylor expanded in x around -inf
exp-lowering-exp.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
log-lowering-log.f64N/A
fma-defineN/A
mul-1-negN/A
fmm-undefN/A
--lowering--.f64N/A
mul-1-negN/A
neg-lowering-neg.f64N/A
mul-1-negN/A
neg-lowering-neg.f64N/A
log-lowering-log.f64N/A
/-lowering-/.f6441.9%
Simplified41.9%
if 2.10000000000000005e-293 < y Initial program 67.6%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6467.7%
Simplified67.7%
Taylor expanded in z around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6440.9%
Simplified40.9%
+-commutativeN/A
flip-+N/A
associate-*r/N/A
*-commutativeN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
clear-numN/A
associate-*l/N/A
flip-+N/A
*-commutativeN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f6440.2%
Applied egg-rr40.2%
inv-powN/A
sqrt-pow1N/A
metadata-evalN/A
metadata-evalN/A
*-commutativeN/A
unpow-prod-downN/A
metadata-evalN/A
metadata-evalN/A
sqrt-pow1N/A
inv-powN/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
inv-powN/A
sqrt-pow1N/A
metadata-evalN/A
metadata-evalN/A
pow-lowering-pow.f64N/A
metadata-eval46.6%
Applied egg-rr46.6%
Final simplification44.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.15e+25) (* 2.0 (sqrt (+ (+ (* y x) (* z x)) (* y z)))) (* y (+ (* 2.0 (sqrt (/ z y))) (* x (sqrt (/ z (* y (* y y)))))))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 2.15e+25) {
tmp = 2.0 * sqrt((((y * x) + (z * x)) + (y * z)));
} else {
tmp = y * ((2.0 * sqrt((z / y))) + (x * sqrt((z / (y * (y * 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 <= 2.15d+25) then
tmp = 2.0d0 * sqrt((((y * x) + (z * x)) + (y * z)))
else
tmp = y * ((2.0d0 * sqrt((z / y))) + (x * sqrt((z / (y * (y * 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 <= 2.15e+25) {
tmp = 2.0 * Math.sqrt((((y * x) + (z * x)) + (y * z)));
} else {
tmp = y * ((2.0 * Math.sqrt((z / y))) + (x * Math.sqrt((z / (y * (y * y))))));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= 2.15e+25: tmp = 2.0 * math.sqrt((((y * x) + (z * x)) + (y * z))) else: tmp = y * ((2.0 * math.sqrt((z / y))) + (x * math.sqrt((z / (y * (y * y)))))) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 2.15e+25) tmp = Float64(2.0 * sqrt(Float64(Float64(Float64(y * x) + Float64(z * x)) + Float64(y * z)))); else tmp = Float64(y * Float64(Float64(2.0 * sqrt(Float64(z / y))) + Float64(x * sqrt(Float64(z / Float64(y * Float64(y * 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 <= 2.15e+25)
tmp = 2.0 * sqrt((((y * x) + (z * x)) + (y * z)));
else
tmp = y * ((2.0 * sqrt((z / y))) + (x * sqrt((z / (y * (y * 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, 2.15e+25], N[(2.0 * N[Sqrt[N[(N[(N[(y * x), $MachinePrecision] + N[(z * x), $MachinePrecision]), $MachinePrecision] + N[(y * z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(y * N[(N[(2.0 * N[Sqrt[N[(z / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(x * N[Sqrt[N[(z / N[(y * N[(y * y), $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 2.15 \cdot 10^{+25}:\\
\;\;\;\;2 \cdot \sqrt{\left(y \cdot x + z \cdot x\right) + y \cdot z}\\
\mathbf{else}:\\
\;\;\;\;y \cdot \left(2 \cdot \sqrt{\frac{z}{y}} + x \cdot \sqrt{\frac{z}{y \cdot \left(y \cdot y\right)}}\right)\\
\end{array}
\end{array}
if y < 2.14999999999999999e25Initial program 73.6%
if 2.14999999999999999e25 < y Initial program 46.3%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6446.5%
Simplified46.5%
Taylor expanded in z around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6424.3%
Simplified24.3%
Taylor expanded in y around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6447.4%
Simplified47.4%
Final simplification67.9%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 6.8e+56) (* 2.0 (sqrt (+ (+ (* y x) (* z x)) (* y z)))) (* 2.0 (/ 1.0 (* (pow (+ y x) -0.5) (pow z -0.5))))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 6.8e+56) {
tmp = 2.0 * sqrt((((y * x) + (z * x)) + (y * z)));
} else {
tmp = 2.0 * (1.0 / (pow((y + x), -0.5) * pow(z, -0.5)));
}
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 <= 6.8d+56) then
tmp = 2.0d0 * sqrt((((y * x) + (z * x)) + (y * z)))
else
tmp = 2.0d0 * (1.0d0 / (((y + x) ** (-0.5d0)) * (z ** (-0.5d0))))
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 <= 6.8e+56) {
tmp = 2.0 * Math.sqrt((((y * x) + (z * x)) + (y * z)));
} else {
tmp = 2.0 * (1.0 / (Math.pow((y + x), -0.5) * Math.pow(z, -0.5)));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= 6.8e+56: tmp = 2.0 * math.sqrt((((y * x) + (z * x)) + (y * z))) else: tmp = 2.0 * (1.0 / (math.pow((y + x), -0.5) * math.pow(z, -0.5))) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 6.8e+56) tmp = Float64(2.0 * sqrt(Float64(Float64(Float64(y * x) + Float64(z * x)) + Float64(y * z)))); else tmp = Float64(2.0 * Float64(1.0 / Float64((Float64(y + x) ^ -0.5) * (z ^ -0.5)))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if (y <= 6.8e+56)
tmp = 2.0 * sqrt((((y * x) + (z * x)) + (y * z)));
else
tmp = 2.0 * (1.0 / (((y + x) ^ -0.5) * (z ^ -0.5)));
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, 6.8e+56], 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[(1.0 / N[(N[Power[N[(y + x), $MachinePrecision], -0.5], $MachinePrecision] * N[Power[z, -0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 6.8 \cdot 10^{+56}:\\
\;\;\;\;2 \cdot \sqrt{\left(y \cdot x + z \cdot x\right) + y \cdot z}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \frac{1}{{\left(y + x\right)}^{-0.5} \cdot {z}^{-0.5}}\\
\end{array}
\end{array}
if y < 6.80000000000000002e56Initial program 73.8%
if 6.80000000000000002e56 < y Initial program 42.8%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6443.0%
Simplified43.0%
Taylor expanded in z around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6420.3%
Simplified20.3%
+-commutativeN/A
flip-+N/A
associate-*r/N/A
*-commutativeN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
clear-numN/A
associate-*l/N/A
flip-+N/A
*-commutativeN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f6420.3%
Applied egg-rr20.3%
inv-powN/A
sqrt-pow1N/A
metadata-evalN/A
metadata-evalN/A
*-commutativeN/A
unpow-prod-downN/A
metadata-evalN/A
metadata-evalN/A
sqrt-pow1N/A
inv-powN/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
inv-powN/A
sqrt-pow1N/A
metadata-evalN/A
metadata-evalN/A
pow-lowering-pow.f64N/A
metadata-eval52.2%
Applied egg-rr52.2%
Final simplification69.5%
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-27) (* 2.0 (sqrt (+ (+ (* y x) (* z x)) (* y z)))) (* (* 2.0 (sqrt z)) (pow (+ y x) 0.5))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 4.6e-27) {
tmp = 2.0 * sqrt((((y * x) + (z * x)) + (y * z)));
} else {
tmp = (2.0 * sqrt(z)) * pow((y + x), 0.5);
}
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-27) then
tmp = 2.0d0 * sqrt((((y * x) + (z * x)) + (y * z)))
else
tmp = (2.0d0 * sqrt(z)) * ((y + x) ** 0.5d0)
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-27) {
tmp = 2.0 * Math.sqrt((((y * x) + (z * x)) + (y * z)));
} else {
tmp = (2.0 * Math.sqrt(z)) * Math.pow((y + x), 0.5);
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= 4.6e-27: tmp = 2.0 * math.sqrt((((y * x) + (z * x)) + (y * z))) else: tmp = (2.0 * math.sqrt(z)) * math.pow((y + x), 0.5) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 4.6e-27) tmp = Float64(2.0 * sqrt(Float64(Float64(Float64(y * x) + Float64(z * x)) + Float64(y * z)))); else tmp = Float64(Float64(2.0 * sqrt(z)) * (Float64(y + x) ^ 0.5)); 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-27)
tmp = 2.0 * sqrt((((y * x) + (z * x)) + (y * z)));
else
tmp = (2.0 * sqrt(z)) * ((y + x) ^ 0.5);
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-27], N[(2.0 * N[Sqrt[N[(N[(N[(y * x), $MachinePrecision] + N[(z * x), $MachinePrecision]), $MachinePrecision] + N[(y * z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * N[Sqrt[z], $MachinePrecision]), $MachinePrecision] * N[Power[N[(y + x), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 4.6 \cdot 10^{-27}:\\
\;\;\;\;2 \cdot \sqrt{\left(y \cdot x + z \cdot x\right) + y \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\left(2 \cdot \sqrt{z}\right) \cdot {\left(y + x\right)}^{0.5}\\
\end{array}
\end{array}
if y < 4.5999999999999999e-27Initial program 73.7%
if 4.5999999999999999e-27 < y Initial program 51.0%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6451.2%
Simplified51.2%
Taylor expanded in z around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6423.5%
Simplified23.5%
pow1/2N/A
+-commutativeN/A
metadata-evalN/A
unpow-prod-downN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
pow-lowering-pow.f64N/A
+-lowering-+.f64N/A
metadata-eval49.4%
Applied egg-rr49.4%
Final simplification67.3%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 6.8e+56) (* 2.0 (sqrt (+ (+ (* y x) (* z x)) (* y z)))) (* (* 2.0 (sqrt z)) (sqrt y))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 6.8e+56) {
tmp = 2.0 * sqrt((((y * x) + (z * x)) + (y * 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 <= 6.8d+56) then
tmp = 2.0d0 * sqrt((((y * x) + (z * x)) + (y * 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 <= 6.8e+56) {
tmp = 2.0 * Math.sqrt((((y * x) + (z * x)) + (y * 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 <= 6.8e+56: tmp = 2.0 * math.sqrt((((y * x) + (z * x)) + (y * 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 <= 6.8e+56) tmp = Float64(2.0 * sqrt(Float64(Float64(Float64(y * x) + Float64(z * x)) + Float64(y * z)))); else tmp = Float64(Float64(2.0 * 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 <= 6.8e+56)
tmp = 2.0 * sqrt((((y * x) + (z * x)) + (y * 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, 6.8e+56], N[(2.0 * N[Sqrt[N[(N[(N[(y * x), $MachinePrecision] + N[(z * x), $MachinePrecision]), $MachinePrecision] + N[(y * z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * N[Sqrt[z], $MachinePrecision]), $MachinePrecision] * N[Sqrt[y], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 6.8 \cdot 10^{+56}:\\
\;\;\;\;2 \cdot \sqrt{\left(y \cdot x + z \cdot x\right) + y \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\left(2 \cdot \sqrt{z}\right) \cdot \sqrt{y}\\
\end{array}
\end{array}
if y < 6.80000000000000002e56Initial program 73.8%
if 6.80000000000000002e56 < y Initial program 42.8%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6443.0%
Simplified43.0%
Taylor expanded in z around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6420.3%
Simplified20.3%
Taylor expanded in y around inf
Simplified20.3%
pow1/2N/A
unpow-prod-downN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f6448.6%
Applied egg-rr48.6%
Final simplification68.8%
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+56) (* 2.0 (sqrt (+ (+ (* y x) (* z x)) (* y z)))) (* 2.0 (/ 1.0 (sqrt (/ (/ 1.0 (+ y x)) z))))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 8.8e+56) {
tmp = 2.0 * sqrt((((y * x) + (z * x)) + (y * z)));
} else {
tmp = 2.0 * (1.0 / sqrt(((1.0 / (y + x)) / z)));
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if (y <= 8.8d+56) then
tmp = 2.0d0 * sqrt((((y * x) + (z * x)) + (y * z)))
else
tmp = 2.0d0 * (1.0d0 / sqrt(((1.0d0 / (y + x)) / z)))
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double tmp;
if (y <= 8.8e+56) {
tmp = 2.0 * Math.sqrt((((y * x) + (z * x)) + (y * z)));
} else {
tmp = 2.0 * (1.0 / Math.sqrt(((1.0 / (y + x)) / z)));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= 8.8e+56: tmp = 2.0 * math.sqrt((((y * x) + (z * x)) + (y * z))) else: tmp = 2.0 * (1.0 / math.sqrt(((1.0 / (y + x)) / z))) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 8.8e+56) tmp = Float64(2.0 * sqrt(Float64(Float64(Float64(y * x) + Float64(z * x)) + Float64(y * z)))); else tmp = Float64(2.0 * Float64(1.0 / sqrt(Float64(Float64(1.0 / Float64(y + x)) / z)))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if (y <= 8.8e+56)
tmp = 2.0 * sqrt((((y * x) + (z * x)) + (y * z)));
else
tmp = 2.0 * (1.0 / sqrt(((1.0 / (y + x)) / z)));
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[y, 8.8e+56], 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[(1.0 / N[Sqrt[N[(N[(1.0 / N[(y + x), $MachinePrecision]), $MachinePrecision] / z), $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^{+56}:\\
\;\;\;\;2 \cdot \sqrt{\left(y \cdot x + z \cdot x\right) + y \cdot z}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \frac{1}{\sqrt{\frac{\frac{1}{y + x}}{z}}}\\
\end{array}
\end{array}
if y < 8.80000000000000063e56Initial program 73.8%
if 8.80000000000000063e56 < y Initial program 42.8%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6443.0%
Simplified43.0%
Taylor expanded in z around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6420.3%
Simplified20.3%
+-commutativeN/A
flip-+N/A
associate-*r/N/A
*-commutativeN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
clear-numN/A
associate-*l/N/A
flip-+N/A
*-commutativeN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f6420.3%
Applied egg-rr20.3%
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f6426.9%
Applied egg-rr26.9%
Final simplification64.6%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= z 1.02e+91) (* 2.0 (sqrt (+ (* y x) (* z (+ y x))))) (* 2.0 (/ 1.0 (sqrt (/ (/ 1.0 (+ y x)) z))))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (z <= 1.02e+91) {
tmp = 2.0 * sqrt(((y * x) + (z * (y + x))));
} else {
tmp = 2.0 * (1.0 / sqrt(((1.0 / (y + x)) / 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 (z <= 1.02d+91) then
tmp = 2.0d0 * sqrt(((y * x) + (z * (y + x))))
else
tmp = 2.0d0 * (1.0d0 / sqrt(((1.0d0 / (y + x)) / 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 (z <= 1.02e+91) {
tmp = 2.0 * Math.sqrt(((y * x) + (z * (y + x))));
} else {
tmp = 2.0 * (1.0 / Math.sqrt(((1.0 / (y + x)) / z)));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if z <= 1.02e+91: tmp = 2.0 * math.sqrt(((y * x) + (z * (y + x)))) else: tmp = 2.0 * (1.0 / math.sqrt(((1.0 / (y + x)) / z))) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (z <= 1.02e+91) tmp = Float64(2.0 * sqrt(Float64(Float64(y * x) + Float64(z * Float64(y + x))))); else tmp = Float64(2.0 * Float64(1.0 / sqrt(Float64(Float64(1.0 / Float64(y + x)) / z)))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if (z <= 1.02e+91)
tmp = 2.0 * sqrt(((y * x) + (z * (y + x))));
else
tmp = 2.0 * (1.0 / sqrt(((1.0 / (y + x)) / 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[z, 1.02e+91], N[(2.0 * N[Sqrt[N[(N[(y * x), $MachinePrecision] + N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(1.0 / N[Sqrt[N[(N[(1.0 / N[(y + x), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq 1.02 \cdot 10^{+91}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot x + z \cdot \left(y + x\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \frac{1}{\sqrt{\frac{\frac{1}{y + x}}{z}}}\\
\end{array}
\end{array}
if z < 1.01999999999999992e91Initial program 74.2%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6474.2%
Simplified74.2%
if 1.01999999999999992e91 < z Initial program 38.0%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6438.2%
Simplified38.2%
Taylor expanded in z around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6438.4%
Simplified38.4%
+-commutativeN/A
flip-+N/A
associate-*r/N/A
*-commutativeN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
clear-numN/A
associate-*l/N/A
flip-+N/A
*-commutativeN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f6438.2%
Applied egg-rr38.2%
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f6445.8%
Applied egg-rr45.8%
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 -4e-292) (* 2.0 (sqrt (* x (+ y z)))) (* 2.0 (sqrt (* z (+ y x))))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -4e-292) {
tmp = 2.0 * sqrt((x * (y + z)));
} else {
tmp = 2.0 * sqrt((z * (y + x)));
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if (y <= (-4d-292)) then
tmp = 2.0d0 * sqrt((x * (y + z)))
else
tmp = 2.0d0 * sqrt((z * (y + x)))
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double tmp;
if (y <= -4e-292) {
tmp = 2.0 * Math.sqrt((x * (y + z)));
} else {
tmp = 2.0 * Math.sqrt((z * (y + x)));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= -4e-292: tmp = 2.0 * math.sqrt((x * (y + z))) else: tmp = 2.0 * math.sqrt((z * (y + x))) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -4e-292) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z)))); else tmp = Float64(2.0 * sqrt(Float64(z * Float64(y + x)))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if (y <= -4e-292)
tmp = 2.0 * sqrt((x * (y + z)));
else
tmp = 2.0 * sqrt((z * (y + x)));
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[y, -4e-292], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[Sqrt[N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -4 \cdot 10^{-292}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{z \cdot \left(y + x\right)}\\
\end{array}
\end{array}
if y < -4.0000000000000002e-292Initial program 67.1%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6467.1%
Simplified67.1%
Taylor expanded in x around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f6438.9%
Simplified38.9%
if -4.0000000000000002e-292 < y Initial program 68.3%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6468.4%
Simplified68.4%
Taylor expanded in z around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6442.8%
Simplified42.8%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -3.05e-298) (* 2.0 (sqrt (* x (+ y z)))) (* 2.0 (sqrt (* y z)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -3.05e-298) {
tmp = 2.0 * sqrt((x * (y + z)));
} else {
tmp = 2.0 * sqrt((y * z));
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if (y <= (-3.05d-298)) then
tmp = 2.0d0 * sqrt((x * (y + z)))
else
tmp = 2.0d0 * sqrt((y * z))
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double tmp;
if (y <= -3.05e-298) {
tmp = 2.0 * Math.sqrt((x * (y + z)));
} else {
tmp = 2.0 * Math.sqrt((y * z));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= -3.05e-298: tmp = 2.0 * math.sqrt((x * (y + z))) else: tmp = 2.0 * math.sqrt((y * z)) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -3.05e-298) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z)))); else tmp = Float64(2.0 * sqrt(Float64(y * z))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if (y <= -3.05e-298)
tmp = 2.0 * sqrt((x * (y + z)));
else
tmp = 2.0 * sqrt((y * z));
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[y, -3.05e-298], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[Sqrt[N[(y * z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -3.05 \cdot 10^{-298}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot z}\\
\end{array}
\end{array}
if y < -3.05000000000000006e-298Initial program 67.3%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6467.3%
Simplified67.3%
Taylor expanded in x around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f6439.3%
Simplified39.3%
if -3.05000000000000006e-298 < y Initial program 68.1%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6468.1%
Simplified68.1%
Taylor expanded in x around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6419.0%
Simplified19.0%
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.7%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6467.7%
Simplified67.7%
Final simplification67.7%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -3.05e-298) (* 2.0 (sqrt (* y x))) (* 2.0 (sqrt (* y z)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -3.05e-298) {
tmp = 2.0 * sqrt((y * x));
} else {
tmp = 2.0 * sqrt((y * z));
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if (y <= (-3.05d-298)) then
tmp = 2.0d0 * sqrt((y * x))
else
tmp = 2.0d0 * sqrt((y * z))
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double tmp;
if (y <= -3.05e-298) {
tmp = 2.0 * Math.sqrt((y * x));
} else {
tmp = 2.0 * Math.sqrt((y * z));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= -3.05e-298: tmp = 2.0 * math.sqrt((y * x)) else: tmp = 2.0 * math.sqrt((y * z)) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -3.05e-298) tmp = Float64(2.0 * sqrt(Float64(y * x))); else tmp = Float64(2.0 * sqrt(Float64(y * z))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if (y <= -3.05e-298)
tmp = 2.0 * sqrt((y * x));
else
tmp = 2.0 * sqrt((y * z));
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[y, -3.05e-298], N[(2.0 * N[Sqrt[N[(y * x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[Sqrt[N[(y * z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -3.05 \cdot 10^{-298}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot x}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot z}\\
\end{array}
\end{array}
if y < -3.05000000000000006e-298Initial program 67.3%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6467.3%
Simplified67.3%
Taylor expanded in z around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f6419.9%
Simplified19.9%
if -3.05000000000000006e-298 < y Initial program 68.1%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6468.1%
Simplified68.1%
Taylor expanded in x around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6419.0%
Simplified19.0%
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 67.7%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6467.7%
Simplified67.7%
Taylor expanded in z around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f6424.0%
Simplified24.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 2024141
(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)))))