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

Percentage Accurate: 90.8% → 99.2%

Time: 8.8s

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.8% 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: 99.2% accurate, 0.0× speedup

Math

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

C

assert(x < y);
double code(double x, double y, double z) {
	double t_0 = hypot(1.0, z) * sqrt(y);
	double tmp;
	if ((y * (1.0 + (z * z))) <= 5e+303) {
		tmp = (1.0 / x) / fma((y * z), z, y);
	} else {
		tmp = 1.0 / (t_0 / ((1.0 / x) / t_0));
	}
	return tmp;
}

Julia

x, y = sort([x, y])
function code(x, y, z)
	t_0 = Float64(hypot(1.0, z) * sqrt(y))
	tmp = 0.0
	if (Float64(y * Float64(1.0 + Float64(z * z))) <= 5e+303)
		tmp = Float64(Float64(1.0 / x) / fma(Float64(y * z), z, y));
	else
		tmp = Float64(1.0 / Float64(t_0 / Float64(Float64(1.0 / x) / t_0)));
	end
	return tmp
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_, z_] := Block[{t$95$0 = N[(N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision] * N[Sqrt[y], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(y * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 5e+303], N[(N[(1.0 / x), $MachinePrecision] / N[(N[(y * z), $MachinePrecision] * z + y), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(t$95$0 / N[(N[(1.0 / x), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 y (+.f64 1 (*.f64 z z))) < 4.9999999999999997e303

   1. Initial program 96.1%

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

      1. distribute-lft-in 96.1%

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

      2. *-rgt-identity 96.1%

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

      3. +-commutative 96.1%

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

      4. associate-*r* 97.9%

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

      5. fma-def 97.9%

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

   3. Applied egg-rr 97.9%

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

   if 4.9999999999999997e303 < (*.f64 y (+.f64 1 (*.f64 z z)))

   1. Initial program 79.3%

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

      1. associate-/r* 79.3%

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

      2. *-commutative 79.3%

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

      3. sqr-neg 79.3%

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

      4. +-commutative 79.3%

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

      5. distribute-lft1-in 79.3%

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

      6. *-commutative 79.3%

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

      7. fma-def 79.3%

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

      8. sqr-neg 79.3%

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

   3. Simplified 79.3%

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

      1. *-commutative 79.3%

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

      2. fma-udef 79.3%

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

      3. *-rgt-identity 79.3%

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

      4. distribute-lft-in 79.3%

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

      5. +-commutative 79.3%

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

      6. /-rgt-identity 79.3%

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

      7. clear-num 79.3%

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

      8. div-inv 79.3%

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

      9. add-sqr-sqrt 79.3%

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

      10. associate-/l* 79.3%

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

      11. +-commutative 79.3%

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

      12. fma-udef 79.3%

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

      13. *-commutative 79.3%

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

      14. sqrt-prod 79.3%

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

      15. fma-udef 79.3%

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

      16. +-commutative 79.3%

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

      17. hypot-1-def 79.3%

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

      18. +-commutative 79.3%

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

      19. fma-udef 79.3%

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

      20. *-commutative 79.3%

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

      21. sqrt-prod 79.3%

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

   5. Applied egg-rr 99.8%

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

4. Final simplification 98.2%

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

Alternative 2: 96.7% accurate, 0.7× speedup

Math

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

C

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

Python

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 z z) < 2.00000000000000016e-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.6%

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

      2. *-commutative 99.6%

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

      3. sqr-neg 99.6%

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

      4. +-commutative 99.6%

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

      5. distribute-lft1-in 99.6%

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

      6. *-commutative 99.6%

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

      7. fma-def 99.6%

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

      8. sqr-neg 99.6%

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

   3. Simplified 99.6%

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

   4. Taylor expanded in z around 0 90.2%

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

      1. associate-/l/ 90.3%

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

      2. +-commutative 90.3%

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

      3. mul-1-neg 90.3%

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

      4. unsub-neg 90.3%

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

      5. associate-/r* 90.2%

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

      6. unpow2 90.2%

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

      7. *-commutative 90.2%

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

      8. div-sub 99.3%

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

   6. Simplified 99.3%

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

   if 2.00000000000000016e-5 < (*.f64 z z)

   1. Initial program 86.1%

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

   2. Taylor expanded in z around inf 85.3%

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

      1. unpow2 85.3%

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

   4. Simplified 85.3%

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

      1. *-un-lft-identity 85.3%

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

      2. associate-*r* 93.8%

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

      3. times-frac 97.7%

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

   6. Applied egg-rr 97.7%

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

4. Final simplification 98.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \cdot z \leq 2 \cdot 10^{-5}:\\ \;\;\;\;\frac{1 - z \cdot z}{y \cdot x}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{y \cdot z} \cdot \frac{\frac{1}{x}}{z}\\ \end{array} \]

Alternative 3: 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 4000000000000:\\ \;\;\;\;\frac{1}{x \cdot \left(y + y \cdot \left(z \cdot z\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{y \cdot z} \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) 4000000000000.0)
   (/ 1.0 (* x (+ y (* y (* z z)))))
   (* (/ 1.0 (* y z)) (/ (/ 1.0 x) z))))

C

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

Python

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 z z) < 4e12

   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.6%

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

      2. *-commutative 99.6%

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

      3. sqr-neg 99.6%

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

      4. +-commutative 99.6%

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

      5. distribute-lft1-in 99.6%

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

      6. *-commutative 99.6%

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

      7. fma-def 99.6%

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

      8. sqr-neg 99.6%

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

   3. Simplified 99.6%

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

      1. fma-udef 99.6%

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

   5. Applied egg-rr 99.6%

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

   if 4e12 < (*.f64 z z)

   1. Initial program 85.8%

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

   2. Taylor expanded in z around inf 85.8%

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

      1. unpow2 85.8%

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

   4. Simplified 85.8%

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

      1. *-un-lft-identity 85.8%

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

      2. associate-*r* 94.4%

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

      3. times-frac 98.4%

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

   6. Applied egg-rr 98.4%

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

4. Final simplification 99.1%

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

Alternative 4: 97.6% accurate, 0.7× speedup

Math

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

C

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

Python

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 z z) < 1.00000000000000007e70

   1. Initial program 99.6%

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

   if 1.00000000000000007e70 < (*.f64 z z)

   1. Initial program 84.3%

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

   2. Taylor expanded in z around inf 84.3%

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

      1. unpow2 84.3%

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

   4. Simplified 84.3%

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

      1. *-un-lft-identity 84.3%

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

      2. associate-*r* 93.9%

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

      3. times-frac 98.3%

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

   6. Applied egg-rr 98.3%

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

4. Final simplification 99.1%

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

Alternative 5: 89.7% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;z \cdot z \leq 2 \cdot 10^{-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) 2e-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) <= 2e-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) <= 2d-5) 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) <= 2e-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) <= 2e-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) <= 2e-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) <= 2e-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], 2e-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) < 2.00000000000000016e-5

   1. Initial program 99.7%

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

      1. distribute-lft-in 99.7%

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

      2. *-rgt-identity 99.7%

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

      3. +-commutative 99.7%

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

      4. associate-*r* 99.7%

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

      5. fma-def 99.7%

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

   3. Applied egg-rr 99.7%

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

   4. Taylor expanded in z around 0 98.5%

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

   if 2.00000000000000016e-5 < (*.f64 z z)

   1. Initial program 86.1%

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

      1. associate-/r* 85.5%

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

      2. *-commutative 85.5%

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

      3. sqr-neg 85.5%

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

      4. +-commutative 85.5%

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

      5. distribute-lft1-in 85.5%

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

      6. *-commutative 85.5%

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

      7. fma-def 85.5%

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

      8. sqr-neg 85.5%

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

   3. Simplified 85.5%

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

   4. Taylor expanded in z around inf 84.8%

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

      1. unpow2 84.8%

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

   6. Simplified 84.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 91.8%

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

