Kahan p9 Example

Percentage Accurate: 68.3% → 92.7%

Time: 10.8s

Alternatives: 8

Speedup: 0.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: 68.3% 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: 92.7% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (* (- x y) (+ x y))))
   (if (<= (/ t_0 (+ (* x x) (* y y))) 2.0)
     (/ t_0 (fma x x (* y y)))
     (fma (/ x y) (/ (* x 2.0) y) -1.0))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 (-.f64 x y) (+.f64 x y)) (+.f64 (*.f64 x x) (*.f64 y y))) < 2

   1. Initial program 100.0%

      \[\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. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lower-fma.f64 100.0

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

   4. Applied rewrites 100.0%

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

   if 2 < (/.f64 (*.f64 (-.f64 x y) (+.f64 x y)) (+.f64 (*.f64 x x) (*.f64 y y)))

   1. Initial program 0.0%

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

   3. Taylor expanded in x around 0

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

      1. sub-neg N/A

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

      2. *-commutative N/A

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

      3. metadata-eval N/A

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

      4. associate-*l/ N/A

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

      5. associate-*r/ N/A

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

      6. metadata-eval N/A

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

      7. associate-*r/ N/A

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

      8. lower-fma.f64 N/A

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

      9. unpow2 N/A

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

      10. lower-*.f64 N/A

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

      11. associate-*r/ N/A

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

      12. metadata-eval N/A

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

      13. lower-/.f64 N/A

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

      14. unpow2 N/A

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

      15. lower-*.f64 48.8

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

   5. Applied rewrites 48.8%

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

   7. Applied rewrites 77.9%

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

Alternative 2: 92.3% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\left(x - y\right) \cdot \left(x + y\right)}{x \cdot x + y \cdot y}\\ t_1 := \mathsf{fma}\left(\frac{x}{y}, \frac{x \cdot 2}{y}, -1\right)\\ \mathbf{if}\;t\_0 \leq -0.5:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_0 \leq 2:\\ \;\;\;\;\mathsf{fma}\left(\frac{y}{x}, \frac{y \cdot -2}{x}, 1\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (/ (* (- x y) (+ x y)) (+ (* x x) (* y y))))
        (t_1 (fma (/ x y) (/ (* x 2.0) y) -1.0)))
   (if (<= t_0 -0.5)
     t_1
     (if (<= t_0 2.0) (fma (/ y x) (/ (* y -2.0) x) 1.0) t_1))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 (-.f64 x y) (+.f64 x y)) (+.f64 (*.f64 x x) (*.f64 y y))) < -0.5 or 2 < (/.f64 (*.f64 (-.f64 x y) (+.f64 x y)) (+.f64 (*.f64 x x) (*.f64 y y)))

   1. Initial program 55.4%

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

   3. Taylor expanded in x around 0

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

      1. sub-neg N/A

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

      2. *-commutative N/A

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

      3. metadata-eval N/A

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

      4. associate-*l/ N/A

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

      5. associate-*r/ N/A

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

      6. metadata-eval N/A

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

      7. associate-*r/ N/A

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

      8. lower-fma.f64 N/A

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

      9. unpow2 N/A

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

      10. lower-*.f64 N/A

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

      11. associate-*r/ N/A

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

      12. metadata-eval N/A

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

      13. lower-/.f64 N/A

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

      14. unpow2 N/A

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

      15. lower-*.f64 74.7

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

   5. Applied rewrites 74.7%

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

   7. Applied rewrites 89.7%

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

   if -0.5 < (/.f64 (*.f64 (-.f64 x y) (+.f64 x y)) (+.f64 (*.f64 x x) (*.f64 y y))) < 2

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 92.4%

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

   7. Applied rewrites 98.7%

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

