Statistics.Distribution.Beta:$cvariance from math-functions-0.1.5.2

Percentage Accurate: 83.0% → 97.7%

Time: 12.8s

Alternatives: 11

Speedup: 1.0×

• 25.6% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 83.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 97.7% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

x_m = N[Abs[x], $MachinePrecision]
x_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(x$95$m * y$95$m), $MachinePrecision], 1e-309], N[(N[(x$95$m / z), $MachinePrecision] / N[(z / y$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[(y$95$m * N[(x$95$m / N[(z + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision] / z), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x y) < 1.000000000000002e-309

   1. Initial program 83.1%

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

      1. *-commutative 83.1%

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

      2. frac-times 89.1%

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

      3. associate-*l/ 89.2%

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

      4. times-frac 97.8%

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

   4. Applied egg-rr 97.8%

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

   5. Taylor expanded in z around 0 72.9%

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

      1. *-commutative 72.9%

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

      2. clear-num 72.9%

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

      3. un-div-inv 73.1%

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

   7. Applied egg-rr 73.1%

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

   if 1.000000000000002e-309 < (*.f64 x y)

   1. Initial program 85.8%

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

      1. *-commutative 85.8%

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

      2. associate-*l/ 86.9%

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

      3. *-commutative 86.9%

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

      4. sqr-neg 86.9%

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

      5. *-commutative 86.9%

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

      6. distribute-rgt1-in 67.7%

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

      7. sqr-neg 67.7%

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

      8. fma-def 86.9%

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

      9. sqr-neg 86.9%

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

      10. cube-unmult 86.9%

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

   3. Simplified 86.9%

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

      1. fma-def 67.7%

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

      2. associate-*r/ 67.6%

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

      3. *-commutative 67.6%

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

      4. cube-mult 67.6%

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

      5. distribute-rgt1-in 85.8%

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

      6. *-commutative 85.8%

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

      7. frac-times 89.3%

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

      8. associate-*l/ 91.9%

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

      9. associate-/r* 98.2%

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

   6. Applied egg-rr 98.2%

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

4. Final simplification 84.4%

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

Alternative 2: 98.4% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

x_m = N[Abs[x], $MachinePrecision]
x_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(N[(x$95$m * y$95$m), $MachinePrecision] / N[(N[(z + 1.0), $MachinePrecision] * N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2e-104], N[(N[(x$95$m / N[(z + 1.0), $MachinePrecision]), $MachinePrecision] / N[(z * N[(z / y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(y$95$m / N[(z * N[(N[(z + 1.0), $MachinePrecision] / x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 x y) (*.f64 (*.f64 z z) (+.f64 z 1))) < 1.99999999999999985e-104

   1. Initial program 91.5%

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

      1. *-commutative 91.5%

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

      2. frac-times 94.5%

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

      3. associate-*l/ 95.7%

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

      4. times-frac 98.1%

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

   4. Applied egg-rr 98.1%

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

      1. clear-num 98.1%

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

      2. frac-times 95.1%

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

      3. *-un-lft-identity 95.1%

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

   6. Applied egg-rr 95.1%

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

   if 1.99999999999999985e-104 < (/.f64 (*.f64 x y) (*.f64 (*.f64 z z) (+.f64 z 1)))

   1. Initial program 68.9%

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

      1. *-commutative 68.9%

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

      2. associate-*l/ 73.0%

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

      3. *-commutative 73.0%

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

      4. sqr-neg 73.0%

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

      5. *-commutative 73.0%

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

      6. distribute-rgt1-in 70.4%

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

      7. sqr-neg 70.4%

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

      8. fma-def 73.0%

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

      9. sqr-neg 73.0%

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

      10. cube-unmult 73.0%

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

   3. Simplified 73.0%

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

      1. fma-def 70.4%

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

      2. associate-*r/ 68.9%

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

      3. *-commutative 68.9%

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

      4. cube-mult 68.9%

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

      5. distribute-rgt1-in 68.9%

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

      6. *-commutative 68.9%

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

      7. frac-times 77.7%

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

      8. associate-/r* 89.5%

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

      9. associate-*l/ 95.3%

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

   6. Applied egg-rr 95.3%

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

      1. *-commutative 95.3%

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

      2. clear-num 95.1%

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

      3. frac-times 96.3%

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

      4. *-un-lft-identity 96.3%

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

   8. Applied egg-rr 96.3%

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

4. Final simplification 95.4%

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

Alternative 3: 94.9% accurate, 0.6× speedup

Math

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

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (*
  y_s
  (*
   x_s
   (if (or (<= z -1.0) (not (<= z 2.4e-7)))
     (* (/ y_m z) (/ (/ x_m z) z))
     (/ (* y_m (/ x_m z)) z)))))

C

x_m = fabs(x);
x_s = copysign(1.0, x);
y_m = fabs(y);
y_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if ((z <= -1.0) || !(z <= 2.4e-7)) {
		tmp = (y_m / z) * ((x_m / z) / z);
	} else {
		tmp = (y_m * (x_m / z)) / z;
	}
	return y_s * (x_s * tmp);
}

Fortran

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

Java

x_m = Math.abs(x);
x_s = Math.copySign(1.0, x);
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if ((z <= -1.0) || !(z <= 2.4e-7)) {
		tmp = (y_m / z) * ((x_m / z) / z);
	} else {
		tmp = (y_m * (x_m / z)) / z;
	}
	return y_s * (x_s * tmp);
}

Python

x_m = math.fabs(x)
x_s = math.copysign(1.0, x)
y_m = math.fabs(y)
y_s = math.copysign(1.0, y)
[x_m, y_m, z] = sort([x_m, y_m, z])
def code(y_s, x_s, x_m, y_m, z):
	tmp = 0
	if (z <= -1.0) or not (z <= 2.4e-7):
		tmp = (y_m / z) * ((x_m / z) / z)
	else:
		tmp = (y_m * (x_m / z)) / z
	return y_s * (x_s * tmp)

Julia

x_m = abs(x)
x_s = copysign(1.0, x)
y_m = abs(y)
y_s = copysign(1.0, y)
x_m, y_m, z = sort([x_m, y_m, z])
function code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0
	if ((z <= -1.0) || !(z <= 2.4e-7))
		tmp = Float64(Float64(y_m / z) * Float64(Float64(x_m / z) / z));
	else
		tmp = Float64(Float64(y_m * Float64(x_m / z)) / z);
	end
	return Float64(y_s * Float64(x_s * tmp))
end

MATLAB

x_m = abs(x);
x_s = sign(x) * abs(1.0);
y_m = abs(y);
y_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0;
	if ((z <= -1.0) || ~((z <= 2.4e-7)))
		tmp = (y_m / z) * ((x_m / z) / z);
	else
		tmp = (y_m * (x_m / z)) / z;
	end
	tmp_2 = y_s * (x_s * tmp);
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
x_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[Or[LessEqual[z, -1.0], N[Not[LessEqual[z, 2.4e-7]], $MachinePrecision]], N[(N[(y$95$m / z), $MachinePrecision] * N[(N[(x$95$m / z), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision], N[(N[(y$95$m * N[(x$95$m / z), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < -1 or 2.39999999999999979e-7 < z

   1. Initial program 85.7%

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

      1. *-commutative 85.7%

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

      2. frac-times 95.9%

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

      3. associate-*l/ 96.5%

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

      4. times-frac 99.7%

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

   4. Applied egg-rr 99.7%

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

   5. Taylor expanded in z around inf 96.9%

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

   if -1 < z < 2.39999999999999979e-7

   1. Initial program 82.5%

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

      1. *-commutative 82.5%

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

      2. associate-*l/ 80.7%

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

      3. *-commutative 80.7%

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

      4. sqr-neg 80.7%

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

      5. *-commutative 80.7%

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

      6. distribute-rgt1-in 80.7%

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

      7. sqr-neg 80.7%

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

      8. fma-def 80.7%

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

      9. sqr-neg 80.7%

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

      10. cube-unmult 80.7%

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

   3. Simplified 80.7%

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

      1. fma-def 80.7%

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

      2. associate-*r/ 82.5%

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

      3. *-commutative 82.5%

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

      4. cube-mult 82.5%

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

      5. distribute-rgt1-in 82.5%

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

      6. *-commutative 82.5%

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

      7. frac-times 80.7%

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

      8. associate-/r* 87.4%

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

      9. associate-*l/ 94.9%

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

   6. Applied egg-rr 94.9%

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

   7. Taylor expanded in z around 0 89.5%

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

      1. associate-*l/ 96.0%

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

   9. Simplified 96.0%

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

4. Final simplification 96.5%

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

Alternative 4: 96.7% accurate, 0.6× speedup

Math

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

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (*
  y_s
  (*
   x_s
   (if (or (<= z -1.0) (not (<= z 2.4e-7)))
     (/ (/ x_m z) (/ z (/ y_m z)))
     (/ (- y_m) (* z (/ (- z) x_m)))))))

C

x_m = fabs(x);
x_s = copysign(1.0, x);
y_m = fabs(y);
y_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if ((z <= -1.0) || !(z <= 2.4e-7)) {
		tmp = (x_m / z) / (z / (y_m / z));
	} else {
		tmp = -y_m / (z * (-z / x_m));
	}
	return y_s * (x_s * tmp);
}

Fortran

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

Java

x_m = Math.abs(x);
x_s = Math.copySign(1.0, x);
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if ((z <= -1.0) || !(z <= 2.4e-7)) {
		tmp = (x_m / z) / (z / (y_m / z));
	} else {
		tmp = -y_m / (z * (-z / x_m));
	}
	return y_s * (x_s * tmp);
}

Python

x_m = math.fabs(x)
x_s = math.copysign(1.0, x)
y_m = math.fabs(y)
y_s = math.copysign(1.0, y)
[x_m, y_m, z] = sort([x_m, y_m, z])
def code(y_s, x_s, x_m, y_m, z):
	tmp = 0
	if (z <= -1.0) or not (z <= 2.4e-7):
		tmp = (x_m / z) / (z / (y_m / z))
	else:
		tmp = -y_m / (z * (-z / x_m))
	return y_s * (x_s * tmp)

Julia

x_m = abs(x)
x_s = copysign(1.0, x)
y_m = abs(y)
y_s = copysign(1.0, y)
x_m, y_m, z = sort([x_m, y_m, z])
function code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0
	if ((z <= -1.0) || !(z <= 2.4e-7))
		tmp = Float64(Float64(x_m / z) / Float64(z / Float64(y_m / z)));
	else
		tmp = Float64(Float64(-y_m) / Float64(z * Float64(Float64(-z) / x_m)));
	end
	return Float64(y_s * Float64(x_s * tmp))
end

MATLAB

x_m = abs(x);
x_s = sign(x) * abs(1.0);
y_m = abs(y);
y_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0;
	if ((z <= -1.0) || ~((z <= 2.4e-7)))
		tmp = (x_m / z) / (z / (y_m / z));
	else
		tmp = -y_m / (z * (-z / x_m));
	end
	tmp_2 = y_s * (x_s * tmp);
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
x_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[Or[LessEqual[z, -1.0], N[Not[LessEqual[z, 2.4e-7]], $MachinePrecision]], N[(N[(x$95$m / z), $MachinePrecision] / N[(z / N[(y$95$m / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[((-y$95$m) / N[(z * N[((-z) / x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < -1 or 2.39999999999999979e-7 < z

   1. Initial program 85.7%

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

      1. *-commutative 85.7%

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

      2. frac-times 95.9%

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

      3. associate-*l/ 96.5%

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

      4. times-frac 99.7%

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

   4. Applied egg-rr 99.7%

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

   5. Taylor expanded in z around inf 96.9%

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

      1. associate-*r/ 95.7%

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

      2. *-commutative 95.7%

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

      3. associate-/l* 95.1%

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

   7. Applied egg-rr 95.1%

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

   if -1 < z < 2.39999999999999979e-7

   1. Initial program 82.5%

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

      1. *-commutative 82.5%

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

      2. frac-times 80.7%

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

      3. associate-*l/ 82.5%

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

      4. times-frac 94.9%

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

   4. Applied egg-rr 94.9%

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

   5. Taylor expanded in z around 0 94.4%

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

      1. clear-num 94.3%

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

      2. div-inv 94.6%

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

      3. frac-2neg 94.6%

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

      4. associate-/l/ 91.7%

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

   7. Applied egg-rr 91.7%

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

4. Final simplification 93.6%

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

Alternative 5: 94.7% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if z < -1

   1. Initial program 89.1%

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

      1. sqr-neg 89.1%

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

      2. *-commutative 89.1%

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

      3. times-frac 95.9%

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

      4. sqr-neg 95.9%

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

   3. Simplified 95.9%

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

   5. Taylor expanded in z around inf 94.3%

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

   if -1 < z < 2.39999999999999979e-7

   1. Initial program 82.5%

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

      1. *-commutative 82.5%

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

      2. associate-*l/ 80.7%

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

      3. *-commutative 80.7%

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

      4. sqr-neg 80.7%

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

      5. *-commutative 80.7%

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

      6. distribute-rgt1-in 80.7%

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

      7. sqr-neg 80.7%

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

      8. fma-def 80.7%

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

      9. sqr-neg 80.7%

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

      10. cube-unmult 80.7%

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

   3. Simplified 80.7%

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

      1. fma-def 80.7%

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

      2. associate-*r/ 82.5%

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

      3. *-commutative 82.5%

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

      4. cube-mult 82.5%

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

      5. distribute-rgt1-in 82.5%

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

      6. *-commutative 82.5%

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

      7. frac-times 80.7%

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

      8. associate-/r* 87.4%

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

      9. associate-*l/ 94.9%

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

   6. Applied egg-rr 94.9%

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

   7. Taylor expanded in z around 0 89.5%

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

      1. associate-*l/ 96.0%

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

   9. Simplified 96.0%

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

   if 2.39999999999999979e-7 < z

   1. Initial program 82.2%

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

      1. *-commutative 82.2%

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

      2. frac-times 95.9%

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

      3. associate-*l/ 94.5%

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

      4. times-frac 99.7%

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

   4. Applied egg-rr 99.7%

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

   5. Taylor expanded in z around inf 95.7%

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

4. Final simplification 95.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1:\\ \;\;\;\;\frac{x}{z} \cdot \frac{y}{z \cdot z}\\ \mathbf{elif}\;z \leq 2.4 \cdot 10^{-7}:\\ \;\;\;\;\frac{y \cdot \frac{x}{z}}{z}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{z} \cdot \frac{\frac{x}{z}}{z}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 94.8% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if z < -1

   1. Initial program 89.1%

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

      1. sqr-neg 89.1%

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

      2. *-commutative 89.1%

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

      3. times-frac 95.9%

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

      4. sqr-neg 95.9%

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

   3. Simplified 95.9%

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

   5. Taylor expanded in z around inf 94.3%

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

   if -1 < z < 2.39999999999999979e-7

   1. Initial program 82.5%

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

      1. *-commutative 82.5%

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

      2. frac-times 80.7%

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

      3. associate-*l/ 82.5%

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

      4. times-frac 94.9%

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

   4. Applied egg-rr 94.9%

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

   5. Taylor expanded in z around 0 94.4%

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

      1. clear-num 94.3%

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

      2. div-inv 94.6%

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

      3. frac-2neg 94.6%

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

      4. associate-/l/ 91.7%

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

   7. Applied egg-rr 91.7%

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

   if 2.39999999999999979e-7 < z

   1. Initial program 82.2%

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

      1. *-commutative 82.2%

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

      2. frac-times 95.9%

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

      3. associate-*l/ 94.5%

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

      4. times-frac 99.7%

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

   4. Applied egg-rr 99.7%

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

   5. Taylor expanded in z around inf 95.7%

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

4. Final simplification 93.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1:\\ \;\;\;\;\frac{x}{z} \cdot \frac{y}{z \cdot z}\\ \mathbf{elif}\;z \leq 2.4 \cdot 10^{-7}:\\ \;\;\;\;\frac{-y}{z \cdot \frac{-z}{x}}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{z} \cdot \frac{\frac{x}{z}}{z}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 77.9% accurate, 0.9× speedup

Math

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

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (*
  y_s
  (*
   x_s
   (if (<= x_m 2.75e-30) (* (/ x_m z) (/ y_m z)) (* x_m (/ y_m (* z z)))))))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

x_m = N[Abs[x], $MachinePrecision]
x_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[x$95$m, 2.75e-30], N[(N[(x$95$m / z), $MachinePrecision] * N[(y$95$m / z), $MachinePrecision]), $MachinePrecision], N[(x$95$m * N[(y$95$m / N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x < 2.74999999999999988e-30

   1. Initial program 83.8%

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

      1. *-commutative 83.8%

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

      2. frac-times 86.9%

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

      3. associate-*l/ 88.1%

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

      4. times-frac 96.7%

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

   4. Applied egg-rr 96.7%

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

   5. Taylor expanded in z around 0 76.1%

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

   if 2.74999999999999988e-30 < x

   1. Initial program 85.5%

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

      1. sqr-neg 85.5%

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

      2. *-commutative 85.5%

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

      3. times-frac 94.8%

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

      4. sqr-neg 94.8%

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

   3. Simplified 94.8%

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

   5. Taylor expanded in z around 0 80.2%

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

4. Final simplification 77.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 2.75 \cdot 10^{-30}:\\ \;\;\;\;\frac{x}{z} \cdot \frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;x \cdot \frac{y}{z \cdot z}\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 78.9% accurate, 0.9× speedup

Math

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

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (*
  y_s
  (*
   x_s
   (if (<= x_m 2.25e-30) (/ (* y_m (/ x_m z)) z) (* x_m (/ y_m (* z z)))))))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

x_m = N[Abs[x], $MachinePrecision]
x_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[x$95$m, 2.25e-30], N[(N[(y$95$m * N[(x$95$m / z), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], N[(x$95$m * N[(y$95$m / N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x < 2.24999999999999984e-30

   1. Initial program 83.8%

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

      1. *-commutative 83.8%

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

      2. associate-*l/ 83.9%

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

      3. *-commutative 83.9%

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

      4. sqr-neg 83.9%

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

      5. *-commutative 83.9%

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

      6. distribute-rgt1-in 70.1%

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

      7. sqr-neg 70.1%

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

      8. fma-def 83.9%

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

      9. sqr-neg 83.9%

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

      10. cube-unmult 83.9%

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

   3. Simplified 83.9%

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

      1. fma-def 70.2%

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

      2. associate-*r/ 70.7%

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

      3. *-commutative 70.7%

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

      4. cube-mult 70.7%

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

      5. distribute-rgt1-in 83.8%

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

      6. *-commutative 83.8%

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

      7. frac-times 86.9%

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

      8. associate-/r* 91.7%

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

      9. associate-*l/ 96.3%

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

   6. Applied egg-rr 96.3%

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

   7. Taylor expanded in z around 0 70.5%

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

      1. associate-*l/ 76.6%

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

   9. Simplified 76.6%

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

   if 2.24999999999999984e-30 < x

   1. Initial program 85.5%

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

      1. sqr-neg 85.5%

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

      2. *-commutative 85.5%

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

      3. times-frac 94.8%

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

      4. sqr-neg 94.8%

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

   3. Simplified 94.8%

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

   5. Taylor expanded in z around 0 80.2%

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

4. Final simplification 77.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 2.25 \cdot 10^{-30}:\\ \;\;\;\;\frac{y \cdot \frac{x}{z}}{z}\\ \mathbf{else}:\\ \;\;\;\;x \cdot \frac{y}{z \cdot z}\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 95.5% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

x_m = N[Abs[x], $MachinePrecision]
x_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * N[(N[(y$95$m / z), $MachinePrecision] * N[(N[(x$95$m / N[(z + 1.0), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 84.3%

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

   1. *-commutative 84.3%

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

   2. frac-times 89.2%

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

   3. associate-*l/ 90.4%

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

   4. times-frac 97.6%

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

4. Applied egg-rr 97.6%

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

5. Final simplification 97.6%

   \[\leadsto \frac{y}{z} \cdot \frac{\frac{x}{z + 1}}{z} \]
6. Add Preprocessing

Alternative 10: 74.9% accurate, 1.6× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

x_m = N[Abs[x], $MachinePrecision]
x_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * N[(N[(x$95$m / z), $MachinePrecision] * N[(y$95$m / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 84.3%

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

   1. *-commutative 84.3%

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

   2. frac-times 89.2%

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

   3. associate-*l/ 90.4%

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

   4. times-frac 97.6%

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

4. Applied egg-rr 97.6%

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

5. Taylor expanded in z around 0 73.2%

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

6. Final simplification 73.2%

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

Alternative 11: 31.9% accurate, 1.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 84.3%

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

   1. *-commutative 84.3%

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

   2. frac-times 89.2%

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

   3. associate-*l/ 90.4%

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

   4. times-frac 97.6%

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

4. Applied egg-rr 97.6%

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

5. Taylor expanded in z around 0 65.5%

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

   1. +-commutative 65.5%

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

   2. mul-1-neg 65.5%

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

   3. unsub-neg 65.5%

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

7. Simplified 65.5%

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

8. Taylor expanded in z around inf 28.4%

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

   1. mul-1-neg 28.4%

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

   2. associate-*l/ 33.2%

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

   3. *-commutative 33.2%

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

   4. distribute-lft-neg-in 33.2%

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

10. Simplified 33.2%

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

11. Final simplification 33.2%

    \[\leadsto y \cdot \frac{-x}{z} \]
12. Add Preprocessing

Developer target: 96.6% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z < 249.6182814532307:\\ \;\;\;\;\frac{y \cdot \frac{x}{z}}{z + z \cdot z}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\frac{y}{z}}{1 + z} \cdot x}{z}\\ \end{array} \end{array} \]

FPCore

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

C

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

Fortran

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 < 249.6182814532307d0) then
        tmp = (y * (x / z)) / (z + (z * z))
    else
        tmp = (((y / z) / (1.0d0 + z)) * x) / z
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z < 249.6182814532307)
		tmp = (y * (x / z)) / (z + (z * z));
	else
		tmp = (((y / z) / (1.0 + z)) * x) / z;
	end
	tmp_2 = tmp;
end

Wolfram

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

Reproduce

herbie shell --seed 2024026 
(FPCore (x y z)
  :name "Statistics.Distribution.Beta:$cvariance from math-functions-0.1.5.2"
  :precision binary64

  :herbie-target
  (if (< z 249.6182814532307) (/ (* y (/ x z)) (+ z (* z z))) (/ (* (/ (/ y z) (+ 1.0 z)) x) z))

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