Kahan p9 Example

Percentage Accurate: 67.6% → 100.0%

Time: 9.1s

Alternatives: 11

Speedup: 2.5×

Specification

\[\left(0 < x \land x < 1\right) \land y < 1\]

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = ((x - y) * (x + y)) / ((x * x) + (y * y))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_] := N[(N[(N[(x - y), $MachinePrecision] * N[(x + y), $MachinePrecision]), $MachinePrecision] / N[(N[(x * x), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 67.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = ((x - y) * (x + y)) / ((x * x) + (y * y))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_] := N[(N[(N[(x - y), $MachinePrecision] * N[(x + y), $MachinePrecision]), $MachinePrecision] / N[(N[(x * x), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 100.0% accurate, 0.1× speedup

Math

\[\begin{array}{l} y_m = \left|y\right| \\ \frac{x - y\_m}{\mathsf{hypot}\left(x, y\_m\right) \cdot \frac{\mathsf{hypot}\left(x, y\_m\right)}{x + y\_m}} \end{array} \]

FPCore

y_m = (fabs.f64 y)
(FPCore (x y_m)
 :precision binary64
 (/ (- x y_m) (* (hypot x y_m) (/ (hypot x y_m) (+ x y_m)))))

C

y_m = fabs(y);
double code(double x, double y_m) {
	return (x - y_m) / (hypot(x, y_m) * (hypot(x, y_m) / (x + y_m)));
}

Java

y_m = Math.abs(y);
public static double code(double x, double y_m) {
	return (x - y_m) / (Math.hypot(x, y_m) * (Math.hypot(x, y_m) / (x + y_m)));
}

Python

y_m = math.fabs(y)
def code(x, y_m):
	return (x - y_m) / (math.hypot(x, y_m) * (math.hypot(x, y_m) / (x + y_m)))

Julia

y_m = abs(y)
function code(x, y_m)
	return Float64(Float64(x - y_m) / Float64(hypot(x, y_m) * Float64(hypot(x, y_m) / Float64(x + y_m))))
end

MATLAB

y_m = abs(y);
function tmp = code(x, y_m)
	tmp = (x - y_m) / (hypot(x, y_m) * (hypot(x, y_m) / (x + y_m)));
end

Wolfram

y_m = N[Abs[y], $MachinePrecision]
code[x_, y$95$m_] := N[(N[(x - y$95$m), $MachinePrecision] / N[(N[Sqrt[x ^ 2 + y$95$m ^ 2], $MachinePrecision] * N[(N[Sqrt[x ^ 2 + y$95$m ^ 2], $MachinePrecision] / N[(x + y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 65.1%

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

   1. associate-/l* 65.5%

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

   2. +-commutative 65.5%

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

   3. fma-define 65.5%

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

3. Simplified 65.5%

   \[\leadsto \color{blue}{\left(x - y\right) \cdot \frac{x + y}{\mathsf{fma}\left(y, y, x \cdot x\right)}} \]
4. Add Preprocessing
5. Step-by-step derivation

   1. add-sqr-sqrt 32.6%

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

   2. pow2 32.6%

      \[\leadsto \left(x - y\right) \cdot \color{blue}{{\left(\sqrt{\frac{x + y}{\mathsf{fma}\left(y, y, x \cdot x\right)}}\right)}^{2}} \]

   3. fma-undefine 32.6%

      \[\leadsto \left(x - y\right) \cdot {\left(\sqrt{\frac{x + y}{\color{blue}{y \cdot y + x \cdot x}}}\right)}^{2} \]

   4. +-commutative 32.6%

      \[\leadsto \left(x - y\right) \cdot {\left(\sqrt{\frac{x + y}{\color{blue}{x \cdot x + y \cdot y}}}\right)}^{2} \]

   5. sqrt-div 32.0%

      \[\leadsto \left(x - y\right) \cdot {\color{blue}{\left(\frac{\sqrt{x + y}}{\sqrt{x \cdot x + y \cdot y}}\right)}}^{2} \]

   6. hypot-define 44.0%

      \[\leadsto \left(x - y\right) \cdot {\left(\frac{\sqrt{x + y}}{\color{blue}{\mathsf{hypot}\left(x, y\right)}}\right)}^{2} \]

6. Applied egg-rr 44.0%

   \[\leadsto \left(x - y\right) \cdot \color{blue}{{\left(\frac{\sqrt{x + y}}{\mathsf{hypot}\left(x, y\right)}\right)}^{2}} \]
7. Step-by-step derivation

   1. unpow2 44.0%

      \[\leadsto \left(x - y\right) \cdot \color{blue}{\left(\frac{\sqrt{x + y}}{\mathsf{hypot}\left(x, y\right)} \cdot \frac{\sqrt{x + y}}{\mathsf{hypot}\left(x, y\right)}\right)} \]

   2. frac-times 32.0%

      \[\leadsto \left(x - y\right) \cdot \color{blue}{\frac{\sqrt{x + y} \cdot \sqrt{x + y}}{\mathsf{hypot}\left(x, y\right) \cdot \mathsf{hypot}\left(x, y\right)}} \]

   3. add-sqr-sqrt 65.5%

      \[\leadsto \left(x - y\right) \cdot \frac{\color{blue}{x + y}}{\mathsf{hypot}\left(x, y\right) \cdot \mathsf{hypot}\left(x, y\right)} \]

   4. associate-/l* 65.1%

      \[\leadsto \color{blue}{\frac{\left(x - y\right) \cdot \left(x + y\right)}{\mathsf{hypot}\left(x, y\right) \cdot \mathsf{hypot}\left(x, y\right)}} \]

   5. frac-times 99.9%

      \[\leadsto \color{blue}{\frac{x - y}{\mathsf{hypot}\left(x, y\right)} \cdot \frac{x + y}{\mathsf{hypot}\left(x, y\right)}} \]

   6. clear-num 99.9%

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

   7. frac-times 99.9%

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

   8. *-rgt-identity 99.9%

      \[\leadsto \frac{\color{blue}{x - y}}{\mathsf{hypot}\left(x, y\right) \cdot \frac{\mathsf{hypot}\left(x, y\right)}{x + y}} \]

8. Applied egg-rr 99.9%

   \[\leadsto \color{blue}{\frac{x - y}{\mathsf{hypot}\left(x, y\right) \cdot \frac{\mathsf{hypot}\left(x, y\right)}{x + y}}} \]
9. Add Preprocessing

Alternative 2: 99.9% accurate, 0.1× speedup

Math

\[\begin{array}{l} y_m = \left|y\right| \\ \frac{x - y\_m}{\mathsf{hypot}\left(x, y\_m\right)} \cdot \frac{x + y\_m}{\mathsf{hypot}\left(x, y\_m\right)} \end{array} \]

FPCore

y_m = (fabs.f64 y)
(FPCore (x y_m)
 :precision binary64
 (* (/ (- x y_m) (hypot x y_m)) (/ (+ x y_m) (hypot x y_m))))

C

y_m = fabs(y);
double code(double x, double y_m) {
	return ((x - y_m) / hypot(x, y_m)) * ((x + y_m) / hypot(x, y_m));
}

Java

y_m = Math.abs(y);
public static double code(double x, double y_m) {
	return ((x - y_m) / Math.hypot(x, y_m)) * ((x + y_m) / Math.hypot(x, y_m));
}

Python

y_m = math.fabs(y)
def code(x, y_m):
	return ((x - y_m) / math.hypot(x, y_m)) * ((x + y_m) / math.hypot(x, y_m))

Julia

y_m = abs(y)
function code(x, y_m)
	return Float64(Float64(Float64(x - y_m) / hypot(x, y_m)) * Float64(Float64(x + y_m) / hypot(x, y_m)))
end

MATLAB

y_m = abs(y);
function tmp = code(x, y_m)
	tmp = ((x - y_m) / hypot(x, y_m)) * ((x + y_m) / hypot(x, y_m));
end

Wolfram

y_m = N[Abs[y], $MachinePrecision]
code[x_, y$95$m_] := N[(N[(N[(x - y$95$m), $MachinePrecision] / N[Sqrt[x ^ 2 + y$95$m ^ 2], $MachinePrecision]), $MachinePrecision] * N[(N[(x + y$95$m), $MachinePrecision] / N[Sqrt[x ^ 2 + y$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 65.1%

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

   1. add-sqr-sqrt 65.1%

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

   2. times-frac 65.7%

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

   3. hypot-define 65.7%

      \[\leadsto \frac{x - y}{\color{blue}{\mathsf{hypot}\left(x, y\right)}} \cdot \frac{x + y}{\sqrt{x \cdot x + y \cdot y}} \]

   4. hypot-define 99.9%

      \[\leadsto \frac{x - y}{\mathsf{hypot}\left(x, y\right)} \cdot \frac{x + y}{\color{blue}{\mathsf{hypot}\left(x, y\right)}} \]

4. Applied egg-rr 99.9%

   \[\leadsto \color{blue}{\frac{x - y}{\mathsf{hypot}\left(x, y\right)} \cdot \frac{x + y}{\mathsf{hypot}\left(x, y\right)}} \]
5. Add Preprocessing

Alternative 3: 92.5% accurate, 0.6× speedup

Math

\[\begin{array}{l} y_m = \left|y\right| \\ \begin{array}{l} \mathbf{if}\;y\_m \leq 1.4 \cdot 10^{-164}:\\ \;\;\;\;\frac{x - y\_m}{x + y\_m \cdot \left(2 \cdot \frac{y\_m}{x} + -1\right)}\\ \mathbf{elif}\;y\_m \leq 5 \cdot 10^{-13}:\\ \;\;\;\;\frac{\left(x - y\_m\right) \cdot \left(x + y\_m\right)}{x \cdot x + y\_m \cdot y\_m}\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \end{array} \]

FPCore

y_m = (fabs.f64 y)
(FPCore (x y_m)
 :precision binary64
 (if (<= y_m 1.4e-164)
   (/ (- x y_m) (+ x (* y_m (+ (* 2.0 (/ y_m x)) -1.0))))
   (if (<= y_m 5e-13)
     (/ (* (- x y_m) (+ x y_m)) (+ (* x x) (* y_m y_m)))
     -1.0)))

C

y_m = fabs(y);
double code(double x, double y_m) {
	double tmp;
	if (y_m <= 1.4e-164) {
		tmp = (x - y_m) / (x + (y_m * ((2.0 * (y_m / x)) + -1.0)));
	} else if (y_m <= 5e-13) {
		tmp = ((x - y_m) * (x + y_m)) / ((x * x) + (y_m * y_m));
	} else {
		tmp = -1.0;
	}
	return tmp;
}

Fortran

y_m = abs(y)
real(8) function code(x, y_m)
    real(8), intent (in) :: x
    real(8), intent (in) :: y_m
    real(8) :: tmp
    if (y_m <= 1.4d-164) then
        tmp = (x - y_m) / (x + (y_m * ((2.0d0 * (y_m / x)) + (-1.0d0))))
    else if (y_m <= 5d-13) then
        tmp = ((x - y_m) * (x + y_m)) / ((x * x) + (y_m * y_m))
    else
        tmp = -1.0d0
    end if
    code = tmp
end function

Java

y_m = Math.abs(y);
public static double code(double x, double y_m) {
	double tmp;
	if (y_m <= 1.4e-164) {
		tmp = (x - y_m) / (x + (y_m * ((2.0 * (y_m / x)) + -1.0)));
	} else if (y_m <= 5e-13) {
		tmp = ((x - y_m) * (x + y_m)) / ((x * x) + (y_m * y_m));
	} else {
		tmp = -1.0;
	}
	return tmp;
}

Python

y_m = math.fabs(y)
def code(x, y_m):
	tmp = 0
	if y_m <= 1.4e-164:
		tmp = (x - y_m) / (x + (y_m * ((2.0 * (y_m / x)) + -1.0)))
	elif y_m <= 5e-13:
		tmp = ((x - y_m) * (x + y_m)) / ((x * x) + (y_m * y_m))
	else:
		tmp = -1.0
	return tmp

Julia

y_m = abs(y)
function code(x, y_m)
	tmp = 0.0
	if (y_m <= 1.4e-164)
		tmp = Float64(Float64(x - y_m) / Float64(x + Float64(y_m * Float64(Float64(2.0 * Float64(y_m / x)) + -1.0))));
	elseif (y_m <= 5e-13)
		tmp = Float64(Float64(Float64(x - y_m) * Float64(x + y_m)) / Float64(Float64(x * x) + Float64(y_m * y_m)));
	else
		tmp = -1.0;
	end
	return tmp
end

MATLAB

y_m = abs(y);
function tmp_2 = code(x, y_m)
	tmp = 0.0;
	if (y_m <= 1.4e-164)
		tmp = (x - y_m) / (x + (y_m * ((2.0 * (y_m / x)) + -1.0)));
	elseif (y_m <= 5e-13)
		tmp = ((x - y_m) * (x + y_m)) / ((x * x) + (y_m * y_m));
	else
		tmp = -1.0;
	end
	tmp_2 = tmp;
end

Wolfram

y_m = N[Abs[y], $MachinePrecision]
code[x_, y$95$m_] := If[LessEqual[y$95$m, 1.4e-164], N[(N[(x - y$95$m), $MachinePrecision] / N[(x + N[(y$95$m * N[(N[(2.0 * N[(y$95$m / x), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y$95$m, 5e-13], N[(N[(N[(x - y$95$m), $MachinePrecision] * N[(x + y$95$m), $MachinePrecision]), $MachinePrecision] / N[(N[(x * x), $MachinePrecision] + N[(y$95$m * y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -1.0]]

Derivation

1. Split input into 3 regimes

2. if y < 1.4000000000000001e-164

   1. Initial program 60.6%

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

      1. associate-/l* 61.1%

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

      2. +-commutative 61.1%

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

      3. fma-define 61.1%

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

   3. Simplified 61.1%

      \[\leadsto \color{blue}{\left(x - y\right) \cdot \frac{x + y}{\mathsf{fma}\left(y, y, x \cdot x\right)}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. add-sqr-sqrt 24.2%

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

      2. pow2 24.2%

         \[\leadsto \left(x - y\right) \cdot \color{blue}{{\left(\sqrt{\frac{x + y}{\mathsf{fma}\left(y, y, x \cdot x\right)}}\right)}^{2}} \]

      3. fma-undefine 24.2%

         \[\leadsto \left(x - y\right) \cdot {\left(\sqrt{\frac{x + y}{\color{blue}{y \cdot y + x \cdot x}}}\right)}^{2} \]

      4. +-commutative 24.2%

         \[\leadsto \left(x - y\right) \cdot {\left(\sqrt{\frac{x + y}{\color{blue}{x \cdot x + y \cdot y}}}\right)}^{2} \]

      5. sqrt-div 23.4%

         \[\leadsto \left(x - y\right) \cdot {\color{blue}{\left(\frac{\sqrt{x + y}}{\sqrt{x \cdot x + y \cdot y}}\right)}}^{2} \]

      6. hypot-define 37.0%

         \[\leadsto \left(x - y\right) \cdot {\left(\frac{\sqrt{x + y}}{\color{blue}{\mathsf{hypot}\left(x, y\right)}}\right)}^{2} \]

   6. Applied egg-rr 37.0%

      \[\leadsto \left(x - y\right) \cdot \color{blue}{{\left(\frac{\sqrt{x + y}}{\mathsf{hypot}\left(x, y\right)}\right)}^{2}} \]
   7. Step-by-step derivation

      1. unpow2 37.0%

         \[\leadsto \left(x - y\right) \cdot \color{blue}{\left(\frac{\sqrt{x + y}}{\mathsf{hypot}\left(x, y\right)} \cdot \frac{\sqrt{x + y}}{\mathsf{hypot}\left(x, y\right)}\right)} \]

      2. frac-times 23.5%

         \[\leadsto \left(x - y\right) \cdot \color{blue}{\frac{\sqrt{x + y} \cdot \sqrt{x + y}}{\mathsf{hypot}\left(x, y\right) \cdot \mathsf{hypot}\left(x, y\right)}} \]

      3. add-sqr-sqrt 61.1%

         \[\leadsto \left(x - y\right) \cdot \frac{\color{blue}{x + y}}{\mathsf{hypot}\left(x, y\right) \cdot \mathsf{hypot}\left(x, y\right)} \]

      4. associate-/l* 60.6%

         \[\leadsto \color{blue}{\frac{\left(x - y\right) \cdot \left(x + y\right)}{\mathsf{hypot}\left(x, y\right) \cdot \mathsf{hypot}\left(x, y\right)}} \]

      5. frac-times 100.0%

         \[\leadsto \color{blue}{\frac{x - y}{\mathsf{hypot}\left(x, y\right)} \cdot \frac{x + y}{\mathsf{hypot}\left(x, y\right)}} \]

      6. clear-num 99.9%

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

      7. frac-times 99.9%

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

      8. *-rgt-identity 99.9%

         \[\leadsto \frac{\color{blue}{x - y}}{\mathsf{hypot}\left(x, y\right) \cdot \frac{\mathsf{hypot}\left(x, y\right)}{x + y}} \]

   8. Applied egg-rr 99.9%

      \[\leadsto \color{blue}{\frac{x - y}{\mathsf{hypot}\left(x, y\right) \cdot \frac{\mathsf{hypot}\left(x, y\right)}{x + y}}} \]

   9. Taylor expanded in y around 0 36.9%

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

   if 1.4000000000000001e-164 < y < 4.9999999999999999e-13

   1. Initial program 99.9%

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

   if 4.9999999999999999e-13 < y

   1. Initial program 100.0%

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

      1. associate-/l* 100.0%

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

      2. +-commutative 100.0%

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

      3. fma-define 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\left(x - y\right) \cdot \frac{x + y}{\mathsf{fma}\left(y, y, x \cdot x\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 100.0%

      \[\leadsto \color{blue}{-1} \]
3. Recombined 3 regimes into one program.

4. Final simplification 44.1%

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

Alternative 4: 92.3% accurate, 0.6× speedup

Math

\[\begin{array}{l} y_m = \left|y\right| \\ \begin{array}{l} \mathbf{if}\;y\_m \leq 1.4 \cdot 10^{-164}:\\ \;\;\;\;\frac{1}{\frac{x}{\left(x - y\_m\right) \cdot \left(\frac{y\_m}{x} + 1\right)}}\\ \mathbf{elif}\;y\_m \leq 10^{-12}:\\ \;\;\;\;\frac{\left(x - y\_m\right) \cdot \left(x + y\_m\right)}{x \cdot x + y\_m \cdot y\_m}\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \end{array} \]

FPCore

y_m = (fabs.f64 y)
(FPCore (x y_m)
 :precision binary64
 (if (<= y_m 1.4e-164)
   (/ 1.0 (/ x (* (- x y_m) (+ (/ y_m x) 1.0))))
   (if (<= y_m 1e-12)
     (/ (* (- x y_m) (+ x y_m)) (+ (* x x) (* y_m y_m)))
     -1.0)))

C

y_m = fabs(y);
double code(double x, double y_m) {
	double tmp;
	if (y_m <= 1.4e-164) {
		tmp = 1.0 / (x / ((x - y_m) * ((y_m / x) + 1.0)));
	} else if (y_m <= 1e-12) {
		tmp = ((x - y_m) * (x + y_m)) / ((x * x) + (y_m * y_m));
	} else {
		tmp = -1.0;
	}
	return tmp;
}

Fortran

y_m = abs(y)
real(8) function code(x, y_m)
    real(8), intent (in) :: x
    real(8), intent (in) :: y_m
    real(8) :: tmp
    if (y_m <= 1.4d-164) then
        tmp = 1.0d0 / (x / ((x - y_m) * ((y_m / x) + 1.0d0)))
    else if (y_m <= 1d-12) then
        tmp = ((x - y_m) * (x + y_m)) / ((x * x) + (y_m * y_m))
    else
        tmp = -1.0d0
    end if
    code = tmp
end function

Java

y_m = Math.abs(y);
public static double code(double x, double y_m) {
	double tmp;
	if (y_m <= 1.4e-164) {
		tmp = 1.0 / (x / ((x - y_m) * ((y_m / x) + 1.0)));
	} else if (y_m <= 1e-12) {
		tmp = ((x - y_m) * (x + y_m)) / ((x * x) + (y_m * y_m));
	} else {
		tmp = -1.0;
	}
	return tmp;
}

Python

y_m = math.fabs(y)
def code(x, y_m):
	tmp = 0
	if y_m <= 1.4e-164:
		tmp = 1.0 / (x / ((x - y_m) * ((y_m / x) + 1.0)))
	elif y_m <= 1e-12:
		tmp = ((x - y_m) * (x + y_m)) / ((x * x) + (y_m * y_m))
	else:
		tmp = -1.0
	return tmp

Julia

y_m = abs(y)
function code(x, y_m)
	tmp = 0.0
	if (y_m <= 1.4e-164)
		tmp = Float64(1.0 / Float64(x / Float64(Float64(x - y_m) * Float64(Float64(y_m / x) + 1.0))));
	elseif (y_m <= 1e-12)
		tmp = Float64(Float64(Float64(x - y_m) * Float64(x + y_m)) / Float64(Float64(x * x) + Float64(y_m * y_m)));
	else
		tmp = -1.0;
	end
	return tmp
end

MATLAB

y_m = abs(y);
function tmp_2 = code(x, y_m)
	tmp = 0.0;
	if (y_m <= 1.4e-164)
		tmp = 1.0 / (x / ((x - y_m) * ((y_m / x) + 1.0)));
	elseif (y_m <= 1e-12)
		tmp = ((x - y_m) * (x + y_m)) / ((x * x) + (y_m * y_m));
	else
		tmp = -1.0;
	end
	tmp_2 = tmp;
end

Wolfram

y_m = N[Abs[y], $MachinePrecision]
code[x_, y$95$m_] := If[LessEqual[y$95$m, 1.4e-164], N[(1.0 / N[(x / N[(N[(x - y$95$m), $MachinePrecision] * N[(N[(y$95$m / x), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y$95$m, 1e-12], N[(N[(N[(x - y$95$m), $MachinePrecision] * N[(x + y$95$m), $MachinePrecision]), $MachinePrecision] / N[(N[(x * x), $MachinePrecision] + N[(y$95$m * y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -1.0]]

Derivation

1. Split input into 3 regimes

2. if y < 1.4000000000000001e-164

   1. Initial program 60.6%

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

      1. associate-/l* 61.1%

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

      2. +-commutative 61.1%

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

      3. fma-define 61.1%

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

   3. Simplified 61.1%

      \[\leadsto \color{blue}{\left(x - y\right) \cdot \frac{x + y}{\mathsf{fma}\left(y, y, x \cdot x\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 37.5%

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

      1. associate-*r/ 37.6%

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

      2. clear-num 37.6%

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

   7. Applied egg-rr 37.6%

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

   if 1.4000000000000001e-164 < y < 9.9999999999999998e-13

   1. Initial program 99.9%

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

   if 9.9999999999999998e-13 < y

   1. Initial program 100.0%

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

      1. associate-/l* 100.0%

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

      2. +-commutative 100.0%

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

      3. fma-define 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\left(x - y\right) \cdot \frac{x + y}{\mathsf{fma}\left(y, y, x \cdot x\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 100.0%

      \[\leadsto \color{blue}{-1} \]
3. Recombined 3 regimes into one program.

4. Final simplification 44.7%

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

Alternative 5: 83.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} y_m = \left|y\right| \\ \begin{array}{l} \mathbf{if}\;y\_m \leq 1.15 \cdot 10^{-150}:\\ \;\;\;\;\frac{1}{\frac{x}{\left(x - y\_m\right) \cdot \left(\frac{y\_m}{x} + 1\right)}}\\ \mathbf{else}:\\ \;\;\;\;\frac{x - y\_m}{y\_m} \cdot \left(1 + \frac{x}{y\_m}\right)\\ \end{array} \end{array} \]

FPCore

y_m = (fabs.f64 y)
(FPCore (x y_m)
 :precision binary64
 (if (<= y_m 1.15e-150)
   (/ 1.0 (/ x (* (- x y_m) (+ (/ y_m x) 1.0))))
   (* (/ (- x y_m) y_m) (+ 1.0 (/ x y_m)))))

C

y_m = fabs(y);
double code(double x, double y_m) {
	double tmp;
	if (y_m <= 1.15e-150) {
		tmp = 1.0 / (x / ((x - y_m) * ((y_m / x) + 1.0)));
	} else {
		tmp = ((x - y_m) / y_m) * (1.0 + (x / y_m));
	}
	return tmp;
}

Fortran

y_m = abs(y)
real(8) function code(x, y_m)
    real(8), intent (in) :: x
    real(8), intent (in) :: y_m
    real(8) :: tmp
    if (y_m <= 1.15d-150) then
        tmp = 1.0d0 / (x / ((x - y_m) * ((y_m / x) + 1.0d0)))
    else
        tmp = ((x - y_m) / y_m) * (1.0d0 + (x / y_m))
    end if
    code = tmp
end function

Java

y_m = Math.abs(y);
public static double code(double x, double y_m) {
	double tmp;
	if (y_m <= 1.15e-150) {
		tmp = 1.0 / (x / ((x - y_m) * ((y_m / x) + 1.0)));
	} else {
		tmp = ((x - y_m) / y_m) * (1.0 + (x / y_m));
	}
	return tmp;
}

Python

y_m = math.fabs(y)
def code(x, y_m):
	tmp = 0
	if y_m <= 1.15e-150:
		tmp = 1.0 / (x / ((x - y_m) * ((y_m / x) + 1.0)))
	else:
		tmp = ((x - y_m) / y_m) * (1.0 + (x / y_m))
	return tmp

Julia

y_m = abs(y)
function code(x, y_m)
	tmp = 0.0
	if (y_m <= 1.15e-150)
		tmp = Float64(1.0 / Float64(x / Float64(Float64(x - y_m) * Float64(Float64(y_m / x) + 1.0))));
	else
		tmp = Float64(Float64(Float64(x - y_m) / y_m) * Float64(1.0 + Float64(x / y_m)));
	end
	return tmp
end

MATLAB

y_m = abs(y);
function tmp_2 = code(x, y_m)
	tmp = 0.0;
	if (y_m <= 1.15e-150)
		tmp = 1.0 / (x / ((x - y_m) * ((y_m / x) + 1.0)));
	else
		tmp = ((x - y_m) / y_m) * (1.0 + (x / y_m));
	end
	tmp_2 = tmp;
end

Wolfram

y_m = N[Abs[y], $MachinePrecision]
code[x_, y$95$m_] := If[LessEqual[y$95$m, 1.15e-150], N[(1.0 / N[(x / N[(N[(x - y$95$m), $MachinePrecision] * N[(N[(y$95$m / x), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x - y$95$m), $MachinePrecision] / y$95$m), $MachinePrecision] * N[(1.0 + N[(x / y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 1.15000000000000001e-150

   1. Initial program 61.5%

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

      1. associate-/l* 62.0%

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

      2. +-commutative 62.0%

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

      3. fma-define 62.0%

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

   3. Simplified 62.0%

      \[\leadsto \color{blue}{\left(x - y\right) \cdot \frac{x + y}{\mathsf{fma}\left(y, y, x \cdot x\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 38.4%

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

      1. associate-*r/ 38.6%

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

      2. clear-num 38.6%

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

   7. Applied egg-rr 38.6%

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

   if 1.15000000000000001e-150 < y

   1. Initial program 99.9%

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

      1. associate-/l* 99.7%

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

      2. +-commutative 99.7%

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

      3. fma-define 99.7%

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

   3. Simplified 99.7%

      \[\leadsto \color{blue}{\left(x - y\right) \cdot \frac{x + y}{\mathsf{fma}\left(y, y, x \cdot x\right)}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. add-sqr-sqrt 99.0%

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

      2. pow2 99.0%

         \[\leadsto \left(x - y\right) \cdot \color{blue}{{\left(\sqrt{\frac{x + y}{\mathsf{fma}\left(y, y, x \cdot x\right)}}\right)}^{2}} \]

      3. fma-undefine 99.0%

         \[\leadsto \left(x - y\right) \cdot {\left(\sqrt{\frac{x + y}{\color{blue}{y \cdot y + x \cdot x}}}\right)}^{2} \]

      4. +-commutative 99.0%

         \[\leadsto \left(x - y\right) \cdot {\left(\sqrt{\frac{x + y}{\color{blue}{x \cdot x + y \cdot y}}}\right)}^{2} \]

      5. sqrt-div 99.1%

         \[\leadsto \left(x - y\right) \cdot {\color{blue}{\left(\frac{\sqrt{x + y}}{\sqrt{x \cdot x + y \cdot y}}\right)}}^{2} \]

      6. hypot-define 99.1%

         \[\leadsto \left(x - y\right) \cdot {\left(\frac{\sqrt{x + y}}{\color{blue}{\mathsf{hypot}\left(x, y\right)}}\right)}^{2} \]

   6. Applied egg-rr 99.1%

      \[\leadsto \left(x - y\right) \cdot \color{blue}{{\left(\frac{\sqrt{x + y}}{\mathsf{hypot}\left(x, y\right)}\right)}^{2}} \]

   7. Taylor expanded in y around inf 73.2%

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

      1. +-commutative 73.2%

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

   9. Simplified 73.2%

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

       1. clear-num 73.2%

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

       2. un-div-inv 73.2%

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

   11. Applied egg-rr 73.2%

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

       1. associate-/r/ 73.2%

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

       2. +-commutative 73.2%

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

   13. Simplified 73.2%

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

4. Final simplification 41.8%

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

Alternative 6: 83.3% accurate, 0.9× speedup

Math

\[\begin{array}{l} y_m = \left|y\right| \\ \begin{array}{l} \mathbf{if}\;y\_m \leq 3.6 \cdot 10^{-154}:\\ \;\;\;\;\left(x - y\_m\right) \cdot \frac{\frac{y\_m}{x} + 1}{x}\\ \mathbf{else}:\\ \;\;\;\;\frac{x - y\_m}{y\_m} \cdot \left(1 + \frac{x}{y\_m}\right)\\ \end{array} \end{array} \]

FPCore

y_m = (fabs.f64 y)
(FPCore (x y_m)
 :precision binary64
 (if (<= y_m 3.6e-154)
   (* (- x y_m) (/ (+ (/ y_m x) 1.0) x))
   (* (/ (- x y_m) y_m) (+ 1.0 (/ x y_m)))))

C

y_m = fabs(y);
double code(double x, double y_m) {
	double tmp;
	if (y_m <= 3.6e-154) {
		tmp = (x - y_m) * (((y_m / x) + 1.0) / x);
	} else {
		tmp = ((x - y_m) / y_m) * (1.0 + (x / y_m));
	}
	return tmp;
}

Fortran

y_m = abs(y)
real(8) function code(x, y_m)
    real(8), intent (in) :: x
    real(8), intent (in) :: y_m
    real(8) :: tmp
    if (y_m <= 3.6d-154) then
        tmp = (x - y_m) * (((y_m / x) + 1.0d0) / x)
    else
        tmp = ((x - y_m) / y_m) * (1.0d0 + (x / y_m))
    end if
    code = tmp
end function

Java

y_m = Math.abs(y);
public static double code(double x, double y_m) {
	double tmp;
	if (y_m <= 3.6e-154) {
		tmp = (x - y_m) * (((y_m / x) + 1.0) / x);
	} else {
		tmp = ((x - y_m) / y_m) * (1.0 + (x / y_m));
	}
	return tmp;
}

Python

y_m = math.fabs(y)
def code(x, y_m):
	tmp = 0
	if y_m <= 3.6e-154:
		tmp = (x - y_m) * (((y_m / x) + 1.0) / x)
	else:
		tmp = ((x - y_m) / y_m) * (1.0 + (x / y_m))
	return tmp

Julia

y_m = abs(y)
function code(x, y_m)
	tmp = 0.0
	if (y_m <= 3.6e-154)
		tmp = Float64(Float64(x - y_m) * Float64(Float64(Float64(y_m / x) + 1.0) / x));
	else
		tmp = Float64(Float64(Float64(x - y_m) / y_m) * Float64(1.0 + Float64(x / y_m)));
	end
	return tmp
end

MATLAB

y_m = abs(y);
function tmp_2 = code(x, y_m)
	tmp = 0.0;
	if (y_m <= 3.6e-154)
		tmp = (x - y_m) * (((y_m / x) + 1.0) / x);
	else
		tmp = ((x - y_m) / y_m) * (1.0 + (x / y_m));
	end
	tmp_2 = tmp;
end

Wolfram

y_m = N[Abs[y], $MachinePrecision]
code[x_, y$95$m_] := If[LessEqual[y$95$m, 3.6e-154], N[(N[(x - y$95$m), $MachinePrecision] * N[(N[(N[(y$95$m / x), $MachinePrecision] + 1.0), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x - y$95$m), $MachinePrecision] / y$95$m), $MachinePrecision] * N[(1.0 + N[(x / y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 3.6000000000000003e-154

   1. Initial program 61.3%

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

      1. associate-/l* 61.8%

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

      2. +-commutative 61.8%

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

      3. fma-define 61.8%

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

   3. Simplified 61.8%

      \[\leadsto \color{blue}{\left(x - y\right) \cdot \frac{x + y}{\mathsf{fma}\left(y, y, x \cdot x\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 38.6%

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

   if 3.6000000000000003e-154 < y

   1. Initial program 99.9%

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

      1. associate-/l* 99.7%

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

      2. +-commutative 99.7%

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

      3. fma-define 99.7%

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

   3. Simplified 99.7%

      \[\leadsto \color{blue}{\left(x - y\right) \cdot \frac{x + y}{\mathsf{fma}\left(y, y, x \cdot x\right)}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. add-sqr-sqrt 99.0%

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

      2. pow2 99.0%

         \[\leadsto \left(x - y\right) \cdot \color{blue}{{\left(\sqrt{\frac{x + y}{\mathsf{fma}\left(y, y, x \cdot x\right)}}\right)}^{2}} \]

      3. fma-undefine 99.0%

         \[\leadsto \left(x - y\right) \cdot {\left(\sqrt{\frac{x + y}{\color{blue}{y \cdot y + x \cdot x}}}\right)}^{2} \]

      4. +-commutative 99.0%

         \[\leadsto \left(x - y\right) \cdot {\left(\sqrt{\frac{x + y}{\color{blue}{x \cdot x + y \cdot y}}}\right)}^{2} \]

      5. sqrt-div 99.0%

         \[\leadsto \left(x - y\right) \cdot {\color{blue}{\left(\frac{\sqrt{x + y}}{\sqrt{x \cdot x + y \cdot y}}\right)}}^{2} \]

      6. hypot-define 99.0%

         \[\leadsto \left(x - y\right) \cdot {\left(\frac{\sqrt{x + y}}{\color{blue}{\mathsf{hypot}\left(x, y\right)}}\right)}^{2} \]

   6. Applied egg-rr 99.0%

      \[\leadsto \left(x - y\right) \cdot \color{blue}{{\left(\frac{\sqrt{x + y}}{\mathsf{hypot}\left(x, y\right)}\right)}^{2}} \]

   7. Taylor expanded in y around inf 74.2%

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

      1. +-commutative 74.2%

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

   9. Simplified 74.2%

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

       1. clear-num 74.2%

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

       2. un-div-inv 74.3%

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

   11. Applied egg-rr 74.3%

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

       1. associate-/r/ 74.3%

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

       2. +-commutative 74.3%

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

   13. Simplified 74.3%

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

4. Final simplification 42.0%

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

Alternative 7: 83.3% accurate, 0.9× speedup

Math

\[\begin{array}{l} y_m = \left|y\right| \\ \begin{array}{l} \mathbf{if}\;y\_m \leq 3.3 \cdot 10^{-150}:\\ \;\;\;\;\left(x - y\_m\right) \cdot \frac{\frac{y\_m}{x} + 1}{x}\\ \mathbf{else}:\\ \;\;\;\;\left(x - y\_m\right) \cdot \frac{1 + \frac{x}{y\_m}}{y\_m}\\ \end{array} \end{array} \]

FPCore

y_m = (fabs.f64 y)
(FPCore (x y_m)
 :precision binary64
 (if (<= y_m 3.3e-150)
   (* (- x y_m) (/ (+ (/ y_m x) 1.0) x))
   (* (- x y_m) (/ (+ 1.0 (/ x y_m)) y_m))))

C

y_m = fabs(y);
double code(double x, double y_m) {
	double tmp;
	if (y_m <= 3.3e-150) {
		tmp = (x - y_m) * (((y_m / x) + 1.0) / x);
	} else {
		tmp = (x - y_m) * ((1.0 + (x / y_m)) / y_m);
	}
	return tmp;
}

Fortran

y_m = abs(y)
real(8) function code(x, y_m)
    real(8), intent (in) :: x
    real(8), intent (in) :: y_m
    real(8) :: tmp
    if (y_m <= 3.3d-150) then
        tmp = (x - y_m) * (((y_m / x) + 1.0d0) / x)
    else
        tmp = (x - y_m) * ((1.0d0 + (x / y_m)) / y_m)
    end if
    code = tmp
end function

Java

y_m = Math.abs(y);
public static double code(double x, double y_m) {
	double tmp;
	if (y_m <= 3.3e-150) {
		tmp = (x - y_m) * (((y_m / x) + 1.0) / x);
	} else {
		tmp = (x - y_m) * ((1.0 + (x / y_m)) / y_m);
	}
	return tmp;
}

Python

y_m = math.fabs(y)
def code(x, y_m):
	tmp = 0
	if y_m <= 3.3e-150:
		tmp = (x - y_m) * (((y_m / x) + 1.0) / x)
	else:
		tmp = (x - y_m) * ((1.0 + (x / y_m)) / y_m)
	return tmp

Julia

y_m = abs(y)
function code(x, y_m)
	tmp = 0.0
	if (y_m <= 3.3e-150)
		tmp = Float64(Float64(x - y_m) * Float64(Float64(Float64(y_m / x) + 1.0) / x));
	else
		tmp = Float64(Float64(x - y_m) * Float64(Float64(1.0 + Float64(x / y_m)) / y_m));
	end
	return tmp
end

MATLAB

y_m = abs(y);
function tmp_2 = code(x, y_m)
	tmp = 0.0;
	if (y_m <= 3.3e-150)
		tmp = (x - y_m) * (((y_m / x) + 1.0) / x);
	else
		tmp = (x - y_m) * ((1.0 + (x / y_m)) / y_m);
	end
	tmp_2 = tmp;
end

Wolfram

y_m = N[Abs[y], $MachinePrecision]
code[x_, y$95$m_] := If[LessEqual[y$95$m, 3.3e-150], N[(N[(x - y$95$m), $MachinePrecision] * N[(N[(N[(y$95$m / x), $MachinePrecision] + 1.0), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision], N[(N[(x - y$95$m), $MachinePrecision] * N[(N[(1.0 + N[(x / y$95$m), $MachinePrecision]), $MachinePrecision] / y$95$m), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 3.3000000000000002e-150

   1. Initial program 61.5%

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

      1. associate-/l* 62.0%

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

      2. +-commutative 62.0%

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

      3. fma-define 62.0%

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

   3. Simplified 62.0%

      \[\leadsto \color{blue}{\left(x - y\right) \cdot \frac{x + y}{\mathsf{fma}\left(y, y, x \cdot x\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 38.4%

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

   if 3.3000000000000002e-150 < y

   1. Initial program 99.9%

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

      1. associate-/l* 99.7%

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

      2. +-commutative 99.7%

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

      3. fma-define 99.7%

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

   3. Simplified 99.7%

      \[\leadsto \color{blue}{\left(x - y\right) \cdot \frac{x + y}{\mathsf{fma}\left(y, y, x \cdot x\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around inf 73.2%

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

4. Final simplification 41.7%

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

Alternative 8: 82.9% accurate, 0.9× speedup

Math

\[\begin{array}{l} y_m = \left|y\right| \\ \begin{array}{l} \mathbf{if}\;y\_m \leq 3.6 \cdot 10^{-154}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;\left(x - y\_m\right) \cdot \frac{1 + \frac{x}{y\_m}}{y\_m}\\ \end{array} \end{array} \]

FPCore

y_m = (fabs.f64 y)
(FPCore (x y_m)
 :precision binary64
 (if (<= y_m 3.6e-154) 1.0 (* (- x y_m) (/ (+ 1.0 (/ x y_m)) y_m))))

C

y_m = fabs(y);
double code(double x, double y_m) {
	double tmp;
	if (y_m <= 3.6e-154) {
		tmp = 1.0;
	} else {
		tmp = (x - y_m) * ((1.0 + (x / y_m)) / y_m);
	}
	return tmp;
}

Fortran

y_m = abs(y)
real(8) function code(x, y_m)
    real(8), intent (in) :: x
    real(8), intent (in) :: y_m
    real(8) :: tmp
    if (y_m <= 3.6d-154) then
        tmp = 1.0d0
    else
        tmp = (x - y_m) * ((1.0d0 + (x / y_m)) / y_m)
    end if
    code = tmp
end function

Java

y_m = Math.abs(y);
public static double code(double x, double y_m) {
	double tmp;
	if (y_m <= 3.6e-154) {
		tmp = 1.0;
	} else {
		tmp = (x - y_m) * ((1.0 + (x / y_m)) / y_m);
	}
	return tmp;
}

Python

y_m = math.fabs(y)
def code(x, y_m):
	tmp = 0
	if y_m <= 3.6e-154:
		tmp = 1.0
	else:
		tmp = (x - y_m) * ((1.0 + (x / y_m)) / y_m)
	return tmp

Julia

y_m = abs(y)
function code(x, y_m)
	tmp = 0.0
	if (y_m <= 3.6e-154)
		tmp = 1.0;
	else
		tmp = Float64(Float64(x - y_m) * Float64(Float64(1.0 + Float64(x / y_m)) / y_m));
	end
	return tmp
end

MATLAB

y_m = abs(y);
function tmp_2 = code(x, y_m)
	tmp = 0.0;
	if (y_m <= 3.6e-154)
		tmp = 1.0;
	else
		tmp = (x - y_m) * ((1.0 + (x / y_m)) / y_m);
	end
	tmp_2 = tmp;
end

Wolfram

y_m = N[Abs[y], $MachinePrecision]
code[x_, y$95$m_] := If[LessEqual[y$95$m, 3.6e-154], 1.0, N[(N[(x - y$95$m), $MachinePrecision] * N[(N[(1.0 + N[(x / y$95$m), $MachinePrecision]), $MachinePrecision] / y$95$m), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 3.6000000000000003e-154

   1. Initial program 61.3%

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

      1. associate-/l* 61.8%

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

      2. +-commutative 61.8%

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

      3. fma-define 61.8%

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

   3. Simplified 61.8%

      \[\leadsto \color{blue}{\left(x - y\right) \cdot \frac{x + y}{\mathsf{fma}\left(y, y, x \cdot x\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 37.0%

      \[\leadsto \color{blue}{1} \]

   if 3.6000000000000003e-154 < y

   1. Initial program 99.9%

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

      1. associate-/l* 99.7%

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

      2. +-commutative 99.7%

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

      3. fma-define 99.7%

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

   3. Simplified 99.7%

      \[\leadsto \color{blue}{\left(x - y\right) \cdot \frac{x + y}{\mathsf{fma}\left(y, y, x \cdot x\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around inf 74.2%

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

Alternative 9: 82.8% accurate, 1.5× speedup

Math

\[\begin{array}{l} y_m = \left|y\right| \\ \begin{array}{l} \mathbf{if}\;y\_m \leq 1.32 \cdot 10^{-154}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;\frac{x - y\_m}{y\_m}\\ \end{array} \end{array} \]

FPCore

y_m = (fabs.f64 y)
(FPCore (x y_m)
 :precision binary64
 (if (<= y_m 1.32e-154) 1.0 (/ (- x y_m) y_m)))

C

y_m = fabs(y);
double code(double x, double y_m) {
	double tmp;
	if (y_m <= 1.32e-154) {
		tmp = 1.0;
	} else {
		tmp = (x - y_m) / y_m;
	}
	return tmp;
}

Fortran

y_m = abs(y)
real(8) function code(x, y_m)
    real(8), intent (in) :: x
    real(8), intent (in) :: y_m
    real(8) :: tmp
    if (y_m <= 1.32d-154) then
        tmp = 1.0d0
    else
        tmp = (x - y_m) / y_m
    end if
    code = tmp
end function

Java

y_m = Math.abs(y);
public static double code(double x, double y_m) {
	double tmp;
	if (y_m <= 1.32e-154) {
		tmp = 1.0;
	} else {
		tmp = (x - y_m) / y_m;
	}
	return tmp;
}

Python

y_m = math.fabs(y)
def code(x, y_m):
	tmp = 0
	if y_m <= 1.32e-154:
		tmp = 1.0
	else:
		tmp = (x - y_m) / y_m
	return tmp

Julia

y_m = abs(y)
function code(x, y_m)
	tmp = 0.0
	if (y_m <= 1.32e-154)
		tmp = 1.0;
	else
		tmp = Float64(Float64(x - y_m) / y_m);
	end
	return tmp
end

MATLAB

y_m = abs(y);
function tmp_2 = code(x, y_m)
	tmp = 0.0;
	if (y_m <= 1.32e-154)
		tmp = 1.0;
	else
		tmp = (x - y_m) / y_m;
	end
	tmp_2 = tmp;
end

Wolfram

y_m = N[Abs[y], $MachinePrecision]
code[x_, y$95$m_] := If[LessEqual[y$95$m, 1.32e-154], 1.0, N[(N[(x - y$95$m), $MachinePrecision] / y$95$m), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 1.31999999999999994e-154

   1. Initial program 61.3%

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

      1. associate-/l* 61.8%

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

      2. +-commutative 61.8%

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

      3. fma-define 61.8%

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

   3. Simplified 61.8%

      \[\leadsto \color{blue}{\left(x - y\right) \cdot \frac{x + y}{\mathsf{fma}\left(y, y, x \cdot x\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 37.0%

      \[\leadsto \color{blue}{1} \]

   if 1.31999999999999994e-154 < y

   1. Initial program 99.9%

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

      1. associate-/l* 99.7%

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

      2. +-commutative 99.7%

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

      3. fma-define 99.7%

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

   3. Simplified 99.7%

      \[\leadsto \color{blue}{\left(x - y\right) \cdot \frac{x + y}{\mathsf{fma}\left(y, y, x \cdot x\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 74.6%

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

      1. un-div-inv 74.7%

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

   7. Applied egg-rr 74.7%

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

Alternative 10: 82.6% accurate, 2.5× speedup

Math

\[\begin{array}{l} y_m = \left|y\right| \\ \begin{array}{l} \mathbf{if}\;y\_m \leq 7.5 \cdot 10^{-155}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \end{array} \]

FPCore

y_m = (fabs.f64 y)
(FPCore (x y_m) :precision binary64 (if (<= y_m 7.5e-155) 1.0 -1.0))

C

y_m = fabs(y);
double code(double x, double y_m) {
	double tmp;
	if (y_m <= 7.5e-155) {
		tmp = 1.0;
	} else {
		tmp = -1.0;
	}
	return tmp;
}

Fortran

y_m = abs(y)
real(8) function code(x, y_m)
    real(8), intent (in) :: x
    real(8), intent (in) :: y_m
    real(8) :: tmp
    if (y_m <= 7.5d-155) then
        tmp = 1.0d0
    else
        tmp = -1.0d0
    end if
    code = tmp
end function

Java

y_m = Math.abs(y);
public static double code(double x, double y_m) {
	double tmp;
	if (y_m <= 7.5e-155) {
		tmp = 1.0;
	} else {
		tmp = -1.0;
	}
	return tmp;
}

Python

y_m = math.fabs(y)
def code(x, y_m):
	tmp = 0
	if y_m <= 7.5e-155:
		tmp = 1.0
	else:
		tmp = -1.0
	return tmp

Julia

y_m = abs(y)
function code(x, y_m)
	tmp = 0.0
	if (y_m <= 7.5e-155)
		tmp = 1.0;
	else
		tmp = -1.0;
	end
	return tmp
end

MATLAB

y_m = abs(y);
function tmp_2 = code(x, y_m)
	tmp = 0.0;
	if (y_m <= 7.5e-155)
		tmp = 1.0;
	else
		tmp = -1.0;
	end
	tmp_2 = tmp;
end

Wolfram

y_m = N[Abs[y], $MachinePrecision]
code[x_, y$95$m_] := If[LessEqual[y$95$m, 7.5e-155], 1.0, -1.0]

Derivation

1. Split input into 2 regimes

2. if y < 7.5000000000000006e-155

   1. Initial program 61.3%

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

      1. associate-/l* 61.8%

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

      2. +-commutative 61.8%

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

      3. fma-define 61.8%

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

   3. Simplified 61.8%

      \[\leadsto \color{blue}{\left(x - y\right) \cdot \frac{x + y}{\mathsf{fma}\left(y, y, x \cdot x\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 37.0%

      \[\leadsto \color{blue}{1} \]

   if 7.5000000000000006e-155 < y

   1. Initial program 99.9%

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

      1. associate-/l* 99.7%

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

      2. +-commutative 99.7%

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

      3. fma-define 99.7%

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

   3. Simplified 99.7%

      \[\leadsto \color{blue}{\left(x - y\right) \cdot \frac{x + y}{\mathsf{fma}\left(y, y, x \cdot x\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 72.4%

      \[\leadsto \color{blue}{-1} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 11: 66.7% accurate, 15.0× speedup

Math

\[\begin{array}{l} y_m = \left|y\right| \\ -1 \end{array} \]

FPCore

y_m = (fabs.f64 y)
(FPCore (x y_m) :precision binary64 -1.0)

C

y_m = fabs(y);
double code(double x, double y_m) {
	return -1.0;
}

Fortran

y_m = abs(y)
real(8) function code(x, y_m)
    real(8), intent (in) :: x
    real(8), intent (in) :: y_m
    code = -1.0d0
end function

Java

y_m = Math.abs(y);
public static double code(double x, double y_m) {
	return -1.0;
}

Python

y_m = math.fabs(y)
def code(x, y_m):
	return -1.0

Julia

y_m = abs(y)
function code(x, y_m)
	return -1.0
end

MATLAB

y_m = abs(y);
function tmp = code(x, y_m)
	tmp = -1.0;
end

Wolfram

y_m = N[Abs[y], $MachinePrecision]
code[x_, y$95$m_] := -1.0

Derivation

1. Initial program 65.1%

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

   1. associate-/l* 65.5%

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

   2. +-commutative 65.5%

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

   3. fma-define 65.5%

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

3. Simplified 65.5%

   \[\leadsto \color{blue}{\left(x - y\right) \cdot \frac{x + y}{\mathsf{fma}\left(y, y, x \cdot x\right)}} \]
4. Add Preprocessing

5. Taylor expanded in x around 0 63.9%

   \[\leadsto \color{blue}{-1} \]
6. Add Preprocessing

Developer Target 1: 99.9% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left|\frac{x}{y}\right|\\ \mathbf{if}\;0.5 < t\_0 \land t\_0 < 2:\\ \;\;\;\;\frac{\left(x - y\right) \cdot \left(x + y\right)}{x \cdot x + y \cdot y}\\ \mathbf{else}:\\ \;\;\;\;1 - \frac{2}{1 + \frac{x}{y} \cdot \frac{x}{y}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (fabs (/ x y))))
   (if (and (< 0.5 t_0) (< t_0 2.0))
     (/ (* (- x y) (+ x y)) (+ (* x x) (* y y)))
     (- 1.0 (/ 2.0 (+ 1.0 (* (/ x y) (/ x y))))))))

C

double code(double x, double y) {
	double t_0 = fabs((x / y));
	double tmp;
	if ((0.5 < t_0) && (t_0 < 2.0)) {
		tmp = ((x - y) * (x + y)) / ((x * x) + (y * y));
	} else {
		tmp = 1.0 - (2.0 / (1.0 + ((x / y) * (x / y))));
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: t_0
    real(8) :: tmp
    t_0 = abs((x / y))
    if ((0.5d0 < t_0) .and. (t_0 < 2.0d0)) then
        tmp = ((x - y) * (x + y)) / ((x * x) + (y * y))
    else
        tmp = 1.0d0 - (2.0d0 / (1.0d0 + ((x / y) * (x / y))))
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = Math.abs((x / y));
	double tmp;
	if ((0.5 < t_0) && (t_0 < 2.0)) {
		tmp = ((x - y) * (x + y)) / ((x * x) + (y * y));
	} else {
		tmp = 1.0 - (2.0 / (1.0 + ((x / y) * (x / y))));
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = math.fabs((x / y))
	tmp = 0
	if (0.5 < t_0) and (t_0 < 2.0):
		tmp = ((x - y) * (x + y)) / ((x * x) + (y * y))
	else:
		tmp = 1.0 - (2.0 / (1.0 + ((x / y) * (x / y))))
	return tmp

Julia

function code(x, y)
	t_0 = abs(Float64(x / y))
	tmp = 0.0
	if ((0.5 < t_0) && (t_0 < 2.0))
		tmp = Float64(Float64(Float64(x - y) * Float64(x + y)) / Float64(Float64(x * x) + Float64(y * y)));
	else
		tmp = Float64(1.0 - Float64(2.0 / Float64(1.0 + Float64(Float64(x / y) * Float64(x / y)))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = abs((x / y));
	tmp = 0.0;
	if ((0.5 < t_0) && (t_0 < 2.0))
		tmp = ((x - y) * (x + y)) / ((x * x) + (y * y));
	else
		tmp = 1.0 - (2.0 / (1.0 + ((x / y) * (x / y))));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[Abs[N[(x / y), $MachinePrecision]], $MachinePrecision]}, If[And[Less[0.5, t$95$0], Less[t$95$0, 2.0]], N[(N[(N[(x - y), $MachinePrecision] * N[(x + y), $MachinePrecision]), $MachinePrecision] / N[(N[(x * x), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 - N[(2.0 / N[(1.0 + N[(N[(x / y), $MachinePrecision] * N[(x / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Reproduce

herbie shell --seed 2024144 
(FPCore (x y)
  :name "Kahan p9 Example"
  :precision binary64
  :pre (and (and (< 0.0 x) (< x 1.0)) (< y 1.0))

  :alt
  (! :herbie-platform default (if (< 1/2 (fabs (/ x y)) 2) (/ (* (- x y) (+ x y)) (+ (* x x) (* y y))) (- 1 (/ 2 (+ 1 (* (/ x y) (/ x y)))))))

  (/ (* (- x y) (+ x y)) (+ (* x x) (* y y))))