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

Percentage Accurate: 83.1% → 95.7%

Time: 10.2s

Alternatives: 16

Speedup: 0.9×

• 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: 83.1% 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: 95.7% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
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_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[N[(N[(1.0 + z), $MachinePrecision] * N[(z * z), $MachinePrecision]), $MachinePrecision], 3e-184], N[(N[(x$95$m / z), $MachinePrecision] / N[(N[(z * z + z), $MachinePrecision] / y$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(y$95$m / N[(1.0 + z), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision] / z), $MachinePrecision] / z), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < 2.99999999999999991e-184

   1. Initial program 82.6%

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

      1. lift-/.f64 N/A

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

      2. clear-num N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-*l* N/A

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

      6. lift-*.f64 N/A

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

      7. times-frac N/A

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

      8. associate-/r* N/A

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

      9. clear-num N/A

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

      10. lower-/.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. *-commutative N/A

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

      14. lift-+.f64 N/A

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

      15. distribute-lft1-in N/A

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

      16. lower-fma.f64 98.5

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

   4. Applied rewrites 98.5%

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

   if 2.99999999999999991e-184 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64)))

   1. Initial program 87.0%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l/ N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/r* N/A

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

      6. lower-/.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. associate-*r/ N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. lower-/.f64 96.2

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

      13. lift-+.f64 N/A

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

      14. +-commutative N/A

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

      15. lower-+.f64 96.2

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

   4. Applied rewrites 96.2%

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

4. Final simplification 97.6%

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

Alternative 2: 97.0% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
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_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[N[(N[(y$95$m * x$95$m), $MachinePrecision] / N[(N[(1.0 + z), $MachinePrecision] * N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1e-37], N[(x$95$m / N[(N[(N[(z * z + z), $MachinePrecision] / y$95$m), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x$95$m / N[(z * z + z), $MachinePrecision]), $MachinePrecision] * y$95$m), $MachinePrecision] / 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)))) < 1.00000000000000007e-37

   1. Initial program 89.7%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. times-frac N/A

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

      5. lift-*.f64 N/A

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

      6. associate-/r* N/A

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

      7. associate-*l/ N/A

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

      8. clear-num N/A

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

      9. inv-pow N/A

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

      10. clear-num N/A

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

      11. inv-pow N/A

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

      12. unpow-prod-down N/A

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

      13. times-frac N/A

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

      14. lift-*.f64 N/A

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

      15. lower-/.f64 N/A

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

   4. Applied rewrites 97.5%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. lift-/.f64 N/A

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

      5. frac-times N/A

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

      6. lift-+.f64 N/A

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

      7. +-commutative N/A

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

      8. distribute-lft1-in N/A

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

      9. lift-fma.f64 N/A

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

      10. lift-/.f64 N/A

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

      11. clear-num N/A

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

      12. un-div-inv N/A

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

      13. associate-/l/ N/A

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

      14. clear-num N/A

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

      15. lift-/.f64 N/A

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

      16. div-inv N/A

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

      17. clear-num N/A

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

      18. lift-/.f64 N/A

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

      19. associate-/l/ N/A

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

      20. lift-*.f64 N/A

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

      21. clear-num N/A

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

      22. lower-/.f64 N/A

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

   6. Applied rewrites 93.0%

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

   if 1.00000000000000007e-37 < (/.f64 (*.f64 x y) (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))))

   1. Initial program 72.1%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. times-frac N/A

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

      5. lift-*.f64 N/A

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

      6. associate-/r* N/A

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

      7. associate-*l/ N/A

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

      8. clear-num N/A

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

      9. inv-pow N/A

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

      10. clear-num N/A

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

      11. inv-pow N/A

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

      12. unpow-prod-down N/A

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

      13. times-frac N/A

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

      14. lift-*.f64 N/A

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

      15. lower-/.f64 N/A

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

   4. Applied rewrites 96.0%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. clear-num N/A

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

      4. associate-/r/ N/A

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

      5. associate-*r* N/A

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

      6. div-inv N/A

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

      7. lift-/.f64 N/A

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

      8. associate-/r* N/A

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

      9. lift-+.f64 N/A

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

      10. +-commutative N/A

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

      11. distribute-lft1-in N/A

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

      12. lift-fma.f64 N/A

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

      13. lower-*.f64 N/A

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

      14. lower-/.f64 91.1

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

   6. Applied rewrites 91.1%

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

