Numeric.SpecFunctions:incompleteBetaApprox from math-functions-0.1.5.2, A

Percentage Accurate: 68.5% → 99.8%

Time: 9.9s

Alternatives: 13

Speedup: 1.6×

Specification

Math

\[\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} \]

FPCore

(FPCore (x y)
 :precision binary64
 (/ (* x y) (* (* (+ x y) (+ x y)) (+ (+ x y) 1.0))))

C

double code(double x, double y) {
	return (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0));
}

Fortran

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

Java

public static double code(double x, double y) {
	return (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0));
}

Python

def code(x, y):
	return (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0))

Julia

function code(x, y)
	return Float64(Float64(x * y) / Float64(Float64(Float64(x + y) * Float64(x + y)) * Float64(Float64(x + y) + 1.0)))
end

MATLAB

function tmp = code(x, y)
	tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0));
end

Wolfram

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]

Initial Program: 68.5% accurate, 1.0× speedup

Math

\[\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} \]

FPCore

(FPCore (x y)
 :precision binary64
 (/ (* x y) (* (* (+ x y) (+ x y)) (+ (+ x y) 1.0))))

C

double code(double x, double y) {
	return (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0));
}

Fortran

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

Java

public static double code(double x, double y) {
	return (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0));
}

Python

def code(x, y):
	return (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0))

Julia

function code(x, y)
	return Float64(Float64(x * y) / Float64(Float64(Float64(x + y) * Float64(x + y)) * Float64(Float64(x + y) + 1.0)))
end

MATLAB

function tmp = code(x, y)
	tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0));
end

Wolfram

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]

Alternative 1: 99.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \frac{\frac{x}{x + y} \cdot \frac{y}{\left(x + y\right) + 1}}{x + y} \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
 :precision binary64
 (/ (* (/ x (+ x y)) (/ y (+ (+ x y) 1.0))) (+ x y)))

C

assert(x < y);
double code(double x, double y) {
	return ((x / (x + y)) * (y / ((x + y) + 1.0))) / (x + y);
}

Fortran

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 / (x + y)) * (y / ((x + y) + 1.0d0))) / (x + y)
end function

Java

assert x < y;
public static double code(double x, double y) {
	return ((x / (x + y)) * (y / ((x + y) + 1.0))) / (x + y);
}

Python

[x, y] = sort([x, y])
def code(x, y):
	return ((x / (x + y)) * (y / ((x + y) + 1.0))) / (x + y)

Julia

