Kahan p9 Example

Percentage Accurate: 69.0% → 99.9%

Time: 8.4s

Alternatives: 9

Speedup: 0.4×

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: 69.0% 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: 99.9% accurate, 0.1× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 69.9%

   \[\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 69.9%

      \[\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 70.1%

      \[\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 70.2%

      \[\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 100.0%

      \[\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 100.0%

   \[\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 2: 92.9% accurate, 0.1× 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 2:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;2 \cdot {\left(\frac{x}{y}\right)}^{2} + -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 2.0) t_0 (+ (* 2.0 (pow (/ x y) 2.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 <= 2.0) {
		tmp = t_0;
	} else {
		tmp = (2.0 * pow((x / y), 2.0)) + -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 <= 2.0d0) then
        tmp = t_0
    else
        tmp = (2.0d0 * ((x / y) ** 2.0d0)) + (-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 <= 2.0) {
		tmp = t_0;
	} else {
		tmp = (2.0 * Math.pow((x / y), 2.0)) + -1.0;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = ((x - y) * (x + y)) / ((x * x) + (y * y))
	tmp = 0
	if t_0 <= 2.0:
		tmp = t_0
	else:
		tmp = (2.0 * math.pow((x / y), 2.0)) + -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 <= 2.0)
		tmp = t_0;
	else
		tmp = Float64(Float64(2.0 * (Float64(x / y) ^ 2.0)) + -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 <= 2.0)
		tmp = t_0;
	else
		tmp = (2.0 * ((x / y) ^ 2.0)) + -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, 2.0], t$95$0, N[(N[(2.0 * N[Power[N[(x / y), $MachinePrecision], 2.0], $MachinePrecision]), $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. Step-by-step derivation

      1. add-sqr-sqrt 0.0%

         \[\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 3.1%

         \[\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 3.1%

         \[\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. Taylor expanded in x around 0 49.4%

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

      1. fmm-def 49.4%

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

      2. unpow2 49.4%

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

      3. unpow2 49.4%

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

      4. times-frac 74.4%

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

      5. unpow2 74.4%

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

      6. metadata-eval 74.4%

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

   7. Simplified 74.4%

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

      1. fma-undefine 74.4%

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

   9. Applied egg-rr 74.4%

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

Alternative 3: 92.7% 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 2:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;\frac{x - y}{\frac{y}{\frac{x}{y} + 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 2.0) t_0 (/ (- x y) (/ y (+ (/ x y) 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 <= 2.0) {
		tmp = t_0;
	} else {
		tmp = (x - y) / (y / ((x / y) + 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 <= 2.0d0) then
        tmp = t_0
    else
        tmp = (x - y) / (y / ((x / y) + 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 <= 2.0) {
		tmp = t_0;
	} else {
		tmp = (x - y) / (y / ((x / y) + 1.0));
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = ((x - y) * (x + y)) / ((x * x) + (y * y))
	tmp = 0
	if t_0 <= 2.0:
		tmp = t_0
	else:
		tmp = (x - y) / (y / ((x / y) + 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 <= 2.0)
		tmp = t_0;
	else
		tmp = Float64(Float64(x - y) / Float64(y / Float64(Float64(x / y) + 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 <= 2.0)
		tmp = t_0;
	else
		tmp = (x - y) / (y / ((x / y) + 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, 2.0], t$95$0, N[(N[(x - y), $MachinePrecision] / N[(y / N[(N[(x / y), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $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. Step-by-step derivation

      1. associate-/l* 3.1%

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

      2. +-commutative 3.1%

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

      3. +-commutative 3.1%

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

      4. +-commutative 3.1%

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

      5. fma-define 3.1%

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

   3. Simplified 3.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 y around inf 73.6%

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

      1. clear-num 73.6%

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

      2. un-div-inv 73.8%

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

   7. Applied egg-rr 73.8%

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

4. Final simplification 92.1%

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

Alternative 4: 43.1% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 4.2 \cdot 10^{-134}:\\ \;\;\;\;\frac{x - y}{x + y \cdot \left(-1 + \frac{y}{x}\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{x - y}{\frac{y}{\frac{x}{y} + 1}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y 4.2e-134)
   (/ (- x y) (+ x (* y (+ -1.0 (/ y x)))))
   (/ (- x y) (/ y (+ (/ x y) 1.0)))))

C

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

Fortran

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

Java

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

Python

def code(x, y):
	tmp = 0
	if y <= 4.2e-134:
		tmp = (x - y) / (x + (y * (-1.0 + (y / x))))
	else:
		tmp = (x - y) / (y / ((x / y) + 1.0))
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= 4.2e-134)
		tmp = (x - y) / (x + (y * (-1.0 + (y / x))));
	else
		tmp = (x - y) / (y / ((x / y) + 1.0));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 4.1999999999999998e-134

   1. Initial program 62.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* 62.3%

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

      2. +-commutative 62.3%

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

      3. +-commutative 62.3%

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

      4. +-commutative 62.3%

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

      5. fma-define 62.3%

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

   3. Simplified 62.3%

      \[\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 40.3%

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

      1. clear-num 40.3%

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

      2. un-div-inv 40.4%

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

   7. Applied egg-rr 40.4%

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

   8. Taylor expanded in y around 0 39.7%

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

   if 4.1999999999999998e-134 < 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* 99.4%

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

      2. +-commutative 99.4%

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

      3. +-commutative 99.4%

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

      4. +-commutative 99.4%

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

      5. fma-define 99.4%

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

   3. Simplified 99.4%

      \[\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 79.0%

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

      1. clear-num 79.0%

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

      2. un-div-inv 79.2%

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

   7. Applied egg-rr 79.2%

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

4. Final simplification 47.7%

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

Alternative 5: 43.7% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 2.05 \cdot 10^{-134}:\\ \;\;\;\;\left(1 - \frac{y}{x}\right) \cdot \frac{x + y}{x}\\ \mathbf{else}:\\ \;\;\;\;\frac{x - y}{\frac{y}{\frac{x}{y} + 1}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y 2.05e-134)
   (* (- 1.0 (/ y x)) (/ (+ x y) x))
   (/ (- x y) (/ y (+ (/ x y) 1.0)))))

C

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

Fortran

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

Java

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

Python

def code(x, y):
	tmp = 0
	if y <= 2.05e-134:
		tmp = (1.0 - (y / x)) * ((x + y) / x)
	else:
		tmp = (x - y) / (y / ((x / y) + 1.0))
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= 2.05e-134)
		tmp = (1.0 - (y / x)) * ((x + y) / x);
	else
		tmp = (x - y) / (y / ((x / y) + 1.0));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 2.0500000000000001e-134

   1. Initial program 62.3%

      \[\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 62.3%

         \[\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 62.5%

         \[\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 62.6%

         \[\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 100.0%

         \[\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 100.0%

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

   5. Taylor expanded in x around inf 40.9%

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

      1. neg-mul-1 40.9%

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

      2. sub-neg 40.9%

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

   7. Simplified 40.9%

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

   8. Taylor expanded in x around inf 40.4%

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

   if 2.0500000000000001e-134 < 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* 99.4%

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

      2. +-commutative 99.4%

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

      3. +-commutative 99.4%

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

      4. +-commutative 99.4%

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

      5. fma-define 99.4%

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

   3. Simplified 99.4%

      \[\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 79.0%

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

      1. clear-num 79.0%

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

      2. un-div-inv 79.2%

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

   7. Applied egg-rr 79.2%

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

4. Final simplification 48.3%

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

Alternative 6: 43.7% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 7.5 \cdot 10^{-134}:\\ \;\;\;\;\left(1 - \frac{y}{x}\right) \cdot \frac{x + y}{x}\\ \mathbf{else}:\\ \;\;\;\;\left(x - y\right) \cdot \frac{\frac{x}{y} + 1}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y 7.5e-134)
   (* (- 1.0 (/ y x)) (/ (+ x y) x))
   (* (- x y) (/ (+ (/ x y) 1.0) y))))

C

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

Fortran

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

Java

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

Python

def code(x, y):
	tmp = 0
	if y <= 7.5e-134:
		tmp = (1.0 - (y / x)) * ((x + y) / x)
	else:
		tmp = (x - y) * (((x / y) + 1.0) / y)
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= 7.5e-134)
		tmp = (1.0 - (y / x)) * ((x + y) / x);
	else
		tmp = (x - y) * (((x / y) + 1.0) / y);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 7.50000000000000048e-134

   1. Initial program 62.3%

      \[\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 62.3%

         \[\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 62.5%

         \[\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 62.6%

         \[\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 100.0%

         \[\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 100.0%

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

   5. Taylor expanded in x around inf 40.9%

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

      1. neg-mul-1 40.9%

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

      2. sub-neg 40.9%

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

   7. Simplified 40.9%

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

   8. Taylor expanded in x around inf 40.4%

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

   if 7.50000000000000048e-134 < 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* 99.4%

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

      2. +-commutative 99.4%

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

      3. +-commutative 99.4%

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

      4. +-commutative 99.4%

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

      5. fma-define 99.4%

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

   3. Simplified 99.4%

      \[\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 79.0%

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

4. Final simplification 48.3%

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

Alternative 7: 43.3% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 1.55 \cdot 10^{-121}:\\ \;\;\;\;\left(1 - \frac{y}{x}\right) \cdot \frac{x + y}{x}\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y 1.55e-121) (* (- 1.0 (/ y x)) (/ (+ x y) x)) -1.0))

C

double code(double x, double y) {
	double tmp;
	if (y <= 1.55e-121) {
		tmp = (1.0 - (y / x)) * ((x + y) / 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) :: tmp
    if (y <= 1.55d-121) then
        tmp = (1.0d0 - (y / x)) * ((x + y) / x)
    else
        tmp = -1.0d0
    end if
    code = tmp
end function

Java

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

Python

def code(x, y):
	tmp = 0
	if y <= 1.55e-121:
		tmp = (1.0 - (y / x)) * ((x + y) / x)
	else:
		tmp = -1.0
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= 1.55e-121)
		tmp = (1.0 - (y / x)) * ((x + y) / x);
	else
		tmp = -1.0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 1.5499999999999999e-121

   1. Initial program 63.2%

      \[\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 63.2%

         \[\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 63.4%

         \[\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 63.5%

         \[\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 100.0%

         \[\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 100.0%

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

   5. Taylor expanded in x around inf 41.0%

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

      1. neg-mul-1 41.0%

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

      2. sub-neg 41.0%

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

   7. Simplified 41.0%

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

   8. Taylor expanded in x around inf 40.5%

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

   if 1.5499999999999999e-121 < 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* 99.4%

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

      2. +-commutative 99.4%

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

      3. +-commutative 99.4%

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

      4. +-commutative 99.4%

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

      5. fma-define 99.4%

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

   3. Simplified 99.4%

      \[\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 79.8%

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

Alternative 8: 42.2% accurate, 2.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 1.75 \cdot 10^{-138}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (if (<= y 1.75e-138) 1.0 -1.0))

C

double code(double x, double y) {
	double tmp;
	if (y <= 1.75e-138) {
		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) :: tmp
    if (y <= 1.75d-138) then
        tmp = 1.0d0
    else
        tmp = -1.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= 1.75e-138) {
		tmp = 1.0;
	} else {
		tmp = -1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= 1.75e-138:
		tmp = 1.0
	else:
		tmp = -1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= 1.75e-138)
		tmp = 1.0;
	else
		tmp = -1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= 1.75e-138)
		tmp = 1.0;
	else
		tmp = -1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, 1.75e-138], 1.0, -1.0]

Derivation

1. Split input into 2 regimes

2. if y < 1.7499999999999999e-138

   1. Initial program 62.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* 62.3%

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

      2. +-commutative 62.3%

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

      3. +-commutative 62.3%

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

      4. +-commutative 62.3%

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

      5. fma-define 62.3%

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

   3. Simplified 62.3%

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

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

   if 1.7499999999999999e-138 < 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* 99.4%

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

      2. +-commutative 99.4%

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

      3. +-commutative 99.4%

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

      4. +-commutative 99.4%

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

      5. fma-define 99.4%

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

   3. Simplified 99.4%

      \[\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 77.9%

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

Alternative 9: 66.8% accurate, 15.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 69.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* 69.8%

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

   2. +-commutative 69.8%

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

   3. +-commutative 69.8%

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

   4. +-commutative 69.8%

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

   5. fma-define 69.8%

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

3. Simplified 69.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 0 64.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 2024177 
(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))))