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

Percentage Accurate: 60.0% → 92.6%

Time: 6.6s

Alternatives: 8

Speedup: 4.1×

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: 60.0% 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: 92.6% 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 2 \cdot 10^{+139}:\\ \;\;\;\;x\_m \cdot \left(y\_m \cdot \frac{z\_m}{\sqrt{\mathsf{fma}\left(-t, a, z\_m \cdot z\_m\right)}}\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\frac{z\_m}{\mathsf{fma}\left(-0.5 \cdot a, \frac{t}{z\_m}, z\_m\right)} \cdot x\_m\right) \cdot y\_m\\ \end{array}\right)\right) \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < 2.00000000000000007e139

   1. Initial program 69.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. lift-*.f64 N/A

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

      5. associate-*l* N/A

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

      6. lower-*.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. lower-/.f64 72.2

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

      9. lift--.f64 N/A

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

      10. lift-*.f64 N/A

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

      11. fp-cancel-sub-sign-inv N/A

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

      12. +-commutative N/A

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

      13. lower-fma.f64 N/A

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

      14. lower-neg.f64 72.7

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

   4. Applied rewrites 72.7%

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

   if 2.00000000000000007e139 < z

   1. Initial program 26.3%

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

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

      7. lift--.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. fp-cancel-sub-sign-inv N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-neg.f64 30.8

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

      13. lift-*.f64 N/A

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

      14. *-commutative N/A

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

      15. lower-*.f64 30.8

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

   4. Applied rewrites 30.8%

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

   5. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-*.f64 96.0

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

   7. Applied rewrites 96.0%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. lower-*.f64 N/A

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

   9. Applied rewrites 100.0%

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

Alternative 2: 85.2% 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 5 \cdot 10^{-124}:\\ \;\;\;\;x\_m \cdot \frac{z\_m \cdot y\_m}{\sqrt{\left(-a\right) \cdot t}}\\ \mathbf{else}:\\ \;\;\;\;\left(\frac{z\_m}{\mathsf{fma}\left(-0.5 \cdot a, \frac{t}{z\_m}, z\_m\right)} \cdot x\_m\right) \cdot y\_m\\ \end{array}\right)\right) \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < 5.0000000000000003e-124

   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. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 40.3

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

   5. Applied rewrites 40.3%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*l* N/A

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

      5. *-commutative N/A

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

      6. lift-*.f64 N/A

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

      7. associate-/l* N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 37.5

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

   7. Applied rewrites 37.5%

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

   if 5.0000000000000003e-124 < z

   1. Initial program 58.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. 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 62.3

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

      7. lift--.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. fp-cancel-sub-sign-inv N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-neg.f64 63.3

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

      13. lift-*.f64 N/A

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

      14. *-commutative N/A

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

      15. lower-*.f64 63.3

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

   4. Applied rewrites 63.3%

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

   5. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-*.f64 84.7

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

   7. Applied rewrites 84.7%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. lower-*.f64 N/A

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

   9. Applied rewrites 86.5%

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

Alternative 3: 84.0% 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 3.05 \cdot 10^{-118}:\\ \;\;\;\;x\_m \cdot \frac{z\_m \cdot y\_m}{\sqrt{\left(-a\right) \cdot t}}\\ \mathbf{else}:\\ \;\;\;\;1 \cdot \left(y\_m \cdot x\_m\right)\\ \end{array}\right)\right) \end{array} \]

FPCore

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

Fortran