x, y = sort([x, y])
function code(x, y)
	return Float64(Float64(Float64(x / Float64(x + y)) * Float64(y / Float64(Float64(x + y) + 1.0))) / Float64(x + y))
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y)
	tmp = ((x / (x + y)) * (y / ((x + y) + 1.0))) / (x + y);
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := N[(N[(N[(x / N[(x + y), $MachinePrecision]), $MachinePrecision] * N[(y / N[(N[(x + y), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(x + y), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 71.9%

   \[\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-/.f64 N/A

      \[\leadsto \color{blue}{\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

   2. lift-*.f64 N/A

      \[\leadsto \frac{\color{blue}{x \cdot y}}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]

   3. lift-*.f64 N/A

      \[\leadsto \frac{x \cdot y}{\color{blue}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

   4. times-frac N/A

      \[\leadsto \color{blue}{\frac{x}{\left(x + y\right) \cdot \left(x + y\right)} \cdot \frac{y}{\left(x + y\right) + 1}} \]

   5. *-commutative N/A

      \[\leadsto \color{blue}{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{\left(x + y\right) \cdot \left(x + y\right)}} \]

   6. lift-*.f64 N/A

      \[\leadsto \frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{\color{blue}{\left(x + y\right) \cdot \left(x + y\right)}} \]

   7. associate-/r* N/A

      \[\leadsto \frac{y}{\left(x + y\right) + 1} \cdot \color{blue}{\frac{\frac{x}{x + y}}{x + y}} \]

   8. associate-*r/ N/A

      \[\leadsto \color{blue}{\frac{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{x + y}}{x + y}} \]

   9. lower-/.f64 N/A

      \[\leadsto \color{blue}{\frac{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{x + y}}{x + y}} \]

4. Applied rewrites 99.8%

   \[\leadsto \color{blue}{\frac{\frac{y}{1 + \left(y + x\right)} \cdot \frac{x}{y + x}}{y + x}} \]

5. Final simplification 99.8%

   \[\leadsto \frac{\frac{x}{x + y} \cdot \frac{y}{\left(x + y\right) + 1}}{x + y} \]
6. Add Preprocessing

Alternative 2: 93.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;x \leq -6.4 \cdot 10^{+75}:\\ \;\;\;\;\frac{\frac{y}{x}}{x + y}\\ \mathbf{elif}\;x \leq -1.9 \cdot 10^{-16}:\\ \;\;\;\;\frac{x}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \cdot y\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{\left(1 + y\right) \cdot \left(x + y\right)} \cdot \frac{x}{x + y}\\ \end{array} \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
 :precision binary64
 (if (<= x -6.4e+75)
   (/ (/ y x) (+ x y))
   (if (<= x -1.9e-16)
     (* (/ x (* (* (+ x y) (+ x y)) (+ (+ x y) 1.0))) y)
     (* (/ y (* (+ 1.0 y) (+ x y))) (/ x (+ x y))))))

C

assert(x < y);
double code(double x, double y) {
	double tmp;
	if (x <= -6.4e+75) {
		tmp = (y / x) / (x + y);
	} else if (x <= -1.9e-16) {
		tmp = (x / (((x + y) * (x + y)) * ((x + y) + 1.0))) * y;
	} else {
		tmp = (y / ((1.0 + y) * (x + y))) * (x / (x + y));
	}
	return tmp;
}

Fortran

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.4d+75)) then
        tmp = (y / x) / (x + y)
    else if (x <= (-1.9d-16)) then
        tmp = (x / (((x + y) * (x + y)) * ((x + y) + 1.0d0))) * y
    else
        tmp = (y / ((1.0d0 + y) * (x + y))) * (x / (x + y))
    end if
    code = tmp
end function

Java

assert x < y;
public static double code(double x, double y) {
	double tmp;
	if (x <= -6.4e+75) {
		tmp = (y / x) / (x + y);
	} else if (x <= -1.9e-16) {
		tmp = (x / (((x + y) * (x + y)) * ((x + y) + 1.0))) * y;
	} else {
		tmp = (y / ((1.0 + y) * (x + y))) * (x / (x + y));
	}
	return tmp;
}

Python

[x, y] = sort([x, y])
def code(x, y):
	tmp = 0
	if x <= -6.4e+75:
		tmp = (y / x) / (x + y)
	elif x <= -1.9e-16:
		tmp = (x / (((x + y) * (x + y)) * ((x + y) + 1.0))) * y
	else:
		tmp = (y / ((1.0 + y) * (x + y))) * (x / (x + y))
	return tmp

Julia

x, y = sort([x, y])
function code(x, y)
	tmp = 0.0
	if (x <= -6.4e+75)
		tmp = Float64(Float64(y / x) / Float64(x + y));
	elseif (x <= -1.9e-16)
		tmp = Float64(Float64(x / Float64(Float64(Float64(x + y) * Float64(x + y)) * Float64(Float64(x + y) + 1.0))) * y);
	else
		tmp = Float64(Float64(y / Float64(Float64(1.0 + y) * Float64(x + y))) * Float64(x / Float64(x + y)));
	end
	return tmp
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -6.4e+75)
		tmp = (y / x) / (x + y);
	elseif (x <= -1.9e-16)
		tmp = (x / (((x + y) * (x + y)) * ((x + y) + 1.0))) * y;
	else
		tmp = (y / ((1.0 + y) * (x + y))) * (x / (x + y));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := If[LessEqual[x, -6.4e+75], N[(N[(y / x), $MachinePrecision] / N[(x + y), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -1.9e-16], N[(N[(x / N[(N[(N[(x + y), $MachinePrecision] * N[(x + y), $MachinePrecision]), $MachinePrecision] * N[(N[(x + y), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision], N[(N[(y / N[(N[(1.0 + y), $MachinePrecision] * N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(x / N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -6.39999999999999969e75

   1. Initial program 58.5%

      \[\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{x \cdot y}}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]

      3. lift-*.f64 N/A

         \[\leadsto \frac{x \cdot y}{\color{blue}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      4. times-frac N/A

         \[\leadsto \color{blue}{\frac{x}{\left(x + y\right) \cdot \left(x + y\right)} \cdot \frac{y}{\left(x + y\right) + 1}} \]

      5. *-commutative N/A

         \[\leadsto \color{blue}{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{\left(x + y\right) \cdot \left(x + y\right)}} \]

      6. lift-*.f64 N/A

         \[\leadsto \frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{\color{blue}{\left(x + y\right) \cdot \left(x + y\right)}} \]

      7. associate-/r* N/A

         \[\leadsto \frac{y}{\left(x + y\right) + 1} \cdot \color{blue}{\frac{\frac{x}{x + y}}{x + y}} \]

      8. associate-*r/ N/A

         \[\leadsto \color{blue}{\frac{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{x + y}}{x + y}} \]

      9. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{x + y}}{x + y}} \]

   4. Applied rewrites 99.8%

      \[\leadsto \color{blue}{\frac{\frac{y}{1 + \left(y + x\right)} \cdot \frac{x}{y + x}}{y + x}} \]

   5. Taylor expanded in x around inf

      \[\leadsto \frac{\color{blue}{\frac{y}{x}}}{y + x} \]
   6. Step-by-step derivation

      1. lower-/.f64 88.1

         \[\leadsto \frac{\color{blue}{\frac{y}{x}}}{y + x} \]

   7. Applied rewrites 88.1%

      \[\leadsto \frac{\color{blue}{\frac{y}{x}}}{y + x} \]

   if -6.39999999999999969e75 < x < -1.90000000000000006e-16

   1. Initial program 89.9%

      \[\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{x \cdot y}}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]

      3. *-commutative N/A

         \[\leadsto \frac{\color{blue}{y \cdot x}}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]

      4. associate-/l* N/A

         \[\leadsto \color{blue}{y \cdot \frac{x}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      5. lower-*.f64 N/A

         \[\leadsto \color{blue}{y \cdot \frac{x}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      6. lower-/.f64 94.6

         \[\leadsto y \cdot \color{blue}{\frac{x}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      7. lift-*.f64 N/A

         \[\leadsto y \cdot \frac{x}{\color{blue}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      8. *-commutative N/A

         \[\leadsto y \cdot \frac{x}{\color{blue}{\left(\left(x + y\right) + 1\right) \cdot \left(\left(x + y\right) \cdot \left(x + y\right)\right)}} \]

      9. lower-*.f64 94.6

         \[\leadsto y \cdot \frac{x}{\color{blue}{\left(\left(x + y\right) + 1\right) \cdot \left(\left(x + y\right) \cdot \left(x + y\right)\right)}} \]

      10. lift-+.f64 N/A

          \[\leadsto y \cdot \frac{x}{\color{blue}{\left(\left(x + y\right) + 1\right)} \cdot \left(\left(x + y\right) \cdot \left(x + y\right)\right)} \]

      11. +-commutative N/A

          \[\leadsto y \cdot \frac{x}{\color{blue}{\left(1 + \left(x + y\right)\right)} \cdot \left(\left(x + y\right) \cdot \left(x + y\right)\right)} \]

      12. lower-+.f64 94.6

          \[\leadsto y \cdot \frac{x}{\color{blue}{\left(1 + \left(x + y\right)\right)} \cdot \left(\left(x + y\right) \cdot \left(x + y\right)\right)} \]

      13. lift-+.f64 N/A

          \[\leadsto y \cdot \frac{x}{\left(1 + \color{blue}{\left(x + y\right)}\right) \cdot \left(\left(x + y\right) \cdot \left(x + y\right)\right)} \]

      14. +-commutative N/A

          \[\leadsto y \cdot \frac{x}{\left(1 + \color{blue}{\left(y + x\right)}\right) \cdot \left(\left(x + y\right) \cdot \left(x + y\right)\right)} \]

      15. lower-+.f64 94.6

          \[\leadsto y \cdot \frac{x}{\left(1 + \color{blue}{\left(y + x\right)}\right) \cdot \left(\left(x + y\right) \cdot \left(x + y\right)\right)} \]

      16. lift-+.f64 N/A

          \[\leadsto y \cdot \frac{x}{\left(1 + \left(y + x\right)\right) \cdot \left(\color{blue}{\left(x + y\right)} \cdot \left(x + y\right)\right)} \]

      17. +-commutative N/A

          \[\leadsto y \cdot \frac{x}{\left(1 + \left(y + x\right)\right) \cdot \left(\color{blue}{\left(y + x\right)} \cdot \left(x + y\right)\right)} \]

      18. lower-+.f64 94.6

          \[\leadsto y \cdot \frac{x}{\left(1 + \left(y + x\right)\right) \cdot \left(\color{blue}{\left(y + x\right)} \cdot \left(x + y\right)\right)} \]

      19. lift-+.f64 N/A

          \[\leadsto y \cdot \frac{x}{\left(1 + \left(y + x\right)\right) \cdot \left(\left(y + x\right) \cdot \color{blue}{\left(x + y\right)}\right)} \]

      20. +-commutative N/A

          \[\leadsto y \cdot \frac{x}{\left(1 + \left(y + x\right)\right) \cdot \left(\left(y + x\right) \cdot \color{blue}{\left(y + x\right)}\right)} \]

      21. lower-+.f64 94.6

          \[\leadsto y \cdot \frac{x}{\left(1 + \left(y + x\right)\right) \cdot \left(\left(y + x\right) \cdot \color{blue}{\left(y + x\right)}\right)} \]

   4. Applied rewrites 94.6%

      \[\leadsto \color{blue}{y \cdot \frac{x}{\left(1 + \left(y + x\right)\right) \cdot \left(\left(y + x\right) \cdot \left(y + x\right)\right)}} \]

   if -1.90000000000000006e-16 < x

   1. Initial program 72.6%

      \[\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{x \cdot y}}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]

      3. *-commutative N/A

         \[\leadsto \frac{\color{blue}{y \cdot x}}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]

      4. lift-*.f64 N/A

         \[\leadsto \frac{y \cdot x}{\color{blue}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      5. lift-*.f64 N/A

         \[\leadsto \frac{y \cdot x}{\color{blue}{\left(\left(x + y\right) \cdot \left(x + y\right)\right)} \cdot \left(\left(x + y\right) + 1\right)} \]

      6. associate-*l* N/A

         \[\leadsto \frac{y \cdot x}{\color{blue}{\left(x + y\right) \cdot \left(\left(x + y\right) \cdot \left(\left(x + y\right) + 1\right)\right)}} \]

      7. *-commutative N/A

         \[\leadsto \frac{y \cdot x}{\color{blue}{\left(\left(x + y\right) \cdot \left(\left(x + y\right) + 1\right)\right) \cdot \left(x + y\right)}} \]

      8. times-frac N/A

         \[\leadsto \color{blue}{\frac{y}{\left(x + y\right) \cdot \left(\left(x + y\right) + 1\right)} \cdot \frac{x}{x + y}} \]

      9. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{y}{\left(x + y\right) \cdot \left(\left(x + y\right) + 1\right)} \cdot \frac{x}{x + y}} \]

      10. lower-/.f64 N/A

          \[\leadsto \color{blue}{\frac{y}{\left(x + y\right) \cdot \left(\left(x + y\right) + 1\right)}} \cdot \frac{x}{x + y} \]

      11. *-commutative N/A

          \[\leadsto \frac{y}{\color{blue}{\left(\left(x + y\right) + 1\right) \cdot \left(x + y\right)}} \cdot \frac{x}{x + y} \]

      12. lower-*.f64 N/A

          \[\leadsto \frac{y}{\color{blue}{\left(\left(x + y\right) + 1\right) \cdot \left(x + y\right)}} \cdot \frac{x}{x + y} \]

      13. lift-+.f64 N/A

          \[\leadsto \frac{y}{\color{blue}{\left(\left(x + y\right) + 1\right)} \cdot \left(x + y\right)} \cdot \frac{x}{x + y} \]

      14. +-commutative N/A

          \[\leadsto \frac{y}{\color{blue}{\left(1 + \left(x + y\right)\right)} \cdot \left(x + y\right)} \cdot \frac{x}{x + y} \]

      15. lower-+.f64 N/A

          \[\leadsto \frac{y}{\color{blue}{\left(1 + \left(x + y\right)\right)} \cdot \left(x + y\right)} \cdot \frac{x}{x + y} \]

      16. lift-+.f64 N/A

          \[\leadsto \frac{y}{\left(1 + \color{blue}{\left(x + y\right)}\right) \cdot \left(x + y\right)} \cdot \frac{x}{x + y} \]

      17. +-commutative N/A

          \[\leadsto \frac{y}{\left(1 + \color{blue}{\left(y + x\right)}\right) \cdot \left(x + y\right)} \cdot \frac{x}{x + y} \]

      18. lower-+.f64 N/A

          \[\leadsto \frac{y}{\left(1 + \color{blue}{\left(y + x\right)}\right) \cdot \left(x + y\right)} \cdot \frac{x}{x + y} \]

      19. lift-+.f64 N/A

          \[\leadsto \frac{y}{\left(1 + \left(y + x\right)\right) \cdot \color{blue}{\left(x + y\right)}} \cdot \frac{x}{x + y} \]

      20. +-commutative N/A

          \[\leadsto \frac{y}{\left(1 + \left(y + x\right)\right) \cdot \color{blue}{\left(y + x\right)}} \cdot \frac{x}{x + y} \]

      21. lower-+.f64 N/A

          \[\leadsto \frac{y}{\left(1 + \left(y + x\right)\right) \cdot \color{blue}{\left(y + x\right)}} \cdot \frac{x}{x + y} \]

      22. lower-/.f64 95.9

          \[\leadsto \frac{y}{\left(1 + \left(y + x\right)\right) \cdot \left(y + x\right)} \cdot \color{blue}{\frac{x}{x + y}} \]

      23. lift-+.f64 N/A

          \[\leadsto \frac{y}{\left(1 + \left(y + x\right)\right) \cdot \left(y + x\right)} \cdot \frac{x}{\color{blue}{x + y}} \]

      24. +-commutative N/A

          \[\leadsto \frac{y}{\left(1 + \left(y + x\right)\right) \cdot \left(y + x\right)} \cdot \frac{x}{\color{blue}{y + x}} \]

   4. Applied rewrites 95.9%

      \[\leadsto \color{blue}{\frac{y}{\left(1 + \left(y + x\right)\right) \cdot \left(y + x\right)} \cdot \frac{x}{y + x}} \]

   5. Taylor expanded in x around 0

      \[\leadsto \frac{y}{\color{blue}{\left(1 + y\right)} \cdot \left(y + x\right)} \cdot \frac{x}{y + x} \]
   6. Step-by-step derivation

      1. lower-+.f64 81.0

         \[\leadsto \frac{y}{\color{blue}{\left(1 + y\right)} \cdot \left(y + x\right)} \cdot \frac{x}{y + x} \]

   7. Applied rewrites 81.0%

      \[\leadsto \frac{y}{\color{blue}{\left(1 + y\right)} \cdot \left(y + x\right)} \cdot \frac{x}{y + x} \]
3. Recombined 3 regimes into one program.

4. Final simplification 83.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -6.4 \cdot 10^{+75}:\\ \;\;\;\;\frac{\frac{y}{x}}{x + y}\\ \mathbf{elif}\;x \leq -1.9 \cdot 10^{-16}:\\ \;\;\;\;\frac{x}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \cdot y\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{\left(1 + y\right) \cdot \left(x + y\right)} \cdot \frac{x}{x + y}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 91.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq 1.25 \cdot 10^{-157}:\\ \;\;\;\;\frac{\frac{y}{x + 1}}{x + y}\\ \mathbf{elif}\;y \leq 1.9 \cdot 10^{+101}:\\ \;\;\;\;\frac{y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \cdot x\\ \mathbf{else}:\\ \;\;\;\;\frac{1 \cdot \frac{x}{x + y}}{x + y}\\ \end{array} \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
 :precision binary64
 (if (<= y 1.25e-157)
   (/ (/ y (+ x 1.0)) (+ x y))
   (if (<= y 1.9e+101)
     (* (/ y (* (* (+ x y) (+ x y)) (+ (+ x y) 1.0))) x)
     (/ (* 1.0 (/ x (+ x y))) (+ x y)))))

C

assert(x < y);
double code(double x, double y) {
	double tmp;
	if (y <= 1.25e-157) {
		tmp = (y / (x + 1.0)) / (x + y);
	} else if (y <= 1.9e+101) {
		tmp = (y / (((x + y) * (x + y)) * ((x + y) + 1.0))) * x;
	} else {
		tmp = (1.0 * (x / (x + y))) / (x + y);
	}
	return tmp;
}

Fortran

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 <= 1.25d-157) then
        tmp = (y / (x + 1.0d0)) / (x + y)
    else if (y <= 1.9d+101) then
        tmp = (y / (((x + y) * (x + y)) * ((x + y) + 1.0d0))) * x
    else
        tmp = (1.0d0 * (x / (x + y))) / (x + y)
    end if
    code = tmp
end function

Java

assert x < y;
public static double code(double x, double y) {
	double tmp;
	if (y <= 1.25e-157) {
		tmp = (y / (x + 1.0)) / (x + y);
	} else if (y <= 1.9e+101) {
		tmp = (y / (((x + y) * (x + y)) * ((x + y) + 1.0))) * x;
	} else {
		tmp = (1.0 * (x / (x + y))) / (x + y);
	}
	return tmp;
}

Python

[x, y] = sort([x, y])
def code(x, y):
	tmp = 0
	if y <= 1.25e-157:
		tmp = (y / (x + 1.0)) / (x + y)
	elif y <= 1.9e+101:
		tmp = (y / (((x + y) * (x + y)) * ((x + y) + 1.0))) * x
	else:
		tmp = (1.0 * (x / (x + y))) / (x + y)
	return tmp

Julia

x, y = sort([x, y])
function code(x, y)
	tmp = 0.0
	if (y <= 1.25e-157)
		tmp = Float64(Float64(y / Float64(x + 1.0)) / Float64(x + y));
	elseif (y <= 1.9e+101)
		tmp = Float64(Float64(y / Float64(Float64(Float64(x + y) * Float64(x + y)) * Float64(Float64(x + y) + 1.0))) * x);
	else
		tmp = Float64(Float64(1.0 * Float64(x / Float64(x + y))) / Float64(x + y));
	end
	return tmp
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= 1.25e-157)
		tmp = (y / (x + 1.0)) / (x + y);
	elseif (y <= 1.9e+101)
		tmp = (y / (((x + y) * (x + y)) * ((x + y) + 1.0))) * x;
	else
		tmp = (1.0 * (x / (x + y))) / (x + y);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := If[LessEqual[y, 1.25e-157], N[(N[(y / N[(x + 1.0), $MachinePrecision]), $MachinePrecision] / N[(x + y), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.9e+101], N[(N[(y / N[(N[(N[(x + y), $MachinePrecision] * N[(x + y), $MachinePrecision]), $MachinePrecision] * N[(N[(x + y), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision], N[(N[(1.0 * N[(x / N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(x + y), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < 1.25000000000000005e-157

   1. Initial program 71.5%

      \[\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{x \cdot y}}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]

      3. lift-*.f64 N/A

         \[\leadsto \frac{x \cdot y}{\color{blue}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      4. times-frac N/A

         \[\leadsto \color{blue}{\frac{x}{\left(x + y\right) \cdot \left(x + y\right)} \cdot \frac{y}{\left(x + y\right) + 1}} \]

      5. *-commutative N/A

         \[\leadsto \color{blue}{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{\left(x + y\right) \cdot \left(x + y\right)}} \]

      6. lift-*.f64 N/A

         \[\leadsto \frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{\color{blue}{\left(x + y\right) \cdot \left(x + y\right)}} \]

      7. associate-/r* N/A

         \[\leadsto \frac{y}{\left(x + y\right) + 1} \cdot \color{blue}{\frac{\frac{x}{x + y}}{x + y}} \]

      8. associate-*r/ N/A

         \[\leadsto \color{blue}{\frac{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{x + y}}{x + y}} \]

      9. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{x + y}}{x + y}} \]

   4. Applied rewrites 99.9%

      \[\leadsto \color{blue}{\frac{\frac{y}{1 + \left(y + x\right)} \cdot \frac{x}{y + x}}{y + x}} \]

   5. Taylor expanded in y around 0

      \[\leadsto \frac{\color{blue}{\frac{y}{1 + x}}}{y + x} \]
   6. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \frac{\color{blue}{\frac{y}{1 + x}}}{y + x} \]

      2. lower-+.f64 64.2

         \[\leadsto \frac{\frac{y}{\color{blue}{1 + x}}}{y + x} \]

   7. Applied rewrites 64.2%

      \[\leadsto \frac{\color{blue}{\frac{y}{1 + x}}}{y + x} \]

   if 1.25000000000000005e-157 < y < 1.8999999999999999e101

   1. Initial program 79.4%

      \[\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{x \cdot y}}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]

      3. associate-/l* N/A

         \[\leadsto \color{blue}{x \cdot \frac{y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      4. *-commutative N/A

         \[\leadsto \color{blue}{\frac{y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \cdot x} \]

      5. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \cdot x} \]

   4. Applied rewrites 89.6%

      \[\leadsto \color{blue}{\frac{y}{\left(1 + \left(y + x\right)\right) \cdot \left(\left(y + x\right) \cdot \left(y + x\right)\right)} \cdot x} \]

   if 1.8999999999999999e101 < y

   1. Initial program 63.7%

      \[\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{x \cdot y}}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]

      3. lift-*.f64 N/A

         \[\leadsto \frac{x \cdot y}{\color{blue}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      4. times-frac N/A

         \[\leadsto \color{blue}{\frac{x}{\left(x + y\right) \cdot \left(x + y\right)} \cdot \frac{y}{\left(x + y\right) + 1}} \]

      5. *-commutative N/A

         \[\leadsto \color{blue}{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{\left(x + y\right) \cdot \left(x + y\right)}} \]

      6. lift-*.f64 N/A

         \[\leadsto \frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{\color{blue}{\left(x + y\right) \cdot \left(x + y\right)}} \]

      7. associate-/r* N/A

         \[\leadsto \frac{y}{\left(x + y\right) + 1} \cdot \color{blue}{\frac{\frac{x}{x + y}}{x + y}} \]

      8. associate-*r/ N/A

         \[\leadsto \color{blue}{\frac{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{x + y}}{x + y}} \]

      9. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{x + y}}{x + y}} \]

   4. Applied rewrites 99.9%

      \[\leadsto \color{blue}{\frac{\frac{y}{1 + \left(y + x\right)} \cdot \frac{x}{y + x}}{y + x}} \]

   5. Taylor expanded in y around inf

      \[\leadsto \frac{\color{blue}{1} \cdot \frac{x}{y + x}}{y + x} \]
   6. Step-by-step derivation

   7. Applied rewrites 89.4%

      \[\leadsto \frac{\color{blue}{1} \cdot \frac{x}{y + x}}{y + x} \]
3. Recombined 3 regimes into one program.

4. Final simplification 72.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 1.25 \cdot 10^{-157}:\\ \;\;\;\;\frac{\frac{y}{x + 1}}{x + y}\\ \mathbf{elif}\;y \leq 1.9 \cdot 10^{+101}:\\ \;\;\;\;\frac{y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \cdot x\\ \mathbf{else}:\\ \;\;\;\;\frac{1 \cdot \frac{x}{x + y}}{x + y}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 90.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq 1.3 \cdot 10^{-167}:\\ \;\;\;\;\frac{\frac{y}{x + 1}}{x + y}\\ \mathbf{elif}\;y \leq 9.6 \cdot 10^{+63}:\\ \;\;\;\;\frac{x}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \cdot y\\ \mathbf{else}:\\ \;\;\;\;\frac{1 \cdot \frac{x}{x + y}}{x + y}\\ \end{array} \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
 :precision binary64
 (if (<= y 1.3e-167)
   (/ (/ y (+ x 1.0)) (+ x y))
   (if (<= y 9.6e+63)
     (* (/ x (* (* (+ x y) (+ x y)) (+ (+ x y) 1.0))) y)
     (/ (* 1.0 (/ x (+ x y))) (+ x y)))))

C

assert(x < y);
double code(double x, double y) {
	double tmp;
	if (y <= 1.3e-167) {
		tmp = (y / (x + 1.0)) / (x + y);
	} else if (y <= 9.6e+63) {
		tmp = (x / (((x + y) * (x + y)) * ((x + y) + 1.0))) * y;
	} else {
		tmp = (1.0 * (x / (x + y))) / (x + y);
	}
	return tmp;
}

Fortran

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 <= 1.3d-167) then
        tmp = (y / (x + 1.0d0)) / (x + y)
    else if (y <= 9.6d+63) then
        tmp = (x / (((x + y) * (x + y)) * ((x + y) + 1.0d0))) * y
    else
        tmp = (1.0d0 * (x / (x + y))) / (x + y)
    end if
    code = tmp
end function

Java

assert x < y;
public static double code(double x, double y) {
	double tmp;
	if (y <= 1.3e-167) {
		tmp = (y / (x + 1.0)) / (x + y);
	} else if (y <= 9.6e+63) {
		tmp = (x / (((x + y) * (x + y)) * ((x + y) + 1.0))) * y;
	} else {
		tmp = (1.0 * (x / (x + y))) / (x + y);
	}
	return tmp;
}

Python

[x, y] = sort([x, y])
def code(x, y):
	tmp = 0
	if y <= 1.3e-167:
		tmp = (y / (x + 1.0)) / (x + y)
	elif y <= 9.6e+63:
		tmp = (x / (((x + y) * (x + y)) * ((x + y) + 1.0))) * y
	else:
		tmp = (1.0 * (x / (x + y))) / (x + y)
	return tmp

Julia

x, y = sort([x, y])
function code(x, y)
	tmp = 0.0
	if (y <= 1.3e-167)
		tmp = Float64(Float64(y / Float64(x + 1.0)) / Float64(x + y));
	elseif (y <= 9.6e+63)
		tmp = Float64(Float64(x / Float64(Float64(Float64(x + y) * Float64(x + y)) * Float64(Float64(x + y) + 1.0))) * y);
	else
		tmp = Float64(Float64(1.0 * Float64(x / Float64(x + y))) / Float64(x + y));
	end
	return tmp
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= 1.3e-167)
		tmp = (y / (x + 1.0)) / (x + y);
	elseif (y <= 9.6e+63)
		tmp = (x / (((x + y) * (x + y)) * ((x + y) + 1.0))) * y;
	else
		tmp = (1.0 * (x / (x + y))) / (x + y);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := If[LessEqual[y, 1.3e-167], N[(N[(y / N[(x + 1.0), $MachinePrecision]), $MachinePrecision] / N[(x + y), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 9.6e+63], N[(N[(x / N[(N[(N[(x + y), $MachinePrecision] * N[(x + y), $MachinePrecision]), $MachinePrecision] * N[(N[(x + y), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision], N[(N[(1.0 * N[(x / N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(x + y), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < 1.2999999999999999e-167

   1. Initial program 71.6%

      \[\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{x \cdot y}}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]

      3. lift-*.f64 N/A

         \[\leadsto \frac{x \cdot y}{\color{blue}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      4. times-frac N/A

         \[\leadsto \color{blue}{\frac{x}{\left(x + y\right) \cdot \left(x + y\right)} \cdot \frac{y}{\left(x + y\right) + 1}} \]

      5. *-commutative N/A

         \[\leadsto \color{blue}{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{\left(x + y\right) \cdot \left(x + y\right)}} \]

      6. lift-*.f64 N/A

         \[\leadsto \frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{\color{blue}{\left(x + y\right) \cdot \left(x + y\right)}} \]

      7. associate-/r* N/A

         \[\leadsto \frac{y}{\left(x + y\right) + 1} \cdot \color{blue}{\frac{\frac{x}{x + y}}{x + y}} \]

      8. associate-*r/ N/A

         \[\leadsto \color{blue}{\frac{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{x + y}}{x + y}} \]

      9. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{x + y}}{x + y}} \]

   4. Applied rewrites 99.8%

      \[\leadsto \color{blue}{\frac{\frac{y}{1 + \left(y + x\right)} \cdot \frac{x}{y + x}}{y + x}} \]

   5. Taylor expanded in y around 0

      \[\leadsto \frac{\color{blue}{\frac{y}{1 + x}}}{y + x} \]
   6. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \frac{\color{blue}{\frac{y}{1 + x}}}{y + x} \]

      2. lower-+.f64 64.1

         \[\leadsto \frac{\frac{y}{\color{blue}{1 + x}}}{y + x} \]

   7. Applied rewrites 64.1%

      \[\leadsto \frac{\color{blue}{\frac{y}{1 + x}}}{y + x} \]

   if 1.2999999999999999e-167 < y < 9.6e63

   1. Initial program 79.3%

      \[\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{x \cdot y}}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]

      3. *-commutative N/A

         \[\leadsto \frac{\color{blue}{y \cdot x}}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]

      4. associate-/l* N/A

         \[\leadsto \color{blue}{y \cdot \frac{x}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      5. lower-*.f64 N/A

         \[\leadsto \color{blue}{y \cdot \frac{x}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      6. lower-/.f64 89.6

         \[\leadsto y \cdot \color{blue}{\frac{x}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      7. lift-*.f64 N/A

         \[\leadsto y \cdot \frac{x}{\color{blue}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      8. *-commutative N/A

         \[\leadsto y \cdot \frac{x}{\color{blue}{\left(\left(x + y\right) + 1\right) \cdot \left(\left(x + y\right) \cdot \left(x + y\right)\right)}} \]

      9. lower-*.f64 89.6

         \[\leadsto y \cdot \frac{x}{\color{blue}{\left(\left(x + y\right) + 1\right) \cdot \left(\left(x + y\right) \cdot \left(x + y\right)\right)}} \]

      10. lift-+.f64 N/A

          \[\leadsto y \cdot \frac{x}{\color{blue}{\left(\left(x + y\right) + 1\right)} \cdot \left(\left(x + y\right) \cdot \left(x + y\right)\right)} \]

      11. +-commutative N/A

          \[\leadsto y \cdot \frac{x}{\color{blue}{\left(1 + \left(x + y\right)\right)} \cdot \left(\left(x + y\right) \cdot \left(x + y\right)\right)} \]

      12. lower-+.f64 89.6

          \[\leadsto y \cdot \frac{x}{\color{blue}{\left(1 + \left(x + y\right)\right)} \cdot \left(\left(x + y\right) \cdot \left(x + y\right)\right)} \]

      13. lift-+.f64 N/A

          \[\leadsto y \cdot \frac{x}{\left(1 + \color{blue}{\left(x + y\right)}\right) \cdot \left(\left(x + y\right) \cdot \left(x + y\right)\right)} \]

      14. +-commutative N/A

          \[\leadsto y \cdot \frac{x}{\left(1 + \color{blue}{\left(y + x\right)}\right) \cdot \left(\left(x + y\right) \cdot \left(x + y\right)\right)} \]

      15. lower-+.f64 89.6

          \[\leadsto y \cdot \frac{x}{\left(1 + \color{blue}{\left(y + x\right)}\right) \cdot \left(\left(x + y\right) \cdot \left(x + y\right)\right)} \]

      16. lift-+.f64 N/A

          \[\leadsto y \cdot \frac{x}{\left(1 + \left(y + x\right)\right) \cdot \left(\color{blue}{\left(x + y\right)} \cdot \left(x + y\right)\right)} \]

      17. +-commutative N/A

          \[\leadsto y \cdot \frac{x}{\left(1 + \left(y + x\right)\right) \cdot \left(\color{blue}{\left(y + x\right)} \cdot \left(x + y\right)\right)} \]

      18. lower-+.f64 89.6

          \[\leadsto y \cdot \frac{x}{\left(1 + \left(y + x\right)\right) \cdot \left(\color{blue}{\left(y + x\right)} \cdot \left(x + y\right)\right)} \]

      19. lift-+.f64 N/A

          \[\leadsto y \cdot \frac{x}{\left(1 + \left(y + x\right)\right) \cdot \left(\left(y + x\right) \cdot \color{blue}{\left(x + y\right)}\right)} \]

      20. +-commutative N/A

          \[\leadsto y \cdot \frac{x}{\left(1 + \left(y + x\right)\right) \cdot \left(\left(y + x\right) \cdot \color{blue}{\left(y + x\right)}\right)} \]

      21. lower-+.f64 89.6

          \[\leadsto y \cdot \frac{x}{\left(1 + \left(y + x\right)\right) \cdot \left(\left(y + x\right) \cdot \color{blue}{\left(y + x\right)}\right)} \]

   4. Applied rewrites 89.6%

      \[\leadsto \color{blue}{y \cdot \frac{x}{\left(1 + \left(y + x\right)\right) \cdot \left(\left(y + x\right) \cdot \left(y + x\right)\right)}} \]

   if 9.6e63 < y

   1. Initial program 65.7%

      \[\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{x \cdot y}}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]

      3. lift-*.f64 N/A

         \[\leadsto \frac{x \cdot y}{\color{blue}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      4. times-frac N/A

         \[\leadsto \color{blue}{\frac{x}{\left(x + y\right) \cdot \left(x + y\right)} \cdot \frac{y}{\left(x + y\right) + 1}} \]

      5. *-commutative N/A

         \[\leadsto \color{blue}{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{\left(x + y\right) \cdot \left(x + y\right)}} \]

      6. lift-*.f64 N/A

         \[\leadsto \frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{\color{blue}{\left(x + y\right) \cdot \left(x + y\right)}} \]

      7. associate-/r* N/A

         \[\leadsto \frac{y}{\left(x + y\right) + 1} \cdot \color{blue}{\frac{\frac{x}{x + y}}{x + y}} \]

      8. associate-*r/ N/A

         \[\leadsto \color{blue}{\frac{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{x + y}}{x + y}} \]

      9. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{x + y}}{x + y}} \]

   4. Applied rewrites 99.9%

      \[\leadsto \color{blue}{\frac{\frac{y}{1 + \left(y + x\right)} \cdot \frac{x}{y + x}}{y + x}} \]

   5. Taylor expanded in y around inf

      \[\leadsto \frac{\color{blue}{1} \cdot \frac{x}{y + x}}{y + x} \]
   6. Step-by-step derivation

   7. Applied rewrites 87.2%

      \[\leadsto \frac{\color{blue}{1} \cdot \frac{x}{y + x}}{y + x} \]
3. Recombined 3 regimes into one program.

4. Final simplification 72.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 1.3 \cdot 10^{-167}:\\ \;\;\;\;\frac{\frac{y}{x + 1}}{x + y}\\ \mathbf{elif}\;y \leq 9.6 \cdot 10^{+63}:\\ \;\;\;\;\frac{x}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \cdot y\\ \mathbf{else}:\\ \;\;\;\;\frac{1 \cdot \frac{x}{x + y}}{x + y}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 94.9% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq -3300000:\\ \;\;\;\;\frac{\frac{y}{x}}{x}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{\left(\left(x + y\right) + 1\right) \cdot \left(x + y\right)} \cdot \frac{x}{x + y}\\ \end{array} \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
 :precision binary64
 (if (<= y -3300000.0)
   (/ (/ y x) x)
   (* (/ y (* (+ (+ x y) 1.0) (+ x y))) (/ x (+ x y)))))

C

assert(x < y);
double code(double x, double y) {
	double tmp;
	if (y <= -3300000.0) {
		tmp = (y / x) / x;
	} else {
		tmp = (y / (((x + y) + 1.0) * (x + y))) * (x / (x + y));
	}
	return tmp;
}

Fortran

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 <= (-3300000.0d0)) then
        tmp = (y / x) / x
    else
        tmp = (y / (((x + y) + 1.0d0) * (x + y))) * (x / (x + y))
    end if
    code = tmp
end function

Java

assert x < y;
public static double code(double x, double y) {
	double tmp;
	if (y <= -3300000.0) {
		tmp = (y / x) / x;
	} else {
		tmp = (y / (((x + y) + 1.0) * (x + y))) * (x / (x + y));
	}
	return tmp;
}

Python

[x, y] = sort([x, y])
def code(x, y):
	tmp = 0
	if y <= -3300000.0:
		tmp = (y / x) / x
	else:
		tmp = (y / (((x + y) + 1.0) * (x + y))) * (x / (x + y))
	return tmp

Julia

x, y = sort([x, y])
function code(x, y)
	tmp = 0.0
	if (y <= -3300000.0)
		tmp = Float64(Float64(y / x) / x);
	else
		tmp = Float64(Float64(y / Float64(Float64(Float64(x + y) + 1.0) * Float64(x + y))) * Float64(x / Float64(x + y)));
	end
	return tmp
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -3300000.0)
		tmp = (y / x) / x;
	else
		tmp = (y / (((x + y) + 1.0) * (x + y))) * (x / (x + y));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := If[LessEqual[y, -3300000.0], N[(N[(y / x), $MachinePrecision] / x), $MachinePrecision], N[(N[(y / N[(N[(N[(x + y), $MachinePrecision] + 1.0), $MachinePrecision] * N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(x / N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -3.3e6

   1. Initial program 58.3%

      \[\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{x \cdot y}}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]

      3. lift-*.f64 N/A

         \[\leadsto \frac{x \cdot y}{\color{blue}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      4. times-frac N/A

         \[\leadsto \color{blue}{\frac{x}{\left(x + y\right) \cdot \left(x + y\right)} \cdot \frac{y}{\left(x + y\right) + 1}} \]

      5. *-commutative N/A

         \[\leadsto \color{blue}{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{\left(x + y\right) \cdot \left(x + y\right)}} \]

      6. lift-*.f64 N/A

         \[\leadsto \frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{\color{blue}{\left(x + y\right) \cdot \left(x + y\right)}} \]

      7. associate-/r* N/A

         \[\leadsto \frac{y}{\left(x + y\right) + 1} \cdot \color{blue}{\frac{\frac{x}{x + y}}{x + y}} \]

      8. associate-*r/ N/A

         \[\leadsto \color{blue}{\frac{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{x + y}}{x + y}} \]

      9. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{x + y}}{x + y}} \]

   4. Applied rewrites 99.8%

      \[\leadsto \color{blue}{\frac{\frac{y}{1 + \left(y + x\right)} \cdot \frac{x}{y + x}}{y + x}} \]

   5. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{y}{{x}^{2}}} \]
   6. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{y}{{x}^{2}}} \]

      2. unpow2 N/A

         \[\leadsto \frac{y}{\color{blue}{x \cdot x}} \]

      3. lower-*.f64 25.5

         \[\leadsto \frac{y}{\color{blue}{x \cdot x}} \]

   7. Applied rewrites 25.5%

      \[\leadsto \color{blue}{\frac{y}{x \cdot x}} \]
   8. Step-by-step derivation

   9. Applied rewrites 31.7%

      \[\leadsto \frac{\frac{y}{x}}{\color{blue}{x}} \]

   if -3.3e6 < y

   1. Initial program 76.4%

      \[\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{x \cdot y}}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]

      3. *-commutative N/A

         \[\leadsto \frac{\color{blue}{y \cdot x}}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]

      4. lift-*.f64 N/A

         \[\leadsto \frac{y \cdot x}{\color{blue}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      5. lift-*.f64 N/A

         \[\leadsto \frac{y \cdot x}{\color{blue}{\left(\left(x + y\right) \cdot \left(x + y\right)\right)} \cdot \left(\left(x + y\right) + 1\right)} \]

      6. associate-*l* N/A

         \[\leadsto \frac{y \cdot x}{\color{blue}{\left(x + y\right) \cdot \left(\left(x + y\right) \cdot \left(\left(x + y\right) + 1\right)\right)}} \]

      7. *-commutative N/A

         \[\leadsto \frac{y \cdot x}{\color{blue}{\left(\left(x + y\right) \cdot \left(\left(x + y\right) + 1\right)\right) \cdot \left(x + y\right)}} \]

      8. times-frac N/A

         \[\leadsto \color{blue}{\frac{y}{\left(x + y\right) \cdot \left(\left(x + y\right) + 1\right)} \cdot \frac{x}{x + y}} \]

      9. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{y}{\left(x + y\right) \cdot \left(\left(x + y\right) + 1\right)} \cdot \frac{x}{x + y}} \]

      10. lower-/.f64 N/A

          \[\leadsto \color{blue}{\frac{y}{\left(x + y\right) \cdot \left(\left(x + y\right) + 1\right)}} \cdot \frac{x}{x + y} \]

      11. *-commutative N/A

          \[\leadsto \frac{y}{\color{blue}{\left(\left(x + y\right) + 1\right) \cdot \left(x + y\right)}} \cdot \frac{x}{x + y} \]

      12. lower-*.f64 N/A

          \[\leadsto \frac{y}{\color{blue}{\left(\left(x + y\right) + 1\right) \cdot \left(x + y\right)}} \cdot \frac{x}{x + y} \]

      13. lift-+.f64 N/A

          \[\leadsto \frac{y}{\color{blue}{\left(\left(x + y\right) + 1\right)} \cdot \left(x + y\right)} \cdot \frac{x}{x + y} \]

      14. +-commutative N/A

          \[\leadsto \frac{y}{\color{blue}{\left(1 + \left(x + y\right)\right)} \cdot \left(x + y\right)} \cdot \frac{x}{x + y} \]

      15. lower-+.f64 N/A

          \[\leadsto \frac{y}{\color{blue}{\left(1 + \left(x + y\right)\right)} \cdot \left(x + y\right)} \cdot \frac{x}{x + y} \]

      16. lift-+.f64 N/A

          \[\leadsto \frac{y}{\left(1 + \color{blue}{\left(x + y\right)}\right) \cdot \left(x + y\right)} \cdot \frac{x}{x + y} \]

      17. +-commutative N/A

          \[\leadsto \frac{y}{\left(1 + \color{blue}{\left(y + x\right)}\right) \cdot \left(x + y\right)} \cdot \frac{x}{x + y} \]

      18. lower-+.f64 N/A

          \[\leadsto \frac{y}{\left(1 + \color{blue}{\left(y + x\right)}\right) \cdot \left(x + y\right)} \cdot \frac{x}{x + y} \]

      19. lift-+.f64 N/A

          \[\leadsto \frac{y}{\left(1 + \left(y + x\right)\right) \cdot \color{blue}{\left(x + y\right)}} \cdot \frac{x}{x + y} \]

      20. +-commutative N/A

          \[\leadsto \frac{y}{\left(1 + \left(y + x\right)\right) \cdot \color{blue}{\left(y + x\right)}} \cdot \frac{x}{x + y} \]

      21. lower-+.f64 N/A

          \[\leadsto \frac{y}{\left(1 + \left(y + x\right)\right) \cdot \color{blue}{\left(y + x\right)}} \cdot \frac{x}{x + y} \]

      22. lower-/.f64 97.3

          \[\leadsto \frac{y}{\left(1 + \left(y + x\right)\right) \cdot \left(y + x\right)} \cdot \color{blue}{\frac{x}{x + y}} \]

      23. lift-+.f64 N/A

          \[\leadsto \frac{y}{\left(1 + \left(y + x\right)\right) \cdot \left(y + x\right)} \cdot \frac{x}{\color{blue}{x + y}} \]

      24. +-commutative N/A

          \[\leadsto \frac{y}{\left(1 + \left(y + x\right)\right) \cdot \left(y + x\right)} \cdot \frac{x}{\color{blue}{y + x}} \]

   4. Applied rewrites 97.3%

      \[\leadsto \color{blue}{\frac{y}{\left(1 + \left(y + x\right)\right) \cdot \left(y + x\right)} \cdot \frac{x}{y + x}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 80.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -3300000:\\ \;\;\;\;\frac{\frac{y}{x}}{x}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{\left(\left(x + y\right) + 1\right) \cdot \left(x + y\right)} \cdot \frac{x}{x + y}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 81.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq -1.25:\\ \;\;\;\;\frac{\frac{y}{x}}{x}\\ \mathbf{elif}\;y \leq 2.35 \cdot 10^{-58}:\\ \;\;\;\;\frac{y}{\mathsf{fma}\left(x, x, x\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{x}{1 + y}}{x + y}\\ \end{array} \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
 :precision binary64
 (if (<= y -1.25)
   (/ (/ y x) x)
   (if (<= y 2.35e-58) (/ y (fma x x x)) (/ (/ x (+ 1.0 y)) (+ x y)))))

C

assert(x < y);
double code(double x, double y) {
	double tmp;
	if (y <= -1.25) {
		tmp = (y / x) / x;
	} else if (y <= 2.35e-58) {
		tmp = y / fma(x, x, x);
	} else {
		tmp = (x / (1.0 + y)) / (x + y);
	}
	return tmp;
}

Julia

x, y = sort([x, y])
function code(x, y)
	tmp = 0.0
	if (y <= -1.25)
		tmp = Float64(Float64(y / x) / x);
	elseif (y <= 2.35e-58)
		tmp = Float64(y / fma(x, x, x));
	else
		tmp = Float64(Float64(x / Float64(1.0 + y)) / Float64(x + y));
	end
	return tmp
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := If[LessEqual[y, -1.25], N[(N[(y / x), $MachinePrecision] / x), $MachinePrecision], If[LessEqual[y, 2.35e-58], N[(y / N[(x * x + x), $MachinePrecision]), $MachinePrecision], N[(N[(x / N[(1.0 + y), $MachinePrecision]), $MachinePrecision] / N[(x + y), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -1.25

   1. Initial program 58.3%

      \[\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{x \cdot y}}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]

      3. lift-*.f64 N/A

         \[\leadsto \frac{x \cdot y}{\color{blue}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      4. times-frac N/A

         \[\leadsto \color{blue}{\frac{x}{\left(x + y\right) \cdot \left(x + y\right)} \cdot \frac{y}{\left(x + y\right) + 1}} \]

      5. *-commutative N/A

         \[\leadsto \color{blue}{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{\left(x + y\right) \cdot \left(x + y\right)}} \]

      6. lift-*.f64 N/A

         \[\leadsto \frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{\color{blue}{\left(x + y\right) \cdot \left(x + y\right)}} \]

      7. associate-/r* N/A

         \[\leadsto \frac{y}{\left(x + y\right) + 1} \cdot \color{blue}{\frac{\frac{x}{x + y}}{x + y}} \]

      8. associate-*r/ N/A

         \[\leadsto \color{blue}{\frac{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{x + y}}{x + y}} \]

      9. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{x + y}}{x + y}} \]

   4. Applied rewrites 99.8%

      \[\leadsto \color{blue}{\frac{\frac{y}{1 + \left(y + x\right)} \cdot \frac{x}{y + x}}{y + x}} \]

   5. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{y}{{x}^{2}}} \]
   6. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{y}{{x}^{2}}} \]

      2. unpow2 N/A

         \[\leadsto \frac{y}{\color{blue}{x \cdot x}} \]

      3. lower-*.f64 25.5

         \[\leadsto \frac{y}{\color{blue}{x \cdot x}} \]

   7. Applied rewrites 25.5%

      \[\leadsto \color{blue}{\frac{y}{x \cdot x}} \]
   8. Step-by-step derivation

   9. Applied rewrites 31.7%

      \[\leadsto \frac{\frac{y}{x}}{\color{blue}{x}} \]

   if -1.25 < y < 2.34999999999999997e-58

   1. Initial program 81.3%

      \[\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\frac{y}{x \cdot \left(1 + x\right)}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{y}{x \cdot \left(1 + x\right)}} \]

      2. +-commutative N/A

         \[\leadsto \frac{y}{x \cdot \color{blue}{\left(x + 1\right)}} \]

      3. distribute-lft-in N/A

         \[\leadsto \frac{y}{\color{blue}{x \cdot x + x \cdot 1}} \]

      4. *-rgt-identity N/A

         \[\leadsto \frac{y}{x \cdot x + \color{blue}{x}} \]

      5. lower-fma.f64 82.0

         \[\leadsto \frac{y}{\color{blue}{\mathsf{fma}\left(x, x, x\right)}} \]

   5. Applied rewrites 82.0%

      \[\leadsto \color{blue}{\frac{y}{\mathsf{fma}\left(x, x, x\right)}} \]

   if 2.34999999999999997e-58 < y

   1. Initial program 67.6%

      \[\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{x \cdot y}}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]

      3. lift-*.f64 N/A

         \[\leadsto \frac{x \cdot y}{\color{blue}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      4. times-frac N/A

         \[\leadsto \color{blue}{\frac{x}{\left(x + y\right) \cdot \left(x + y\right)} \cdot \frac{y}{\left(x + y\right) + 1}} \]

      5. *-commutative N/A

         \[\leadsto \color{blue}{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{\left(x + y\right) \cdot \left(x + y\right)}} \]

      6. lift-*.f64 N/A

         \[\leadsto \frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{\color{blue}{\left(x + y\right) \cdot \left(x + y\right)}} \]

      7. associate-/r* N/A

         \[\leadsto \frac{y}{\left(x + y\right) + 1} \cdot \color{blue}{\frac{\frac{x}{x + y}}{x + y}} \]

      8. associate-*r/ N/A

         \[\leadsto \color{blue}{\frac{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{x + y}}{x + y}} \]

      9. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{x + y}}{x + y}} \]

   4. Applied rewrites 99.8%

      \[\leadsto \color{blue}{\frac{\frac{y}{1 + \left(y + x\right)} \cdot \frac{x}{y + x}}{y + x}} \]

   5. Taylor expanded in x around 0

      \[\leadsto \frac{\color{blue}{\frac{x}{1 + y}}}{y + x} \]
   6. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \frac{\color{blue}{\frac{x}{1 + y}}}{y + x} \]

      2. lower-+.f64 75.3

         \[\leadsto \frac{\frac{x}{\color{blue}{1 + y}}}{y + x} \]

   7. Applied rewrites 75.3%

      \[\leadsto \frac{\color{blue}{\frac{x}{1 + y}}}{y + x} \]
3. Recombined 3 regimes into one program.

4. Final simplification 67.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.25:\\ \;\;\;\;\frac{\frac{y}{x}}{x}\\ \mathbf{elif}\;y \leq 2.35 \cdot 10^{-58}:\\ \;\;\;\;\frac{y}{\mathsf{fma}\left(x, x, x\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{x}{1 + y}}{x + y}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 81.8% accurate, 1.1× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq 2.35 \cdot 10^{-58}:\\ \;\;\;\;\frac{\frac{y}{x + 1}}{x + y}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{x}{1 + y}}{x + y}\\ \end{array} \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
 :precision binary64
 (if (<= y 2.35e-58) (/ (/ y (+ x 1.0)) (+ x y)) (/ (/ x (+ 1.0 y)) (+ x y))))

C

assert(x < y);
double code(double x, double y) {
	double tmp;
	if (y <= 2.35e-58) {
		tmp = (y / (x + 1.0)) / (x + y);
	} else {
		tmp = (x / (1.0 + y)) / (x + y);
	}
	return tmp;
}

Fortran

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.35d-58) then
        tmp = (y / (x + 1.0d0)) / (x + y)
    else
        tmp = (x / (1.0d0 + y)) / (x + y)
    end if
    code = tmp
end function

Java

assert x < y;
public static double code(double x, double y) {
	double tmp;
	if (y <= 2.35e-58) {
		tmp = (y / (x + 1.0)) / (x + y);
	} else {
		tmp = (x / (1.0 + y)) / (x + y);
	}
	return tmp;
}

Python

[x, y] = sort([x, y])
def code(x, y):
	tmp = 0
	if y <= 2.35e-58:
		tmp = (y / (x + 1.0)) / (x + y)
	else:
		tmp = (x / (1.0 + y)) / (x + y)
	return tmp

Julia

x, y = sort([x, y])
function code(x, y)
	tmp = 0.0
	if (y <= 2.35e-58)
		tmp = Float64(Float64(y / Float64(x + 1.0)) / Float64(x + y));
	else
		tmp = Float64(Float64(x / Float64(1.0 + y)) / Float64(x + y));
	end
	return tmp
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= 2.35e-58)
		tmp = (y / (x + 1.0)) / (x + y);
	else
		tmp = (x / (1.0 + y)) / (x + y);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := If[LessEqual[y, 2.35e-58], N[(N[(y / N[(x + 1.0), $MachinePrecision]), $MachinePrecision] / N[(x + y), $MachinePrecision]), $MachinePrecision], N[(N[(x / N[(1.0 + y), $MachinePrecision]), $MachinePrecision] / N[(x + y), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 2.34999999999999997e-58

   1. Initial program 73.5%

      \[\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{x \cdot y}}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]

      3. lift-*.f64 N/A

         \[\leadsto \frac{x \cdot y}{\color{blue}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      4. times-frac N/A

         \[\leadsto \color{blue}{\frac{x}{\left(x + y\right) \cdot \left(x + y\right)} \cdot \frac{y}{\left(x + y\right) + 1}} \]

      5. *-commutative N/A

         \[\leadsto \color{blue}{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{\left(x + y\right) \cdot \left(x + y\right)}} \]

      6. lift-*.f64 N/A

         \[\leadsto \frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{\color{blue}{\left(x + y\right) \cdot \left(x + y\right)}} \]

      7. associate-/r* N/A

         \[\leadsto \frac{y}{\left(x + y\right) + 1} \cdot \color{blue}{\frac{\frac{x}{x + y}}{x + y}} \]

      8. associate-*r/ N/A

         \[\leadsto \color{blue}{\frac{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{x + y}}{x + y}} \]

      9. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{x + y}}{x + y}} \]

   4. Applied rewrites 99.8%

      \[\leadsto \color{blue}{\frac{\frac{y}{1 + \left(y + x\right)} \cdot \frac{x}{y + x}}{y + x}} \]

   5. Taylor expanded in y around 0

      \[\leadsto \frac{\color{blue}{\frac{y}{1 + x}}}{y + x} \]
   6. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \frac{\color{blue}{\frac{y}{1 + x}}}{y + x} \]

      2. lower-+.f64 65.1

         \[\leadsto \frac{\frac{y}{\color{blue}{1 + x}}}{y + x} \]

   7. Applied rewrites 65.1%

      \[\leadsto \frac{\color{blue}{\frac{y}{1 + x}}}{y + x} \]

   if 2.34999999999999997e-58 < y

   1. Initial program 67.6%

      \[\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{x \cdot y}}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]

      3. lift-*.f64 N/A

         \[\leadsto \frac{x \cdot y}{\color{blue}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      4. times-frac N/A

         \[\leadsto \color{blue}{\frac{x}{\left(x + y\right) \cdot \left(x + y\right)} \cdot \frac{y}{\left(x + y\right) + 1}} \]

      5. *-commutative N/A

         \[\leadsto \color{blue}{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{\left(x + y\right) \cdot \left(x + y\right)}} \]

      6. lift-*.f64 N/A

         \[\leadsto \frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{\color{blue}{\left(x + y\right) \cdot \left(x + y\right)}} \]

      7. associate-/r* N/A

         \[\leadsto \frac{y}{\left(x + y\right) + 1} \cdot \color{blue}{\frac{\frac{x}{x + y}}{x + y}} \]

      8. associate-*r/ N/A

         \[\leadsto \color{blue}{\frac{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{x + y}}{x + y}} \]

      9. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{x + y}}{x + y}} \]

   4. Applied rewrites 99.8%

      \[\leadsto \color{blue}{\frac{\frac{y}{1 + \left(y + x\right)} \cdot \frac{x}{y + x}}{y + x}} \]

   5. Taylor expanded in x around 0

      \[\leadsto \frac{\color{blue}{\frac{x}{1 + y}}}{y + x} \]
   6. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \frac{\color{blue}{\frac{x}{1 + y}}}{y + x} \]

      2. lower-+.f64 75.3

         \[\leadsto \frac{\frac{x}{\color{blue}{1 + y}}}{y + x} \]

   7. Applied rewrites 75.3%

      \[\leadsto \frac{\color{blue}{\frac{x}{1 + y}}}{y + x} \]
3. Recombined 2 regimes into one program.

4. Final simplification 67.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 2.35 \cdot 10^{-58}:\\ \;\;\;\;\frac{\frac{y}{x + 1}}{x + y}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{x}{1 + y}}{x + y}\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 79.6% accurate, 1.3× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq -1.25:\\ \;\;\;\;\frac{\frac{y}{x}}{x}\\ \mathbf{elif}\;y \leq 2.55 \cdot 10^{-58}:\\ \;\;\;\;\frac{y}{\mathsf{fma}\left(x, x, x\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{\mathsf{fma}\left(y, y, y\right)}\\ \end{array} \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
 :precision binary64
 (if (<= y -1.25)
   (/ (/ y x) x)
   (if (<= y 2.55e-58) (/ y (fma x x x)) (/ x (fma y y y)))))

C

assert(x < y);
double code(double x, double y) {
	double tmp;
	if (y <= -1.25) {
		tmp = (y / x) / x;
	} else if (y <= 2.55e-58) {
		tmp = y / fma(x, x, x);
	} else {
		tmp = x / fma(y, y, y);
	}
	return tmp;
}

Julia

x, y = sort([x, y])
function code(x, y)
	tmp = 0.0
	if (y <= -1.25)
		tmp = Float64(Float64(y / x) / x);
	elseif (y <= 2.55e-58)
		tmp = Float64(y / fma(x, x, x));
	else
		tmp = Float64(x / fma(y, y, y));
	end
	return tmp
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := If[LessEqual[y, -1.25], N[(N[(y / x), $MachinePrecision] / x), $MachinePrecision], If[LessEqual[y, 2.55e-58], N[(y / N[(x * x + x), $MachinePrecision]), $MachinePrecision], N[(x / N[(y * y + y), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -1.25

   1. Initial program 58.3%

      \[\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{x \cdot y}}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]

      3. lift-*.f64 N/A

         \[\leadsto \frac{x \cdot y}{\color{blue}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      4. times-frac N/A

         \[\leadsto \color{blue}{\frac{x}{\left(x + y\right) \cdot \left(x + y\right)} \cdot \frac{y}{\left(x + y\right) + 1}} \]

      5. *-commutative N/A

         \[\leadsto \color{blue}{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{\left(x + y\right) \cdot \left(x + y\right)}} \]

      6. lift-*.f64 N/A

         \[\leadsto \frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{\color{blue}{\left(x + y\right) \cdot \left(x + y\right)}} \]

      7. associate-/r* N/A

         \[\leadsto \frac{y}{\left(x + y\right) + 1} \cdot \color{blue}{\frac{\frac{x}{x + y}}{x + y}} \]

      8. associate-*r/ N/A

         \[\leadsto \color{blue}{\frac{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{x + y}}{x + y}} \]

      9. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{x + y}}{x + y}} \]

   4. Applied rewrites 99.8%

      \[\leadsto \color{blue}{\frac{\frac{y}{1 + \left(y + x\right)} \cdot \frac{x}{y + x}}{y + x}} \]

   5. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{y}{{x}^{2}}} \]
   6. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{y}{{x}^{2}}} \]

      2. unpow2 N/A

         \[\leadsto \frac{y}{\color{blue}{x \cdot x}} \]

      3. lower-*.f64 25.5

         \[\leadsto \frac{y}{\color{blue}{x \cdot x}} \]

   7. Applied rewrites 25.5%

      \[\leadsto \color{blue}{\frac{y}{x \cdot x}} \]
   8. Step-by-step derivation

   9. Applied rewrites 31.7%

      \[\leadsto \frac{\frac{y}{x}}{\color{blue}{x}} \]

   if -1.25 < y < 2.55e-58

   1. Initial program 81.3%

      \[\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\frac{y}{x \cdot \left(1 + x\right)}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{y}{x \cdot \left(1 + x\right)}} \]

      2. +-commutative N/A

         \[\leadsto \frac{y}{x \cdot \color{blue}{\left(x + 1\right)}} \]

      3. distribute-lft-in N/A

         \[\leadsto \frac{y}{\color{blue}{x \cdot x + x \cdot 1}} \]

      4. *-rgt-identity N/A

         \[\leadsto \frac{y}{x \cdot x + \color{blue}{x}} \]

      5. lower-fma.f64 82.0

         \[\leadsto \frac{y}{\color{blue}{\mathsf{fma}\left(x, x, x\right)}} \]

   5. Applied rewrites 82.0%

      \[\leadsto \color{blue}{\frac{y}{\mathsf{fma}\left(x, x, x\right)}} \]

   if 2.55e-58 < y

   1. Initial program 67.6%

      \[\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{x}{y \cdot \left(1 + y\right)}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x}{y \cdot \left(1 + y\right)}} \]

      2. +-commutative N/A

         \[\leadsto \frac{x}{y \cdot \color{blue}{\left(y + 1\right)}} \]

      3. distribute-lft-in N/A

         \[\leadsto \frac{x}{\color{blue}{y \cdot y + y \cdot 1}} \]

      4. *-rgt-identity N/A

         \[\leadsto \frac{x}{y \cdot y + \color{blue}{y}} \]

      5. lower-fma.f64 75.7

         \[\leadsto \frac{x}{\color{blue}{\mathsf{fma}\left(y, y, y\right)}} \]

   5. Applied rewrites 75.7%

      \[\leadsto \color{blue}{\frac{x}{\mathsf{fma}\left(y, y, y\right)}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 9: 66.0% accurate, 1.3× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq 3.8 \cdot 10^{-157}:\\ \;\;\;\;\frac{y}{x \cdot x}\\ \mathbf{elif}\;y \leq 1:\\ \;\;\;\;\frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y \cdot y}\\ \end{array} \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
 :precision binary64
 (if (<= y 3.8e-157) (/ y (* x x)) (if (<= y 1.0) (/ x y) (/ x (* y y)))))

C

assert(x < y);
double code(double x, double y) {
	double tmp;
	if (y <= 3.8e-157) {
		tmp = y / (x * x);
	} else if (y <= 1.0) {
		tmp = x / y;
	} else {
		tmp = x / (y * y);
	}
	return tmp;
}

Fortran

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 <= 3.8d-157) then
        tmp = y / (x * x)
    else if (y <= 1.0d0) then
        tmp = x / y
    else
        tmp = x / (y * y)
    end if
    code = tmp
end function

Java

assert x < y;
public static double code(double x, double y) {
	double tmp;
	if (y <= 3.8e-157) {
		tmp = y / (x * x);
	} else if (y <= 1.0) {
		tmp = x / y;
	} else {
		tmp = x / (y * y);
	}
	return tmp;
}

Python

[x, y] = sort([x, y])
def code(x, y):
	tmp = 0
	if y <= 3.8e-157:
		tmp = y / (x * x)
	elif y <= 1.0:
		tmp = x / y
	else:
		tmp = x / (y * y)
	return tmp

Julia

x, y = sort([x, y])
function code(x, y)
	tmp = 0.0
	if (y <= 3.8e-157)
		tmp = Float64(y / Float64(x * x));
	elseif (y <= 1.0)
		tmp = Float64(x / y);
	else
		tmp = Float64(x / Float64(y * y));
	end
	return tmp
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= 3.8e-157)
		tmp = y / (x * x);
	elseif (y <= 1.0)
		tmp = x / y;
	else
		tmp = x / (y * y);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := If[LessEqual[y, 3.8e-157], N[(y / N[(x * x), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.0], N[(x / y), $MachinePrecision], N[(x / N[(y * y), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < 3.8000000000000002e-157

   1. Initial program 71.5%

      \[\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{y}{{x}^{2}}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{y}{{x}^{2}}} \]

      2. unpow2 N/A

         \[\leadsto \frac{y}{\color{blue}{x \cdot x}} \]

      3. lower-*.f64 45.0

         \[\leadsto \frac{y}{\color{blue}{x \cdot x}} \]

   5. Applied rewrites 45.0%

      \[\leadsto \color{blue}{\frac{y}{x \cdot x}} \]

   if 3.8000000000000002e-157 < y < 1

   1. Initial program 84.7%

      \[\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{x \cdot y}}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]

      3. lift-*.f64 N/A

         \[\leadsto \frac{x \cdot y}{\color{blue}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      4. times-frac N/A

         \[\leadsto \color{blue}{\frac{x}{\left(x + y\right) \cdot \left(x + y\right)} \cdot \frac{y}{\left(x + y\right) + 1}} \]

      5. *-commutative N/A

         \[\leadsto \color{blue}{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{\left(x + y\right) \cdot \left(x + y\right)}} \]

      6. lift-*.f64 N/A

         \[\leadsto \frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{\color{blue}{\left(x + y\right) \cdot \left(x + y\right)}} \]

      7. associate-/r* N/A

         \[\leadsto \frac{y}{\left(x + y\right) + 1} \cdot \color{blue}{\frac{\frac{x}{x + y}}{x + y}} \]

      8. associate-*r/ N/A

         \[\leadsto \color{blue}{\frac{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{x + y}}{x + y}} \]

      9. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{x + y}}{x + y}} \]

   4. Applied rewrites 99.7%

      \[\leadsto \color{blue}{\frac{\frac{y}{1 + \left(y + x\right)} \cdot \frac{x}{y + x}}{y + x}} \]

   5. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{x}{y \cdot \left(1 + y\right)}} \]
   6. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x}{y \cdot \left(1 + y\right)}} \]

      2. +-commutative N/A

         \[\leadsto \frac{x}{y \cdot \color{blue}{\left(y + 1\right)}} \]

      3. distribute-lft-in N/A

         \[\leadsto \frac{x}{\color{blue}{y \cdot y + y \cdot 1}} \]

      4. *-rgt-identity N/A

         \[\leadsto \frac{x}{y \cdot y + \color{blue}{y}} \]

      5. lower-fma.f64 40.9

         \[\leadsto \frac{x}{\color{blue}{\mathsf{fma}\left(y, y, y\right)}} \]

   7. Applied rewrites 40.9%

      \[\leadsto \color{blue}{\frac{x}{\mathsf{fma}\left(y, y, y\right)}} \]

   8. Taylor expanded in y around 0

      \[\leadsto \frac{x}{\color{blue}{y}} \]
   9. Step-by-step derivation

   10. Applied rewrites 39.0%

       \[\leadsto \frac{x}{\color{blue}{y}} \]

   if 1 < y

   1. Initial program 64.2%

      \[\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\frac{x}{{y}^{2}}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x}{{y}^{2}}} \]

      2. unpow2 N/A

         \[\leadsto \frac{x}{\color{blue}{y \cdot y}} \]

      3. lower-*.f64 79.9

         \[\leadsto \frac{x}{\color{blue}{y \cdot y}} \]

   5. Applied rewrites 79.9%

      \[\leadsto \color{blue}{\frac{x}{y \cdot y}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 10: 78.0% accurate, 1.6× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq 2.55 \cdot 10^{-58}:\\ \;\;\;\;\frac{y}{\mathsf{fma}\left(x, x, x\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{\mathsf{fma}\left(y, y, y\right)}\\ \end{array} \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
 :precision binary64
 (if (<= y 2.55e-58) (/ y (fma x x x)) (/ x (fma y y y))))

C

assert(x < y);
double code(double x, double y) {
	double tmp;
	if (y <= 2.55e-58) {
		tmp = y / fma(x, x, x);
	} else {
		tmp = x / fma(y, y, y);
	}
	return tmp;
}

Julia

x, y = sort([x, y])
function code(x, y)
	tmp = 0.0
	if (y <= 2.55e-58)
		tmp = Float64(y / fma(x, x, x));
	else
		tmp = Float64(x / fma(y, y, y));
	end
	return tmp
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := If[LessEqual[y, 2.55e-58], N[(y / N[(x * x + x), $MachinePrecision]), $MachinePrecision], N[(x / N[(y * y + y), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 2.55e-58

   1. Initial program 73.5%

      \[\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\frac{y}{x \cdot \left(1 + x\right)}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{y}{x \cdot \left(1 + x\right)}} \]

      2. +-commutative N/A

         \[\leadsto \frac{y}{x \cdot \color{blue}{\left(x + 1\right)}} \]

      3. distribute-lft-in N/A

         \[\leadsto \frac{y}{\color{blue}{x \cdot x + x \cdot 1}} \]

      4. *-rgt-identity N/A

         \[\leadsto \frac{y}{x \cdot x + \color{blue}{x}} \]

      5. lower-fma.f64 62.8

         \[\leadsto \frac{y}{\color{blue}{\mathsf{fma}\left(x, x, x\right)}} \]

   5. Applied rewrites 62.8%

      \[\leadsto \color{blue}{\frac{y}{\mathsf{fma}\left(x, x, x\right)}} \]

   if 2.55e-58 < y

   1. Initial program 67.6%

      \[\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{x}{y \cdot \left(1 + y\right)}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x}{y \cdot \left(1 + y\right)}} \]

      2. +-commutative N/A

         \[\leadsto \frac{x}{y \cdot \color{blue}{\left(y + 1\right)}} \]

      3. distribute-lft-in N/A

         \[\leadsto \frac{x}{\color{blue}{y \cdot y + y \cdot 1}} \]

      4. *-rgt-identity N/A

         \[\leadsto \frac{x}{y \cdot y + \color{blue}{y}} \]

      5. lower-fma.f64 75.7

         \[\leadsto \frac{x}{\color{blue}{\mathsf{fma}\left(y, y, y\right)}} \]

   5. Applied rewrites 75.7%

      \[\leadsto \color{blue}{\frac{x}{\mathsf{fma}\left(y, y, y\right)}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 11: 75.9% accurate, 1.6× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;x \leq -3.2 \cdot 10^{-15}:\\ \;\;\;\;\frac{y}{x \cdot x}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{\mathsf{fma}\left(y, y, y\right)}\\ \end{array} \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
 :precision binary64
 (if (<= x -3.2e-15) (/ y (* x x)) (/ x (fma y y y))))

C

assert(x < y);
double code(double x, double y) {
	double tmp;
	if (x <= -3.2e-15) {
		tmp = y / (x * x);
	} else {
		tmp = x / fma(y, y, y);
	}
	return tmp;
}

Julia

x, y = sort([x, y])
function code(x, y)
	tmp = 0.0
	if (x <= -3.2e-15)
		tmp = Float64(y / Float64(x * x));
	else
		tmp = Float64(x / fma(y, y, y));
	end
	return tmp
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := If[LessEqual[x, -3.2e-15], N[(y / N[(x * x), $MachinePrecision]), $MachinePrecision], N[(x / N[(y * y + y), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -3.1999999999999999e-15

   1. Initial program 69.6%

      \[\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{y}{{x}^{2}}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{y}{{x}^{2}}} \]

      2. unpow2 N/A

         \[\leadsto \frac{y}{\color{blue}{x \cdot x}} \]

      3. lower-*.f64 67.9

         \[\leadsto \frac{y}{\color{blue}{x \cdot x}} \]

   5. Applied rewrites 67.9%

      \[\leadsto \color{blue}{\frac{y}{x \cdot x}} \]

   if -3.1999999999999999e-15 < x

   1. Initial program 72.6%

      \[\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{x}{y \cdot \left(1 + y\right)}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x}{y \cdot \left(1 + y\right)}} \]

      2. +-commutative N/A

         \[\leadsto \frac{x}{y \cdot \color{blue}{\left(y + 1\right)}} \]

      3. distribute-lft-in N/A

         \[\leadsto \frac{x}{\color{blue}{y \cdot y + y \cdot 1}} \]

      4. *-rgt-identity N/A

         \[\leadsto \frac{x}{y \cdot y + \color{blue}{y}} \]

      5. lower-fma.f64 54.9

         \[\leadsto \frac{x}{\color{blue}{\mathsf{fma}\left(y, y, y\right)}} \]

   5. Applied rewrites 54.9%

      \[\leadsto \color{blue}{\frac{x}{\mathsf{fma}\left(y, y, y\right)}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 12: 46.9% accurate, 1.7× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq 1:\\ \;\;\;\;\frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y \cdot y}\\ \end{array} \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y) :precision binary64 (if (<= y 1.0) (/ x y) (/ x (* y y))))

C

assert(x < y);
double code(double x, double y) {
	double tmp;
	if (y <= 1.0) {
		tmp = x / y;
	} else {
		tmp = x / (y * y);
	}
	return tmp;
}

Fortran

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 <= 1.0d0) then
        tmp = x / y
    else
        tmp = x / (y * y)
    end if
    code = tmp
end function

Java

assert x < y;
public static double code(double x, double y) {
	double tmp;
	if (y <= 1.0) {
		tmp = x / y;
	} else {
		tmp = x / (y * y);
	}
	return tmp;
}

Python

[x, y] = sort([x, y])
def code(x, y):
	tmp = 0
	if y <= 1.0:
		tmp = x / y
	else:
		tmp = x / (y * y)
	return tmp

Julia

x, y = sort([x, y])
function code(x, y)
	tmp = 0.0
	if (y <= 1.0)
		tmp = Float64(x / y);
	else
		tmp = Float64(x / Float64(y * y));
	end
	return tmp
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= 1.0)
		tmp = x / y;
	else
		tmp = x / (y * y);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := If[LessEqual[y, 1.0], N[(x / y), $MachinePrecision], N[(x / N[(y * y), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 1

   1. Initial program 73.8%

      \[\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{x \cdot y}}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]

      3. lift-*.f64 N/A

         \[\leadsto \frac{x \cdot y}{\color{blue}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

      4. times-frac N/A

         \[\leadsto \color{blue}{\frac{x}{\left(x + y\right) \cdot \left(x + y\right)} \cdot \frac{y}{\left(x + y\right) + 1}} \]

      5. *-commutative N/A

         \[\leadsto \color{blue}{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{\left(x + y\right) \cdot \left(x + y\right)}} \]

      6. lift-*.f64 N/A

         \[\leadsto \frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{\color{blue}{\left(x + y\right) \cdot \left(x + y\right)}} \]

      7. associate-/r* N/A

         \[\leadsto \frac{y}{\left(x + y\right) + 1} \cdot \color{blue}{\frac{\frac{x}{x + y}}{x + y}} \]

      8. associate-*r/ N/A

         \[\leadsto \color{blue}{\frac{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{x + y}}{x + y}} \]

      9. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{x + y}}{x + y}} \]

   4. Applied rewrites 99.8%

      \[\leadsto \color{blue}{\frac{\frac{y}{1 + \left(y + x\right)} \cdot \frac{x}{y + x}}{y + x}} \]

   5. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{x}{y \cdot \left(1 + y\right)}} \]
   6. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x}{y \cdot \left(1 + y\right)}} \]

      2. +-commutative N/A

         \[\leadsto \frac{x}{y \cdot \color{blue}{\left(y + 1\right)}} \]

      3. distribute-lft-in N/A

         \[\leadsto \frac{x}{\color{blue}{y \cdot y + y \cdot 1}} \]

      4. *-rgt-identity N/A

         \[\leadsto \frac{x}{y \cdot y + \color{blue}{y}} \]

      5. lower-fma.f64 37.9

         \[\leadsto \frac{x}{\color{blue}{\mathsf{fma}\left(y, y, y\right)}} \]

   7. Applied rewrites 37.9%

      \[\leadsto \color{blue}{\frac{x}{\mathsf{fma}\left(y, y, y\right)}} \]

   8. Taylor expanded in y around 0

      \[\leadsto \frac{x}{\color{blue}{y}} \]
   9. Step-by-step derivation

   10. Applied rewrites 23.3%

       \[\leadsto \frac{x}{\color{blue}{y}} \]

   if 1 < y

   1. Initial program 64.2%

      \[\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\frac{x}{{y}^{2}}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x}{{y}^{2}}} \]

      2. unpow2 N/A

         \[\leadsto \frac{x}{\color{blue}{y \cdot y}} \]

      3. lower-*.f64 79.9

         \[\leadsto \frac{x}{\color{blue}{y \cdot y}} \]

   5. Applied rewrites 79.9%

      \[\leadsto \color{blue}{\frac{x}{y \cdot y}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 13: 26.2% accurate, 3.3× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \frac{x}{y} \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y) :precision binary64 (/ x y))

C

assert(x < y);
double code(double x, double y) {
	return x / y;
}

Fortran

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
end function

Java

assert x < y;
public static double code(double x, double y) {
	return x / y;
}

Python

[x, y] = sort([x, y])
def code(x, y):
	return x / y

Julia

x, y = sort([x, y])
function code(x, y)
	return Float64(x / y)
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y)
	tmp = x / y;
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := N[(x / y), $MachinePrecision]

Derivation

1. Initial program 71.9%

   \[\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-/.f64 N/A

      \[\leadsto \color{blue}{\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

   2. lift-*.f64 N/A

      \[\leadsto \frac{\color{blue}{x \cdot y}}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)} \]

   3. lift-*.f64 N/A

      \[\leadsto \frac{x \cdot y}{\color{blue}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}} \]

   4. times-frac N/A

      \[\leadsto \color{blue}{\frac{x}{\left(x + y\right) \cdot \left(x + y\right)} \cdot \frac{y}{\left(x + y\right) + 1}} \]

   5. *-commutative N/A

      \[\leadsto \color{blue}{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{\left(x + y\right) \cdot \left(x + y\right)}} \]

   6. lift-*.f64 N/A

      \[\leadsto \frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{\color{blue}{\left(x + y\right) \cdot \left(x + y\right)}} \]

   7. associate-/r* N/A

      \[\leadsto \frac{y}{\left(x + y\right) + 1} \cdot \color{blue}{\frac{\frac{x}{x + y}}{x + y}} \]

   8. associate-*r/ N/A

      \[\leadsto \color{blue}{\frac{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{x + y}}{x + y}} \]

   9. lower-/.f64 N/A

      \[\leadsto \color{blue}{\frac{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{x + y}}{x + y}} \]

4. Applied rewrites 99.8%

   \[\leadsto \color{blue}{\frac{\frac{y}{1 + \left(y + x\right)} \cdot \frac{x}{y + x}}{y + x}} \]

5. Taylor expanded in x around 0

   \[\leadsto \color{blue}{\frac{x}{y \cdot \left(1 + y\right)}} \]
6. Step-by-step derivation

   1. lower-/.f64 N/A

      \[\leadsto \color{blue}{\frac{x}{y \cdot \left(1 + y\right)}} \]

   2. +-commutative N/A

      \[\leadsto \frac{x}{y \cdot \color{blue}{\left(y + 1\right)}} \]

   3. distribute-lft-in N/A

      \[\leadsto \frac{x}{\color{blue}{y \cdot y + y \cdot 1}} \]

   4. *-rgt-identity N/A

      \[\leadsto \frac{x}{y \cdot y + \color{blue}{y}} \]

   5. lower-fma.f64 46.7

      \[\leadsto \frac{x}{\color{blue}{\mathsf{fma}\left(y, y, y\right)}} \]

7. Applied rewrites 46.7%

   \[\leadsto \color{blue}{\frac{x}{\mathsf{fma}\left(y, y, y\right)}} \]

8. Taylor expanded in y around 0

   \[\leadsto \frac{x}{\color{blue}{y}} \]
9. Step-by-step derivation

10. Applied rewrites 24.5%

    \[\leadsto \frac{x}{\color{blue}{y}} \]
11. Add Preprocessing

Developer Target 1: 99.8% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \frac{\frac{\frac{x}{\left(y + 1\right) + x}}{y + x}}{\frac{1}{\frac{y}{y + x}}} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (/ (/ (/ x (+ (+ y 1.0) x)) (+ y x)) (/ 1.0 (/ y (+ y x)))))

C

double code(double x, double y) {
	return ((x / ((y + 1.0) + x)) / (y + x)) / (1.0 / (y / (y + x)));
}

Fortran

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

Java

public static double code(double x, double y) {
	return ((x / ((y + 1.0) + x)) / (y + x)) / (1.0 / (y / (y + x)));
}

Python

def code(x, y):
	return ((x / ((y + 1.0) + x)) / (y + x)) / (1.0 / (y / (y + x)))

Julia

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

MATLAB

function tmp = code(x, y)
	tmp = ((x / ((y + 1.0) + x)) / (y + x)) / (1.0 / (y / (y + x)));
end

Wolfram

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]

Reproduce

herbie shell --seed 2024235 
(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))))