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

Percentage Accurate: 90.4% → 97.4%

Time: 7.7s

Alternatives: 10

Speedup: 0.8×

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: 90.4% 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: 97.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;z \cdot z \leq 10^{+189}:\\ \;\;\;\;\frac{\frac{1}{x}}{y \cdot \left(1 + z \cdot z\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{z \cdot y} \cdot \frac{\frac{1}{x}}{z}\\ \end{array} \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y z)
 :precision binary64
 (if (<= (* z z) 1e+189)
   (/ (/ 1.0 x) (* y (+ 1.0 (* z z))))
   (* (/ 1.0 (* z y)) (/ (/ 1.0 x) z))))

C

assert(x < y);
double code(double x, double y, double z) {
	double tmp;
	if ((z * z) <= 1e+189) {
		tmp = (1.0 / x) / (y * (1.0 + (z * z)));
	} else {
		tmp = (1.0 / (z * y)) * ((1.0 / x) / z);
	}
	return tmp;
}

Fortran

NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((z * z) <= 1d+189) then
        tmp = (1.0d0 / x) / (y * (1.0d0 + (z * z)))
    else
        tmp = (1.0d0 / (z * y)) * ((1.0d0 / x) / z)
    end if
    code = tmp
end function

Java

assert x < y;
public static double code(double x, double y, double z) {
	double tmp;
	if ((z * z) <= 1e+189) {
		tmp = (1.0 / x) / (y * (1.0 + (z * z)));
	} else {
		tmp = (1.0 / (z * y)) * ((1.0 / x) / z);
	}
	return tmp;
}

Python

[x, y] = sort([x, y])
def code(x, y, z):
	tmp = 0
	if (z * z) <= 1e+189:
		tmp = (1.0 / x) / (y * (1.0 + (z * z)))
	else:
		tmp = (1.0 / (z * y)) * ((1.0 / x) / z)
	return tmp

Julia

