Kahan p9 Example

Percentage Accurate: 68.0% → 100.0%

Time: 10.0s

Alternatives: 13

Speedup: 4.9×

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

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 70.3%

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

   1. add-sqr-sqrt 70.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 70.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-def 70.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-def 99.9%

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

3. 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)}} \]
4. 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. inv-pow 99.9%

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

5. Applied egg-rr 99.9%

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

   1. unpow-1 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}}} \]

7. Simplified 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}}} \]

8. Final simplification 100.0%

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

Alternative 2: 92.6% accurate, 0.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

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

   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. 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-def 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-def 99.9%

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

   3. 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)}} \]
   4. Step-by-step derivation

      1. clear-num 99.9%

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

      2. inv-pow 99.9%

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

   5. Applied egg-rr 99.9%

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

      1. unpow-1 99.9%

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

   7. Simplified 99.9%

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

   8. Taylor expanded in x around 0 46.1%

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

      1. fma-neg 46.1%

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

      2. unpow2 46.1%

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

      3. unpow2 46.1%

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

      4. times-frac 77.1%

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

      5. unpow2 77.1%

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

      6. metadata-eval 77.1%

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

   10. Simplified 77.1%

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

4. Final simplification 93.2%

   \[\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}:\\ \;\;\;\;\mathsf{fma}\left(2, {\left(\frac{x}{y}\right)}^{2}, -1\right)\\ \end{array} \]

Alternative 3: 99.7% accurate, 0.1× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 70.3%

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

   1. +-commutative 70.3%

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

   2. associate-*r/ 70.2%

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

   3. +-commutative 70.2%

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

   4. fma-def 70.2%

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

3. Simplified 70.2%

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

   1. *-un-lft-identity 70.2%

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

   2. fma-def 70.2%

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

   3. add-sqr-sqrt 70.1%

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

   4. times-frac 70.3%

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

   5. hypot-def 70.3%

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

   6. hypot-def 99.7%

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

5. Applied egg-rr 99.7%

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

   1. associate-*l/ 99.7%

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

   2. *-un-lft-identity 99.7%

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

7. Applied egg-rr 99.7%

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

8. Final simplification 99.7%

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

Alternative 4: 100.0% accurate, 0.1× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 70.3%

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

   1. add-sqr-sqrt 70.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 70.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-def 70.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-def 99.9%

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

3. 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)}} \]

4. Final simplification 99.9%

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

Alternative 5: 100.0% accurate, 0.1× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 70.3%

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

   1. add-sqr-sqrt 70.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 70.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-def 70.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-def 99.9%

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

3. 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)}} \]
4. 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. frac-times 99.9%

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

   3. *-rgt-identity 99.9%

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

5. Applied egg-rr 99.9%

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

6. Final simplification 99.9%

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

Alternative 6: 92.6% accurate, 0.1× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

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

   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. 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-def 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-def 99.9%

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

   3. 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)}} \]

   4. Taylor expanded in x around 0 18.4%

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

4. Final simplification 75.7%

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

Alternative 7: 92.5% accurate, 0.1× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

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

   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. +-commutative 0.0%

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

      2. distribute-rgt-in 0.0%

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

   3. Applied egg-rr 0.0%

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

   4. Taylor expanded in x around 0 0.0%

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

      1. mul-1-neg 0.0%

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

      2. distribute-rgt-neg-out 0.0%

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

   6. Simplified 0.0%

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

   7. Taylor expanded in x around 0 46.1%

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

      1. sub-neg 46.1%

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

      2. unpow2 46.1%

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

      3. unpow2 46.1%

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

      4. times-frac 76.6%

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

      5. unpow2 76.6%

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

      6. metadata-eval 76.6%

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

      7. +-commutative 76.6%

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

   9. Simplified 76.6%

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

4. Final simplification 93.0%

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

Alternative 8: 92.5% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

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

   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. 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-def 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-def 99.9%

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

   3. 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)}} \]

   4. Taylor expanded in x around 0 18.4%

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

   5. Taylor expanded in x around 0 76.6%

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

4. Final simplification 93.0%

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

Alternative 9: 83.8% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 2.1000000000000002e-155

   1. Initial program 65.8%

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

      1. +-commutative 65.8%

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

      2. associate-*r/ 65.7%

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

      3. +-commutative 65.7%

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

      4. fma-def 65.7%

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

   3. Simplified 65.7%

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

   4. Taylor expanded in x around inf 35.3%

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

      1. un-div-inv 35.4%

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

   6. Applied egg-rr 35.4%

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

   if 2.1000000000000002e-155 < y

   1. Initial program 99.7%

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

      1. add-sqr-sqrt 99.6%

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

         \[\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-def 99.8%

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

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

   3. 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)}} \]

   4. Taylor expanded in x around 0 85.1%

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

   5. Taylor expanded in x around 0 84.8%

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

