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

Percentage Accurate: 88.6% → 98.9%

Time: 12.2s

Alternatives: 9

Speedup: 0.7×

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

Math

\[\begin{array}{l} z_m = \left|z\right| \\ 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_m] = \mathsf{sort}([x_m, y_m, z_m])\\ \\ y\_s \cdot \left(x\_s \cdot \begin{array}{l} \mathbf{if}\;z\_m \cdot z\_m \leq 50000000000:\\ \;\;\;\;\frac{\frac{1}{\mathsf{fma}\left(z\_m, z\_m, 1\right)} \cdot \frac{1}{x\_m}}{y\_m}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\frac{1}{z\_m \cdot x\_m}}{\mathsf{hypot}\left(1, z\_m\right)}}{y\_m}\\ \end{array}\right) \end{array} \]

FPCore

z_m = (fabs.f64 z)
x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
NOTE: x_m, y_m, and z_m should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z_m)
 :precision binary64
 (*
  y_s
  (*
   x_s
   (if (<= (* z_m z_m) 50000000000.0)
     (/ (* (/ 1.0 (fma z_m z_m 1.0)) (/ 1.0 x_m)) y_m)
     (/ (/ (/ 1.0 (* z_m x_m)) (hypot 1.0 z_m)) y_m)))))

C

z_m = fabs(z);
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_m);
double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
	double tmp;
	if ((z_m * z_m) <= 50000000000.0) {
		tmp = ((1.0 / fma(z_m, z_m, 1.0)) * (1.0 / x_m)) / y_m;
	} else {
		tmp = ((1.0 / (z_m * x_m)) / hypot(1.0, z_m)) / y_m;
	}
	return y_s * (x_s * tmp);
}

Julia

z_m = abs(z)
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_m = sort([x_m, y_m, z_m])
function code(y_s, x_s, x_m, y_m, z_m)
	tmp = 0.0
	if (Float64(z_m * z_m) <= 50000000000.0)
		tmp = Float64(Float64(Float64(1.0 / fma(z_m, z_m, 1.0)) * Float64(1.0 / x_m)) / y_m);
	else
		tmp = Float64(Float64(Float64(1.0 / Float64(z_m * x_m)) / hypot(1.0, z_m)) / y_m);
	end
	return Float64(y_s * Float64(x_s * tmp))
end

Wolfram

z_m = N[Abs[z], $MachinePrecision]
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_m should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z$95$m * z$95$m), $MachinePrecision], 50000000000.0], N[(N[(N[(1.0 / N[(z$95$m * z$95$m + 1.0), $MachinePrecision]), $MachinePrecision] * N[(1.0 / x$95$m), $MachinePrecision]), $MachinePrecision] / y$95$m), $MachinePrecision], N[(N[(N[(1.0 / N[(z$95$m * x$95$m), $MachinePrecision]), $MachinePrecision] / N[Sqrt[1.0 ^ 2 + z$95$m ^ 2], $MachinePrecision]), $MachinePrecision] / y$95$m), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 z z) < 5e10

   1. Initial program 99.7%

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

      1. associate-/l/ 99.7%

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

      2. associate-/r* 99.7%

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

      3. sqr-neg 99.7%

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

      4. +-commutative 99.7%

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

      5. sqr-neg 99.7%

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

      6. fma-define 99.7%

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

   3. Simplified 99.7%

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

      1. inv-pow 99.7%

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

      2. *-commutative 99.7%

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

      3. unpow-prod-down 99.7%

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

      4. inv-pow 99.7%

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

      5. inv-pow 99.7%

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

   6. Applied egg-rr 99.7%

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

   if 5e10 < (*.f64 z z)

   1. Initial program 80.8%

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

      1. associate-/l/ 81.2%

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

      2. associate-/r* 80.8%

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

      3. sqr-neg 80.8%

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

      4. +-commutative 80.8%

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

      5. sqr-neg 80.8%

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

      6. fma-define 80.8%

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

   3. Simplified 80.8%

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

      1. associate-/r* 81.2%

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

      2. *-un-lft-identity 81.2%

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

      3. add-sqr-sqrt 81.2%

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

      4. times-frac 81.2%

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

      5. fma-undefine 81.2%

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

      6. +-commutative 81.2%

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

      7. hypot-1-def 81.2%

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

      8. fma-undefine 81.2%

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

      9. +-commutative 81.2%

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

      10. hypot-1-def 89.5%

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

   6. Applied egg-rr 89.5%

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

      1. associate-*l/ 89.5%

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

      2. *-lft-identity 89.5%

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

      3. associate-/l/ 89.5%

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

   8. Simplified 89.5%

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

   9. Taylor expanded in z around inf 72.4%

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

