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

Percentage Accurate: 61.6% → 93.5%

Time: 13.0s

Alternatives: 6

Speedup: 5.2×

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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t, a)
use fmin_fmax_functions
    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.6% 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t, a)
use fmin_fmax_functions
    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.5% accurate, 0.8× speedup

Math

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

FPCore

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

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
z\_m = fabs(z);
z\_s = copysign(1.0, z);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
	double tmp;
	if (z_m <= 7.8e+77) {
		tmp = (z_m * y_m) * (x_m / sqrt(((z_m * z_m) - (a * t))));
	} else {
		tmp = y_m * x_m;
	}
	return z_s * (y_s * (x_s * tmp));
}

Fortran

x\_m =     private
x\_s =     private
y\_m =     private
y\_s =     private
z\_m =     private
z\_s =     private
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
use fmin_fmax_functions
    real(8), intent (in) :: z_s
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z_m
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if (z_m <= 7.8d+77) then
        tmp = (z_m * y_m) * (x_m / sqrt(((z_m * z_m) - (a * t))))
    else
        tmp = y_m * x_m
    end if
    code = z_s * (y_s * (x_s * tmp))
end function

Java

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

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
[x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a])
def code(z_s, y_s, x_s, x_m, y_m, z_m, t, a):
	tmp = 0
	if z_m <= 7.8e+77:
		tmp = (z_m * y_m) * (x_m / math.sqrt(((z_m * z_m) - (a * t))))
	else:
		tmp = y_m * x_m
	return z_s * (y_s * (x_s * tmp))

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
y\_m = abs(y)
y\_s = copysign(1.0, y)
z\_m = abs(z)
z\_s = copysign(1.0, z)
x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a])
function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
	tmp = 0.0
	if (z_m <= 7.8e+77)
		tmp = Float64(Float64(z_m * y_m) * Float64(x_m / sqrt(Float64(Float64(z_m * z_m) - Float64(a * t)))));
	else
		tmp = Float64(y_m * x_m);
	end
	return Float64(z_s * Float64(y_s * Float64(x_s * tmp)))
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
z\_m = abs(z);
z\_s = sign(z) * 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(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
	tmp = 0.0;
	if (z_m <= 7.8e+77)
		tmp = (z_m * y_m) * (x_m / sqrt(((z_m * z_m) - (a * t))));
	else
		tmp = y_m * x_m;
	end
	tmp_2 = z_s * (y_s * (x_s * tmp));
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, 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[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * If[LessEqual[z$95$m, 7.8e+77], N[(N[(z$95$m * y$95$m), $MachinePrecision] * N[(x$95$m / N[Sqrt[N[(N[(z$95$m * z$95$m), $MachinePrecision] - N[(a * t), $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 < 7.7999999999999995e77

   1. Initial program 84.5%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*l* N/A

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

      5. *-commutative N/A

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

      6. lift-sqrt.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. lift--.f64 N/A

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

      10. associate-/l* N/A

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

      11. lower-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 N/A

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

      14. lower-/.f64 N/A

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

      15. lift--.f64 N/A

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

      16. lift-*.f64 N/A

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

      17. lift-*.f64 N/A

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

      18. lift-sqrt.f64 87.9

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

      19. lift-*.f64 N/A

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

      20. *-commutative N/A

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

      21. lower-*.f64 87.9

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

   3. Applied rewrites 87.9%

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

   if 7.7999999999999995e77 < z

   1. Initial program 36.5%

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

   2. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 96.6

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

   4. Applied rewrites 96.6%

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

Alternative 2: 92.0% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Fortran

x\_m =     private
x\_s =     private
y\_m =     private
y\_s =     private
z\_m =     private
z\_s =     private
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
use fmin_fmax_functions
    real(8), intent (in) :: z_s
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z_m
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if (z_m <= 5d+133) then
        tmp = ((z_m / sqrt(((z_m * z_m) - (a * t)))) * y_m) * x_m
    else
        tmp = y_m * x_m
    end if
    code = z_s * (y_s * (x_s * tmp))
end function

Java

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

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
[x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a])
def code(z_s, y_s, x_s, x_m, y_m, z_m, t, a):
	tmp = 0
	if z_m <= 5e+133:
		tmp = ((z_m / math.sqrt(((z_m * z_m) - (a * t)))) * y_m) * x_m
	else:
		tmp = y_m * x_m
	return z_s * (y_s * (x_s * tmp))

Julia

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

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
z\_m = abs(z);
z\_s = sign(z) * 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(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
	tmp = 0.0;
	if (z_m <= 5e+133)
		tmp = ((z_m / sqrt(((z_m * z_m) - (a * t)))) * y_m) * x_m;
	else
		tmp = y_m * x_m;
	end
	tmp_2 = z_s * (y_s * (x_s * tmp));
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, 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[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * If[LessEqual[z$95$m, 5e+133], N[(N[(N[(z$95$m / N[Sqrt[N[(N[(z$95$m * z$95$m), $MachinePrecision] - N[(a * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * y$95$m), $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 < 4.99999999999999961e133

   1. Initial program 84.7%

      \[\frac{\left(x \cdot y\right) \cdot z}{\sqrt{z \cdot z - t \cdot a}} \]
   2. 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. lift-sqrt.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift--.f64 N/A

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

      8. associate-/l* N/A

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

      9. associate-*l* N/A

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

      10. lower-*.f64 N/A

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

      11. lower-*.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. lift--.f64 N/A

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

      14. lift-*.f64 N/A

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

      15. lift-*.f64 N/A

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

      16. lift-sqrt.f64 90.7

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

      17. lift-*.f64 N/A

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

      18. *-commutative N/A

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

      19. lower-*.f64 90.7

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

   3. Applied rewrites 90.7%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift-sqrt.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift--.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

   5. Applied rewrites 90.7%

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

   if 4.99999999999999961e133 < z

   1. Initial program 22.3%

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

   2. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 98.2

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

   4. Applied rewrites 98.2%

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

Alternative 3: 85.1% accurate, 1.0× speedup

Math

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

FPCore

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

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
z\_m = fabs(z);
z\_s = copysign(1.0, z);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
	double tmp;
	if (z_m <= 6e-108) {
		tmp = x_m * ((z_m * y_m) / sqrt((-a * t)));
	} else {
		tmp = y_m * x_m;
	}
	return z_s * (y_s * (x_s * tmp));
}

Fortran

x\_m =     private
x\_s =     private
y\_m =     private
y\_s =     private
z\_m =     private
z\_s =     private
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
use fmin_fmax_functions
    real(8), intent (in) :: z_s
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z_m
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if (z_m <= 6d-108) then
        tmp = x_m * ((z_m * y_m) / sqrt((-a * t)))
    else
        tmp = y_m * x_m
    end if
    code = z_s * (y_s * (x_s * tmp))
end function

Java

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

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
[x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a])
def code(z_s, y_s, x_s, x_m, y_m, z_m, t, a):
	tmp = 0
	if z_m <= 6e-108:
		tmp = x_m * ((z_m * y_m) / math.sqrt((-a * t)))
	else:
		tmp = y_m * x_m
	return z_s * (y_s * (x_s * tmp))

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
y\_m = abs(y)
y\_s = copysign(1.0, y)
z\_m = abs(z)
z\_s = copysign(1.0, z)
x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a])
function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
	tmp = 0.0
	if (z_m <= 6e-108)
		tmp = Float64(x_m * Float64(Float64(z_m * y_m) / sqrt(Float64(Float64(-a) * t))));
	else
		tmp = Float64(y_m * x_m);
	end
	return Float64(z_s * Float64(y_s * Float64(x_s * tmp)))
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
z\_m = abs(z);
z\_s = sign(z) * 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(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
	tmp = 0.0;
	if (z_m <= 6e-108)
		tmp = x_m * ((z_m * y_m) / sqrt((-a * t)));
	else
		tmp = y_m * x_m;
	end
	tmp_2 = z_s * (y_s * (x_s * tmp));
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, 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[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * If[LessEqual[z$95$m, 6e-108], N[(x$95$m * N[(N[(z$95$m * y$95$m), $MachinePrecision] / N[Sqrt[N[((-a) * t), $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.99999999999999986e-108

   1. Initial program 78.3%

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

   2. 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)}}} \]
   3. Step-by-step derivation

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 70.9

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

   4. Applied rewrites 70.9%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*l* N/A

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

      5. associate-/l* N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. *-commutative N/A

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

      9. lift-*.f64 80.1

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

      10. *-commutative 80.1

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

   6. Applied rewrites 80.1%

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

   if 5.99999999999999986e-108 < z

   1. Initial program 56.5%

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

   2. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 86.7

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

   4. Applied rewrites 86.7%

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

Alternative 4: 84.2% accurate, 1.0× speedup

Math

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

FPCore

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

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
z\_m = fabs(z);
z\_s = copysign(1.0, z);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
	double tmp;
	if (z_m <= 6e-108) {
		tmp = x_m * (y_m * (z_m / sqrt((-a * t))));
	} else {
		tmp = y_m * x_m;
	}
	return z_s * (y_s * (x_s * tmp));
}

Fortran

x\_m =     private
x\_s =     private
y\_m =     private
y\_s =     private
z\_m =     private
z\_s =     private
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
use fmin_fmax_functions
    real(8), intent (in) :: z_s
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z_m
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if (z_m <= 6d-108) then
        tmp = x_m * (y_m * (z_m / sqrt((-a * t))))
    else
        tmp = y_m * x_m
    end if
    code = z_s * (y_s * (x_s * tmp))
end function

Java

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

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
[x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a])
def code(z_s, y_s, x_s, x_m, y_m, z_m, t, a):
	tmp = 0
	if z_m <= 6e-108:
		tmp = x_m * (y_m * (z_m / math.sqrt((-a * t))))
	else:
		tmp = y_m * x_m
	return z_s * (y_s * (x_s * tmp))

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
y\_m = abs(y)
y\_s = copysign(1.0, y)
z\_m = abs(z)
z\_s = copysign(1.0, z)
x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a])
function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
	tmp = 0.0
	if (z_m <= 6e-108)
		tmp = Float64(x_m * Float64(y_m * Float64(z_m / sqrt(Float64(Float64(-a) * t)))));
	else
		tmp = Float64(y_m * x_m);
	end
	return Float64(z_s * Float64(y_s * Float64(x_s * tmp)))
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
z\_m = abs(z);
z\_s = sign(z) * 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(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
	tmp = 0.0;
	if (z_m <= 6e-108)
		tmp = x_m * (y_m * (z_m / sqrt((-a * t))));
	else
		tmp = y_m * x_m;
	end
	tmp_2 = z_s * (y_s * (x_s * tmp));
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, 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[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * If[LessEqual[z$95$m, 6e-108], N[(x$95$m * N[(y$95$m * N[(z$95$m / N[Sqrt[N[((-a) * t), $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.99999999999999986e-108

   1. Initial program 78.3%

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

   2. 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)}}} \]
   3. Step-by-step derivation

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 70.9

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

   4. Applied rewrites 70.9%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*l* N/A

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

      5. associate-/l* N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. *-commutative N/A

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

      9. lift-*.f64 80.1

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

      10. *-commutative 80.1

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

   6. Applied rewrites 80.1%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 76.0

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

   8. Applied rewrites 76.0%

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

   if 5.99999999999999986e-108 < z

   1. Initial program 56.5%

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

   2. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 86.7

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

   4. Applied rewrites 86.7%

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

Alternative 5: 76.0% accurate, 1.5× speedup

Math

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

FPCore

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

C

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

Fortran

x\_m =     private
x\_s =     private
y\_m =     private
y\_s =     private
z\_m =     private
z\_s =     private
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
use fmin_fmax_functions
    real(8), intent (in) :: z_s
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z_m
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if (z_m <= 3.9d-132) then
        tmp = ((x_m * y_m) * z_m) / z_m
    else
        tmp = y_m * x_m
    end if
    code = z_s * (y_s * (x_s * tmp))
end function

Java

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

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
[x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a])
def code(z_s, y_s, x_s, x_m, y_m, z_m, t, a):
	tmp = 0
	if z_m <= 3.9e-132:
		tmp = ((x_m * y_m) * z_m) / z_m
	else:
		tmp = y_m * x_m
	return z_s * (y_s * (x_s * tmp))

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
y\_m = abs(y)
y\_s = copysign(1.0, y)
z\_m = abs(z)
z\_s = copysign(1.0, z)
x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a])
function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
	tmp = 0.0
	if (z_m <= 3.9e-132)
		tmp = Float64(Float64(Float64(x_m * y_m) * z_m) / z_m);
	else
		tmp = Float64(y_m * x_m);
	end
	return Float64(z_s * Float64(y_s * Float64(x_s * tmp)))
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
z\_m = abs(z);
z\_s = sign(z) * 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(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
	tmp = 0.0;
	if (z_m <= 3.9e-132)
		tmp = ((x_m * y_m) * z_m) / z_m;
	else
		tmp = y_m * x_m;
	end
	tmp_2 = z_s * (y_s * (x_s * tmp));
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, 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[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * If[LessEqual[z$95$m, 3.9e-132], N[(N[(N[(x$95$m * y$95$m), $MachinePrecision] * z$95$m), $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 < 3.89999999999999982e-132

   1. Initial program 77.0%

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

   2. Taylor expanded in z around inf

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

   4. Applied rewrites 40.1%

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

   if 3.89999999999999982e-132 < z

   1. Initial program 57.7%

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

   2. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 85.3

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

   4. Applied rewrites 85.3%

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

Alternative 6: 73.3% accurate, 5.2× speedup

Math

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

FPCore

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

C

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

Fortran

x\_m =     private
x\_s =     private
y\_m =     private
y\_s =     private
z\_m =     private
z\_s =     private
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
use fmin_fmax_functions
    real(8), intent (in) :: z_s
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z_m
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    code = z_s * (y_s * (x_s * (y_m * x_m)))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, 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[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * N[(y$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 61.6%

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

2. Taylor expanded in z around inf

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

   1. *-commutative N/A

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

   2. lower-*.f64 73.3

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

4. Applied rewrites 73.3%

   \[\leadsto \color{blue}{y \cdot x} \]
5. Add Preprocessing

Reproduce

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