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

Percentage Accurate: 89.1% → 98.5%

Time: 11.5s

Alternatives: 10

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: 89.1% 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.5% 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])\\ \\ y\_s \cdot \left(x\_s \cdot \begin{array}{l} \mathbf{if}\;y\_m \cdot \left(1 + z \cdot z\right) \leq 4 \cdot 10^{+305}:\\ \;\;\;\;\frac{\frac{1}{x\_m}}{y\_m + y\_m \cdot \left(z \cdot z\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{y\_m} \cdot \frac{\frac{1}{z}}{x\_m \cdot 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))) 4e+305)
     (/ (/ 1.0 x_m) (+ y_m (* y_m (* z z))))
     (* (/ 1.0 y_m) (/ (/ 1.0 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))) <= 4e+305) {
		tmp = (1.0 / x_m) / (y_m + (y_m * (z * z)));
	} else {
		tmp = (1.0 / y_m) * ((1.0 / 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 ((y_m * (1.0d0 + (z * z))) <= 4d+305) then
        tmp = (1.0d0 / x_m) / (y_m + (y_m * (z * z)))
    else
        tmp = (1.0d0 / y_m) * ((1.0d0 / 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 ((y_m * (1.0 + (z * z))) <= 4e+305) {
		tmp = (1.0 / x_m) / (y_m + (y_m * (z * z)));
	} else {
		tmp = (1.0 / y_m) * ((1.0 / 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))) <= 4e+305:
		tmp = (1.0 / x_m) / (y_m + (y_m * (z * z)))
	else:
		tmp = (1.0 / y_m) * ((1.0 / 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))) <= 4e+305)
		tmp = Float64(Float64(1.0 / x_m) / Float64(y_m + Float64(y_m * Float64(z * z))));
	else
		tmp = Float64(Float64(1.0 / y_m) * Float64(Float64(1.0 / z) / Float64(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))) <= 4e+305)
		tmp = (1.0 / x_m) / (y_m + (y_m * (z * z)));
	else
		tmp = (1.0 / y_m) * ((1.0 / 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], 4e+305], N[(N[(1.0 / x$95$m), $MachinePrecision] / N[(y$95$m + N[(y$95$m * N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / y$95$m), $MachinePrecision] * N[(N[(1.0 / z), $MachinePrecision] / N[(x$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 96.0%

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

      1. +-commutative 96.0%

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

      2. distribute-lft-in 96.0%

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

      3. pow2 96.0%

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

      4. *-rgt-identity 96.0%

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

   4. Applied egg-rr 96.0%

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

      1. unpow2 96.0%

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

   6. Applied egg-rr 96.0%

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

   if 3.9999999999999998e305 < (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z)))

   1. Initial program 69.3%

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

      1. associate-/l/ 69.3%

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

      2. associate-*l* 71.5%

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

      3. *-commutative 71.5%

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

      4. sqr-neg 71.5%

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

      5. +-commutative 71.5%

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

      6. sqr-neg 71.5%

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

      7. fma-define 71.5%

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

   3. Simplified 71.5%

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

   5. Taylor expanded in z around inf 71.5%

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

      1. associate-/r* 71.5%

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

      2. div-inv 71.6%

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

   7. Applied egg-rr 71.6%

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

      1. pow2 71.6%

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

      2. associate-/r* 71.6%

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

      3. *-un-lft-identity 71.6%

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

      4. times-frac 93.2%

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

   9. Applied egg-rr 93.2%

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

       1. associate-/l/ 93.2%

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

       2. un-div-inv 93.3%

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

       3. *-commutative 93.3%

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

   11. Applied egg-rr 93.3%

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

4. Final simplification 95.6%

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

Alternative 2: 99.4% 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 \frac{\frac{1}{x\_m \cdot t\_0}}{t\_0}\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 (* x_m t_0)) 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 / (x_m * t_0)) / 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 / (x_m * t_0)) / 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 / (x_m * t_0)) / 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 / Float64(x_m * t_0)) / 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 / (x_m * t_0)) / 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 / N[(x$95$m * t$95$0), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Initial program 92.3%

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

   1. associate-/l/ 92.0%

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

   2. associate-*l* 89.4%

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

   3. *-commutative 89.4%

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

   4. sqr-neg 89.4%

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

   5. +-commutative 89.4%

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

   6. sqr-neg 89.4%

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

   7. fma-define 89.4%

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

3. Simplified 89.4%

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

   1. associate-*r* 90.9%

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

   2. *-commutative 90.9%

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

   3. associate-/r* 90.7%

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

   4. *-commutative 90.7%

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

   5. associate-/l/ 90.6%

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

   6. fma-undefine 90.6%

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

   7. +-commutative 90.6%

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

   8. associate-/r* 92.3%

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

   9. *-un-lft-identity 92.3%

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

   10. add-sqr-sqrt 48.3%

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

   11. times-frac 48.3%

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

   12. +-commutative 48.3%

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

   13. fma-undefine 48.3%

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

   14. *-commutative 48.3%

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

   15. sqrt-prod 48.3%

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

   16. fma-undefine 48.3%

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

   17. +-commutative 48.3%

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

   18. hypot-1-def 48.3%

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

   19. +-commutative 48.3%

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

6. Applied egg-rr 52.4%

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

   1. associate-*l/ 52.5%

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

   2. *-lft-identity 52.5%

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

   3. associate-/l/ 52.5%

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

   4. *-commutative 52.5%

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

8. Simplified 52.5%

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

9. Final simplification 52.5%

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

Alternative 3: 98.0% 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{1}{y\_m \cdot \left(\mathsf{hypot}\left(1, z\right) \cdot \left(x\_m \cdot \mathsf{hypot}\left(1, z\right)\right)\right)}\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 (* (hypot 1.0 z) (* x_m (hypot 1.0 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) {
	return y_s * (x_s * (1.0 / (y_m * (hypot(1.0, z) * (x_m * hypot(1.0, z))))));
}

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 * (Math.hypot(1.0, z) * (x_m * Math.hypot(1.0, z))))));
}

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 * (math.hypot(1.0, z) * (x_m * math.hypot(1.0, z))))))

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 * Float64(hypot(1.0, z) * Float64(x_m * hypot(1.0, z)))))))
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 * (hypot(1.0, z) * (x_m * hypot(1.0, z))))));
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 * N[(N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision] * N[(x$95$m * N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 92.3%

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

   1. associate-/l/ 92.0%

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

   2. associate-*l* 89.4%

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

   3. *-commutative 89.4%

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

   4. sqr-neg 89.4%

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

   5. +-commutative 89.4%

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

   6. sqr-neg 89.4%

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

   7. fma-define 89.4%

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

3. Simplified 89.4%

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

   1. add-sqr-sqrt 41.0%

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

   2. pow2 41.0%

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

   3. *-commutative 41.0%

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

   4. sqrt-prod 41.0%

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

   5. fma-undefine 41.0%

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

   6. +-commutative 41.0%

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

   7. hypot-1-def 43.9%

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

6. Applied egg-rr 43.9%

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

   1. unpow2 43.9%

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

   2. associate-*l* 43.9%

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

   3. *-commutative 43.9%

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

   4. associate-*l* 43.9%

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

   5. add-sqr-sqrt 94.2%

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

8. Applied egg-rr 94.2%

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

9. Final simplification 94.2%

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

Alternative 4: 98.5% 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 4 \cdot 10^{+305}:\\ \;\;\;\;\frac{\frac{1}{x\_m}}{t\_0}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{y\_m} \cdot \frac{\frac{1}{z}}{x\_m \cdot 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 4e+305)
       (/ (/ 1.0 x_m) t_0)
       (* (/ 1.0 y_m) (/ (/ 1.0 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 <= 4e+305) {
		tmp = (1.0 / x_m) / t_0;
	} else {
		tmp = (1.0 / y_m) * ((1.0 / 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) :: t_0
    real(8) :: tmp
    t_0 = y_m * (1.0d0 + (z * z))
    if (t_0 <= 4d+305) then
        tmp = (1.0d0 / x_m) / t_0
    else
        tmp = (1.0d0 / y_m) * ((1.0d0 / 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 t_0 = y_m * (1.0 + (z * z));
	double tmp;
	if (t_0 <= 4e+305) {
		tmp = (1.0 / x_m) / t_0;
	} else {
		tmp = (1.0 / y_m) * ((1.0 / 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 <= 4e+305:
		tmp = (1.0 / x_m) / t_0
	else:
		tmp = (1.0 / y_m) * ((1.0 / 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 <= 4e+305)
		tmp = Float64(Float64(1.0 / x_m) / t_0);
	else
		tmp = Float64(Float64(1.0 / y_m) * Float64(Float64(1.0 / z) / Float64(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 <= 4e+305)
		tmp = (1.0 / x_m) / t_0;
	else
		tmp = (1.0 / y_m) * ((1.0 / 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, 4e+305], N[(N[(1.0 / x$95$m), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(1.0 / y$95$m), $MachinePrecision] * N[(N[(1.0 / z), $MachinePrecision] / N[(x$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 96.0%

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

   if 3.9999999999999998e305 < (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z)))

   1. Initial program 69.3%

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

      1. associate-/l/ 69.3%

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

      2. associate-*l* 71.5%

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

      3. *-commutative 71.5%

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

      4. sqr-neg 71.5%

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

      5. +-commutative 71.5%

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

      6. sqr-neg 71.5%

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

      7. fma-define 71.5%

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

   3. Simplified 71.5%

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

   5. Taylor expanded in z around inf 71.5%

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

      1. associate-/r* 71.5%

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

      2. div-inv 71.6%

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

   7. Applied egg-rr 71.6%

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

      1. pow2 71.6%

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

      2. associate-/r* 71.6%

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

      3. *-un-lft-identity 71.6%

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

      4. times-frac 93.2%

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

   9. Applied egg-rr 93.2%

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

       1. associate-/l/ 93.2%

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

       2. un-div-inv 93.3%

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

       3. *-commutative 93.3%

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

   11. Applied egg-rr 93.3%

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

4. Final simplification 95.6%

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

Alternative 5: 97.8% accurate, 0.6× 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 0.02:\\ \;\;\;\;\frac{1}{x\_m \cdot y\_m}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{y\_m} \cdot \frac{\frac{1}{z}}{x\_m \cdot 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) 0.02)
     (/ 1.0 (* x_m y_m))
     (* (/ 1.0 y_m) (/ (/ 1.0 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) <= 0.02) {
		tmp = 1.0 / (x_m * y_m);
	} else {
		tmp = (1.0 / y_m) * ((1.0 / 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 * z) <= 0.02d0) then
        tmp = 1.0d0 / (x_m * y_m)
    else
        tmp = (1.0d0 / y_m) * ((1.0d0 / 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 * z) <= 0.02) {
		tmp = 1.0 / (x_m * y_m);
	} else {
		tmp = (1.0 / y_m) * ((1.0 / 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) <= 0.02:
		tmp = 1.0 / (x_m * y_m)
	else:
		tmp = (1.0 / y_m) * ((1.0 / 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) <= 0.02)
		tmp = Float64(1.0 / Float64(x_m * y_m));
	else
		tmp = Float64(Float64(1.0 / y_m) * Float64(Float64(1.0 / z) / Float64(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) <= 0.02)
		tmp = 1.0 / (x_m * y_m);
	else
		tmp = (1.0 / y_m) * ((1.0 / 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], 0.02], N[(1.0 / N[(x$95$m * y$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / y$95$m), $MachinePrecision] * N[(N[(1.0 / z), $MachinePrecision] / N[(x$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 z z) < 0.0200000000000000004

   1. Initial program 99.6%

      \[\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{1}{\left(y \cdot \left(1 + z \cdot z\right)\right) \cdot x}} \]

      2. associate-*l* 99.7%

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

      3. *-commutative 99.7%

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

      4. sqr-neg 99.7%

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

      5. +-commutative 99.7%

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

      6. sqr-neg 99.7%

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

      7. fma-define 99.7%

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

   3. Simplified 99.7%

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

   5. Taylor expanded in z around 0 98.7%

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

   if 0.0200000000000000004 < (*.f64 z z)

   1. Initial program 83.4%

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

      1. associate-/l/ 82.5%

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

      2. associate-*l* 76.8%

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

      3. *-commutative 76.8%

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

      4. sqr-neg 76.8%

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

      5. +-commutative 76.8%

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

      6. sqr-neg 76.8%

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

      7. fma-define 76.8%

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

   3. Simplified 76.8%

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

   5. Taylor expanded in z around inf 75.1%

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

      1. associate-/r* 76.0%

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

      2. div-inv 76.0%

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

   7. Applied egg-rr 76.0%

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

      1. pow2 76.0%

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

      2. associate-/r* 76.4%

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

      3. *-un-lft-identity 76.4%

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

      4. times-frac 87.1%

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

   9. Applied egg-rr 87.1%

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

       1. associate-/l/ 87.0%

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

       2. un-div-inv 87.1%

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

       3. *-commutative 87.1%

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

   11. Applied egg-rr 87.1%

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

4. Final simplification 93.5%

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

Alternative 6: 96.7% accurate, 0.7× 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 0.02:\\ \;\;\;\;\frac{1}{x\_m \cdot y\_m}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{1}{x\_m \cdot z}}{z \cdot y\_m}\\ \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) 0.02)
     (/ 1.0 (* x_m y_m))
     (/ (/ 1.0 (* x_m z)) (* 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) {
	double tmp;
	if ((z * z) <= 0.02) {
		tmp = 1.0 / (x_m * y_m);
	} else {
		tmp = (1.0 / (x_m * z)) / (z * y_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 * z) <= 0.02d0) then
        tmp = 1.0d0 / (x_m * y_m)
    else
        tmp = (1.0d0 / (x_m * z)) / (z * y_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 * z) <= 0.02) {
		tmp = 1.0 / (x_m * y_m);
	} else {
		tmp = (1.0 / (x_m * z)) / (z * y_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 * z) <= 0.02:
		tmp = 1.0 / (x_m * y_m)
	else:
		tmp = (1.0 / (x_m * z)) / (z * y_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 (Float64(z * z) <= 0.02)
		tmp = Float64(1.0 / Float64(x_m * y_m));
	else
		tmp = Float64(Float64(1.0 / Float64(x_m * z)) / Float64(z * y_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 * z) <= 0.02)
		tmp = 1.0 / (x_m * y_m);
	else
		tmp = (1.0 / (x_m * z)) / (z * y_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[N[(z * z), $MachinePrecision], 0.02], N[(1.0 / N[(x$95$m * y$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(x$95$m * z), $MachinePrecision]), $MachinePrecision] / N[(z * y$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 z z) < 0.0200000000000000004

   1. Initial program 99.6%

      \[\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{1}{\left(y \cdot \left(1 + z \cdot z\right)\right) \cdot x}} \]

      2. associate-*l* 99.7%

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

      3. *-commutative 99.7%

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

      4. sqr-neg 99.7%

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

      5. +-commutative 99.7%

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

      6. sqr-neg 99.7%

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

      7. fma-define 99.7%

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

   3. Simplified 99.7%

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

   5. Taylor expanded in z around 0 98.7%

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

   if 0.0200000000000000004 < (*.f64 z z)

   1. Initial program 83.4%

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

      1. associate-/l/ 82.5%

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

      2. associate-*l* 76.8%

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

      3. *-commutative 76.8%

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

      4. sqr-neg 76.8%

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

      5. +-commutative 76.8%

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

      6. sqr-neg 76.8%

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

      7. fma-define 76.8%

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

   3. Simplified 76.8%

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

   5. Taylor expanded in z around inf 75.1%

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

      1. associate-/r* 76.0%

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

      2. div-inv 76.0%

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

   7. Applied egg-rr 76.0%

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

      1. pow2 76.0%

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

      2. associate-/r* 76.4%

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

      3. *-un-lft-identity 76.4%

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

      4. times-frac 87.1%

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

   9. Applied egg-rr 87.1%

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

       1. associate-*l/ 87.1%

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

       2. *-un-lft-identity 87.1%

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

       3. frac-times 94.5%

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

       4. *-un-lft-identity 94.5%

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

       5. associate-/l/ 94.5%

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

       6. *-commutative 94.5%

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

   11. Applied egg-rr 94.5%

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

4. Final simplification 96.8%

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

Alternative 7: 96.7% accurate, 0.7× 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 0.02:\\ \;\;\;\;\frac{1}{x\_m \cdot y\_m}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{1}{z \cdot y\_m}}{x\_m \cdot 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) 0.02)
     (/ 1.0 (* x_m y_m))
     (/ (/ 1.0 (* z y_m)) (* 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) <= 0.02) {
		tmp = 1.0 / (x_m * y_m);
	} else {
		tmp = (1.0 / (z * y_m)) / (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 * z) <= 0.02d0) then
        tmp = 1.0d0 / (x_m * y_m)
    else
        tmp = (1.0d0 / (z * y_m)) / (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 * z) <= 0.02) {
		tmp = 1.0 / (x_m * y_m);
	} else {
		tmp = (1.0 / (z * y_m)) / (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) <= 0.02:
		tmp = 1.0 / (x_m * y_m)
	else:
		tmp = (1.0 / (z * y_m)) / (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) <= 0.02)
		tmp = Float64(1.0 / Float64(x_m * y_m));
	else
		tmp = Float64(Float64(1.0 / Float64(z * y_m)) / Float64(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) <= 0.02)
		tmp = 1.0 / (x_m * y_m);
	else
		tmp = (1.0 / (z * y_m)) / (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], 0.02], N[(1.0 / N[(x$95$m * y$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(z * y$95$m), $MachinePrecision]), $MachinePrecision] / N[(x$95$m * z), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 z z) < 0.0200000000000000004

   1. Initial program 99.6%

      \[\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{1}{\left(y \cdot \left(1 + z \cdot z\right)\right) \cdot x}} \]

      2. associate-*l* 99.7%

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

      3. *-commutative 99.7%

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

      4. sqr-neg 99.7%

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

      5. +-commutative 99.7%

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

      6. sqr-neg 99.7%

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

      7. fma-define 99.7%

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

   3. Simplified 99.7%

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

   5. Taylor expanded in z around 0 98.7%

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

   if 0.0200000000000000004 < (*.f64 z z)

   1. Initial program 83.4%

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

      1. associate-/l/ 82.5%

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

      2. associate-*l* 76.8%

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

      3. *-commutative 76.8%

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

      4. sqr-neg 76.8%

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

      5. +-commutative 76.8%

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

      6. sqr-neg 76.8%

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

      7. fma-define 76.8%

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

   3. Simplified 76.8%

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

   5. Taylor expanded in z around inf 75.1%

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

      1. associate-/r* 76.0%

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

      2. div-inv 76.0%

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

   7. Applied egg-rr 76.0%

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

      1. pow2 76.0%

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

      2. associate-/r* 76.4%

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

      3. *-un-lft-identity 76.4%

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

      4. times-frac 87.1%

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

   9. Applied egg-rr 87.1%

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

       1. associate-*r* 95.2%

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

       2. associate-/l/ 95.1%

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

       3. un-div-inv 95.3%

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

       4. frac-times 94.5%

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

       5. metadata-eval 94.5%

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

       6. *-commutative 94.5%

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

   11. Applied egg-rr 94.5%

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

4. Final simplification 96.8%

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

Alternative 8: 97.6% accurate, 0.7× 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 0.02:\\ \;\;\;\;\frac{1}{x\_m \cdot y\_m}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\frac{1}{y\_m}}{x\_m \cdot z}}{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) 0.02)
     (/ 1.0 (* x_m y_m))
     (/ (/ (/ 1.0 y_m) (* x_m z)) 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) <= 0.02) {
		tmp = 1.0 / (x_m * y_m);
	} else {
		tmp = ((1.0 / y_m) / (x_m * z)) / 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 * z) <= 0.02d0) then
        tmp = 1.0d0 / (x_m * y_m)
    else
        tmp = ((1.0d0 / y_m) / (x_m * z)) / 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 * z) <= 0.02) {
		tmp = 1.0 / (x_m * y_m);
	} else {
		tmp = ((1.0 / y_m) / (x_m * z)) / 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) <= 0.02:
		tmp = 1.0 / (x_m * y_m)
	else:
		tmp = ((1.0 / y_m) / (x_m * z)) / 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) <= 0.02)
		tmp = Float64(1.0 / Float64(x_m * y_m));
	else
		tmp = Float64(Float64(Float64(1.0 / y_m) / Float64(x_m * z)) / 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) <= 0.02)
		tmp = 1.0 / (x_m * y_m);
	else
		tmp = ((1.0 / y_m) / (x_m * z)) / 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], 0.02], N[(1.0 / N[(x$95$m * y$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / y$95$m), $MachinePrecision] / N[(x$95$m * z), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 z z) < 0.0200000000000000004

   1. Initial program 99.6%

      \[\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{1}{\left(y \cdot \left(1 + z \cdot z\right)\right) \cdot x}} \]

      2. associate-*l* 99.7%

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

      3. *-commutative 99.7%

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

      4. sqr-neg 99.7%

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

      5. +-commutative 99.7%

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

      6. sqr-neg 99.7%

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

      7. fma-define 99.7%

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

   3. Simplified 99.7%

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

   5. Taylor expanded in z around 0 98.7%

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

   if 0.0200000000000000004 < (*.f64 z z)

   1. Initial program 83.4%

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

      1. associate-/l/ 82.5%

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

      2. associate-*l* 76.8%

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

      3. *-commutative 76.8%

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

      4. sqr-neg 76.8%

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

      5. +-commutative 76.8%

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

      6. sqr-neg 76.8%

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

      7. fma-define 76.8%

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

   3. Simplified 76.8%

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

   5. Taylor expanded in z around inf 75.1%

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

      1. associate-/r* 76.0%

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

      2. div-inv 76.0%

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

   7. Applied egg-rr 76.0%

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

      1. pow2 76.0%

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

      2. associate-/r* 76.4%

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

      3. *-un-lft-identity 76.4%

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

      4. times-frac 87.1%

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

   9. Applied egg-rr 87.1%

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

       1. frac-times 76.4%

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

       2. *-un-lft-identity 76.4%

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

       3. associate-*r/ 78.0%

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

       4. div-inv 78.0%

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

       5. associate-/r* 76.0%

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

       6. associate-*r* 86.6%

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

       7. associate-/r* 93.6%

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

   11. Applied egg-rr 93.6%

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

4. Final simplification 96.4%

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

Alternative 9: 74.6% 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{1}{x\_m \cdot y\_m}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{y\_m \cdot \left(x\_m \cdot \left(z \cdot z\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 (* x_m y_m)) (/ 1.0 (* y_m (* x_m (* z 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 / (x_m * y_m);
	} else {
		tmp = 1.0 / (y_m * (x_m * (z * 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 / (x_m * y_m)
    else
        tmp = 1.0d0 / (y_m * (x_m * (z * 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 / (x_m * y_m);
	} else {
		tmp = 1.0 / (y_m * (x_m * (z * 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 / (x_m * y_m)
	else:
		tmp = 1.0 / (y_m * (x_m * (z * 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(1.0 / Float64(x_m * y_m));
	else
		tmp = Float64(1.0 / Float64(y_m * Float64(x_m * Float64(z * 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 / (x_m * y_m);
	else
		tmp = 1.0 / (y_m * (x_m * (z * 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[(1.0 / N[(x$95$m * y$95$m), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(y$95$m * N[(x$95$m * N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < 1

   1. Initial program 95.8%

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

      1. associate-/l/ 95.6%

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

      2. associate-*l* 93.2%

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

      3. *-commutative 93.2%

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

      4. sqr-neg 93.2%

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

      5. +-commutative 93.2%

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

      6. sqr-neg 93.2%

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

      7. fma-define 93.2%

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

   3. Simplified 93.2%

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

   5. Taylor expanded in z around 0 77.0%

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

   if 1 < z

   1. Initial program 81.4%

      \[\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{1}{\left(y \cdot \left(1 + z \cdot z\right)\right) \cdot x}} \]

      2. associate-*l* 77.5%

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

      3. *-commutative 77.5%

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

      4. sqr-neg 77.5%

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

      5. +-commutative 77.5%

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

      6. sqr-neg 77.5%

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

      7. fma-define 77.5%

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

   3. Simplified 77.5%

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

   5. Taylor expanded in z around inf 75.9%

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

      1. unpow2 81.4%

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

   7. Applied egg-rr 75.9%

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

4. Final simplification 76.8%

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

Alternative 10: 58.5% 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}{x\_m \cdot 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 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 * y_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 / (x_m * y_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 / (x_m * 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 * 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(1.0 / Float64(x_m * 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 * 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[(1.0 / N[(x$95$m * y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 92.3%

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

   1. associate-/l/ 92.0%

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

   2. associate-*l* 89.4%

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

   3. *-commutative 89.4%

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

   4. sqr-neg 89.4%

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

   5. +-commutative 89.4%

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

   6. sqr-neg 89.4%

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

   7. fma-define 89.4%

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

3. Simplified 89.4%

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

5. Taylor expanded in z around 0 63.4%

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

6. Final simplification 63.4%

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

Developer target: 93.0% 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 2024067 
(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)))))