4. Final simplification 87.7%

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

Alternative 2: 99.0% accurate, 0.1× speedup

Math

\[\begin{array}{l} z_m = \left|z\right| \\ 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_m] = \mathsf{sort}([x_m, y_m, z_m])\\ \\ y\_s \cdot \left(x\_s \cdot \frac{\frac{\frac{1}{\mathsf{hypot}\left(1, z\_m\right) \cdot x\_m}}{\mathsf{hypot}\left(1, z\_m\right)}}{y\_m}\right) \end{array} \]

FPCore

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

C

z_m = fabs(z);
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_m);
double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
	return y_s * (x_s * (((1.0 / (hypot(1.0, z_m) * x_m)) / hypot(1.0, z_m)) / y_m));
}

Java

z_m = Math.abs(z);
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_m;
public static double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
	return y_s * (x_s * (((1.0 / (Math.hypot(1.0, z_m) * x_m)) / Math.hypot(1.0, z_m)) / y_m));
}

Python

z_m = math.fabs(z)
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_m] = sort([x_m, y_m, z_m])
def code(y_s, x_s, x_m, y_m, z_m):
	return y_s * (x_s * (((1.0 / (math.hypot(1.0, z_m) * x_m)) / math.hypot(1.0, z_m)) / y_m))

Julia

z_m = abs(z)
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_m = sort([x_m, y_m, z_m])
function code(y_s, x_s, x_m, y_m, z_m)
	return Float64(y_s * Float64(x_s * Float64(Float64(Float64(1.0 / Float64(hypot(1.0, z_m) * x_m)) / hypot(1.0, z_m)) / y_m)))
end

MATLAB

z_m = abs(z);
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_m = num2cell(sort([x_m, y_m, z_m])){:}
function tmp = code(y_s, x_s, x_m, y_m, z_m)
	tmp = y_s * (x_s * (((1.0 / (hypot(1.0, z_m) * x_m)) / hypot(1.0, z_m)) / y_m));
end

Wolfram