Alternative 3: 92.3% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\left(x - y\right) \cdot \left(x + y\right)}{x \cdot x + y \cdot y}\\ t_1 := \mathsf{fma}\left(\frac{x}{y}, \frac{x \cdot 2}{y}, -1\right)\\ \mathbf{if}\;t\_0 \leq -0.5:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_0 \leq 2:\\ \;\;\;\;\frac{\mathsf{fma}\left(x, x, \left(y \cdot y\right) \cdot -2\right)}{x \cdot x}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (/ (* (- x y) (+ x y)) (+ (* x x) (* y y))))
        (t_1 (fma (/ x y) (/ (* x 2.0) y) -1.0)))
   (if (<= t_0 -0.5)
     t_1
     (if (<= t_0 2.0) (/ (fma x x (* (* y y) -2.0)) (* x x)) t_1))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 (-.f64 x y) (+.f64 x y)) (+.f64 (*.f64 x x) (*.f64 y y))) < -0.5 or 2 < (/.f64 (*.f64 (-.f64 x y) (+.f64 x y)) (+.f64 (*.f64 x x) (*.f64 y y)))

   1. Initial program 55.4%

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

   3. Taylor expanded in x around 0

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

      1. sub-neg N/A

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

      2. *-commutative N/A

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

      3. metadata-eval N/A

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

      4. associate-*l/ N/A

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

      5. associate-*r/ N/A

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

      6. metadata-eval N/A

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

      7. associate-*r/ N/A

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

      8. lower-fma.f64 N/A

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

      9. unpow2 N/A

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

      10. lower-*.f64 N/A

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

      11. associate-*r/ N/A

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

      12. metadata-eval N/A

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

      13. lower-/.f64 N/A

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

      14. unpow2 N/A

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

      15. lower-*.f64 74.7

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

   5. Applied rewrites 74.7%

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

   7. Applied rewrites 89.7%

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

   if -0.5 < (/.f64 (*.f64 (-.f64 x y) (+.f64 x y)) (+.f64 (*.f64 x x) (*.f64 y y))) < 2

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 92.4%

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

   7. Applied rewrites 98.7%

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

   8. Taylor expanded in x around 0

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

   10. Applied rewrites 98.7%

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

Alternative 4: 91.6% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\left(x - y\right) \cdot \left(x + y\right)}{x \cdot x + y \cdot y}\\ \mathbf{if}\;t\_0 \leq -0.5:\\ \;\;\;\;-1\\ \mathbf{elif}\;t\_0 \leq 2:\\ \;\;\;\;\frac{\mathsf{fma}\left(x, x, \left(y \cdot y\right) \cdot -2\right)}{x \cdot x}\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 (-.f64 x y) (+.f64 x y)) (+.f64 (*.f64 x x) (*.f64 y y))) < -0.5 or 2 < (/.f64 (*.f64 (-.f64 x y) (+.f64 x y)) (+.f64 (*.f64 x x) (*.f64 y y)))

   1. Initial program 55.4%

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

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{-1} \]
   4. Step-by-step derivation

   5. Applied rewrites 88.1%

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

   if -0.5 < (/.f64 (*.f64 (-.f64 x y) (+.f64 x y)) (+.f64 (*.f64 x x) (*.f64 y y))) < 2

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 92.4%

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

   7. Applied rewrites 98.7%

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

   8. Taylor expanded in x around 0

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

   10. Applied rewrites 98.7%

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

Alternative 5: 91.5% accurate, 0.3× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	double t_0 = (x - y) * (x + y);
	double t_1 = t_0 / ((x * x) + (y * y));
	double tmp;
	if (t_1 <= -0.5) {
		tmp = -1.0;
	} else if (t_1 <= 2.0) {
		tmp = t_0 / (x * x);
	} else {
		tmp = -1.0;
	}
	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) :: t_1
    real(8) :: tmp
    t_0 = (x - y) * (x + y)
    t_1 = t_0 / ((x * x) + (y * y))
    if (t_1 <= (-0.5d0)) then
        tmp = -1.0d0
    else if (t_1 <= 2.0d0) then
        tmp = t_0 / (x * x)
    else
        tmp = -1.0d0
    end if
    code = tmp
end function

Java

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

Python

