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

Percentage Accurate: 82.6% → 97.3%

Time: 13.9s

Alternatives: 12

Speedup: 1.0×

• 25.4% 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: 82.6% 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.3% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y, z = num2cell(sort([x_m, y, z])){:}
function tmp = code(x_s, x_m, y, z)
	tmp = x_s * (((x_m / z) * (y / (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]
NOTE: x_m, y, and z should be sorted in increasing order before calling this function.
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * N[(N[(N[(x$95$m / z), $MachinePrecision] * N[(y / N[(z + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 85.4%

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

   1. *-commutative 85.4%

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

   2. associate-/l* 87.3%

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

   3. sqr-neg 87.3%

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

   4. associate-/r* 89.2%

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

   5. sqr-neg 89.2%

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

3. Simplified 89.2%

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

   1. associate-*r/ 90.5%

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

   2. *-commutative 90.5%

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

   3. associate-*r/ 90.4%

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

   4. associate-/r* 93.8%

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

   5. associate-*l/ 98.2%

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

6. Applied egg-rr 98.2%

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

Alternative 2: 94.0% accurate, 0.4× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ [x_m, y, z] = \mathsf{sort}([x_m, y, z])\\ \\ \begin{array}{l} t_0 := \frac{x\_m}{z + 1}\\ x\_s \cdot \begin{array}{l} \mathbf{if}\;\frac{x\_m \cdot y}{\left(z + 1\right) \cdot \left(z \cdot z\right)} \leq 4 \cdot 10^{+40}:\\ \;\;\;\;\frac{y}{z \cdot z} \cdot t\_0\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{z} \cdot \frac{t\_0}{z}\\ \end{array} \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y, and z should be sorted in increasing order before calling this function.
(FPCore (x_s x_m y z)
 :precision binary64
 (let* ((t_0 (/ x_m (+ z 1.0))))
   (*
    x_s
    (if (<= (/ (* x_m y) (* (+ z 1.0) (* z z))) 4e+40)
      (* (/ y (* z z)) t_0)
      (* (/ y z) (/ t_0 z))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y && y < z);
double code(double x_s, double x_m, double y, double z) {
	double t_0 = x_m / (z + 1.0);
	double tmp;
	if (((x_m * y) / ((z + 1.0) * (z * z))) <= 4e+40) {
		tmp = (y / (z * z)) * t_0;
	} else {
		tmp = (y / z) * (t_0 / z);
	}
	return x_s * tmp;
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
NOTE: x_m, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x_s, x_m, y, z)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: tmp
    t_0 = x_m / (z + 1.0d0)
    if (((x_m * y) / ((z + 1.0d0) * (z * z))) <= 4d+40) then
        tmp = (y / (z * z)) * t_0
    else
        tmp = (y / z) * (t_0 / z)
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
assert x_m < y && y < z;
public static double code(double x_s, double x_m, double y, double z) {
	double t_0 = x_m / (z + 1.0);
	double tmp;
	if (((x_m * y) / ((z + 1.0) * (z * z))) <= 4e+40) {
		tmp = (y / (z * z)) * t_0;
	} else {
		tmp = (y / z) * (t_0 / z);
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
[x_m, y, z] = sort([x_m, y, z])
def code(x_s, x_m, y, z):
	t_0 = x_m / (z + 1.0)
	tmp = 0
	if ((x_m * y) / ((z + 1.0) * (z * z))) <= 4e+40:
		tmp = (y / (z * z)) * t_0
	else:
		tmp = (y / z) * (t_0 / z)
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
x_m, y, z = sort([x_m, y, z])
function code(x_s, x_m, y, z)
	t_0 = Float64(x_m / Float64(z + 1.0))
	tmp = 0.0
	if (Float64(Float64(x_m * y) / Float64(Float64(z + 1.0) * Float64(z * z))) <= 4e+40)
		tmp = Float64(Float64(y / Float64(z * z)) * t_0);
	else
		tmp = Float64(Float64(y / z) * Float64(t_0 / z));
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y, z = num2cell(sort([x_m, y, z])){:}
function tmp_2 = code(x_s, x_m, y, z)
	t_0 = x_m / (z + 1.0);
	tmp = 0.0;
	if (((x_m * y) / ((z + 1.0) * (z * z))) <= 4e+40)
		tmp = (y / (z * z)) * t_0;
	else
		tmp = (y / z) * (t_0 / z);
	end
	tmp_2 = 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]
NOTE: x_m, y, and z should be sorted in increasing order before calling this function.
code[x$95$s_, x$95$m_, y_, z_] := Block[{t$95$0 = N[(x$95$m / N[(z + 1.0), $MachinePrecision]), $MachinePrecision]}, N[(x$95$s * If[LessEqual[N[(N[(x$95$m * y), $MachinePrecision] / N[(N[(z + 1.0), $MachinePrecision] * N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 4e+40], N[(N[(y / N[(z * z), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision], N[(N[(y / z), $MachinePrecision] * N[(t$95$0 / z), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 x y) (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64)))) < 4.00000000000000012e40

   1. Initial program 91.3%

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

      1. *-commutative 91.3%

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

      2. sqr-neg 91.3%

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

      3. times-frac 91.9%

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

      4. sqr-neg 91.9%

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

   3. Simplified 91.9%

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

   if 4.00000000000000012e40 < (/.f64 (*.f64 x y) (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))))

   1. Initial program 70.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 70.7%

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

      2. frac-times 85.7%

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

      3. associate-*l/ 81.7%

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

      4. times-frac 97.2%

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

   4. Applied egg-rr 97.2%

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

4. Final simplification 93.4%

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

Alternative 3: 94.4% accurate, 0.6× speedup

Math

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

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y, and z should be sorted in increasing order before calling this function.
(FPCore (x_s x_m y z)
 :precision binary64
 (*
  x_s
  (if (or (<= z -1.0) (not (<= z 1.0)))
    (/ (/ x_m (* z (/ z y))) z)
    (/ y (* z (/ z x_m))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y && y < z);
double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if ((z <= -1.0) || !(z <= 1.0)) {
		tmp = (x_m / (z * (z / y))) / z;
	} else {
		tmp = y / (z * (z / x_m));
	}
	return x_s * tmp;
}

Fortran

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

Java

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

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
[x_m, y, z] = sort([x_m, y, z])
def code(x_s, x_m, y, z):
	tmp = 0
	if (z <= -1.0) or not (z <= 1.0):
		tmp = (x_m / (z * (z / y))) / z
	else:
		tmp = y / (z * (z / x_m))
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
x_m, y, z = sort([x_m, y, z])
function code(x_s, x_m, y, z)
	tmp = 0.0
	if ((z <= -1.0) || !(z <= 1.0))
		tmp = Float64(Float64(x_m / Float64(z * Float64(z / y))) / z);
	else
		tmp = Float64(y / Float64(z * Float64(z / x_m)));
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y, z = num2cell(sort([x_m, y, z])){:}
function tmp_2 = code(x_s, x_m, y, z)
	tmp = 0.0;
	if ((z <= -1.0) || ~((z <= 1.0)))
		tmp = (x_m / (z * (z / y))) / z;
	else
		tmp = y / (z * (z / x_m));
	end
	tmp_2 = 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]
NOTE: x_m, y, and z should be sorted in increasing order before calling this function.
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * If[Or[LessEqual[z, -1.0], N[Not[LessEqual[z, 1.0]], $MachinePrecision]], N[(N[(x$95$m / N[(z * N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], N[(y / N[(z * N[(z / x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < -1 or 1 < z

   1. Initial program 85.7%

      \[\frac{x \cdot y}{\left(z \cdot z\right) \cdot \left(z + 1\right)} \]
   2. 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. associate-/l* 89.0%

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

      3. sqr-neg 89.0%

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

      4. associate-/r* 92.4%

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

      5. sqr-neg 92.4%

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

   3. Simplified 92.4%

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

      1. associate-*r/ 94.9%

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

      2. *-commutative 94.9%

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

      3. associate-*r/ 94.7%

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

      4. associate-/r* 97.4%

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

      5. associate-*l/ 99.0%

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

   6. Applied egg-rr 99.0%

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

      1. frac-times 87.8%

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

      2. *-commutative 87.8%

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

      3. frac-times 99.0%

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

      4. clear-num 98.5%

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

      5. frac-times 95.6%

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

      6. *-un-lft-identity 95.6%

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

   8. Applied egg-rr 95.6%

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

   9. Taylor expanded in z around inf 94.9%

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

   if -1 < z < 1

   1. Initial program 85.0%

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

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

      2. frac-times 86.8%

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

      3. associate-*l/ 84.9%

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

      4. times-frac 97.4%

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

   4. Applied egg-rr 97.4%

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

   5. Taylor expanded in z around 0 95.4%

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

      1. clear-num 95.3%

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

      2. frac-times 87.5%

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

      3. *-commutative 87.5%

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

      4. *-un-lft-identity 87.5%

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

   7. Applied egg-rr 87.5%

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

4. Final simplification 91.4%

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

Alternative 4: 94.7% accurate, 0.6× speedup

Math

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

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y, and z should be sorted in increasing order before calling this function.
(FPCore (x_s x_m y z)
 :precision binary64
 (*
  x_s
  (if (or (<= z -1.0) (not (<= z 1.0)))
    (/ (* (/ x_m z) (/ y z)) z)
    (/ y (* z (/ z x_m))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y && y < z);
double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if ((z <= -1.0) || !(z <= 1.0)) {
		tmp = ((x_m / z) * (y / z)) / z;
	} else {
		tmp = y / (z * (z / x_m));
	}
	return x_s * tmp;
}

Fortran

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

Java

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

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
[x_m, y, z] = sort([x_m, y, z])
def code(x_s, x_m, y, z):
	tmp = 0
	if (z <= -1.0) or not (z <= 1.0):
		tmp = ((x_m / z) * (y / z)) / z
	else:
		tmp = y / (z * (z / x_m))
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
x_m, y, z = sort([x_m, y, z])
function code(x_s, x_m, y, z)
	tmp = 0.0
	if ((z <= -1.0) || !(z <= 1.0))
		tmp = Float64(Float64(Float64(x_m / z) * Float64(y / z)) / z);
	else
		tmp = Float64(y / Float64(z * Float64(z / x_m)));
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y, z = num2cell(sort([x_m, y, z])){:}
function tmp_2 = code(x_s, x_m, y, z)
	tmp = 0.0;
	if ((z <= -1.0) || ~((z <= 1.0)))
		tmp = ((x_m / z) * (y / z)) / z;
	else
		tmp = y / (z * (z / x_m));
	end
	tmp_2 = 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]
NOTE: x_m, y, and z should be sorted in increasing order before calling this function.
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * If[Or[LessEqual[z, -1.0], N[Not[LessEqual[z, 1.0]], $MachinePrecision]], N[(N[(N[(x$95$m / z), $MachinePrecision] * N[(y / z), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], N[(y / N[(z * N[(z / x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < -1 or 1 < z

   1. Initial program 85.7%

      \[\frac{x \cdot y}{\left(z \cdot z\right) \cdot \left(z + 1\right)} \]
   2. 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. associate-/l* 89.0%

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

      3. sqr-neg 89.0%

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

      4. associate-/r* 92.4%

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

      5. sqr-neg 92.4%

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

   3. Simplified 92.4%

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

      1. associate-*r/ 94.9%

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

      2. *-commutative 94.9%

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

      3. associate-*r/ 94.7%

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

      4. associate-/r* 97.4%

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

      5. associate-*l/ 99.0%

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

   6. Applied egg-rr 99.0%

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

   7. Taylor expanded in z around inf 98.2%

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

   if -1 < z < 1

   1. Initial program 85.0%

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

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

      2. frac-times 86.8%

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

      3. associate-*l/ 84.9%

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

      4. times-frac 97.4%

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

   4. Applied egg-rr 97.4%

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

   5. Taylor expanded in z around 0 95.4%

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

      1. clear-num 95.3%

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

      2. frac-times 87.5%

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

      3. *-commutative 87.5%

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

      4. *-un-lft-identity 87.5%

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

   7. Applied egg-rr 87.5%

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

4. Final simplification 93.2%

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

Alternative 5: 92.6% accurate, 0.6× speedup

Math

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

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y, and z should be sorted in increasing order before calling this function.
(FPCore (x_s x_m y z)
 :precision binary64
 (*
  x_s
  (if (or (<= z -1.0) (not (<= z 1.0)))
    (* (/ x_m z) (/ y (* z z)))
    (/ y (* z (/ z x_m))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y && y < z);
double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if ((z <= -1.0) || !(z <= 1.0)) {
		tmp = (x_m / z) * (y / (z * z));
	} else {
		tmp = y / (z * (z / x_m));
	}
	return x_s * tmp;
}

Fortran

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

Java

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

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
[x_m, y, z] = sort([x_m, y, z])
def code(x_s, x_m, y, z):
	tmp = 0
	if (z <= -1.0) or not (z <= 1.0):
		tmp = (x_m / z) * (y / (z * z))
	else:
		tmp = y / (z * (z / x_m))
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
x_m, y, z = sort([x_m, y, z])
function code(x_s, x_m, y, z)
	tmp = 0.0
	if ((z <= -1.0) || !(z <= 1.0))
		tmp = Float64(Float64(x_m / z) * Float64(y / Float64(z * z)));
	else
		tmp = Float64(y / Float64(z * Float64(z / x_m)));
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y, z = num2cell(sort([x_m, y, z])){:}
function tmp_2 = code(x_s, x_m, y, z)
	tmp = 0.0;
	if ((z <= -1.0) || ~((z <= 1.0)))
		tmp = (x_m / z) * (y / (z * z));
	else
		tmp = y / (z * (z / x_m));
	end
	tmp_2 = 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]
NOTE: x_m, y, and z should be sorted in increasing order before calling this function.
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * If[Or[LessEqual[z, -1.0], N[Not[LessEqual[z, 1.0]], $MachinePrecision]], N[(N[(x$95$m / z), $MachinePrecision] * N[(y / N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(y / N[(z * N[(z / x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < -1 or 1 < z

   1. Initial program 85.7%

      \[\frac{x \cdot y}{\left(z \cdot z\right) \cdot \left(z + 1\right)} \]
   2. 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. sqr-neg 85.7%

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

      3. times-frac 92.8%

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

      4. sqr-neg 92.8%

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

   3. Simplified 92.8%

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

   5. Taylor expanded in z around inf 92.1%

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

   if -1 < z < 1

   1. Initial program 85.0%

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

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

      2. frac-times 86.8%

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

      3. associate-*l/ 84.9%

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

      4. times-frac 97.4%

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

   4. Applied egg-rr 97.4%

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

   5. Taylor expanded in z around 0 95.4%

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

      1. clear-num 95.3%

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

      2. frac-times 87.5%

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

      3. *-commutative 87.5%

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

      4. *-un-lft-identity 87.5%

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

   7. Applied egg-rr 87.5%

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

4. Final simplification 89.9%

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

Alternative 6: 93.9% accurate, 0.6× speedup

Math

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

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y, and z should be sorted in increasing order before calling this function.
(FPCore (x_s x_m y z)
 :precision binary64
 (*
  x_s
  (if (or (<= z -1.0) (not (<= z 1.0)))
    (* (/ y z) (/ (/ x_m z) z))
    (/ y (* z (/ z x_m))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y && y < z);
double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if ((z <= -1.0) || !(z <= 1.0)) {
		tmp = (y / z) * ((x_m / z) / z);
	} else {
		tmp = y / (z * (z / x_m));
	}
	return x_s * tmp;
}

Fortran

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

Java

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

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
[x_m, y, z] = sort([x_m, y, z])
def code(x_s, x_m, y, z):
	tmp = 0
	if (z <= -1.0) or not (z <= 1.0):
		tmp = (y / z) * ((x_m / z) / z)
	else:
		tmp = y / (z * (z / x_m))
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
x_m, y, z = sort([x_m, y, z])
function code(x_s, x_m, y, z)
	tmp = 0.0
	if ((z <= -1.0) || !(z <= 1.0))
		tmp = Float64(Float64(y / z) * Float64(Float64(x_m / z) / z));
	else
		tmp = Float64(y / Float64(z * Float64(z / x_m)));
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y, z = num2cell(sort([x_m, y, z])){:}
function tmp_2 = code(x_s, x_m, y, z)
	tmp = 0.0;
	if ((z <= -1.0) || ~((z <= 1.0)))
		tmp = (y / z) * ((x_m / z) / z);
	else
		tmp = y / (z * (z / x_m));
	end
	tmp_2 = 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]
NOTE: x_m, y, and z should be sorted in increasing order before calling this function.
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * If[Or[LessEqual[z, -1.0], N[Not[LessEqual[z, 1.0]], $MachinePrecision]], N[(N[(y / z), $MachinePrecision] * N[(N[(x$95$m / z), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision], N[(y / N[(z * N[(z / x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < -1 or 1 < 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 92.8%

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

      3. associate-*l/ 93.8%

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

      4. times-frac 97.4%

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

   4. Applied egg-rr 97.4%

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

   5. Taylor expanded in z around inf 96.6%

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

   if -1 < z < 1

   1. Initial program 85.0%

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

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

      2. frac-times 86.8%

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

      3. associate-*l/ 84.9%

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

      4. times-frac 97.4%

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

   4. Applied egg-rr 97.4%

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

   5. Taylor expanded in z around 0 95.4%

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

      1. clear-num 95.3%

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

      2. frac-times 87.5%

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

      3. *-commutative 87.5%

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

      4. *-un-lft-identity 87.5%

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

   7. Applied egg-rr 87.5%

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

4. Final simplification 92.4%

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

Alternative 7: 90.2% accurate, 0.6× speedup

Math

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

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y, and z should be sorted in increasing order before calling this function.
(FPCore (x_s x_m y z)
 :precision binary64
 (*
  x_s
  (if (or (<= z -1.0) (not (<= z 1.0)))
    (* y (/ (/ x_m (* z z)) z))
    (/ y (* z (/ z x_m))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y && y < z);
double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if ((z <= -1.0) || !(z <= 1.0)) {
		tmp = y * ((x_m / (z * z)) / z);
	} else {
		tmp = y / (z * (z / x_m));
	}
	return x_s * tmp;
}

Fortran

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

Java

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

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
[x_m, y, z] = sort([x_m, y, z])
def code(x_s, x_m, y, z):
	tmp = 0
	if (z <= -1.0) or not (z <= 1.0):
		tmp = y * ((x_m / (z * z)) / z)
	else:
		tmp = y / (z * (z / x_m))
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
x_m, y, z = sort([x_m, y, z])
function code(x_s, x_m, y, z)
	tmp = 0.0
	if ((z <= -1.0) || !(z <= 1.0))
		tmp = Float64(y * Float64(Float64(x_m / Float64(z * z)) / z));
	else
		tmp = Float64(y / Float64(z * Float64(z / x_m)));
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y, z = num2cell(sort([x_m, y, z])){:}
function tmp_2 = code(x_s, x_m, y, z)
	tmp = 0.0;
	if ((z <= -1.0) || ~((z <= 1.0)))
		tmp = y * ((x_m / (z * z)) / z);
	else
		tmp = y / (z * (z / x_m));
	end
	tmp_2 = 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]
NOTE: x_m, y, and z should be sorted in increasing order before calling this function.
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * If[Or[LessEqual[z, -1.0], N[Not[LessEqual[z, 1.0]], $MachinePrecision]], N[(y * N[(N[(x$95$m / N[(z * z), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision], N[(y / N[(z * N[(z / x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < -1 or 1 < z

   1. Initial program 85.7%

      \[\frac{x \cdot y}{\left(z \cdot z\right) \cdot \left(z + 1\right)} \]
   2. 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. associate-/l* 89.0%

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

      3. sqr-neg 89.0%

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

      4. associate-/r* 92.4%

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

      5. sqr-neg 92.4%

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

   3. Simplified 92.4%

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

   5. Taylor expanded in z around inf 91.6%

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

   if -1 < z < 1

   1. Initial program 85.0%

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

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

      2. frac-times 86.8%

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

      3. associate-*l/ 84.9%

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

      4. times-frac 97.4%

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

   4. Applied egg-rr 97.4%

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

   5. Taylor expanded in z around 0 95.4%

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

      1. clear-num 95.3%

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

      2. frac-times 87.5%

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

      3. *-commutative 87.5%

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

      4. *-un-lft-identity 87.5%

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

   7. Applied egg-rr 87.5%

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

4. Final simplification 89.7%

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

Alternative 8: 96.4% accurate, 0.7× speedup

Math

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

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y, and z should be sorted in increasing order before calling this function.
(FPCore (x_s x_m y z)
 :precision binary64
 (*
  x_s
  (if (<= z -2.8e+19)
    (/ (/ x_m (* z (/ z y))) z)
    (* (/ y z) (/ (/ x_m (+ z 1.0)) z)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y && y < z);
double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if (z <= -2.8e+19) {
		tmp = (x_m / (z * (z / y))) / z;
	} else {
		tmp = (y / z) * ((x_m / (z + 1.0)) / z);
	}
	return x_s * tmp;
}

Fortran

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

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
assert x_m < y && y < z;
public static double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if (z <= -2.8e+19) {
		tmp = (x_m / (z * (z / y))) / z;
	} else {
		tmp = (y / z) * ((x_m / (z + 1.0)) / z);
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
[x_m, y, z] = sort([x_m, y, z])
def code(x_s, x_m, y, z):
	tmp = 0
	if z <= -2.8e+19:
		tmp = (x_m / (z * (z / y))) / z
	else:
		tmp = (y / z) * ((x_m / (z + 1.0)) / z)
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
x_m, y, z = sort([x_m, y, z])
function code(x_s, x_m, y, z)
	tmp = 0.0
	if (z <= -2.8e+19)
		tmp = Float64(Float64(x_m / Float64(z * Float64(z / y))) / z);
	else
		tmp = Float64(Float64(y / z) * Float64(Float64(x_m / Float64(z + 1.0)) / z));
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y, z = num2cell(sort([x_m, y, z])){:}
function tmp_2 = code(x_s, x_m, y, z)
	tmp = 0.0;
	if (z <= -2.8e+19)
		tmp = (x_m / (z * (z / y))) / z;
	else
		tmp = (y / z) * ((x_m / (z + 1.0)) / z);
	end
	tmp_2 = 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]
NOTE: x_m, y, and z should be sorted in increasing order before calling this function.
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * If[LessEqual[z, -2.8e+19], N[(N[(x$95$m / N[(z * N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], N[(N[(y / z), $MachinePrecision] * N[(N[(x$95$m / N[(z + 1.0), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < -2.8e19

   1. Initial program 81.1%

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

      1. *-commutative 81.1%

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

      2. associate-/l* 87.6%

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

      3. sqr-neg 87.6%

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

      4. associate-/r* 94.7%

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

      5. sqr-neg 94.7%

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

   3. Simplified 94.7%

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

      1. associate-*r/ 95.5%

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

      2. *-commutative 95.5%

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

      3. associate-*r/ 95.0%

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

      4. associate-/r* 97.8%

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

      5. associate-*l/ 98.1%

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

   6. Applied egg-rr 98.1%

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

      1. frac-times 84.0%

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

      2. *-commutative 84.0%

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

      3. frac-times 98.1%

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

      4. clear-num 97.3%

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

      5. frac-times 92.6%

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

      6. *-un-lft-identity 92.6%

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

   8. Applied egg-rr 92.6%

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

   9. Taylor expanded in z around inf 92.6%

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

   if -2.8e19 < z

   1. Initial program 86.9%

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

      1. *-commutative 86.9%

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

      2. frac-times 90.2%

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

      3. associate-*l/ 89.5%

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

      4. times-frac 97.3%

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

   4. Applied egg-rr 97.3%

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

4. Final simplification 96.1%

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

Alternative 9: 76.4% accurate, 0.9× speedup

Math

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

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y, and z should be sorted in increasing order before calling this function.
(FPCore (x_s x_m y z)
 :precision binary64
 (* x_s (if (<= x_m 1.06e-63) (* (/ x_m z) (/ y z)) (* x_m (/ y (* z z))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y && y < z);
double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if (x_m <= 1.06e-63) {
		tmp = (x_m / z) * (y / z);
	} else {
		tmp = x_m * (y / (z * z));
	}
	return x_s * tmp;
}

Fortran

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

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
assert x_m < y && y < z;
public static double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if (x_m <= 1.06e-63) {
		tmp = (x_m / z) * (y / z);
	} else {
		tmp = x_m * (y / (z * z));
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
[x_m, y, z] = sort([x_m, y, z])
def code(x_s, x_m, y, z):
	tmp = 0
	if x_m <= 1.06e-63:
		tmp = (x_m / z) * (y / z)
	else:
		tmp = x_m * (y / (z * z))
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
x_m, y, z = sort([x_m, y, z])
function code(x_s, x_m, y, z)
	tmp = 0.0
	if (x_m <= 1.06e-63)
		tmp = Float64(Float64(x_m / z) * Float64(y / z));
	else
		tmp = Float64(x_m * Float64(y / Float64(z * z)));
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y, z = num2cell(sort([x_m, y, z])){:}
function tmp_2 = code(x_s, x_m, y, z)
	tmp = 0.0;
	if (x_m <= 1.06e-63)
		tmp = (x_m / z) * (y / z);
	else
		tmp = x_m * (y / (z * z));
	end
	tmp_2 = 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]
NOTE: x_m, y, and z should be sorted in increasing order before calling this function.
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * If[LessEqual[x$95$m, 1.06e-63], N[(N[(x$95$m / z), $MachinePrecision] * N[(y / z), $MachinePrecision]), $MachinePrecision], N[(x$95$m * N[(y / N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x < 1.06000000000000004e-63

   1. Initial program 85.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 85.2%

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

      2. frac-times 88.5%

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

      3. associate-*l/ 88.4%

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

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

   if 1.06000000000000004e-63 < x

   1. Initial program 85.6%

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

      1. *-commutative 85.6%

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

      2. sqr-neg 85.6%

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

      3. times-frac 92.8%

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

      4. sqr-neg 92.8%

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

   3. Simplified 92.8%

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

   5. Taylor expanded in z around 0 75.6%

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

4. Final simplification 73.1%

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

Alternative 10: 78.0% accurate, 1.6× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y, z = num2cell(sort([x_m, y, z])){:}
function tmp = code(x_s, x_m, y, z)
	tmp = x_s * (y / (z * (z / x_m)));
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]
NOTE: x_m, y, and z should be sorted in increasing order before calling this function.
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * N[(y / N[(z * N[(z / x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 85.4%

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

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

   2. frac-times 90.1%

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

   3. associate-*l/ 89.7%

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

   4. times-frac 97.4%

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

4. Applied egg-rr 97.4%

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

5. Taylor expanded in z around 0 70.6%

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

   1. clear-num 70.9%

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

   2. frac-times 69.6%

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

   3. *-commutative 69.6%

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

   4. *-un-lft-identity 69.6%

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

7. Applied egg-rr 69.6%

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

Alternative 11: 74.7% accurate, 1.6× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y, z = num2cell(sort([x_m, y, z])){:}
function tmp = code(x_s, x_m, y, z)
	tmp = x_s * ((x_m / z) * (y / 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]
NOTE: x_m, y, and z should be sorted in increasing order before calling this function.
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * N[(N[(x$95$m / z), $MachinePrecision] * N[(y / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 85.4%

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

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

   2. frac-times 90.1%

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

   3. associate-*l/ 89.7%

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

   4. times-frac 97.4%

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

4. Applied egg-rr 97.4%

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

5. Taylor expanded in z around 0 70.6%

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

6. Final simplification 70.6%

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

Alternative 12: 70.4% accurate, 1.6× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y, z = num2cell(sort([x_m, y, z])){:}
function tmp = code(x_s, x_m, y, z)
	tmp = x_s * (x_m * ((y / z) / 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]
NOTE: x_m, y, and z should be sorted in increasing order before calling this function.
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * N[(x$95$m * N[(N[(y / z), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 85.4%

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

   1. *-commutative 85.4%

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

   2. associate-/l* 87.3%

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

   3. sqr-neg 87.3%

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

   4. associate-/r* 89.2%

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

   5. sqr-neg 89.2%

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

3. Simplified 89.2%

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

   1. associate-*r/ 90.5%

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

   2. *-commutative 90.5%

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

   3. associate-*r/ 90.4%

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

   4. associate-/r* 93.8%

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

   5. associate-*l/ 98.2%

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

6. Applied egg-rr 98.2%

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

7. Taylor expanded in z around 0 65.6%

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

   1. associate-/l* 70.1%

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

   2. associate-/l* 73.1%

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

9. Applied egg-rr 73.1%

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

Developer Target 1: 95.8% 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 2024170 
(FPCore (x y z)
  :name "Statistics.Distribution.Beta:$cvariance from math-functions-0.1.5.2"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< z 2496182814532307/10000000000000) (/ (* y (/ x z)) (+ z (* z z))) (/ (* (/ (/ y z) (+ 1 z)) x) z)))

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