z_m = N[Abs[z], $MachinePrecision]
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_m should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(y$95$s * N[(x$95$s * N[(N[(N[(1.0 / N[(N[Sqrt[1.0 ^ 2 + z$95$m ^ 2], $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision] / N[Sqrt[1.0 ^ 2 + z$95$m ^ 2], $MachinePrecision]), $MachinePrecision] / y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 91.4%

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

   1. associate-/l/ 91.5%

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

   2. associate-/r* 91.3%

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

   3. sqr-neg 91.3%

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

   4. +-commutative 91.3%

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

   5. sqr-neg 91.3%

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

   6. fma-define 91.3%

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

3. Simplified 91.3%

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

   1. associate-/r* 91.5%

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

   2. *-un-lft-identity 91.5%

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

   3. add-sqr-sqrt 91.5%

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

   4. times-frac 91.6%

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

   5. fma-undefine 91.6%

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

   6. +-commutative 91.6%

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

   7. hypot-1-def 91.6%

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

   8. fma-undefine 91.6%

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

   9. +-commutative 91.6%

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

   10. hypot-1-def 95.2%

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

6. Applied egg-rr 95.2%

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

   1. associate-*l/ 95.2%

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

   2. *-lft-identity 95.2%

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

   3. associate-/l/ 95.2%

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

8. Simplified 95.2%

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

9. Final simplification 95.2%

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

Alternative 3: 98.9% accurate, 0.1× speedup

Math

\[\begin{array}{l} z_m = \left|z\right| \\ 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_m] = \mathsf{sort}([x_m, y_m, z_m])\\ \\ y\_s \cdot \left(x\_s \cdot \begin{array}{l} \mathbf{if}\;z\_m \cdot z\_m \leq 50000000000:\\ \;\;\;\;\frac{\frac{1}{x\_m \cdot \mathsf{fma}\left(z\_m, z\_m, 1\right)}}{y\_m}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\frac{1}{z\_m \cdot x\_m}}{\mathsf{hypot}\left(1, z\_m\right)}}{y\_m}\\ \end{array}\right) \end{array} \]

FPCore

z_m = (fabs.f64 z)
x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
NOTE: x_m, y_m, and z_m should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z_m)
 :precision binary64
 (*
  y_s
  (*
   x_s
   (if (<= (* z_m z_m) 50000000000.0)
     (/ (/ 1.0 (* x_m (fma z_m z_m 1.0))) y_m)
     (/ (/ (/ 1.0 (* z_m x_m)) (hypot 1.0 z_m)) y_m)))))

C

z_m = fabs(z);
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_m);
double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
	double tmp;
	if ((z_m * z_m) <= 50000000000.0) {
		tmp = (1.0 / (x_m * fma(z_m, z_m, 1.0))) / y_m;
	} else {
		tmp = ((1.0 / (z_m * x_m)) / hypot(1.0, z_m)) / y_m;
	}
	return y_s * (x_s * tmp);
}

Julia

z_m = abs(z)
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_m = sort([x_m, y_m, z_m])
function code(y_s, x_s, x_m, y_m, z_m)
	tmp = 0.0
	if (Float64(z_m * z_m) <= 50000000000.0)
		tmp = Float64(Float64(1.0 / Float64(x_m * fma(z_m, z_m, 1.0))) / y_m);
	else
		tmp = Float64(Float64(Float64(1.0 / Float64(z_m * x_m)) / hypot(1.0, z_m)) / y_m);
	end
	return Float64(y_s * Float64(x_s * tmp))
end

Wolfram

z_m = N[Abs[z], $MachinePrecision]
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_m should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z$95$m * z$95$m), $MachinePrecision], 50000000000.0], N[(N[(1.0 / N[(x$95$m * N[(z$95$m * z$95$m + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / y$95$m), $MachinePrecision], N[(N[(N[(1.0 / N[(z$95$m * x$95$m), $MachinePrecision]), $MachinePrecision] / N[Sqrt[1.0 ^ 2 + z$95$m ^ 2], $MachinePrecision]), $MachinePrecision] / y$95$m), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 z z) < 5e10

   1. Initial program 99.7%

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

      1. associate-/l/ 99.7%

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

      2. associate-/r* 99.7%

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

      3. sqr-neg 99.7%

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

      4. +-commutative 99.7%

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

      5. sqr-neg 99.7%

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

      6. fma-define 99.7%

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

   3. Simplified 99.7%

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

   if 5e10 < (*.f64 z z)

   1. Initial program 80.8%

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

      1. associate-/l/ 81.2%

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

      2. associate-/r* 80.8%

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

      3. sqr-neg 80.8%

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

      4. +-commutative 80.8%

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

      5. sqr-neg 80.8%

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

      6. fma-define 80.8%

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

   3. Simplified 80.8%

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

      1. associate-/r* 81.2%

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

      2. *-un-lft-identity 81.2%

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

      3. add-sqr-sqrt 81.2%

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

      4. times-frac 81.2%

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

      5. fma-undefine 81.2%

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

      6. +-commutative 81.2%

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

      7. hypot-1-def 81.2%

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

      8. fma-undefine 81.2%

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

      9. +-commutative 81.2%

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

      10. hypot-1-def 89.5%

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

   6. Applied egg-rr 89.5%

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

      1. associate-*l/ 89.5%

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

      2. *-lft-identity 89.5%

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

      3. associate-/l/ 89.5%

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

   8. Simplified 89.5%

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

   9. Taylor expanded in z around inf 72.4%

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

4. Final simplification 87.7%

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

Alternative 4: 98.9% accurate, 0.1× speedup

Math

\[\begin{array}{l} z_m = \left|z\right| \\ 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_m] = \mathsf{sort}([x_m, y_m, z_m])\\ \\ y\_s \cdot \left(x\_s \cdot \begin{array}{l} \mathbf{if}\;z\_m \cdot z\_m \leq 50000000000:\\ \;\;\;\;\frac{\frac{1}{x\_m \cdot \mathsf{fma}\left(z\_m, z\_m, 1\right)}}{y\_m}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{1}{z\_m \cdot x\_m} \cdot \frac{1}{z\_m}}{y\_m}\\ \end{array}\right) \end{array} \]

FPCore

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

C

z_m = fabs(z);
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_m);
double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
	double tmp;
	if ((z_m * z_m) <= 50000000000.0) {
		tmp = (1.0 / (x_m * fma(z_m, z_m, 1.0))) / y_m;
	} else {
		tmp = ((1.0 / (z_m * x_m)) * (1.0 / z_m)) / y_m;
	}
	return y_s * (x_s * tmp);
}

Julia

z_m = abs(z)
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_m = sort([x_m, y_m, z_m])
function code(y_s, x_s, x_m, y_m, z_m)
	tmp = 0.0
	if (Float64(z_m * z_m) <= 50000000000.0)
		tmp = Float64(Float64(1.0 / Float64(x_m * fma(z_m, z_m, 1.0))) / y_m);
	else
		tmp = Float64(Float64(Float64(1.0 / Float64(z_m * x_m)) * Float64(1.0 / z_m)) / y_m);
	end
	return Float64(y_s * Float64(x_s * tmp))
end

Wolfram

z_m = N[Abs[z], $MachinePrecision]
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_m should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z$95$m * z$95$m), $MachinePrecision], 50000000000.0], N[(N[(1.0 / N[(x$95$m * N[(z$95$m * z$95$m + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / y$95$m), $MachinePrecision], N[(N[(N[(1.0 / N[(z$95$m * x$95$m), $MachinePrecision]), $MachinePrecision] * N[(1.0 / z$95$m), $MachinePrecision]), $MachinePrecision] / y$95$m), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 z z) < 5e10

   1. Initial program 99.7%

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

      1. associate-/l/ 99.7%

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

      2. associate-/r* 99.7%

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

      3. sqr-neg 99.7%

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

      4. +-commutative 99.7%

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

      5. sqr-neg 99.7%

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

      6. fma-define 99.7%

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

   3. Simplified 99.7%

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

   if 5e10 < (*.f64 z z)

   1. Initial program 80.8%

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

      1. associate-/l/ 81.2%

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

      2. associate-/r* 80.8%

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

      3. sqr-neg 80.8%

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

      4. +-commutative 80.8%

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

      5. sqr-neg 80.8%

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

      6. fma-define 80.8%

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

   3. Simplified 80.8%

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

      1. associate-/r* 81.2%

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

      2. *-un-lft-identity 81.2%

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

      3. add-sqr-sqrt 81.2%

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

      4. times-frac 81.2%

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

      5. fma-undefine 81.2%

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

      6. +-commutative 81.2%

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

      7. hypot-1-def 81.2%

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

      8. fma-undefine 81.2%

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

      9. +-commutative 81.2%

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

      10. hypot-1-def 89.5%

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

   6. Applied egg-rr 89.5%

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

      1. associate-*l/ 89.5%

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

      2. *-lft-identity 89.5%

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

      3. associate-/l/ 89.5%

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

   8. Simplified 89.5%

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

   9. Taylor expanded in z around inf 80.8%

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

       1. associate-/r* 81.2%

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

   11. Simplified 81.2%

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

       1. *-un-lft-identity 81.2%

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

       2. unpow2 81.2%

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

       3. times-frac 89.5%

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

       4. associate-/r* 89.5%

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

   13. Applied egg-rr 89.5%

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

4. Final simplification 95.2%

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

Alternative 5: 98.8% accurate, 0.6× speedup

Math

\[\begin{array}{l} z_m = \left|z\right| \\ 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_m] = \mathsf{sort}([x_m, y_m, z_m])\\ \\ y\_s \cdot \left(x\_s \cdot \begin{array}{l} \mathbf{if}\;z\_m \cdot z\_m \leq 4 \cdot 10^{+21}:\\ \;\;\;\;\frac{\frac{1}{x\_m}}{y\_m \cdot \left(1 + z\_m \cdot z\_m\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{1}{z\_m \cdot x\_m} \cdot \frac{1}{z\_m}}{y\_m}\\ \end{array}\right) \end{array} \]

FPCore

z_m = (fabs.f64 z)
x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
NOTE: x_m, y_m, and z_m should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z_m)
 :precision binary64
 (*
  y_s
  (*
   x_s
   (if (<= (* z_m z_m) 4e+21)
     (/ (/ 1.0 x_m) (* y_m (+ 1.0 (* z_m z_m))))
     (/ (* (/ 1.0 (* z_m x_m)) (/ 1.0 z_m)) y_m)))))

C

z_m = fabs(z);
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_m);
double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
	double tmp;
	if ((z_m * z_m) <= 4e+21) {
		tmp = (1.0 / x_m) / (y_m * (1.0 + (z_m * z_m)));
	} else {
		tmp = ((1.0 / (z_m * x_m)) * (1.0 / z_m)) / y_m;
	}
	return y_s * (x_s * tmp);
}

Fortran

z_m = abs(z)
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_m should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z_m)
    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_m
    real(8) :: tmp
    if ((z_m * z_m) <= 4d+21) then
        tmp = (1.0d0 / x_m) / (y_m * (1.0d0 + (z_m * z_m)))
    else
        tmp = ((1.0d0 / (z_m * x_m)) * (1.0d0 / z_m)) / y_m
    end if
    code = y_s * (x_s * tmp)
end function

Java

z_m = Math.abs(z);
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_m;
public static double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
	double tmp;
	if ((z_m * z_m) <= 4e+21) {
		tmp = (1.0 / x_m) / (y_m * (1.0 + (z_m * z_m)));
	} else {
		tmp = ((1.0 / (z_m * x_m)) * (1.0 / z_m)) / y_m;
	}
	return y_s * (x_s * tmp);
}

