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

Percentage Accurate: 61.1% → 92.7%

Time: 5.5s

Alternatives: 7

Speedup: 3.0×

Specification

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 61.1% 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.7% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

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

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

Java

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

Python

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

Julia

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

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
function tmp_2 = code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
	tmp = 0.0;
	if (z_m <= 7.3e+59)
		tmp = x_m * ((z_m * y_m) / sqrt(((z_m * z_m) - (a * t))));
	else
		tmp = (y_m * x_m) * 1.0;
	end
	tmp_2 = z_s * (y_s * (x_s * tmp));
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < 7.3000000000000003e59

   1. Initial program 61.1%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-sqrt.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift--.f64 N/A

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

      8. associate-*l* N/A

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

      9. pow2 N/A

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

      10. *-commutative N/A

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

      11. associate-/l* N/A

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

      12. lower-*.f64 N/A

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

      13. *-commutative N/A

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

      14. pow2 N/A

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

      15. lower-/.f64 N/A

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

      16. *-commutative N/A

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

      17. lower-*.f64 N/A

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

      18. lift--.f64 N/A

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

   3. Applied rewrites 62.1%

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

   if 7.3000000000000003e59 < z

   1. Initial program 61.1%

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

   2. Taylor expanded in t around 0

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

      1. pow2 N/A

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

      2. rem-sqrt-square-rev N/A

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

      3. lower-fabs.f64 65.6

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

   4. Applied rewrites 65.6%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-/l* N/A

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

      5. lower-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lift-*.f64 N/A

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

      8. lower-/.f64 73.2

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

   6. Applied rewrites 73.2%

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

   7. Taylor expanded in z around inf

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

   9. Applied rewrites 73.2%

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

Alternative 2: 84.2% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

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

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

Java

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

Python

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

Julia

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

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
function tmp_2 = code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
	tmp = 0.0;
	if (z_m <= 5.8e-95)
		tmp = ((z_m * y_m) * x_m) / sqrt((-a * t));
	else
		tmp = (y_m * x_m) * 1.0;
	end
	tmp_2 = z_s * (y_s * (x_s * tmp));
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < 5.80000000000000004e-95

   1. Initial program 61.1%

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

   2. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

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

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

      8. lower-*.f64 N/A

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

      9. lower-neg.f64 33.1

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

   4. Applied rewrites 33.1%

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

   if 5.80000000000000004e-95 < z

   1. Initial program 61.1%

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

   2. Taylor expanded in t around 0

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

      1. pow2 N/A

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

      2. rem-sqrt-square-rev N/A

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

      3. lower-fabs.f64 65.6

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

   4. Applied rewrites 65.6%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-/l* N/A

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

      5. lower-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lift-*.f64 N/A

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

      8. lower-/.f64 73.2

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

   6. Applied rewrites 73.2%

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

   7. Taylor expanded in z around inf

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

   9. Applied rewrites 73.2%

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

Alternative 3: 76.3% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Fortran

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

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

real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
use fmin_fmax_functions
    real(8), intent (in) :: z_s
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z_m
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (x_m * y_m) * z_m
    if ((t_1 / sqrt(((z_m * z_m) - (t * a)))) <= 0.0d0) then
        tmp = t_1 / abs(z_m)
    else
        tmp = (y_m * x_m) * 1.0d0
    end if
    code = z_s * (y_s * (x_s * tmp))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 (*.f64 x y) z) (sqrt.f64 (-.f64 (*.f64 z z) (*.f64 t a)))) < 0.0

   1. Initial program 61.1%

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

   2. Taylor expanded in t around 0

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

      1. pow2 N/A

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

      2. rem-sqrt-square-rev N/A

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

      3. lower-fabs.f64 65.6

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

   4. Applied rewrites 65.6%

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

   if 0.0 < (/.f64 (*.f64 (*.f64 x y) z) (sqrt.f64 (-.f64 (*.f64 z z) (*.f64 t a))))

   1. Initial program 61.1%

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

   2. Taylor expanded in t around 0

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

      1. pow2 N/A

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

      2. rem-sqrt-square-rev N/A

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

      3. lower-fabs.f64 65.6

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

   4. Applied rewrites 65.6%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-/l* N/A

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

      5. lower-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lift-*.f64 N/A

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

      8. lower-/.f64 73.2

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

   6. Applied rewrites 73.2%

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

   7. Taylor expanded in z around inf

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

   9. Applied rewrites 73.2%

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

Alternative 4: 76.2% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Fortran

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

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < 8.0000000000000003e-83

   1. Initial program 61.1%

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

   2. Taylor expanded in t around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. pow2 N/A

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

      7. rem-sqrt-square-rev N/A

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

      8. lower-fabs.f64 56.1

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

   4. Applied rewrites 56.1%

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

   if 8.0000000000000003e-83 < z

   1. Initial program 61.1%

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

   2. Taylor expanded in t around 0

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

      1. pow2 N/A

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

      2. rem-sqrt-square-rev N/A

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

      3. lower-fabs.f64 65.6

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

   4. Applied rewrites 65.6%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-/l* N/A

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

      5. lower-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lift-*.f64 N/A

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

      8. lower-/.f64 73.2

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

   6. Applied rewrites 73.2%

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

   7. Taylor expanded in z around inf

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

   9. Applied rewrites 73.2%

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

Alternative 5: 74.9% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < 1.02e-179

   1. Initial program 61.1%

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

   2. Taylor expanded in z around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 17.3

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

   4. Applied rewrites 17.3%

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

   if 1.02e-179 < z

   1. Initial program 61.1%

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

   2. Taylor expanded in t around 0

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

      1. pow2 N/A

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

      2. rem-sqrt-square-rev N/A

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

      3. lower-fabs.f64 65.6

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

   4. Applied rewrites 65.6%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-/l* N/A

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

      5. lower-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lift-*.f64 N/A

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

      8. lower-/.f64 73.2

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

   6. Applied rewrites 73.2%

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

   7. Taylor expanded in z around inf

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

   9. Applied rewrites 73.2%

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

Alternative 6: 73.2% accurate, 3.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 61.1%

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

2. Taylor expanded in t around 0

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

   1. pow2 N/A

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

   2. rem-sqrt-square-rev N/A

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

   3. lower-fabs.f64 65.6

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

4. Applied rewrites 65.6%

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

   1. lift-/.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. lift-*.f64 N/A

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

   4. associate-/l* N/A

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

   5. lower-*.f64 N/A

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

   6. *-commutative N/A

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

   7. lift-*.f64 N/A

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

   8. lower-/.f64 73.2

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

6. Applied rewrites 73.2%

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

7. Taylor expanded in z around inf

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

9. Applied rewrites 73.2%

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

Alternative 7: 13.7% accurate, 4.2× speedup

Math

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

FPCore

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

C

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

Fortran

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

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 61.1%

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

2. Taylor expanded in z around -inf

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

   1. mul-1-neg N/A

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

   2. lower-neg.f64 N/A

      \[\leadsto -x \cdot y \]

   3. *-commutative N/A

      \[\leadsto -y \cdot x \]

   4. lower-*.f64 13.7

      \[\leadsto -y \cdot x \]

4. Applied rewrites 13.7%

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

Reproduce

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