z\_m =     private
z\_s =     private
y\_m =     private
y\_s =     private
x\_m =     private
x\_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(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
use fmin_fmax_functions
    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 <= 3.05d-118) then
        tmp = x_m * ((z_m * y_m) / sqrt((-a * t)))
    else
        tmp = 1.0d0 * (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 <= 3.05e-118) {
		tmp = x_m * ((z_m * y_m) / Math.sqrt((-a * t)));
	} else {
		tmp = 1.0 * (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 <= 3.05e-118:
		tmp = x_m * ((z_m * y_m) / math.sqrt((-a * t)))
	else:
		tmp = 1.0 * (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 <= 3.05e-118)
		tmp = Float64(x_m * Float64(Float64(z_m * y_m) / sqrt(Float64(Float64(-a) * t))));
	else
		tmp = Float64(1.0 * 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 <= 3.05e-118)
		tmp = x_m * ((z_m * y_m) / sqrt((-a * t)));
	else
		tmp = 1.0 * (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, 3.05e-118], N[(x$95$m * N[(N[(z$95$m * y$95$m), $MachinePrecision] / N[Sqrt[N[((-a) * t), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 * N[(y$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < 3.04999999999999992e-118

   1. Initial program 63.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 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. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 40.0

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

   5. Applied rewrites 40.0%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*l* N/A

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

      5. *-commutative N/A

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

      6. lift-*.f64 N/A

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

      7. associate-/l* N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 37.3

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

   7. Applied rewrites 37.3%

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

   if 3.04999999999999992e-118 < z

   1. Initial program 58.9%

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

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

      7. lift--.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. fp-cancel-sub-sign-inv N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-neg.f64 63.9

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

      13. lift-*.f64 N/A

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

      14. *-commutative N/A

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

      15. lower-*.f64 63.9

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

   4. Applied rewrites 63.9%

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

   5. Taylor expanded in z around inf

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

   7. Applied rewrites 86.4%

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

Alternative 4: 83.1% 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 3.05 \cdot 10^{-118}:\\ \;\;\;\;x\_m \cdot \left(y\_m \cdot \frac{z\_m}{\sqrt{\left(-a\right) \cdot t}}\right)\\ \mathbf{else}:\\ \;\;\;\;1 \cdot \left(y\_m \cdot x\_m\right)\\ \end{array}\right)\right) \end{array} \]

FPCore

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

Fortran

z\_m =     private
z\_s =     private
y\_m =     private
y\_s =     private
x\_m =     private
x\_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(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
use fmin_fmax_functions
    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 <= 3.05d-118) then
        tmp = x_m * (y_m * (z_m / sqrt((-a * t))))
    else
        tmp = 1.0d0 * (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 <= 3.05e-118) {
		tmp = x_m * (y_m * (z_m / Math.sqrt((-a * t))));
	} else {
		tmp = 1.0 * (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 <= 3.05e-118:
		tmp = x_m * (y_m * (z_m / math.sqrt((-a * t))))
	else:
		tmp = 1.0 * (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 <= 3.05e-118)
		tmp = Float64(x_m * Float64(y_m * Float64(z_m / sqrt(Float64(Float64(-a) * t)))));
	else
		tmp = Float64(1.0 * 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 <= 3.05e-118)
		tmp = x_m * (y_m * (z_m / sqrt((-a * t))));
	else
		tmp = 1.0 * (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, 3.05e-118], N[(x$95$m * N[(y$95$m * N[(z$95$m / N[Sqrt[N[((-a) * t), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 * N[(y$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < 3.04999999999999992e-118

   1. Initial program 63.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 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. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 40.0

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

   5. Applied rewrites 40.0%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. lift-*.f64 N/A

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

      5. associate-*l* N/A

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

      6. lower-*.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. lower-/.f64 36.3

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

   7. Applied rewrites 36.3%

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

   if 3.04999999999999992e-118 < z

   1. Initial program 58.9%

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

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

      7. lift--.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. fp-cancel-sub-sign-inv N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-neg.f64 63.9

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

      13. lift-*.f64 N/A

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

      14. *-commutative N/A

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

      15. lower-*.f64 63.9

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

   4. Applied rewrites 63.9%

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

   5. Taylor expanded in z around inf

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

   7. Applied rewrites 86.4%

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

Alternative 5: 76.3% accurate, 1.4× speedup

Math

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

FPCore

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

Fortran

z\_m =     private
z\_s =     private
y\_m =     private
y\_s =     private
x\_m =     private
x\_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(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
use fmin_fmax_functions
    real(8), intent (in) :: x_s
    real(8), intent (in) :: y_s
    real(8), intent (in) :: z_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z_m
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if (z_m <= 1d-120) then
        tmp = (1.0d0 / z_m) * ((z_m * y_m) * x_m)
    else
        tmp = 1.0d0 * (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 <= 1e-120) {
		tmp = (1.0 / z_m) * ((z_m * y_m) * x_m);
	} else {
		tmp = 1.0 * (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 <= 1e-120:
		tmp = (1.0 / z_m) * ((z_m * y_m) * x_m)
	else:
		tmp = 1.0 * (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 <= 1e-120)
		tmp = Float64(Float64(1.0 / z_m) * Float64(Float64(z_m * y_m) * x_m));
	else
		tmp = Float64(1.0 * 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 <= 1e-120)
		tmp = (1.0 / z_m) * ((z_m * y_m) * x_m);
	else
		tmp = 1.0 * (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, 1e-120], N[(N[(1.0 / z$95$m), $MachinePrecision] * N[(N[(z$95$m * y$95$m), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision], N[(1.0 * N[(y$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < 9.99999999999999979e-121

   1. Initial program 63.1%

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

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. fp-cancel-sub-sign-inv N/A

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

      6. mul-1-neg N/A

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

      7. associate-*r* N/A

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

      8. +-commutative N/A

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

      9. associate-*r* N/A

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

      10. mul-1-neg N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-neg.f64 N/A

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

      13. unpow2 N/A

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

      14. lower-*.f64 N/A

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

      15. *-commutative N/A

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

      16. lower-*.f64 N/A

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

      17. *-commutative N/A

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

      18. lower-*.f64 61.9

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

   5. Applied rewrites 61.9%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 16.9%

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

   if 9.99999999999999979e-121 < z

   1. Initial program 58.9%

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

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

      7. lift--.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. fp-cancel-sub-sign-inv N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-neg.f64 63.9

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

      13. lift-*.f64 N/A

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

      14. *-commutative N/A

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

      15. lower-*.f64 63.9

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

   4. Applied rewrites 63.9%

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

   5. Taylor expanded in z around inf

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

   7. Applied rewrites 86.4%

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

Alternative 6: 75.5% 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 2.15 \cdot 10^{-222}:\\ \;\;\;\;\frac{\left(x\_m \cdot z\_m\right) \cdot y\_m}{-z\_m}\\ \mathbf{else}:\\ \;\;\;\;1 \cdot \left(y\_m \cdot x\_m\right)\\ \end{array}\right)\right) \end{array} \]

FPCore

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

Fortran

z\_m =     private
z\_s =     private
y\_m =     private
y\_s =     private
x\_m =     private
x\_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(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
use fmin_fmax_functions
    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-222) then
        tmp = ((x_m * z_m) * y_m) / -z_m
    else
        tmp = 1.0d0 * (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-222) {
		tmp = ((x_m * z_m) * y_m) / -z_m;
	} else {
		tmp = 1.0 * (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-222:
		tmp = ((x_m * z_m) * y_m) / -z_m
	else:
		tmp = 1.0 * (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-222)
		tmp = Float64(Float64(Float64(x_m * z_m) * y_m) / Float64(-z_m));
	else
		tmp = Float64(1.0 * 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-222)
		tmp = ((x_m * z_m) * y_m) / -z_m;
	else
		tmp = 1.0 * (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-222], N[(N[(N[(x$95$m * z$95$m), $MachinePrecision] * y$95$m), $MachinePrecision] / (-z$95$m)), $MachinePrecision], N[(1.0 * N[(y$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < 2.14999999999999996e-222

   1. Initial program 62.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 -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 63.6

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

   5. Applied rewrites 63.6%

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

      2. lift-*.f64 N/A

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

      3. associate-*l* N/A

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

      4. *-commutative N/A

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

      5. associate-*l* N/A

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

      6. lift-*.f64 N/A

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

      7. lift-*.f64 56.7

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

   7. Applied rewrites 56.7%

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

   if 2.14999999999999996e-222 < z

   1. Initial program 60.2%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. 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 64.5

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

      7. lift--.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. fp-cancel-sub-sign-inv N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-neg.f64 65.4

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

      13. lift-*.f64 N/A

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

      14. *-commutative N/A

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

      15. lower-*.f64 65.4

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

   4. Applied rewrites 65.4%

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

   5. Taylor expanded in z around inf

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

   7. Applied rewrites 78.7%

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

4. Final simplification 66.9%

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

Alternative 7: 73.5% accurate, 4.1× speedup

Math

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

Fortran

z\_m =     private
z\_s =     private
y\_m =     private
y\_s =     private
x\_m =     private
x\_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(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
use fmin_fmax_functions
    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 * (1.0d0 * (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 * (1.0 * (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 * (1.0 * (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(1.0 * 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 * (1.0 * (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[(1.0 * N[(y$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 61.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. 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 63.6

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

   7. lift--.f64 N/A

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

   8. lift-*.f64 N/A

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

   9. fp-cancel-sub-sign-inv N/A

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

   10. +-commutative N/A

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

   11. lower-fma.f64 N/A

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

   12. lower-neg.f64 64.5

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

   13. lift-*.f64 N/A

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

   14. *-commutative N/A

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

   15. lower-*.f64 64.5

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

4. Applied rewrites 64.5%

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

5. Taylor expanded in z around inf

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

7. Applied rewrites 42.4%

   \[\leadsto \color{blue}{1} \cdot \left(y \cdot x\right) \]
8. Add Preprocessing

Alternative 8: 13.4% accurate, 5.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 \left(\left(-y\_m\right) \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 =     private
z\_s =     private
y\_m =     private
y\_s =     private
x\_m =     private
x\_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(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
use fmin_fmax_functions
    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(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 61.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}{-1 \cdot \left(x \cdot y\right)} \]
4. Step-by-step derivation

   1. mul-1-neg N/A

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

   2. *-commutative N/A

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

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

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

   4. lower-*.f64 N/A

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

   5. lower-neg.f64 44.6

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

5. Applied rewrites 44.6%

   \[\leadsto \color{blue}{\left(-y\right) \cdot x} \]
6. Add Preprocessing

Developer Target 1: 87.3% 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

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
    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 2025015 
(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)))))