Python

z_m = math.fabs(z)
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_m] = sort([x_m, y_m, z_m])
def code(y_s, x_s, x_m, y_m, z_m):
	tmp = 0
	if (z_m * z_m) <= 4e+21:
		tmp = (1.0 / x_m) / (y_m * (1.0 + (z_m * z_m)))
	else:
		tmp = ((1.0 / (z_m * x_m)) * (1.0 / z_m)) / y_m
	return y_s * (x_s * tmp)

Julia

z_m = abs(z)
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_m = sort([x_m, y_m, z_m])
function code(y_s, x_s, x_m, y_m, z_m)
	tmp = 0.0
	if (Float64(z_m * z_m) <= 4e+21)
		tmp = Float64(Float64(1.0 / x_m) / Float64(y_m * Float64(1.0 + Float64(z_m * z_m))));
	else
		tmp = Float64(Float64(Float64(1.0 / Float64(z_m * x_m)) * Float64(1.0 / z_m)) / y_m);
	end
	return Float64(y_s * Float64(x_s * tmp))
end

MATLAB

z_m = abs(z);
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_m = num2cell(sort([x_m, y_m, z_m])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z_m)
	tmp = 0.0;
	if ((z_m * z_m) <= 4e+21)
		tmp = (1.0 / x_m) / (y_m * (1.0 + (z_m * z_m)));
	else
		tmp = ((1.0 / (z_m * x_m)) * (1.0 / z_m)) / y_m;
	end
	tmp_2 = y_s * (x_s * tmp);
