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

Percentage Accurate: 90.7% → 98.0%

Time: 8.7s

Alternatives: 8

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

Math

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

FPCore

(FPCore (x y z) :precision binary64 (/ (/ 1.0 x) (* y (+ 1.0 (* z z)))))

C

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

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (1.0d0 / x) / (y * (1.0d0 + (z * z)))
end function

Java

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

Python

def code(x, y, z):
	return (1.0 / x) / (y * (1.0 + (z * z)))

Julia

function code(x, y, z)
	return Float64(Float64(1.0 / x) / Float64(y * Float64(1.0 + Float64(z * z))))
end

MATLAB

function tmp = code(x, y, z)
	tmp = (1.0 / x) / (y * (1.0 + (z * z)));
end

Wolfram

code[x_, y_, z_] := N[(N[(1.0 / x), $MachinePrecision] / N[(y * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 98.0% accurate, 0.1× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;\frac{1}{x} \leq -1 \cdot 10^{+27}:\\ \;\;\;\;\frac{\frac{1}{x}}{\mathsf{hypot}\left(1, z\right)} \cdot \frac{\frac{1}{y}}{\mathsf{hypot}\left(1, z\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\mathsf{hypot}\left(1, z\right)} \cdot \frac{\frac{1}{x \cdot y}}{\mathsf{hypot}\left(1, 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 (<= (/ 1.0 x) -1e+27)
   (* (/ (/ 1.0 x) (hypot 1.0 z)) (/ (/ 1.0 y) (hypot 1.0 z)))
   (* (/ 1.0 (hypot 1.0 z)) (/ (/ 1.0 (* x y)) (hypot 1.0 z)))))

C

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

Java

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

Python

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

Julia

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

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((1.0 / x) <= -1e+27)
		tmp = ((1.0 / x) / hypot(1.0, z)) * ((1.0 / y) / hypot(1.0, z));
	else
		tmp = (1.0 / hypot(1.0, z)) * ((1.0 / (x * y)) / hypot(1.0, 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[(1.0 / x), $MachinePrecision], -1e+27], 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], N[(N[(1.0 / N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 / N[(x * y), $MachinePrecision]), $MachinePrecision] / N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 1 x) < -1e27

   1. Initial program 82.2%

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

      1. associate-/r* 82.3%

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

      2. +-commutative 82.3%

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

      3. fma-def 82.3%

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

   3. Simplified 82.3%

      \[\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 82.3%

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

      2. +-commutative 82.3%

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

      3. associate-/r* 82.2%

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

      4. associate-/r* 75.5%

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

      5. div-inv 75.4%

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

      6. add-sqr-sqrt 75.4%

         \[\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 84.8%

         \[\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 84.8%

         \[\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.0%

         \[\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.0%

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

   if -1e27 < (/.f64 1 x)

   1. Initial program 93.8%

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

      1. associate-/r* 93.8%

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

      2. +-commutative 93.8%

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

      3. fma-def 93.8%

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

   3. Simplified 93.8%

      \[\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 93.8%

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

      2. +-commutative 93.8%

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

      3. associate-/r* 93.8%

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

      4. associate-/r* 93.3%

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

      5. add-sqr-sqrt 93.3%

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

      6. *-un-lft-identity 93.3%

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

      7. times-frac 93.3%

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

      8. hypot-1-def 93.3%

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

      9. associate-/l/ 93.2%

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

      10. hypot-1-def 96.6%

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

   5. Applied egg-rr 96.6%

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

4. Final simplification 97.2%

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

Alternative 2: 97.5% accurate, 0.7× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;z \cdot z \leq 5 \cdot 10^{+201}:\\ \;\;\;\;\frac{1}{x \cdot \left(y + y \cdot \left(z \cdot z\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{1}{z}}{x \cdot \left(z \cdot y\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) 5e+201)
   (/ 1.0 (* x (+ y (* y (* z z)))))
   (/ (/ 1.0 z) (* x (* z y)))))

C

assert(x < y);
double code(double x, double y, double z) {
	double tmp;
	if ((z * z) <= 5e+201) {
		tmp = 1.0 / (x * (y + (y * (z * z))));
	} else {
		tmp = (1.0 / z) / (x * (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) <= 5d+201) then
        tmp = 1.0d0 / (x * (y + (y * (z * z))))
    else
        tmp = (1.0d0 / z) / (x * (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) <= 5e+201) {
		tmp = 1.0 / (x * (y + (y * (z * z))));
	} else {
		tmp = (1.0 / z) / (x * (z * y));
	}
	return tmp;
}

Python

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

Julia

x, y = sort([x, y])
function code(x, y, z)
	tmp = 0.0
	if (Float64(z * z) <= 5e+201)
		tmp = Float64(1.0 / Float64(x * Float64(y + Float64(y * Float64(z * z)))));
	else
		tmp = Float64(Float64(1.0 / z) / Float64(x * 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) <= 5e+201)
		tmp = 1.0 / (x * (y + (y * (z * z))));
	else
		tmp = (1.0 / z) / (x * (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], 5e+201], N[(1.0 / N[(x * N[(y + N[(y * N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / z), $MachinePrecision] / N[(x * N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 z z) < 4.9999999999999995e201

   1. Initial program 98.0%

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

      1. associate-/r* 98.0%

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

      2. +-commutative 98.0%

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

      3. fma-def 98.0%

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

   3. Simplified 98.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 98.0%

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

      2. distribute-lft-in 98.0%

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

      3. *-rgt-identity 98.0%

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

   5. Applied egg-rr 98.0%

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

   if 4.9999999999999995e201 < (*.f64 z z)

   1. Initial program 75.6%

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

      1. associate-/r* 75.5%

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

      2. +-commutative 75.5%

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

      3. fma-def 75.5%

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

   3. Simplified 75.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.3%

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

      1. unpow2 74.3%

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

      2. *-commutative 74.3%

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

      3. associate-*l* 75.1%

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

      4. *-commutative 75.1%

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

      5. associate-*l* 92.4%

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

   6. Simplified 92.4%

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

      1. add-cube-cbrt 91.9%

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

      2. pow3 91.9%

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

      3. associate-/r* 92.8%

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

      4. *-commutative 92.8%

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

      5. *-commutative 92.8%

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

      6. associate-*l* 96.2%

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

   8. Applied egg-rr 96.2%

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

      1. rem-cube-cbrt 96.5%

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

      2. *-commutative 96.5%

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

   10. Applied egg-rr 96.5%

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

4. Final simplification 97.5%

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

Alternative 3: 77.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq 1:\\ \;\;\;\;\frac{1}{x \cdot y}\\ \mathbf{elif}\;z \leq 1.75 \cdot 10^{+192}:\\ \;\;\;\;\frac{1}{x \cdot \left(z \cdot \left(z \cdot y\right)\right)}\\ \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 1.0)
   (/ 1.0 (* x y))
   (if (<= z 1.75e+192)
     (/ 1.0 (* x (* z (* z y))))
     (/ 1.0 (* z (* 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 if (z <= 1.75e+192) {
		tmp = 1.0 / (x * (z * (z * 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 <= 1.0d0) then
        tmp = 1.0d0 / (x * y)
    else if (z <= 1.75d+192) then
        tmp = 1.0d0 / (x * (z * (z * 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 <= 1.0) {
		tmp = 1.0 / (x * y);
	} else if (z <= 1.75e+192) {
		tmp = 1.0 / (x * (z * (z * 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 <= 1.0:
		tmp = 1.0 / (x * y)
	elif z <= 1.75e+192:
		tmp = 1.0 / (x * (z * (z * 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 (z <= 1.0)
		tmp = Float64(1.0 / Float64(x * y));
	elseif (z <= 1.75e+192)
		tmp = Float64(1.0 / Float64(x * Float64(z * Float64(z * 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 <= 1.0)
		tmp = 1.0 / (x * y);
	elseif (z <= 1.75e+192)
		tmp = 1.0 / (x * (z * (z * 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[z, 1.0], N[(1.0 / N[(x * y), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.75e+192], N[(1.0 / N[(x * N[(z * N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(z * N[(y * N[(x * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < 1

   1. Initial program 94.4%

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

      1. associate-/r* 94.5%

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

      2. +-commutative 94.5%

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

      3. fma-def 94.5%

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

   3. Simplified 94.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 0 71.1%

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

   if 1 < z < 1.74999999999999991e192

   1. Initial program 86.0%

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

      1. associate-/r* 85.7%

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

      2. +-commutative 85.7%

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

      3. fma-def 85.7%

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

   3. Simplified 85.7%

      \[\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 85.7%

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

      1. unpow2 85.7%

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

      2. *-commutative 85.7%

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

      3. associate-*r* 92.6%

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

   6. Simplified 92.6%

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

   if 1.74999999999999991e192 < z

   1. Initial program 70.6%

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

      1. associate-/r* 70.6%

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

      2. +-commutative 70.6%

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

      3. fma-def 70.6%

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

   3. Simplified 70.6%

      \[\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 70.6%

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

      1. unpow2 70.6%

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

      2. *-commutative 70.6%

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

      3. associate-*l* 70.1%

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

      4. *-commutative 70.1%

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

      5. associate-*l* 85.1%

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

   6. Simplified 85.1%

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

   7. Taylor expanded in z around 0 99.9%

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

4. Final simplification 77.5%

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

Alternative 4: 96.4% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;z \cdot z \leq 10^{-7}:\\ \;\;\;\;\frac{1}{x \cdot y}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\left(z \cdot y\right) \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) 1e-7) (/ 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) <= 1e-7) {
		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) <= 1d-7) 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) <= 1e-7) {
		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) <= 1e-7:
		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) <= 1e-7)
		tmp = Float64(1.0 / Float64(x * y));
	else
		tmp = Float64(1.0 / Float64(Float64(z * 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) <= 1e-7)
		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], 1e-7], N[(1.0 / N[(x * y), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[(z * y), $MachinePrecision] * N[(x * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 z z) < 9.9999999999999995e-8

   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. Taylor expanded in z around 0 98.9%

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

   if 9.9999999999999995e-8 < (*.f64 z z)

   1. Initial program 82.2%

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

      1. associate-/r* 82.1%

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

      2. +-commutative 82.1%

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

      3. fma-def 82.1%

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

   3. Simplified 82.1%

      \[\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 82.4%

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

      1. unpow2 82.4%

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

      2. *-commutative 82.4%

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

      3. associate-*l* 78.5%

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

      4. *-commutative 78.5%

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

      5. associate-*l* 89.5%

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

   6. Simplified 89.5%

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

      1. expm1-log1p-u 54.9%

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

      2. expm1-udef 46.5%

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

      3. *-commutative 46.5%

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

      4. *-commutative 46.5%

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

      5. associate-*l* 46.2%

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

   8. Applied egg-rr 46.2%

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

      1. expm1-def 59.1%

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

      2. expm1-log1p 93.8%

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

      3. associate-*r* 93.9%

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

   10. Simplified 93.9%

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

4. Final simplification 96.3%

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

Alternative 5: 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 10^{-7}:\\ \;\;\;\;\frac{1}{x \cdot y}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{1}{z}}{x \cdot \left(z \cdot y\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) 1e-7) (/ 1.0 (* x y)) (/ (/ 1.0 z) (* x (* z y)))))

C

assert(x < y);
double code(double x, double y, double z) {
	double tmp;
	if ((z * z) <= 1e-7) {
		tmp = 1.0 / (x * y);
	} else {
		tmp = (1.0 / z) / (x * (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) <= 1d-7) then
        tmp = 1.0d0 / (x * y)
    else
        tmp = (1.0d0 / z) / (x * (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) <= 1e-7) {
		tmp = 1.0 / (x * y);
	} else {
		tmp = (1.0 / z) / (x * (z * y));
	}
	return tmp;
}

Python

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

Julia

x, y = sort([x, y])
function code(x, y, z)
	tmp = 0.0
	if (Float64(z * z) <= 1e-7)
		tmp = Float64(1.0 / Float64(x * y));
	else
		tmp = Float64(Float64(1.0 / z) / Float64(x * 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) <= 1e-7)
		tmp = 1.0 / (x * y);
	else
		tmp = (1.0 / z) / (x * (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], 1e-7], N[(1.0 / N[(x * y), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / z), $MachinePrecision] / N[(x * N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 z z) < 9.9999999999999995e-8

   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. Taylor expanded in z around 0 98.9%

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

   if 9.9999999999999995e-8 < (*.f64 z z)

   1. Initial program 82.2%

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

      1. associate-/r* 82.1%

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

      2. +-commutative 82.1%

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

      3. fma-def 82.1%

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

   3. Simplified 82.1%

      \[\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 82.4%

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

      1. unpow2 82.4%

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

      2. *-commutative 82.4%

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

      3. associate-*l* 78.5%

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

      4. *-commutative 78.5%

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

      5. associate-*l* 89.5%

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

   6. Simplified 89.5%

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

      1. add-cube-cbrt 88.9%

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

      2. pow3 88.9%

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

      3. associate-/r* 89.4%

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

      4. *-commutative 89.4%

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

      5. *-commutative 89.4%

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

      6. associate-*l* 93.8%

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

   8. Applied egg-rr 93.8%

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

      1. rem-cube-cbrt 94.3%

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

      2. *-commutative 94.3%

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

   10. Applied egg-rr 94.3%

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

4. Final simplification 96.6%

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

Alternative 6: 74.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq 1:\\ \;\;\;\;\frac{1}{x \cdot 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 1.0) (/ 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 <= 1.0) {
		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 <= 1.0d0) 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 <= 1.0) {
		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 <= 1.0:
		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 (z <= 1.0)
		tmp = Float64(1.0 / Float64(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 <= 1.0)
		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[z, 1.0], N[(1.0 / N[(x * y), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(x * N[(y * N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < 1

   1. Initial program 94.4%

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

      1. associate-/r* 94.5%

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

      2. +-commutative 94.5%

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

      3. fma-def 94.5%

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

   3. Simplified 94.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 0 71.1%

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

   if 1 < z

   1. Initial program 80.0%

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

      1. associate-/r* 79.8%

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

      2. +-commutative 79.8%

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

      3. fma-def 79.8%

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

   3. Simplified 79.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 79.8%

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

      1. unpow2 79.8%

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

   6. Simplified 79.8%

      \[\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 73.4%

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

Alternative 7: 76.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq 1:\\ \;\;\;\;\frac{1}{x \cdot 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 1.0) (/ 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 <= 1.0) {
		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 <= 1.0d0) 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 <= 1.0) {
		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 <= 1.0:
		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 (z <= 1.0)
		tmp = Float64(1.0 / Float64(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 <= 1.0)
		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[z, 1.0], N[(1.0 / N[(x * y), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(x * N[(z * N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < 1

   1. Initial program 94.4%

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

      1. associate-/r* 94.5%

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

      2. +-commutative 94.5%

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

      3. fma-def 94.5%

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

   3. Simplified 94.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 0 71.1%

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

   if 1 < z

   1. Initial program 80.0%

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

      1. associate-/r* 79.8%

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

      2. +-commutative 79.8%

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

      3. fma-def 79.8%

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

   3. Simplified 79.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 79.8%

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

      1. unpow2 79.8%

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

      2. *-commutative 79.8%

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

      3. associate-*r* 86.9%

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

   6. Simplified 86.9%

      \[\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 75.2%

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

Alternative 8: 58.2% 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 90.7%

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

   1. associate-/r* 90.6%

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

   2. +-commutative 90.6%

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

   3. fma-def 90.6%

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

3. Simplified 90.6%

   \[\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 57.0%

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

5. Final simplification 57.0%

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

Developer target: 92.6% 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 2023257 
(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)))))