4. Final simplification 42.0%

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

Alternative 10: 82.8% accurate, 1.6× speedup

Math

\[\begin{array}{l} y_m = \left|y\right| \\ \begin{array}{l} \mathbf{if}\;y_m \leq 1.1 \cdot 10^{-200}:\\ \;\;\;\;1\\ \mathbf{elif}\;y_m \leq 5.1 \cdot 10^{-186}:\\ \;\;\;\;\frac{x}{y_m} + -1\\ \mathbf{elif}\;y_m \leq 10^{-155}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \end{array} \]

FPCore

y_m = (fabs.f64 y)
(FPCore (x y_m)
 :precision binary64
 (if (<= y_m 1.1e-200)
   1.0
   (if (<= y_m 5.1e-186) (+ (/ x y_m) -1.0) (if (<= y_m 1e-155) 1.0 -1.0))))

C

y_m = fabs(y);
double code(double x, double y_m) {
	double tmp;
	if (y_m <= 1.1e-200) {
		tmp = 1.0;
	} else if (y_m <= 5.1e-186) {
		tmp = (x / y_m) + -1.0;
	} else if (y_m <= 1e-155) {
		tmp = 1.0;
	} else {
		tmp = -1.0;
	}
	return tmp;
}

Fortran

y_m = abs(y)
real(8) function code(x, y_m)
    real(8), intent (in) :: x
    real(8), intent (in) :: y_m
    real(8) :: tmp
    if (y_m <= 1.1d-200) then
        tmp = 1.0d0
    else if (y_m <= 5.1d-186) then
        tmp = (x / y_m) + (-1.0d0)
    else if (y_m <= 1d-155) then
        tmp = 1.0d0
    else
        tmp = -1.0d0
    end if
    code = tmp
end function

Java

y_m = Math.abs(y);
public static double code(double x, double y_m) {
	double tmp;
	if (y_m <= 1.1e-200) {
		tmp = 1.0;
	} else if (y_m <= 5.1e-186) {
		tmp = (x / y_m) + -1.0;
	} else if (y_m <= 1e-155) {
		tmp = 1.0;
	} else {
		tmp = -1.0;
	}
	return tmp;
}

Python

y_m = math.fabs(y)
def code(x, y_m):
	tmp = 0
	if y_m <= 1.1e-200:
		tmp = 1.0
	elif y_m <= 5.1e-186:
		tmp = (x / y_m) + -1.0
	elif y_m <= 1e-155:
		tmp = 1.0
	else:
		tmp = -1.0
	return tmp

Julia

y_m = abs(y)
function code(x, y_m)
	tmp = 0.0
	if (y_m <= 1.1e-200)
		tmp = 1.0;
	elseif (y_m <= 5.1e-186)
		tmp = Float64(Float64(x / y_m) + -1.0);
	elseif (y_m <= 1e-155)
		tmp = 1.0;
	else
		tmp = -1.0;
	end
	return tmp
end

MATLAB

y_m = abs(y);
function tmp_2 = code(x, y_m)
	tmp = 0.0;
	if (y_m <= 1.1e-200)
		tmp = 1.0;
	elseif (y_m <= 5.1e-186)
		tmp = (x / y_m) + -1.0;
	elseif (y_m <= 1e-155)
		tmp = 1.0;
	else
		tmp = -1.0;
	end
	tmp_2 = tmp;
end

Wolfram

y_m = N[Abs[y], $MachinePrecision]
code[x_, y$95$m_] := If[LessEqual[y$95$m, 1.1e-200], 1.0, If[LessEqual[y$95$m, 5.1e-186], N[(N[(x / y$95$m), $MachinePrecision] + -1.0), $MachinePrecision], If[LessEqual[y$95$m, 1e-155], 1.0, -1.0]]]

Derivation

1. Split input into 3 regimes