end

Wolfram

z_m = N[Abs[z], $MachinePrecision]
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_m should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z$95$m * z$95$m), $MachinePrecision], 4e+21], N[(N[(1.0 / x$95$m), $MachinePrecision] / N[(y$95$m * N[(1.0 + N[(z$95$m * z$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / N[(z$95$m * x$95$m), $MachinePrecision]), $MachinePrecision] * N[(1.0 / z$95$m), $MachinePrecision]), $MachinePrecision] / y$95$m), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 z z) < 4e21

   1. Initial program 99.7%

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

   if 4e21 < (*.f64 z z)

   1. Initial program 80.3%

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

      1. associate-/l/ 80.7%

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

      2. associate-/r* 80.2%

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

      3. sqr-neg 80.2%

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

      4. +-commutative 80.2%

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

      5. sqr-neg 80.2%

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

      6. fma-define 80.2%

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

   3. Simplified 80.2%

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

      1. associate-/r* 80.7%

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

      2. *-un-lft-identity 80.7%

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

      3. add-sqr-sqrt 80.7%

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

      4. times-frac 80.7%

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

      5. fma-undefine 80.7%

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

      6. +-commutative 80.7%

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

      7. hypot-1-def 80.7%

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

      8. fma-undefine 80.7%

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

      9. +-commutative 80.7%

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

      10. hypot-1-def 89.2%

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

   6. Applied egg-rr 89.2%

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

      1. associate-*l/ 89.2%

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

      2. *-lft-identity 89.2%

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

      3. associate-/l/ 89.2%

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

   8. Simplified 89.2%

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

   9. Taylor expanded in z around inf 80.2%

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

       1. associate-/r* 80.7%

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

   11. Simplified 80.7%

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

       1. *-un-lft-identity 80.7%

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

       2. unpow2 80.7%

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

       3. times-frac 89.2%

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

       4. associate-/r* 89.2%

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

   13. Applied egg-rr 89.2%

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

4. Final simplification 95.2%

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

Alternative 6: 98.2% accurate, 0.7× speedup

Math

\[\begin{array}{l} z_m = \left|z\right| \\ 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_m] = \mathsf{sort}([x_m, y_m, z_m])\\ \\ y\_s \cdot \left(x\_s \cdot \begin{array}{l} \mathbf{if}\;z\_m \leq 1:\\ \;\;\;\;\frac{\frac{1}{x\_m}}{y\_m}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{1}{z\_m \cdot x\_m} \cdot \frac{1}{z\_m}}{y\_m}\\ \end{array}\right) \end{array} \]

FPCore

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

C

