Statistics.Distribution.CauchyLorentz:$cdensity from math-functions-0.1.5.2

Percentage Accurate: 88.7% → 99.3%

Time: 10.8s

Alternatives: 10

Speedup: 0.5×

Specification

Math

\[\begin{array}{l} \\ \frac{\frac{1}{x}}{y \cdot \left(1 + z \cdot z\right)} \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (/ (/ 1.0 x) (* y (+ 1.0 (* z z)))))

C

double code(double x, double y, double z) {
	return (1.0 / x) / (y * (1.0 + (z * z)));
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (1.0d0 / x) / (y * (1.0d0 + (z * z)))
end function

Java

public static double code(double x, double y, double z) {
	return (1.0 / x) / (y * (1.0 + (z * z)));
}

Python

def code(x, y, z):
	return (1.0 / x) / (y * (1.0 + (z * z)))

Julia

function code(x, y, z)
	return Float64(Float64(1.0 / x) / Float64(y * Float64(1.0 + Float64(z * z))))
end

MATLAB

function tmp = code(x, y, z)
	tmp = (1.0 / x) / (y * (1.0 + (z * z)));
end

Wolfram

code[x_, y_, z_] := N[(N[(1.0 / x), $MachinePrecision] / N[(y * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 88.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{\frac{1}{x}}{y \cdot \left(1 + z \cdot z\right)} \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (/ (/ 1.0 x) (* y (+ 1.0 (* z z)))))

C

double code(double x, double y, double z) {
	return (1.0 / x) / (y * (1.0 + (z * z)));
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (1.0d0 / x) / (y * (1.0d0 + (z * z)))
end function

Java

public static double code(double x, double y, double z) {
	return (1.0 / x) / (y * (1.0 + (z * z)));
}

Python

def code(x, y, z):
	return (1.0 / x) / (y * (1.0 + (z * z)))

Julia

function code(x, y, z)
	return Float64(Float64(1.0 / x) / Float64(y * Float64(1.0 + Float64(z * z))))
end

MATLAB

function tmp = code(x, y, z)
	tmp = (1.0 / x) / (y * (1.0 + (z * z)));
end

Wolfram

code[x_, y_, z_] := N[(N[(1.0 / x), $MachinePrecision] / N[(y * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.3% accurate, 0.1× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ [x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\ \\ y\_s \cdot \left(x\_s \cdot \begin{array}{l} \mathbf{if}\;z \cdot z \leq 2 \cdot 10^{+261}:\\ \;\;\;\;\frac{\frac{\frac{1}{x\_m}}{{\left(\mathsf{hypot}\left(1, z\right)\right)}^{2}}}{y\_m}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\frac{1}{y\_m}}{z \cdot x\_m}}{z}\\ \end{array}\right) \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (*
  y_s
  (*
   x_s
   (if (<= (* z z) 2e+261)
     (/ (/ (/ 1.0 x_m) (pow (hypot 1.0 z) 2.0)) y_m)
     (/ (/ (/ 1.0 y_m) (* z x_m)) z)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if ((z * z) <= 2e+261) {
		tmp = ((1.0 / x_m) / pow(hypot(1.0, z), 2.0)) / y_m;
	} else {
		tmp = ((1.0 / y_m) / (z * x_m)) / z;
	}
	return y_s * (x_s * tmp);
}

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if ((z * z) <= 2e+261) {
		tmp = ((1.0 / x_m) / Math.pow(Math.hypot(1.0, z), 2.0)) / y_m;
	} else {
		tmp = ((1.0 / y_m) / (z * x_m)) / z;
	}
	return y_s * (x_s * tmp);
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
[x_m, y_m, z] = sort([x_m, y_m, z])
def code(y_s, x_s, x_m, y_m, z):
	tmp = 0
	if (z * z) <= 2e+261:
		tmp = ((1.0 / x_m) / math.pow(math.hypot(1.0, z), 2.0)) / y_m
	else:
		tmp = ((1.0 / y_m) / (z * x_m)) / z
	return y_s * (x_s * tmp)

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
y\_m = abs(y)
y\_s = copysign(1.0, y)
x_m, y_m, z = sort([x_m, y_m, z])
function code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0
	if (Float64(z * z) <= 2e+261)
		tmp = Float64(Float64(Float64(1.0 / x_m) / (hypot(1.0, z) ^ 2.0)) / y_m);
	else
		tmp = Float64(Float64(Float64(1.0 / y_m) / Float64(z * x_m)) / z);
	end
	return Float64(y_s * Float64(x_s * tmp))
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0;
	if ((z * z) <= 2e+261)
		tmp = ((1.0 / x_m) / (hypot(1.0, z) ^ 2.0)) / y_m;
	else
		tmp = ((1.0 / y_m) / (z * x_m)) / z;
	end
	tmp_2 = y_s * (x_s * tmp);
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 2e+261], N[(N[(N[(1.0 / x$95$m), $MachinePrecision] / N[Power[N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] / y$95$m), $MachinePrecision], N[(N[(N[(1.0 / y$95$m), $MachinePrecision] / N[(z * x$95$m), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 z z) < 1.9999999999999999e261

   1. Initial program 96.6%

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

      1. *-commutative 96.6%

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

      2. associate-/r* 98.1%

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

      3. add-sqr-sqrt 98.1%

         \[\leadsto \frac{\frac{\frac{1}{x}}{\color{blue}{\sqrt{1 + z \cdot z} \cdot \sqrt{1 + z \cdot z}}}}{y} \]

      4. pow2 98.1%

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

      5. hypot-1-def 98.1%

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

   4. Applied egg-rr 98.1%

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

   if 1.9999999999999999e261 < (*.f64 z z)

   1. Initial program 78.0%

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

   3. Taylor expanded in z around inf 78.0%

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

      1. associate-/r* 78.0%

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

      2. associate-/r* 77.7%

         \[\leadsto \color{blue}{\frac{\frac{\frac{1}{x}}{y}}{{z}^{2}}} \]

      3. associate-/r* 77.7%

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

   5. Simplified 77.7%

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

      1. unpow2 77.7%

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

      2. associate-/r* 90.1%

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

      3. associate-/r* 90.1%

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

   7. Applied egg-rr 90.1%

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

      1. associate-/r* 90.1%

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

      2. associate-/l/ 90.0%

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

      3. associate-/l/ 99.8%

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

   9. Applied egg-rr 99.8%

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

Alternative 2: 99.3% accurate, 0.0× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ [x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\ \\ \begin{array}{l} t_0 := \mathsf{hypot}\left(1, z\right) \cdot \sqrt{y\_m}\\ y\_s \cdot \left(x\_s \cdot \left(\frac{1}{t\_0} \cdot \frac{\frac{1}{x\_m}}{t\_0}\right)\right) \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (let* ((t_0 (* (hypot 1.0 z) (sqrt y_m))))
   (* y_s (* x_s (* (/ 1.0 t_0) (/ (/ 1.0 x_m) t_0))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double t_0 = hypot(1.0, z) * sqrt(y_m);
	return y_s * (x_s * ((1.0 / t_0) * ((1.0 / x_m) / t_0)));
}

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double t_0 = Math.hypot(1.0, z) * Math.sqrt(y_m);
	return y_s * (x_s * ((1.0 / t_0) * ((1.0 / x_m) / t_0)));
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
[x_m, y_m, z] = sort([x_m, y_m, z])
def code(y_s, x_s, x_m, y_m, z):
	t_0 = math.hypot(1.0, z) * math.sqrt(y_m)
	return y_s * (x_s * ((1.0 / t_0) * ((1.0 / x_m) / t_0)))

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
y\_m = abs(y)
y\_s = copysign(1.0, y)
x_m, y_m, z = sort([x_m, y_m, z])
function code(y_s, x_s, x_m, y_m, z)
	t_0 = Float64(hypot(1.0, z) * sqrt(y_m))
	return Float64(y_s * Float64(x_s * Float64(Float64(1.0 / t_0) * Float64(Float64(1.0 / x_m) / t_0))))
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp = code(y_s, x_s, x_m, y_m, z)
	t_0 = hypot(1.0, z) * sqrt(y_m);
	tmp = y_s * (x_s * ((1.0 / t_0) * ((1.0 / x_m) / t_0)));
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision] * N[Sqrt[y$95$m], $MachinePrecision]), $MachinePrecision]}, N[(y$95$s * N[(x$95$s * N[(N[(1.0 / t$95$0), $MachinePrecision] * N[(N[(1.0 / x$95$m), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Initial program 91.6%

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

   1. *-un-lft-identity 91.6%

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

   2. add-sqr-sqrt 48.0%

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

   3. times-frac 48.0%

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

   4. *-commutative 48.0%

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

   5. sqrt-prod 48.0%

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

   6. hypot-1-def 48.0%

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

   7. *-commutative 48.0%

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

   8. sqrt-prod 49.5%

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

   9. hypot-1-def 52.8%

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

4. Applied egg-rr 52.8%

   \[\leadsto \color{blue}{\frac{1}{\mathsf{hypot}\left(1, z\right) \cdot \sqrt{y}} \cdot \frac{\frac{1}{x}}{\mathsf{hypot}\left(1, z\right) \cdot \sqrt{y}}} \]
5. Add Preprocessing

Alternative 3: 98.7% accurate, 0.1× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ [x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\ \\ y\_s \cdot \left(x\_s \cdot \frac{\frac{\frac{\frac{1}{x\_m}}{\mathsf{hypot}\left(1, z\right)}}{\mathsf{hypot}\left(1, z\right)}}{y\_m}\right) \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (* y_s (* x_s (/ (/ (/ (/ 1.0 x_m) (hypot 1.0 z)) (hypot 1.0 z)) y_m))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	return y_s * (x_s * ((((1.0 / x_m) / hypot(1.0, z)) / hypot(1.0, z)) / y_m));
}

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
	return y_s * (x_s * ((((1.0 / x_m) / Math.hypot(1.0, z)) / Math.hypot(1.0, z)) / y_m));
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
[x_m, y_m, z] = sort([x_m, y_m, z])
def code(y_s, x_s, x_m, y_m, z):
	return y_s * (x_s * ((((1.0 / x_m) / math.hypot(1.0, z)) / math.hypot(1.0, z)) / y_m))

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
y\_m = abs(y)
y\_s = copysign(1.0, y)
x_m, y_m, z = sort([x_m, y_m, z])
function code(y_s, x_s, x_m, y_m, z)
	return Float64(y_s * Float64(x_s * Float64(Float64(Float64(Float64(1.0 / x_m) / hypot(1.0, z)) / hypot(1.0, z)) / y_m)))
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp = code(y_s, x_s, x_m, y_m, z)
	tmp = y_s * (x_s * ((((1.0 / x_m) / hypot(1.0, z)) / hypot(1.0, z)) / y_m));
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * N[(N[(N[(N[(1.0 / x$95$m), $MachinePrecision] / N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision]), $MachinePrecision] / N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision]), $MachinePrecision] / y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 91.6%

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

   1. *-un-lft-identity 91.6%

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

   2. add-sqr-sqrt 48.0%

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

   3. times-frac 48.0%

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

   4. *-commutative 48.0%

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

   5. sqrt-prod 48.0%

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

   6. hypot-1-def 48.0%

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

   7. *-commutative 48.0%

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

   8. sqrt-prod 49.5%

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

   9. hypot-1-def 52.8%

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

4. Applied egg-rr 52.8%

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

   1. *-commutative 52.8%

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

   2. associate-/r* 52.3%

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

   3. associate-/r* 52.3%

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

   4. frac-times 51.4%

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

   5. add-sqr-sqrt 97.2%

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

6. Applied egg-rr 97.2%

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

   1. associate-*r/ 97.2%

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

   2. *-rgt-identity 97.2%

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

8. Simplified 97.2%

   \[\leadsto \color{blue}{\frac{\frac{\frac{\frac{1}{x}}{\mathsf{hypot}\left(1, z\right)}}{\mathsf{hypot}\left(1, z\right)}}{y}} \]
9. Add Preprocessing

Alternative 4: 88.7% accurate, 0.1× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ [x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\ \\ y\_s \cdot \left(x\_s \cdot \begin{array}{l} \mathbf{if}\;y\_m \cdot \left(1 + z \cdot z\right) \leq \infty:\\ \;\;\;\;\frac{\frac{1}{y\_m + y\_m \cdot {z}^{2}}}{x\_m}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\frac{1}{y\_m}}{z \cdot x\_m}}{z}\\ \end{array}\right) \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (*
  y_s
  (*
   x_s
   (if (<= (* y_m (+ 1.0 (* z z))) INFINITY)
     (/ (/ 1.0 (+ y_m (* y_m (pow z 2.0)))) x_m)
     (/ (/ (/ 1.0 y_m) (* z x_m)) z)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if ((y_m * (1.0 + (z * z))) <= ((double) INFINITY)) {
		tmp = (1.0 / (y_m + (y_m * pow(z, 2.0)))) / x_m;
	} else {
		tmp = ((1.0 / y_m) / (z * x_m)) / z;
	}
	return y_s * (x_s * tmp);
}

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if ((y_m * (1.0 + (z * z))) <= Double.POSITIVE_INFINITY) {
		tmp = (1.0 / (y_m + (y_m * Math.pow(z, 2.0)))) / x_m;
	} else {
		tmp = ((1.0 / y_m) / (z * x_m)) / z;
	}
	return y_s * (x_s * tmp);
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
[x_m, y_m, z] = sort([x_m, y_m, z])
def code(y_s, x_s, x_m, y_m, z):
	tmp = 0
	if (y_m * (1.0 + (z * z))) <= math.inf:
		tmp = (1.0 / (y_m + (y_m * math.pow(z, 2.0)))) / x_m
	else:
		tmp = ((1.0 / y_m) / (z * x_m)) / z
	return y_s * (x_s * tmp)

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
y\_m = abs(y)
y\_s = copysign(1.0, y)
x_m, y_m, z = sort([x_m, y_m, z])
function code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0
	if (Float64(y_m * Float64(1.0 + Float64(z * z))) <= Inf)
		tmp = Float64(Float64(1.0 / Float64(y_m + Float64(y_m * (z ^ 2.0)))) / x_m);
	else
		tmp = Float64(Float64(Float64(1.0 / y_m) / Float64(z * x_m)) / z);
	end
	return Float64(y_s * Float64(x_s * tmp))
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0;
	if ((y_m * (1.0 + (z * z))) <= Inf)
		tmp = (1.0 / (y_m + (y_m * (z ^ 2.0)))) / x_m;
	else
		tmp = ((1.0 / y_m) / (z * x_m)) / z;
	end
	tmp_2 = y_s * (x_s * tmp);
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(y$95$m * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(1.0 / N[(y$95$m + N[(y$95$m * N[Power[z, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / x$95$m), $MachinePrecision], N[(N[(N[(1.0 / y$95$m), $MachinePrecision] / N[(z * x$95$m), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))) < +inf.0

   1. Initial program 91.6%

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

      1. associate-/l/ 91.3%

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

      2. associate-/r* 91.6%

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

      3. add-sqr-sqrt 91.6%

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

      4. pow2 91.6%

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

      5. hypot-1-def 91.6%

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

   4. Applied egg-rr 91.6%

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

   5. Taylor expanded in z around 0 91.6%

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

   if +inf.0 < (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z)))

   1. Initial program 91.6%

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

   3. Taylor expanded in z around inf 48.1%

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

      1. associate-/r* 48.1%

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

      2. associate-/r* 49.8%

         \[\leadsto \color{blue}{\frac{\frac{\frac{1}{x}}{y}}{{z}^{2}}} \]

      3. associate-/r* 49.9%

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

   5. Simplified 49.9%

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

      1. unpow2 49.9%

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

      2. associate-/r* 56.4%

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

      3. associate-/r* 56.3%

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

   7. Applied egg-rr 56.3%

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

      1. associate-/r* 56.4%

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

      2. associate-/l/ 56.3%

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

      3. associate-/l/ 55.5%

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

   9. Applied egg-rr 55.5%

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

Alternative 5: 88.7% accurate, 0.1× speedup

Math

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

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (*
  y_s
  (*
   x_s
   (if (<= (* y_m (+ 1.0 (* z z))) INFINITY)
     (/ (/ 1.0 (* y_m (fma z z 1.0))) x_m)
     (/ (/ (/ 1.0 y_m) (* z x_m)) z)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if ((y_m * (1.0 + (z * z))) <= ((double) INFINITY)) {
		tmp = (1.0 / (y_m * fma(z, z, 1.0))) / x_m;
	} else {
		tmp = ((1.0 / y_m) / (z * x_m)) / z;
	}
	return y_s * (x_s * tmp);
}

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
y\_m = abs(y)
y\_s = copysign(1.0, y)
x_m, y_m, z = sort([x_m, y_m, z])
function code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0
	if (Float64(y_m * Float64(1.0 + Float64(z * z))) <= Inf)
		tmp = Float64(Float64(1.0 / Float64(y_m * fma(z, z, 1.0))) / x_m);
	else
		tmp = Float64(Float64(Float64(1.0 / y_m) / Float64(z * x_m)) / z);
	end
	return Float64(y_s * Float64(x_s * tmp))
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(y$95$m * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(1.0 / N[(y$95$m * N[(z * z + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / x$95$m), $MachinePrecision], N[(N[(N[(1.0 / y$95$m), $MachinePrecision] / N[(z * x$95$m), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))) < +inf.0

   1. Initial program 91.6%

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

      1. associate-/l/ 91.3%

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

      2. associate-/r* 91.6%

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

      3. add-sqr-sqrt 91.6%

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

      4. pow2 91.6%

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

      5. hypot-1-def 91.6%

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

   4. Applied egg-rr 91.6%

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

   5. Taylor expanded in y around 0 91.6%

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

      1. +-commutative 91.6%

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

      2. unpow2 91.6%

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

      3. fma-define 91.6%

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

   7. Simplified 91.6%

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

   if +inf.0 < (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z)))

   1. Initial program 91.6%

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

   3. Taylor expanded in z around inf 48.1%

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

      1. associate-/r* 48.1%

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

      2. associate-/r* 49.8%

         \[\leadsto \color{blue}{\frac{\frac{\frac{1}{x}}{y}}{{z}^{2}}} \]

      3. associate-/r* 49.9%

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

   5. Simplified 49.9%

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

      1. unpow2 49.9%

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

      2. associate-/r* 56.4%

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

      3. associate-/r* 56.3%

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

   7. Applied egg-rr 56.3%

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

      1. associate-/r* 56.4%

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

      2. associate-/l/ 56.3%

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

      3. associate-/l/ 55.5%

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

   9. Applied egg-rr 55.5%

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

Alternative 6: 88.7% accurate, 0.5× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ [x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\ \\ \begin{array}{l} t_0 := y\_m \cdot \left(1 + z \cdot z\right)\\ y\_s \cdot \left(x\_s \cdot \begin{array}{l} \mathbf{if}\;t\_0 \leq \infty:\\ \;\;\;\;\frac{\frac{1}{x\_m}}{t\_0}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\frac{1}{y\_m}}{z \cdot x\_m}}{z}\\ \end{array}\right) \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (let* ((t_0 (* y_m (+ 1.0 (* z z)))))
   (*
    y_s
    (*
     x_s
     (if (<= t_0 INFINITY)
       (/ (/ 1.0 x_m) t_0)
       (/ (/ (/ 1.0 y_m) (* z x_m)) z))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double t_0 = y_m * (1.0 + (z * z));
	double tmp;
	if (t_0 <= ((double) INFINITY)) {
		tmp = (1.0 / x_m) / t_0;
	} else {
		tmp = ((1.0 / y_m) / (z * x_m)) / z;
	}
	return y_s * (x_s * tmp);
}

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double t_0 = y_m * (1.0 + (z * z));
	double tmp;
	if (t_0 <= Double.POSITIVE_INFINITY) {
		tmp = (1.0 / x_m) / t_0;
	} else {
		tmp = ((1.0 / y_m) / (z * x_m)) / z;
	}
	return y_s * (x_s * tmp);
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
[x_m, y_m, z] = sort([x_m, y_m, z])
def code(y_s, x_s, x_m, y_m, z):
	t_0 = y_m * (1.0 + (z * z))
	tmp = 0
	if t_0 <= math.inf:
		tmp = (1.0 / x_m) / t_0
	else:
		tmp = ((1.0 / y_m) / (z * x_m)) / z
	return y_s * (x_s * tmp)

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
y\_m = abs(y)
y\_s = copysign(1.0, y)
x_m, y_m, z = sort([x_m, y_m, z])
function code(y_s, x_s, x_m, y_m, z)
	t_0 = Float64(y_m * Float64(1.0 + Float64(z * z)))
	tmp = 0.0
	if (t_0 <= Inf)
		tmp = Float64(Float64(1.0 / x_m) / t_0);
	else
		tmp = Float64(Float64(Float64(1.0 / y_m) / Float64(z * x_m)) / z);
	end
	return Float64(y_s * Float64(x_s * tmp))
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
	t_0 = y_m * (1.0 + (z * z));
	tmp = 0.0;
	if (t_0 <= Inf)
		tmp = (1.0 / x_m) / t_0;
	else
		tmp = ((1.0 / y_m) / (z * x_m)) / z;
	end
	tmp_2 = y_s * (x_s * tmp);
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(y$95$m * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(y$95$s * N[(x$95$s * If[LessEqual[t$95$0, Infinity], N[(N[(1.0 / x$95$m), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(N[(1.0 / y$95$m), $MachinePrecision] / N[(z * x$95$m), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))) < +inf.0

   1. Initial program 91.6%

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

   if +inf.0 < (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z)))

   1. Initial program 91.6%

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

   3. Taylor expanded in z around inf 48.1%

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

      1. associate-/r* 48.1%

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

      2. associate-/r* 49.8%

         \[\leadsto \color{blue}{\frac{\frac{\frac{1}{x}}{y}}{{z}^{2}}} \]

      3. associate-/r* 49.9%

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

   5. Simplified 49.9%

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

      1. unpow2 49.9%

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

      2. associate-/r* 56.4%

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

      3. associate-/r* 56.3%

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

   7. Applied egg-rr 56.3%

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

      1. associate-/r* 56.4%

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

      2. associate-/l/ 56.3%

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

      3. associate-/l/ 55.5%

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

   9. Applied egg-rr 55.5%

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

Alternative 7: 78.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ [x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\ \\ y\_s \cdot \left(x\_s \cdot \begin{array}{l} \mathbf{if}\;z \leq 1:\\ \;\;\;\;\frac{\frac{1}{y\_m}}{x\_m}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\frac{1}{y\_m}}{z \cdot x\_m}}{z}\\ \end{array}\right) \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (*
  y_s
  (* x_s (if (<= z 1.0) (/ (/ 1.0 y_m) x_m) (/ (/ (/ 1.0 y_m) (* z x_m)) z)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if (z <= 1.0) {
		tmp = (1.0 / y_m) / x_m;
	} else {
		tmp = ((1.0 / y_m) / (z * x_m)) / z;
	}
	return y_s * (x_s * tmp);
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z)
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= 1.0d0) then
        tmp = (1.0d0 / y_m) / x_m
    else
        tmp = ((1.0d0 / y_m) / (z * x_m)) / z
    end if
    code = y_s * (x_s * tmp)
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if (z <= 1.0) {
		tmp = (1.0 / y_m) / x_m;
	} else {
		tmp = ((1.0 / y_m) / (z * x_m)) / z;
	}
	return y_s * (x_s * tmp);
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
[x_m, y_m, z] = sort([x_m, y_m, z])
def code(y_s, x_s, x_m, y_m, z):
	tmp = 0
	if z <= 1.0:
		tmp = (1.0 / y_m) / x_m
	else:
		tmp = ((1.0 / y_m) / (z * x_m)) / z
	return y_s * (x_s * tmp)

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
y\_m = abs(y)
y\_s = copysign(1.0, y)
x_m, y_m, z = sort([x_m, y_m, z])
function code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0
	if (z <= 1.0)
		tmp = Float64(Float64(1.0 / y_m) / x_m);
	else
		tmp = Float64(Float64(Float64(1.0 / y_m) / Float64(z * x_m)) / z);
	end
	return Float64(y_s * Float64(x_s * tmp))
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0;
	if (z <= 1.0)
		tmp = (1.0 / y_m) / x_m;
	else
		tmp = ((1.0 / y_m) / (z * x_m)) / z;
	end
	tmp_2 = y_s * (x_s * tmp);
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[z, 1.0], N[(N[(1.0 / y$95$m), $MachinePrecision] / x$95$m), $MachinePrecision], N[(N[(N[(1.0 / y$95$m), $MachinePrecision] / N[(z * x$95$m), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < 1

   1. Initial program 93.6%

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

      1. associate-/l/ 93.3%

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

      2. associate-/r* 93.6%

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

      3. add-sqr-sqrt 93.6%

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

      4. pow2 93.6%

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

      5. hypot-1-def 93.6%

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

   4. Applied egg-rr 93.6%

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

   5. Taylor expanded in z around 0 74.9%

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

   if 1 < z

   1. Initial program 85.8%

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

   3. Taylor expanded in z around inf 83.8%

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

      1. associate-/r* 83.7%

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

      2. associate-/r* 85.2%

         \[\leadsto \color{blue}{\frac{\frac{\frac{1}{x}}{y}}{{z}^{2}}} \]

      3. associate-/r* 85.1%

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

   5. Simplified 85.1%

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

      1. unpow2 85.1%

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

      2. associate-/r* 90.6%

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

      3. associate-/r* 90.7%

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

   7. Applied egg-rr 90.7%

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

      1. associate-/r* 90.6%

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

      2. associate-/l/ 90.7%

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

      3. associate-/l/ 95.0%

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

   9. Applied egg-rr 95.0%

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

Alternative 8: 77.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ [x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\ \\ y\_s \cdot \left(x\_s \cdot \begin{array}{l} \mathbf{if}\;z \leq 1:\\ \;\;\;\;\frac{\frac{1}{y\_m}}{x\_m}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{1}{x\_m \cdot \left(z \cdot y\_m\right)}}{z}\\ \end{array}\right) \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (*
  y_s
  (* x_s (if (<= z 1.0) (/ (/ 1.0 y_m) x_m) (/ (/ 1.0 (* x_m (* z y_m))) z)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if (z <= 1.0) {
		tmp = (1.0 / y_m) / x_m;
	} else {
		tmp = (1.0 / (x_m * (z * y_m))) / z;
	}
	return y_s * (x_s * tmp);
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z)
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= 1.0d0) then
        tmp = (1.0d0 / y_m) / x_m
    else
        tmp = (1.0d0 / (x_m * (z * y_m))) / z
    end if
    code = y_s * (x_s * tmp)
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if (z <= 1.0) {
		tmp = (1.0 / y_m) / x_m;
	} else {
		tmp = (1.0 / (x_m * (z * y_m))) / z;
	}
	return y_s * (x_s * tmp);
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
[x_m, y_m, z] = sort([x_m, y_m, z])
def code(y_s, x_s, x_m, y_m, z):
	tmp = 0
	if z <= 1.0:
		tmp = (1.0 / y_m) / x_m
	else:
		tmp = (1.0 / (x_m * (z * y_m))) / z
	return y_s * (x_s * tmp)

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
y\_m = abs(y)
y\_s = copysign(1.0, y)
x_m, y_m, z = sort([x_m, y_m, z])
function code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0
	if (z <= 1.0)
		tmp = Float64(Float64(1.0 / y_m) / x_m);
	else
		tmp = Float64(Float64(1.0 / Float64(x_m * Float64(z * y_m))) / z);
	end
	return Float64(y_s * Float64(x_s * tmp))
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0;
	if (z <= 1.0)
		tmp = (1.0 / y_m) / x_m;
	else
		tmp = (1.0 / (x_m * (z * y_m))) / z;
	end
	tmp_2 = y_s * (x_s * tmp);
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[z, 1.0], N[(N[(1.0 / y$95$m), $MachinePrecision] / x$95$m), $MachinePrecision], N[(N[(1.0 / N[(x$95$m * N[(z * y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < 1

   1. Initial program 93.6%

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

      1. associate-/l/ 93.3%

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

      2. associate-/r* 93.6%

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

      3. add-sqr-sqrt 93.6%

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

      4. pow2 93.6%

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

      5. hypot-1-def 93.6%

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

   4. Applied egg-rr 93.6%

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

   5. Taylor expanded in z around 0 74.9%

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

   if 1 < z

   1. Initial program 85.8%

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

   3. Taylor expanded in z around inf 83.8%

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

      1. associate-/r* 83.7%

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

      2. associate-/r* 85.2%

         \[\leadsto \color{blue}{\frac{\frac{\frac{1}{x}}{y}}{{z}^{2}}} \]

      3. associate-/r* 85.1%

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

   5. Simplified 85.1%

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

      1. unpow2 85.1%

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

      2. associate-/r* 90.6%

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

      3. associate-/r* 90.7%

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

   7. Applied egg-rr 90.7%

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

      1. associate-/r* 93.4%

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

      2. associate-/l/ 93.5%

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

   9. Applied egg-rr 93.5%

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

4. Final simplification 79.8%

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

Alternative 9: 76.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ [x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\ \\ y\_s \cdot \left(x\_s \cdot \begin{array}{l} \mathbf{if}\;z \leq 1:\\ \;\;\;\;\frac{\frac{1}{y\_m}}{x\_m}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{z \cdot \left(z \cdot \left(y\_m \cdot x\_m\right)\right)}\\ \end{array}\right) \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (*
  y_s
  (* x_s (if (<= z 1.0) (/ (/ 1.0 y_m) x_m) (/ 1.0 (* z (* z (* y_m x_m))))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if (z <= 1.0) {
		tmp = (1.0 / y_m) / x_m;
	} else {
		tmp = 1.0 / (z * (z * (y_m * x_m)));
	}
	return y_s * (x_s * tmp);
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z)
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= 1.0d0) then
        tmp = (1.0d0 / y_m) / x_m
    else
        tmp = 1.0d0 / (z * (z * (y_m * x_m)))
    end if
    code = y_s * (x_s * tmp)
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if (z <= 1.0) {
		tmp = (1.0 / y_m) / x_m;
	} else {
		tmp = 1.0 / (z * (z * (y_m * x_m)));
	}
	return y_s * (x_s * tmp);
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
[x_m, y_m, z] = sort([x_m, y_m, z])
def code(y_s, x_s, x_m, y_m, z):
	tmp = 0
	if z <= 1.0:
		tmp = (1.0 / y_m) / x_m
	else:
		tmp = 1.0 / (z * (z * (y_m * x_m)))
	return y_s * (x_s * tmp)

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
y\_m = abs(y)
y\_s = copysign(1.0, y)
x_m, y_m, z = sort([x_m, y_m, z])
function code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0
	if (z <= 1.0)
		tmp = Float64(Float64(1.0 / y_m) / x_m);
	else
		tmp = Float64(1.0 / Float64(z * Float64(z * Float64(y_m * x_m))));
	end
	return Float64(y_s * Float64(x_s * tmp))
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0;
	if (z <= 1.0)
		tmp = (1.0 / y_m) / x_m;
	else
		tmp = 1.0 / (z * (z * (y_m * x_m)));
	end
	tmp_2 = y_s * (x_s * tmp);
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[z, 1.0], N[(N[(1.0 / y$95$m), $MachinePrecision] / x$95$m), $MachinePrecision], N[(1.0 / N[(z * N[(z * N[(y$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < 1

   1. Initial program 93.6%

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

      1. associate-/l/ 93.3%

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

      2. associate-/r* 93.6%

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

      3. add-sqr-sqrt 93.6%

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

      4. pow2 93.6%

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

      5. hypot-1-def 93.6%

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

   4. Applied egg-rr 93.6%

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

   5. Taylor expanded in z around 0 74.9%

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

   if 1 < z

   1. Initial program 85.8%

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

   3. Taylor expanded in z around inf 83.8%

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

      1. associate-/r* 83.7%

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

      2. associate-/r* 85.2%

         \[\leadsto \color{blue}{\frac{\frac{\frac{1}{x}}{y}}{{z}^{2}}} \]

      3. associate-/r* 85.1%

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

   5. Simplified 85.1%

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

      1. unpow2 85.1%

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

      2. associate-/r* 90.6%

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

      3. associate-/r* 90.7%

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

   7. Applied egg-rr 90.7%

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

      1. clear-num 90.7%

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

      2. associate-/l/ 90.7%

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

      3. div-inv 90.8%

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

      4. clear-num 92.1%

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

      5. associate-/r/ 92.1%

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

      6. /-rgt-identity 92.1%

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

      7. *-commutative 92.1%

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

   9. Applied egg-rr 92.1%

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

4. Final simplification 79.4%

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

Alternative 10: 58.4% accurate, 2.2× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ [x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\ \\ y\_s \cdot \left(x\_s \cdot \frac{1}{y\_m \cdot x\_m}\right) \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (* y_s (* x_s (/ 1.0 (* y_m x_m)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	return y_s * (x_s * (1.0 / (y_m * x_m)));
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z)
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    code = y_s * (x_s * (1.0d0 / (y_m * x_m)))
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
	return y_s * (x_s * (1.0 / (y_m * x_m)));
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
[x_m, y_m, z] = sort([x_m, y_m, z])
def code(y_s, x_s, x_m, y_m, z):
	return y_s * (x_s * (1.0 / (y_m * x_m)))

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
y\_m = abs(y)
y\_s = copysign(1.0, y)
x_m, y_m, z = sort([x_m, y_m, z])
function code(y_s, x_s, x_m, y_m, z)
	return Float64(y_s * Float64(x_s * Float64(1.0 / Float64(y_m * x_m))))
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp = code(y_s, x_s, x_m, y_m, z)
	tmp = y_s * (x_s * (1.0 / (y_m * x_m)));
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * N[(1.0 / N[(y$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 91.6%

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

3. Taylor expanded in z around 0 61.6%

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

4. Final simplification 61.6%

   \[\leadsto \frac{1}{y \cdot x} \]
5. Add Preprocessing

Developer target: 92.8% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 1 + z \cdot z\\ t_1 := y \cdot t\_0\\ t_2 := \frac{\frac{1}{y}}{t\_0 \cdot x}\\ \mathbf{if}\;t\_1 < -\infty:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 < 8.680743250567252 \cdot 10^{+305}:\\ \;\;\;\;\frac{\frac{1}{x}}{t\_0 \cdot y}\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (+ 1.0 (* z z))) (t_1 (* y t_0)) (t_2 (/ (/ 1.0 y) (* t_0 x))))
   (if (< t_1 (- INFINITY))
     t_2
     (if (< t_1 8.680743250567252e+305) (/ (/ 1.0 x) (* t_0 y)) t_2))))

C

double code(double x, double y, double z) {
	double t_0 = 1.0 + (z * z);
	double t_1 = y * t_0;
	double t_2 = (1.0 / y) / (t_0 * x);
	double tmp;
	if (t_1 < -((double) INFINITY)) {
		tmp = t_2;
	} else if (t_1 < 8.680743250567252e+305) {
		tmp = (1.0 / x) / (t_0 * y);
	} else {
		tmp = t_2;
	}
	return tmp;
}

Java

public static double code(double x, double y, double z) {
	double t_0 = 1.0 + (z * z);
	double t_1 = y * t_0;
	double t_2 = (1.0 / y) / (t_0 * x);
	double tmp;
	if (t_1 < -Double.POSITIVE_INFINITY) {
		tmp = t_2;
	} else if (t_1 < 8.680743250567252e+305) {
		tmp = (1.0 / x) / (t_0 * y);
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = 1.0 + (z * z)
	t_1 = y * t_0
	t_2 = (1.0 / y) / (t_0 * x)
	tmp = 0
	if t_1 < -math.inf:
		tmp = t_2
	elif t_1 < 8.680743250567252e+305:
		tmp = (1.0 / x) / (t_0 * y)
	else:
		tmp = t_2
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(1.0 + Float64(z * z))
	t_1 = Float64(y * t_0)
	t_2 = Float64(Float64(1.0 / y) / Float64(t_0 * x))
	tmp = 0.0
	if (t_1 < Float64(-Inf))
		tmp = t_2;
	elseif (t_1 < 8.680743250567252e+305)
		tmp = Float64(Float64(1.0 / x) / Float64(t_0 * y));
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = 1.0 + (z * z);
	t_1 = y * t_0;
	t_2 = (1.0 / y) / (t_0 * x);
	tmp = 0.0;
	if (t_1 < -Inf)
		tmp = t_2;
	elseif (t_1 < 8.680743250567252e+305)
		tmp = (1.0 / x) / (t_0 * y);
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(y * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(1.0 / y), $MachinePrecision] / N[(t$95$0 * x), $MachinePrecision]), $MachinePrecision]}, If[Less[t$95$1, (-Infinity)], t$95$2, If[Less[t$95$1, 8.680743250567252e+305], N[(N[(1.0 / x), $MachinePrecision] / N[(t$95$0 * y), $MachinePrecision]), $MachinePrecision], t$95$2]]]]]

Reproduce

herbie shell --seed 2024096 
(FPCore (x y z)
  :name "Statistics.Distribution.CauchyLorentz:$cdensity from math-functions-0.1.5.2"
  :precision binary64

  :alt
  (if (< (* y (+ 1.0 (* z z))) (- INFINITY)) (/ (/ 1.0 y) (* (+ 1.0 (* z z)) x)) (if (< (* y (+ 1.0 (* z z))) 8.680743250567252e+305) (/ (/ 1.0 x) (* (+ 1.0 (* z z)) y)) (/ (/ 1.0 y) (* (+ 1.0 (* z z)) x))))

  (/ (/ 1.0 x) (* y (+ 1.0 (* z z)))))