x, y = sort([x, y])
function code(x, y, z)
	tmp = 0.0
	if (Float64(z * z) <= 1e+189)
		tmp = Float64(Float64(1.0 / x) / Float64(y * Float64(1.0 + Float64(z * z))));
	else
		tmp = Float64(Float64(1.0 / Float64(z * y)) * Float64(Float64(1.0 / x) / z));
	end
	return tmp
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z * z) <= 1e+189)
		tmp = (1.0 / x) / (y * (1.0 + (z * z)));
	else
		tmp = (1.0 / (z * y)) * ((1.0 / x) / z);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_, z_] := If[LessEqual[N[(z * z), $MachinePrecision], 1e+189], N[(N[(1.0 / x), $MachinePrecision] / N[(y * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(z * y), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 / x), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 z z) < 1e189

   1. Initial program 97.3%

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

   if 1e189 < (*.f64 z z)

   1. Initial program 74.5%

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

      1. associate-/r* 74.5%

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

      2. +-commutative 74.5%

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

      3. fma-def 74.5%

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

   3. Simplified 74.5%

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

   4. Taylor expanded in z around inf 74.5%

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

      1. unpow2 74.5%

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

   6. Simplified 74.5%

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

      1. associate-/r* 74.5%

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

      2. *-un-lft-identity 74.5%

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

      3. associate-*r* 85.9%

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

      4. times-frac 99.8%

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

      5. *-commutative 99.8%

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

   8. Applied egg-rr 99.8%

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

4. Final simplification 98.2%

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

Alternative 2: 97.5% accurate, 0.1× speedup

Math

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

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y z)
 :precision binary64
 (* (/ (/ 1.0 x) (hypot 1.0 z)) (/ (/ 1.0 y) (hypot 1.0 z))))

C

assert(x < y);
double code(double x, double y, double z) {
	return ((1.0 / x) / hypot(1.0, z)) * ((1.0 / y) / hypot(1.0, z));
}

Java

assert x < y;
public static double code(double x, double y, double z) {
	return ((1.0 / x) / Math.hypot(1.0, z)) * ((1.0 / y) / Math.hypot(1.0, z));
}

Python

[x, y] = sort([x, y])
def code(x, y, z):
	return ((1.0 / x) / math.hypot(1.0, z)) * ((1.0 / y) / math.hypot(1.0, z))

Julia

x, y = sort([x, y])
function code(x, y, z)
	return Float64(Float64(Float64(1.0 / x) / hypot(1.0, z)) * Float64(Float64(1.0 / y) / hypot(1.0, z)))
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y, z)
	tmp = ((1.0 / x) / hypot(1.0, z)) * ((1.0 / y) / hypot(1.0, z));
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_, z_] := N[(N[(N[(1.0 / x), $MachinePrecision] / N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 / y), $MachinePrecision] / N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 89.2%

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

   1. associate-/r* 89.0%

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

   2. +-commutative 89.0%

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

   3. fma-def 89.0%

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

3. Simplified 89.0%

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

   1. fma-udef 89.0%

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

   2. +-commutative 89.0%

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

   3. associate-/r* 89.2%

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

   4. associate-/r* 89.9%

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

   5. div-inv 89.8%

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

   6. add-sqr-sqrt 89.8%

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

   7. times-frac 90.6%

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

   8. hypot-1-def 90.6%

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

   9. hypot-1-def 98.8%

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

5. Applied egg-rr 98.8%

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

6. Final simplification 98.8%

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

Alternative 3: 97.1% accurate, 0.7× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;z \cdot z \leq 10^{+189}:\\ \;\;\;\;\frac{1}{x \cdot \left(y + y \cdot \left(z \cdot z\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{z \cdot y} \cdot \frac{\frac{1}{x}}{z}\\ \end{array} \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y z)
 :precision binary64
 (if (<= (* z z) 1e+189)
   (/ 1.0 (* x (+ y (* y (* z z)))))
   (* (/ 1.0 (* z y)) (/ (/ 1.0 x) z))))

C

assert(x < y);
double code(double x, double y, double z) {
	double tmp;
	if ((z * z) <= 1e+189) {
		tmp = 1.0 / (x * (y + (y * (z * z))));
	} else {
		tmp = (1.0 / (z * y)) * ((1.0 / x) / z);
	}
	return tmp;
}

Fortran

NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((z * z) <= 1d+189) then
        tmp = 1.0d0 / (x * (y + (y * (z * z))))
    else
        tmp = (1.0d0 / (z * y)) * ((1.0d0 / x) / z)
    end if
    code = tmp
end function

Java

assert x < y;
public static double code(double x, double y, double z) {
	double tmp;
	if ((z * z) <= 1e+189) {
		tmp = 1.0 / (x * (y + (y * (z * z))));
	} else {
		tmp = (1.0 / (z * y)) * ((1.0 / x) / z);
	}
	return tmp;
}

Python

[x, y] = sort([x, y])
def code(x, y, z):
	tmp = 0
	if (z * z) <= 1e+189:
		tmp = 1.0 / (x * (y + (y * (z * z))))
	else:
		tmp = (1.0 / (z * y)) * ((1.0 / x) / z)
	return tmp

Julia

x, y = sort([x, y])
function code(x, y, z)
	tmp = 0.0
	if (Float64(z * z) <= 1e+189)
		tmp = Float64(1.0 / Float64(x * Float64(y + Float64(y * Float64(z * z)))));
	else
		tmp = Float64(Float64(1.0 / Float64(z * y)) * Float64(Float64(1.0 / x) / z));
	end
	return tmp
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z * z) <= 1e+189)
		tmp = 1.0 / (x * (y + (y * (z * z))));
	else
		tmp = (1.0 / (z * y)) * ((1.0 / x) / z);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_, z_] := If[LessEqual[N[(z * z), $MachinePrecision], 1e+189], N[(1.0 / N[(x * N[(y + N[(y * N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(z * y), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 / x), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 z z) < 1e189

   1. Initial program 97.3%

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

      1. associate-/r* 97.0%

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

      2. +-commutative 97.0%

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

      3. fma-def 97.0%

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

   3. Simplified 97.0%

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

      1. fma-udef 97.0%

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

      2. distribute-lft-in 97.0%

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

      3. *-rgt-identity 97.0%

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

   5. Applied egg-rr 97.0%

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

   if 1e189 < (*.f64 z z)

   1. Initial program 74.5%

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

      1. associate-/r* 74.5%

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

      2. +-commutative 74.5%

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

      3. fma-def 74.5%

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

   3. Simplified 74.5%

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

   4. Taylor expanded in z around inf 74.5%

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

      1. unpow2 74.5%

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

   6. Simplified 74.5%

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

      1. associate-/r* 74.5%

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

      2. *-un-lft-identity 74.5%

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

      3. associate-*r* 85.9%

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

      4. times-frac 99.8%

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

      5. *-commutative 99.8%

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

   8. Applied egg-rr 99.8%

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

4. Final simplification 98.0%

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

Alternative 4: 89.6% accurate, 0.8× speedup

Math

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

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y z)
 :precision binary64
 (if (<= (* z z) 0.5) (/ (/ 1.0 x) y) (/ 1.0 (* x (* y (* z z))))))

C

assert(x < y);
double code(double x, double y, double z) {
	double tmp;
	if ((z * z) <= 0.5) {
		tmp = (1.0 / x) / y;
	} else {
		tmp = 1.0 / (x * (y * (z * z)));
	}
	return tmp;
}

Fortran

NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((z * z) <= 0.5d0) then
        tmp = (1.0d0 / x) / y
    else
        tmp = 1.0d0 / (x * (y * (z * z)))
    end if
    code = tmp
end function

Java

assert x < y;
public static double code(double x, double y, double z) {
	double tmp;
	if ((z * z) <= 0.5) {
		tmp = (1.0 / x) / y;
	} else {
		tmp = 1.0 / (x * (y * (z * z)));
	}
	return tmp;
}

Python

[x, y] = sort([x, y])
def code(x, y, z):
	tmp = 0
	if (z * z) <= 0.5:
		tmp = (1.0 / x) / y
	else:
		tmp = 1.0 / (x * (y * (z * z)))
	return tmp

Julia

x, y = sort([x, y])
function code(x, y, z)
	tmp = 0.0
	if (Float64(z * z) <= 0.5)
		tmp = Float64(Float64(1.0 / x) / y);
	else
		tmp = Float64(1.0 / Float64(x * Float64(y * Float64(z * z))));
	end
	return tmp
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z * z) <= 0.5)
		tmp = (1.0 / x) / y;
	else
		tmp = 1.0 / (x * (y * (z * z)));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_, z_] := If[LessEqual[N[(z * z), $MachinePrecision], 0.5], N[(N[(1.0 / x), $MachinePrecision] / y), $MachinePrecision], N[(1.0 / N[(x * N[(y * N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 99.7%

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

      1. associate-/r* 99.7%

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

      2. +-commutative 99.7%

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

      3. fma-def 99.7%

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

   3. Simplified 99.7%

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

      1. fma-udef 99.7%

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

      2. +-commutative 99.7%

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

      3. associate-/r* 99.7%

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

      4. associate-/r* 99.7%

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

      5. div-inv 99.6%

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

      6. add-sqr-sqrt 99.6%

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

      7. times-frac 99.6%

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

      8. hypot-1-def 99.6%

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

      9. hypot-1-def 99.6%

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

   5. Applied egg-rr 99.6%

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

   6. Taylor expanded in z around 0 98.0%

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

      1. associate-/l/ 98.0%

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

   8. Simplified 98.0%

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

   if 0.5 < (*.f64 z z)

   1. Initial program 79.2%

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

      1. associate-/r* 78.8%

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

      2. +-commutative 78.8%

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

      3. fma-def 78.8%

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

   3. Simplified 78.8%

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

   4. Taylor expanded in z around inf 78.2%

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

      1. unpow2 78.2%

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

   6. Simplified 78.2%

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

4. Final simplification 87.9%

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

Alternative 5: 93.6% accurate, 0.8× speedup

Math

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

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y z)
 :precision binary64
 (if (<= (* z z) 0.5) (/ (/ 1.0 x) y) (/ 1.0 (* x (* z (* z y))))))

C

assert(x < y);
double code(double x, double y, double z) {
	double tmp;
	if ((z * z) <= 0.5) {
		tmp = (1.0 / x) / y;
	} else {
		tmp = 1.0 / (x * (z * (z * y)));
	}
	return tmp;
}

Fortran

NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((z * z) <= 0.5d0) then
        tmp = (1.0d0 / x) / y
    else
        tmp = 1.0d0 / (x * (z * (z * y)))
    end if
    code = tmp
end function

Java

assert x < y;
public static double code(double x, double y, double z) {
	double tmp;
	if ((z * z) <= 0.5) {
		tmp = (1.0 / x) / y;
	} else {
		tmp = 1.0 / (x * (z * (z * y)));
	}
	return tmp;
}

Python

[x, y] = sort([x, y])
def code(x, y, z):
	tmp = 0
	if (z * z) <= 0.5:
		tmp = (1.0 / x) / y
	else:
		tmp = 1.0 / (x * (z * (z * y)))
	return tmp

Julia

x, y = sort([x, y])
function code(x, y, z)
	tmp = 0.0
	if (Float64(z * z) <= 0.5)
		tmp = Float64(Float64(1.0 / x) / y);
	else
		tmp = Float64(1.0 / Float64(x * Float64(z * Float64(z * y))));
	end
	return tmp
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z * z) <= 0.5)
		tmp = (1.0 / x) / y;
	else
		tmp = 1.0 / (x * (z * (z * y)));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_, z_] := If[LessEqual[N[(z * z), $MachinePrecision], 0.5], N[(N[(1.0 / x), $MachinePrecision] / y), $MachinePrecision], N[(1.0 / N[(x * N[(z * N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 99.7%

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

      1. associate-/r* 99.7%

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

      2. +-commutative 99.7%

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

      3. fma-def 99.7%

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

   3. Simplified 99.7%

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

      1. fma-udef 99.7%

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

      2. +-commutative 99.7%

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

      3. associate-/r* 99.7%

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

      4. associate-/r* 99.7%

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

      5. div-inv 99.6%

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

      6. add-sqr-sqrt 99.6%

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

      7. times-frac 99.6%

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

      8. hypot-1-def 99.6%

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

      9. hypot-1-def 99.6%

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

   5. Applied egg-rr 99.6%

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

   6. Taylor expanded in z around 0 98.0%

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

      1. associate-/l/ 98.0%

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

   8. Simplified 98.0%

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

   if 0.5 < (*.f64 z z)

   1. Initial program 79.2%

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

      1. associate-/r* 78.8%

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

      2. +-commutative 78.8%

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

      3. fma-def 78.8%

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

   3. Simplified 78.8%

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

   4. Taylor expanded in z around inf 78.2%

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

      1. unpow2 78.2%

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

      2. *-commutative 78.2%

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

      3. associate-*r* 86.2%

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

   6. Simplified 86.2%

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

4. Final simplification 92.0%

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

Alternative 6: 96.6% accurate, 0.8× speedup

Math

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

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y z)
 :precision binary64
 (if (<= (* z z) 0.5) (/ (/ 1.0 x) y) (/ 1.0 (* z (* y (* x z))))))

C

assert(x < y);
double code(double x, double y, double z) {
	double tmp;
	if ((z * z) <= 0.5) {
		tmp = (1.0 / x) / y;
	} else {
		tmp = 1.0 / (z * (y * (x * z)));
	}
	return tmp;
}

Fortran

NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((z * z) <= 0.5d0) then
        tmp = (1.0d0 / x) / y
    else
        tmp = 1.0d0 / (z * (y * (x * z)))
    end if
    code = tmp
end function

Java

assert x < y;
public static double code(double x, double y, double z) {
	double tmp;
	if ((z * z) <= 0.5) {
		tmp = (1.0 / x) / y;
	} else {
		tmp = 1.0 / (z * (y * (x * z)));
	}
	return tmp;
}

Python

[x, y] = sort([x, y])
def code(x, y, z):
	tmp = 0
	if (z * z) <= 0.5:
		tmp = (1.0 / x) / y
	else:
		tmp = 1.0 / (z * (y * (x * z)))
	return tmp

Julia

x, y = sort([x, y])
function code(x, y, z)
	tmp = 0.0
	if (Float64(z * z) <= 0.5)
		tmp = Float64(Float64(1.0 / x) / y);
	else
		tmp = Float64(1.0 / Float64(z * Float64(y * Float64(x * z))));
	end
	return tmp
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z * z) <= 0.5)
		tmp = (1.0 / x) / y;
	else
		tmp = 1.0 / (z * (y * (x * z)));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_, z_] := If[LessEqual[N[(z * z), $MachinePrecision], 0.5], N[(N[(1.0 / x), $MachinePrecision] / y), $MachinePrecision], N[(1.0 / N[(z * N[(y * N[(x * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 99.7%

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

      1. associate-/r* 99.7%

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

      2. +-commutative 99.7%

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

      3. fma-def 99.7%

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

   3. Simplified 99.7%

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

      1. fma-udef 99.7%

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

      2. +-commutative 99.7%

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

      3. associate-/r* 99.7%

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

      4. associate-/r* 99.7%

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

      5. div-inv 99.6%

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

      6. add-sqr-sqrt 99.6%

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

      7. times-frac 99.6%

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

      8. hypot-1-def 99.6%

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

      9. hypot-1-def 99.6%

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

   5. Applied egg-rr 99.6%

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

   6. Taylor expanded in z around 0 98.0%

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

      1. associate-/l/ 98.0%

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

   8. Simplified 98.0%

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

   if 0.5 < (*.f64 z z)

   1. Initial program 79.2%

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

      1. associate-/r* 78.8%

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

      2. +-commutative 78.8%

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

      3. fma-def 78.8%

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

   3. Simplified 78.8%

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

   4. Taylor expanded in z around inf 80.4%

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

      1. unpow2 80.4%

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

      2. *-commutative 80.4%

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

      3. associate-*l* 79.4%

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

      4. *-commutative 79.4%

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

      5. associate-*l* 89.6%

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

   6. Simplified 89.6%

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

   7. Taylor expanded in z around 0 97.0%

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

4. Final simplification 97.5%

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

Alternative 7: 96.8% accurate, 0.8× speedup

Math

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

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y z)
 :precision binary64
 (if (<= (* z z) 0.5) (/ (/ 1.0 x) y) (/ (/ 1.0 z) (* y (* x z)))))

C

assert(x < y);
double code(double x, double y, double z) {
	double tmp;
	if ((z * z) <= 0.5) {
		tmp = (1.0 / x) / y;
	} else {
		tmp = (1.0 / z) / (y * (x * z));
	}
	return tmp;
}

Fortran

NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((z * z) <= 0.5d0) then
        tmp = (1.0d0 / x) / y
    else
        tmp = (1.0d0 / z) / (y * (x * z))
    end if
    code = tmp
end function

Java

assert x < y;
public static double code(double x, double y, double z) {
	double tmp;
	if ((z * z) <= 0.5) {
		tmp = (1.0 / x) / y;
	} else {
		tmp = (1.0 / z) / (y * (x * z));
	}
	return tmp;
}

Python

[x, y] = sort([x, y])
def code(x, y, z):
	tmp = 0
	if (z * z) <= 0.5:
		tmp = (1.0 / x) / y
	else:
		tmp = (1.0 / z) / (y * (x * z))
	return tmp

Julia

x, y = sort([x, y])
function code(x, y, z)
	tmp = 0.0
	if (Float64(z * z) <= 0.5)
		tmp = Float64(Float64(1.0 / x) / y);
	else
		tmp = Float64(Float64(1.0 / z) / Float64(y * Float64(x * z)));
	end
	return tmp
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z * z) <= 0.5)
		tmp = (1.0 / x) / y;
	else
		tmp = (1.0 / z) / (y * (x * z));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_, z_] := If[LessEqual[N[(z * z), $MachinePrecision], 0.5], N[(N[(1.0 / x), $MachinePrecision] / y), $MachinePrecision], N[(N[(1.0 / z), $MachinePrecision] / N[(y * N[(x * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 99.7%

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

      1. associate-/r* 99.7%

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

      2. +-commutative 99.7%

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

      3. fma-def 99.7%

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

   3. Simplified 99.7%

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

      1. fma-udef 99.7%

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

      2. +-commutative 99.7%

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

      3. associate-/r* 99.7%

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

      4. associate-/r* 99.7%

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

      5. div-inv 99.6%

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

      6. add-sqr-sqrt 99.6%

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

      7. times-frac 99.6%

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

      8. hypot-1-def 99.6%

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

      9. hypot-1-def 99.6%

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

   5. Applied egg-rr 99.6%

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

   6. Taylor expanded in z around 0 98.0%

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

      1. associate-/l/ 98.0%

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

   8. Simplified 98.0%

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

   if 0.5 < (*.f64 z z)

   1. Initial program 79.2%

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

      1. associate-/r* 78.8%

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

      2. +-commutative 78.8%

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

      3. fma-def 78.8%

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

   3. Simplified 78.8%

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

   4. Taylor expanded in z around inf 80.4%

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

      1. unpow2 80.4%

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

      2. *-commutative 80.4%

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

      3. associate-*l* 79.4%

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

      4. *-commutative 79.4%

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

      5. associate-*l* 89.6%

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

   6. Simplified 89.6%

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

      1. *-un-lft-identity 89.6%

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

      2. associate-/r* 90.3%

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

      3. associate-*r* 97.6%

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

   8. Applied egg-rr 97.6%

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

   9. Taylor expanded in z around 0 97.7%

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

4. Final simplification 97.9%

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

Alternative 8: 64.3% accurate, 1.2× speedup

Math

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

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y z)
 :precision binary64
 (if (<= z 1.0) (/ (/ 1.0 x) y) (/ 1.0 (* y (* x z)))))

C

assert(x < y);
double code(double x, double y, double z) {
	double tmp;
	if (z <= 1.0) {
		tmp = (1.0 / x) / y;
	} else {
		tmp = 1.0 / (y * (x * z));
	}
	return tmp;
}

Fortran

NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= 1.0d0) then
        tmp = (1.0d0 / x) / y
    else
        tmp = 1.0d0 / (y * (x * z))
    end if
    code = tmp
end function

Java

assert x < y;
public static double code(double x, double y, double z) {
	double tmp;
	if (z <= 1.0) {
		tmp = (1.0 / x) / y;
	} else {
		tmp = 1.0 / (y * (x * z));
	}
	return tmp;
}

Python

[x, y] = sort([x, y])
def code(x, y, z):
	tmp = 0
	if z <= 1.0:
		tmp = (1.0 / x) / y
	else:
		tmp = 1.0 / (y * (x * z))
	return tmp

Julia

x, y = sort([x, y])
function code(x, y, z)
	tmp = 0.0
	if (z <= 1.0)
		tmp = Float64(Float64(1.0 / x) / y);
	else
		tmp = Float64(1.0 / Float64(y * Float64(x * z)));
	end
	return tmp
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= 1.0)
		tmp = (1.0 / x) / y;
	else
		tmp = 1.0 / (y * (x * z));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_, z_] := If[LessEqual[z, 1.0], N[(N[(1.0 / x), $MachinePrecision] / y), $MachinePrecision], N[(1.0 / N[(y * N[(x * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < 1

   1. Initial program 92.6%

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

      1. associate-/r* 92.6%

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

      2. +-commutative 92.6%

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

      3. fma-def 92.6%

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

   3. Simplified 92.6%

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

      1. fma-udef 92.6%

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

      2. +-commutative 92.6%

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

      3. associate-/r* 92.6%

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

      4. associate-/r* 92.5%

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

      5. div-inv 92.5%

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

      6. add-sqr-sqrt 92.5%

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

      7. times-frac 93.6%

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

      8. hypot-1-def 93.6%

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

      9. hypot-1-def 99.1%

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

   5. Applied egg-rr 99.1%

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

   6. Taylor expanded in z around 0 72.1%

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

      1. associate-/l/ 72.1%

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

   8. Simplified 72.1%

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

   if 1 < z

   1. Initial program 79.9%

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

      1. associate-/r* 79.1%

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

      2. +-commutative 79.1%

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

      3. fma-def 79.1%

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

   3. Simplified 79.1%

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

      1. fma-udef 79.1%

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

      2. +-commutative 79.1%

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

      3. associate-/r* 79.9%

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

      4. associate-/r* 82.7%

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

      5. div-inv 82.6%

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

      6. add-sqr-sqrt 82.6%

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

      7. times-frac 82.6%

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

      8. hypot-1-def 82.6%

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

      9. hypot-1-def 98.1%

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

   5. Applied egg-rr 98.1%

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

   6. Taylor expanded in z around inf 97.1%

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

   7. Taylor expanded in z around 0 45.7%

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

4. Final simplification 65.0%

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

Alternative 9: 58.7% accurate, 2.2× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \frac{1}{x \cdot y} \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y z) :precision binary64 (/ 1.0 (* x y)))

C

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

Fortran

NOTE: x and y should be sorted in increasing order before calling this function.
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)
end function

Java

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

Python

[x, y] = sort([x, y])
def code(x, y, z):
	return 1.0 / (x * y)

Julia

x, y = sort([x, y])
function code(x, y, z)
	return Float64(1.0 / Float64(x * y))
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y, z)
	tmp = 1.0 / (x * y);
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_, z_] := N[(1.0 / N[(x * y), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 89.2%

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

   1. associate-/r* 89.0%

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

   2. +-commutative 89.0%

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

   3. fma-def 89.0%

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

3. Simplified 89.0%

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

4. Taylor expanded in z around 0 58.0%

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

5. Final simplification 58.0%

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

Alternative 10: 58.7% accurate, 2.2× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \frac{\frac{1}{x}}{y} \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y z) :precision binary64 (/ (/ 1.0 x) y))

C

assert(x < y);
double code(double x, double y, double z) {
	return (1.0 / x) / y;
}

Fortran

NOTE: x and y should be sorted in increasing order before calling this function.
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
end function

Java

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

Python

[x, y] = sort([x, y])
def code(x, y, z):
	return (1.0 / x) / y

Julia

x, y = sort([x, y])
function code(x, y, z)
	return Float64(Float64(1.0 / x) / y)
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y, z)
	tmp = (1.0 / x) / y;
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_, z_] := N[(N[(1.0 / x), $MachinePrecision] / y), $MachinePrecision]

Derivation

1. Initial program 89.2%

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

   1. associate-/r* 89.0%

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

   2. +-commutative 89.0%

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

   3. fma-def 89.0%

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

3. Simplified 89.0%

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

   1. fma-udef 89.0%

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

   2. +-commutative 89.0%

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

   3. associate-/r* 89.2%

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

   4. associate-/r* 89.9%

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

   5. div-inv 89.8%

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

   6. add-sqr-sqrt 89.8%

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

   7. times-frac 90.6%

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

   8. hypot-1-def 90.6%

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

   9. hypot-1-def 98.8%

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

5. Applied egg-rr 98.8%

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

6. Taylor expanded in z around 0 58.0%

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

   1. associate-/l/ 58.0%

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

8. Simplified 58.0%

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

9. Final simplification 58.0%

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

Developer target: 92.5% accurate, 0.4× 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 2023238 
(FPCore (x y z)
  :name "Statistics.Distribution.CauchyLorentz:$cdensity from math-functions-0.1.5.2"
  :precision binary64

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

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