z_m = fabs(z);
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_m);
double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
	double tmp;
	if (z_m <= 1.0) {
		tmp = (1.0 / x_m) / y_m;
	} else {
		tmp = ((1.0 / (z_m * x_m)) * (1.0 / z_m)) / y_m;
	}
	return y_s * (x_s * tmp);
}

Fortran

z_m = abs(z)
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_m should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z_m)
    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_m
    real(8) :: tmp
    if (z_m <= 1.0d0) then
        tmp = (1.0d0 / x_m) / y_m
    else
        tmp = ((1.0d0 / (z_m * x_m)) * (1.0d0 / z_m)) / y_m
    end if
    code = y_s * (x_s * tmp)
end function

Java

z_m = Math.abs(z);
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_m;
public static double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
	double tmp;
	if (z_m <= 1.0) {
		tmp = (1.0 / x_m) / y_m;
	} else {
		tmp = ((1.0 / (z_m * x_m)) * (1.0 / z_m)) / y_m;
	}
	return y_s * (x_s * tmp);
}

Python

z_m = math.fabs(z)
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_m] = sort([x_m, y_m, z_m])
def code(y_s, x_s, x_m, y_m, z_m):
	tmp = 0
	if z_m <= 1.0:
		tmp = (1.0 / x_m) / y_m
	else:
		tmp = ((1.0 / (z_m * x_m)) * (1.0 / z_m)) / y_m
	return y_s * (x_s * tmp)

Julia

z_m = abs(z)
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_m = sort([x_m, y_m, z_m])
function code(y_s, x_s, x_m, y_m, z_m)
	tmp = 0.0
	if (z_m <= 1.0)
		tmp = Float64(Float64(1.0 / x_m) / y_m);
	else
		tmp = Float64(Float64(Float64(1.0 / Float64(z_m * x_m)) * Float64(1.0 / z_m)) / y_m);
	end
	return Float64(y_s * Float64(x_s * tmp))
end

MATLAB

z_m = abs(z);
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_m = num2cell(sort([x_m, y_m, z_m])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z_m)
	tmp = 0.0;
	if (z_m <= 1.0)
		tmp = (1.0 / x_m) / y_m;
	else
		tmp = ((1.0 / (z_m * x_m)) * (1.0 / z_m)) / y_m;
	end
	tmp_2 = y_s * (x_s * tmp);
end

Wolfram

z_m = N[Abs[z], $MachinePrecision]
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_m should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(y$95$s * N[(x$95$s * If[LessEqual[z$95$m, 1.0], N[(N[(1.0 / x$95$m), $MachinePrecision] / y$95$m), $MachinePrecision], N[(N[(N[(1.0 / N[(z$95$m * x$95$m), $MachinePrecision]), $MachinePrecision] * N[(1.0 / z$95$m), $MachinePrecision]), $MachinePrecision] / y$95$m), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < 1

   1. Initial program 93.7%

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

      1. associate-/r* 93.2%

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

      2. sqr-neg 93.2%

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

      3. +-commutative 93.2%

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

      4. sqr-neg 93.2%

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

      5. fma-define 93.2%

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

   3. Simplified 93.2%

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

   5. Taylor expanded in z around 0 74.5%

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

      1. associate-/r* 75.1%

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

   7. Simplified 75.1%

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

   if 1 < z

   1. Initial program 83.1%

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

      1. associate-/l/ 80.5%

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

      2. associate-/r* 79.5%

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

      3. sqr-neg 79.5%

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

      4. +-commutative 79.5%

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

      5. sqr-neg 79.5%

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

      6. fma-define 79.5%

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

   3. Simplified 79.5%

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

      1. associate-/r* 80.5%

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

      2. *-un-lft-identity 80.5%

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

      3. add-sqr-sqrt 80.5%

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

      4. times-frac 80.5%

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

      5. fma-undefine 80.5%

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

      6. +-commutative 80.5%

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

      7. hypot-1-def 80.5%

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

      8. fma-undefine 80.5%

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

      9. +-commutative 80.5%

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

      10. hypot-1-def 87.3%

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

   6. Applied egg-rr 87.3%

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

      1. associate-*l/ 87.3%

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

      2. *-lft-identity 87.3%

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

      3. associate-/l/ 87.2%

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

   8. Simplified 87.2%

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

   9. Taylor expanded in z around inf 79.1%

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

       1. associate-/r* 80.1%

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

   11. Simplified 80.1%

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

       1. *-un-lft-identity 80.1%

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

       2. unpow2 80.1%

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

       3. times-frac 86.8%

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

       4. associate-/r* 86.8%

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

   13. Applied egg-rr 86.8%

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

4. Final simplification 77.6%

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

Alternative 7: 73.4% accurate, 0.9× speedup

Math

\[\begin{array}{l} z_m = \left|z\right| \\ 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_m] = \mathsf{sort}([x_m, y_m, z_m])\\ \\ y\_s \cdot \left(x\_s \cdot \begin{array}{l} \mathbf{if}\;z\_m \leq 1:\\ \;\;\;\;\frac{\frac{1}{x\_m}}{y\_m}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{x\_m \cdot \left(z\_m \cdot y\_m\right)}\\ \end{array}\right) \end{array} \]

FPCore

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

C

z_m = fabs(z);
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_m);
double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
	double tmp;
	if (z_m <= 1.0) {
		tmp = (1.0 / x_m) / y_m;
	} else {
		tmp = 1.0 / (x_m * (z_m * y_m));
	}
	return y_s * (x_s * tmp);
}

Fortran

z_m = abs(z)
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_m should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z_m)
    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_m
    real(8) :: tmp
    if (z_m <= 1.0d0) then
        tmp = (1.0d0 / x_m) / y_m
    else
        tmp = 1.0d0 / (x_m * (z_m * y_m))
    end if
    code = y_s * (x_s * tmp)
end function

Java

z_m = Math.abs(z);
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_m;
public static double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
	double tmp;
	if (z_m <= 1.0) {
		tmp = (1.0 / x_m) / y_m;
	} else {
		tmp = 1.0 / (x_m * (z_m * y_m));
	}
	return y_s * (x_s * tmp);
}

