Kahan p9 Example

Percentage Accurate: 67.5% → 93.1%

Time: 11.0s

Alternatives: 7

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: 67.5% 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: 93.1% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

y_m = N[Abs[y], $MachinePrecision]
code[x_, y$95$m_] := If[LessEqual[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], 2.0], N[(N[(N[(x + y$95$m), $MachinePrecision] * (-y$95$m) + N[(x * N[(x + y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(y$95$m * y$95$m + N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / y$95$m), $MachinePrecision] * N[(N[(x * 2.0), $MachinePrecision] / y$95$m), $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. *-commutative N/A

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

      2. sub-neg N/A

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

      3. +-commutative N/A

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

      4. distribute-lft-in N/A

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

      5. *-commutative N/A

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

      6. accelerator-lowering-fma.f64 N/A

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

      7. +-lowering-+.f64 N/A

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

      8. neg-lowering-neg.f64 N/A

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

      9. *-lowering-*.f64 N/A

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

      10. +-lowering-+.f64 100.0

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

   4. Applied egg-rr 100.0%

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

      1. +-commutative N/A

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

      2. accelerator-lowering-fma.f64 N/A

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

      3. *-lowering-*.f64 100.0

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

   6. Applied egg-rr 100.0%

      \[\leadsto \frac{\mathsf{fma}\left(x + y, -y, x \cdot \left(x + y\right)\right)}{\color{blue}{\mathsf{fma}\left(y, y, x \cdot x\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. accelerator-lowering-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. *-lowering-*.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. /-lowering-/.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. *-lowering-*.f64 59.3

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

   5. Simplified 59.3%

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

      1. associate-*r/ N/A

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

      2. associate-*l* N/A

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

      3. times-frac N/A

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

      4. accelerator-lowering-fma.f64 N/A

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

      5. /-lowering-/.f64 N/A

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

      6. /-lowering-/.f64 N/A

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

      7. *-lowering-*.f64 83.6

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

   7. Applied egg-rr 83.6%

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

Alternative 2: 92.0% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

y_m = N[Abs[y], $MachinePrecision]
code[x_, y$95$m_] := Block[{t$95$0 = 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]}, If[LessEqual[t$95$0, -0.5], -1.0, If[LessEqual[t$95$0, 2.0], N[(N[(x * x + N[(y$95$m * N[(y$95$m * -2.0), $MachinePrecision]), $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 57.6%

      \[\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. Simplified 91.8%

      \[\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. Simplified 96.2%

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

   6. Taylor expanded in x around 0

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

      1. /-lowering-/.f64 N/A

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

   8. Simplified 99.3%

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

Alternative 3: 91.9% accurate, 0.4× speedup

Math

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

FPCore

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

C

y_m = fabs(y);
double code(double x, double y_m) {
	double t_0 = ((x - y_m) * (x + y_m)) / ((x * x) + (y_m * y_m));
	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

y_m = abs(y)
real(8) function code(x, y_m)
    real(8), intent (in) :: x
    real(8), intent (in) :: y_m
    real(8) :: t_0
    real(8) :: tmp
    t_0 = ((x - y_m) * (x + y_m)) / ((x * x) + (y_m * y_m))
    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

y_m = Math.abs(y);
public static double code(double x, double y_m) {
	double t_0 = ((x - y_m) * (x + y_m)) / ((x * x) + (y_m * y_m));
	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

y_m = math.fabs(y)
def code(x, y_m):
	t_0 = ((x - y_m) * (x + y_m)) / ((x * x) + (y_m * y_m))
	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

y_m = abs(y)
function code(x, y_m)
	t_0 = Float64(Float64(Float64(x - y_m) * Float64(x + y_m)) / Float64(Float64(x * x) + Float64(y_m * y_m)))
	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

y_m = abs(y);
function tmp_2 = code(x, y_m)
	t_0 = ((x - y_m) * (x + y_m)) / ((x * x) + (y_m * y_m));
	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

y_m = N[Abs[y], $MachinePrecision]
code[x_, y$95$m_] := Block[{t$95$0 = 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]}, 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 57.6%

      \[\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. Simplified 91.8%

      \[\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. Simplified 98.9%

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

Alternative 4: 93.1% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

y_m = N[Abs[y], $MachinePrecision]
code[x_, y$95$m_] := Block[{t$95$0 = 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]}, If[LessEqual[t$95$0, 2.0], t$95$0, N[(N[(x / y$95$m), $MachinePrecision] * N[(N[(x * 2.0), $MachinePrecision] / y$95$m), $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

   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. accelerator-lowering-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. *-lowering-*.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. /-lowering-/.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. *-lowering-*.f64 59.3

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

   5. Simplified 59.3%

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

      1. associate-*r/ N/A

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

      2. associate-*l* N/A

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

      3. times-frac N/A

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

      4. accelerator-lowering-fma.f64 N/A

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

      5. /-lowering-/.f64 N/A

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

      6. /-lowering-/.f64 N/A

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

      7. *-lowering-*.f64 83.6

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

   7. Applied egg-rr 83.6%

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

Alternative 5: 92.3% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

y_m = N[Abs[y], $MachinePrecision]
code[x_, y$95$m_] := If[LessEqual[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], 2.0], N[(N[(x - y$95$m), $MachinePrecision] * N[(N[(x + y$95$m), $MachinePrecision] / N[(x * x + N[(y$95$m * y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / y$95$m), $MachinePrecision] * N[(N[(x * 2.0), $MachinePrecision] / y$95$m), $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. associate-*r/ N/A

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

      2. *-commutative N/A

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

      3. *-lowering-*.f64 N/A

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

      4. /-lowering-/.f64 N/A

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

      5. +-lowering-+.f64 N/A

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

      6. accelerator-lowering-fma.f64 N/A

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

      7. *-lowering-*.f64 N/A

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

      8. --lowering--.f64 97.9

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

   4. Applied egg-rr 97.9%

      \[\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. accelerator-lowering-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. *-lowering-*.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. /-lowering-/.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. *-lowering-*.f64 59.3

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

   5. Simplified 59.3%

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

      1. associate-*r/ N/A

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

      2. associate-*l* N/A

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

      3. times-frac N/A

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

      4. accelerator-lowering-fma.f64 N/A

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

      5. /-lowering-/.f64 N/A

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

      6. /-lowering-/.f64 N/A

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

      7. *-lowering-*.f64 83.6

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

   7. Applied egg-rr 83.6%

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

4. Final simplification 93.4%

   \[\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 6: 91.8% accurate, 0.5× speedup

Math

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

FPCore

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

C

y_m = fabs(y);
double code(double x, double y_m) {
	double tmp;
	if ((((x - y_m) * (x + y_m)) / ((x * x) + (y_m * y_m))) <= 2.0) {
		tmp = (x - y_m) * ((x + y_m) / fma(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 (Float64(Float64(Float64(x - y_m) * Float64(x + y_m)) / Float64(Float64(x * x) + Float64(y_m * y_m))) <= 2.0)
		tmp = Float64(Float64(x - y_m) * Float64(Float64(x + y_m) / fma(x, x, Float64(y_m * y_m))));
	else
		tmp = -1.0;
	end
	return tmp
end

Wolfram

y_m = N[Abs[y], $MachinePrecision]
code[x_, y$95$m_] := If[LessEqual[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], 2.0], N[(N[(x - y$95$m), $MachinePrecision] * N[(N[(x + y$95$m), $MachinePrecision] / N[(x * x + N[(y$95$m * y$95$m), $MachinePrecision]), $MachinePrecision]), $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))) < 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. associate-*r/ N/A

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

      2. *-commutative N/A

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

      3. *-lowering-*.f64 N/A

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

      4. /-lowering-/.f64 N/A

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

      5. +-lowering-+.f64 N/A

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

      6. accelerator-lowering-fma.f64 N/A

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

      7. *-lowering-*.f64 N/A

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

      8. --lowering--.f64 97.9

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

   4. Applied egg-rr 97.9%

      \[\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}{-1} \]
   4. Step-by-step derivation

   5. Simplified 82.4%

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

4. Final simplification 93.0%

   \[\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}:\\ \;\;\;\;-1\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 66.8% accurate, 36.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 68.3%

   \[\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. Simplified 68.9%

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

Developer Target 1: 100.0% 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 2024204 
(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))))