def code(x, y):
	t_0 = (x - y) * (x + y)
	t_1 = t_0 / ((x * x) + (y * y))
	tmp = 0
	if t_1 <= -0.5:
		tmp = -1.0
	elif t_1 <= 2.0:
		tmp = t_0 / (x * x)
	else:
		tmp = -1.0
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 (-.f64 x y) (+.f64 x y)) (+.f64 (*.f64 x x) (*.f64 y y))) < -0.5 or 2 < (/.f64 (*.f64 (-.f64 x y) (+.f64 x y)) (+.f64 (*.f64 x x) (*.f64 y y)))

   1. Initial program 55.4%

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

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{-1} \]
   4. Step-by-step derivation

   5. Applied rewrites 88.1%

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

   if -0.5 < (/.f64 (*.f64 (-.f64 x y) (+.f64 x y)) (+.f64 (*.f64 x x) (*.f64 y y))) < 2

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

      1. unpow2 N/A

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

      2. lower-*.f64 97.2

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

   5. Applied rewrites 97.2%

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

Alternative 6: 91.4% accurate, 0.4× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	double t_0 = ((x - y) * (x + y)) / ((x * x) + (y * y));
	double tmp;
	if (t_0 <= -0.5) {
		tmp = -1.0;
	} else if (t_0 <= 2.0) {
		tmp = 1.0;
	} else {
		tmp = -1.0;
	}
	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 = ((x - y) * (x + y)) / ((x * x) + (y * y))
    if (t_0 <= (-0.5d0)) then
        tmp = -1.0d0
    else if (t_0 <= 2.0d0) then
        tmp = 1.0d0
    else
        tmp = -1.0d0
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 (-.f64 x y) (+.f64 x y)) (+.f64 (*.f64 x x) (*.f64 y y))) < -0.5 or 2 < (/.f64 (*.f64 (-.f64 x y) (+.f64 x y)) (+.f64 (*.f64 x x) (*.f64 y y)))

   1. Initial program 55.4%

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

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{-1} \]
   4. Step-by-step derivation

   5. Applied rewrites 88.1%

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

   if -0.5 < (/.f64 (*.f64 (-.f64 x y) (+.f64 x y)) (+.f64 (*.f64 x x) (*.f64 y y))) < 2

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{1} \]
   4. Step-by-step derivation

   5. Applied rewrites 97.1%

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

Alternative 7: 91.8% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (/ (* (- x y) (+ x y)) (+ (* x x) (* y y))) 2.0)
   (* (- x y) (/ (+ x y) (fma x x (* y y))))
   (fma (/ x y) (/ (* x 2.0) y) -1.0)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 (-.f64 x y) (+.f64 x y)) (+.f64 (*.f64 x x) (*.f64 y y))) < 2

   1. Initial program 100.0%

      \[\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. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 98.6

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

      7. lift-+.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. lower-fma.f64 98.6

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

   4. Applied rewrites 98.6%

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

   if 2 < (/.f64 (*.f64 (-.f64 x y) (+.f64 x y)) (+.f64 (*.f64 x x) (*.f64 y y)))

   1. Initial program 0.0%

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

   3. Taylor expanded in x around 0

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

      1. sub-neg N/A

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

      2. *-commutative N/A

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

      3. metadata-eval N/A

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

      4. associate-*l/ N/A

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

      5. associate-*r/ N/A

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

      6. metadata-eval N/A

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

      7. associate-*r/ N/A

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

      8. lower-fma.f64 N/A

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

      9. unpow2 N/A

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

      10. lower-*.f64 N/A

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

      11. associate-*r/ N/A

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

      12. metadata-eval N/A

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

      13. lower-/.f64 N/A

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

      14. unpow2 N/A

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

      15. lower-*.f64 48.8

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

   5. Applied rewrites 48.8%

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

   7. Applied rewrites 77.9%

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

4. Final simplification 91.7%

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

Alternative 8: 65.8% accurate, 36.0× speedup

Math

\[\begin{array}{l} \\ -1 \end{array} \]

FPCore

(FPCore (x y) :precision binary64 -1.0)

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return -1.0

Julia

function code(x, y)
	return -1.0
end

MATLAB

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

Wolfram

code[x_, y_] := -1.0

Derivation

1. Initial program 66.4%

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

3. Taylor expanded in x around 0

   \[\leadsto \color{blue}{-1} \]
4. Step-by-step derivation

5. Applied rewrites 66.8%

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

Developer Target 1: 99.9% accurate, 0.4× 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 2024238 
(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))))