Python

z_m = math.fabs(z)
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_m] = sort([x_m, y_m, z_m])
def code(y_s, x_s, x_m, y_m, z_m):
	tmp = 0
	if z_m <= 1.0:
		tmp = (1.0 / x_m) / y_m
	else:
		tmp = 1.0 / (x_m * (z_m * y_m))
	return y_s * (x_s * tmp)

Julia

z_m = abs(z)
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_m = sort([x_m, y_m, z_m])
function code(y_s, x_s, x_m, y_m, z_m)
	tmp = 0.0
	if (z_m <= 1.0)
		tmp = Float64(Float64(1.0 / x_m) / y_m);
	else
		tmp = Float64(1.0 / Float64(x_m * Float64(z_m * y_m)));
	end
	return Float64(y_s * Float64(x_s * tmp))
end

MATLAB

z_m = abs(z);
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_m = num2cell(sort([x_m, y_m, z_m])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z_m)
	tmp = 0.0;
	if (z_m <= 1.0)
		tmp = (1.0 / x_m) / y_m;
	else
		tmp = 1.0 / (x_m * (z_m * y_m));
	end
	tmp_2 = y_s * (x_s * tmp);
end

Wolfram

z_m = N[Abs[z], $MachinePrecision]
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_m should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(y$95$s * N[(x$95$s * If[LessEqual[z$95$m, 1.0], N[(N[(1.0 / x$95$m), $MachinePrecision] / y$95$m), $MachinePrecision], N[(1.0 / N[(x$95$m * N[(z$95$m * y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < 1

   1. Initial program 93.7%

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

      1. associate-/r* 93.2%

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

      2. sqr-neg 93.2%

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

      3. +-commutative 93.2%

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

      4. sqr-neg 93.2%

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

      5. fma-define 93.2%

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

   3. Simplified 93.2%

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

   5. Taylor expanded in z around 0 74.5%

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

      1. associate-/r* 75.1%

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

   7. Simplified 75.1%

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

   if 1 < z

   1. Initial program 83.1%

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

      1. associate-/l/ 80.5%

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

      2. associate-/r* 79.5%

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

      3. sqr-neg 79.5%

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

      4. +-commutative 79.5%

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

      5. sqr-neg 79.5%

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

      6. fma-define 79.5%

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

   3. Simplified 79.5%

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

      1. associate-/r* 80.5%

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

      2. *-un-lft-identity 80.5%

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

      3. add-sqr-sqrt 80.5%

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

      4. times-frac 80.5%

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

      5. fma-undefine 80.5%

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

      6. +-commutative 80.5%

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

      7. hypot-1-def 80.5%

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

      8. fma-undefine 80.5%

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

      9. +-commutative 80.5%

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

      10. hypot-1-def 87.3%

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

   6. Applied egg-rr 87.3%

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

      1. associate-*l/ 87.3%

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

      2. *-lft-identity 87.3%

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

      3. associate-/l/ 87.2%

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

   8. Simplified 87.2%

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

   9. Taylor expanded in z around 0 40.6%

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

   10. Taylor expanded in z around inf 29.7%

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

4. Final simplification 65.2%

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

Alternative 8: 59.5% accurate, 2.2× speedup

Math

\[\begin{array}{l} z_m = \left|z\right| \\ 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_m] = \mathsf{sort}([x_m, y_m, z_m])\\ \\ y\_s \cdot \left(x\_s \cdot \frac{1}{x\_m \cdot y\_m}\right) \end{array} \]

FPCore

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

C

z_m = fabs(z);
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_m);
double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
	return y_s * (x_s * (1.0 / (x_m * y_m)));
}

Fortran

z_m = abs(z)
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_m should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z_m)
    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_m
    code = y_s * (x_s * (1.0d0 / (x_m * y_m)))
end function

Java

z_m = Math.abs(z);
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_m;
public static double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
	return y_s * (x_s * (1.0 / (x_m * y_m)));
}

Python

z_m = math.fabs(z)
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_m] = sort([x_m, y_m, z_m])
def code(y_s, x_s, x_m, y_m, z_m):
	return y_s * (x_s * (1.0 / (x_m * y_m)))

Julia

z_m = abs(z)
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_m = sort([x_m, y_m, z_m])
function code(y_s, x_s, x_m, y_m, z_m)
	return Float64(y_s * Float64(x_s * Float64(1.0 / Float64(x_m * y_m))))
end

MATLAB

z_m = abs(z);
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_m = num2cell(sort([x_m, y_m, z_m])){:}
function tmp = code(y_s, x_s, x_m, y_m, z_m)
	tmp = y_s * (x_s * (1.0 / (x_m * y_m)));
end

Wolfram

z_m = N[Abs[z], $MachinePrecision]
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_m should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(y$95$s * N[(x$95$s * N[(1.0 / N[(x$95$m * y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 91.4%

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

   1. associate-/r* 91.0%

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

   2. sqr-neg 91.0%

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

   3. +-commutative 91.0%

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

   4. sqr-neg 91.0%

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

   5. fma-define 91.0%

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

3. Simplified 91.0%

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

5. Taylor expanded in z around 0 61.8%

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

6. Final simplification 61.8%

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

Alternative 9: 59.5% accurate, 2.2× speedup

Math

\[\begin{array}{l} z_m = \left|z\right| \\ 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_m] = \mathsf{sort}([x_m, y_m, z_m])\\ \\ y\_s \cdot \left(x\_s \cdot \frac{\frac{1}{x\_m}}{y\_m}\right) \end{array} \]

FPCore

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

C

z_m = fabs(z);
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_m);
double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
	return y_s * (x_s * ((1.0 / x_m) / y_m));
}

Fortran

z_m = abs(z)
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_m should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z_m)
    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_m
    code = y_s * (x_s * ((1.0d0 / x_m) / y_m))
end function

Java

z_m = Math.abs(z);
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_m;
public static double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
	return y_s * (x_s * ((1.0 / x_m) / y_m));
}

Python

z_m = math.fabs(z)
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_m] = sort([x_m, y_m, z_m])
def code(y_s, x_s, x_m, y_m, z_m):
	return y_s * (x_s * ((1.0 / x_m) / y_m))

Julia

z_m = abs(z)
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_m = sort([x_m, y_m, z_m])
function code(y_s, x_s, x_m, y_m, z_m)
	return Float64(y_s * Float64(x_s * Float64(Float64(1.0 / x_m) / y_m)))
end

MATLAB

z_m = abs(z);
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_m = num2cell(sort([x_m, y_m, z_m])){:}
function tmp = code(y_s, x_s, x_m, y_m, z_m)
	tmp = y_s * (x_s * ((1.0 / x_m) / y_m));
end

Wolfram

z_m = N[Abs[z], $MachinePrecision]
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_m should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(y$95$s * N[(x$95$s * N[(N[(1.0 / x$95$m), $MachinePrecision] / y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 91.4%

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

   1. associate-/r* 91.0%

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

   2. sqr-neg 91.0%

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

   3. +-commutative 91.0%

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

   4. sqr-neg 91.0%

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

   5. fma-define 91.0%

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

3. Simplified 91.0%

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

5. Taylor expanded in z around 0 61.8%

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

   1. associate-/r* 62.0%

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

7. Simplified 62.0%

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

8. Final simplification 62.0%

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

Developer target: 92.5% 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 2024046 
(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)))))