Alternative 6: 93.5% accurate, 0.8× speedup

Math

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

C

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

Python

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

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 z z) < 2.00000000000000016e-5

   1. Initial program 99.7%

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

      1. distribute-lft-in 99.7%

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

      2. *-rgt-identity 99.7%

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

      3. +-commutative 99.7%

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

      4. associate-*r* 99.7%

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

      5. fma-def 99.7%

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

   3. Applied egg-rr 99.7%

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

   4. Taylor expanded in z around 0 98.5%

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

   if 2.00000000000000016e-5 < (*.f64 z z)

   1. Initial program 86.1%

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

      1. distribute-lft-in 86.1%

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

      2. *-rgt-identity 86.1%

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

      3. +-commutative 86.1%

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

      4. associate-*r* 94.5%

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

      5. fma-def 94.5%

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

   3. Applied egg-rr 94.5%

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

   4. Taylor expanded in z around inf 84.8%

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

      1. *-commutative 84.8%

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

      2. unpow2 84.8%

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

      3. associate-*r* 93.2%

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

      4. associate-*r* 96.4%

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

      5. associate-*l* 88.1%

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

      6. *-commutative 88.1%

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

   6. Simplified 88.1%

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

4. Final simplification 93.5%

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

Alternative 7: 96.3% accurate, 0.8× speedup

Math

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

C

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

Python

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

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 z z) < 2.00000000000000016e-5

   1. Initial program 99.7%

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

      1. distribute-lft-in 99.7%

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

      2. *-rgt-identity 99.7%

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

      3. +-commutative 99.7%

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

      4. associate-*r* 99.7%

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

      5. fma-def 99.7%

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

   3. Applied egg-rr 99.7%

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

   4. Taylor expanded in z around 0 98.5%

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

   if 2.00000000000000016e-5 < (*.f64 z z)

   1. Initial program 86.1%

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

      1. associate-/r* 85.5%

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

      2. *-commutative 85.5%

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

      3. sqr-neg 85.5%

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

      4. +-commutative 85.5%

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

      5. distribute-lft1-in 85.5%

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

      6. *-commutative 85.5%

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

      7. fma-def 85.5%

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

      8. sqr-neg 85.5%

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

   3. Simplified 85.5%

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

      1. fma-udef 85.5%

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

   5. Applied egg-rr 85.5%

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

   6. Taylor expanded in z around inf 84.8%

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

      1. *-commutative 84.8%

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

      2. unpow2 84.8%

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

      3. associate-*r* 93.2%

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

      4. associate-*r* 96.4%

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

      5. *-commutative 96.4%

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

   8. Simplified 96.4%

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

