Statistics.Math.RootFinding:ridders from math-functions-0.1.5.2

Percentage Accurate: 61.4% → 92.0%

Time: 11.3s

Alternatives: 9

Speedup: 7.5×

Specification

Math

\[\begin{array}{l} \\ \frac{\left(x \cdot y\right) \cdot z}{\sqrt{z \cdot z - t \cdot a}} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (/ (* (* x y) z) (sqrt (- (* z z) (* t a)))))

C

double code(double x, double y, double z, double t, double a) {
	return ((x * y) * z) / sqrt(((z * z) - (t * a)));
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    code = ((x * y) * z) / sqrt(((z * z) - (t * a)))
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	return ((x * y) * z) / Math.sqrt(((z * z) - (t * a)));
}

Python

def code(x, y, z, t, a):
	return ((x * y) * z) / math.sqrt(((z * z) - (t * a)))

Julia

function code(x, y, z, t, a)
	return Float64(Float64(Float64(x * y) * z) / sqrt(Float64(Float64(z * z) - Float64(t * a))))
end

MATLAB

function tmp = code(x, y, z, t, a)
	tmp = ((x * y) * z) / sqrt(((z * z) - (t * a)));
end

Wolfram

code[x_, y_, z_, t_, a_] := N[(N[(N[(x * y), $MachinePrecision] * z), $MachinePrecision] / N[Sqrt[N[(N[(z * z), $MachinePrecision] - N[(t * a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Initial Program: 61.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{\left(x \cdot y\right) \cdot z}{\sqrt{z \cdot z - t \cdot a}} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (/ (* (* x y) z) (sqrt (- (* z z) (* t a)))))

C

double code(double x, double y, double z, double t, double a) {
	return ((x * y) * z) / sqrt(((z * z) - (t * a)));
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    code = ((x * y) * z) / sqrt(((z * z) - (t * a)))
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	return ((x * y) * z) / Math.sqrt(((z * z) - (t * a)));
}

Python

def code(x, y, z, t, a):
	return ((x * y) * z) / math.sqrt(((z * z) - (t * a)))

Julia

function code(x, y, z, t, a)
	return Float64(Float64(Float64(x * y) * z) / sqrt(Float64(Float64(z * z) - Float64(t * a))))
end

MATLAB

function tmp = code(x, y, z, t, a)
	tmp = ((x * y) * z) / sqrt(((z * z) - (t * a)));
end

Wolfram

code[x_, y_, z_, t_, a_] := N[(N[(N[(x * y), $MachinePrecision] * z), $MachinePrecision] / N[Sqrt[N[(N[(z * z), $MachinePrecision] - N[(t * a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Alternative 1: 92.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} z\_m = \left|z\right| \\ z\_s = \mathsf{copysign}\left(1, z\right) \\ 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_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\ \\ x\_s \cdot \left(y\_s \cdot \left(z\_s \cdot \begin{array}{l} \mathbf{if}\;z\_m \leq 1.65 \cdot 10^{+87}:\\ \;\;\;\;x\_m \cdot \left(y\_m \cdot \frac{z\_m}{\sqrt{\mathsf{fma}\left(-a, t, z\_m \cdot z\_m\right)}}\right)\\ \mathbf{else}:\\ \;\;\;\;x\_m \cdot y\_m\\ \end{array}\right)\right) \end{array} \]

FPCore

z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
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, z_m, t, and a should be sorted in increasing order before calling this function.
(FPCore (x_s y_s z_s x_m y_m z_m t a)
 :precision binary64
 (*
  x_s
  (*
   y_s
   (*
    z_s
    (if (<= z_m 1.65e+87)
      (* x_m (* y_m (/ z_m (sqrt (fma (- a) t (* z_m z_m))))))
      (* x_m y_m))))))

C

z\_m = fabs(z);
z\_s = copysign(1.0, z);
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_m && z_m < t && t < a);
double code(double x_s, double y_s, double z_s, double x_m, double y_m, double z_m, double t, double a) {
	double tmp;
	if (z_m <= 1.65e+87) {
		tmp = x_m * (y_m * (z_m / sqrt(fma(-a, t, (z_m * z_m)))));
	} else {
		tmp = x_m * y_m;
	}
	return x_s * (y_s * (z_s * tmp));
}

Julia

z\_m = abs(z)
z\_s = copysign(1.0, z)
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_m, t, a = sort([x_m, y_m, z_m, t, a])
function code(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
	tmp = 0.0
	if (z_m <= 1.65e+87)
		tmp = Float64(x_m * Float64(y_m * Float64(z_m / sqrt(fma(Float64(-a), t, Float64(z_m * z_m))))));
	else
		tmp = Float64(x_m * y_m);
	end
	return Float64(x_s * Float64(y_s * Float64(z_s * tmp)))
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < 1.6500000000000001e87

   1. Initial program 66.6%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*l* N/A

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

      5. associate-/l* N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

   4. Applied rewrites 74.1%

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

   if 1.6500000000000001e87 < z

   1. Initial program 37.9%

      \[\frac{\left(x \cdot y\right) \cdot z}{\sqrt{z \cdot z - t \cdot a}} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 100.0

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

   5. Applied rewrites 100.0%

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

4. Final simplification 79.7%

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

Alternative 2: 91.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} z\_m = \left|z\right| \\ z\_s = \mathsf{copysign}\left(1, z\right) \\ 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_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\ \\ x\_s \cdot \left(y\_s \cdot \left(z\_s \cdot \begin{array}{l} \mathbf{if}\;z\_m \leq 8 \cdot 10^{+38}:\\ \;\;\;\;\frac{x\_m}{\sqrt{\mathsf{fma}\left(-a, t, z\_m \cdot z\_m\right)}} \cdot \left(y\_m \cdot z\_m\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{z\_m}{\mathsf{fma}\left(\frac{a}{z\_m}, -0.5 \cdot t, z\_m\right)} \cdot \left(x\_m \cdot y\_m\right)\\ \end{array}\right)\right) \end{array} \]

FPCore

z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
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, z_m, t, and a should be sorted in increasing order before calling this function.
(FPCore (x_s y_s z_s x_m y_m z_m t a)
 :precision binary64
 (*
  x_s
  (*
   y_s
   (*
    z_s
    (if (<= z_m 8e+38)
      (* (/ x_m (sqrt (fma (- a) t (* z_m z_m)))) (* y_m z_m))
      (* (/ z_m (fma (/ a z_m) (* -0.5 t) z_m)) (* x_m y_m)))))))

C

z\_m = fabs(z);
z\_s = copysign(1.0, z);
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_m && z_m < t && t < a);
double code(double x_s, double y_s, double z_s, double x_m, double y_m, double z_m, double t, double a) {
	double tmp;
	if (z_m <= 8e+38) {
		tmp = (x_m / sqrt(fma(-a, t, (z_m * z_m)))) * (y_m * z_m);
	} else {
		tmp = (z_m / fma((a / z_m), (-0.5 * t), z_m)) * (x_m * y_m);
	}
	return x_s * (y_s * (z_s * tmp));
}

Julia

z\_m = abs(z)
z\_s = copysign(1.0, z)
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_m, t, a = sort([x_m, y_m, z_m, t, a])
function code(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
	tmp = 0.0
	if (z_m <= 8e+38)
		tmp = Float64(Float64(x_m / sqrt(fma(Float64(-a), t, Float64(z_m * z_m)))) * Float64(y_m * z_m));
	else
		tmp = Float64(Float64(z_m / fma(Float64(a / z_m), Float64(-0.5 * t), z_m)) * Float64(x_m * y_m));
	end
	return Float64(x_s * Float64(y_s * Float64(z_s * tmp)))
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < 7.99999999999999982e38

   1. Initial program 65.2%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*l* N/A

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

      5. *-commutative N/A

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

      6. associate-/l* N/A

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

      7. lower-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower-/.f64 67.1

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

      11. lift--.f64 N/A

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

      12. sub-neg N/A

          \[\leadsto \left(z \cdot y\right) \cdot \frac{x}{\sqrt{\color{blue}{z \cdot z + \left(\mathsf{neg}\left(t \cdot a\right)\right)}}} \]

      13. +-commutative N/A

          \[\leadsto \left(z \cdot y\right) \cdot \frac{x}{\sqrt{\color{blue}{\left(\mathsf{neg}\left(t \cdot a\right)\right) + z \cdot z}}} \]

      14. lift-*.f64 N/A

          \[\leadsto \left(z \cdot y\right) \cdot \frac{x}{\sqrt{\left(\mathsf{neg}\left(\color{blue}{t \cdot a}\right)\right) + z \cdot z}} \]

      15. *-commutative N/A

          \[\leadsto \left(z \cdot y\right) \cdot \frac{x}{\sqrt{\left(\mathsf{neg}\left(\color{blue}{a \cdot t}\right)\right) + z \cdot z}} \]

      16. distribute-lft-neg-in N/A

          \[\leadsto \left(z \cdot y\right) \cdot \frac{x}{\sqrt{\color{blue}{\left(\mathsf{neg}\left(a\right)\right) \cdot t} + z \cdot z}} \]

      17. lower-fma.f64 N/A

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

      18. lower-neg.f64 67.1

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

   4. Applied rewrites 67.1%

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

   if 7.99999999999999982e38 < z

   1. Initial program 45.7%

      \[\frac{\left(x \cdot y\right) \cdot z}{\sqrt{z \cdot z - t \cdot a}} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. associate-*r/ N/A

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

      3. associate-*r* N/A

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

      4. associate-*l/ N/A

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

      5. associate-*r/ N/A

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

      6. *-commutative N/A

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

      7. associate-*r* N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 N/A

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

      10. lower-*.f64 N/A

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

      11. lower-/.f64 78.6

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

   5. Applied rewrites 78.6%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 99.8

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

      7. lift-*.f64 N/A

         \[\leadsto \frac{z}{\mathsf{Rewrite=>}\left(lower-fma.f64, \left(\mathsf{fma}\left(\frac{a}{z}, \frac{-1}{2} \cdot t, z\right)\right)\right)} \cdot \color{blue}{\left(x \cdot y\right)} \]

      8. *-commutative N/A

         \[\leadsto \frac{z}{\mathsf{Rewrite=>}\left(lower-fma.f64, \left(\mathsf{fma}\left(\frac{a}{z}, \frac{-1}{2} \cdot t, z\right)\right)\right)} \cdot \color{blue}{\left(y \cdot x\right)} \]

      9. lift-*.f64 N/A

         \[\leadsto \frac{z}{\mathsf{Rewrite=>}\left(lower-fma.f64, \left(\mathsf{fma}\left(\frac{a}{z}, \frac{-1}{2} \cdot t, z\right)\right)\right)} \cdot \color{blue}{\left(y \cdot x\right)} \]

   7. Applied rewrites 99.8%

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

4. Final simplification 75.1%

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

Alternative 3: 85.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} z\_m = \left|z\right| \\ z\_s = \mathsf{copysign}\left(1, z\right) \\ 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_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\ \\ x\_s \cdot \left(y\_s \cdot \left(z\_s \cdot \begin{array}{l} \mathbf{if}\;z\_m \leq 6.6 \cdot 10^{-124}:\\ \;\;\;\;\frac{y\_m \cdot z\_m}{\sqrt{t \cdot \left(-a\right)}} \cdot x\_m\\ \mathbf{else}:\\ \;\;\;\;\frac{z\_m}{\mathsf{fma}\left(\frac{a}{z\_m}, -0.5 \cdot t, z\_m\right)} \cdot \left(x\_m \cdot y\_m\right)\\ \end{array}\right)\right) \end{array} \]

FPCore

z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
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, z_m, t, and a should be sorted in increasing order before calling this function.
(FPCore (x_s y_s z_s x_m y_m z_m t a)
 :precision binary64
 (*
  x_s
  (*
   y_s
   (*
    z_s
    (if (<= z_m 6.6e-124)
      (* (/ (* y_m z_m) (sqrt (* t (- a)))) x_m)
      (* (/ z_m (fma (/ a z_m) (* -0.5 t) z_m)) (* x_m y_m)))))))

C

z\_m = fabs(z);
z\_s = copysign(1.0, z);
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_m && z_m < t && t < a);
double code(double x_s, double y_s, double z_s, double x_m, double y_m, double z_m, double t, double a) {
	double tmp;
	if (z_m <= 6.6e-124) {
		tmp = ((y_m * z_m) / sqrt((t * -a))) * x_m;
	} else {
		tmp = (z_m / fma((a / z_m), (-0.5 * t), z_m)) * (x_m * y_m);
	}
	return x_s * (y_s * (z_s * tmp));
}

Julia

z\_m = abs(z)
z\_s = copysign(1.0, z)
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_m, t, a = sort([x_m, y_m, z_m, t, a])
function code(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
	tmp = 0.0
	if (z_m <= 6.6e-124)
		tmp = Float64(Float64(Float64(y_m * z_m) / sqrt(Float64(t * Float64(-a)))) * x_m);
	else
		tmp = Float64(Float64(z_m / fma(Float64(a / z_m), Float64(-0.5 * t), z_m)) * Float64(x_m * y_m));
	end
	return Float64(x_s * Float64(y_s * Float64(z_s * tmp)))
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < 6.59999999999999969e-124

   1. Initial program 60.1%

      \[\frac{\left(x \cdot y\right) \cdot z}{\sqrt{z \cdot z - t \cdot a}} \]
   2. Add Preprocessing

   3. Taylor expanded in a around inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

         \[\leadsto \frac{\left(x \cdot y\right) \cdot z}{\sqrt{\color{blue}{\left(\mathsf{neg}\left(a\right)\right)} \cdot t}} \]

      4. lower-neg.f64 31.0

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

   5. Applied rewrites 31.0%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*l* N/A

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

      5. *-commutative N/A

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

      6. lift-*.f64 N/A

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

      7. associate-/l* N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower-/.f64 34.4

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

      11. lift-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 34.4

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

   7. Applied rewrites 34.4%

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

   if 6.59999999999999969e-124 < z

   1. Initial program 61.0%

      \[\frac{\left(x \cdot y\right) \cdot z}{\sqrt{z \cdot z - t \cdot a}} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. associate-*r/ N/A

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

      3. associate-*r* N/A

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

      4. associate-*l/ N/A

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

      5. associate-*r/ N/A

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

      6. *-commutative N/A

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

      7. associate-*r* N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 N/A

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

      10. lower-*.f64 N/A

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

      11. lower-/.f64 71.0

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

   5. Applied rewrites 71.0%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 85.9

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

      7. lift-*.f64 N/A

         \[\leadsto \frac{z}{\mathsf{Rewrite=>}\left(lower-fma.f64, \left(\mathsf{fma}\left(\frac{a}{z}, \frac{-1}{2} \cdot t, z\right)\right)\right)} \cdot \color{blue}{\left(x \cdot y\right)} \]

      8. *-commutative N/A

         \[\leadsto \frac{z}{\mathsf{Rewrite=>}\left(lower-fma.f64, \left(\mathsf{fma}\left(\frac{a}{z}, \frac{-1}{2} \cdot t, z\right)\right)\right)} \cdot \color{blue}{\left(y \cdot x\right)} \]

      9. lift-*.f64 N/A

         \[\leadsto \frac{z}{\mathsf{Rewrite=>}\left(lower-fma.f64, \left(\mathsf{fma}\left(\frac{a}{z}, \frac{-1}{2} \cdot t, z\right)\right)\right)} \cdot \color{blue}{\left(y \cdot x\right)} \]

   7. Applied rewrites 85.9%

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

4. Final simplification 53.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq 6.6 \cdot 10^{-124}:\\ \;\;\;\;\frac{y \cdot z}{\sqrt{t \cdot \left(-a\right)}} \cdot x\\ \mathbf{else}:\\ \;\;\;\;\frac{z}{\mathsf{fma}\left(\frac{a}{z}, -0.5 \cdot t, z\right)} \cdot \left(x \cdot y\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 84.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} z\_m = \left|z\right| \\ z\_s = \mathsf{copysign}\left(1, z\right) \\ 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_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\ \\ x\_s \cdot \left(y\_s \cdot \left(z\_s \cdot \begin{array}{l} \mathbf{if}\;z\_m \leq 10^{-99}:\\ \;\;\;\;\frac{y\_m \cdot z\_m}{\sqrt{t \cdot \left(-a\right)}} \cdot x\_m\\ \mathbf{else}:\\ \;\;\;\;x\_m \cdot y\_m\\ \end{array}\right)\right) \end{array} \]

FPCore

z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
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, z_m, t, and a should be sorted in increasing order before calling this function.
(FPCore (x_s y_s z_s x_m y_m z_m t a)
 :precision binary64
 (*
  x_s
  (*
   y_s
   (*
    z_s
    (if (<= z_m 1e-99)
      (* (/ (* y_m z_m) (sqrt (* t (- a)))) x_m)
      (* x_m y_m))))))

C

z\_m = fabs(z);
z\_s = copysign(1.0, z);
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_m && z_m < t && t < a);
double code(double x_s, double y_s, double z_s, double x_m, double y_m, double z_m, double t, double a) {
	double tmp;
	if (z_m <= 1e-99) {
		tmp = ((y_m * z_m) / sqrt((t * -a))) * x_m;
	} else {
		tmp = x_m * y_m;
	}
	return x_s * (y_s * (z_s * tmp));
}

Fortran

z\_m = abs(z)
z\_s = copysign(1.0d0, z)
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, z_m, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: y_s
    real(8), intent (in) :: z_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z_m
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if (z_m <= 1d-99) then
        tmp = ((y_m * z_m) / sqrt((t * -a))) * x_m
    else
        tmp = x_m * y_m
    end if
    code = x_s * (y_s * (z_s * tmp))
end function

Java

z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
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_m && z_m < t && t < a;
public static double code(double x_s, double y_s, double z_s, double x_m, double y_m, double z_m, double t, double a) {
	double tmp;
	if (z_m <= 1e-99) {
		tmp = ((y_m * z_m) / Math.sqrt((t * -a))) * x_m;
	} else {
		tmp = x_m * y_m;
	}
	return x_s * (y_s * (z_s * tmp));
}

Python

z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
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_m, t, a] = sort([x_m, y_m, z_m, t, a])
def code(x_s, y_s, z_s, x_m, y_m, z_m, t, a):
	tmp = 0
	if z_m <= 1e-99:
		tmp = ((y_m * z_m) / math.sqrt((t * -a))) * x_m
	else:
		tmp = x_m * y_m
	return x_s * (y_s * (z_s * tmp))

Julia

z\_m = abs(z)
z\_s = copysign(1.0, z)
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_m, t, a = sort([x_m, y_m, z_m, t, a])
function code(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
	tmp = 0.0
	if (z_m <= 1e-99)
		tmp = Float64(Float64(Float64(y_m * z_m) / sqrt(Float64(t * Float64(-a)))) * x_m);
	else
		tmp = Float64(x_m * y_m);
	end
	return Float64(x_s * Float64(y_s * Float64(z_s * tmp)))
end

MATLAB

z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
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_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
function tmp_2 = code(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
	tmp = 0.0;
	if (z_m <= 1e-99)
		tmp = ((y_m * z_m) / sqrt((t * -a))) * x_m;
	else
		tmp = x_m * y_m;
	end
	tmp_2 = x_s * (y_s * (z_s * tmp));
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < 1e-99

   1. Initial program 60.8%

      \[\frac{\left(x \cdot y\right) \cdot z}{\sqrt{z \cdot z - t \cdot a}} \]
   2. Add Preprocessing

   3. Taylor expanded in a around inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

         \[\leadsto \frac{\left(x \cdot y\right) \cdot z}{\sqrt{\color{blue}{\left(\mathsf{neg}\left(a\right)\right)} \cdot t}} \]

      4. lower-neg.f64 32.3

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

   5. Applied rewrites 32.3%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*l* N/A

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

      5. *-commutative N/A

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

      6. lift-*.f64 N/A

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

      7. associate-/l* N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower-/.f64 35.6

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

      11. lift-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 35.6

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

   7. Applied rewrites 35.6%

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

   if 1e-99 < z

   1. Initial program 59.8%

      \[\frac{\left(x \cdot y\right) \cdot z}{\sqrt{z \cdot z - t \cdot a}} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 87.2

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

   5. Applied rewrites 87.2%

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

4. Final simplification 54.1%

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

Alternative 5: 84.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} z\_m = \left|z\right| \\ z\_s = \mathsf{copysign}\left(1, z\right) \\ 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_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\ \\ x\_s \cdot \left(y\_s \cdot \left(z\_s \cdot \begin{array}{l} \mathbf{if}\;z\_m \leq 10^{-99}:\\ \;\;\;\;\frac{x\_m}{\sqrt{t \cdot \left(-a\right)}} \cdot \left(y\_m \cdot z\_m\right)\\ \mathbf{else}:\\ \;\;\;\;x\_m \cdot y\_m\\ \end{array}\right)\right) \end{array} \]

FPCore

z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
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, z_m, t, and a should be sorted in increasing order before calling this function.
(FPCore (x_s y_s z_s x_m y_m z_m t a)
 :precision binary64
 (*
  x_s
  (*
   y_s
   (*
    z_s
    (if (<= z_m 1e-99)
      (* (/ x_m (sqrt (* t (- a)))) (* y_m z_m))
      (* x_m y_m))))))

C

z\_m = fabs(z);
z\_s = copysign(1.0, z);
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_m && z_m < t && t < a);
double code(double x_s, double y_s, double z_s, double x_m, double y_m, double z_m, double t, double a) {
	double tmp;
	if (z_m <= 1e-99) {
		tmp = (x_m / sqrt((t * -a))) * (y_m * z_m);
	} else {
		tmp = x_m * y_m;
	}
	return x_s * (y_s * (z_s * tmp));
}

Fortran

z\_m = abs(z)
z\_s = copysign(1.0d0, z)
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, z_m, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: y_s
    real(8), intent (in) :: z_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z_m
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if (z_m <= 1d-99) then
        tmp = (x_m / sqrt((t * -a))) * (y_m * z_m)
    else
        tmp = x_m * y_m
    end if
    code = x_s * (y_s * (z_s * tmp))
end function

Java

z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
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_m && z_m < t && t < a;
public static double code(double x_s, double y_s, double z_s, double x_m, double y_m, double z_m, double t, double a) {
	double tmp;
	if (z_m <= 1e-99) {
		tmp = (x_m / Math.sqrt((t * -a))) * (y_m * z_m);
	} else {
		tmp = x_m * y_m;
	}
	return x_s * (y_s * (z_s * tmp));
}

Python

z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
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_m, t, a] = sort([x_m, y_m, z_m, t, a])
def code(x_s, y_s, z_s, x_m, y_m, z_m, t, a):
	tmp = 0
	if z_m <= 1e-99:
		tmp = (x_m / math.sqrt((t * -a))) * (y_m * z_m)
	else:
		tmp = x_m * y_m
	return x_s * (y_s * (z_s * tmp))

Julia

z\_m = abs(z)
z\_s = copysign(1.0, z)
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_m, t, a = sort([x_m, y_m, z_m, t, a])
function code(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
	tmp = 0.0
	if (z_m <= 1e-99)
		tmp = Float64(Float64(x_m / sqrt(Float64(t * Float64(-a)))) * Float64(y_m * z_m));
	else
		tmp = Float64(x_m * y_m);
	end
	return Float64(x_s * Float64(y_s * Float64(z_s * tmp)))
end

MATLAB

z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
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_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
function tmp_2 = code(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
	tmp = 0.0;
	if (z_m <= 1e-99)
		tmp = (x_m / sqrt((t * -a))) * (y_m * z_m);
	else
		tmp = x_m * y_m;
	end
	tmp_2 = x_s * (y_s * (z_s * tmp));
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < 1e-99

   1. Initial program 60.8%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*l* N/A

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

      5. associate-/l* N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

   4. Applied rewrites 69.5%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. associate-*r* N/A

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

      6. lift-*.f64 N/A

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

      7. lift-/.f64 N/A

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

      8. div-inv N/A

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

      9. metadata-eval N/A

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

      10. lift-sqrt.f64 N/A

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

      11. sqrt-div N/A

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

      12. lift-/.f64 N/A

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

      13. lift-sqrt.f64 N/A

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

      14. associate-*r* N/A

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

      15. lift-*.f64 N/A

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

      16. associate-*l* N/A

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

      17. *-commutative N/A

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

      18. lift-*.f64 N/A

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

   6. Applied rewrites 64.4%

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

   7. Taylor expanded in a around inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

         \[\leadsto \frac{x}{\sqrt{\color{blue}{\left(\mathsf{neg}\left(a\right)\right)} \cdot t}} \cdot \left(z \cdot y\right) \]

      4. lower-neg.f64 34.4

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

   9. Applied rewrites 34.4%

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

   if 1e-99 < z

   1. Initial program 59.8%

      \[\frac{\left(x \cdot y\right) \cdot z}{\sqrt{z \cdot z - t \cdot a}} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 87.2

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

   5. Applied rewrites 87.2%

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

4. Final simplification 53.3%

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

Alternative 6: 76.0% accurate, 1.1× speedup

Math

\[\begin{array}{l} z\_m = \left|z\right| \\ z\_s = \mathsf{copysign}\left(1, z\right) \\ 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_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\ \\ x\_s \cdot \left(y\_s \cdot \left(z\_s \cdot \begin{array}{l} \mathbf{if}\;t \cdot a \leq -2.6 \cdot 10^{-63}:\\ \;\;\;\;\left(-y\_m\right) \cdot \left(\left(x\_m \cdot z\_m\right) \cdot \frac{-1}{z\_m}\right)\\ \mathbf{else}:\\ \;\;\;\;x\_m \cdot y\_m\\ \end{array}\right)\right) \end{array} \]

FPCore

z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
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, z_m, t, and a should be sorted in increasing order before calling this function.
(FPCore (x_s y_s z_s x_m y_m z_m t a)
 :precision binary64
 (*
  x_s
  (*
   y_s
   (*
    z_s
    (if (<= (* t a) -2.6e-63)
      (* (- y_m) (* (* x_m z_m) (/ -1.0 z_m)))
      (* x_m y_m))))))

C

z\_m = fabs(z);
z\_s = copysign(1.0, z);
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_m && z_m < t && t < a);
double code(double x_s, double y_s, double z_s, double x_m, double y_m, double z_m, double t, double a) {
	double tmp;
	if ((t * a) <= -2.6e-63) {
		tmp = -y_m * ((x_m * z_m) * (-1.0 / z_m));
	} else {
		tmp = x_m * y_m;
	}
	return x_s * (y_s * (z_s * tmp));
}

Fortran

z\_m = abs(z)
z\_s = copysign(1.0d0, z)
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, z_m, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: y_s
    real(8), intent (in) :: z_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z_m
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if ((t * a) <= (-2.6d-63)) then
        tmp = -y_m * ((x_m * z_m) * ((-1.0d0) / z_m))
    else
        tmp = x_m * y_m
    end if
    code = x_s * (y_s * (z_s * tmp))
end function

Java

z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
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_m && z_m < t && t < a;
public static double code(double x_s, double y_s, double z_s, double x_m, double y_m, double z_m, double t, double a) {
	double tmp;
	if ((t * a) <= -2.6e-63) {
		tmp = -y_m * ((x_m * z_m) * (-1.0 / z_m));
	} else {
		tmp = x_m * y_m;
	}
	return x_s * (y_s * (z_s * tmp));
}

Python

z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
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_m, t, a] = sort([x_m, y_m, z_m, t, a])
def code(x_s, y_s, z_s, x_m, y_m, z_m, t, a):
	tmp = 0
	if (t * a) <= -2.6e-63:
		tmp = -y_m * ((x_m * z_m) * (-1.0 / z_m))
	else:
		tmp = x_m * y_m
	return x_s * (y_s * (z_s * tmp))

Julia

z\_m = abs(z)
z\_s = copysign(1.0, z)
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_m, t, a = sort([x_m, y_m, z_m, t, a])
function code(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
	tmp = 0.0
	if (Float64(t * a) <= -2.6e-63)
		tmp = Float64(Float64(-y_m) * Float64(Float64(x_m * z_m) * Float64(-1.0 / z_m)));
	else
		tmp = Float64(x_m * y_m);
	end
	return Float64(x_s * Float64(y_s * Float64(z_s * tmp)))
end

MATLAB

z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
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_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
function tmp_2 = code(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
	tmp = 0.0;
	if ((t * a) <= -2.6e-63)
		tmp = -y_m * ((x_m * z_m) * (-1.0 / z_m));
	else
		tmp = x_m * y_m;
	end
	tmp_2 = x_s * (y_s * (z_s * tmp));
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 t a) < -2.6000000000000001e-63

   1. Initial program 66.4%

      \[\frac{\left(x \cdot y\right) \cdot z}{\sqrt{z \cdot z - t \cdot a}} \]
   2. Add Preprocessing

   3. Taylor expanded in z around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 42.2

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

   5. Applied rewrites 42.2%

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. div-inv N/A

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

      4. lift-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. associate-*l* N/A

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

      7. *-commutative N/A

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

      8. lift-*.f64 N/A

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

      9. *-commutative N/A

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

      10. distribute-lft-neg-in N/A

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

      11. associate-*l* N/A

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

      12. lower-*.f64 N/A

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

      13. lift-*.f64 N/A

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

      14. distribute-lft-neg-in N/A

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

      15. lift-neg.f64 N/A

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

      16. lower-*.f64 N/A

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

      17. lower-*.f64 N/A

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

      18. frac-2neg N/A

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

   7. Applied rewrites 34.1%

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

   8. Taylor expanded in a around 0

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

      1. lower-/.f64 28.3

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

   10. Applied rewrites 28.3%

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

       1. lift-*.f64 N/A

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

       2. *-commutative N/A

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

       3. lift-*.f64 N/A

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

       4. associate-*r* N/A

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

       5. lower-*.f64 N/A

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

   12. Applied rewrites 28.0%

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

   if -2.6000000000000001e-63 < (*.f64 t a)

   1. Initial program 57.1%

      \[\frac{\left(x \cdot y\right) \cdot z}{\sqrt{z \cdot z - t \cdot a}} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 52.5

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

   5. Applied rewrites 52.5%

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

4. Final simplification 43.8%

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

Alternative 7: 73.1% accurate, 1.1× speedup

Math

\[\begin{array}{l} z\_m = \left|z\right| \\ z\_s = \mathsf{copysign}\left(1, z\right) \\ 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_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\ \\ x\_s \cdot \left(y\_s \cdot \left(z\_s \cdot \begin{array}{l} \mathbf{if}\;t \cdot a \leq -2.9 \cdot 10^{+183}:\\ \;\;\;\;\left(\left(\left(-x\_m\right) \cdot y\_m\right) \cdot z\_m\right) \cdot \frac{-1}{z\_m}\\ \mathbf{else}:\\ \;\;\;\;x\_m \cdot y\_m\\ \end{array}\right)\right) \end{array} \]

FPCore

z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
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, z_m, t, and a should be sorted in increasing order before calling this function.
(FPCore (x_s y_s z_s x_m y_m z_m t a)
 :precision binary64
 (*
  x_s
  (*
   y_s
   (*
    z_s
    (if (<= (* t a) -2.9e+183)
      (* (* (* (- x_m) y_m) z_m) (/ -1.0 z_m))
      (* x_m y_m))))))

C

z\_m = fabs(z);
z\_s = copysign(1.0, z);
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_m && z_m < t && t < a);
double code(double x_s, double y_s, double z_s, double x_m, double y_m, double z_m, double t, double a) {
	double tmp;
	if ((t * a) <= -2.9e+183) {
		tmp = ((-x_m * y_m) * z_m) * (-1.0 / z_m);
	} else {
		tmp = x_m * y_m;
	}
	return x_s * (y_s * (z_s * tmp));
}

Fortran

z\_m = abs(z)
z\_s = copysign(1.0d0, z)
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, z_m, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: y_s
    real(8), intent (in) :: z_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z_m
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if ((t * a) <= (-2.9d+183)) then
        tmp = ((-x_m * y_m) * z_m) * ((-1.0d0) / z_m)
    else
        tmp = x_m * y_m
    end if
    code = x_s * (y_s * (z_s * tmp))
end function

Java

z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
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_m && z_m < t && t < a;
public static double code(double x_s, double y_s, double z_s, double x_m, double y_m, double z_m, double t, double a) {
	double tmp;
	if ((t * a) <= -2.9e+183) {
		tmp = ((-x_m * y_m) * z_m) * (-1.0 / z_m);
	} else {
		tmp = x_m * y_m;
	}
	return x_s * (y_s * (z_s * tmp));
}

Python

z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
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_m, t, a] = sort([x_m, y_m, z_m, t, a])
def code(x_s, y_s, z_s, x_m, y_m, z_m, t, a):
	tmp = 0
	if (t * a) <= -2.9e+183:
		tmp = ((-x_m * y_m) * z_m) * (-1.0 / z_m)
	else:
		tmp = x_m * y_m
	return x_s * (y_s * (z_s * tmp))

Julia

z\_m = abs(z)
z\_s = copysign(1.0, z)
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_m, t, a = sort([x_m, y_m, z_m, t, a])
function code(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
	tmp = 0.0
	if (Float64(t * a) <= -2.9e+183)
		tmp = Float64(Float64(Float64(Float64(-x_m) * y_m) * z_m) * Float64(-1.0 / z_m));
	else
		tmp = Float64(x_m * y_m);
	end
	return Float64(x_s * Float64(y_s * Float64(z_s * tmp)))
end

MATLAB

z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
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_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
function tmp_2 = code(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
	tmp = 0.0;
	if ((t * a) <= -2.9e+183)
		tmp = ((-x_m * y_m) * z_m) * (-1.0 / z_m);
	else
		tmp = x_m * y_m;
	end
	tmp_2 = x_s * (y_s * (z_s * tmp));
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 t a) < -2.9000000000000001e183

   1. Initial program 54.2%

      \[\frac{\left(x \cdot y\right) \cdot z}{\sqrt{z \cdot z - t \cdot a}} \]
   2. Add Preprocessing

   3. Taylor expanded in z around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 43.3

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

   5. Applied rewrites 43.3%

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. div-inv N/A

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

      4. lift-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. associate-*l* N/A

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

      7. *-commutative N/A

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

      8. lift-*.f64 N/A

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

      9. *-commutative N/A

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

      10. distribute-lft-neg-in N/A

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

      11. associate-*l* N/A

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

      12. lower-*.f64 N/A

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

      13. lift-*.f64 N/A

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

      14. distribute-lft-neg-in N/A

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

      15. lift-neg.f64 N/A

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

      16. lower-*.f64 N/A

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

      17. lower-*.f64 N/A

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

      18. frac-2neg N/A

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

   7. Applied rewrites 27.7%

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

   8. Taylor expanded in a around 0

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

      1. lower-/.f64 29.8

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

   10. Applied rewrites 29.8%

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

       1. lift-*.f64 N/A

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

       2. lift-*.f64 N/A

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

       3. lift-neg.f64 N/A

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

       4. distribute-lft-neg-out N/A

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

       5. lift-*.f64 N/A

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

       6. distribute-lft-neg-out N/A

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

       7. lower-neg.f64 N/A

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

       8. lift-*.f64 N/A

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

       9. associate-*r* N/A

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

       10. lift-*.f64 N/A

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

       11. associate-*r* N/A

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

       12. *-commutative N/A

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

       13. lift-*.f64 N/A

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

       14. *-commutative N/A

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

       15. lift-*.f64 N/A

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

       16. lower-*.f64 46.0

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

   12. Applied rewrites 46.0%

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

   if -2.9000000000000001e183 < (*.f64 t a)

   1. Initial program 61.6%

      \[\frac{\left(x \cdot y\right) \cdot z}{\sqrt{z \cdot z - t \cdot a}} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 47.1

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

   5. Applied rewrites 47.1%

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

4. Final simplification 46.9%

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

Alternative 8: 75.5% accurate, 1.4× speedup

Math

\[\begin{array}{l} z\_m = \left|z\right| \\ z\_s = \mathsf{copysign}\left(1, z\right) \\ 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_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\ \\ x\_s \cdot \left(y\_s \cdot \left(z\_s \cdot \begin{array}{l} \mathbf{if}\;z\_m \leq 1.85 \cdot 10^{-118}:\\ \;\;\;\;\left(\left(y\_m \cdot z\_m\right) \cdot x\_m\right) \cdot \frac{1}{z\_m}\\ \mathbf{else}:\\ \;\;\;\;x\_m \cdot y\_m\\ \end{array}\right)\right) \end{array} \]

FPCore

z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
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, z_m, t, and a should be sorted in increasing order before calling this function.
(FPCore (x_s y_s z_s x_m y_m z_m t a)
 :precision binary64
 (*
  x_s
  (*
   y_s
   (*
    z_s
    (if (<= z_m 1.85e-118) (* (* (* y_m z_m) x_m) (/ 1.0 z_m)) (* x_m y_m))))))

C

z\_m = fabs(z);
z\_s = copysign(1.0, z);
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_m && z_m < t && t < a);
double code(double x_s, double y_s, double z_s, double x_m, double y_m, double z_m, double t, double a) {
	double tmp;
	if (z_m <= 1.85e-118) {
		tmp = ((y_m * z_m) * x_m) * (1.0 / z_m);
	} else {
		tmp = x_m * y_m;
	}
	return x_s * (y_s * (z_s * tmp));
}

Fortran

z\_m = abs(z)
z\_s = copysign(1.0d0, z)
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, z_m, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: y_s
    real(8), intent (in) :: z_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z_m
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if (z_m <= 1.85d-118) then
        tmp = ((y_m * z_m) * x_m) * (1.0d0 / z_m)
    else
        tmp = x_m * y_m
    end if
    code = x_s * (y_s * (z_s * tmp))
end function

Java

z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
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_m && z_m < t && t < a;
public static double code(double x_s, double y_s, double z_s, double x_m, double y_m, double z_m, double t, double a) {
	double tmp;
	if (z_m <= 1.85e-118) {
		tmp = ((y_m * z_m) * x_m) * (1.0 / z_m);
	} else {
		tmp = x_m * y_m;
	}
	return x_s * (y_s * (z_s * tmp));
}

Python

z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
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_m, t, a] = sort([x_m, y_m, z_m, t, a])
def code(x_s, y_s, z_s, x_m, y_m, z_m, t, a):
	tmp = 0
	if z_m <= 1.85e-118:
		tmp = ((y_m * z_m) * x_m) * (1.0 / z_m)
	else:
		tmp = x_m * y_m
	return x_s * (y_s * (z_s * tmp))

Julia

z\_m = abs(z)
z\_s = copysign(1.0, z)
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_m, t, a = sort([x_m, y_m, z_m, t, a])
function code(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
	tmp = 0.0
	if (z_m <= 1.85e-118)
		tmp = Float64(Float64(Float64(y_m * z_m) * x_m) * Float64(1.0 / z_m));
	else
		tmp = Float64(x_m * y_m);
	end
	return Float64(x_s * Float64(y_s * Float64(z_s * tmp)))
end

MATLAB

z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
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_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
function tmp_2 = code(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
	tmp = 0.0;
	if (z_m <= 1.85e-118)
		tmp = ((y_m * z_m) * x_m) * (1.0 / z_m);
	else
		tmp = x_m * y_m;
	end
	tmp_2 = x_s * (y_s * (z_s * tmp));
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < 1.85000000000000007e-118

   1. Initial program 60.3%

      \[\frac{\left(x \cdot y\right) \cdot z}{\sqrt{z \cdot z - t \cdot a}} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. sub-neg N/A

         \[\leadsto \sqrt{\frac{1}{\color{blue}{{z}^{2} + \left(\mathsf{neg}\left(a \cdot t\right)\right)}}} \cdot \left(x \cdot \left(y \cdot z\right)\right) \]

      6. mul-1-neg N/A

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

      7. +-commutative N/A

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

      8. associate-*r* N/A

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

      9. lower-fma.f64 N/A

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

      10. mul-1-neg N/A

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

      11. lower-neg.f64 N/A

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

      12. unpow2 N/A

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

      13. lower-*.f64 N/A

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

      14. *-commutative N/A

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

      15. lower-*.f64 N/A

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

      16. *-commutative N/A

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

      17. lower-*.f64 62.2

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

   5. Applied rewrites 62.2%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 26.4%

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

   if 1.85000000000000007e-118 < z

   1. Initial program 60.6%

      \[\frac{\left(x \cdot y\right) \cdot z}{\sqrt{z \cdot z - t \cdot a}} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 85.4

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

   5. Applied rewrites 85.4%

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

4. Final simplification 48.0%

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

Alternative 9: 72.8% accurate, 7.5× speedup

Math

\[\begin{array}{l} z\_m = \left|z\right| \\ z\_s = \mathsf{copysign}\left(1, z\right) \\ 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_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\ \\ x\_s \cdot \left(y\_s \cdot \left(z\_s \cdot \left(x\_m \cdot y\_m\right)\right)\right) \end{array} \]

FPCore

z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
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, z_m, t, and a should be sorted in increasing order before calling this function.
(FPCore (x_s y_s z_s x_m y_m z_m t a)
 :precision binary64
 (* x_s (* y_s (* z_s (* x_m y_m)))))

C

z\_m = fabs(z);
z\_s = copysign(1.0, z);
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_m && z_m < t && t < a);
double code(double x_s, double y_s, double z_s, double x_m, double y_m, double z_m, double t, double a) {
	return x_s * (y_s * (z_s * (x_m * y_m)));
}

Fortran

z\_m = abs(z)
z\_s = copysign(1.0d0, z)
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, z_m, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: y_s
    real(8), intent (in) :: z_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z_m
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    code = x_s * (y_s * (z_s * (x_m * y_m)))
end function

Java

z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
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_m && z_m < t && t < a;
public static double code(double x_s, double y_s, double z_s, double x_m, double y_m, double z_m, double t, double a) {
	return x_s * (y_s * (z_s * (x_m * y_m)));
}

Python

z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
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_m, t, a] = sort([x_m, y_m, z_m, t, a])
def code(x_s, y_s, z_s, x_m, y_m, z_m, t, a):
	return x_s * (y_s * (z_s * (x_m * y_m)))

Julia

z\_m = abs(z)
z\_s = copysign(1.0, z)
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_m, t, a = sort([x_m, y_m, z_m, t, a])
function code(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
	return Float64(x_s * Float64(y_s * Float64(z_s * Float64(x_m * y_m))))
end

MATLAB

z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
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_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
function tmp = code(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
	tmp = x_s * (y_s * (z_s * (x_m * y_m)));
end

Wolfram

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

Derivation

1. Initial program 60.4%

   \[\frac{\left(x \cdot y\right) \cdot z}{\sqrt{z \cdot z - t \cdot a}} \]
2. Add Preprocessing

3. Taylor expanded in a around 0

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

   1. *-commutative N/A

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

   2. lower-*.f64 43.6

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

5. Applied rewrites 43.6%

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

6. Final simplification 43.6%

   \[\leadsto x \cdot y \]
7. Add Preprocessing

Developer Target 1: 87.5% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z < -3.1921305903852764 \cdot 10^{+46}:\\ \;\;\;\;-y \cdot x\\ \mathbf{elif}\;z < 5.976268120920894 \cdot 10^{+90}:\\ \;\;\;\;\frac{x \cdot z}{\frac{\sqrt{z \cdot z - a \cdot t}}{y}}\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (< z -3.1921305903852764e+46)
   (- (* y x))
   (if (< z 5.976268120920894e+90)
     (/ (* x z) (/ (sqrt (- (* z z) (* a t))) y))
     (* y x))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z < -3.1921305903852764e+46) {
		tmp = -(y * x);
	} else if (z < 5.976268120920894e+90) {
		tmp = (x * z) / (sqrt(((z * z) - (a * t))) / y);
	} else {
		tmp = y * x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if (z < (-3.1921305903852764d+46)) then
        tmp = -(y * x)
    else if (z < 5.976268120920894d+90) then
        tmp = (x * z) / (sqrt(((z * z) - (a * t))) / y)
    else
        tmp = y * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z < -3.1921305903852764e+46) {
		tmp = -(y * x);
	} else if (z < 5.976268120920894e+90) {
		tmp = (x * z) / (Math.sqrt(((z * z) - (a * t))) / y);
	} else {
		tmp = y * x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if z < -3.1921305903852764e+46:
		tmp = -(y * x)
	elif z < 5.976268120920894e+90:
		tmp = (x * z) / (math.sqrt(((z * z) - (a * t))) / y)
	else:
		tmp = y * x
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (z < -3.1921305903852764e+46)
		tmp = Float64(-Float64(y * x));
	elseif (z < 5.976268120920894e+90)
		tmp = Float64(Float64(x * z) / Float64(sqrt(Float64(Float64(z * z) - Float64(a * t))) / y));
	else
		tmp = Float64(y * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (z < -3.1921305903852764e+46)
		tmp = -(y * x);
	elseif (z < 5.976268120920894e+90)
		tmp = (x * z) / (sqrt(((z * z) - (a * t))) / y);
	else
		tmp = y * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Less[z, -3.1921305903852764e+46], (-N[(y * x), $MachinePrecision]), If[Less[z, 5.976268120920894e+90], N[(N[(x * z), $MachinePrecision] / N[(N[Sqrt[N[(N[(z * z), $MachinePrecision] - N[(a * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], N[(y * x), $MachinePrecision]]]

Reproduce

herbie shell --seed 2024243 
(FPCore (x y z t a)
  :name "Statistics.Math.RootFinding:ridders from math-functions-0.1.5.2"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< z -31921305903852764000000000000000000000000000000) (- (* y x)) (if (< z 5976268120920894000000000000000000000000000000000000000000000000000000000000000000000000000) (/ (* x z) (/ (sqrt (- (* z z) (* a t))) y)) (* y x))))

  (/ (* (* x y) z) (sqrt (- (* z z) (* t a)))))