
(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 -1.1e-303) (* 2.0 (pow (exp (* 0.25 (- (log (- (- 0.0 z) y)) (log (/ -1.0 x))))) 2.0)) (* (* 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 <= -1.1e-303) {
tmp = 2.0 * pow(exp((0.25 * (log(((0.0 - z) - y)) - log((-1.0 / x))))), 2.0);
} 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 <= (-1.1d-303)) then
tmp = 2.0d0 * (exp((0.25d0 * (log(((0.0d0 - z) - y)) - log(((-1.0d0) / x))))) ** 2.0d0)
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 <= -1.1e-303) {
tmp = 2.0 * Math.pow(Math.exp((0.25 * (Math.log(((0.0 - z) - y)) - Math.log((-1.0 / x))))), 2.0);
} 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 <= -1.1e-303: tmp = 2.0 * math.pow(math.exp((0.25 * (math.log(((0.0 - z) - y)) - math.log((-1.0 / x))))), 2.0) 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 <= -1.1e-303) tmp = Float64(2.0 * (exp(Float64(0.25 * Float64(log(Float64(Float64(0.0 - z) - y)) - log(Float64(-1.0 / x))))) ^ 2.0)); 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 <= -1.1e-303)
tmp = 2.0 * (exp((0.25 * (log(((0.0 - z) - y)) - log((-1.0 / x))))) ^ 2.0);
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, -1.1e-303], N[(2.0 * N[Power[N[Exp[N[(0.25 * N[(N[Log[N[(N[(0.0 - z), $MachinePrecision] - y), $MachinePrecision]], $MachinePrecision] - N[Log[N[(-1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 2.0], $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 -1.1 \cdot 10^{-303}:\\
\;\;\;\;2 \cdot {\left(e^{0.25 \cdot \left(\log \left(\left(0 - z\right) - y\right) - \log \left(\frac{-1}{x}\right)\right)}\right)}^{2}\\
\mathbf{else}:\\
\;\;\;\;\left(2 \cdot \sqrt{z}\right) \cdot {\left(y + x\right)}^{0.5}\\
\end{array}
\end{array}
if y < -1.10000000000000007e-303Initial program 74.9%
*-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.9%
Simplified74.9%
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-eval74.3%
Applied egg-rr74.3%
Taylor expanded in x around -inf
exp-lowering-exp.f64N/A
*-lowering-*.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f64N/A
log-lowering-log.f64N/A
+-commutativeN/A
mul-1-negN/A
unsub-negN/A
--lowering--.f64N/A
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
log-lowering-log.f64N/A
/-lowering-/.f6448.1%
Simplified48.1%
if -1.10000000000000007e-303 < y 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.8%
Simplified67.8%
Taylor expanded in z around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6445.4%
Simplified45.4%
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
+-commutativeN/A
+-lowering-+.f64N/A
metadata-eval44.6%
Applied egg-rr44.6%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -1.3e-292) (* 2.0 (pow (exp (* 0.25 (- (log (- 0.0 y)) (log (/ -1.0 x))))) 2.0)) (* (* 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 <= -1.3e-292) {
tmp = 2.0 * pow(exp((0.25 * (log((0.0 - y)) - log((-1.0 / x))))), 2.0);
} 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 <= (-1.3d-292)) then
tmp = 2.0d0 * (exp((0.25d0 * (log((0.0d0 - y)) - log(((-1.0d0) / x))))) ** 2.0d0)
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 <= -1.3e-292) {
tmp = 2.0 * Math.pow(Math.exp((0.25 * (Math.log((0.0 - y)) - Math.log((-1.0 / x))))), 2.0);
} 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 <= -1.3e-292: tmp = 2.0 * math.pow(math.exp((0.25 * (math.log((0.0 - y)) - math.log((-1.0 / x))))), 2.0) 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 <= -1.3e-292) tmp = Float64(2.0 * (exp(Float64(0.25 * Float64(log(Float64(0.0 - y)) - log(Float64(-1.0 / x))))) ^ 2.0)); 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 <= -1.3e-292)
tmp = 2.0 * (exp((0.25 * (log((0.0 - y)) - log((-1.0 / x))))) ^ 2.0);
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, -1.3e-292], N[(2.0 * N[Power[N[Exp[N[(0.25 * N[(N[Log[N[(0.0 - y), $MachinePrecision]], $MachinePrecision] - N[Log[N[(-1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 2.0], $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 -1.3 \cdot 10^{-292}:\\
\;\;\;\;2 \cdot {\left(e^{0.25 \cdot \left(\log \left(0 - y\right) - \log \left(\frac{-1}{x}\right)\right)}\right)}^{2}\\
\mathbf{else}:\\
\;\;\;\;\left(2 \cdot \sqrt{z}\right) \cdot {\left(y + x\right)}^{0.5}\\
\end{array}
\end{array}
if y < -1.30000000000000007e-292Initial program 74.9%
*-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.9%
Simplified74.9%
Taylor expanded in z around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f6427.5%
Simplified27.5%
pow1/2N/A
*-commutativeN/A
metadata-evalN/A
sqr-powN/A
pow2N/A
pow-lowering-pow.f64N/A
metadata-evalN/A
metadata-evalN/A
pow-lowering-pow.f64N/A
*-commutativeN/A
*-lowering-*.f6427.4%
Applied egg-rr27.4%
Taylor expanded in x around -inf
exp-lowering-exp.f64N/A
*-lowering-*.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f64N/A
log-lowering-log.f64N/A
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
log-lowering-log.f64N/A
/-lowering-/.f6434.0%
Simplified34.0%
if -1.30000000000000007e-292 < y Initial program 68.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-+.f6468.0%
Simplified68.0%
Taylor expanded in z around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6445.7%
Simplified45.7%
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
+-commutativeN/A
+-lowering-+.f64N/A
metadata-eval44.8%
Applied egg-rr44.8%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 2.3e-251) (* 2.0 (sqrt (* x (+ y (+ z (/ (* y z) x)))))) (* (* 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 <= 2.3e-251) {
tmp = 2.0 * sqrt((x * (y + (z + ((y * z) / x)))));
} 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 <= 2.3d-251) then
tmp = 2.0d0 * sqrt((x * (y + (z + ((y * z) / x)))))
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 <= 2.3e-251) {
tmp = 2.0 * Math.sqrt((x * (y + (z + ((y * z) / x)))));
} 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 <= 2.3e-251: tmp = 2.0 * math.sqrt((x * (y + (z + ((y * z) / x))))) 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 <= 2.3e-251) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + Float64(z + Float64(Float64(y * z) / x)))))); 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 <= 2.3e-251)
tmp = 2.0 * sqrt((x * (y + (z + ((y * z) / x)))));
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, 2.3e-251], N[(2.0 * N[Sqrt[N[(x * N[(y + N[(z + N[(N[(y * z), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]), $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 2.3 \cdot 10^{-251}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + \left(z + \frac{y \cdot z}{x}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(2 \cdot \sqrt{z}\right) \cdot {\left(y + x\right)}^{0.5}\\
\end{array}
\end{array}
if y < 2.30000000000000017e-251Initial program 73.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-+.f6473.3%
Simplified73.3%
Taylor expanded in x around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6469.2%
Simplified69.2%
if 2.30000000000000017e-251 < y Initial program 68.4%
*-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%
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
+-commutativeN/A
+-lowering-+.f64N/A
metadata-eval45.8%
Applied egg-rr45.8%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 2.5e-251) (* 2.0 (sqrt (* x (+ y (+ z (/ (* y z) x)))))) (* (* 2.0 (sqrt z)) (sqrt y))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 2.5e-251) {
tmp = 2.0 * sqrt((x * (y + (z + ((y * z) / x)))));
} else {
tmp = (2.0 * sqrt(z)) * sqrt(y);
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if (y <= 2.5d-251) then
tmp = 2.0d0 * sqrt((x * (y + (z + ((y * z) / x)))))
else
tmp = (2.0d0 * sqrt(z)) * sqrt(y)
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double tmp;
if (y <= 2.5e-251) {
tmp = 2.0 * Math.sqrt((x * (y + (z + ((y * z) / x)))));
} else {
tmp = (2.0 * Math.sqrt(z)) * Math.sqrt(y);
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= 2.5e-251: tmp = 2.0 * math.sqrt((x * (y + (z + ((y * z) / x))))) else: tmp = (2.0 * math.sqrt(z)) * math.sqrt(y) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 2.5e-251) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + Float64(z + Float64(Float64(y * z) / x)))))); 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 <= 2.5e-251)
tmp = 2.0 * sqrt((x * (y + (z + ((y * z) / x)))));
else
tmp = (2.0 * sqrt(z)) * sqrt(y);
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[y, 2.5e-251], N[(2.0 * N[Sqrt[N[(x * N[(y + N[(z + N[(N[(y * z), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]), $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 2.5 \cdot 10^{-251}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + \left(z + \frac{y \cdot z}{x}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(2 \cdot \sqrt{z}\right) \cdot \sqrt{y}\\
\end{array}
\end{array}
if y < 2.5000000000000001e-251Initial program 73.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-+.f6473.3%
Simplified73.3%
Taylor expanded in x around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6469.2%
Simplified69.2%
if 2.5000000000000001e-251 < y Initial program 68.4%
*-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 y around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6463.5%
Simplified63.5%
Taylor expanded in x around 0
*-commutativeN/A
*-lowering-*.f6423.4%
Simplified23.4%
sqrt-prodN/A
pow1/2N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f6432.9%
Applied egg-rr32.9%
NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
:precision binary64
(if (<= y -1e-292)
(* 2.0 (sqrt (* x (+ y z))))
(if (<= y 9e+39)
(* 2.0 (sqrt (+ (* y z) (* z x))))
(* y (* 2.0 (sqrt (/ z y)))))))assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -1e-292) {
tmp = 2.0 * sqrt((x * (y + z)));
} else if (y <= 9e+39) {
tmp = 2.0 * sqrt(((y * z) + (z * x)));
} else {
tmp = y * (2.0 * sqrt((z / 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 <= (-1d-292)) then
tmp = 2.0d0 * sqrt((x * (y + z)))
else if (y <= 9d+39) then
tmp = 2.0d0 * sqrt(((y * z) + (z * x)))
else
tmp = y * (2.0d0 * sqrt((z / 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 <= -1e-292) {
tmp = 2.0 * Math.sqrt((x * (y + z)));
} else if (y <= 9e+39) {
tmp = 2.0 * Math.sqrt(((y * z) + (z * x)));
} else {
tmp = y * (2.0 * Math.sqrt((z / y)));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= -1e-292: tmp = 2.0 * math.sqrt((x * (y + z))) elif y <= 9e+39: tmp = 2.0 * math.sqrt(((y * z) + (z * x))) else: tmp = y * (2.0 * math.sqrt((z / y))) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -1e-292) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z)))); elseif (y <= 9e+39) tmp = Float64(2.0 * sqrt(Float64(Float64(y * z) + Float64(z * x)))); else tmp = Float64(y * Float64(2.0 * sqrt(Float64(z / 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 <= -1e-292)
tmp = 2.0 * sqrt((x * (y + z)));
elseif (y <= 9e+39)
tmp = 2.0 * sqrt(((y * z) + (z * x)));
else
tmp = y * (2.0 * sqrt((z / 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, -1e-292], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 9e+39], N[(2.0 * N[Sqrt[N[(N[(y * z), $MachinePrecision] + N[(z * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(y * N[(2.0 * N[Sqrt[N[(z / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -1 \cdot 10^{-292}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{elif}\;y \leq 9 \cdot 10^{+39}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot z + z \cdot x}\\
\mathbf{else}:\\
\;\;\;\;y \cdot \left(2 \cdot \sqrt{\frac{z}{y}}\right)\\
\end{array}
\end{array}
if y < -1.0000000000000001e-292Initial program 74.9%
*-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.9%
Simplified74.9%
Taylor expanded in x around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f6454.0%
Simplified54.0%
if -1.0000000000000001e-292 < y < 8.99999999999999991e39Initial program 79.5%
Taylor expanded in y around 0
*-commutativeN/A
*-lowering-*.f6459.4%
Simplified59.4%
if 8.99999999999999991e39 < y Initial program 51.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-+.f6451.9%
Simplified51.9%
Taylor expanded in z around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6426.5%
Simplified26.5%
Taylor expanded in x around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6411.8%
Simplified11.8%
Taylor expanded in y around inf
*-lowering-*.f64N/A
+-commutativeN/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-*.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6441.8%
Simplified41.8%
Taylor expanded in x around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6441.7%
Simplified41.7%
Final simplification52.9%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 9e+39) (* 2.0 (sqrt (+ (* y z) (+ (* y x) (* z x))))) (* y (* 2.0 (sqrt (/ z y))))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 9e+39) {
tmp = 2.0 * sqrt(((y * z) + ((y * x) + (z * x))));
} else {
tmp = y * (2.0 * sqrt((z / 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 <= 9d+39) then
tmp = 2.0d0 * sqrt(((y * z) + ((y * x) + (z * x))))
else
tmp = y * (2.0d0 * sqrt((z / 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 <= 9e+39) {
tmp = 2.0 * Math.sqrt(((y * z) + ((y * x) + (z * x))));
} else {
tmp = y * (2.0 * Math.sqrt((z / y)));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= 9e+39: tmp = 2.0 * math.sqrt(((y * z) + ((y * x) + (z * x)))) else: tmp = y * (2.0 * math.sqrt((z / y))) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 9e+39) tmp = Float64(2.0 * sqrt(Float64(Float64(y * z) + Float64(Float64(y * x) + Float64(z * x))))); else tmp = Float64(y * Float64(2.0 * sqrt(Float64(z / 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 <= 9e+39)
tmp = 2.0 * sqrt(((y * z) + ((y * x) + (z * x))));
else
tmp = y * (2.0 * sqrt((z / 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, 9e+39], N[(2.0 * N[Sqrt[N[(N[(y * z), $MachinePrecision] + N[(N[(y * x), $MachinePrecision] + N[(z * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(y * N[(2.0 * N[Sqrt[N[(z / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 9 \cdot 10^{+39}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot z + \left(y \cdot x + z \cdot x\right)}\\
\mathbf{else}:\\
\;\;\;\;y \cdot \left(2 \cdot \sqrt{\frac{z}{y}}\right)\\
\end{array}
\end{array}
if y < 8.99999999999999991e39Initial program 76.8%
if 8.99999999999999991e39 < y Initial program 51.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-+.f6451.9%
Simplified51.9%
Taylor expanded in z around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6426.5%
Simplified26.5%
Taylor expanded in x around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6411.8%
Simplified11.8%
Taylor expanded in y around inf
*-lowering-*.f64N/A
+-commutativeN/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-*.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6441.8%
Simplified41.8%
Taylor expanded in x around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6441.7%
Simplified41.7%
Final simplification68.7%
NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
:precision binary64
(if (<= y -1e-292)
(* 2.0 (sqrt (* x (+ y z))))
(if (<= y 9e+39)
(* 2.0 (sqrt (* z (+ y x))))
(* y (* 2.0 (sqrt (/ z y)))))))assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -1e-292) {
tmp = 2.0 * sqrt((x * (y + z)));
} else if (y <= 9e+39) {
tmp = 2.0 * sqrt((z * (y + x)));
} else {
tmp = y * (2.0 * sqrt((z / 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 <= (-1d-292)) then
tmp = 2.0d0 * sqrt((x * (y + z)))
else if (y <= 9d+39) then
tmp = 2.0d0 * sqrt((z * (y + x)))
else
tmp = y * (2.0d0 * sqrt((z / 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 <= -1e-292) {
tmp = 2.0 * Math.sqrt((x * (y + z)));
} else if (y <= 9e+39) {
tmp = 2.0 * Math.sqrt((z * (y + x)));
} else {
tmp = y * (2.0 * Math.sqrt((z / y)));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= -1e-292: tmp = 2.0 * math.sqrt((x * (y + z))) elif y <= 9e+39: tmp = 2.0 * math.sqrt((z * (y + x))) else: tmp = y * (2.0 * math.sqrt((z / y))) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -1e-292) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z)))); elseif (y <= 9e+39) tmp = Float64(2.0 * sqrt(Float64(z * Float64(y + x)))); else tmp = Float64(y * Float64(2.0 * sqrt(Float64(z / 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 <= -1e-292)
tmp = 2.0 * sqrt((x * (y + z)));
elseif (y <= 9e+39)
tmp = 2.0 * sqrt((z * (y + x)));
else
tmp = y * (2.0 * sqrt((z / 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, -1e-292], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 9e+39], N[(2.0 * N[Sqrt[N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(y * N[(2.0 * N[Sqrt[N[(z / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -1 \cdot 10^{-292}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{elif}\;y \leq 9 \cdot 10^{+39}:\\
\;\;\;\;2 \cdot \sqrt{z \cdot \left(y + x\right)}\\
\mathbf{else}:\\
\;\;\;\;y \cdot \left(2 \cdot \sqrt{\frac{z}{y}}\right)\\
\end{array}
\end{array}
if y < -1.0000000000000001e-292Initial program 74.9%
*-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.9%
Simplified74.9%
Taylor expanded in x around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f6454.0%
Simplified54.0%
if -1.0000000000000001e-292 < y < 8.99999999999999991e39Initial program 79.5%
*-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-+.f6479.5%
Simplified79.5%
Taylor expanded in z around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6459.4%
Simplified59.4%
if 8.99999999999999991e39 < y Initial program 51.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-+.f6451.9%
Simplified51.9%
Taylor expanded in z around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6426.5%
Simplified26.5%
Taylor expanded in x around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6411.8%
Simplified11.8%
Taylor expanded in y around inf
*-lowering-*.f64N/A
+-commutativeN/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-*.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6441.8%
Simplified41.8%
Taylor expanded in x around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6441.7%
Simplified41.7%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 9e+39) (* 2.0 (sqrt (+ (* y x) (* z (+ y x))))) (* y (* 2.0 (sqrt (/ z y))))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 9e+39) {
tmp = 2.0 * sqrt(((y * x) + (z * (y + x))));
} else {
tmp = y * (2.0 * sqrt((z / 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 <= 9d+39) then
tmp = 2.0d0 * sqrt(((y * x) + (z * (y + x))))
else
tmp = y * (2.0d0 * sqrt((z / 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 <= 9e+39) {
tmp = 2.0 * Math.sqrt(((y * x) + (z * (y + x))));
} else {
tmp = y * (2.0 * Math.sqrt((z / y)));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= 9e+39: tmp = 2.0 * math.sqrt(((y * x) + (z * (y + x)))) else: tmp = y * (2.0 * math.sqrt((z / y))) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 9e+39) tmp = Float64(2.0 * sqrt(Float64(Float64(y * x) + Float64(z * Float64(y + x))))); else tmp = Float64(y * Float64(2.0 * sqrt(Float64(z / 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 <= 9e+39)
tmp = 2.0 * sqrt(((y * x) + (z * (y + x))));
else
tmp = y * (2.0 * sqrt((z / 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, 9e+39], N[(2.0 * N[Sqrt[N[(N[(y * x), $MachinePrecision] + N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(y * N[(2.0 * N[Sqrt[N[(z / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 9 \cdot 10^{+39}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot x + z \cdot \left(y + x\right)}\\
\mathbf{else}:\\
\;\;\;\;y \cdot \left(2 \cdot \sqrt{\frac{z}{y}}\right)\\
\end{array}
\end{array}
if y < 8.99999999999999991e39Initial program 76.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-+.f6476.8%
Simplified76.8%
if 8.99999999999999991e39 < y Initial program 51.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-+.f6451.9%
Simplified51.9%
Taylor expanded in z around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6426.5%
Simplified26.5%
Taylor expanded in x around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6411.8%
Simplified11.8%
Taylor expanded in y around inf
*-lowering-*.f64N/A
+-commutativeN/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-*.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6441.8%
Simplified41.8%
Taylor expanded in x around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6441.7%
Simplified41.7%
Final simplification68.7%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 0.4) (* 2.0 (pow (/ (/ 1.0 y) (+ z x)) -0.5)) (* y (* 2.0 (sqrt (/ z y))))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 0.4) {
tmp = 2.0 * pow(((1.0 / y) / (z + x)), -0.5);
} else {
tmp = y * (2.0 * sqrt((z / 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 <= 0.4d0) then
tmp = 2.0d0 * (((1.0d0 / y) / (z + x)) ** (-0.5d0))
else
tmp = y * (2.0d0 * sqrt((z / 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 <= 0.4) {
tmp = 2.0 * Math.pow(((1.0 / y) / (z + x)), -0.5);
} else {
tmp = y * (2.0 * Math.sqrt((z / y)));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= 0.4: tmp = 2.0 * math.pow(((1.0 / y) / (z + x)), -0.5) else: tmp = y * (2.0 * math.sqrt((z / y))) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 0.4) tmp = Float64(2.0 * (Float64(Float64(1.0 / y) / Float64(z + x)) ^ -0.5)); else tmp = Float64(y * Float64(2.0 * sqrt(Float64(z / 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 <= 0.4)
tmp = 2.0 * (((1.0 / y) / (z + x)) ^ -0.5);
else
tmp = y * (2.0 * sqrt((z / 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, 0.4], N[(2.0 * N[Power[N[(N[(1.0 / y), $MachinePrecision] / N[(z + x), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision], N[(y * N[(2.0 * N[Sqrt[N[(z / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 0.4:\\
\;\;\;\;2 \cdot {\left(\frac{\frac{1}{y}}{z + x}\right)}^{-0.5}\\
\mathbf{else}:\\
\;\;\;\;y \cdot \left(2 \cdot \sqrt{\frac{z}{y}}\right)\\
\end{array}
\end{array}
if y < 0.40000000000000002Initial program 76.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-+.f6476.8%
Simplified76.8%
flip-+N/A
fmm-defN/A
*-commutativeN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
Applied egg-rr76.6%
inv-powN/A
pow1/2N/A
metadata-evalN/A
pow-powN/A
pow-lowering-pow.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
metadata-eval76.7%
Applied egg-rr76.7%
Taylor expanded in y around inf
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f6442.4%
Simplified42.4%
if 0.40000000000000002 < y Initial program 54.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-+.f6454.8%
Simplified54.8%
Taylor expanded in z around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6428.0%
Simplified28.0%
Taylor expanded in x around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6415.1%
Simplified15.1%
Taylor expanded in y around inf
*-lowering-*.f64N/A
+-commutativeN/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-*.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6440.0%
Simplified40.0%
Taylor expanded in x around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6439.7%
Simplified39.7%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -1e-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 <= -1e-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 <= (-1d-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 <= -1e-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 <= -1e-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 <= -1e-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 <= -1e-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, -1e-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 -1 \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 < -1.0000000000000001e-292Initial program 74.9%
*-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.9%
Simplified74.9%
Taylor expanded in x around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f6454.0%
Simplified54.0%
if -1.0000000000000001e-292 < y Initial program 68.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-+.f6468.0%
Simplified68.0%
Taylor expanded in z around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6445.7%
Simplified45.7%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 1.7e-255) (* 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 <= 1.7e-255) {
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 <= 1.7d-255) 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 <= 1.7e-255) {
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 <= 1.7e-255: 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 <= 1.7e-255) 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 <= 1.7e-255)
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, 1.7e-255], 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 1.7 \cdot 10^{-255}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot z}\\
\end{array}
\end{array}
if y < 1.69999999999999992e-255Initial program 73.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-+.f6473.6%
Simplified73.6%
Taylor expanded in x around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f6456.2%
Simplified56.2%
if 1.69999999999999992e-255 < 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-*.f6423.0%
Simplified23.0%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -5e-311) (* 2.0 (sqrt (* y x))) (* 2.0 (sqrt (* y z)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -5e-311) {
tmp = 2.0 * sqrt((y * x));
} else {
tmp = 2.0 * sqrt((y * z));
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if (y <= (-5d-311)) then
tmp = 2.0d0 * sqrt((y * x))
else
tmp = 2.0d0 * sqrt((y * z))
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double tmp;
if (y <= -5e-311) {
tmp = 2.0 * Math.sqrt((y * x));
} else {
tmp = 2.0 * Math.sqrt((y * z));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= -5e-311: tmp = 2.0 * math.sqrt((y * x)) else: tmp = 2.0 * math.sqrt((y * z)) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -5e-311) tmp = Float64(2.0 * sqrt(Float64(y * x))); else tmp = Float64(2.0 * sqrt(Float64(y * z))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if (y <= -5e-311)
tmp = 2.0 * sqrt((y * x));
else
tmp = 2.0 * sqrt((y * z));
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[y, -5e-311], N[(2.0 * N[Sqrt[N[(y * x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[Sqrt[N[(y * z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -5 \cdot 10^{-311}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot x}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot z}\\
\end{array}
\end{array}
if y < -5.00000000000023e-311Initial program 74.9%
*-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.9%
Simplified74.9%
Taylor expanded in z around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f6426.7%
Simplified26.7%
if -5.00000000000023e-311 < y 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.8%
Simplified67.8%
Taylor expanded in x around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6420.3%
Simplified20.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))))
assert(x < y && y < z);
double code(double x, double y, double z) {
return 2.0 * sqrt((y * x));
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = 2.0d0 * sqrt((y * x))
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
return 2.0 * Math.sqrt((y * x));
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): return 2.0 * math.sqrt((y * x))
x, y, z = sort([x, y, z]) function code(x, y, z) return Float64(2.0 * sqrt(Float64(y * x))) end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp = code(x, y, z)
tmp = 2.0 * sqrt((y * x));
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := N[(2.0 * N[Sqrt[N[(y * x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
2 \cdot \sqrt{y \cdot x}
\end{array}
Initial program 71.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-+.f6471.1%
Simplified71.1%
Taylor expanded in z around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f6425.8%
Simplified25.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 2024161
(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)))))