4. Final simplification 97.5%

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

Alternative 8: 96.2% accurate, 0.8× speedup

Math

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

C

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

Python

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

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 z z) < 2.00000000000000016e-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.6%

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

      2. *-commutative 99.6%

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

      3. sqr-neg 99.6%

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

      4. +-commutative 99.6%

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

      5. distribute-lft1-in 99.6%

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

      6. *-commutative 99.6%

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

      7. fma-def 99.6%

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

      8. sqr-neg 99.6%

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

   3. Simplified 99.6%

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

   4. Taylor expanded in z around 0 90.2%

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

      1. associate-/l/ 90.3%

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

      2. +-commutative 90.3%

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

      3. mul-1-neg 90.3%

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

      4. unsub-neg 90.3%

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

      5. associate-/r* 90.2%

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

      6. unpow2 90.2%

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

      7. *-commutative 90.2%

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

      8. div-sub 99.3%

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

   6. Simplified 99.3%

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

   if 2.00000000000000016e-5 < (*.f64 z z)

   1. Initial program 86.1%

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

      1. associate-/r* 85.5%

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

      2. *-commutative 85.5%

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

      3. sqr-neg 85.5%

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

      4. +-commutative 85.5%

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

      5. distribute-lft1-in 85.5%

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

      6. *-commutative 85.5%

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

      7. fma-def 85.5%

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

      8. sqr-neg 85.5%

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

   3. Simplified 85.5%

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

      1. fma-udef 85.5%

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

   5. Applied egg-rr 85.5%

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

   6. Taylor expanded in z around inf 84.8%

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

      1. *-commutative 84.8%

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

      2. unpow2 84.8%

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

      3. associate-*r* 93.2%

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

      4. associate-*r* 96.4%

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

      5. *-commutative 96.4%

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

   8. Simplified 96.4%

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

4. Final simplification 97.9%

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

Alternative 9: 62.9% 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}{x \cdot \left(y \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 (* x (* y 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));
	}
	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))
    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));
	}
	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))
	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(x * Float64(y * 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));
	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[(x * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < 1

   1. Initial program 97.8%

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

      1. distribute-lft-in 97.8%

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

      2. *-rgt-identity 97.8%

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

      3. +-commutative 97.8%

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

      4. associate-*r* 99.2%

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

      5. fma-def 99.2%

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

   3. Applied egg-rr 99.2%

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

   4. Taylor expanded in z around 0 72.8%

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

   if 1 < z

   1. Initial program 76.2%

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

      1. associate-/r* 76.2%

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

      2. *-commutative 76.2%

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

      3. sqr-neg 76.2%

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

      4. +-commutative 76.2%

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

      5. distribute-lft1-in 76.2%

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

      6. *-commutative 76.2%

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

      7. fma-def 76.2%

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

      8. sqr-neg 76.2%

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

   3. Simplified 76.2%

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

      1. associate-/r* 76.2%

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

      2. fma-udef 76.3%

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

      3. *-rgt-identity 76.3%

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

      4. distribute-lft-in 76.2%

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

      5. +-commutative 76.2%

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

      6. associate-/r* 72.3%

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

      7. associate-/r* 72.4%

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

      8. *-un-lft-identity 72.4%

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

      9. +-commutative 72.4%

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

      10. fma-udef 72.4%

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

      11. add-sqr-sqrt 72.4%

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

      12. times-frac 72.3%

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

      13. fma-udef 72.3%

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

      14. +-commutative 72.3%

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

      15. hypot-1-def 72.3%

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

      16. *-commutative 72.3%

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

      17. associate-/r* 72.3%

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

      18. fma-udef 72.3%

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

      19. +-commutative 72.3%

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

      20. hypot-1-def 82.5%

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

   5. Applied egg-rr 82.5%

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

   6. Taylor expanded in z around inf 82.5%

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

   7. Taylor expanded in z around 0 47.7%

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

4. Final simplification 67.3%

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

Alternative 10: 57.4% accurate, 2.2× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \frac{1}{y \cdot x} \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 (* y x)))

C

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

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 / (y * x)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 93.1%

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

   1. associate-/r* 92.8%

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

   2. *-commutative 92.8%

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

   3. sqr-neg 92.8%

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

   4. +-commutative 92.8%

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

   5. distribute-lft1-in 92.8%

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

   6. *-commutative 92.8%

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

   7. fma-def 92.8%

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

   8. sqr-neg 92.8%

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

3. Simplified 92.8%

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

4. Taylor expanded in z around 0 62.0%

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

   1. *-commutative 62.0%

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

6. Simplified 62.0%

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

7. Final simplification 62.0%

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

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