Kahan p9 Example

Percentage Accurate: 68.5% → 100.0%

Time: 8.5s

Alternatives: 14

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: 68.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: 100.0% accurate, 0.1× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 70.7%

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

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

      \[\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 71.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. Step-by-step derivation

   1. clear-num 100.0%

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

   2. un-div-inv 100.0%

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

6. Applied egg-rr 100.0%

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

Alternative 2: 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 70.7%

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

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

      \[\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 71.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. Add Preprocessing

Alternative 3: 72.7% 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}:\\ \;\;\;\;\frac{\frac{x}{y} + -1}{\frac{\mathsf{hypot}\left(x, y\right)}{x + y}}\\ \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) -1.0) (/ (hypot x y) (+ x y))))))

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) + -1.0) / (hypot(x, y) / (x + y));
	}
	return tmp;
}

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) + -1.0) / (Math.hypot(x, y) / (x + y));
	}
	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) + -1.0) / (math.hypot(x, y) / (x + y))
	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(Float64(x / y) + -1.0) / Float64(hypot(x, y) / Float64(x + y)));
	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) + -1.0) / (hypot(x, y) / (x + y));
	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[(N[(x / y), $MachinePrecision] + -1.0), $MachinePrecision] / N[(N[Sqrt[x ^ 2 + y ^ 2], $MachinePrecision] / N[(x + y), $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. 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 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. Step-by-step derivation

      1. clear-num 100.0%

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

      2. un-div-inv 100.0%

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

   6. Applied egg-rr 100.0%

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

   7. Taylor expanded in x around 0 13.3%

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

4. Final simplification 74.6%

   \[\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{\frac{x}{y} + -1}{\frac{\mathsf{hypot}\left(x, y\right)}{x + y}}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 92.9% 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}{y + x \cdot \left(\frac{x}{y} + -1\right)}\\ \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 (+ (/ 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 * ((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 * ((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 * ((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 * ((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(x * 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 * ((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[(x * N[(N[(x / y), $MachinePrecision] + -1.0), $MachinePrecision]), $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 77.4%

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

      1. clear-num 77.4%

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

      2. un-div-inv 77.8%

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

   7. Applied egg-rr 77.8%

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

   8. Taylor expanded in x around 0 77.6%

      \[\leadsto \frac{x - y}{\color{blue}{y + x \cdot \left(\frac{x}{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:\\ \;\;\;\;\frac{\left(x - y\right) \cdot \left(x + y\right)}{x \cdot x + y \cdot y}\\ \mathbf{else}:\\ \;\;\;\;\frac{x - y}{y + x \cdot \left(\frac{x}{y} + -1\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 42.6% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 1.9500000000000002e-142

   1. Initial program 64.8%

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

      1. associate-/l* 65.6%

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

      2. +-commutative 65.6%

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

      3. +-commutative 65.6%

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

      4. +-commutative 65.6%

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

      5. fma-define 65.6%

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

   3. Simplified 65.6%

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

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

      1. expm1-log1p-u 36.8%

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

      2. expm1-undefine 36.8%

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

   7. Applied egg-rr 36.8%

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

      1. sub-neg 36.8%

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

      2. log1p-undefine 36.8%

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

      3. rem-exp-log 39.1%

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

      4. associate-+r+ 39.1%

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

      5. metadata-eval 39.1%

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

      6. metadata-eval 39.1%

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

   9. Simplified 39.1%

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

   10. Taylor expanded in x around 0 39.1%

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

   if 1.9500000000000002e-142 < y

   1. Initial program 99.9%

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

      1. associate-/l* 99.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 78.8%

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

      1. clear-num 78.8%

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

      2. un-div-inv 79.0%

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

   7. Applied egg-rr 79.0%

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

   8. Taylor expanded in x around 0 79.3%

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

4. Final simplification 45.8%

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

Alternative 6: 42.6% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 1.19999999999999994e-142

   1. Initial program 64.8%

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

      1. associate-/l* 65.6%

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

      2. +-commutative 65.6%

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

      3. +-commutative 65.6%

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

      4. +-commutative 65.6%

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

      5. fma-define 65.6%

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

   3. Simplified 65.6%

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

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

   6. Taylor expanded in x around 0 39.1%

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

   if 1.19999999999999994e-142 < y

   1. Initial program 99.9%

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

      1. associate-/l* 99.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 78.8%

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

      1. clear-num 78.8%

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

      2. un-div-inv 79.0%

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

   7. Applied egg-rr 79.0%

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

   8. Taylor expanded in x around 0 79.3%

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

4. Final simplification 45.9%

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

Alternative 7: 42.6% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y 6.8e-139)
   (* (- x y) (/ (/ (+ x y) x) x))
   (/ (- x y) (/ y (/ (+ x y) y)))))

C

double code(double x, double y) {
	double tmp;
	if (y <= 6.8e-139) {
		tmp = (x - y) * (((x + y) / x) / x);
	} else {
		tmp = (x - y) / (y / ((x + y) / 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 <= 6.8d-139) then
        tmp = (x - y) * (((x + y) / x) / x)
    else
        tmp = (x - y) / (y / ((x + y) / y))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 6.79999999999999998e-139

   1. Initial program 64.8%

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

      1. associate-/l* 65.6%

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

      2. +-commutative 65.6%

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

      3. +-commutative 65.6%

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

      4. +-commutative 65.6%

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

      5. fma-define 65.6%

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

   3. Simplified 65.6%

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

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

   6. Taylor expanded in x around 0 39.1%

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

   if 6.79999999999999998e-139 < y

   1. Initial program 99.9%

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

      1. associate-/l* 99.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 78.8%

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

      1. clear-num 78.8%

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

      2. un-div-inv 79.0%

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

   7. Applied egg-rr 79.0%

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

   8. Taylor expanded in y around 0 79.0%

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

Alternative 8: 42.6% accurate, 0.9× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	double tmp;
	if (y <= 5.4e-138) {
		tmp = (x - y) * (((x + y) / x) / 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 <= 5.4d-138) then
        tmp = (x - y) * (((x + y) / x) / 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 <= 5.4e-138) {
		tmp = (x - y) * (((x + y) / x) / x);
	} else {
		tmp = (x - y) / (y / ((x / y) + 1.0));
	}
	return tmp;
}

Python

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

Julia

function code(x, y)
	tmp = 0.0
	if (y <= 5.4e-138)
		tmp = Float64(Float64(x - y) * Float64(Float64(Float64(x + y) / x) / 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 <= 5.4e-138)
		tmp = (x - y) * (((x + y) / x) / x);
	else
		tmp = (x - y) / (y / ((x / y) + 1.0));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, 5.4e-138], N[(N[(x - y), $MachinePrecision] * N[(N[(N[(x + y), $MachinePrecision] / x), $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 < 5.40000000000000057e-138

   1. Initial program 64.8%

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

      1. associate-/l* 65.6%

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

      2. +-commutative 65.6%

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

      3. +-commutative 65.6%

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

      4. +-commutative 65.6%

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

      5. fma-define 65.6%

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

   3. Simplified 65.6%

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

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

   6. Taylor expanded in x around 0 39.1%

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

   if 5.40000000000000057e-138 < y

   1. Initial program 99.9%

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

      1. associate-/l* 99.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 78.8%

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

      1. clear-num 78.8%

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

      2. un-div-inv 79.0%

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

   7. Applied egg-rr 79.0%

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

4. Final simplification 45.8%

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

Alternative 9: 42.5% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y 6.5e-139)
   (* (- x y) (/ (/ (+ x y) x) x))
   (* (- x y) (/ (/ (+ x y) y) y))))

C

double code(double x, double y) {
	double tmp;
	if (y <= 6.5e-139) {
		tmp = (x - y) * (((x + y) / x) / x);
	} else {
		tmp = (x - y) * (((x + y) / y) / 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 <= 6.5d-139) then
        tmp = (x - y) * (((x + y) / x) / x)
    else
        tmp = (x - y) * (((x + y) / y) / y)
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 6.5e-139

   1. Initial program 64.8%

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

      1. associate-/l* 65.6%

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

      2. +-commutative 65.6%

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

      3. +-commutative 65.6%

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

      4. +-commutative 65.6%

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

      5. fma-define 65.6%

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

   3. Simplified 65.6%

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

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

   6. Taylor expanded in x around 0 39.1%

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

   if 6.5e-139 < y

   1. Initial program 99.9%

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

      1. associate-/l* 99.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 78.8%

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

   6. Taylor expanded in y around 0 78.8%

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

Alternative 10: 42.5% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 4.5 \cdot 10^{-139}:\\ \;\;\;\;\left(x - y\right) \cdot \frac{\frac{x + y}{x}}{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 4.5e-139)
   (* (- x y) (/ (/ (+ x y) x) x))
   (* (- x y) (/ (+ (/ x y) 1.0) y))))

C

double code(double x, double y) {
	double tmp;
	if (y <= 4.5e-139) {
		tmp = (x - y) * (((x + y) / x) / 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 <= 4.5d-139) then
        tmp = (x - y) * (((x + y) / x) / 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 <= 4.5e-139) {
		tmp = (x - y) * (((x + y) / x) / x);
	} else {
		tmp = (x - y) * (((x / y) + 1.0) / y);
	}
	return tmp;
}

Python

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

Julia

function code(x, y)
	tmp = 0.0
	if (y <= 4.5e-139)
		tmp = Float64(Float64(x - y) * Float64(Float64(Float64(x + y) / x) / 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 <= 4.5e-139)
		tmp = (x - y) * (((x + y) / x) / x);
	else
		tmp = (x - y) * (((x / y) + 1.0) / y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, 4.5e-139], N[(N[(x - y), $MachinePrecision] * N[(N[(N[(x + y), $MachinePrecision] / x), $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 < 4.50000000000000023e-139

   1. Initial program 64.8%

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

      1. associate-/l* 65.6%

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

      2. +-commutative 65.6%

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

      3. +-commutative 65.6%

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

      4. +-commutative 65.6%

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

      5. fma-define 65.6%

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

   3. Simplified 65.6%

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

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

   6. Taylor expanded in x around 0 39.1%

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

   if 4.50000000000000023e-139 < y

   1. Initial program 99.9%

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

      1. associate-/l* 99.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 78.8%

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

4. Final simplification 45.8%

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

Alternative 11: 42.5% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 3.9 \cdot 10^{-138}:\\ \;\;\;\;\left(x - y\right) \cdot \frac{1 + \frac{y}{x}}{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 3.9e-138)
   (* (- x y) (/ (+ 1.0 (/ y x)) x))
   (* (- x y) (/ (+ (/ x y) 1.0) y))))

C

double code(double x, double y) {
	double tmp;
	if (y <= 3.9e-138) {
		tmp = (x - y) * ((1.0 + (y / x)) / 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 <= 3.9d-138) then
        tmp = (x - y) * ((1.0d0 + (y / x)) / 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 <= 3.9e-138) {
		tmp = (x - y) * ((1.0 + (y / x)) / x);
	} else {
		tmp = (x - y) * (((x / y) + 1.0) / y);
	}
	return tmp;
}

Python

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

Julia

function code(x, y)
	tmp = 0.0
	if (y <= 3.9e-138)
		tmp = Float64(Float64(x - y) * Float64(Float64(1.0 + Float64(y / x)) / 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 <= 3.9e-138)
		tmp = (x - y) * ((1.0 + (y / x)) / x);
	else
		tmp = (x - y) * (((x / y) + 1.0) / y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, 3.9e-138], N[(N[(x - y), $MachinePrecision] * N[(N[(1.0 + N[(y / x), $MachinePrecision]), $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 < 3.8999999999999999e-138

   1. Initial program 64.8%

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

      1. associate-/l* 65.6%

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

      2. +-commutative 65.6%

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

      3. +-commutative 65.6%

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

      4. +-commutative 65.6%

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

      5. fma-define 65.6%

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

   3. Simplified 65.6%

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

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

   if 3.8999999999999999e-138 < y

   1. Initial program 99.9%

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

      1. associate-/l* 99.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 78.8%

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

4. Final simplification 45.8%

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

Alternative 12: 41.3% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 1.52 \cdot 10^{-142}:\\ \;\;\;\;1\\ \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 1.52e-142) 1.0 (* (- x y) (/ (+ (/ x y) 1.0) y))))

C

double code(double x, double y) {
	double tmp;
	if (y <= 1.52e-142) {
		tmp = 1.0;
	} 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 <= 1.52d-142) then
        tmp = 1.0d0
    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 <= 1.52e-142) {
		tmp = 1.0;
	} else {
		tmp = (x - y) * (((x / y) + 1.0) / y);
	}
	return tmp;
}

Python

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

Julia

function code(x, y)
	tmp = 0.0
	if (y <= 1.52e-142)
		tmp = 1.0;
	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 <= 1.52e-142)
		tmp = 1.0;
	else
		tmp = (x - y) * (((x / y) + 1.0) / y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, 1.52e-142], 1.0, 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 < 1.51999999999999992e-142

   1. Initial program 64.8%

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

      1. associate-/l* 65.6%

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

      2. +-commutative 65.6%

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

      3. +-commutative 65.6%

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

      4. +-commutative 65.6%

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

      5. fma-define 65.6%

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

   3. Simplified 65.6%

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

   5. Taylor expanded in x around inf 37.6%

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

   if 1.51999999999999992e-142 < y

   1. Initial program 99.9%

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

      1. associate-/l* 99.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 78.8%

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

4. Final simplification 44.5%

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

Alternative 13: 41.1% accurate, 2.5× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (if (<= y 4e-142) 1.0 -1.0))

C

double code(double x, double y) {
	double tmp;
	if (y <= 4e-142) {
		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 <= 4d-142) 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 <= 4e-142) {
		tmp = 1.0;
	} else {
		tmp = -1.0;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_] := If[LessEqual[y, 4e-142], 1.0, -1.0]

Derivation

1. Split input into 2 regimes

2. if y < 4.0000000000000002e-142

   1. Initial program 64.8%

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

      1. associate-/l* 65.6%

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

      2. +-commutative 65.6%

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

      3. +-commutative 65.6%

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

      4. +-commutative 65.6%

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

      5. fma-define 65.6%

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

   3. Simplified 65.6%

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

   5. Taylor expanded in x around inf 37.6%

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

   if 4.0000000000000002e-142 < y

   1. Initial program 99.9%

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

      1. associate-/l* 99.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 14: 67.0% 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 70.7%

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

   1. associate-/l* 71.3%

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

   2. +-commutative 71.3%

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

   3. +-commutative 71.3%

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

   4. +-commutative 71.3%

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

   5. fma-define 71.3%

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

3. Simplified 71.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 0 65.3%

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

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