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

Percentage Accurate: 88.3% → 97.8%
Time: 3.5s
Alternatives: 4
Speedup: 1.3×

Specification

?
\[\begin{array}{l} \\ \frac{\frac{1}{x}}{y \cdot \left(1 + z \cdot z\right)} \end{array} \]
(FPCore (x y z) :precision binary64 (/ (/ 1.0 x) (* y (+ 1.0 (* z z)))))
double code(double x, double y, double z) {
	return (1.0 / x) / (y * (1.0 + (z * z)));
}
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    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
public static double code(double x, double y, double z) {
	return (1.0 / x) / (y * (1.0 + (z * z)));
}
def code(x, y, z):
	return (1.0 / x) / (y * (1.0 + (z * z)))
function code(x, y, z)
	return Float64(Float64(1.0 / x) / Float64(y * Float64(1.0 + Float64(z * z))))
end
function tmp = code(x, y, z)
	tmp = (1.0 / x) / (y * (1.0 + (z * z)));
end
code[x_, y_, z_] := N[(N[(1.0 / x), $MachinePrecision] / N[(y * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

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

Local Percentage Accuracy vs ?

The average percentage accuracy by input value. Horizontal axis shows value of an input variable; the variable is choosen in the title. Vertical axis is accuracy; higher is better. Red represent the original program, while blue represents Herbie's suggestion. These can be toggled with buttons below the plot. The line is an average while dots represent individual samples.

Accuracy vs Speed?

Herbie found 4 alternatives:

AlternativeAccuracySpeedup
The accuracy (vertical axis) and speed (horizontal axis) of each alternatives. Up and to the right is better. The red square shows the initial program, and each blue circle shows an alternative.The line shows the best available speed-accuracy tradeoffs.

Initial Program: 88.3% accurate, 1.0× speedup?

\[\begin{array}{l} \\ \frac{\frac{1}{x}}{y \cdot \left(1 + z \cdot z\right)} \end{array} \]
(FPCore (x y z) :precision binary64 (/ (/ 1.0 x) (* y (+ 1.0 (* z z)))))
double code(double x, double y, double z) {
	return (1.0 / x) / (y * (1.0 + (z * z)));
}
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    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
public static double code(double x, double y, double z) {
	return (1.0 / x) / (y * (1.0 + (z * z)));
}
def code(x, y, z):
	return (1.0 / x) / (y * (1.0 + (z * z)))
function code(x, y, z)
	return Float64(Float64(1.0 / x) / Float64(y * Float64(1.0 + Float64(z * z))))
end
function tmp = code(x, y, z)
	tmp = (1.0 / x) / (y * (1.0 + (z * z)));
end
code[x_, y_, z_] := N[(N[(1.0 / x), $MachinePrecision] / N[(y * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

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

Alternative 1: 97.8% accurate, 1.1× speedup?

\[\begin{array}{l} z_m = \left|z\right| \\ x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ [x_m, y_m, z_m] = \mathsf{sort}([x_m, y_m, z_m])\\ \\ y\_s \cdot \left(x\_s \cdot \begin{array}{l} \mathbf{if}\;z\_m \leq 6.5 \cdot 10^{-7}:\\ \;\;\;\;\frac{\frac{1}{x\_m}}{y\_m}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\left(y\_m \cdot \left(z\_m \cdot x\_m\right)\right) \cdot z\_m}\\ \end{array}\right) \end{array} \]
z_m = (fabs.f64 z)
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_m should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z_m)
 :precision binary64
 (*
  y_s
  (*
   x_s
   (if (<= z_m 6.5e-7)
     (/ (/ 1.0 x_m) y_m)
     (/ 1.0 (* (* y_m (* z_m x_m)) z_m))))))
z_m = fabs(z);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z_m);
double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
	double tmp;
	if (z_m <= 6.5e-7) {
		tmp = (1.0 / x_m) / y_m;
	} else {
		tmp = 1.0 / ((y_m * (z_m * x_m)) * z_m);
	}
	return y_s * (x_s * tmp);
}
z_m =     private
x\_m =     private
x\_s =     private
y\_m =     private
y\_s =     private
NOTE: x_m, y_m, and z_m should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(y_s, x_s, x_m, y_m, z_m)
use fmin_fmax_functions
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z_m
    real(8) :: tmp
    if (z_m <= 6.5d-7) then
        tmp = (1.0d0 / x_m) / y_m
    else
        tmp = 1.0d0 / ((y_m * (z_m * x_m)) * z_m)
    end if
    code = y_s * (x_s * tmp)
end function
z_m = Math.abs(z);
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z_m;
public static double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
	double tmp;
	if (z_m <= 6.5e-7) {
		tmp = (1.0 / x_m) / y_m;
	} else {
		tmp = 1.0 / ((y_m * (z_m * x_m)) * z_m);
	}
	return y_s * (x_s * tmp);
}
z_m = math.fabs(z)
x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
[x_m, y_m, z_m] = sort([x_m, y_m, z_m])
def code(y_s, x_s, x_m, y_m, z_m):
	tmp = 0
	if z_m <= 6.5e-7:
		tmp = (1.0 / x_m) / y_m
	else:
		tmp = 1.0 / ((y_m * (z_m * x_m)) * z_m)
	return y_s * (x_s * tmp)
z_m = abs(z)
x\_m = abs(x)
x\_s = copysign(1.0, x)
y\_m = abs(y)
y\_s = copysign(1.0, y)
x_m, y_m, z_m = sort([x_m, y_m, z_m])
function code(y_s, x_s, x_m, y_m, z_m)
	tmp = 0.0
	if (z_m <= 6.5e-7)
		tmp = Float64(Float64(1.0 / x_m) / y_m);
	else
		tmp = Float64(1.0 / Float64(Float64(y_m * Float64(z_m * x_m)) * z_m));
	end
	return Float64(y_s * Float64(x_s * tmp))
end
z_m = abs(z);
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z_m = num2cell(sort([x_m, y_m, z_m])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z_m)
	tmp = 0.0;
	if (z_m <= 6.5e-7)
		tmp = (1.0 / x_m) / y_m;
	else
		tmp = 1.0 / ((y_m * (z_m * x_m)) * z_m);
	end
	tmp_2 = y_s * (x_s * tmp);
end
z_m = N[Abs[z], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z_m should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(y$95$s * N[(x$95$s * If[LessEqual[z$95$m, 6.5e-7], N[(N[(1.0 / x$95$m), $MachinePrecision] / y$95$m), $MachinePrecision], N[(1.0 / N[(N[(y$95$m * N[(z$95$m * x$95$m), $MachinePrecision]), $MachinePrecision] * z$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
z_m = \left|z\right|
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z_m] = \mathsf{sort}([x_m, y_m, z_m])\\
\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z\_m \leq 6.5 \cdot 10^{-7}:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{y\_m}\\

\mathbf{else}:\\
\;\;\;\;\frac{1}{\left(y\_m \cdot \left(z\_m \cdot x\_m\right)\right) \cdot z\_m}\\


\end{array}\right)
\end{array}
Derivation
  1. Split input into 2 regimes
  2. if z < 6.50000000000000024e-7

    1. Initial program 99.7%

      \[\frac{\frac{1}{x}}{y \cdot \left(1 + z \cdot z\right)} \]
    2. Taylor expanded in z around 0

      \[\leadsto \frac{\frac{1}{x}}{\color{blue}{y}} \]
    3. Step-by-step derivation
      1. Applied rewrites99.6%

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

      if 6.50000000000000024e-7 < z

      1. Initial program 77.0%

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

          \[\leadsto \color{blue}{\frac{\frac{1}{x}}{y \cdot \left(1 + z \cdot z\right)}} \]
        2. lift-/.f64N/A

          \[\leadsto \frac{\color{blue}{\frac{1}{x}}}{y \cdot \left(1 + z \cdot z\right)} \]
        3. lift-*.f64N/A

          \[\leadsto \frac{\frac{1}{x}}{\color{blue}{y \cdot \left(1 + z \cdot z\right)}} \]
        4. lift-+.f64N/A

          \[\leadsto \frac{\frac{1}{x}}{y \cdot \color{blue}{\left(1 + z \cdot z\right)}} \]
        5. lift-*.f64N/A

          \[\leadsto \frac{\frac{1}{x}}{y \cdot \left(1 + \color{blue}{z \cdot z}\right)} \]
        6. pow2N/A

          \[\leadsto \frac{\frac{1}{x}}{y \cdot \left(1 + \color{blue}{{z}^{2}}\right)} \]
        7. associate-/r*N/A

          \[\leadsto \color{blue}{\frac{1}{x \cdot \left(y \cdot \left(1 + {z}^{2}\right)\right)}} \]
        8. lower-/.f64N/A

          \[\leadsto \color{blue}{\frac{1}{x \cdot \left(y \cdot \left(1 + {z}^{2}\right)\right)}} \]
        9. *-commutativeN/A

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

          \[\leadsto \frac{1}{\left(y \cdot \left(1 + \color{blue}{z \cdot z}\right)\right) \cdot x} \]
        11. lower-*.f64N/A

          \[\leadsto \frac{1}{\color{blue}{\left(y \cdot \left(1 + z \cdot z\right)\right) \cdot x}} \]
        12. *-commutativeN/A

          \[\leadsto \frac{1}{\color{blue}{\left(\left(1 + z \cdot z\right) \cdot y\right)} \cdot x} \]
        13. lower-*.f64N/A

          \[\leadsto \frac{1}{\color{blue}{\left(\left(1 + z \cdot z\right) \cdot y\right)} \cdot x} \]
        14. pow2N/A

          \[\leadsto \frac{1}{\left(\left(1 + \color{blue}{{z}^{2}}\right) \cdot y\right) \cdot x} \]
        15. +-commutativeN/A

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

          \[\leadsto \frac{1}{\left(\left(\color{blue}{z \cdot z} + 1\right) \cdot y\right) \cdot x} \]
        17. lower-fma.f6476.9

          \[\leadsto \frac{1}{\left(\color{blue}{\mathsf{fma}\left(z, z, 1\right)} \cdot y\right) \cdot x} \]
      3. Applied rewrites76.9%

        \[\leadsto \color{blue}{\frac{1}{\left(\mathsf{fma}\left(z, z, 1\right) \cdot y\right) \cdot x}} \]
      4. Taylor expanded in z around inf

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

          \[\leadsto \frac{1}{\left(y \cdot {z}^{2}\right) \cdot \color{blue}{x}} \]
        2. lower-*.f64N/A

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

          \[\leadsto \frac{1}{\left(y \cdot \left(z \cdot z\right)\right) \cdot x} \]
        4. associate-*l*N/A

          \[\leadsto \frac{1}{\left(\left(y \cdot z\right) \cdot z\right) \cdot x} \]
        5. lower-*.f64N/A

          \[\leadsto \frac{1}{\left(\left(y \cdot z\right) \cdot z\right) \cdot x} \]
        6. lift-*.f6479.2

          \[\leadsto \frac{1}{\left(\left(y \cdot z\right) \cdot z\right) \cdot x} \]
      6. Applied rewrites79.2%

        \[\leadsto \frac{1}{\color{blue}{\left(\left(y \cdot z\right) \cdot z\right) \cdot x}} \]
      7. Step-by-step derivation
        1. lift-*.f64N/A

          \[\leadsto \frac{1}{\left(\left(y \cdot z\right) \cdot z\right) \cdot \color{blue}{x}} \]
        2. lift-*.f64N/A

          \[\leadsto \frac{1}{\left(\left(y \cdot z\right) \cdot z\right) \cdot x} \]
        3. lift-*.f64N/A

          \[\leadsto \frac{1}{\left(\left(y \cdot z\right) \cdot z\right) \cdot x} \]
        4. associate-*l*N/A

          \[\leadsto \frac{1}{\left(y \cdot z\right) \cdot \color{blue}{\left(z \cdot x\right)}} \]
        5. *-commutativeN/A

          \[\leadsto \frac{1}{\left(y \cdot z\right) \cdot \left(x \cdot \color{blue}{z}\right)} \]
        6. associate-*r*N/A

          \[\leadsto \frac{1}{y \cdot \color{blue}{\left(z \cdot \left(x \cdot z\right)\right)}} \]
        7. *-commutativeN/A

          \[\leadsto \frac{1}{y \cdot \left(\left(x \cdot z\right) \cdot \color{blue}{z}\right)} \]
        8. associate-*r*N/A

          \[\leadsto \frac{1}{\left(y \cdot \left(x \cdot z\right)\right) \cdot \color{blue}{z}} \]
        9. lower-*.f64N/A

          \[\leadsto \frac{1}{\left(y \cdot \left(x \cdot z\right)\right) \cdot \color{blue}{z}} \]
        10. lower-*.f64N/A

          \[\leadsto \frac{1}{\left(y \cdot \left(x \cdot z\right)\right) \cdot z} \]
        11. *-commutativeN/A

          \[\leadsto \frac{1}{\left(y \cdot \left(z \cdot x\right)\right) \cdot z} \]
        12. lower-*.f6496.0

          \[\leadsto \frac{1}{\left(y \cdot \left(z \cdot x\right)\right) \cdot z} \]
      8. Applied rewrites96.0%

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

    Alternative 2: 98.2% accurate, 1.3× speedup?

    \[\begin{array}{l} z_m = \left|z\right| \\ x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ [x_m, y_m, z_m] = \mathsf{sort}([x_m, y_m, z_m])\\ \\ y\_s \cdot \left(x\_s \cdot \frac{1}{\mathsf{fma}\left(x\_m \cdot z\_m, z\_m, x\_m\right) \cdot y\_m}\right) \end{array} \]
    z_m = (fabs.f64 z)
    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_m should be sorted in increasing order before calling this function.
    (FPCore (y_s x_s x_m y_m z_m)
     :precision binary64
     (* y_s (* x_s (/ 1.0 (* (fma (* x_m z_m) z_m x_m) y_m)))))
    z_m = fabs(z);
    x\_m = fabs(x);
    x\_s = copysign(1.0, x);
    y\_m = fabs(y);
    y\_s = copysign(1.0, y);
    assert(x_m < y_m && y_m < z_m);
    double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
    	return y_s * (x_s * (1.0 / (fma((x_m * z_m), z_m, x_m) * y_m)));
    }
    
    z_m = abs(z)
    x\_m = abs(x)
    x\_s = copysign(1.0, x)
    y\_m = abs(y)
    y\_s = copysign(1.0, y)
    x_m, y_m, z_m = sort([x_m, y_m, z_m])
    function code(y_s, x_s, x_m, y_m, z_m)
    	return Float64(y_s * Float64(x_s * Float64(1.0 / Float64(fma(Float64(x_m * z_m), z_m, x_m) * y_m))))
    end
    
    z_m = N[Abs[z], $MachinePrecision]
    x\_m = N[Abs[x], $MachinePrecision]
    x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
    y\_m = N[Abs[y], $MachinePrecision]
    y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
    NOTE: x_m, y_m, and z_m should be sorted in increasing order before calling this function.
    code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(y$95$s * N[(x$95$s * N[(1.0 / N[(N[(N[(x$95$m * z$95$m), $MachinePrecision] * z$95$m + x$95$m), $MachinePrecision] * y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
    
    \begin{array}{l}
    z_m = \left|z\right|
    \\
    x\_m = \left|x\right|
    \\
    x\_s = \mathsf{copysign}\left(1, x\right)
    \\
    y\_m = \left|y\right|
    \\
    y\_s = \mathsf{copysign}\left(1, y\right)
    \\
    [x_m, y_m, z_m] = \mathsf{sort}([x_m, y_m, z_m])\\
    \\
    y\_s \cdot \left(x\_s \cdot \frac{1}{\mathsf{fma}\left(x\_m \cdot z\_m, z\_m, x\_m\right) \cdot y\_m}\right)
    \end{array}
    
    Derivation
    1. Initial program 88.3%

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

        \[\leadsto \color{blue}{\frac{\frac{1}{x}}{y \cdot \left(1 + z \cdot z\right)}} \]
      2. lift-/.f64N/A

        \[\leadsto \frac{\color{blue}{\frac{1}{x}}}{y \cdot \left(1 + z \cdot z\right)} \]
      3. lift-*.f64N/A

        \[\leadsto \frac{\frac{1}{x}}{\color{blue}{y \cdot \left(1 + z \cdot z\right)}} \]
      4. lift-+.f64N/A

        \[\leadsto \frac{\frac{1}{x}}{y \cdot \color{blue}{\left(1 + z \cdot z\right)}} \]
      5. lift-*.f64N/A

        \[\leadsto \frac{\frac{1}{x}}{y \cdot \left(1 + \color{blue}{z \cdot z}\right)} \]
      6. *-commutativeN/A

        \[\leadsto \frac{\frac{1}{x}}{\color{blue}{\left(1 + z \cdot z\right) \cdot y}} \]
      7. associate-/r*N/A

        \[\leadsto \color{blue}{\frac{\frac{\frac{1}{x}}{1 + z \cdot z}}{y}} \]
      8. lower-/.f64N/A

        \[\leadsto \color{blue}{\frac{\frac{\frac{1}{x}}{1 + z \cdot z}}{y}} \]
      9. lower-/.f64N/A

        \[\leadsto \frac{\color{blue}{\frac{\frac{1}{x}}{1 + z \cdot z}}}{y} \]
      10. inv-powN/A

        \[\leadsto \frac{\frac{\color{blue}{{x}^{-1}}}{1 + z \cdot z}}{y} \]
      11. lower-pow.f64N/A

        \[\leadsto \frac{\frac{\color{blue}{{x}^{-1}}}{1 + z \cdot z}}{y} \]
      12. pow2N/A

        \[\leadsto \frac{\frac{{x}^{-1}}{1 + \color{blue}{{z}^{2}}}}{y} \]
      13. +-commutativeN/A

        \[\leadsto \frac{\frac{{x}^{-1}}{\color{blue}{{z}^{2} + 1}}}{y} \]
      14. pow2N/A

        \[\leadsto \frac{\frac{{x}^{-1}}{\color{blue}{z \cdot z} + 1}}{y} \]
      15. lower-fma.f6492.6

        \[\leadsto \frac{\frac{{x}^{-1}}{\color{blue}{\mathsf{fma}\left(z, z, 1\right)}}}{y} \]
    3. Applied rewrites92.6%

      \[\leadsto \color{blue}{\frac{\frac{{x}^{-1}}{\mathsf{fma}\left(z, z, 1\right)}}{y}} \]
    4. Step-by-step derivation
      1. lift-/.f64N/A

        \[\leadsto \color{blue}{\frac{\frac{{x}^{-1}}{\mathsf{fma}\left(z, z, 1\right)}}{y}} \]
      2. lift-/.f64N/A

        \[\leadsto \frac{\color{blue}{\frac{{x}^{-1}}{\mathsf{fma}\left(z, z, 1\right)}}}{y} \]
      3. lift-pow.f64N/A

        \[\leadsto \frac{\frac{\color{blue}{{x}^{-1}}}{\mathsf{fma}\left(z, z, 1\right)}}{y} \]
      4. inv-powN/A

        \[\leadsto \frac{\frac{\color{blue}{\frac{1}{x}}}{\mathsf{fma}\left(z, z, 1\right)}}{y} \]
      5. lift-fma.f64N/A

        \[\leadsto \frac{\frac{\frac{1}{x}}{\color{blue}{z \cdot z + 1}}}{y} \]
      6. associate-/l/N/A

        \[\leadsto \color{blue}{\frac{\frac{1}{x}}{\left(z \cdot z + 1\right) \cdot y}} \]
      7. *-commutativeN/A

        \[\leadsto \frac{\frac{1}{x}}{\color{blue}{y \cdot \left(z \cdot z + 1\right)}} \]
      8. pow2N/A

        \[\leadsto \frac{\frac{1}{x}}{y \cdot \left(\color{blue}{{z}^{2}} + 1\right)} \]
      9. +-commutativeN/A

        \[\leadsto \frac{\frac{1}{x}}{y \cdot \color{blue}{\left(1 + {z}^{2}\right)}} \]
      10. associate-/r*N/A

        \[\leadsto \color{blue}{\frac{1}{x \cdot \left(y \cdot \left(1 + {z}^{2}\right)\right)}} \]
      11. associate-*r*N/A

        \[\leadsto \frac{1}{\color{blue}{\left(x \cdot y\right) \cdot \left(1 + {z}^{2}\right)}} \]
      12. +-commutativeN/A

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

        \[\leadsto \frac{1}{\left(x \cdot y\right) \cdot \left(\color{blue}{z \cdot z} + 1\right)} \]
      14. associate-*r*N/A

        \[\leadsto \frac{1}{\color{blue}{x \cdot \left(y \cdot \left(z \cdot z + 1\right)\right)}} \]
      15. *-commutativeN/A

        \[\leadsto \frac{1}{x \cdot \color{blue}{\left(\left(z \cdot z + 1\right) \cdot y\right)}} \]
      16. *-commutativeN/A

        \[\leadsto \frac{1}{\color{blue}{\left(\left(z \cdot z + 1\right) \cdot y\right) \cdot x}} \]
      17. lower-/.f64N/A

        \[\leadsto \color{blue}{\frac{1}{\left(\left(z \cdot z + 1\right) \cdot y\right) \cdot x}} \]
      18. *-commutativeN/A

        \[\leadsto \frac{1}{\color{blue}{x \cdot \left(\left(z \cdot z + 1\right) \cdot y\right)}} \]
      19. associate-*r*N/A

        \[\leadsto \frac{1}{\color{blue}{\left(x \cdot \left(z \cdot z + 1\right)\right) \cdot y}} \]
      20. pow2N/A

        \[\leadsto \frac{1}{\left(x \cdot \left(\color{blue}{{z}^{2}} + 1\right)\right) \cdot y} \]
      21. +-commutativeN/A

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

      \[\leadsto \color{blue}{\frac{1}{\left(\mathsf{fma}\left(z, z, 1\right) \cdot x\right) \cdot y}} \]
    6. Step-by-step derivation
      1. lift-*.f64N/A

        \[\leadsto \frac{1}{\color{blue}{\left(\mathsf{fma}\left(z, z, 1\right) \cdot x\right)} \cdot y} \]
      2. lift-fma.f64N/A

        \[\leadsto \frac{1}{\left(\color{blue}{\left(z \cdot z + 1\right)} \cdot x\right) \cdot y} \]
      3. pow2N/A

        \[\leadsto \frac{1}{\left(\left(\color{blue}{{z}^{2}} + 1\right) \cdot x\right) \cdot y} \]
      4. distribute-lft1-inN/A

        \[\leadsto \frac{1}{\color{blue}{\left({z}^{2} \cdot x + x\right)} \cdot y} \]
      5. *-commutativeN/A

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

        \[\leadsto \frac{1}{\left(x \cdot \color{blue}{\left(z \cdot z\right)} + x\right) \cdot y} \]
      7. associate-*r*N/A

        \[\leadsto \frac{1}{\left(\color{blue}{\left(x \cdot z\right) \cdot z} + x\right) \cdot y} \]
      8. *-commutativeN/A

        \[\leadsto \frac{1}{\left(\color{blue}{\left(z \cdot x\right)} \cdot z + x\right) \cdot y} \]
      9. lower-fma.f64N/A

        \[\leadsto \frac{1}{\color{blue}{\mathsf{fma}\left(z \cdot x, z, x\right)} \cdot y} \]
      10. *-commutativeN/A

        \[\leadsto \frac{1}{\mathsf{fma}\left(\color{blue}{x \cdot z}, z, x\right) \cdot y} \]
      11. lower-*.f6498.2

        \[\leadsto \frac{1}{\mathsf{fma}\left(\color{blue}{x \cdot z}, z, x\right) \cdot y} \]
    7. Applied rewrites98.2%

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

    Alternative 3: 59.4% accurate, 1.6× speedup?

    \[\begin{array}{l} z_m = \left|z\right| \\ x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ [x_m, y_m, z_m] = \mathsf{sort}([x_m, y_m, z_m])\\ \\ y\_s \cdot \left(x\_s \cdot \frac{\frac{1}{x\_m}}{y\_m}\right) \end{array} \]
    z_m = (fabs.f64 z)
    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_m should be sorted in increasing order before calling this function.
    (FPCore (y_s x_s x_m y_m z_m)
     :precision binary64
     (* y_s (* x_s (/ (/ 1.0 x_m) y_m))))
    z_m = fabs(z);
    x\_m = fabs(x);
    x\_s = copysign(1.0, x);
    y\_m = fabs(y);
    y\_s = copysign(1.0, y);
    assert(x_m < y_m && y_m < z_m);
    double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
    	return y_s * (x_s * ((1.0 / x_m) / y_m));
    }
    
    z_m =     private
    x\_m =     private
    x\_s =     private
    y\_m =     private
    y\_s =     private
    NOTE: x_m, y_m, and z_m should be sorted in increasing order before calling this function.
    module fmin_fmax_functions
        implicit none
        private
        public fmax
        public fmin
    
        interface fmax
            module procedure fmax88
            module procedure fmax44
            module procedure fmax84
            module procedure fmax48
        end interface
        interface fmin
            module procedure fmin88
            module procedure fmin44
            module procedure fmin84
            module procedure fmin48
        end interface
    contains
        real(8) function fmax88(x, y) result (res)
            real(8), intent (in) :: x
            real(8), intent (in) :: y
            res = merge(y, merge(x, max(x, y), y /= y), x /= x)
        end function
        real(4) function fmax44(x, y) result (res)
            real(4), intent (in) :: x
            real(4), intent (in) :: y
            res = merge(y, merge(x, max(x, y), y /= y), x /= x)
        end function
        real(8) function fmax84(x, y) result(res)
            real(8), intent (in) :: x
            real(4), intent (in) :: y
            res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
        end function
        real(8) function fmax48(x, y) result(res)
            real(4), intent (in) :: x
            real(8), intent (in) :: y
            res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
        end function
        real(8) function fmin88(x, y) result (res)
            real(8), intent (in) :: x
            real(8), intent (in) :: y
            res = merge(y, merge(x, min(x, y), y /= y), x /= x)
        end function
        real(4) function fmin44(x, y) result (res)
            real(4), intent (in) :: x
            real(4), intent (in) :: y
            res = merge(y, merge(x, min(x, y), y /= y), x /= x)
        end function
        real(8) function fmin84(x, y) result(res)
            real(8), intent (in) :: x
            real(4), intent (in) :: y
            res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
        end function
        real(8) function fmin48(x, y) result(res)
            real(4), intent (in) :: x
            real(8), intent (in) :: y
            res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
        end function
    end module
    
    real(8) function code(y_s, x_s, x_m, y_m, z_m)
    use fmin_fmax_functions
        real(8), intent (in) :: y_s
        real(8), intent (in) :: x_s
        real(8), intent (in) :: x_m
        real(8), intent (in) :: y_m
        real(8), intent (in) :: z_m
        code = y_s * (x_s * ((1.0d0 / x_m) / y_m))
    end function
    
    z_m = Math.abs(z);
    x\_m = Math.abs(x);
    x\_s = Math.copySign(1.0, x);
    y\_m = Math.abs(y);
    y\_s = Math.copySign(1.0, y);
    assert x_m < y_m && y_m < z_m;
    public static double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
    	return y_s * (x_s * ((1.0 / x_m) / y_m));
    }
    
    z_m = math.fabs(z)
    x\_m = math.fabs(x)
    x\_s = math.copysign(1.0, x)
    y\_m = math.fabs(y)
    y\_s = math.copysign(1.0, y)
    [x_m, y_m, z_m] = sort([x_m, y_m, z_m])
    def code(y_s, x_s, x_m, y_m, z_m):
    	return y_s * (x_s * ((1.0 / x_m) / y_m))
    
    z_m = abs(z)
    x\_m = abs(x)
    x\_s = copysign(1.0, x)
    y\_m = abs(y)
    y\_s = copysign(1.0, y)
    x_m, y_m, z_m = sort([x_m, y_m, z_m])
    function code(y_s, x_s, x_m, y_m, z_m)
    	return Float64(y_s * Float64(x_s * Float64(Float64(1.0 / x_m) / y_m)))
    end
    
    z_m = abs(z);
    x\_m = abs(x);
    x\_s = sign(x) * abs(1.0);
    y\_m = abs(y);
    y\_s = sign(y) * abs(1.0);
    x_m, y_m, z_m = num2cell(sort([x_m, y_m, z_m])){:}
    function tmp = code(y_s, x_s, x_m, y_m, z_m)
    	tmp = y_s * (x_s * ((1.0 / x_m) / y_m));
    end
    
    z_m = N[Abs[z], $MachinePrecision]
    x\_m = N[Abs[x], $MachinePrecision]
    x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
    y\_m = N[Abs[y], $MachinePrecision]
    y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
    NOTE: x_m, y_m, and z_m should be sorted in increasing order before calling this function.
    code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(y$95$s * N[(x$95$s * N[(N[(1.0 / x$95$m), $MachinePrecision] / y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
    
    \begin{array}{l}
    z_m = \left|z\right|
    \\
    x\_m = \left|x\right|
    \\
    x\_s = \mathsf{copysign}\left(1, x\right)
    \\
    y\_m = \left|y\right|
    \\
    y\_s = \mathsf{copysign}\left(1, y\right)
    \\
    [x_m, y_m, z_m] = \mathsf{sort}([x_m, y_m, z_m])\\
    \\
    y\_s \cdot \left(x\_s \cdot \frac{\frac{1}{x\_m}}{y\_m}\right)
    \end{array}
    
    Derivation
    1. Initial program 88.3%

      \[\frac{\frac{1}{x}}{y \cdot \left(1 + z \cdot z\right)} \]
    2. Taylor expanded in z around 0

      \[\leadsto \frac{\frac{1}{x}}{\color{blue}{y}} \]
    3. Step-by-step derivation
      1. Applied rewrites59.4%

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

      Alternative 4: 59.3% accurate, 2.1× speedup?

      \[\begin{array}{l} z_m = \left|z\right| \\ x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ [x_m, y_m, z_m] = \mathsf{sort}([x_m, y_m, z_m])\\ \\ y\_s \cdot \left(x\_s \cdot \frac{1}{x\_m \cdot y\_m}\right) \end{array} \]
      z_m = (fabs.f64 z)
      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_m should be sorted in increasing order before calling this function.
      (FPCore (y_s x_s x_m y_m z_m)
       :precision binary64
       (* y_s (* x_s (/ 1.0 (* x_m y_m)))))
      z_m = fabs(z);
      x\_m = fabs(x);
      x\_s = copysign(1.0, x);
      y\_m = fabs(y);
      y\_s = copysign(1.0, y);
      assert(x_m < y_m && y_m < z_m);
      double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
      	return y_s * (x_s * (1.0 / (x_m * y_m)));
      }
      
      z_m =     private
      x\_m =     private
      x\_s =     private
      y\_m =     private
      y\_s =     private
      NOTE: x_m, y_m, and z_m should be sorted in increasing order before calling this function.
      module fmin_fmax_functions
          implicit none
          private
          public fmax
          public fmin
      
          interface fmax
              module procedure fmax88
              module procedure fmax44
              module procedure fmax84
              module procedure fmax48
          end interface
          interface fmin
              module procedure fmin88
              module procedure fmin44
              module procedure fmin84
              module procedure fmin48
          end interface
      contains
          real(8) function fmax88(x, y) result (res)
              real(8), intent (in) :: x
              real(8), intent (in) :: y
              res = merge(y, merge(x, max(x, y), y /= y), x /= x)
          end function
          real(4) function fmax44(x, y) result (res)
              real(4), intent (in) :: x
              real(4), intent (in) :: y
              res = merge(y, merge(x, max(x, y), y /= y), x /= x)
          end function
          real(8) function fmax84(x, y) result(res)
              real(8), intent (in) :: x
              real(4), intent (in) :: y
              res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
          end function
          real(8) function fmax48(x, y) result(res)
              real(4), intent (in) :: x
              real(8), intent (in) :: y
              res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
          end function
          real(8) function fmin88(x, y) result (res)
              real(8), intent (in) :: x
              real(8), intent (in) :: y
              res = merge(y, merge(x, min(x, y), y /= y), x /= x)
          end function
          real(4) function fmin44(x, y) result (res)
              real(4), intent (in) :: x
              real(4), intent (in) :: y
              res = merge(y, merge(x, min(x, y), y /= y), x /= x)
          end function
          real(8) function fmin84(x, y) result(res)
              real(8), intent (in) :: x
              real(4), intent (in) :: y
              res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
          end function
          real(8) function fmin48(x, y) result(res)
              real(4), intent (in) :: x
              real(8), intent (in) :: y
              res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
          end function
      end module
      
      real(8) function code(y_s, x_s, x_m, y_m, z_m)
      use fmin_fmax_functions
          real(8), intent (in) :: y_s
          real(8), intent (in) :: x_s
          real(8), intent (in) :: x_m
          real(8), intent (in) :: y_m
          real(8), intent (in) :: z_m
          code = y_s * (x_s * (1.0d0 / (x_m * y_m)))
      end function
      
      z_m = Math.abs(z);
      x\_m = Math.abs(x);
      x\_s = Math.copySign(1.0, x);
      y\_m = Math.abs(y);
      y\_s = Math.copySign(1.0, y);
      assert x_m < y_m && y_m < z_m;
      public static double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
      	return y_s * (x_s * (1.0 / (x_m * y_m)));
      }
      
      z_m = math.fabs(z)
      x\_m = math.fabs(x)
      x\_s = math.copysign(1.0, x)
      y\_m = math.fabs(y)
      y\_s = math.copysign(1.0, y)
      [x_m, y_m, z_m] = sort([x_m, y_m, z_m])
      def code(y_s, x_s, x_m, y_m, z_m):
      	return y_s * (x_s * (1.0 / (x_m * y_m)))
      
      z_m = abs(z)
      x\_m = abs(x)
      x\_s = copysign(1.0, x)
      y\_m = abs(y)
      y\_s = copysign(1.0, y)
      x_m, y_m, z_m = sort([x_m, y_m, z_m])
      function code(y_s, x_s, x_m, y_m, z_m)
      	return Float64(y_s * Float64(x_s * Float64(1.0 / Float64(x_m * y_m))))
      end
      
      z_m = abs(z);
      x\_m = abs(x);
      x\_s = sign(x) * abs(1.0);
      y\_m = abs(y);
      y\_s = sign(y) * abs(1.0);
      x_m, y_m, z_m = num2cell(sort([x_m, y_m, z_m])){:}
      function tmp = code(y_s, x_s, x_m, y_m, z_m)
      	tmp = y_s * (x_s * (1.0 / (x_m * y_m)));
      end
      
      z_m = N[Abs[z], $MachinePrecision]
      x\_m = N[Abs[x], $MachinePrecision]
      x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
      y\_m = N[Abs[y], $MachinePrecision]
      y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
      NOTE: x_m, y_m, and z_m should be sorted in increasing order before calling this function.
      code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(y$95$s * N[(x$95$s * N[(1.0 / N[(x$95$m * y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
      
      \begin{array}{l}
      z_m = \left|z\right|
      \\
      x\_m = \left|x\right|
      \\
      x\_s = \mathsf{copysign}\left(1, x\right)
      \\
      y\_m = \left|y\right|
      \\
      y\_s = \mathsf{copysign}\left(1, y\right)
      \\
      [x_m, y_m, z_m] = \mathsf{sort}([x_m, y_m, z_m])\\
      \\
      y\_s \cdot \left(x\_s \cdot \frac{1}{x\_m \cdot y\_m}\right)
      \end{array}
      
      Derivation
      1. Initial program 88.3%

        \[\frac{\frac{1}{x}}{y \cdot \left(1 + z \cdot z\right)} \]
      2. Taylor expanded in z around 0

        \[\leadsto \frac{\frac{1}{x}}{\color{blue}{y}} \]
      3. Step-by-step derivation
        1. Applied rewrites59.4%

          \[\leadsto \frac{\frac{1}{x}}{\color{blue}{y}} \]
        2. Step-by-step derivation
          1. lift-/.f64N/A

            \[\leadsto \color{blue}{\frac{\frac{1}{x}}{y}} \]
          2. lift-/.f64N/A

            \[\leadsto \frac{\color{blue}{\frac{1}{x}}}{y} \]
          3. associate-/l/N/A

            \[\leadsto \color{blue}{\frac{1}{x \cdot y}} \]
          4. lower-/.f64N/A

            \[\leadsto \color{blue}{\frac{1}{x \cdot y}} \]
          5. lower-*.f6459.3

            \[\leadsto \frac{1}{\color{blue}{x \cdot y}} \]
          6. *-commutative59.3

            \[\leadsto \frac{1}{x \cdot y} \]
          7. pow259.3

            \[\leadsto \frac{1}{x \cdot y} \]
          8. +-commutative59.3

            \[\leadsto \frac{1}{x \cdot y} \]
          9. distribute-lft1-in59.3

            \[\leadsto \frac{1}{x \cdot y} \]
          10. *-commutative59.3

            \[\leadsto \frac{1}{x \cdot y} \]
          11. pow259.3

            \[\leadsto \frac{1}{x \cdot y} \]
          12. associate-*l*59.3

            \[\leadsto \frac{1}{x \cdot y} \]
        3. Applied rewrites59.3%

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

        Developer Target 1: 92.6% accurate, 0.5× speedup?

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

        Reproduce

        ?
        herbie shell --seed 2025093 
        (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)))))