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

Percentage Accurate: 88.0% → 98.7%

Time: 9.0s

Alternatives: 11

Speedup: 0.9×

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.0% 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.7% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 z z) < 2.00000000000000001e41

   1. Initial program 99.7%

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

      1. lift-/.f64 N/A

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

      2. clear-num N/A

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

      3. lift-*.f64 N/A

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

      4. associate-/l* N/A

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

      5. associate-/r* N/A

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

      6. lower-/.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lift-/.f64 N/A

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

      9. associate-/r/ N/A

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

      10. /-rgt-identity N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 99.7

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

      13. lift-+.f64 N/A

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

      14. +-commutative N/A

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

      15. lift-*.f64 N/A

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

      16. lower-fma.f64 99.7

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

   4. Applied rewrites 99.7%

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

   if 2.00000000000000001e41 < (*.f64 z z)

   1. Initial program 86.1%

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

   3. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 86.1

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

   5. Applied rewrites 86.1%

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

   7. Applied rewrites 97.7%

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

   9. Applied rewrites 98.9%

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

4. Final simplification 99.4%

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

Alternative 2: 99.3% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 95.9%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. +-commutative N/A

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

      4. distribute-lft-in N/A

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

      5. lift-*.f64 N/A

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

      6. associate-*r* N/A

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

      7. *-rgt-identity N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-*.f64 97.6

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

   4. Applied rewrites 97.6%

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

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

   1. Initial program 82.4%

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

   3. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 82.4

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

   5. Applied rewrites 82.4%

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

   7. Applied rewrites 97.7%

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

4. Final simplification 97.7%

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

Alternative 3: 99.1% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 z z) < 1.00000000000000002e205

   1. Initial program 98.5%

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

      1. lift-/.f64 N/A

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

      2. clear-num N/A

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

      3. lift-*.f64 N/A

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

      4. associate-/l* N/A

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

      5. associate-/r* N/A

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

      6. lower-/.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lift-/.f64 N/A

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

      9. associate-/r/ N/A

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

      10. /-rgt-identity N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 99.7

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

      13. lift-+.f64 N/A

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

      14. +-commutative N/A

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

      15. lift-*.f64 N/A

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

      16. lower-fma.f64 99.7

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

   4. Applied rewrites 99.7%

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

   if 1.00000000000000002e205 < (*.f64 z z)

   1. Initial program 84.6%

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

   3. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 84.5

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

   5. Applied rewrites 84.5%

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

   7. Applied rewrites 98.8%

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

4. Final simplification 99.4%

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

Alternative 4: 97.9% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 z z) < 9.99999999999999955e-7

   1. Initial program 99.7%

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

   3. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 97.6

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

   5. Applied rewrites 97.6%

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

   7. Applied rewrites 99.1%

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

   if 9.99999999999999955e-7 < (*.f64 z z)

   1. Initial program 87.3%

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

   3. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 86.5

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

   5. Applied rewrites 86.5%

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

   7. Applied rewrites 98.2%

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

4. Final simplification 98.7%

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

Alternative 5: 97.7% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 z z) < 9.99999999999999955e-7

   1. Initial program 99.7%

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

   3. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 97.6

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

   5. Applied rewrites 97.6%

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

   7. Applied rewrites 99.1%

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

   if 9.99999999999999955e-7 < (*.f64 z z)

   1. Initial program 87.3%

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

   3. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 86.5

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

   5. Applied rewrites 86.5%

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

   7. Applied rewrites 97.8%

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

4. Final simplification 98.5%

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

Alternative 6: 96.3% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 z z) < 9.99999999999999955e-7

   1. Initial program 99.7%

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

   3. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 97.6

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

   5. Applied rewrites 97.6%

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

   7. Applied rewrites 99.1%

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

   if 9.99999999999999955e-7 < (*.f64 z z)

   1. Initial program 87.3%

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

   3. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 86.5

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

   5. Applied rewrites 86.5%

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

   7. Applied rewrites 97.0%

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

4. Final simplification 98.1%

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

Alternative 7: 95.5% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 z z) < 9.99999999999999955e-7

   1. Initial program 99.7%

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

   3. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 97.6

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

   5. Applied rewrites 97.6%

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

   7. Applied rewrites 99.1%

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

   if 9.99999999999999955e-7 < (*.f64 z z)

   1. Initial program 87.3%

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

   3. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 86.5

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

   5. Applied rewrites 86.5%

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

   7. Applied rewrites 97.0%

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

   9. Applied rewrites 97.7%

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

4. Final simplification 98.4%

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

Alternative 8: 87.2% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 z z) < 9.99999999999999955e-7

   1. Initial program 99.7%

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

   3. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 97.6

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

   5. Applied rewrites 97.6%

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

   7. Applied rewrites 99.1%

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

   if 9.99999999999999955e-7 < (*.f64 z z)

   1. Initial program 87.3%

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

   3. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 86.5

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

   5. Applied rewrites 86.5%

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

4. Final simplification 93.0%

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

Alternative 9: 57.4% accurate, 1.6× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 93.6%

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

3. Taylor expanded in z around 0

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

   1. lower-/.f64 N/A

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

   2. lower-*.f64 60.0

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

5. Applied rewrites 60.0%

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

7. Applied rewrites 60.3%

   \[\leadsto \frac{\frac{1}{y}}{\color{blue}{x}} \]
8. Add Preprocessing

Alternative 10: 57.4% accurate, 1.6× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 93.6%

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

3. Taylor expanded in z around 0

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

   1. lower-/.f64 N/A

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

   2. lower-*.f64 60.0

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

5. Applied rewrites 60.0%

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

7. Applied rewrites 60.2%

   \[\leadsto \frac{\frac{1}{x}}{\color{blue}{y}} \]
8. Add Preprocessing

Alternative 11: 57.5% accurate, 2.1× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 93.6%

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

3. Taylor expanded in z around 0

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

   1. lower-/.f64 N/A

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

   2. lower-*.f64 60.0

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

5. Applied rewrites 60.0%

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

6. Final simplification 60.0%

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

Developer Target 1: 92.2% accurate, 0.5× 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 2024233 
(FPCore (x y z)
  :name "Statistics.Distribution.CauchyLorentz:$cdensity from math-functions-0.1.5.2"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< (* y (+ 1 (* z z))) -inf.0) (/ (/ 1 y) (* (+ 1 (* z z)) x)) (if (< (* y (+ 1 (* z z))) 868074325056725200000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ (/ 1 x) (* (+ 1 (* z z)) y)) (/ (/ 1 y) (* (+ 1 (* z z)) x)))))

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