
(FPCore (x y) :precision binary64 (/ (* x y) (* (* (+ x y) (+ x y)) (+ (+ x y) 1.0))))
double code(double x, double y) {
return (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0));
}
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0d0))
end function
public static double code(double x, double y) {
return (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0));
}
def code(x, y): return (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0))
function code(x, y) return Float64(Float64(x * y) / Float64(Float64(Float64(x + y) * Float64(x + y)) * Float64(Float64(x + y) + 1.0))) end
function tmp = code(x, y) tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0)); end
code[x_, y_] := N[(N[(x * y), $MachinePrecision] / N[(N[(N[(x + y), $MachinePrecision] * N[(x + y), $MachinePrecision]), $MachinePrecision] * N[(N[(x + y), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 19 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y) :precision binary64 (/ (* x y) (* (* (+ x y) (+ x y)) (+ (+ x y) 1.0))))
double code(double x, double y) {
return (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0));
}
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0d0))
end function
public static double code(double x, double y) {
return (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0));
}
def code(x, y): return (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0))
function code(x, y) return Float64(Float64(x * y) / Float64(Float64(Float64(x + y) * Float64(x + y)) * Float64(Float64(x + y) + 1.0))) end
function tmp = code(x, y) tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0)); end
code[x_, y_] := N[(N[(x * y), $MachinePrecision] / N[(N[(N[(x + y), $MachinePrecision] * N[(x + y), $MachinePrecision]), $MachinePrecision] * N[(N[(x + y), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}
\end{array}
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (* (/ (/ x (+ y x)) (+ (+ y x) 1.0)) (/ y (+ y x))))
assert(x < y);
double code(double x, double y) {
return ((x / (y + x)) / ((y + x) + 1.0)) * (y / (y + x));
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = ((x / (y + x)) / ((y + x) + 1.0d0)) * (y / (y + x))
end function
assert x < y;
public static double code(double x, double y) {
return ((x / (y + x)) / ((y + x) + 1.0)) * (y / (y + x));
}
[x, y] = sort([x, y]) def code(x, y): return ((x / (y + x)) / ((y + x) + 1.0)) * (y / (y + x))
x, y = sort([x, y]) function code(x, y) return Float64(Float64(Float64(x / Float64(y + x)) / Float64(Float64(y + x) + 1.0)) * Float64(y / Float64(y + x))) end
x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y)
tmp = ((x / (y + x)) / ((y + x) + 1.0)) * (y / (y + x));
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := N[(N[(N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision] / N[(N[(y + x), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision] * N[(y / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\frac{\frac{x}{y + x}}{\left(y + x\right) + 1} \cdot \frac{y}{y + x}
\end{array}
Initial program 68.2%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-*r/N/A
lift-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
+-commutativeN/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
lower-/.f64N/A
+-commutativeN/A
Applied rewrites99.8%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(if (<= x -6.8e+192)
(* 1.0 (/ (/ y (+ 1.0 (+ y x))) (+ y x)))
(if (<= x -4.7e-71)
(/ (* 1.0 y) (* (+ (+ x y) 1.0) (+ x y)))
(* (/ x (+ y x)) (pow (+ 1.0 y) -1.0)))))assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -6.8e+192) {
tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x));
} else if (x <= -4.7e-71) {
tmp = (1.0 * y) / (((x + y) + 1.0) * (x + y));
} else {
tmp = (x / (y + x)) * pow((1.0 + y), -1.0);
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: tmp
if (x <= (-6.8d+192)) then
tmp = 1.0d0 * ((y / (1.0d0 + (y + x))) / (y + x))
else if (x <= (-4.7d-71)) then
tmp = (1.0d0 * y) / (((x + y) + 1.0d0) * (x + y))
else
tmp = (x / (y + x)) * ((1.0d0 + y) ** (-1.0d0))
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double tmp;
if (x <= -6.8e+192) {
tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x));
} else if (x <= -4.7e-71) {
tmp = (1.0 * y) / (((x + y) + 1.0) * (x + y));
} else {
tmp = (x / (y + x)) * Math.pow((1.0 + y), -1.0);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): tmp = 0 if x <= -6.8e+192: tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x)) elif x <= -4.7e-71: tmp = (1.0 * y) / (((x + y) + 1.0) * (x + y)) else: tmp = (x / (y + x)) * math.pow((1.0 + y), -1.0) return tmp
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (x <= -6.8e+192) tmp = Float64(1.0 * Float64(Float64(y / Float64(1.0 + Float64(y + x))) / Float64(y + x))); elseif (x <= -4.7e-71) tmp = Float64(Float64(1.0 * y) / Float64(Float64(Float64(x + y) + 1.0) * Float64(x + y))); else tmp = Float64(Float64(x / Float64(y + x)) * (Float64(1.0 + y) ^ -1.0)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
tmp = 0.0;
if (x <= -6.8e+192)
tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x));
elseif (x <= -4.7e-71)
tmp = (1.0 * y) / (((x + y) + 1.0) * (x + y));
else
tmp = (x / (y + x)) * ((1.0 + y) ^ -1.0);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[x, -6.8e+192], N[(1.0 * N[(N[(y / N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -4.7e-71], N[(N[(1.0 * y), $MachinePrecision] / N[(N[(N[(x + y), $MachinePrecision] + 1.0), $MachinePrecision] * N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision] * N[Power[N[(1.0 + y), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -6.8 \cdot 10^{+192}:\\
\;\;\;\;1 \cdot \frac{\frac{y}{1 + \left(y + x\right)}}{y + x}\\
\mathbf{elif}\;x \leq -4.7 \cdot 10^{-71}:\\
\;\;\;\;\frac{1 \cdot y}{\left(\left(x + y\right) + 1\right) \cdot \left(x + y\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{y + x} \cdot {\left(1 + y\right)}^{-1}\\
\end{array}
\end{array}
if x < -6.79999999999999992e192Initial program 35.5%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
Taylor expanded in x around inf
Applied rewrites92.2%
if -6.79999999999999992e192 < x < -4.69999999999999996e-71Initial program 73.5%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.7
Applied rewrites99.7%
Taylor expanded in x around inf
Applied rewrites56.6%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-*r/N/A
lift-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
+-commutativeN/A
lift-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-/.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f64N/A
lower-+.f6476.7
Applied rewrites76.7%
if -4.69999999999999996e-71 < x Initial program 70.1%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
Taylor expanded in x around 0
lower-/.f64N/A
lower-+.f6461.5
Applied rewrites61.5%
Final simplification67.4%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(if (<= x -6.8e+192)
(/ (/ (- y) x) (- (+ y x)))
(if (<= x -4.7e-71)
(/ (* 1.0 y) (* (+ (+ x y) 1.0) (+ x y)))
(* (/ x (+ y x)) (pow (+ 1.0 y) -1.0)))))assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -6.8e+192) {
tmp = (-y / x) / -(y + x);
} else if (x <= -4.7e-71) {
tmp = (1.0 * y) / (((x + y) + 1.0) * (x + y));
} else {
tmp = (x / (y + x)) * pow((1.0 + y), -1.0);
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: tmp
if (x <= (-6.8d+192)) then
tmp = (-y / x) / -(y + x)
else if (x <= (-4.7d-71)) then
tmp = (1.0d0 * y) / (((x + y) + 1.0d0) * (x + y))
else
tmp = (x / (y + x)) * ((1.0d0 + y) ** (-1.0d0))
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double tmp;
if (x <= -6.8e+192) {
tmp = (-y / x) / -(y + x);
} else if (x <= -4.7e-71) {
tmp = (1.0 * y) / (((x + y) + 1.0) * (x + y));
} else {
tmp = (x / (y + x)) * Math.pow((1.0 + y), -1.0);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): tmp = 0 if x <= -6.8e+192: tmp = (-y / x) / -(y + x) elif x <= -4.7e-71: tmp = (1.0 * y) / (((x + y) + 1.0) * (x + y)) else: tmp = (x / (y + x)) * math.pow((1.0 + y), -1.0) return tmp
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (x <= -6.8e+192) tmp = Float64(Float64(Float64(-y) / x) / Float64(-Float64(y + x))); elseif (x <= -4.7e-71) tmp = Float64(Float64(1.0 * y) / Float64(Float64(Float64(x + y) + 1.0) * Float64(x + y))); else tmp = Float64(Float64(x / Float64(y + x)) * (Float64(1.0 + y) ^ -1.0)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
tmp = 0.0;
if (x <= -6.8e+192)
tmp = (-y / x) / -(y + x);
elseif (x <= -4.7e-71)
tmp = (1.0 * y) / (((x + y) + 1.0) * (x + y));
else
tmp = (x / (y + x)) * ((1.0 + y) ^ -1.0);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[x, -6.8e+192], N[(N[((-y) / x), $MachinePrecision] / (-N[(y + x), $MachinePrecision])), $MachinePrecision], If[LessEqual[x, -4.7e-71], N[(N[(1.0 * y), $MachinePrecision] / N[(N[(N[(x + y), $MachinePrecision] + 1.0), $MachinePrecision] * N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision] * N[Power[N[(1.0 + y), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -6.8 \cdot 10^{+192}:\\
\;\;\;\;\frac{\frac{-y}{x}}{-\left(y + x\right)}\\
\mathbf{elif}\;x \leq -4.7 \cdot 10^{-71}:\\
\;\;\;\;\frac{1 \cdot y}{\left(\left(x + y\right) + 1\right) \cdot \left(x + y\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{y + x} \cdot {\left(1 + y\right)}^{-1}\\
\end{array}
\end{array}
if x < -6.79999999999999992e192Initial program 35.5%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-*r/N/A
lift-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
+-commutativeN/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
lower-/.f64N/A
+-commutativeN/A
Applied rewrites99.7%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-timesN/A
associate-*r/N/A
lift-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
associate-/l/N/A
frac-timesN/A
sqr-neg-revN/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites99.7%
Taylor expanded in x around inf
associate-*r/N/A
lower-/.f64N/A
mul-1-negN/A
lower-neg.f6492.0
Applied rewrites92.0%
if -6.79999999999999992e192 < x < -4.69999999999999996e-71Initial program 73.5%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.7
Applied rewrites99.7%
Taylor expanded in x around inf
Applied rewrites56.6%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-*r/N/A
lift-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
+-commutativeN/A
lift-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-/.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f64N/A
lower-+.f6476.7
Applied rewrites76.7%
if -4.69999999999999996e-71 < x Initial program 70.1%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
Taylor expanded in x around 0
lower-/.f64N/A
lower-+.f6461.5
Applied rewrites61.5%
Final simplification67.4%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(if (<= y -2.3e-57)
(/ (/ (- y (* y (/ (fma 3.0 y 1.0) x))) x) x)
(if (<= y 3.7e+139)
(/ (* (/ y (+ y x)) x) (* (+ 1.0 (+ y x)) (+ y x)))
(/ (* (/ x y) (/ (- y (fma 3.0 x 1.0)) y)) y))))assert(x < y);
double code(double x, double y) {
double tmp;
if (y <= -2.3e-57) {
tmp = ((y - (y * (fma(3.0, y, 1.0) / x))) / x) / x;
} else if (y <= 3.7e+139) {
tmp = ((y / (y + x)) * x) / ((1.0 + (y + x)) * (y + x));
} else {
tmp = ((x / y) * ((y - fma(3.0, x, 1.0)) / y)) / y;
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (y <= -2.3e-57) tmp = Float64(Float64(Float64(y - Float64(y * Float64(fma(3.0, y, 1.0) / x))) / x) / x); elseif (y <= 3.7e+139) tmp = Float64(Float64(Float64(y / Float64(y + x)) * x) / Float64(Float64(1.0 + Float64(y + x)) * Float64(y + x))); else tmp = Float64(Float64(Float64(x / y) * Float64(Float64(y - fma(3.0, x, 1.0)) / y)) / y); end return tmp end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[y, -2.3e-57], N[(N[(N[(y - N[(y * N[(N[(3.0 * y + 1.0), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision] / x), $MachinePrecision], If[LessEqual[y, 3.7e+139], N[(N[(N[(y / N[(y + x), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision] / N[(N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision] * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x / y), $MachinePrecision] * N[(N[(y - N[(3.0 * x + 1.0), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -2.3 \cdot 10^{-57}:\\
\;\;\;\;\frac{\frac{y - y \cdot \frac{\mathsf{fma}\left(3, y, 1\right)}{x}}{x}}{x}\\
\mathbf{elif}\;y \leq 3.7 \cdot 10^{+139}:\\
\;\;\;\;\frac{\frac{y}{y + x} \cdot x}{\left(1 + \left(y + x\right)\right) \cdot \left(y + x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{y} \cdot \frac{y - \mathsf{fma}\left(3, x, 1\right)}{y}}{y}\\
\end{array}
\end{array}
if y < -2.3e-57Initial program 67.6%
Taylor expanded in x around inf
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites31.3%
if -2.3e-57 < y < 3.69999999999999992e139Initial program 75.8%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-*r/N/A
lift-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
+-commutativeN/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
lower-/.f64N/A
+-commutativeN/A
Applied rewrites99.8%
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6499.2
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.2
Applied rewrites99.2%
if 3.69999999999999992e139 < y Initial program 45.9%
Taylor expanded in y around inf
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites81.1%
Taylor expanded in y around 0
Applied rewrites81.2%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(let* ((t_0 (+ 1.0 (+ y x))))
(if (<= y -2.3e-57)
(* 1.0 (/ (/ y t_0) (+ y x)))
(if (<= y 3.7e+139)
(/ (* (/ y (+ y x)) x) (* t_0 (+ y x)))
(/ (* (/ x y) (/ (- y (fma 3.0 x 1.0)) y)) y)))))assert(x < y);
double code(double x, double y) {
double t_0 = 1.0 + (y + x);
double tmp;
if (y <= -2.3e-57) {
tmp = 1.0 * ((y / t_0) / (y + x));
} else if (y <= 3.7e+139) {
tmp = ((y / (y + x)) * x) / (t_0 * (y + x));
} else {
tmp = ((x / y) * ((y - fma(3.0, x, 1.0)) / y)) / y;
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) t_0 = Float64(1.0 + Float64(y + x)) tmp = 0.0 if (y <= -2.3e-57) tmp = Float64(1.0 * Float64(Float64(y / t_0) / Float64(y + x))); elseif (y <= 3.7e+139) tmp = Float64(Float64(Float64(y / Float64(y + x)) * x) / Float64(t_0 * Float64(y + x))); else tmp = Float64(Float64(Float64(x / y) * Float64(Float64(y - fma(3.0, x, 1.0)) / y)) / y); end return tmp end
NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := Block[{t$95$0 = N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -2.3e-57], N[(1.0 * N[(N[(y / t$95$0), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 3.7e+139], N[(N[(N[(y / N[(y + x), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision] / N[(t$95$0 * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x / y), $MachinePrecision] * N[(N[(y - N[(3.0 * x + 1.0), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_0 := 1 + \left(y + x\right)\\
\mathbf{if}\;y \leq -2.3 \cdot 10^{-57}:\\
\;\;\;\;1 \cdot \frac{\frac{y}{t\_0}}{y + x}\\
\mathbf{elif}\;y \leq 3.7 \cdot 10^{+139}:\\
\;\;\;\;\frac{\frac{y}{y + x} \cdot x}{t\_0 \cdot \left(y + x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{y} \cdot \frac{y - \mathsf{fma}\left(3, x, 1\right)}{y}}{y}\\
\end{array}
\end{array}
if y < -2.3e-57Initial program 67.6%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
Taylor expanded in x around inf
Applied rewrites33.2%
if -2.3e-57 < y < 3.69999999999999992e139Initial program 75.8%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-*r/N/A
lift-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
+-commutativeN/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
lower-/.f64N/A
+-commutativeN/A
Applied rewrites99.8%
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6499.2
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.2
Applied rewrites99.2%
if 3.69999999999999992e139 < y Initial program 45.9%
Taylor expanded in y around inf
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites81.1%
Taylor expanded in y around 0
Applied rewrites81.2%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(let* ((t_0 (+ 1.0 (+ y x))))
(if (<= y -2.3e-57)
(* 1.0 (/ (/ y t_0) (+ y x)))
(if (<= y 3.7e+139)
(/ (* (/ y (+ y x)) x) (* t_0 (+ y x)))
(/ (/ (- x) y) (- (+ y x)))))))assert(x < y);
double code(double x, double y) {
double t_0 = 1.0 + (y + x);
double tmp;
if (y <= -2.3e-57) {
tmp = 1.0 * ((y / t_0) / (y + x));
} else if (y <= 3.7e+139) {
tmp = ((y / (y + x)) * x) / (t_0 * (y + x));
} else {
tmp = (-x / y) / -(y + x);
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: t_0
real(8) :: tmp
t_0 = 1.0d0 + (y + x)
if (y <= (-2.3d-57)) then
tmp = 1.0d0 * ((y / t_0) / (y + x))
else if (y <= 3.7d+139) then
tmp = ((y / (y + x)) * x) / (t_0 * (y + x))
else
tmp = (-x / y) / -(y + x)
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double t_0 = 1.0 + (y + x);
double tmp;
if (y <= -2.3e-57) {
tmp = 1.0 * ((y / t_0) / (y + x));
} else if (y <= 3.7e+139) {
tmp = ((y / (y + x)) * x) / (t_0 * (y + x));
} else {
tmp = (-x / y) / -(y + x);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): t_0 = 1.0 + (y + x) tmp = 0 if y <= -2.3e-57: tmp = 1.0 * ((y / t_0) / (y + x)) elif y <= 3.7e+139: tmp = ((y / (y + x)) * x) / (t_0 * (y + x)) else: tmp = (-x / y) / -(y + x) return tmp
x, y = sort([x, y]) function code(x, y) t_0 = Float64(1.0 + Float64(y + x)) tmp = 0.0 if (y <= -2.3e-57) tmp = Float64(1.0 * Float64(Float64(y / t_0) / Float64(y + x))); elseif (y <= 3.7e+139) tmp = Float64(Float64(Float64(y / Float64(y + x)) * x) / Float64(t_0 * Float64(y + x))); else tmp = Float64(Float64(Float64(-x) / y) / Float64(-Float64(y + x))); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
t_0 = 1.0 + (y + x);
tmp = 0.0;
if (y <= -2.3e-57)
tmp = 1.0 * ((y / t_0) / (y + x));
elseif (y <= 3.7e+139)
tmp = ((y / (y + x)) * x) / (t_0 * (y + x));
else
tmp = (-x / y) / -(y + x);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := Block[{t$95$0 = N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -2.3e-57], N[(1.0 * N[(N[(y / t$95$0), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 3.7e+139], N[(N[(N[(y / N[(y + x), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision] / N[(t$95$0 * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[((-x) / y), $MachinePrecision] / (-N[(y + x), $MachinePrecision])), $MachinePrecision]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_0 := 1 + \left(y + x\right)\\
\mathbf{if}\;y \leq -2.3 \cdot 10^{-57}:\\
\;\;\;\;1 \cdot \frac{\frac{y}{t\_0}}{y + x}\\
\mathbf{elif}\;y \leq 3.7 \cdot 10^{+139}:\\
\;\;\;\;\frac{\frac{y}{y + x} \cdot x}{t\_0 \cdot \left(y + x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{-x}{y}}{-\left(y + x\right)}\\
\end{array}
\end{array}
if y < -2.3e-57Initial program 67.6%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
Taylor expanded in x around inf
Applied rewrites33.2%
if -2.3e-57 < y < 3.69999999999999992e139Initial program 75.8%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-*r/N/A
lift-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
+-commutativeN/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
lower-/.f64N/A
+-commutativeN/A
Applied rewrites99.8%
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6499.2
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.2
Applied rewrites99.2%
if 3.69999999999999992e139 < y Initial program 45.9%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-*r/N/A
lift-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
+-commutativeN/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
lower-/.f64N/A
+-commutativeN/A
Applied rewrites99.8%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-timesN/A
associate-*r/N/A
lift-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
associate-/l/N/A
frac-timesN/A
sqr-neg-revN/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites99.8%
Taylor expanded in y around inf
associate-*r/N/A
lower-/.f64N/A
mul-1-negN/A
lower-neg.f6481.8
Applied rewrites81.8%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(let* ((t_0 (+ 1.0 (+ y x))))
(if (<= y -6.8e-50)
(* 1.0 (/ (/ y t_0) (+ y x)))
(if (<= y 3.7e+139)
(* (/ y (+ y x)) (/ x (* t_0 (+ y x))))
(/ (/ (- x) y) (- (+ y x)))))))assert(x < y);
double code(double x, double y) {
double t_0 = 1.0 + (y + x);
double tmp;
if (y <= -6.8e-50) {
tmp = 1.0 * ((y / t_0) / (y + x));
} else if (y <= 3.7e+139) {
tmp = (y / (y + x)) * (x / (t_0 * (y + x)));
} else {
tmp = (-x / y) / -(y + x);
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: t_0
real(8) :: tmp
t_0 = 1.0d0 + (y + x)
if (y <= (-6.8d-50)) then
tmp = 1.0d0 * ((y / t_0) / (y + x))
else if (y <= 3.7d+139) then
tmp = (y / (y + x)) * (x / (t_0 * (y + x)))
else
tmp = (-x / y) / -(y + x)
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double t_0 = 1.0 + (y + x);
double tmp;
if (y <= -6.8e-50) {
tmp = 1.0 * ((y / t_0) / (y + x));
} else if (y <= 3.7e+139) {
tmp = (y / (y + x)) * (x / (t_0 * (y + x)));
} else {
tmp = (-x / y) / -(y + x);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): t_0 = 1.0 + (y + x) tmp = 0 if y <= -6.8e-50: tmp = 1.0 * ((y / t_0) / (y + x)) elif y <= 3.7e+139: tmp = (y / (y + x)) * (x / (t_0 * (y + x))) else: tmp = (-x / y) / -(y + x) return tmp
x, y = sort([x, y]) function code(x, y) t_0 = Float64(1.0 + Float64(y + x)) tmp = 0.0 if (y <= -6.8e-50) tmp = Float64(1.0 * Float64(Float64(y / t_0) / Float64(y + x))); elseif (y <= 3.7e+139) tmp = Float64(Float64(y / Float64(y + x)) * Float64(x / Float64(t_0 * Float64(y + x)))); else tmp = Float64(Float64(Float64(-x) / y) / Float64(-Float64(y + x))); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
t_0 = 1.0 + (y + x);
tmp = 0.0;
if (y <= -6.8e-50)
tmp = 1.0 * ((y / t_0) / (y + x));
elseif (y <= 3.7e+139)
tmp = (y / (y + x)) * (x / (t_0 * (y + x)));
else
tmp = (-x / y) / -(y + x);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := Block[{t$95$0 = N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -6.8e-50], N[(1.0 * N[(N[(y / t$95$0), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 3.7e+139], N[(N[(y / N[(y + x), $MachinePrecision]), $MachinePrecision] * N[(x / N[(t$95$0 * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[((-x) / y), $MachinePrecision] / (-N[(y + x), $MachinePrecision])), $MachinePrecision]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_0 := 1 + \left(y + x\right)\\
\mathbf{if}\;y \leq -6.8 \cdot 10^{-50}:\\
\;\;\;\;1 \cdot \frac{\frac{y}{t\_0}}{y + x}\\
\mathbf{elif}\;y \leq 3.7 \cdot 10^{+139}:\\
\;\;\;\;\frac{y}{y + x} \cdot \frac{x}{t\_0 \cdot \left(y + x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{-x}{y}}{-\left(y + x\right)}\\
\end{array}
\end{array}
if y < -6.80000000000000029e-50Initial program 66.4%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
Taylor expanded in x around inf
Applied rewrites33.1%
if -6.80000000000000029e-50 < y < 3.69999999999999992e139Initial program 76.4%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6499.1
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.1
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.1
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.1
Applied rewrites99.1%
if 3.69999999999999992e139 < y Initial program 45.9%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-*r/N/A
lift-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
+-commutativeN/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
lower-/.f64N/A
+-commutativeN/A
Applied rewrites99.8%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-timesN/A
associate-*r/N/A
lift-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
associate-/l/N/A
frac-timesN/A
sqr-neg-revN/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites99.8%
Taylor expanded in y around inf
associate-*r/N/A
lower-/.f64N/A
mul-1-negN/A
lower-neg.f6481.8
Applied rewrites81.8%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(if (<= y 2.65e-145)
(* 1.0 (/ (/ y (+ 1.0 (+ y x))) (+ y x)))
(if (<= y 5.5e+68)
(/ (* x y) (* (* (+ x y) (+ x y)) (+ (+ x y) 1.0)))
(* (/ (/ x (+ y x)) (+ (+ y x) 1.0)) 1.0))))assert(x < y);
double code(double x, double y) {
double tmp;
if (y <= 2.65e-145) {
tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x));
} else if (y <= 5.5e+68) {
tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0));
} else {
tmp = ((x / (y + x)) / ((y + x) + 1.0)) * 1.0;
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: tmp
if (y <= 2.65d-145) then
tmp = 1.0d0 * ((y / (1.0d0 + (y + x))) / (y + x))
else if (y <= 5.5d+68) then
tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0d0))
else
tmp = ((x / (y + x)) / ((y + x) + 1.0d0)) * 1.0d0
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double tmp;
if (y <= 2.65e-145) {
tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x));
} else if (y <= 5.5e+68) {
tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0));
} else {
tmp = ((x / (y + x)) / ((y + x) + 1.0)) * 1.0;
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): tmp = 0 if y <= 2.65e-145: tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x)) elif y <= 5.5e+68: tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0)) else: tmp = ((x / (y + x)) / ((y + x) + 1.0)) * 1.0 return tmp
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (y <= 2.65e-145) tmp = Float64(1.0 * Float64(Float64(y / Float64(1.0 + Float64(y + x))) / Float64(y + x))); elseif (y <= 5.5e+68) tmp = Float64(Float64(x * y) / Float64(Float64(Float64(x + y) * Float64(x + y)) * Float64(Float64(x + y) + 1.0))); else tmp = Float64(Float64(Float64(x / Float64(y + x)) / Float64(Float64(y + x) + 1.0)) * 1.0); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
tmp = 0.0;
if (y <= 2.65e-145)
tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x));
elseif (y <= 5.5e+68)
tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0));
else
tmp = ((x / (y + x)) / ((y + x) + 1.0)) * 1.0;
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[y, 2.65e-145], N[(1.0 * N[(N[(y / N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 5.5e+68], N[(N[(x * y), $MachinePrecision] / N[(N[(N[(x + y), $MachinePrecision] * N[(x + y), $MachinePrecision]), $MachinePrecision] * N[(N[(x + y), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision] / N[(N[(y + x), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision] * 1.0), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 2.65 \cdot 10^{-145}:\\
\;\;\;\;1 \cdot \frac{\frac{y}{1 + \left(y + x\right)}}{y + x}\\
\mathbf{elif}\;y \leq 5.5 \cdot 10^{+68}:\\
\;\;\;\;\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{y + x}}{\left(y + x\right) + 1} \cdot 1\\
\end{array}
\end{array}
if y < 2.65e-145Initial program 68.0%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
Taylor expanded in x around inf
Applied rewrites56.5%
if 2.65e-145 < y < 5.5000000000000004e68Initial program 83.9%
if 5.5000000000000004e68 < y Initial program 53.9%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.7
Applied rewrites99.7%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-*r/N/A
lift-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
+-commutativeN/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
lower-/.f64N/A
+-commutativeN/A
Applied rewrites99.8%
Taylor expanded in x around 0
Applied rewrites84.3%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (* (/ x (+ y x)) (/ (/ y (+ 1.0 (+ y x))) (+ y x))))
assert(x < y);
double code(double x, double y) {
return (x / (y + x)) * ((y / (1.0 + (y + x))) / (y + x));
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = (x / (y + x)) * ((y / (1.0d0 + (y + x))) / (y + x))
end function
assert x < y;
public static double code(double x, double y) {
return (x / (y + x)) * ((y / (1.0 + (y + x))) / (y + x));
}
[x, y] = sort([x, y]) def code(x, y): return (x / (y + x)) * ((y / (1.0 + (y + x))) / (y + x))
x, y = sort([x, y]) function code(x, y) return Float64(Float64(x / Float64(y + x)) * Float64(Float64(y / Float64(1.0 + Float64(y + x))) / Float64(y + x))) end
x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y)
tmp = (x / (y + x)) * ((y / (1.0 + (y + x))) / (y + x));
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := N[(N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision] * N[(N[(y / N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\frac{x}{y + x} \cdot \frac{\frac{y}{1 + \left(y + x\right)}}{y + x}
\end{array}
Initial program 68.2%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(if (<= x -6.8e+192)
(* 1.0 (/ (/ y (+ 1.0 (+ y x))) (+ y x)))
(if (<= x -4.7e-71)
(/ (* 1.0 y) (* (+ (+ x y) 1.0) (+ x y)))
(* (/ (/ x (+ y x)) (+ (+ y x) 1.0)) 1.0))))assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -6.8e+192) {
tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x));
} else if (x <= -4.7e-71) {
tmp = (1.0 * y) / (((x + y) + 1.0) * (x + y));
} else {
tmp = ((x / (y + x)) / ((y + x) + 1.0)) * 1.0;
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: tmp
if (x <= (-6.8d+192)) then
tmp = 1.0d0 * ((y / (1.0d0 + (y + x))) / (y + x))
else if (x <= (-4.7d-71)) then
tmp = (1.0d0 * y) / (((x + y) + 1.0d0) * (x + y))
else
tmp = ((x / (y + x)) / ((y + x) + 1.0d0)) * 1.0d0
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double tmp;
if (x <= -6.8e+192) {
tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x));
} else if (x <= -4.7e-71) {
tmp = (1.0 * y) / (((x + y) + 1.0) * (x + y));
} else {
tmp = ((x / (y + x)) / ((y + x) + 1.0)) * 1.0;
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): tmp = 0 if x <= -6.8e+192: tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x)) elif x <= -4.7e-71: tmp = (1.0 * y) / (((x + y) + 1.0) * (x + y)) else: tmp = ((x / (y + x)) / ((y + x) + 1.0)) * 1.0 return tmp
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (x <= -6.8e+192) tmp = Float64(1.0 * Float64(Float64(y / Float64(1.0 + Float64(y + x))) / Float64(y + x))); elseif (x <= -4.7e-71) tmp = Float64(Float64(1.0 * y) / Float64(Float64(Float64(x + y) + 1.0) * Float64(x + y))); else tmp = Float64(Float64(Float64(x / Float64(y + x)) / Float64(Float64(y + x) + 1.0)) * 1.0); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
tmp = 0.0;
if (x <= -6.8e+192)
tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x));
elseif (x <= -4.7e-71)
tmp = (1.0 * y) / (((x + y) + 1.0) * (x + y));
else
tmp = ((x / (y + x)) / ((y + x) + 1.0)) * 1.0;
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[x, -6.8e+192], N[(1.0 * N[(N[(y / N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -4.7e-71], N[(N[(1.0 * y), $MachinePrecision] / N[(N[(N[(x + y), $MachinePrecision] + 1.0), $MachinePrecision] * N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision] / N[(N[(y + x), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision] * 1.0), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -6.8 \cdot 10^{+192}:\\
\;\;\;\;1 \cdot \frac{\frac{y}{1 + \left(y + x\right)}}{y + x}\\
\mathbf{elif}\;x \leq -4.7 \cdot 10^{-71}:\\
\;\;\;\;\frac{1 \cdot y}{\left(\left(x + y\right) + 1\right) \cdot \left(x + y\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{y + x}}{\left(y + x\right) + 1} \cdot 1\\
\end{array}
\end{array}
if x < -6.79999999999999992e192Initial program 35.5%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
Taylor expanded in x around inf
Applied rewrites92.2%
if -6.79999999999999992e192 < x < -4.69999999999999996e-71Initial program 73.5%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.7
Applied rewrites99.7%
Taylor expanded in x around inf
Applied rewrites56.6%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-*r/N/A
lift-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
+-commutativeN/A
lift-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-/.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f64N/A
lower-+.f6476.7
Applied rewrites76.7%
if -4.69999999999999996e-71 < x Initial program 70.1%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-*r/N/A
lift-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
+-commutativeN/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
lower-/.f64N/A
+-commutativeN/A
Applied rewrites99.8%
Taylor expanded in x around 0
Applied rewrites61.9%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(let* ((t_0 (- (+ y x))))
(if (<= x -6.8e+192)
(/ (/ (- y) x) t_0)
(if (<= x -1.2e-56)
(/ (* 1.0 y) (* (+ (+ x y) 1.0) (+ x y)))
(if (<= x 8.2e-6) (/ x (fma y y y)) (/ (/ (- x) y) t_0))))))assert(x < y);
double code(double x, double y) {
double t_0 = -(y + x);
double tmp;
if (x <= -6.8e+192) {
tmp = (-y / x) / t_0;
} else if (x <= -1.2e-56) {
tmp = (1.0 * y) / (((x + y) + 1.0) * (x + y));
} else if (x <= 8.2e-6) {
tmp = x / fma(y, y, y);
} else {
tmp = (-x / y) / t_0;
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) t_0 = Float64(-Float64(y + x)) tmp = 0.0 if (x <= -6.8e+192) tmp = Float64(Float64(Float64(-y) / x) / t_0); elseif (x <= -1.2e-56) tmp = Float64(Float64(1.0 * y) / Float64(Float64(Float64(x + y) + 1.0) * Float64(x + y))); elseif (x <= 8.2e-6) tmp = Float64(x / fma(y, y, y)); else tmp = Float64(Float64(Float64(-x) / y) / t_0); end return tmp end
NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := Block[{t$95$0 = (-N[(y + x), $MachinePrecision])}, If[LessEqual[x, -6.8e+192], N[(N[((-y) / x), $MachinePrecision] / t$95$0), $MachinePrecision], If[LessEqual[x, -1.2e-56], N[(N[(1.0 * y), $MachinePrecision] / N[(N[(N[(x + y), $MachinePrecision] + 1.0), $MachinePrecision] * N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 8.2e-6], N[(x / N[(y * y + y), $MachinePrecision]), $MachinePrecision], N[(N[((-x) / y), $MachinePrecision] / t$95$0), $MachinePrecision]]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_0 := -\left(y + x\right)\\
\mathbf{if}\;x \leq -6.8 \cdot 10^{+192}:\\
\;\;\;\;\frac{\frac{-y}{x}}{t\_0}\\
\mathbf{elif}\;x \leq -1.2 \cdot 10^{-56}:\\
\;\;\;\;\frac{1 \cdot y}{\left(\left(x + y\right) + 1\right) \cdot \left(x + y\right)}\\
\mathbf{elif}\;x \leq 8.2 \cdot 10^{-6}:\\
\;\;\;\;\frac{x}{\mathsf{fma}\left(y, y, y\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{-x}{y}}{t\_0}\\
\end{array}
\end{array}
if x < -6.79999999999999992e192Initial program 35.5%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-*r/N/A
lift-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
+-commutativeN/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
lower-/.f64N/A
+-commutativeN/A
Applied rewrites99.7%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-timesN/A
associate-*r/N/A
lift-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
associate-/l/N/A
frac-timesN/A
sqr-neg-revN/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites99.7%
Taylor expanded in x around inf
associate-*r/N/A
lower-/.f64N/A
mul-1-negN/A
lower-neg.f6492.0
Applied rewrites92.0%
if -6.79999999999999992e192 < x < -1.2e-56Initial program 73.8%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.7
Applied rewrites99.7%
Taylor expanded in x around inf
Applied rewrites56.0%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-*r/N/A
lift-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
+-commutativeN/A
lift-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-/.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f64N/A
lower-+.f6477.2
Applied rewrites77.2%
if -1.2e-56 < x < 8.1999999999999994e-6Initial program 78.5%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6480.5
Applied rewrites80.5%
if 8.1999999999999994e-6 < x Initial program 56.0%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.7
Applied rewrites99.7%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-*r/N/A
lift-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
+-commutativeN/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
lower-/.f64N/A
+-commutativeN/A
Applied rewrites99.6%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-timesN/A
associate-*r/N/A
lift-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
associate-/l/N/A
frac-timesN/A
sqr-neg-revN/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites99.7%
Taylor expanded in y around inf
associate-*r/N/A
lower-/.f64N/A
mul-1-negN/A
lower-neg.f6428.5
Applied rewrites28.5%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(let* ((t_0 (- (+ y x))))
(if (<= y -7e-6)
(/ (/ (- y) x) t_0)
(if (<= y 1350000.0) (/ y (fma x x x)) (/ (/ (- x) y) t_0)))))assert(x < y);
double code(double x, double y) {
double t_0 = -(y + x);
double tmp;
if (y <= -7e-6) {
tmp = (-y / x) / t_0;
} else if (y <= 1350000.0) {
tmp = y / fma(x, x, x);
} else {
tmp = (-x / y) / t_0;
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) t_0 = Float64(-Float64(y + x)) tmp = 0.0 if (y <= -7e-6) tmp = Float64(Float64(Float64(-y) / x) / t_0); elseif (y <= 1350000.0) tmp = Float64(y / fma(x, x, x)); else tmp = Float64(Float64(Float64(-x) / y) / t_0); end return tmp end
NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := Block[{t$95$0 = (-N[(y + x), $MachinePrecision])}, If[LessEqual[y, -7e-6], N[(N[((-y) / x), $MachinePrecision] / t$95$0), $MachinePrecision], If[LessEqual[y, 1350000.0], N[(y / N[(x * x + x), $MachinePrecision]), $MachinePrecision], N[(N[((-x) / y), $MachinePrecision] / t$95$0), $MachinePrecision]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_0 := -\left(y + x\right)\\
\mathbf{if}\;y \leq -7 \cdot 10^{-6}:\\
\;\;\;\;\frac{\frac{-y}{x}}{t\_0}\\
\mathbf{elif}\;y \leq 1350000:\\
\;\;\;\;\frac{y}{\mathsf{fma}\left(x, x, x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{-x}{y}}{t\_0}\\
\end{array}
\end{array}
if y < -6.99999999999999989e-6Initial program 63.7%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-*r/N/A
lift-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
+-commutativeN/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
lower-/.f64N/A
+-commutativeN/A
Applied rewrites99.7%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-timesN/A
associate-*r/N/A
lift-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
associate-/l/N/A
frac-timesN/A
sqr-neg-revN/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites99.8%
Taylor expanded in x around inf
associate-*r/N/A
lower-/.f64N/A
mul-1-negN/A
lower-neg.f6430.7
Applied rewrites30.7%
if -6.99999999999999989e-6 < y < 1.35e6Initial program 75.0%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6475.7
Applied rewrites75.7%
if 1.35e6 < y Initial program 62.3%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.7
Applied rewrites99.7%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-*r/N/A
lift-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
+-commutativeN/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
lower-/.f64N/A
+-commutativeN/A
Applied rewrites99.8%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-timesN/A
associate-*r/N/A
lift-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
associate-/l/N/A
frac-timesN/A
sqr-neg-revN/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites99.8%
Taylor expanded in y around inf
associate-*r/N/A
lower-/.f64N/A
mul-1-negN/A
lower-neg.f6479.2
Applied rewrites79.2%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= y -7e-6) (/ (/ y x) x) (if (<= y 1350000.0) (/ y (fma x x x)) (/ (/ (- x) y) (- (+ y x))))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (y <= -7e-6) {
tmp = (y / x) / x;
} else if (y <= 1350000.0) {
tmp = y / fma(x, x, x);
} else {
tmp = (-x / y) / -(y + x);
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (y <= -7e-6) tmp = Float64(Float64(y / x) / x); elseif (y <= 1350000.0) tmp = Float64(y / fma(x, x, x)); else tmp = Float64(Float64(Float64(-x) / y) / Float64(-Float64(y + x))); end return tmp end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[y, -7e-6], N[(N[(y / x), $MachinePrecision] / x), $MachinePrecision], If[LessEqual[y, 1350000.0], N[(y / N[(x * x + x), $MachinePrecision]), $MachinePrecision], N[(N[((-x) / y), $MachinePrecision] / (-N[(y + x), $MachinePrecision])), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -7 \cdot 10^{-6}:\\
\;\;\;\;\frac{\frac{y}{x}}{x}\\
\mathbf{elif}\;y \leq 1350000:\\
\;\;\;\;\frac{y}{\mathsf{fma}\left(x, x, x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{-x}{y}}{-\left(y + x\right)}\\
\end{array}
\end{array}
if y < -6.99999999999999989e-6Initial program 63.7%
Taylor expanded in x around inf
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6430.1
Applied rewrites30.1%
if -6.99999999999999989e-6 < y < 1.35e6Initial program 75.0%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6475.7
Applied rewrites75.7%
if 1.35e6 < y Initial program 62.3%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.7
Applied rewrites99.7%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-*r/N/A
lift-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
+-commutativeN/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
lower-/.f64N/A
+-commutativeN/A
Applied rewrites99.8%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-timesN/A
associate-*r/N/A
lift-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
associate-/l/N/A
frac-timesN/A
sqr-neg-revN/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites99.8%
Taylor expanded in y around inf
associate-*r/N/A
lower-/.f64N/A
mul-1-negN/A
lower-neg.f6479.2
Applied rewrites79.2%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= y -7e-6) (/ (/ y x) x) (if (<= y 1350000.0) (/ y (fma x x x)) (/ (/ x y) y))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (y <= -7e-6) {
tmp = (y / x) / x;
} else if (y <= 1350000.0) {
tmp = y / fma(x, x, x);
} else {
tmp = (x / y) / y;
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (y <= -7e-6) tmp = Float64(Float64(y / x) / x); elseif (y <= 1350000.0) tmp = Float64(y / fma(x, x, x)); else tmp = Float64(Float64(x / y) / y); end return tmp end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[y, -7e-6], N[(N[(y / x), $MachinePrecision] / x), $MachinePrecision], If[LessEqual[y, 1350000.0], N[(y / N[(x * x + x), $MachinePrecision]), $MachinePrecision], N[(N[(x / y), $MachinePrecision] / y), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -7 \cdot 10^{-6}:\\
\;\;\;\;\frac{\frac{y}{x}}{x}\\
\mathbf{elif}\;y \leq 1350000:\\
\;\;\;\;\frac{y}{\mathsf{fma}\left(x, x, x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{y}}{y}\\
\end{array}
\end{array}
if y < -6.99999999999999989e-6Initial program 63.7%
Taylor expanded in x around inf
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6430.1
Applied rewrites30.1%
if -6.99999999999999989e-6 < y < 1.35e6Initial program 75.0%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6475.7
Applied rewrites75.7%
if 1.35e6 < y Initial program 62.3%
Taylor expanded in y around inf
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6478.8
Applied rewrites78.8%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= y 1350000.0) (/ y (fma x x x)) (/ (/ x y) y)))
assert(x < y);
double code(double x, double y) {
double tmp;
if (y <= 1350000.0) {
tmp = y / fma(x, x, x);
} else {
tmp = (x / y) / y;
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (y <= 1350000.0) tmp = Float64(y / fma(x, x, x)); else tmp = Float64(Float64(x / y) / y); end return tmp end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[y, 1350000.0], N[(y / N[(x * x + x), $MachinePrecision]), $MachinePrecision], N[(N[(x / y), $MachinePrecision] / y), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 1350000:\\
\;\;\;\;\frac{y}{\mathsf{fma}\left(x, x, x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{y}}{y}\\
\end{array}
\end{array}
if y < 1.35e6Initial program 70.4%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6451.8
Applied rewrites51.8%
if 1.35e6 < y Initial program 62.3%
Taylor expanded in y around inf
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6478.8
Applied rewrites78.8%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= x -9e-47) (/ y (fma x x x)) (/ x (fma y y y))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -9e-47) {
tmp = y / fma(x, x, x);
} else {
tmp = x / fma(y, y, y);
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (x <= -9e-47) tmp = Float64(y / fma(x, x, x)); else tmp = Float64(x / fma(y, y, y)); end return tmp end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[x, -9e-47], N[(y / N[(x * x + x), $MachinePrecision]), $MachinePrecision], N[(x / N[(y * y + y), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -9 \cdot 10^{-47}:\\
\;\;\;\;\frac{y}{\mathsf{fma}\left(x, x, x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{\mathsf{fma}\left(y, y, y\right)}\\
\end{array}
\end{array}
if x < -9e-47Initial program 63.2%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6458.5
Applied rewrites58.5%
if -9e-47 < x Initial program 70.2%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6460.7
Applied rewrites60.7%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= x -1100000000.0) (/ y (* x x)) (/ x (fma y y y))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -1100000000.0) {
tmp = y / (x * x);
} else {
tmp = x / fma(y, y, y);
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (x <= -1100000000.0) tmp = Float64(y / Float64(x * x)); else tmp = Float64(x / fma(y, y, y)); end return tmp end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[x, -1100000000.0], N[(y / N[(x * x), $MachinePrecision]), $MachinePrecision], N[(x / N[(y * y + y), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -1100000000:\\
\;\;\;\;\frac{y}{x \cdot x}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{\mathsf{fma}\left(y, y, y\right)}\\
\end{array}
\end{array}
if x < -1.1e9Initial program 55.3%
Taylor expanded in x around inf
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6478.2
Applied rewrites78.2%
Applied rewrites66.7%
if -1.1e9 < x Initial program 71.8%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6461.6
Applied rewrites61.6%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= y 1350000.0) (/ y (* x x)) (/ x (* y y))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (y <= 1350000.0) {
tmp = y / (x * x);
} else {
tmp = x / (y * y);
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: tmp
if (y <= 1350000.0d0) then
tmp = y / (x * x)
else
tmp = x / (y * y)
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double tmp;
if (y <= 1350000.0) {
tmp = y / (x * x);
} else {
tmp = x / (y * y);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): tmp = 0 if y <= 1350000.0: tmp = y / (x * x) else: tmp = x / (y * y) return tmp
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (y <= 1350000.0) tmp = Float64(y / Float64(x * x)); else tmp = Float64(x / Float64(y * y)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
tmp = 0.0;
if (y <= 1350000.0)
tmp = y / (x * x);
else
tmp = x / (y * y);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[y, 1350000.0], N[(y / N[(x * x), $MachinePrecision]), $MachinePrecision], N[(x / N[(y * y), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 1350000:\\
\;\;\;\;\frac{y}{x \cdot x}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{y \cdot y}\\
\end{array}
\end{array}
if y < 1.35e6Initial program 70.4%
Taylor expanded in x around inf
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6443.3
Applied rewrites43.3%
Applied rewrites37.9%
if 1.35e6 < y Initial program 62.3%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.7
Applied rewrites99.7%
Taylor expanded in y around inf
lower-/.f64N/A
unpow2N/A
lower-*.f6473.2
Applied rewrites73.2%
Final simplification47.5%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (/ x (* y y)))
assert(x < y);
double code(double x, double y) {
return x / (y * y);
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = x / (y * y)
end function
assert x < y;
public static double code(double x, double y) {
return x / (y * y);
}
[x, y] = sort([x, y]) def code(x, y): return x / (y * y)
x, y = sort([x, y]) function code(x, y) return Float64(x / Float64(y * y)) end
x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y)
tmp = x / (y * y);
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := N[(x / N[(y * y), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\frac{x}{y \cdot y}
\end{array}
Initial program 68.2%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
Taylor expanded in y around inf
lower-/.f64N/A
unpow2N/A
lower-*.f6441.9
Applied rewrites41.9%
Final simplification41.9%
(FPCore (x y) :precision binary64 (/ (/ (/ x (+ (+ y 1.0) x)) (+ y x)) (/ 1.0 (/ y (+ y x)))))
double code(double x, double y) {
return ((x / ((y + 1.0) + x)) / (y + x)) / (1.0 / (y / (y + x)));
}
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = ((x / ((y + 1.0d0) + x)) / (y + x)) / (1.0d0 / (y / (y + x)))
end function
public static double code(double x, double y) {
return ((x / ((y + 1.0) + x)) / (y + x)) / (1.0 / (y / (y + x)));
}
def code(x, y): return ((x / ((y + 1.0) + x)) / (y + x)) / (1.0 / (y / (y + x)))
function code(x, y) return Float64(Float64(Float64(x / Float64(Float64(y + 1.0) + x)) / Float64(y + x)) / Float64(1.0 / Float64(y / Float64(y + x)))) end
function tmp = code(x, y) tmp = ((x / ((y + 1.0) + x)) / (y + x)) / (1.0 / (y / (y + x))); end
code[x_, y_] := N[(N[(N[(x / N[(N[(y + 1.0), $MachinePrecision] + x), $MachinePrecision]), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision] / N[(1.0 / N[(y / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\frac{\frac{x}{\left(y + 1\right) + x}}{y + x}}{\frac{1}{\frac{y}{y + x}}}
\end{array}
herbie shell --seed 2024329
(FPCore (x y)
:name "Numeric.SpecFunctions:incompleteBetaApprox from math-functions-0.1.5.2, A"
:precision binary64
:alt
(! :herbie-platform default (/ (/ (/ x (+ (+ y 1) x)) (+ y x)) (/ 1 (/ y (+ y x)))))
(/ (* x y) (* (* (+ x y) (+ x y)) (+ (+ x y) 1.0))))