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

Percentage Accurate: 61.4% → 93.0%

Time: 11.8s

Alternatives: 12

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: 93.0% accurate, 0.8× 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 4.4 \cdot 10^{-163}:\\ \;\;\;\;x\_m \cdot \frac{z\_m \cdot y\_m}{\sqrt{t \cdot \left(-a\right)}}\\ \mathbf{elif}\;z\_m \leq 5.5 \cdot 10^{+94}:\\ \;\;\;\;\left(y\_m \cdot x\_m\right) \cdot \frac{z\_m}{\sqrt{z\_m \cdot z\_m - t \cdot a}}\\ \mathbf{else}:\\ \;\;\;\;y\_m \cdot x\_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 4.4e-163)
      (* x_m (/ (* z_m y_m) (sqrt (* t (- a)))))
      (if (<= z_m 5.5e+94)
        (* (* y_m x_m) (/ z_m (sqrt (- (* z_m z_m) (* t a)))))
        (* y_m x_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 <= 4.4e-163) {
		tmp = x_m * ((z_m * y_m) / sqrt((t * -a)));
	} else if (z_m <= 5.5e+94) {
		tmp = (y_m * x_m) * (z_m / sqrt(((z_m * z_m) - (t * a))));
	} else {
		tmp = y_m * x_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 <= 4.4d-163) then
        tmp = x_m * ((z_m * y_m) / sqrt((t * -a)))
    else if (z_m <= 5.5d+94) then
        tmp = (y_m * x_m) * (z_m / sqrt(((z_m * z_m) - (t * a))))
    else
        tmp = y_m * x_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 <= 4.4e-163) {
		tmp = x_m * ((z_m * y_m) / Math.sqrt((t * -a)));
	} else if (z_m <= 5.5e+94) {
		tmp = (y_m * x_m) * (z_m / Math.sqrt(((z_m * z_m) - (t * a))));
	} else {
		tmp = y_m * x_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 <= 4.4e-163:
		tmp = x_m * ((z_m * y_m) / math.sqrt((t * -a)))
	elif z_m <= 5.5e+94:
		tmp = (y_m * x_m) * (z_m / math.sqrt(((z_m * z_m) - (t * a))))
	else:
		tmp = y_m * x_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 <= 4.4e-163)
		tmp = Float64(x_m * Float64(Float64(z_m * y_m) / sqrt(Float64(t * Float64(-a)))));
	elseif (z_m <= 5.5e+94)
		tmp = Float64(Float64(y_m * x_m) * Float64(z_m / sqrt(Float64(Float64(z_m * z_m) - Float64(t * a)))));
	else
		tmp = Float64(y_m * x_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 <= 4.4e-163)
		tmp = x_m * ((z_m * y_m) / sqrt((t * -a)));
	elseif (z_m <= 5.5e+94)
		tmp = (y_m * x_m) * (z_m / sqrt(((z_m * z_m) - (t * a))));
	else
		tmp = y_m * x_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, 4.4e-163], N[(x$95$m * N[(N[(z$95$m * y$95$m), $MachinePrecision] / N[Sqrt[N[(t * (-a)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z$95$m, 5.5e+94], N[(N[(y$95$m * x$95$m), $MachinePrecision] * N[(z$95$m / N[Sqrt[N[(N[(z$95$m * z$95$m), $MachinePrecision] - N[(t * a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(y$95$m * x$95$m), $MachinePrecision]]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if z < 4.40000000000000022e-163

   1. Initial program 58.6%

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

   3. Taylor expanded in z around 0

      \[\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. mul-1-neg N/A

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

      2. distribute-rgt-neg-in N/A

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

      3. mul-1-neg N/A

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

      4. lower-*.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 33.8

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

   5. Applied rewrites 33.8%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*l* N/A

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

      5. associate-/l* N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower-*.f64 34.6

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

   7. Applied rewrites 34.6%

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

   if 4.40000000000000022e-163 < z < 5.4999999999999997e94

   1. Initial program 92.7%

      \[\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. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 94.5

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

   4. Applied rewrites 94.5%

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

   if 5.4999999999999997e94 < z

   1. Initial program 31.8%

      \[\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 \color{blue}{x \cdot y} \]
   4. Step-by-step derivation

      1. lower-*.f64 98.1

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

   5. Applied rewrites 98.1%

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

4. Final simplification 59.6%

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

Alternative 2: 90.0% accurate, 0.8× 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 2.15 \cdot 10^{-89}:\\ \;\;\;\;x\_m \cdot \frac{z\_m \cdot y\_m}{\sqrt{t \cdot \left(-a\right)}}\\ \mathbf{elif}\;z\_m \leq 5.5 \cdot 10^{+94}:\\ \;\;\;\;\left(z\_m \cdot x\_m\right) \cdot \frac{y\_m}{\sqrt{z\_m \cdot z\_m - t \cdot a}}\\ \mathbf{else}:\\ \;\;\;\;y\_m \cdot x\_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 2.15e-89)
      (* x_m (/ (* z_m y_m) (sqrt (* t (- a)))))
      (if (<= z_m 5.5e+94)
        (* (* z_m x_m) (/ y_m (sqrt (- (* z_m z_m) (* t a)))))
        (* y_m x_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 <= 2.15e-89) {
		tmp = x_m * ((z_m * y_m) / sqrt((t * -a)));
	} else if (z_m <= 5.5e+94) {
		tmp = (z_m * x_m) * (y_m / sqrt(((z_m * z_m) - (t * a))));
	} else {
		tmp = y_m * x_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 <= 2.15d-89) then
        tmp = x_m * ((z_m * y_m) / sqrt((t * -a)))
    else if (z_m <= 5.5d+94) then
        tmp = (z_m * x_m) * (y_m / sqrt(((z_m * z_m) - (t * a))))
    else
        tmp = y_m * x_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 <= 2.15e-89) {
		tmp = x_m * ((z_m * y_m) / Math.sqrt((t * -a)));
	} else if (z_m <= 5.5e+94) {
		tmp = (z_m * x_m) * (y_m / Math.sqrt(((z_m * z_m) - (t * a))));
	} else {
		tmp = y_m * x_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 <= 2.15e-89:
		tmp = x_m * ((z_m * y_m) / math.sqrt((t * -a)))
	elif z_m <= 5.5e+94:
		tmp = (z_m * x_m) * (y_m / math.sqrt(((z_m * z_m) - (t * a))))
	else:
		tmp = y_m * x_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 <= 2.15e-89)
		tmp = Float64(x_m * Float64(Float64(z_m * y_m) / sqrt(Float64(t * Float64(-a)))));
	elseif (z_m <= 5.5e+94)
		tmp = Float64(Float64(z_m * x_m) * Float64(y_m / sqrt(Float64(Float64(z_m * z_m) - Float64(t * a)))));
	else
		tmp = Float64(y_m * x_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 <= 2.15e-89)
		tmp = x_m * ((z_m * y_m) / sqrt((t * -a)));
	elseif (z_m <= 5.5e+94)
		tmp = (z_m * x_m) * (y_m / sqrt(((z_m * z_m) - (t * a))));
	else
		tmp = y_m * x_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, 2.15e-89], N[(x$95$m * N[(N[(z$95$m * y$95$m), $MachinePrecision] / N[Sqrt[N[(t * (-a)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z$95$m, 5.5e+94], N[(N[(z$95$m * x$95$m), $MachinePrecision] * N[(y$95$m / N[Sqrt[N[(N[(z$95$m * z$95$m), $MachinePrecision] - N[(t * a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(y$95$m * x$95$m), $MachinePrecision]]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if z < 2.14999999999999993e-89

   1. Initial program 61.5%

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

   3. Taylor expanded in z around 0

      \[\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. mul-1-neg N/A

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

      2. distribute-rgt-neg-in N/A

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

      3. mul-1-neg N/A

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

      4. lower-*.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 37.9

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

   5. Applied rewrites 37.9%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*l* N/A

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

      5. associate-/l* N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower-*.f64 38.1

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

   7. Applied rewrites 38.1%

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

   if 2.14999999999999993e-89 < z < 5.4999999999999997e94

   1. Initial program 92.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. *-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. associate-*r* N/A

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

      6. associate-/l* N/A

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

      7. lower-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower-/.f64 80.6

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

   4. Applied rewrites 80.6%

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

   if 5.4999999999999997e94 < z

   1. Initial program 31.8%

      \[\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 \color{blue}{x \cdot y} \]
   4. Step-by-step derivation

      1. lower-*.f64 98.1

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

   5. Applied rewrites 98.1%

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

4. Final simplification 56.5%

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

Alternative 3: 92.5% 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.3 \cdot 10^{+32}:\\ \;\;\;\;\frac{z\_m \cdot y\_m}{\sqrt{z\_m \cdot z\_m - t \cdot a}} \cdot x\_m\\ \mathbf{else}:\\ \;\;\;\;y\_m \cdot x\_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 6.3e+32)
      (* (/ (* z_m y_m) (sqrt (- (* z_m z_m) (* t a)))) x_m)
      (* y_m x_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.3e+32) {
		tmp = ((z_m * y_m) / sqrt(((z_m * z_m) - (t * a)))) * x_m;
	} else {
		tmp = y_m * x_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 <= 6.3d+32) then
        tmp = ((z_m * y_m) / sqrt(((z_m * z_m) - (t * a)))) * x_m
    else
        tmp = y_m * x_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 <= 6.3e+32) {
		tmp = ((z_m * y_m) / Math.sqrt(((z_m * z_m) - (t * a)))) * x_m;
	} else {
		tmp = y_m * x_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 <= 6.3e+32:
		tmp = ((z_m * y_m) / math.sqrt(((z_m * z_m) - (t * a)))) * x_m
	else:
		tmp = y_m * x_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.3e+32)
		tmp = Float64(Float64(Float64(z_m * y_m) / sqrt(Float64(Float64(z_m * z_m) - Float64(t * a)))) * x_m);
	else
		tmp = Float64(y_m * x_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 <= 6.3e+32)
		tmp = ((z_m * y_m) / sqrt(((z_m * z_m) - (t * a)))) * x_m;
	else
		tmp = y_m * x_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, 6.3e+32], N[(N[(N[(z$95$m * y$95$m), $MachinePrecision] / N[Sqrt[N[(N[(z$95$m * z$95$m), $MachinePrecision] - N[(t * a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision], N[(y$95$m * x$95$m), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < 6.3000000000000002e32

   1. Initial program 65.5%

      \[\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} \]

      8. lower-/.f64 N/A

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

      9. lower-*.f64 66.1

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

   4. Applied rewrites 66.1%

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

   if 6.3000000000000002e32 < z

   1. Initial program 46.0%

      \[\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 \color{blue}{x \cdot y} \]
   4. Step-by-step derivation

      1. lower-*.f64 92.8

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

   5. Applied rewrites 92.8%

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

4. Final simplification 72.9%

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

Alternative 4: 84.3% 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 6 \cdot 10^{-38}:\\ \;\;\;\;x\_m \cdot \frac{z\_m \cdot y\_m}{\sqrt{t \cdot \left(-a\right)}}\\ \mathbf{else}:\\ \;\;\;\;y\_m \cdot x\_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 6e-38)
      (* x_m (/ (* z_m y_m) (sqrt (* t (- a)))))
      (* y_m x_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 <= 6e-38) {
		tmp = x_m * ((z_m * y_m) / sqrt((t * -a)));
	} else {
		tmp = y_m * x_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 <= 6d-38) then
        tmp = x_m * ((z_m * y_m) / sqrt((t * -a)))
    else
        tmp = y_m * x_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 <= 6e-38) {
		tmp = x_m * ((z_m * y_m) / Math.sqrt((t * -a)));
	} else {
		tmp = y_m * x_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 <= 6e-38:
		tmp = x_m * ((z_m * y_m) / math.sqrt((t * -a)))
	else:
		tmp = y_m * x_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 <= 6e-38)
		tmp = Float64(x_m * Float64(Float64(z_m * y_m) / sqrt(Float64(t * Float64(-a)))));
	else
		tmp = Float64(y_m * x_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 <= 6e-38)
		tmp = x_m * ((z_m * y_m) / sqrt((t * -a)));
	else
		tmp = y_m * x_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, 6e-38], N[(x$95$m * N[(N[(z$95$m * y$95$m), $MachinePrecision] / N[Sqrt[N[(t * (-a)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(y$95$m * x$95$m), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < 5.99999999999999977e-38

   1. Initial program 63.5%

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

   3. Taylor expanded in z around 0

      \[\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. mul-1-neg N/A

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

      2. distribute-rgt-neg-in N/A

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

      3. mul-1-neg N/A

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

      4. lower-*.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 41.0

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

   5. Applied rewrites 41.0%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*l* N/A

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

      5. associate-/l* N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower-*.f64 40.7

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

   7. Applied rewrites 40.7%

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

   if 5.99999999999999977e-38 < z

   1. Initial program 53.8%

      \[\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 \color{blue}{x \cdot y} \]
   4. Step-by-step derivation

      1. lower-*.f64 89.2

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

   5. Applied rewrites 89.2%

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

4. Final simplification 55.5%

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

Alternative 5: 81.9% 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 6 \cdot 10^{-38}:\\ \;\;\;\;z\_m \cdot \frac{y\_m \cdot x\_m}{\sqrt{t \cdot \left(-a\right)}}\\ \mathbf{else}:\\ \;\;\;\;y\_m \cdot x\_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 6e-38)
      (* z_m (/ (* y_m x_m) (sqrt (* t (- a)))))
      (* y_m x_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 <= 6e-38) {
		tmp = z_m * ((y_m * x_m) / sqrt((t * -a)));
	} else {
		tmp = y_m * x_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 <= 6d-38) then
        tmp = z_m * ((y_m * x_m) / sqrt((t * -a)))
    else
        tmp = y_m * x_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 <= 6e-38) {
		tmp = z_m * ((y_m * x_m) / Math.sqrt((t * -a)));
	} else {
		tmp = y_m * x_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 <= 6e-38:
		tmp = z_m * ((y_m * x_m) / math.sqrt((t * -a)))
	else:
		tmp = y_m * x_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 <= 6e-38)
		tmp = Float64(z_m * Float64(Float64(y_m * x_m) / sqrt(Float64(t * Float64(-a)))));
	else
		tmp = Float64(y_m * x_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 <= 6e-38)
		tmp = z_m * ((y_m * x_m) / sqrt((t * -a)));
	else
		tmp = y_m * x_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, 6e-38], N[(z$95$m * N[(N[(y$95$m * x$95$m), $MachinePrecision] / N[Sqrt[N[(t * (-a)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(y$95$m * x$95$m), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < 5.99999999999999977e-38

   1. Initial program 63.5%

      \[\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. *-commutative N/A

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

      4. associate-/l* N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 65.1

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

   4. Applied rewrites 65.1%

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

   5. Taylor expanded in z around 0

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

      1. mul-1-neg N/A

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

      2. distribute-rgt-neg-in N/A

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

      3. mul-1-neg N/A

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

      4. lower-*.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 42.2

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

   7. Applied rewrites 42.2%

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

   if 5.99999999999999977e-38 < z

   1. Initial program 53.8%

      \[\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 \color{blue}{x \cdot y} \]
   4. Step-by-step derivation

      1. lower-*.f64 89.2

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

   5. Applied rewrites 89.2%

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

4. Final simplification 56.5%

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

Alternative 6: 81.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 6 \cdot 10^{-38}:\\ \;\;\;\;\left(y\_m \cdot x\_m\right) \cdot \frac{z\_m}{\sqrt{t \cdot \left(-a\right)}}\\ \mathbf{else}:\\ \;\;\;\;y\_m \cdot x\_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 6e-38)
      (* (* y_m x_m) (/ z_m (sqrt (* t (- a)))))
      (* y_m x_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 <= 6e-38) {
		tmp = (y_m * x_m) * (z_m / sqrt((t * -a)));
	} else {
		tmp = y_m * x_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 <= 6d-38) then
        tmp = (y_m * x_m) * (z_m / sqrt((t * -a)))
    else
        tmp = y_m * x_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 <= 6e-38) {
		tmp = (y_m * x_m) * (z_m / Math.sqrt((t * -a)));
	} else {
		tmp = y_m * x_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 <= 6e-38:
		tmp = (y_m * x_m) * (z_m / math.sqrt((t * -a)))
	else:
		tmp = y_m * x_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 <= 6e-38)
		tmp = Float64(Float64(y_m * x_m) * Float64(z_m / sqrt(Float64(t * Float64(-a)))));
	else
		tmp = Float64(y_m * x_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 <= 6e-38)
		tmp = (y_m * x_m) * (z_m / sqrt((t * -a)));
	else
		tmp = y_m * x_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, 6e-38], N[(N[(y$95$m * x$95$m), $MachinePrecision] * N[(z$95$m / N[Sqrt[N[(t * (-a)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(y$95$m * x$95$m), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < 5.99999999999999977e-38

   1. Initial program 63.5%

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

   3. Taylor expanded in z around 0

      \[\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. mul-1-neg N/A

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

      2. distribute-rgt-neg-in N/A

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

      3. mul-1-neg N/A

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

      4. lower-*.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 41.0

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

   5. Applied rewrites 41.0%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 42.1

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

   7. Applied rewrites 42.1%

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

   if 5.99999999999999977e-38 < z

   1. Initial program 53.8%

      \[\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 \color{blue}{x \cdot y} \]
   4. Step-by-step derivation

      1. lower-*.f64 89.2

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

   5. Applied rewrites 89.2%

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

4. Final simplification 56.4%

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

Alternative 7: 81.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 6 \cdot 10^{-38}:\\ \;\;\;\;z\_m \cdot \left(x\_m \cdot \frac{y\_m}{\sqrt{t \cdot \left(-a\right)}}\right)\\ \mathbf{else}:\\ \;\;\;\;y\_m \cdot x\_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 6e-38)
      (* z_m (* x_m (/ y_m (sqrt (* t (- a))))))
      (* y_m x_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 <= 6e-38) {
		tmp = z_m * (x_m * (y_m / sqrt((t * -a))));
	} else {
		tmp = y_m * x_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 <= 6d-38) then
        tmp = z_m * (x_m * (y_m / sqrt((t * -a))))
    else
        tmp = y_m * x_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 <= 6e-38) {
		tmp = z_m * (x_m * (y_m / Math.sqrt((t * -a))));
	} else {
		tmp = y_m * x_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 <= 6e-38:
		tmp = z_m * (x_m * (y_m / math.sqrt((t * -a))))
	else:
		tmp = y_m * x_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 <= 6e-38)
		tmp = Float64(z_m * Float64(x_m * Float64(y_m / sqrt(Float64(t * Float64(-a))))));
	else
		tmp = Float64(y_m * x_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 <= 6e-38)
		tmp = z_m * (x_m * (y_m / sqrt((t * -a))));
	else
		tmp = y_m * x_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, 6e-38], N[(z$95$m * N[(x$95$m * N[(y$95$m / N[Sqrt[N[(t * (-a)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(y$95$m * x$95$m), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < 5.99999999999999977e-38

   1. Initial program 63.5%

      \[\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. *-commutative N/A

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

      4. associate-/l* N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 65.1

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

   4. Applied rewrites 65.1%

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

   5. Taylor expanded in z around 0

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

      1. mul-1-neg N/A

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

      2. distribute-rgt-neg-in N/A

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

      3. mul-1-neg N/A

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

      4. lower-*.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 42.2

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

   7. Applied rewrites 42.2%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 41.1

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

   9. Applied rewrites 41.1%

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

   if 5.99999999999999977e-38 < z

   1. Initial program 53.8%

      \[\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 \color{blue}{x \cdot y} \]
   4. Step-by-step derivation

      1. lower-*.f64 89.2

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

   5. Applied rewrites 89.2%

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

4. Final simplification 55.8%

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

Alternative 8: 79.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 6 \cdot 10^{-38}:\\ \;\;\;\;\left(z\_m \cdot x\_m\right) \cdot \frac{y\_m}{\sqrt{t \cdot \left(-a\right)}}\\ \mathbf{else}:\\ \;\;\;\;y\_m \cdot x\_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 6e-38)
      (* (* z_m x_m) (/ y_m (sqrt (* t (- a)))))
      (* y_m x_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 <= 6e-38) {
		tmp = (z_m * x_m) * (y_m / sqrt((t * -a)));
	} else {
		tmp = y_m * x_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 <= 6d-38) then
        tmp = (z_m * x_m) * (y_m / sqrt((t * -a)))
    else
        tmp = y_m * x_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 <= 6e-38) {
		tmp = (z_m * x_m) * (y_m / Math.sqrt((t * -a)));
	} else {
		tmp = y_m * x_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 <= 6e-38:
		tmp = (z_m * x_m) * (y_m / math.sqrt((t * -a)))
	else:
		tmp = y_m * x_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 <= 6e-38)
		tmp = Float64(Float64(z_m * x_m) * Float64(y_m / sqrt(Float64(t * Float64(-a)))));
	else
		tmp = Float64(y_m * x_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 <= 6e-38)
		tmp = (z_m * x_m) * (y_m / sqrt((t * -a)));
	else
		tmp = y_m * x_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, 6e-38], N[(N[(z$95$m * x$95$m), $MachinePrecision] * N[(y$95$m / N[Sqrt[N[(t * (-a)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(y$95$m * x$95$m), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < 5.99999999999999977e-38

   1. Initial program 63.5%

      \[\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. *-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. associate-*r* N/A

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

      6. associate-/l* N/A

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

      7. lower-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower-/.f64 59.9

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

   4. Applied rewrites 59.9%

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

   5. Taylor expanded in z around 0

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

      1. mul-1-neg N/A

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

      2. distribute-rgt-neg-in N/A

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

      3. mul-1-neg N/A

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

      4. lower-*.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 40.0

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

   7. Applied rewrites 40.0%

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

   if 5.99999999999999977e-38 < z

   1. Initial program 53.8%

      \[\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 \color{blue}{x \cdot y} \]
   4. Step-by-step derivation

      1. lower-*.f64 89.2

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

   5. Applied rewrites 89.2%

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

4. Final simplification 55.0%

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

Alternative 9: 73.7% 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}\;a \leq 3.4 \cdot 10^{-184}:\\ \;\;\;\;y\_m \cdot x\_m\\ \mathbf{else}:\\ \;\;\;\;y\_m \cdot \left(\left(z\_m \cdot x\_m\right) \cdot \frac{1}{z\_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 (<= a 3.4e-184) (* y_m x_m) (* y_m (* (* z_m x_m) (/ 1.0 z_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 (a <= 3.4e-184) {
		tmp = y_m * x_m;
	} else {
		tmp = y_m * ((z_m * x_m) * (1.0 / z_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 (a <= 3.4d-184) then
        tmp = y_m * x_m
    else
        tmp = y_m * ((z_m * x_m) * (1.0d0 / z_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 (a <= 3.4e-184) {
		tmp = y_m * x_m;
	} else {
		tmp = y_m * ((z_m * x_m) * (1.0 / z_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 a <= 3.4e-184:
		tmp = y_m * x_m
	else:
		tmp = y_m * ((z_m * x_m) * (1.0 / z_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 (a <= 3.4e-184)
		tmp = Float64(y_m * x_m);
	else
		tmp = Float64(y_m * Float64(Float64(z_m * x_m) * Float64(1.0 / z_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 (a <= 3.4e-184)
		tmp = y_m * x_m;
	else
		tmp = y_m * ((z_m * x_m) * (1.0 / z_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[a, 3.4e-184], N[(y$95$m * x$95$m), $MachinePrecision], N[(y$95$m * N[(N[(z$95$m * x$95$m), $MachinePrecision] * N[(1.0 / z$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if a < 3.40000000000000004e-184

   1. Initial program 58.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 \color{blue}{x \cdot y} \]
   4. Step-by-step derivation

      1. lower-*.f64 43.4

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

   5. Applied rewrites 43.4%

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

   if 3.40000000000000004e-184 < a

   1. Initial program 64.8%

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

   3. Taylor expanded in z around 0

      \[\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. mul-1-neg N/A

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

      2. distribute-rgt-neg-in N/A

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

      3. mul-1-neg N/A

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

      4. lower-*.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 48.9

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

   5. Applied rewrites 48.9%

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

      1. lift-/.f64 N/A

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

      2. clear-num N/A

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

      3. associate-/r/ N/A

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lift-*.f64 N/A

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

      7. associate-*r* N/A

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

      8. *-commutative N/A

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

      9. lift-*.f64 N/A

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

      10. associate-*r* N/A

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

      11. lower-*.f64 N/A

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

   7. Applied rewrites 44.5%

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

   8. Taylor expanded in z around inf

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

      1. lower-/.f64 32.6

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

   10. Applied rewrites 32.6%

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

4. Final simplification 39.7%

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

Alternative 10: 75.1% accurate, 1.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 \begin{array}{l} \mathbf{if}\;z\_m \leq 9.6 \cdot 10^{-147}:\\ \;\;\;\;\frac{y\_m \cdot \left(z\_m \cdot x\_m\right)}{-z\_m}\\ \mathbf{else}:\\ \;\;\;\;y\_m \cdot x\_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 9.6e-147) (/ (* y_m (* z_m x_m)) (- z_m)) (* y_m x_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 <= 9.6e-147) {
		tmp = (y_m * (z_m * x_m)) / -z_m;
	} else {
		tmp = y_m * x_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 <= 9.6d-147) then
        tmp = (y_m * (z_m * x_m)) / -z_m
    else
        tmp = y_m * x_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 <= 9.6e-147) {
		tmp = (y_m * (z_m * x_m)) / -z_m;
	} else {
		tmp = y_m * x_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 <= 9.6e-147:
		tmp = (y_m * (z_m * x_m)) / -z_m
	else:
		tmp = y_m * x_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 <= 9.6e-147)
		tmp = Float64(Float64(y_m * Float64(z_m * x_m)) / Float64(-z_m));
	else
		tmp = Float64(y_m * x_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 <= 9.6e-147)
		tmp = (y_m * (z_m * x_m)) / -z_m;
	else
		tmp = y_m * x_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, 9.6e-147], N[(N[(y$95$m * N[(z$95$m * x$95$m), $MachinePrecision]), $MachinePrecision] / (-z$95$m)), $MachinePrecision], N[(y$95$m * x$95$m), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < 9.59999999999999994e-147

   1. Initial program 59.1%

      \[\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 62.1

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

   5. Applied rewrites 62.1%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*r* N/A

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

      5. *-commutative N/A

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

      6. lift-*.f64 N/A

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

      7. lower-*.f64 56.0

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

   7. Applied rewrites 56.0%

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

   if 9.59999999999999994e-147 < z

   1. Initial program 62.7%

      \[\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 \color{blue}{x \cdot y} \]
   4. Step-by-step derivation

      1. lower-*.f64 77.2

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

   5. Applied rewrites 77.2%

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

4. Final simplification 64.4%

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

Alternative 11: 72.4% accurate, 1.6× 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}\;a \leq 5.9 \cdot 10^{-95}:\\ \;\;\;\;y\_m \cdot x\_m\\ \mathbf{else}:\\ \;\;\;\;\left(z\_m \cdot x\_m\right) \cdot \frac{y\_m}{z\_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 (<= a 5.9e-95) (* y_m x_m) (* (* z_m x_m) (/ y_m z_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 (a <= 5.9e-95) {
		tmp = y_m * x_m;
	} else {
		tmp = (z_m * x_m) * (y_m / z_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 (a <= 5.9d-95) then
        tmp = y_m * x_m
    else
        tmp = (z_m * x_m) * (y_m / z_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 (a <= 5.9e-95) {
		tmp = y_m * x_m;
	} else {
		tmp = (z_m * x_m) * (y_m / z_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 a <= 5.9e-95:
		tmp = y_m * x_m
	else:
		tmp = (z_m * x_m) * (y_m / z_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 (a <= 5.9e-95)
		tmp = Float64(y_m * x_m);
	else
		tmp = Float64(Float64(z_m * x_m) * Float64(y_m / z_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 (a <= 5.9e-95)
		tmp = y_m * x_m;
	else
		tmp = (z_m * x_m) * (y_m / z_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[a, 5.9e-95], N[(y$95$m * x$95$m), $MachinePrecision], N[(N[(z$95$m * x$95$m), $MachinePrecision] * N[(y$95$m / z$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if a < 5.8999999999999998e-95

   1. Initial program 58.1%

      \[\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 \color{blue}{x \cdot y} \]
   4. Step-by-step derivation

      1. lower-*.f64 43.4

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

   5. Applied rewrites 43.4%

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

   if 5.8999999999999998e-95 < a

   1. Initial program 66.4%

      \[\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. *-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. associate-*r* N/A

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

      6. associate-/l* N/A

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

      7. lower-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower-/.f64 61.2

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

   4. Applied rewrites 61.2%

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

   5. Taylor expanded in z around inf

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

      1. lower-/.f64 30.0

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

   7. Applied rewrites 30.0%

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

4. Final simplification 39.4%

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

Alternative 12: 72.5% 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(y\_m \cdot x\_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 (* y_m x_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 * (y_m * x_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 * (y_m * x_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 * (y_m * x_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 * (y_m * x_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(y_m * x_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 * (y_m * x_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[(y$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

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 z around inf

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

   1. lower-*.f64 38.9

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

5. Applied rewrites 38.9%

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

6. Final simplification 38.9%

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

Developer Target 1: 87.6% 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 2024238 
(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)))))