4. Final simplification 92.4%

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

Alternative 3: 96.5% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
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_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[N[(N[(y$95$m * x$95$m), $MachinePrecision] / N[(N[(1.0 + z), $MachinePrecision] * N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 5e-156], N[(x$95$m / N[(N[(N[(z * z + z), $MachinePrecision] / y$95$m), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision], N[(N[(y$95$m * N[(x$95$m / z), $MachinePrecision]), $MachinePrecision] / N[(z * z + z), $MachinePrecision]), $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)))) < 5.00000000000000007e-156

   1. Initial program 89.4%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. times-frac N/A

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

      5. lift-*.f64 N/A

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

      6. associate-/r* N/A

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

      7. associate-*l/ N/A

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

      8. clear-num N/A

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

      9. inv-pow N/A

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

      10. clear-num N/A

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

      11. inv-pow N/A

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

      12. unpow-prod-down N/A

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

      13. times-frac N/A

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

      14. lift-*.f64 N/A

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

      15. lower-/.f64 N/A

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

   4. Applied rewrites 97.5%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. lift-/.f64 N/A

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

      5. frac-times N/A

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

      6. lift-+.f64 N/A

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

      7. +-commutative N/A

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

      8. distribute-lft1-in N/A

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

      9. lift-fma.f64 N/A

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

      10. lift-/.f64 N/A

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

      11. clear-num N/A

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

      12. un-div-inv N/A

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

      13. associate-/l/ N/A

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

      14. clear-num N/A

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

      15. lift-/.f64 N/A

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

      16. div-inv N/A

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

      17. clear-num N/A

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

      18. lift-/.f64 N/A

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

      19. associate-/l/ N/A

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

      20. lift-*.f64 N/A

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

      21. clear-num N/A

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

      22. lower-/.f64 N/A

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

   6. Applied rewrites 93.3%

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

   if 5.00000000000000007e-156 < (/.f64 (*.f64 x y) (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))))

   1. Initial program 73.7%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. times-frac N/A

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

      5. lift-*.f64 N/A

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

      6. associate-/r* N/A

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

      7. frac-times N/A

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

      8. lower-/.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. *-commutative N/A

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

      12. lift-+.f64 N/A

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

      13. distribute-lft1-in N/A

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

      14. lower-fma.f64 90.4

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

   4. Applied rewrites 90.4%

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

4. Final simplification 92.4%

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

Alternative 4: 95.4% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
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_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[N[(N[(y$95$m * x$95$m), $MachinePrecision] / N[(N[(1.0 + z), $MachinePrecision] * N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 4e+30], N[(N[(N[(y$95$m / z), $MachinePrecision] / N[(z * z + z), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision], N[(N[(y$95$m / z), $MachinePrecision] * N[(x$95$m / N[(z * z + z), $MachinePrecision]), $MachinePrecision]), $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.0000000000000001e30

   1. Initial program 90.0%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 90.5

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

      7. lift-*.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. associate-*l* N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lift-+.f64 N/A

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

      14. distribute-lft1-in N/A

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

      15. lower-fma.f64 90.5

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

   4. Applied rewrites 90.5%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l/ N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 93.0

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

   6. Applied rewrites 93.0%

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

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

   1. Initial program 69.3%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. associate-*l* N/A

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

      7. times-frac N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. *-commutative N/A

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

      12. lift-+.f64 N/A

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

      13. distribute-lft1-in N/A

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

      14. lower-fma.f64 91.5

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

   4. Applied rewrites 91.5%

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

4. Final simplification 92.6%

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

Alternative 5: 91.8% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
[x_m, y_m, z] = sort([x_m, y_m, z])
def code(x_s, y_s, x_m, y_m, z):
	t_0 = (y_m / ((z * z) * z)) * x_m
	t_1 = (1.0 + z) * (z * z)
	tmp = 0
	if t_1 <= -1e+18:
		tmp = t_0
	elif t_1 <= 0.002:
		tmp = ((x_m / z) / z) * y_m
	else:
		tmp = t_0
	return x_s * (y_s * tmp)

Julia

y\_m = abs(y)
y\_s = copysign(1.0, y)
x\_m = abs(x)
x\_s = copysign(1.0, x)
x_m, y_m, z = sort([x_m, y_m, z])
function code(x_s, y_s, x_m, y_m, z)
	t_0 = Float64(Float64(y_m / Float64(Float64(z * z) * z)) * x_m)
	t_1 = Float64(Float64(1.0 + z) * Float64(z * z))
	tmp = 0.0
	if (t_1 <= -1e+18)
		tmp = t_0;
	elseif (t_1 <= 0.002)
		tmp = Float64(Float64(Float64(x_m / z) / z) * y_m);
	else
		tmp = t_0;
	end
	return Float64(x_s * Float64(y_s * tmp))
end

MATLAB

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

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
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_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(N[(y$95$m / N[(N[(z * z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision]}, Block[{t$95$1 = N[(N[(1.0 + z), $MachinePrecision] * N[(z * z), $MachinePrecision]), $MachinePrecision]}, N[(x$95$s * N[(y$95$s * If[LessEqual[t$95$1, -1e+18], t$95$0, If[LessEqual[t$95$1, 0.002], N[(N[(N[(x$95$m / z), $MachinePrecision] / z), $MachinePrecision] * y$95$m), $MachinePrecision], t$95$0]]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < -1e18 or 2e-3 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64)))

   1. Initial program 87.3%

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

   3. Taylor expanded in z around inf

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

      1. unpow3 N/A

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

      2. unpow2 N/A

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

      3. lower-*.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 85.4

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

   5. Applied rewrites 85.4%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 89.3

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

   7. Applied rewrites 89.3%

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

   if -1e18 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < 2e-3

   1. Initial program 81.0%

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

   3. Taylor expanded in z around 0

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 76.9

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

   5. Applied rewrites 76.9%

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

   7. Applied rewrites 80.2%

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

   9. Applied rewrites 86.4%

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

4. Final simplification 88.0%

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

Alternative 6: 91.0% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
[x_m, y_m, z] = sort([x_m, y_m, z])
def code(x_s, y_s, x_m, y_m, z):
	t_0 = (y_m / ((z * z) * z)) * x_m
	t_1 = (1.0 + z) * (z * z)
	tmp = 0
	if t_1 <= -1e+18:
		tmp = t_0
	elif t_1 <= 0.002:
		tmp = (y_m / z) * (x_m / z)
	else:
		tmp = t_0
	return x_s * (y_s * tmp)

Julia

y\_m = abs(y)
y\_s = copysign(1.0, y)
x\_m = abs(x)
x\_s = copysign(1.0, x)
x_m, y_m, z = sort([x_m, y_m, z])
function code(x_s, y_s, x_m, y_m, z)
	t_0 = Float64(Float64(y_m / Float64(Float64(z * z) * z)) * x_m)
	t_1 = Float64(Float64(1.0 + z) * Float64(z * z))
	tmp = 0.0
	if (t_1 <= -1e+18)
		tmp = t_0;
	elseif (t_1 <= 0.002)
		tmp = Float64(Float64(y_m / z) * Float64(x_m / z));
	else
		tmp = t_0;
	end
	return Float64(x_s * Float64(y_s * tmp))
end

MATLAB

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

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
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_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(N[(y$95$m / N[(N[(z * z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision]}, Block[{t$95$1 = N[(N[(1.0 + z), $MachinePrecision] * N[(z * z), $MachinePrecision]), $MachinePrecision]}, N[(x$95$s * N[(y$95$s * If[LessEqual[t$95$1, -1e+18], t$95$0, If[LessEqual[t$95$1, 0.002], N[(N[(y$95$m / z), $MachinePrecision] * N[(x$95$m / z), $MachinePrecision]), $MachinePrecision], t$95$0]]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < -1e18 or 2e-3 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64)))

   1. Initial program 87.3%

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

   3. Taylor expanded in z around inf

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

      1. unpow3 N/A

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

      2. unpow2 N/A

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

      3. lower-*.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 85.4

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

   5. Applied rewrites 85.4%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 89.3

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

   7. Applied rewrites 89.3%

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

   if -1e18 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < 2e-3

   1. Initial program 81.0%

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

   3. Taylor expanded in z around 0

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 76.9

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

   5. Applied rewrites 76.9%

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

   7. Applied rewrites 95.1%

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

4. Final simplification 92.0%

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

Alternative 7: 86.3% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
[x_m, y_m, z] = sort([x_m, y_m, z])
def code(x_s, y_s, x_m, y_m, z):
	t_0 = (y_m / ((z * z) * z)) * x_m
	t_1 = (1.0 + z) * (z * z)
	tmp = 0
	if t_1 <= -1e+18:
		tmp = t_0
	elif t_1 <= 0.002:
		tmp = (x_m / (z * z)) * y_m
	else:
		tmp = t_0
	return x_s * (y_s * tmp)

Julia

y\_m = abs(y)
y\_s = copysign(1.0, y)
x\_m = abs(x)
x\_s = copysign(1.0, x)
x_m, y_m, z = sort([x_m, y_m, z])
function code(x_s, y_s, x_m, y_m, z)
	t_0 = Float64(Float64(y_m / Float64(Float64(z * z) * z)) * x_m)
	t_1 = Float64(Float64(1.0 + z) * Float64(z * z))
	tmp = 0.0
	if (t_1 <= -1e+18)
		tmp = t_0;
	elseif (t_1 <= 0.002)
		tmp = Float64(Float64(x_m / Float64(z * z)) * y_m);
	else
		tmp = t_0;
	end
	return Float64(x_s * Float64(y_s * tmp))
end

MATLAB

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

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
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_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(N[(y$95$m / N[(N[(z * z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision]}, Block[{t$95$1 = N[(N[(1.0 + z), $MachinePrecision] * N[(z * z), $MachinePrecision]), $MachinePrecision]}, N[(x$95$s * N[(y$95$s * If[LessEqual[t$95$1, -1e+18], t$95$0, If[LessEqual[t$95$1, 0.002], N[(N[(x$95$m / N[(z * z), $MachinePrecision]), $MachinePrecision] * y$95$m), $MachinePrecision], t$95$0]]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < -1e18 or 2e-3 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64)))

   1. Initial program 87.3%

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

   3. Taylor expanded in z around inf

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

      1. unpow3 N/A

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

      2. unpow2 N/A

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

      3. lower-*.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 85.4

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

   5. Applied rewrites 85.4%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 89.3

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

   7. Applied rewrites 89.3%

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

   if -1e18 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < 2e-3

   1. Initial program 81.0%

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

   3. Taylor expanded in z around 0

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 76.9

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

   5. Applied rewrites 76.9%

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

   7. Applied rewrites 80.2%

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

4. Final simplification 85.2%

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

Alternative 8: 94.0% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
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_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[z, -1.75e-19], N[(N[(y$95$m / N[(N[(1.0 + z), $MachinePrecision] * N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision], If[LessEqual[z, 1.0], N[(N[(N[(x$95$m / z), $MachinePrecision] * y$95$m), $MachinePrecision] / z), $MachinePrecision], N[(N[(N[(y$95$m / N[(z * z), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision] / z), $MachinePrecision]]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if z < -1.75000000000000008e-19

   1. Initial program 90.4%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 95.7

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

      7. lift-*.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. associate-*l* N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lift-+.f64 N/A

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

      14. distribute-lft1-in N/A

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

      15. lower-fma.f64 95.7

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

   4. Applied rewrites 95.7%

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

      1. lift-*.f64 N/A

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

      2. lift-fma.f64 N/A

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

      3. distribute-lft1-in N/A

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

      4. lift-+.f64 N/A

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

      5. associate-*r* N/A

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

      6. lift-*.f64 N/A

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

      7. lower-*.f64 95.7

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

      8. lift-+.f64 N/A

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

      9. +-commutative N/A

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

      10. lower-+.f64 95.7

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

   6. Applied rewrites 95.7%

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

   if -1.75000000000000008e-19 < z < 1

   1. Initial program 81.2%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. times-frac N/A

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

      5. lift-*.f64 N/A

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

      6. associate-/r* N/A

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

      7. associate-*l/ N/A

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

      8. clear-num N/A

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

      9. inv-pow N/A

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

      10. clear-num N/A

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

      11. inv-pow N/A

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

      12. unpow-prod-down N/A

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

      13. times-frac N/A

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

      14. lift-*.f64 N/A

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

      15. lower-/.f64 N/A

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

   4. Applied rewrites 96.8%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. clear-num N/A

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

      4. associate-/r/ N/A

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

      5. associate-*r* N/A

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

      6. div-inv N/A

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

      7. lift-/.f64 N/A

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

      8. associate-/r* N/A

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

      9. lift-+.f64 N/A

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

      10. +-commutative N/A

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

      11. distribute-lft1-in N/A

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

      12. lift-fma.f64 N/A

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

      13. lower-*.f64 N/A

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

      14. lower-/.f64 96.9

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

   6. Applied rewrites 96.9%

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

   7. Taylor expanded in z around 0

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

      1. lower-/.f64 96.4

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

   9. Applied rewrites 96.4%

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

   if 1 < z

   1. Initial program 83.9%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. times-frac N/A

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

      5. lift-*.f64 N/A

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

      6. associate-/r* N/A

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

      7. associate-*l/ N/A

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

      8. clear-num N/A

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

      9. inv-pow N/A

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

      10. clear-num N/A

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

      11. inv-pow N/A

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

      12. unpow-prod-down N/A

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

      13. times-frac N/A

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

      14. lift-*.f64 N/A

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

      15. lower-/.f64 N/A

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

   4. Applied rewrites 98.4%

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

   5. Taylor expanded in z around inf

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 90.1

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

   7. Applied rewrites 90.1%

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

Alternative 9: 93.3% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
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_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[z, -1.75e-19], N[(N[(y$95$m / N[(N[(1.0 + z), $MachinePrecision] * N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision], If[LessEqual[z, 2e-45], N[(N[(N[(x$95$m / z), $MachinePrecision] * y$95$m), $MachinePrecision] / z), $MachinePrecision], N[(N[(y$95$m / N[(N[(z * z + z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision]]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if z < -1.75000000000000008e-19

   1. Initial program 90.4%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 95.7

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

      7. lift-*.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. associate-*l* N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lift-+.f64 N/A

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

      14. distribute-lft1-in N/A

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

      15. lower-fma.f64 95.7

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

   4. Applied rewrites 95.7%

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

      1. lift-*.f64 N/A

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

      2. lift-fma.f64 N/A

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

      3. distribute-lft1-in N/A

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

      4. lift-+.f64 N/A

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

      5. associate-*r* N/A

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

      6. lift-*.f64 N/A

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

      7. lower-*.f64 95.7

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

      8. lift-+.f64 N/A

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

      9. +-commutative N/A

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

      10. lower-+.f64 95.7

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

   6. Applied rewrites 95.7%

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

   if -1.75000000000000008e-19 < z < 1.99999999999999997e-45

   1. Initial program 80.7%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. times-frac N/A

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

      5. lift-*.f64 N/A

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

      6. associate-/r* N/A

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

      7. associate-*l/ N/A

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

      8. clear-num N/A

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

      9. inv-pow N/A

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

      10. clear-num N/A

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

      11. inv-pow N/A

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

      12. unpow-prod-down N/A

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

      13. times-frac N/A

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

      14. lift-*.f64 N/A

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

      15. lower-/.f64 N/A

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

   4. Applied rewrites 96.9%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. clear-num N/A

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

      4. associate-/r/ N/A

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

      5. associate-*r* N/A

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

      6. div-inv N/A

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

      7. lift-/.f64 N/A

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

      8. associate-/r* N/A

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

      9. lift-+.f64 N/A

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

      10. +-commutative N/A

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

      11. distribute-lft1-in N/A

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

      12. lift-fma.f64 N/A

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

      13. lower-*.f64 N/A

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

      14. lower-/.f64 97.0

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

   6. Applied rewrites 97.0%

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

   7. Taylor expanded in z around 0

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

      1. lower-/.f64 97.0

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

   9. Applied rewrites 97.0%

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

   if 1.99999999999999997e-45 < z

   1. Initial program 84.2%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 88.6

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

      7. lift-*.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. associate-*l* N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lift-+.f64 N/A

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

      14. distribute-lft1-in N/A

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

      15. lower-fma.f64 88.6

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

   4. Applied rewrites 88.6%

      \[\leadsto \color{blue}{\frac{y}{\mathsf{fma}\left(z, z, z\right) \cdot z} \cdot x} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 10: 93.3% accurate, 0.7× speedup

Math

\[\begin{array}{l} y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ [x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\ \\ \begin{array}{l} t_0 := \frac{y\_m}{\mathsf{fma}\left(z, z, z\right) \cdot z} \cdot x\_m\\ x\_s \cdot \left(y\_s \cdot \begin{array}{l} \mathbf{if}\;z \leq -1.75 \cdot 10^{-19}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;z \leq 2 \cdot 10^{-45}:\\ \;\;\;\;\frac{\frac{x\_m}{z} \cdot y\_m}{z}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array}\right) \end{array} \end{array} \]

FPCore

y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
 :precision binary64
 (let* ((t_0 (* (/ y_m (* (fma z z z) z)) x_m)))
   (*
    x_s
    (*
     y_s
     (if (<= z -1.75e-19)
       t_0
       (if (<= z 2e-45) (/ (* (/ x_m z) y_m) z) t_0))))))

C

y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
	double t_0 = (y_m / (fma(z, z, z) * z)) * x_m;
	double tmp;
	if (z <= -1.75e-19) {
		tmp = t_0;
	} else if (z <= 2e-45) {
		tmp = ((x_m / z) * y_m) / z;
	} else {
		tmp = t_0;
	}
	return x_s * (y_s * tmp);
}

Julia

y\_m = abs(y)
y\_s = copysign(1.0, y)
x\_m = abs(x)
x\_s = copysign(1.0, x)
x_m, y_m, z = sort([x_m, y_m, z])
function code(x_s, y_s, x_m, y_m, z)
	t_0 = Float64(Float64(y_m / Float64(fma(z, z, z) * z)) * x_m)
	tmp = 0.0
	if (z <= -1.75e-19)
		tmp = t_0;
	elseif (z <= 2e-45)
		tmp = Float64(Float64(Float64(x_m / z) * y_m) / z);
	else
		tmp = t_0;
	end
	return Float64(x_s * Float64(y_s * tmp))
end

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
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_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(N[(y$95$m / N[(N[(z * z + z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision]}, N[(x$95$s * N[(y$95$s * If[LessEqual[z, -1.75e-19], t$95$0, If[LessEqual[z, 2e-45], N[(N[(N[(x$95$m / z), $MachinePrecision] * y$95$m), $MachinePrecision] / z), $MachinePrecision], t$95$0]]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.75000000000000008e-19 or 1.99999999999999997e-45 < z

   1. Initial program 87.1%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 91.9

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

      7. lift-*.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. associate-*l* N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lift-+.f64 N/A

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

      14. distribute-lft1-in N/A

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

      15. lower-fma.f64 91.9

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

   4. Applied rewrites 91.9%

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

   if -1.75000000000000008e-19 < z < 1.99999999999999997e-45

   1. Initial program 80.7%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. times-frac N/A

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

      5. lift-*.f64 N/A

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

      6. associate-/r* N/A

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

      7. associate-*l/ N/A

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

      8. clear-num N/A

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

      9. inv-pow N/A

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

      10. clear-num N/A

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

      11. inv-pow N/A

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

      12. unpow-prod-down N/A

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

      13. times-frac N/A

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

      14. lift-*.f64 N/A

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

      15. lower-/.f64 N/A

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

   4. Applied rewrites 96.9%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. clear-num N/A

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

      4. associate-/r/ N/A

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

      5. associate-*r* N/A

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

      6. div-inv N/A

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

      7. lift-/.f64 N/A

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

      8. associate-/r* N/A

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

      9. lift-+.f64 N/A

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

      10. +-commutative N/A

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

      11. distribute-lft1-in N/A

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

      12. lift-fma.f64 N/A

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

      13. lower-*.f64 N/A

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

      14. lower-/.f64 97.0

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

   6. Applied rewrites 97.0%

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

   7. Taylor expanded in z around 0

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

      1. lower-/.f64 97.0

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

   9. Applied rewrites 97.0%

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

Alternative 11: 91.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ [x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\ \\ \begin{array}{l} t_0 := \mathsf{fma}\left(z, z, z\right) \cdot z\\ x\_s \cdot \left(y\_s \cdot \begin{array}{l} \mathbf{if}\;z \leq -6.8 \cdot 10^{-90}:\\ \;\;\;\;\frac{x\_m}{t\_0} \cdot y\_m\\ \mathbf{elif}\;z \leq 3.2 \cdot 10^{-18}:\\ \;\;\;\;\frac{y\_m}{z} \cdot \frac{x\_m}{z}\\ \mathbf{else}:\\ \;\;\;\;\frac{y\_m}{t\_0} \cdot x\_m\\ \end{array}\right) \end{array} \end{array} \]

FPCore

y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
 :precision binary64
 (let* ((t_0 (* (fma z z z) z)))
   (*
    x_s
    (*
     y_s
     (if (<= z -6.8e-90)
       (* (/ x_m t_0) y_m)
       (if (<= z 3.2e-18) (* (/ y_m z) (/ x_m z)) (* (/ y_m t_0) x_m)))))))

C

y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
	double t_0 = fma(z, z, z) * z;
	double tmp;
	if (z <= -6.8e-90) {
		tmp = (x_m / t_0) * y_m;
	} else if (z <= 3.2e-18) {
		tmp = (y_m / z) * (x_m / z);
	} else {
		tmp = (y_m / t_0) * x_m;
	}
	return x_s * (y_s * tmp);
}

Julia

y\_m = abs(y)
y\_s = copysign(1.0, y)
x\_m = abs(x)
x\_s = copysign(1.0, x)
x_m, y_m, z = sort([x_m, y_m, z])
function code(x_s, y_s, x_m, y_m, z)
	t_0 = Float64(fma(z, z, z) * z)
	tmp = 0.0
	if (z <= -6.8e-90)
		tmp = Float64(Float64(x_m / t_0) * y_m);
	elseif (z <= 3.2e-18)
		tmp = Float64(Float64(y_m / z) * Float64(x_m / z));
	else
		tmp = Float64(Float64(y_m / t_0) * x_m);
	end
	return Float64(x_s * Float64(y_s * tmp))
end

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
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_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(N[(z * z + z), $MachinePrecision] * z), $MachinePrecision]}, N[(x$95$s * N[(y$95$s * If[LessEqual[z, -6.8e-90], N[(N[(x$95$m / t$95$0), $MachinePrecision] * y$95$m), $MachinePrecision], If[LessEqual[z, 3.2e-18], N[(N[(y$95$m / z), $MachinePrecision] * N[(x$95$m / z), $MachinePrecision]), $MachinePrecision], N[(N[(y$95$m / t$95$0), $MachinePrecision] * x$95$m), $MachinePrecision]]]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if z < -6.79999999999999988e-90

   1. Initial program 91.9%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 95.2

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

      8. lift-*.f64 N/A

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

      9. lift-*.f64 N/A

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

      10. associate-*l* N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 N/A

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

      13. *-commutative N/A

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

      14. lift-+.f64 N/A

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

      15. distribute-lft1-in N/A

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

      16. lower-fma.f64 95.2

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

   4. Applied rewrites 95.2%

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

   if -6.79999999999999988e-90 < z < 3.1999999999999999e-18

   1. Initial program 77.7%

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

   3. Taylor expanded in z around 0

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 74.3

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

   5. Applied rewrites 74.3%

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

   7. Applied rewrites 98.8%

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

   if 3.1999999999999999e-18 < z

   1. Initial program 84.6%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 88.1

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

      7. lift-*.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. associate-*l* N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lift-+.f64 N/A

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

      14. distribute-lft1-in N/A

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

      15. lower-fma.f64 88.1

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

   4. Applied rewrites 88.1%

      \[\leadsto \color{blue}{\frac{y}{\mathsf{fma}\left(z, z, z\right) \cdot z} \cdot x} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 12: 91.2% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
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_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[z, -6.8e-90], N[(N[(x$95$m / N[(N[(z * z + z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] * y$95$m), $MachinePrecision], If[LessEqual[z, 1.0], N[(N[(y$95$m / z), $MachinePrecision] * N[(x$95$m / z), $MachinePrecision]), $MachinePrecision], N[(N[(y$95$m / N[(N[(z * z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision]]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if z < -6.79999999999999988e-90

   1. Initial program 91.9%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 95.2

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

      8. lift-*.f64 N/A

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

      9. lift-*.f64 N/A

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

      10. associate-*l* N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 N/A

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

      13. *-commutative N/A

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

      14. lift-+.f64 N/A

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

      15. distribute-lft1-in N/A

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

      16. lower-fma.f64 95.2

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

   4. Applied rewrites 95.2%

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

   if -6.79999999999999988e-90 < z < 1

   1. Initial program 78.6%

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

   3. Taylor expanded in z around 0

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 74.8

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

   5. Applied rewrites 74.8%

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

   7. Applied rewrites 98.3%

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

   if 1 < z

   1. Initial program 83.9%

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

   3. Taylor expanded in z around inf

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

      1. unpow3 N/A

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

      2. unpow2 N/A

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

      3. lower-*.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 81.6

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

   5. Applied rewrites 81.6%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 85.2

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

   7. Applied rewrites 85.2%

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

Alternative 13: 92.1% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
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_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(N[(y$95$m / N[(N[(z * z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision]}, N[(x$95$s * N[(y$95$s * If[LessEqual[z, -1.0], t$95$0, If[LessEqual[z, 1.0], N[(y$95$m / N[(N[(z / x$95$m), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision], t$95$0]]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1 or 1 < z

   1. Initial program 87.3%

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

   3. Taylor expanded in z around inf

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

      1. unpow3 N/A

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

      2. unpow2 N/A

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

      3. lower-*.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 85.4

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

   5. Applied rewrites 85.4%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 89.3

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

   7. Applied rewrites 89.3%

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

   if -1 < z < 1

   1. Initial program 81.0%

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

   3. Taylor expanded in z around 0

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 76.9

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

   5. Applied rewrites 76.9%

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

   7. Applied rewrites 80.2%

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

   9. Applied rewrites 86.4%

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

   11. Applied rewrites 87.3%

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

Alternative 14: 84.2% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
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_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(N[(x$95$m / N[(N[(z * z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] * y$95$m), $MachinePrecision]}, N[(x$95$s * N[(y$95$s * If[LessEqual[z, -1.0], t$95$0, If[LessEqual[z, 1.0], N[(N[(x$95$m / N[(z * z), $MachinePrecision]), $MachinePrecision] * y$95$m), $MachinePrecision], t$95$0]]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1 or 1 < z

   1. Initial program 87.3%

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

   3. Taylor expanded in z around inf

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

      1. associate-*l/ N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. unpow3 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 N/A

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

      7. unpow2 N/A

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

      8. lower-*.f64 88.9

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

   5. Applied rewrites 88.9%

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

   if -1 < z < 1

   1. Initial program 81.0%

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

   3. Taylor expanded in z around 0

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 76.9

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

   5. Applied rewrites 76.9%

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

   7. Applied rewrites 80.2%

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

Alternative 15: 93.8% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
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_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * N[(N[(y$95$m / z), $MachinePrecision] * N[(x$95$m / N[(z * z + z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 84.5%

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

   1. lift-/.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. *-commutative N/A

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

   4. lift-*.f64 N/A

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

   5. lift-*.f64 N/A

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

   6. associate-*l* N/A

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

   7. times-frac N/A

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

   8. lower-*.f64 N/A

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

   9. lower-/.f64 N/A

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

   10. lower-/.f64 N/A

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

   11. *-commutative N/A

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

   12. lift-+.f64 N/A

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

   13. distribute-lft1-in N/A

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

   14. lower-fma.f64 95.5

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

4. Applied rewrites 95.5%

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

Alternative 16: 75.7% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
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_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * N[(N[(x$95$m / N[(z * z), $MachinePrecision]), $MachinePrecision] * y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 84.5%

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

3. Taylor expanded in z around 0

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

   1. associate-/l* N/A

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

   2. *-commutative N/A

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

   3. lower-*.f64 N/A

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

   4. lower-/.f64 N/A

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

   5. unpow2 N/A

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

   6. lower-*.f64 71.7

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

5. Applied rewrites 71.7%

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

7. Applied rewrites 73.7%

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

Developer Target 1: 96.6% accurate, 0.6× 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 2024235 
(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))))