2. if y < 1.10000000000000007e-200 or 5.1000000000000003e-186 < y < 1.00000000000000001e-155

   1. Initial program 66.3%

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

      1. +-commutative 66.3%

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

      2. associate-*r/ 66.3%

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

      3. +-commutative 66.3%

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

      4. fma-def 66.3%

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

   3. Simplified 66.3%

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

   4. Taylor expanded in x around inf 35.3%

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

   if 1.10000000000000007e-200 < y < 5.1000000000000003e-186

   1. Initial program 40.0%

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

      1. add-sqr-sqrt 40.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 41.9%

         \[\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-def 41.9%

         \[\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-def 99.7%

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

   3. Applied egg-rr 99.7%

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

   4. Taylor expanded in x around 0 46.3%

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

      1. *-commutative 46.3%

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

      2. clear-num 46.3%

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

      3. flip-- 46.0%

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

      4. frac-times 46.0%

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

      5. metadata-eval 46.0%

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

      6. *-un-lft-identity 46.0%

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

      7. sub-neg 46.0%

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

      8. pow2 46.0%

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

      9. metadata-eval 46.0%

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

   6. Applied egg-rr 47.1%

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

      1. *-inverses 47.1%

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

      2. *-commutative 47.1%

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

      3. *-commutative 47.1%

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

      4. +-commutative 47.1%

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

      5. *-lft-identity 47.1%

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

      6. +-commutative 47.1%

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

   8. Simplified 47.1%

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

   9. Taylor expanded in x around 0 47.4%

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

   if 1.00000000000000001e-155 < y

   1. Initial program 99.7%

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

      1. +-commutative 99.7%

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

      2. associate-*r/ 99.3%

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

      3. +-commutative 99.3%

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

      4. fma-def 99.3%

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

   3. Simplified 99.3%

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

   4. Taylor expanded in x around 0 83.6%

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

4. Final simplification 41.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 1.1 \cdot 10^{-200}:\\ \;\;\;\;1\\ \mathbf{elif}\;y \leq 5.1 \cdot 10^{-186}:\\ \;\;\;\;\frac{x}{y} + -1\\ \mathbf{elif}\;y \leq 10^{-155}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \]

Alternative 11: 83.4% accurate, 2.1× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 3.14999999999999985e-155

   1. Initial program 65.8%

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

      1. +-commutative 65.8%

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

      2. associate-*r/ 65.7%

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

      3. +-commutative 65.7%

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

      4. fma-def 65.7%

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

   3. Simplified 65.7%

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

   4. Taylor expanded in x around inf 35.3%

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

      1. un-div-inv 35.4%

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

   6. Applied egg-rr 35.4%

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

   if 3.14999999999999985e-155 < y

   1. Initial program 99.7%

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

      1. +-commutative 99.7%

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

      2. associate-*r/ 99.3%

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

      3. +-commutative 99.3%

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

      4. fma-def 99.3%

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

   3. Simplified 99.3%

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

   4. Taylor expanded in x around 0 83.6%

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

4. Final simplification 41.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 3.15 \cdot 10^{-155}:\\ \;\;\;\;\frac{x - y}{x}\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \]

Alternative 12: 83.2% accurate, 4.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 9.4999999999999994e-156

   1. Initial program 65.8%

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

      1. +-commutative 65.8%

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

      2. associate-*r/ 65.7%

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

      3. +-commutative 65.7%

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

      4. fma-def 65.7%

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

   3. Simplified 65.7%

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

   4. Taylor expanded in x around inf 35.5%

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

   if 9.4999999999999994e-156 < y

   1. Initial program 99.7%

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

      1. +-commutative 99.7%

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

      2. associate-*r/ 99.3%

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

      3. +-commutative 99.3%

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

      4. fma-def 99.3%

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

   3. Simplified 99.3%

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

   4. Taylor expanded in x around 0 83.6%

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

4. Final simplification 41.8%

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

Alternative 13: 66.8% accurate, 15.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 70.3%

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

   1. +-commutative 70.3%

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

   2. associate-*r/ 70.2%

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

   3. +-commutative 70.2%

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

   4. fma-def 70.2%

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

3. Simplified 70.2%

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

4. Taylor expanded in x around 0 67.1%

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

5. Final simplification 67.1%

   \[\leadsto -1 \]

Developer target: 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 2023315 
(FPCore (x y)
  :name "Kahan p9 Example"
  :precision binary64
  :pre (and (and (< 0.0 x) (< x 1.0)) (< y 1.0))

  :herbie-target
  (if (and (< 0.5 (fabs (/ x y))) (< (fabs (/ x y)) 2.0)) (/ (* (- x y) (+ x y)) (+ (* x x) (* y y))) (- 1.0 (/ 2.0 (+ 1.0 (* (/ x y) (/ x y))))))

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