Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, I

Percentage Accurate: 91.6% → 96.1%

Time: 5.6s

Alternatives: 12

Speedup: 0.7×

• 28.6% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

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

FPCore

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

C

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

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 * 9.0d0) * t)) / (a * 2.0d0)
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	return ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
}

Python

def code(x, y, z, t, a):
	return ((x * y) - ((z * 9.0) * t)) / (a * 2.0)

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 91.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

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 * 9.0d0) * t)) / (a * 2.0d0)
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	return ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
}

Python

def code(x, y, z, t, a):
	return ((x * y) - ((z * 9.0) * t)) / (a * 2.0)

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 96.1% accurate, 0.3× speedup

Math

\[\begin{array}{l} a\_m = \left|a\right| \\ a\_s = \mathsf{copysign}\left(1, a\right) \\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\\\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\ \\ \begin{array}{l} t_1 := \frac{x \cdot y - \left(z \cdot 9\right) \cdot t}{a\_m \cdot 2}\\ a\_s \cdot \begin{array}{l} \mathbf{if}\;t\_1 \leq -\infty:\\ \;\;\;\;\frac{\mathsf{fma}\left(0.5, x, t \cdot \left(\frac{z}{y} \cdot -4.5\right)\right)}{a\_m} \cdot y\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+301}:\\ \;\;\;\;\mathsf{fma}\left(-9 \cdot z, t, y \cdot x\right) \cdot \frac{0.5}{a\_m}\\ \mathbf{else}:\\ \;\;\;\;\left(\frac{\mathsf{fma}\left(\frac{y}{z}, 0.5, \frac{t}{x} \cdot -4.5\right)}{a\_m} \cdot z\right) \cdot x\\ \end{array} \end{array} \end{array} \]

FPCore

a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
 :precision binary64
 (let* ((t_1 (/ (- (* x y) (* (* z 9.0) t)) (* a_m 2.0))))
   (*
    a_s
    (if (<= t_1 (- INFINITY))
      (* (/ (fma 0.5 x (* t (* (/ z y) -4.5))) a_m) y)
      (if (<= t_1 2e+301)
        (* (fma (* -9.0 z) t (* y x)) (/ 0.5 a_m))
        (* (* (/ (fma (/ y z) 0.5 (* (/ t x) -4.5)) a_m) z) x))))))

C

a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
	double t_1 = ((x * y) - ((z * 9.0) * t)) / (a_m * 2.0);
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = (fma(0.5, x, (t * ((z / y) * -4.5))) / a_m) * y;
	} else if (t_1 <= 2e+301) {
		tmp = fma((-9.0 * z), t, (y * x)) * (0.5 / a_m);
	} else {
		tmp = ((fma((y / z), 0.5, ((t / x) * -4.5)) / a_m) * z) * x;
	}
	return a_s * tmp;
}

Julia

a\_m = abs(a)
a\_s = copysign(1.0, a)
x, y, z, t, a_m = sort([x, y, z, t, a_m])
x, y, z, t, a_m = sort([x, y, z, t, a_m])
function code(a_s, x, y, z, t, a_m)
	t_1 = Float64(Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t)) / Float64(a_m * 2.0))
	tmp = 0.0
	if (t_1 <= Float64(-Inf))
		tmp = Float64(Float64(fma(0.5, x, Float64(t * Float64(Float64(z / y) * -4.5))) / a_m) * y);
	elseif (t_1 <= 2e+301)
		tmp = Float64(fma(Float64(-9.0 * z), t, Float64(y * x)) * Float64(0.5 / a_m));
	else
		tmp = Float64(Float64(Float64(fma(Float64(y / z), 0.5, Float64(Float64(t / x) * -4.5)) / a_m) * z) * x);
	end
	return Float64(a_s * tmp)
end

Wolfram

a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := Block[{t$95$1 = N[(N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] / N[(a$95$m * 2.0), $MachinePrecision]), $MachinePrecision]}, N[(a$95$s * If[LessEqual[t$95$1, (-Infinity)], N[(N[(N[(0.5 * x + N[(t * N[(N[(z / y), $MachinePrecision] * -4.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / a$95$m), $MachinePrecision] * y), $MachinePrecision], If[LessEqual[t$95$1, 2e+301], N[(N[(N[(-9.0 * z), $MachinePrecision] * t + N[(y * x), $MachinePrecision]), $MachinePrecision] * N[(0.5 / a$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(N[(y / z), $MachinePrecision] * 0.5 + N[(N[(t / x), $MachinePrecision] * -4.5), $MachinePrecision]), $MachinePrecision] / a$95$m), $MachinePrecision] * z), $MachinePrecision] * x), $MachinePrecision]]]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) (*.f64 a #s(literal 2 binary64))) < -inf.0

   1. Initial program 81.1%

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

   3. Taylor expanded in y around inf

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

   5. Applied rewrites 93.0%

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

   if -inf.0 < (/.f64 (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) (*.f64 a #s(literal 2 binary64))) < 2.00000000000000011e301

   1. Initial program 98.7%

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

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{-9}{2} \cdot \frac{t \cdot z}{a} + \frac{1}{2} \cdot \frac{x \cdot y}{a}} \]

   5. Applied rewrites 99.1%

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

   if 2.00000000000000011e301 < (/.f64 (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) (*.f64 a #s(literal 2 binary64)))

   1. Initial program 78.9%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 92.3%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 96.0%

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

Alternative 2: 96.3% accurate, 0.3× speedup

Math

\[\begin{array}{l} a\_m = \left|a\right| \\ a\_s = \mathsf{copysign}\left(1, a\right) \\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\\\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\ \\ \begin{array}{l} t_1 := x \cdot y - \left(z \cdot 9\right) \cdot t\\ a\_s \cdot \begin{array}{l} \mathbf{if}\;t\_1 \leq -\infty:\\ \;\;\;\;\frac{\mathsf{fma}\left(0.5, x, t \cdot \left(\frac{z}{y} \cdot -4.5\right)\right)}{a\_m} \cdot y\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+300}:\\ \;\;\;\;\mathsf{fma}\left(-9 \cdot z, t, y \cdot x\right) \cdot \frac{0.5}{a\_m}\\ \mathbf{else}:\\ \;\;\;\;\left(\frac{\mathsf{fma}\left(\frac{x}{z}, 0.5, \frac{t}{y} \cdot -4.5\right)}{a\_m} \cdot z\right) \cdot y\\ \end{array} \end{array} \end{array} \]

FPCore

a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
 :precision binary64
 (let* ((t_1 (- (* x y) (* (* z 9.0) t))))
   (*
    a_s
    (if (<= t_1 (- INFINITY))
      (* (/ (fma 0.5 x (* t (* (/ z y) -4.5))) a_m) y)
      (if (<= t_1 5e+300)
        (* (fma (* -9.0 z) t (* y x)) (/ 0.5 a_m))
        (* (* (/ (fma (/ x z) 0.5 (* (/ t y) -4.5)) a_m) z) y))))))

C

a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
	double t_1 = (x * y) - ((z * 9.0) * t);
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = (fma(0.5, x, (t * ((z / y) * -4.5))) / a_m) * y;
	} else if (t_1 <= 5e+300) {
		tmp = fma((-9.0 * z), t, (y * x)) * (0.5 / a_m);
	} else {
		tmp = ((fma((x / z), 0.5, ((t / y) * -4.5)) / a_m) * z) * y;
	}
	return a_s * tmp;
}

Julia

a\_m = abs(a)
a\_s = copysign(1.0, a)
x, y, z, t, a_m = sort([x, y, z, t, a_m])
x, y, z, t, a_m = sort([x, y, z, t, a_m])
function code(a_s, x, y, z, t, a_m)
	t_1 = Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t))
	tmp = 0.0
	if (t_1 <= Float64(-Inf))
		tmp = Float64(Float64(fma(0.5, x, Float64(t * Float64(Float64(z / y) * -4.5))) / a_m) * y);
	elseif (t_1 <= 5e+300)
		tmp = Float64(fma(Float64(-9.0 * z), t, Float64(y * x)) * Float64(0.5 / a_m));
	else
		tmp = Float64(Float64(Float64(fma(Float64(x / z), 0.5, Float64(Float64(t / y) * -4.5)) / a_m) * z) * y);
	end
	return Float64(a_s * tmp)
end

Wolfram

a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := Block[{t$95$1 = N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]}, N[(a$95$s * If[LessEqual[t$95$1, (-Infinity)], N[(N[(N[(0.5 * x + N[(t * N[(N[(z / y), $MachinePrecision] * -4.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / a$95$m), $MachinePrecision] * y), $MachinePrecision], If[LessEqual[t$95$1, 5e+300], N[(N[(N[(-9.0 * z), $MachinePrecision] * t + N[(y * x), $MachinePrecision]), $MachinePrecision] * N[(0.5 / a$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(N[(x / z), $MachinePrecision] * 0.5 + N[(N[(t / y), $MachinePrecision] * -4.5), $MachinePrecision]), $MachinePrecision] / a$95$m), $MachinePrecision] * z), $MachinePrecision] * y), $MachinePrecision]]]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < -inf.0

   1. Initial program 66.3%

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

   3. Taylor expanded in y around inf

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

   5. Applied rewrites 89.7%

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

   if -inf.0 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < 5.00000000000000026e300

   1. Initial program 99.0%

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

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{-9}{2} \cdot \frac{t \cdot z}{a} + \frac{1}{2} \cdot \frac{x \cdot y}{a}} \]

   5. Applied rewrites 99.3%

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

   if 5.00000000000000026e300 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t))

   1. Initial program 64.6%

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

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{-9}{2} \cdot \frac{t \cdot z}{a} + \frac{1}{2} \cdot \frac{x \cdot y}{a}} \]

   5. Applied rewrites 67.7%

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

   6. Taylor expanded in y around inf

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

      1. distribute-rgt-in N/A

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

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

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

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

         \[\leadsto \left(\frac{-9}{2} \cdot \frac{t \cdot z}{a \cdot y}\right) \cdot y - \left(\left(\mathsf{neg}\left(\frac{1}{2}\right)\right) \cdot \frac{x}{a}\right) \cdot y \]

      4. metadata-eval N/A

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

      5. distribute-rgt-out-- N/A

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

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

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

      7. metadata-eval N/A

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

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

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

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

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

      10. distribute-neg-in N/A

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

      11. +-commutative N/A

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

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

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

   8. Applied rewrites 84.8%

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

   9. Taylor expanded in z around inf

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

   11. Applied rewrites 93.9%

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

Alternative 3: 96.6% accurate, 0.4× speedup

Math

\[\begin{array}{l} a\_m = \left|a\right| \\ a\_s = \mathsf{copysign}\left(1, a\right) \\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\\\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\ \\ \begin{array}{l} t_1 := x \cdot y - \left(z \cdot 9\right) \cdot t\\ a\_s \cdot \begin{array}{l} \mathbf{if}\;t\_1 \leq -\infty \lor \neg \left(t\_1 \leq 5 \cdot 10^{+295}\right):\\ \;\;\;\;\frac{\mathsf{fma}\left(0.5, x, t \cdot \left(\frac{z}{y} \cdot -4.5\right)\right)}{a\_m} \cdot y\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-9 \cdot z, t, y \cdot x\right) \cdot \frac{0.5}{a\_m}\\ \end{array} \end{array} \end{array} \]

FPCore

a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
 :precision binary64
 (let* ((t_1 (- (* x y) (* (* z 9.0) t))))
   (*
    a_s
    (if (or (<= t_1 (- INFINITY)) (not (<= t_1 5e+295)))
      (* (/ (fma 0.5 x (* t (* (/ z y) -4.5))) a_m) y)
      (* (fma (* -9.0 z) t (* y x)) (/ 0.5 a_m))))))

C

a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
	double t_1 = (x * y) - ((z * 9.0) * t);
	double tmp;
	if ((t_1 <= -((double) INFINITY)) || !(t_1 <= 5e+295)) {
		tmp = (fma(0.5, x, (t * ((z / y) * -4.5))) / a_m) * y;
	} else {
		tmp = fma((-9.0 * z), t, (y * x)) * (0.5 / a_m);
	}
	return a_s * tmp;
}

Julia

a\_m = abs(a)
a\_s = copysign(1.0, a)
x, y, z, t, a_m = sort([x, y, z, t, a_m])
x, y, z, t, a_m = sort([x, y, z, t, a_m])
function code(a_s, x, y, z, t, a_m)
	t_1 = Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t))
	tmp = 0.0
	if ((t_1 <= Float64(-Inf)) || !(t_1 <= 5e+295))
		tmp = Float64(Float64(fma(0.5, x, Float64(t * Float64(Float64(z / y) * -4.5))) / a_m) * y);
	else
		tmp = Float64(fma(Float64(-9.0 * z), t, Float64(y * x)) * Float64(0.5 / a_m));
	end
	return Float64(a_s * tmp)
end

Wolfram

a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := Block[{t$95$1 = N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]}, N[(a$95$s * If[Or[LessEqual[t$95$1, (-Infinity)], N[Not[LessEqual[t$95$1, 5e+295]], $MachinePrecision]], N[(N[(N[(0.5 * x + N[(t * N[(N[(z / y), $MachinePrecision] * -4.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / a$95$m), $MachinePrecision] * y), $MachinePrecision], N[(N[(N[(-9.0 * z), $MachinePrecision] * t + N[(y * x), $MachinePrecision]), $MachinePrecision] * N[(0.5 / a$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < -inf.0 or 4.99999999999999991e295 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t))

   1. Initial program 66.5%

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

   3. Taylor expanded in y around inf

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

   5. Applied rewrites 90.7%

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

   if -inf.0 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < 4.99999999999999991e295

   1. Initial program 99.0%

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

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{-9}{2} \cdot \frac{t \cdot z}{a} + \frac{1}{2} \cdot \frac{x \cdot y}{a}} \]

   5. Applied rewrites 99.3%

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

4. Final simplification 97.2%

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

Alternative 4: 96.7% accurate, 0.4× speedup

Math

\[\begin{array}{l} a\_m = \left|a\right| \\ a\_s = \mathsf{copysign}\left(1, a\right) \\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\\\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\ \\ \begin{array}{l} t_1 := x \cdot y - \left(z \cdot 9\right) \cdot t\\ a\_s \cdot \begin{array}{l} \mathbf{if}\;t\_1 \leq -\infty:\\ \;\;\;\;\frac{\mathsf{fma}\left(0.5, x, t \cdot \left(\frac{z}{y} \cdot -4.5\right)\right)}{a\_m} \cdot y\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+295}:\\ \;\;\;\;\mathsf{fma}\left(-9 \cdot z, t, y \cdot x\right) \cdot \frac{0.5}{a\_m}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(0.5, y, t \cdot \left(\frac{z}{x} \cdot -4.5\right)\right)}{a\_m} \cdot x\\ \end{array} \end{array} \end{array} \]

FPCore

a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
 :precision binary64
 (let* ((t_1 (- (* x y) (* (* z 9.0) t))))
   (*
    a_s
    (if (<= t_1 (- INFINITY))
      (* (/ (fma 0.5 x (* t (* (/ z y) -4.5))) a_m) y)
      (if (<= t_1 5e+295)
        (* (fma (* -9.0 z) t (* y x)) (/ 0.5 a_m))
        (* (/ (fma 0.5 y (* t (* (/ z x) -4.5))) a_m) x))))))

C

a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
	double t_1 = (x * y) - ((z * 9.0) * t);
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = (fma(0.5, x, (t * ((z / y) * -4.5))) / a_m) * y;
	} else if (t_1 <= 5e+295) {
		tmp = fma((-9.0 * z), t, (y * x)) * (0.5 / a_m);
	} else {
		tmp = (fma(0.5, y, (t * ((z / x) * -4.5))) / a_m) * x;
	}
	return a_s * tmp;
}

Julia

a\_m = abs(a)
a\_s = copysign(1.0, a)
x, y, z, t, a_m = sort([x, y, z, t, a_m])
x, y, z, t, a_m = sort([x, y, z, t, a_m])
function code(a_s, x, y, z, t, a_m)
	t_1 = Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t))
	tmp = 0.0
	if (t_1 <= Float64(-Inf))
		tmp = Float64(Float64(fma(0.5, x, Float64(t * Float64(Float64(z / y) * -4.5))) / a_m) * y);
	elseif (t_1 <= 5e+295)
		tmp = Float64(fma(Float64(-9.0 * z), t, Float64(y * x)) * Float64(0.5 / a_m));
	else
		tmp = Float64(Float64(fma(0.5, y, Float64(t * Float64(Float64(z / x) * -4.5))) / a_m) * x);
	end
	return Float64(a_s * tmp)
end

Wolfram

a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := Block[{t$95$1 = N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]}, N[(a$95$s * If[LessEqual[t$95$1, (-Infinity)], N[(N[(N[(0.5 * x + N[(t * N[(N[(z / y), $MachinePrecision] * -4.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / a$95$m), $MachinePrecision] * y), $MachinePrecision], If[LessEqual[t$95$1, 5e+295], N[(N[(N[(-9.0 * z), $MachinePrecision] * t + N[(y * x), $MachinePrecision]), $MachinePrecision] * N[(0.5 / a$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[(0.5 * y + N[(t * N[(N[(z / x), $MachinePrecision] * -4.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / a$95$m), $MachinePrecision] * x), $MachinePrecision]]]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < -inf.0

   1. Initial program 66.3%

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

   3. Taylor expanded in y around inf

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

   5. Applied rewrites 89.7%

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

   if -inf.0 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < 4.99999999999999991e295

   1. Initial program 99.0%

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

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{-9}{2} \cdot \frac{t \cdot z}{a} + \frac{1}{2} \cdot \frac{x \cdot y}{a}} \]

   5. Applied rewrites 99.3%

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

   if 4.99999999999999991e295 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t))

   1. Initial program 66.6%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 94.4%

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

Alternative 5: 95.0% accurate, 0.6× speedup

Math

\[\begin{array}{l} a\_m = \left|a\right| \\ a\_s = \mathsf{copysign}\left(1, a\right) \\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\\\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\ \\ a\_s \cdot \begin{array}{l} \mathbf{if}\;x \cdot y \leq -\infty \lor \neg \left(x \cdot y \leq 2 \cdot 10^{+267}\right):\\ \;\;\;\;\frac{0.5 \cdot x}{a\_m} \cdot y\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-9 \cdot z, t, y \cdot x\right) \cdot \frac{0.5}{a\_m}\\ \end{array} \end{array} \]

FPCore

a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
 :precision binary64
 (*
  a_s
  (if (or (<= (* x y) (- INFINITY)) (not (<= (* x y) 2e+267)))
    (* (/ (* 0.5 x) a_m) y)
    (* (fma (* -9.0 z) t (* y x)) (/ 0.5 a_m)))))

C

a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
	double tmp;
	if (((x * y) <= -((double) INFINITY)) || !((x * y) <= 2e+267)) {
		tmp = ((0.5 * x) / a_m) * y;
	} else {
		tmp = fma((-9.0 * z), t, (y * x)) * (0.5 / a_m);
	}
	return a_s * tmp;
}

Julia

a\_m = abs(a)
a\_s = copysign(1.0, a)
x, y, z, t, a_m = sort([x, y, z, t, a_m])
x, y, z, t, a_m = sort([x, y, z, t, a_m])
function code(a_s, x, y, z, t, a_m)
	tmp = 0.0
	if ((Float64(x * y) <= Float64(-Inf)) || !(Float64(x * y) <= 2e+267))
		tmp = Float64(Float64(Float64(0.5 * x) / a_m) * y);
	else
		tmp = Float64(fma(Float64(-9.0 * z), t, Float64(y * x)) * Float64(0.5 / a_m));
	end
	return Float64(a_s * tmp)
end

Wolfram

a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := N[(a$95$s * If[Or[LessEqual[N[(x * y), $MachinePrecision], (-Infinity)], N[Not[LessEqual[N[(x * y), $MachinePrecision], 2e+267]], $MachinePrecision]], N[(N[(N[(0.5 * x), $MachinePrecision] / a$95$m), $MachinePrecision] * y), $MachinePrecision], N[(N[(N[(-9.0 * z), $MachinePrecision] * t + N[(y * x), $MachinePrecision]), $MachinePrecision] * N[(0.5 / a$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x y) < -inf.0 or 1.9999999999999999e267 < (*.f64 x y)

   1. Initial program 64.4%

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

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{-9}{2} \cdot \frac{t \cdot z}{a} + \frac{1}{2} \cdot \frac{x \cdot y}{a}} \]

   5. Applied rewrites 67.1%

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

   6. Taylor expanded in y around inf

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

      1. distribute-rgt-in N/A

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

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

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

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

         \[\leadsto \left(\frac{-9}{2} \cdot \frac{t \cdot z}{a \cdot y}\right) \cdot y - \left(\left(\mathsf{neg}\left(\frac{1}{2}\right)\right) \cdot \frac{x}{a}\right) \cdot y \]

      4. metadata-eval N/A

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

      5. distribute-rgt-out-- N/A

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

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

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

      7. metadata-eval N/A

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

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

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

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

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

      10. distribute-neg-in N/A

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

      11. +-commutative N/A

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

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

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

   8. Applied rewrites 97.1%

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

   9. Taylor expanded in x around inf

      \[\leadsto \frac{\frac{1}{2} \cdot x}{a} \cdot y \]
   10. Step-by-step derivation

       1. lower-*.f64 99.8

          \[\leadsto \frac{0.5 \cdot x}{a} \cdot y \]

   11. Applied rewrites 99.8%

       \[\leadsto \frac{0.5 \cdot x}{a} \cdot y \]

   if -inf.0 < (*.f64 x y) < 1.9999999999999999e267

   1. Initial program 95.6%

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

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{-9}{2} \cdot \frac{t \cdot z}{a} + \frac{1}{2} \cdot \frac{x \cdot y}{a}} \]

   5. Applied rewrites 95.9%

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

4. Final simplification 96.5%

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

Alternative 6: 73.7% accurate, 0.6× speedup

Math

\[\begin{array}{l} a\_m = \left|a\right| \\ a\_s = \mathsf{copysign}\left(1, a\right) \\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\\\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\ \\ \begin{array}{l} t_1 := \left(z \cdot 9\right) \cdot t\\ a\_s \cdot \begin{array}{l} \mathbf{if}\;t\_1 \leq -5 \cdot 10^{+24} \lor \neg \left(t\_1 \leq 4 \cdot 10^{+52}\right):\\ \;\;\;\;t \cdot \frac{-4.5 \cdot z}{a\_m}\\ \mathbf{else}:\\ \;\;\;\;\frac{y \cdot x}{a\_m + a\_m}\\ \end{array} \end{array} \end{array} \]

FPCore

a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
 :precision binary64
 (let* ((t_1 (* (* z 9.0) t)))
   (*
    a_s
    (if (or (<= t_1 -5e+24) (not (<= t_1 4e+52)))
      (* t (/ (* -4.5 z) a_m))
      (/ (* y x) (+ a_m a_m))))))

C

a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
	double t_1 = (z * 9.0) * t;
	double tmp;
	if ((t_1 <= -5e+24) || !(t_1 <= 4e+52)) {
		tmp = t * ((-4.5 * z) / a_m);
	} else {
		tmp = (y * x) / (a_m + a_m);
	}
	return a_s * tmp;
}

Fortran

a\_m =     private
a\_s =     private
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m 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(a_s, x, y, z, t, a_m)
use fmin_fmax_functions
    real(8), intent (in) :: a_s
    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_m
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (z * 9.0d0) * t
    if ((t_1 <= (-5d+24)) .or. (.not. (t_1 <= 4d+52))) then
        tmp = t * (((-4.5d0) * z) / a_m)
    else
        tmp = (y * x) / (a_m + a_m)
    end if
    code = a_s * tmp
end function

Java

a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
assert x < y && y < z && z < t && t < a_m;
assert x < y && y < z && z < t && t < a_m;
public static double code(double a_s, double x, double y, double z, double t, double a_m) {
	double t_1 = (z * 9.0) * t;
	double tmp;
	if ((t_1 <= -5e+24) || !(t_1 <= 4e+52)) {
		tmp = t * ((-4.5 * z) / a_m);
	} else {
		tmp = (y * x) / (a_m + a_m);
	}
	return a_s * tmp;
}

Python

a\_m = math.fabs(a)
a\_s = math.copysign(1.0, a)
[x, y, z, t, a_m] = sort([x, y, z, t, a_m])
[x, y, z, t, a_m] = sort([x, y, z, t, a_m])
def code(a_s, x, y, z, t, a_m):
	t_1 = (z * 9.0) * t
	tmp = 0
	if (t_1 <= -5e+24) or not (t_1 <= 4e+52):
		tmp = t * ((-4.5 * z) / a_m)
	else:
		tmp = (y * x) / (a_m + a_m)
	return a_s * tmp

Julia

a\_m = abs(a)
a\_s = copysign(1.0, a)
x, y, z, t, a_m = sort([x, y, z, t, a_m])
x, y, z, t, a_m = sort([x, y, z, t, a_m])
function code(a_s, x, y, z, t, a_m)
	t_1 = Float64(Float64(z * 9.0) * t)
	tmp = 0.0
	if ((t_1 <= -5e+24) || !(t_1 <= 4e+52))
		tmp = Float64(t * Float64(Float64(-4.5 * z) / a_m));
	else
		tmp = Float64(Float64(y * x) / Float64(a_m + a_m));
	end
	return Float64(a_s * tmp)
end

MATLAB

a\_m = abs(a);
a\_s = sign(a) * abs(1.0);
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
function tmp_2 = code(a_s, x, y, z, t, a_m)
	t_1 = (z * 9.0) * t;
	tmp = 0.0;
	if ((t_1 <= -5e+24) || ~((t_1 <= 4e+52)))
		tmp = t * ((-4.5 * z) / a_m);
	else
		tmp = (y * x) / (a_m + a_m);
	end
	tmp_2 = a_s * tmp;
end

Wolfram

a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := Block[{t$95$1 = N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]}, N[(a$95$s * If[Or[LessEqual[t$95$1, -5e+24], N[Not[LessEqual[t$95$1, 4e+52]], $MachinePrecision]], N[(t * N[(N[(-4.5 * z), $MachinePrecision] / a$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(y * x), $MachinePrecision] / N[(a$95$m + a$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < -5.00000000000000045e24 or 4e52 < (*.f64 (*.f64 z #s(literal 9 binary64)) t)

   1. Initial program 87.2%

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

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{-9}{2} \cdot \frac{t \cdot z}{a}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \color{blue}{\frac{-9}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \color{blue}{\frac{-9}{2}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \frac{-9}{2} \]

      4. lower-*.f64 76.3

         \[\leadsto \frac{t \cdot z}{a} \cdot -4.5 \]

   5. Applied rewrites 76.3%

      \[\leadsto \color{blue}{\frac{t \cdot z}{a} \cdot -4.5} \]
   6. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \frac{-9}{2} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \frac{-9}{2} \]

      3. *-commutative N/A

         \[\leadsto \frac{z \cdot t}{a} \cdot \frac{-9}{2} \]

      4. associate-/l* N/A

         \[\leadsto \left(z \cdot \frac{t}{a}\right) \cdot \frac{-9}{2} \]

      5. lower-*.f64 N/A

         \[\leadsto \left(z \cdot \frac{t}{a}\right) \cdot \frac{-9}{2} \]

      6. lower-/.f64 79.5

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

   7. Applied rewrites 79.5%

      \[\leadsto \left(z \cdot \frac{t}{a}\right) \cdot -4.5 \]
   8. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \left(z \cdot \frac{t}{a}\right) \cdot \color{blue}{\frac{-9}{2}} \]

      2. lift-*.f64 N/A

         \[\leadsto \left(z \cdot \frac{t}{a}\right) \cdot \frac{-9}{2} \]

      3. lift-/.f64 N/A

         \[\leadsto \left(z \cdot \frac{t}{a}\right) \cdot \frac{-9}{2} \]

      4. associate-*r/ N/A

         \[\leadsto \frac{z \cdot t}{a} \cdot \frac{-9}{2} \]

      5. *-commutative N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \frac{-9}{2} \]

      6. lift-*.f64 N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \frac{-9}{2} \]

      7. associate-*l/ N/A

         \[\leadsto \frac{\left(t \cdot z\right) \cdot \frac{-9}{2}}{\color{blue}{a}} \]

      8. lift-*.f64 N/A

         \[\leadsto \frac{\left(t \cdot z\right) \cdot \frac{-9}{2}}{a} \]

      9. associate-*l* N/A

         \[\leadsto \frac{t \cdot \left(z \cdot \frac{-9}{2}\right)}{a} \]

      10. associate-/l* N/A

          \[\leadsto t \cdot \color{blue}{\frac{z \cdot \frac{-9}{2}}{a}} \]

      11. lower-*.f64 N/A

          \[\leadsto t \cdot \color{blue}{\frac{z \cdot \frac{-9}{2}}{a}} \]

      12. lower-/.f64 N/A

          \[\leadsto t \cdot \frac{z \cdot \frac{-9}{2}}{\color{blue}{a}} \]

      13. *-commutative N/A

          \[\leadsto t \cdot \frac{\frac{-9}{2} \cdot z}{a} \]

      14. lower-*.f64 75.6

          \[\leadsto t \cdot \frac{-4.5 \cdot z}{a} \]

   9. Applied rewrites 75.6%

      \[\leadsto t \cdot \color{blue}{\frac{-4.5 \cdot z}{a}} \]

   if -5.00000000000000045e24 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 4e52

   1. Initial program 94.6%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

         \[\leadsto \frac{y \cdot \color{blue}{x}}{a \cdot 2} \]

      2. lower-*.f64 77.9

         \[\leadsto \frac{y \cdot \color{blue}{x}}{a \cdot 2} \]

   5. Applied rewrites 77.9%

      \[\leadsto \frac{\color{blue}{y \cdot x}}{a \cdot 2} \]
   6. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \frac{y \cdot x}{\color{blue}{a \cdot 2}} \]

      2. *-commutative N/A

         \[\leadsto \frac{y \cdot x}{\color{blue}{2 \cdot a}} \]

      3. count-2 N/A

         \[\leadsto \frac{y \cdot x}{\color{blue}{a + a}} \]

      4. lift-+.f64 77.9

         \[\leadsto \frac{y \cdot x}{\color{blue}{a + a}} \]

   7. Applied rewrites 77.9%

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

4. Final simplification 76.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(z \cdot 9\right) \cdot t \leq -5 \cdot 10^{+24} \lor \neg \left(\left(z \cdot 9\right) \cdot t \leq 4 \cdot 10^{+52}\right):\\ \;\;\;\;t \cdot \frac{-4.5 \cdot z}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{y \cdot x}{a + a}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 71.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} a\_m = \left|a\right| \\ a\_s = \mathsf{copysign}\left(1, a\right) \\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\\\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\ \\ \begin{array}{l} t_1 := \left(z \cdot 9\right) \cdot t\\ a\_s \cdot \begin{array}{l} \mathbf{if}\;t\_1 \leq -5 \cdot 10^{+24}:\\ \;\;\;\;\left(\frac{z}{a\_m} \cdot t\right) \cdot -4.5\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+111}:\\ \;\;\;\;\frac{0.5 \cdot x}{a\_m} \cdot y\\ \mathbf{else}:\\ \;\;\;\;\left(z \cdot \frac{t}{a\_m}\right) \cdot -4.5\\ \end{array} \end{array} \end{array} \]

FPCore

a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
 :precision binary64
 (let* ((t_1 (* (* z 9.0) t)))
   (*
    a_s
    (if (<= t_1 -5e+24)
      (* (* (/ z a_m) t) -4.5)
      (if (<= t_1 2e+111) (* (/ (* 0.5 x) a_m) y) (* (* z (/ t a_m)) -4.5))))))

C

a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
	double t_1 = (z * 9.0) * t;
	double tmp;
	if (t_1 <= -5e+24) {
		tmp = ((z / a_m) * t) * -4.5;
	} else if (t_1 <= 2e+111) {
		tmp = ((0.5 * x) / a_m) * y;
	} else {
		tmp = (z * (t / a_m)) * -4.5;
	}
	return a_s * tmp;
}

Fortran

a\_m =     private
a\_s =     private
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m 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(a_s, x, y, z, t, a_m)
use fmin_fmax_functions
    real(8), intent (in) :: a_s
    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_m
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (z * 9.0d0) * t
    if (t_1 <= (-5d+24)) then
        tmp = ((z / a_m) * t) * (-4.5d0)
    else if (t_1 <= 2d+111) then
        tmp = ((0.5d0 * x) / a_m) * y
    else
        tmp = (z * (t / a_m)) * (-4.5d0)
    end if
    code = a_s * tmp
end function

Java

a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
assert x < y && y < z && z < t && t < a_m;
assert x < y && y < z && z < t && t < a_m;
public static double code(double a_s, double x, double y, double z, double t, double a_m) {
	double t_1 = (z * 9.0) * t;
	double tmp;
	if (t_1 <= -5e+24) {
		tmp = ((z / a_m) * t) * -4.5;
	} else if (t_1 <= 2e+111) {
		tmp = ((0.5 * x) / a_m) * y;
	} else {
		tmp = (z * (t / a_m)) * -4.5;
	}
	return a_s * tmp;
}

Python

a\_m = math.fabs(a)
a\_s = math.copysign(1.0, a)
[x, y, z, t, a_m] = sort([x, y, z, t, a_m])
[x, y, z, t, a_m] = sort([x, y, z, t, a_m])
def code(a_s, x, y, z, t, a_m):
	t_1 = (z * 9.0) * t
	tmp = 0
	if t_1 <= -5e+24:
		tmp = ((z / a_m) * t) * -4.5
	elif t_1 <= 2e+111:
		tmp = ((0.5 * x) / a_m) * y
	else:
		tmp = (z * (t / a_m)) * -4.5
	return a_s * tmp

Julia

a\_m = abs(a)
a\_s = copysign(1.0, a)
x, y, z, t, a_m = sort([x, y, z, t, a_m])
x, y, z, t, a_m = sort([x, y, z, t, a_m])
function code(a_s, x, y, z, t, a_m)
	t_1 = Float64(Float64(z * 9.0) * t)
	tmp = 0.0
	if (t_1 <= -5e+24)
		tmp = Float64(Float64(Float64(z / a_m) * t) * -4.5);
	elseif (t_1 <= 2e+111)
		tmp = Float64(Float64(Float64(0.5 * x) / a_m) * y);
	else
		tmp = Float64(Float64(z * Float64(t / a_m)) * -4.5);
	end
	return Float64(a_s * tmp)
end

MATLAB

a\_m = abs(a);
a\_s = sign(a) * abs(1.0);
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
function tmp_2 = code(a_s, x, y, z, t, a_m)
	t_1 = (z * 9.0) * t;
	tmp = 0.0;
	if (t_1 <= -5e+24)
		tmp = ((z / a_m) * t) * -4.5;
	elseif (t_1 <= 2e+111)
		tmp = ((0.5 * x) / a_m) * y;
	else
		tmp = (z * (t / a_m)) * -4.5;
	end
	tmp_2 = a_s * tmp;
end

Wolfram

a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := Block[{t$95$1 = N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]}, N[(a$95$s * If[LessEqual[t$95$1, -5e+24], N[(N[(N[(z / a$95$m), $MachinePrecision] * t), $MachinePrecision] * -4.5), $MachinePrecision], If[LessEqual[t$95$1, 2e+111], N[(N[(N[(0.5 * x), $MachinePrecision] / a$95$m), $MachinePrecision] * y), $MachinePrecision], N[(N[(z * N[(t / a$95$m), $MachinePrecision]), $MachinePrecision] * -4.5), $MachinePrecision]]]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < -5.00000000000000045e24

   1. Initial program 86.1%

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

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{-9}{2} \cdot \frac{t \cdot z}{a}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \color{blue}{\frac{-9}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \color{blue}{\frac{-9}{2}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \frac{-9}{2} \]

      4. lower-*.f64 74.8

         \[\leadsto \frac{t \cdot z}{a} \cdot -4.5 \]

   5. Applied rewrites 74.8%

      \[\leadsto \color{blue}{\frac{t \cdot z}{a} \cdot -4.5} \]
   6. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \frac{-9}{2} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \frac{-9}{2} \]

      3. associate-/l* N/A

         \[\leadsto \left(t \cdot \frac{z}{a}\right) \cdot \frac{-9}{2} \]

      4. *-commutative N/A

         \[\leadsto \left(\frac{z}{a} \cdot t\right) \cdot \frac{-9}{2} \]

      5. lower-*.f64 N/A

         \[\leadsto \left(\frac{z}{a} \cdot t\right) \cdot \frac{-9}{2} \]

      6. lower-/.f64 71.8

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

   7. Applied rewrites 71.8%

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

   if -5.00000000000000045e24 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 1.99999999999999991e111

   1. Initial program 94.4%

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

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{-9}{2} \cdot \frac{t \cdot z}{a} + \frac{1}{2} \cdot \frac{x \cdot y}{a}} \]

   5. Applied rewrites 94.3%

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

   6. Taylor expanded in y around inf

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

      1. distribute-rgt-in N/A

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

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

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

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

         \[\leadsto \left(\frac{-9}{2} \cdot \frac{t \cdot z}{a \cdot y}\right) \cdot y - \left(\left(\mathsf{neg}\left(\frac{1}{2}\right)\right) \cdot \frac{x}{a}\right) \cdot y \]

      4. metadata-eval N/A

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

      5. distribute-rgt-out-- N/A

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

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

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

      7. metadata-eval N/A

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

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

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

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

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

      10. distribute-neg-in N/A

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

      11. +-commutative N/A

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

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

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

   8. Applied rewrites 90.3%

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

   9. Taylor expanded in x around inf

      \[\leadsto \frac{\frac{1}{2} \cdot x}{a} \cdot y \]
   10. Step-by-step derivation

       1. lower-*.f64 75.5

          \[\leadsto \frac{0.5 \cdot x}{a} \cdot y \]

   11. Applied rewrites 75.5%

       \[\leadsto \frac{0.5 \cdot x}{a} \cdot y \]

   if 1.99999999999999991e111 < (*.f64 (*.f64 z #s(literal 9 binary64)) t)

   1. Initial program 87.1%

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

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{-9}{2} \cdot \frac{t \cdot z}{a}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \color{blue}{\frac{-9}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \color{blue}{\frac{-9}{2}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \frac{-9}{2} \]

      4. lower-*.f64 84.8

         \[\leadsto \frac{t \cdot z}{a} \cdot -4.5 \]

   5. Applied rewrites 84.8%

      \[\leadsto \color{blue}{\frac{t \cdot z}{a} \cdot -4.5} \]
   6. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \frac{-9}{2} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \frac{-9}{2} \]

      3. *-commutative N/A

         \[\leadsto \frac{z \cdot t}{a} \cdot \frac{-9}{2} \]

      4. associate-/l* N/A

         \[\leadsto \left(z \cdot \frac{t}{a}\right) \cdot \frac{-9}{2} \]

      5. lower-*.f64 N/A

         \[\leadsto \left(z \cdot \frac{t}{a}\right) \cdot \frac{-9}{2} \]

      6. lower-/.f64 93.3

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

   7. Applied rewrites 93.3%

      \[\leadsto \left(z \cdot \frac{t}{a}\right) \cdot -4.5 \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 8: 72.7% accurate, 0.6× speedup

Math

\[\begin{array}{l} a\_m = \left|a\right| \\ a\_s = \mathsf{copysign}\left(1, a\right) \\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\\\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\ \\ \begin{array}{l} t_1 := \left(z \cdot 9\right) \cdot t\\ a\_s \cdot \begin{array}{l} \mathbf{if}\;t\_1 \leq -5 \cdot 10^{+24}:\\ \;\;\;\;\left(\frac{z}{a\_m} \cdot t\right) \cdot -4.5\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+111}:\\ \;\;\;\;\frac{y \cdot x}{a\_m + a\_m}\\ \mathbf{else}:\\ \;\;\;\;\left(z \cdot \frac{t}{a\_m}\right) \cdot -4.5\\ \end{array} \end{array} \end{array} \]

FPCore

a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
 :precision binary64
 (let* ((t_1 (* (* z 9.0) t)))
   (*
    a_s
    (if (<= t_1 -5e+24)
      (* (* (/ z a_m) t) -4.5)
      (if (<= t_1 2e+111) (/ (* y x) (+ a_m a_m)) (* (* z (/ t a_m)) -4.5))))))

C

a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
	double t_1 = (z * 9.0) * t;
	double tmp;
	if (t_1 <= -5e+24) {
		tmp = ((z / a_m) * t) * -4.5;
	} else if (t_1 <= 2e+111) {
		tmp = (y * x) / (a_m + a_m);
	} else {
		tmp = (z * (t / a_m)) * -4.5;
	}
	return a_s * tmp;
}

Fortran

a\_m =     private
a\_s =     private
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m 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(a_s, x, y, z, t, a_m)
use fmin_fmax_functions
    real(8), intent (in) :: a_s
    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_m
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (z * 9.0d0) * t
    if (t_1 <= (-5d+24)) then
        tmp = ((z / a_m) * t) * (-4.5d0)
    else if (t_1 <= 2d+111) then
        tmp = (y * x) / (a_m + a_m)
    else
        tmp = (z * (t / a_m)) * (-4.5d0)
    end if
    code = a_s * tmp
end function

Java

a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
assert x < y && y < z && z < t && t < a_m;
assert x < y && y < z && z < t && t < a_m;
public static double code(double a_s, double x, double y, double z, double t, double a_m) {
	double t_1 = (z * 9.0) * t;
	double tmp;
	if (t_1 <= -5e+24) {
		tmp = ((z / a_m) * t) * -4.5;
	} else if (t_1 <= 2e+111) {
		tmp = (y * x) / (a_m + a_m);
	} else {
		tmp = (z * (t / a_m)) * -4.5;
	}
	return a_s * tmp;
}

Python

a\_m = math.fabs(a)
a\_s = math.copysign(1.0, a)
[x, y, z, t, a_m] = sort([x, y, z, t, a_m])
[x, y, z, t, a_m] = sort([x, y, z, t, a_m])
def code(a_s, x, y, z, t, a_m):
	t_1 = (z * 9.0) * t
	tmp = 0
	if t_1 <= -5e+24:
		tmp = ((z / a_m) * t) * -4.5
	elif t_1 <= 2e+111:
		tmp = (y * x) / (a_m + a_m)
	else:
		tmp = (z * (t / a_m)) * -4.5
	return a_s * tmp

Julia

a\_m = abs(a)
a\_s = copysign(1.0, a)
x, y, z, t, a_m = sort([x, y, z, t, a_m])
x, y, z, t, a_m = sort([x, y, z, t, a_m])
function code(a_s, x, y, z, t, a_m)
	t_1 = Float64(Float64(z * 9.0) * t)
	tmp = 0.0
	if (t_1 <= -5e+24)
		tmp = Float64(Float64(Float64(z / a_m) * t) * -4.5);
	elseif (t_1 <= 2e+111)
		tmp = Float64(Float64(y * x) / Float64(a_m + a_m));
	else
		tmp = Float64(Float64(z * Float64(t / a_m)) * -4.5);
	end
	return Float64(a_s * tmp)
end

MATLAB

a\_m = abs(a);
a\_s = sign(a) * abs(1.0);
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
function tmp_2 = code(a_s, x, y, z, t, a_m)
	t_1 = (z * 9.0) * t;
	tmp = 0.0;
	if (t_1 <= -5e+24)
		tmp = ((z / a_m) * t) * -4.5;
	elseif (t_1 <= 2e+111)
		tmp = (y * x) / (a_m + a_m);
	else
		tmp = (z * (t / a_m)) * -4.5;
	end
	tmp_2 = a_s * tmp;
end

Wolfram

a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := Block[{t$95$1 = N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]}, N[(a$95$s * If[LessEqual[t$95$1, -5e+24], N[(N[(N[(z / a$95$m), $MachinePrecision] * t), $MachinePrecision] * -4.5), $MachinePrecision], If[LessEqual[t$95$1, 2e+111], N[(N[(y * x), $MachinePrecision] / N[(a$95$m + a$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(z * N[(t / a$95$m), $MachinePrecision]), $MachinePrecision] * -4.5), $MachinePrecision]]]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < -5.00000000000000045e24

   1. Initial program 86.1%

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

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{-9}{2} \cdot \frac{t \cdot z}{a}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \color{blue}{\frac{-9}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \color{blue}{\frac{-9}{2}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \frac{-9}{2} \]

      4. lower-*.f64 74.8

         \[\leadsto \frac{t \cdot z}{a} \cdot -4.5 \]

   5. Applied rewrites 74.8%

      \[\leadsto \color{blue}{\frac{t \cdot z}{a} \cdot -4.5} \]
   6. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \frac{-9}{2} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \frac{-9}{2} \]

      3. associate-/l* N/A

         \[\leadsto \left(t \cdot \frac{z}{a}\right) \cdot \frac{-9}{2} \]

      4. *-commutative N/A

         \[\leadsto \left(\frac{z}{a} \cdot t\right) \cdot \frac{-9}{2} \]

      5. lower-*.f64 N/A

         \[\leadsto \left(\frac{z}{a} \cdot t\right) \cdot \frac{-9}{2} \]

      6. lower-/.f64 71.8

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

   7. Applied rewrites 71.8%

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

   if -5.00000000000000045e24 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 1.99999999999999991e111

   1. Initial program 94.4%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

         \[\leadsto \frac{y \cdot \color{blue}{x}}{a \cdot 2} \]

      2. lower-*.f64 74.7

         \[\leadsto \frac{y \cdot \color{blue}{x}}{a \cdot 2} \]

   5. Applied rewrites 74.7%

      \[\leadsto \frac{\color{blue}{y \cdot x}}{a \cdot 2} \]
   6. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \frac{y \cdot x}{\color{blue}{a \cdot 2}} \]

      2. *-commutative N/A

         \[\leadsto \frac{y \cdot x}{\color{blue}{2 \cdot a}} \]

      3. count-2 N/A

         \[\leadsto \frac{y \cdot x}{\color{blue}{a + a}} \]

      4. lift-+.f64 74.7

         \[\leadsto \frac{y \cdot x}{\color{blue}{a + a}} \]

   7. Applied rewrites 74.7%

      \[\leadsto \frac{y \cdot x}{\color{blue}{a + a}} \]

   if 1.99999999999999991e111 < (*.f64 (*.f64 z #s(literal 9 binary64)) t)

   1. Initial program 87.1%

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

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{-9}{2} \cdot \frac{t \cdot z}{a}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \color{blue}{\frac{-9}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \color{blue}{\frac{-9}{2}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \frac{-9}{2} \]

      4. lower-*.f64 84.8

         \[\leadsto \frac{t \cdot z}{a} \cdot -4.5 \]

   5. Applied rewrites 84.8%

      \[\leadsto \color{blue}{\frac{t \cdot z}{a} \cdot -4.5} \]
   6. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \frac{-9}{2} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \frac{-9}{2} \]

      3. *-commutative N/A

         \[\leadsto \frac{z \cdot t}{a} \cdot \frac{-9}{2} \]

      4. associate-/l* N/A

         \[\leadsto \left(z \cdot \frac{t}{a}\right) \cdot \frac{-9}{2} \]

      5. lower-*.f64 N/A

         \[\leadsto \left(z \cdot \frac{t}{a}\right) \cdot \frac{-9}{2} \]

      6. lower-/.f64 93.3

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

   7. Applied rewrites 93.3%

      \[\leadsto \left(z \cdot \frac{t}{a}\right) \cdot -4.5 \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 9: 72.7% accurate, 0.6× speedup

Math

\[\begin{array}{l} a\_m = \left|a\right| \\ a\_s = \mathsf{copysign}\left(1, a\right) \\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\\\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\ \\ \begin{array}{l} t_1 := \left(z \cdot 9\right) \cdot t\\ a\_s \cdot \begin{array}{l} \mathbf{if}\;t\_1 \leq -5 \cdot 10^{+24}:\\ \;\;\;\;\left(-4.5 \cdot t\right) \cdot \frac{z}{a\_m}\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+111}:\\ \;\;\;\;\frac{y \cdot x}{a\_m + a\_m}\\ \mathbf{else}:\\ \;\;\;\;\left(z \cdot \frac{t}{a\_m}\right) \cdot -4.5\\ \end{array} \end{array} \end{array} \]

FPCore

a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
 :precision binary64
 (let* ((t_1 (* (* z 9.0) t)))
   (*
    a_s
    (if (<= t_1 -5e+24)
      (* (* -4.5 t) (/ z a_m))
      (if (<= t_1 2e+111) (/ (* y x) (+ a_m a_m)) (* (* z (/ t a_m)) -4.5))))))

C

a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
	double t_1 = (z * 9.0) * t;
	double tmp;
	if (t_1 <= -5e+24) {
		tmp = (-4.5 * t) * (z / a_m);
	} else if (t_1 <= 2e+111) {
		tmp = (y * x) / (a_m + a_m);
	} else {
		tmp = (z * (t / a_m)) * -4.5;
	}
	return a_s * tmp;
}

Fortran

a\_m =     private
a\_s =     private
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m 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(a_s, x, y, z, t, a_m)
use fmin_fmax_functions
    real(8), intent (in) :: a_s
    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_m
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (z * 9.0d0) * t
    if (t_1 <= (-5d+24)) then
        tmp = ((-4.5d0) * t) * (z / a_m)
    else if (t_1 <= 2d+111) then
        tmp = (y * x) / (a_m + a_m)
    else
        tmp = (z * (t / a_m)) * (-4.5d0)
    end if
    code = a_s * tmp
end function

Java

a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
assert x < y && y < z && z < t && t < a_m;
assert x < y && y < z && z < t && t < a_m;
public static double code(double a_s, double x, double y, double z, double t, double a_m) {
	double t_1 = (z * 9.0) * t;
	double tmp;
	if (t_1 <= -5e+24) {
		tmp = (-4.5 * t) * (z / a_m);
	} else if (t_1 <= 2e+111) {
		tmp = (y * x) / (a_m + a_m);
	} else {
		tmp = (z * (t / a_m)) * -4.5;
	}
	return a_s * tmp;
}

Python

a\_m = math.fabs(a)
a\_s = math.copysign(1.0, a)
[x, y, z, t, a_m] = sort([x, y, z, t, a_m])
[x, y, z, t, a_m] = sort([x, y, z, t, a_m])
def code(a_s, x, y, z, t, a_m):
	t_1 = (z * 9.0) * t
	tmp = 0
	if t_1 <= -5e+24:
		tmp = (-4.5 * t) * (z / a_m)
	elif t_1 <= 2e+111:
		tmp = (y * x) / (a_m + a_m)
	else:
		tmp = (z * (t / a_m)) * -4.5
	return a_s * tmp

Julia

a\_m = abs(a)
a\_s = copysign(1.0, a)
x, y, z, t, a_m = sort([x, y, z, t, a_m])
x, y, z, t, a_m = sort([x, y, z, t, a_m])
function code(a_s, x, y, z, t, a_m)
	t_1 = Float64(Float64(z * 9.0) * t)
	tmp = 0.0
	if (t_1 <= -5e+24)
		tmp = Float64(Float64(-4.5 * t) * Float64(z / a_m));
	elseif (t_1 <= 2e+111)
		tmp = Float64(Float64(y * x) / Float64(a_m + a_m));
	else
		tmp = Float64(Float64(z * Float64(t / a_m)) * -4.5);
	end
	return Float64(a_s * tmp)
end

MATLAB

a\_m = abs(a);
a\_s = sign(a) * abs(1.0);
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
function tmp_2 = code(a_s, x, y, z, t, a_m)
	t_1 = (z * 9.0) * t;
	tmp = 0.0;
	if (t_1 <= -5e+24)
		tmp = (-4.5 * t) * (z / a_m);
	elseif (t_1 <= 2e+111)
		tmp = (y * x) / (a_m + a_m);
	else
		tmp = (z * (t / a_m)) * -4.5;
	end
	tmp_2 = a_s * tmp;
end

Wolfram

a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := Block[{t$95$1 = N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]}, N[(a$95$s * If[LessEqual[t$95$1, -5e+24], N[(N[(-4.5 * t), $MachinePrecision] * N[(z / a$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e+111], N[(N[(y * x), $MachinePrecision] / N[(a$95$m + a$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(z * N[(t / a$95$m), $MachinePrecision]), $MachinePrecision] * -4.5), $MachinePrecision]]]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < -5.00000000000000045e24

   1. Initial program 86.1%

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

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{-9}{2} \cdot \frac{t \cdot z}{a}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \color{blue}{\frac{-9}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \color{blue}{\frac{-9}{2}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \frac{-9}{2} \]

      4. lower-*.f64 74.8

         \[\leadsto \frac{t \cdot z}{a} \cdot -4.5 \]

   5. Applied rewrites 74.8%

      \[\leadsto \color{blue}{\frac{t \cdot z}{a} \cdot -4.5} \]
   6. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \color{blue}{\frac{-9}{2}} \]

      2. *-commutative N/A

         \[\leadsto \frac{-9}{2} \cdot \color{blue}{\frac{t \cdot z}{a}} \]

      3. lift-/.f64 N/A

         \[\leadsto \frac{-9}{2} \cdot \frac{t \cdot z}{\color{blue}{a}} \]

      4. lift-*.f64 N/A

         \[\leadsto \frac{-9}{2} \cdot \frac{t \cdot z}{a} \]

      5. associate-/l* N/A

         \[\leadsto \frac{-9}{2} \cdot \left(t \cdot \color{blue}{\frac{z}{a}}\right) \]

      6. associate-*r* N/A

         \[\leadsto \left(\frac{-9}{2} \cdot t\right) \cdot \color{blue}{\frac{z}{a}} \]

      7. lower-*.f64 N/A

         \[\leadsto \left(\frac{-9}{2} \cdot t\right) \cdot \color{blue}{\frac{z}{a}} \]

      8. lower-*.f64 N/A

         \[\leadsto \left(\frac{-9}{2} \cdot t\right) \cdot \frac{\color{blue}{z}}{a} \]

      9. lower-/.f64 71.8

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

   7. Applied rewrites 71.8%

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

   if -5.00000000000000045e24 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 1.99999999999999991e111

   1. Initial program 94.4%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

         \[\leadsto \frac{y \cdot \color{blue}{x}}{a \cdot 2} \]

      2. lower-*.f64 74.7

         \[\leadsto \frac{y \cdot \color{blue}{x}}{a \cdot 2} \]

   5. Applied rewrites 74.7%

      \[\leadsto \frac{\color{blue}{y \cdot x}}{a \cdot 2} \]
   6. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \frac{y \cdot x}{\color{blue}{a \cdot 2}} \]

      2. *-commutative N/A

         \[\leadsto \frac{y \cdot x}{\color{blue}{2 \cdot a}} \]

      3. count-2 N/A

         \[\leadsto \frac{y \cdot x}{\color{blue}{a + a}} \]

      4. lift-+.f64 74.7

         \[\leadsto \frac{y \cdot x}{\color{blue}{a + a}} \]

   7. Applied rewrites 74.7%

      \[\leadsto \frac{y \cdot x}{\color{blue}{a + a}} \]

   if 1.99999999999999991e111 < (*.f64 (*.f64 z #s(literal 9 binary64)) t)

   1. Initial program 87.1%

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

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{-9}{2} \cdot \frac{t \cdot z}{a}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \color{blue}{\frac{-9}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \color{blue}{\frac{-9}{2}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \frac{-9}{2} \]

      4. lower-*.f64 84.8

         \[\leadsto \frac{t \cdot z}{a} \cdot -4.5 \]

   5. Applied rewrites 84.8%

      \[\leadsto \color{blue}{\frac{t \cdot z}{a} \cdot -4.5} \]
   6. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \frac{-9}{2} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \frac{-9}{2} \]

      3. *-commutative N/A

         \[\leadsto \frac{z \cdot t}{a} \cdot \frac{-9}{2} \]

      4. associate-/l* N/A

         \[\leadsto \left(z \cdot \frac{t}{a}\right) \cdot \frac{-9}{2} \]

      5. lower-*.f64 N/A

         \[\leadsto \left(z \cdot \frac{t}{a}\right) \cdot \frac{-9}{2} \]

      6. lower-/.f64 93.3

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

   7. Applied rewrites 93.3%

      \[\leadsto \left(z \cdot \frac{t}{a}\right) \cdot -4.5 \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 10: 73.6% accurate, 0.6× speedup

Math

\[\begin{array}{l} a\_m = \left|a\right| \\ a\_s = \mathsf{copysign}\left(1, a\right) \\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\\\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\ \\ \begin{array}{l} t_1 := \left(z \cdot 9\right) \cdot t\\ a\_s \cdot \begin{array}{l} \mathbf{if}\;t\_1 \leq -5 \cdot 10^{+24}:\\ \;\;\;\;\left(-4.5 \cdot t\right) \cdot \frac{z}{a\_m}\\ \mathbf{elif}\;t\_1 \leq 4 \cdot 10^{+52}:\\ \;\;\;\;\frac{y \cdot x}{a\_m + a\_m}\\ \mathbf{else}:\\ \;\;\;\;t \cdot \frac{-4.5 \cdot z}{a\_m}\\ \end{array} \end{array} \end{array} \]

FPCore

a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
 :precision binary64
 (let* ((t_1 (* (* z 9.0) t)))
   (*
    a_s
    (if (<= t_1 -5e+24)
      (* (* -4.5 t) (/ z a_m))
      (if (<= t_1 4e+52) (/ (* y x) (+ a_m a_m)) (* t (/ (* -4.5 z) a_m)))))))

C

a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
	double t_1 = (z * 9.0) * t;
	double tmp;
	if (t_1 <= -5e+24) {
		tmp = (-4.5 * t) * (z / a_m);
	} else if (t_1 <= 4e+52) {
		tmp = (y * x) / (a_m + a_m);
	} else {
		tmp = t * ((-4.5 * z) / a_m);
	}
	return a_s * tmp;
}

Fortran

a\_m =     private
a\_s =     private
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m 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(a_s, x, y, z, t, a_m)
use fmin_fmax_functions
    real(8), intent (in) :: a_s
    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_m
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (z * 9.0d0) * t
    if (t_1 <= (-5d+24)) then
        tmp = ((-4.5d0) * t) * (z / a_m)
    else if (t_1 <= 4d+52) then
        tmp = (y * x) / (a_m + a_m)
    else
        tmp = t * (((-4.5d0) * z) / a_m)
    end if
    code = a_s * tmp
end function

Java

a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
assert x < y && y < z && z < t && t < a_m;
assert x < y && y < z && z < t && t < a_m;
public static double code(double a_s, double x, double y, double z, double t, double a_m) {
	double t_1 = (z * 9.0) * t;
	double tmp;
	if (t_1 <= -5e+24) {
		tmp = (-4.5 * t) * (z / a_m);
	} else if (t_1 <= 4e+52) {
		tmp = (y * x) / (a_m + a_m);
	} else {
		tmp = t * ((-4.5 * z) / a_m);
	}
	return a_s * tmp;
}

Python

a\_m = math.fabs(a)
a\_s = math.copysign(1.0, a)
[x, y, z, t, a_m] = sort([x, y, z, t, a_m])
[x, y, z, t, a_m] = sort([x, y, z, t, a_m])
def code(a_s, x, y, z, t, a_m):
	t_1 = (z * 9.0) * t
	tmp = 0
	if t_1 <= -5e+24:
		tmp = (-4.5 * t) * (z / a_m)
	elif t_1 <= 4e+52:
		tmp = (y * x) / (a_m + a_m)
	else:
		tmp = t * ((-4.5 * z) / a_m)
	return a_s * tmp

Julia

a\_m = abs(a)
a\_s = copysign(1.0, a)
x, y, z, t, a_m = sort([x, y, z, t, a_m])
x, y, z, t, a_m = sort([x, y, z, t, a_m])
function code(a_s, x, y, z, t, a_m)
	t_1 = Float64(Float64(z * 9.0) * t)
	tmp = 0.0
	if (t_1 <= -5e+24)
		tmp = Float64(Float64(-4.5 * t) * Float64(z / a_m));
	elseif (t_1 <= 4e+52)
		tmp = Float64(Float64(y * x) / Float64(a_m + a_m));
	else
		tmp = Float64(t * Float64(Float64(-4.5 * z) / a_m));
	end
	return Float64(a_s * tmp)
end

MATLAB

a\_m = abs(a);
a\_s = sign(a) * abs(1.0);
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
function tmp_2 = code(a_s, x, y, z, t, a_m)
	t_1 = (z * 9.0) * t;
	tmp = 0.0;
	if (t_1 <= -5e+24)
		tmp = (-4.5 * t) * (z / a_m);
	elseif (t_1 <= 4e+52)
		tmp = (y * x) / (a_m + a_m);
	else
		tmp = t * ((-4.5 * z) / a_m);
	end
	tmp_2 = a_s * tmp;
end

Wolfram

a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := Block[{t$95$1 = N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]}, N[(a$95$s * If[LessEqual[t$95$1, -5e+24], N[(N[(-4.5 * t), $MachinePrecision] * N[(z / a$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 4e+52], N[(N[(y * x), $MachinePrecision] / N[(a$95$m + a$95$m), $MachinePrecision]), $MachinePrecision], N[(t * N[(N[(-4.5 * z), $MachinePrecision] / a$95$m), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < -5.00000000000000045e24

   1. Initial program 86.1%

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

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{-9}{2} \cdot \frac{t \cdot z}{a}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \color{blue}{\frac{-9}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \color{blue}{\frac{-9}{2}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \frac{-9}{2} \]

      4. lower-*.f64 74.8

         \[\leadsto \frac{t \cdot z}{a} \cdot -4.5 \]

   5. Applied rewrites 74.8%

      \[\leadsto \color{blue}{\frac{t \cdot z}{a} \cdot -4.5} \]
   6. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \color{blue}{\frac{-9}{2}} \]

      2. *-commutative N/A

         \[\leadsto \frac{-9}{2} \cdot \color{blue}{\frac{t \cdot z}{a}} \]

      3. lift-/.f64 N/A

         \[\leadsto \frac{-9}{2} \cdot \frac{t \cdot z}{\color{blue}{a}} \]

      4. lift-*.f64 N/A

         \[\leadsto \frac{-9}{2} \cdot \frac{t \cdot z}{a} \]

      5. associate-/l* N/A

         \[\leadsto \frac{-9}{2} \cdot \left(t \cdot \color{blue}{\frac{z}{a}}\right) \]

      6. associate-*r* N/A

         \[\leadsto \left(\frac{-9}{2} \cdot t\right) \cdot \color{blue}{\frac{z}{a}} \]

      7. lower-*.f64 N/A

         \[\leadsto \left(\frac{-9}{2} \cdot t\right) \cdot \color{blue}{\frac{z}{a}} \]

      8. lower-*.f64 N/A

         \[\leadsto \left(\frac{-9}{2} \cdot t\right) \cdot \frac{\color{blue}{z}}{a} \]

      9. lower-/.f64 71.8

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

   7. Applied rewrites 71.8%

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

   if -5.00000000000000045e24 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 4e52

   1. Initial program 94.6%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

         \[\leadsto \frac{y \cdot \color{blue}{x}}{a \cdot 2} \]

      2. lower-*.f64 77.9

         \[\leadsto \frac{y \cdot \color{blue}{x}}{a \cdot 2} \]

   5. Applied rewrites 77.9%

      \[\leadsto \frac{\color{blue}{y \cdot x}}{a \cdot 2} \]
   6. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \frac{y \cdot x}{\color{blue}{a \cdot 2}} \]

      2. *-commutative N/A

         \[\leadsto \frac{y \cdot x}{\color{blue}{2 \cdot a}} \]

      3. count-2 N/A

         \[\leadsto \frac{y \cdot x}{\color{blue}{a + a}} \]

      4. lift-+.f64 77.9

         \[\leadsto \frac{y \cdot x}{\color{blue}{a + a}} \]

   7. Applied rewrites 77.9%

      \[\leadsto \frac{y \cdot x}{\color{blue}{a + a}} \]

   if 4e52 < (*.f64 (*.f64 z #s(literal 9 binary64)) t)

   1. Initial program 88.4%

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

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{-9}{2} \cdot \frac{t \cdot z}{a}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \color{blue}{\frac{-9}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \color{blue}{\frac{-9}{2}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \frac{-9}{2} \]

      4. lower-*.f64 77.9

         \[\leadsto \frac{t \cdot z}{a} \cdot -4.5 \]

   5. Applied rewrites 77.9%

      \[\leadsto \color{blue}{\frac{t \cdot z}{a} \cdot -4.5} \]
   6. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \frac{-9}{2} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \frac{-9}{2} \]

      3. *-commutative N/A

         \[\leadsto \frac{z \cdot t}{a} \cdot \frac{-9}{2} \]

      4. associate-/l* N/A

         \[\leadsto \left(z \cdot \frac{t}{a}\right) \cdot \frac{-9}{2} \]

      5. lower-*.f64 N/A

         \[\leadsto \left(z \cdot \frac{t}{a}\right) \cdot \frac{-9}{2} \]

      6. lower-/.f64 83.0

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

   7. Applied rewrites 83.0%

      \[\leadsto \left(z \cdot \frac{t}{a}\right) \cdot -4.5 \]
   8. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \left(z \cdot \frac{t}{a}\right) \cdot \color{blue}{\frac{-9}{2}} \]

      2. lift-*.f64 N/A

         \[\leadsto \left(z \cdot \frac{t}{a}\right) \cdot \frac{-9}{2} \]

      3. lift-/.f64 N/A

         \[\leadsto \left(z \cdot \frac{t}{a}\right) \cdot \frac{-9}{2} \]

      4. associate-*r/ N/A

         \[\leadsto \frac{z \cdot t}{a} \cdot \frac{-9}{2} \]

      5. *-commutative N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \frac{-9}{2} \]

      6. lift-*.f64 N/A

         \[\leadsto \frac{t \cdot z}{a} \cdot \frac{-9}{2} \]

      7. associate-*l/ N/A

         \[\leadsto \frac{\left(t \cdot z\right) \cdot \frac{-9}{2}}{\color{blue}{a}} \]

      8. lift-*.f64 N/A

         \[\leadsto \frac{\left(t \cdot z\right) \cdot \frac{-9}{2}}{a} \]

      9. associate-*l* N/A

         \[\leadsto \frac{t \cdot \left(z \cdot \frac{-9}{2}\right)}{a} \]

      10. associate-/l* N/A

          \[\leadsto t \cdot \color{blue}{\frac{z \cdot \frac{-9}{2}}{a}} \]

      11. lower-*.f64 N/A

          \[\leadsto t \cdot \color{blue}{\frac{z \cdot \frac{-9}{2}}{a}} \]

      12. lower-/.f64 N/A

          \[\leadsto t \cdot \frac{z \cdot \frac{-9}{2}}{\color{blue}{a}} \]

      13. *-commutative N/A

          \[\leadsto t \cdot \frac{\frac{-9}{2} \cdot z}{a} \]

      14. lower-*.f64 79.8

          \[\leadsto t \cdot \frac{-4.5 \cdot z}{a} \]

   9. Applied rewrites 79.8%

      \[\leadsto t \cdot \color{blue}{\frac{-4.5 \cdot z}{a}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 11: 95.0% accurate, 0.7× speedup

Math

\[\begin{array}{l} a\_m = \left|a\right| \\ a\_s = \mathsf{copysign}\left(1, a\right) \\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\\\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\ \\ a\_s \cdot \begin{array}{l} \mathbf{if}\;x \cdot y \leq -\infty \lor \neg \left(x \cdot y \leq 2 \cdot 10^{+267}\right):\\ \;\;\;\;\frac{0.5 \cdot x}{a\_m} \cdot y\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(-9 \cdot t, z, y \cdot x\right)}{a\_m + a\_m}\\ \end{array} \end{array} \]

FPCore

a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
 :precision binary64
 (*
  a_s
  (if (or (<= (* x y) (- INFINITY)) (not (<= (* x y) 2e+267)))
    (* (/ (* 0.5 x) a_m) y)
    (/ (fma (* -9.0 t) z (* y x)) (+ a_m a_m)))))

C

a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
	double tmp;
	if (((x * y) <= -((double) INFINITY)) || !((x * y) <= 2e+267)) {
		tmp = ((0.5 * x) / a_m) * y;
	} else {
		tmp = fma((-9.0 * t), z, (y * x)) / (a_m + a_m);
	}
	return a_s * tmp;
}

Julia

a\_m = abs(a)
a\_s = copysign(1.0, a)
x, y, z, t, a_m = sort([x, y, z, t, a_m])
x, y, z, t, a_m = sort([x, y, z, t, a_m])
function code(a_s, x, y, z, t, a_m)
	tmp = 0.0
	if ((Float64(x * y) <= Float64(-Inf)) || !(Float64(x * y) <= 2e+267))
		tmp = Float64(Float64(Float64(0.5 * x) / a_m) * y);
	else
		tmp = Float64(fma(Float64(-9.0 * t), z, Float64(y * x)) / Float64(a_m + a_m));
	end
	return Float64(a_s * tmp)
end

Wolfram

a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := N[(a$95$s * If[Or[LessEqual[N[(x * y), $MachinePrecision], (-Infinity)], N[Not[LessEqual[N[(x * y), $MachinePrecision], 2e+267]], $MachinePrecision]], N[(N[(N[(0.5 * x), $MachinePrecision] / a$95$m), $MachinePrecision] * y), $MachinePrecision], N[(N[(N[(-9.0 * t), $MachinePrecision] * z + N[(y * x), $MachinePrecision]), $MachinePrecision] / N[(a$95$m + a$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x y) < -inf.0 or 1.9999999999999999e267 < (*.f64 x y)

   1. Initial program 64.4%

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

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{-9}{2} \cdot \frac{t \cdot z}{a} + \frac{1}{2} \cdot \frac{x \cdot y}{a}} \]

   5. Applied rewrites 67.1%

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

   6. Taylor expanded in y around inf

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

      1. distribute-rgt-in N/A

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

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

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

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

         \[\leadsto \left(\frac{-9}{2} \cdot \frac{t \cdot z}{a \cdot y}\right) \cdot y - \left(\left(\mathsf{neg}\left(\frac{1}{2}\right)\right) \cdot \frac{x}{a}\right) \cdot y \]

      4. metadata-eval N/A

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

      5. distribute-rgt-out-- N/A

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

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

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

      7. metadata-eval N/A

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

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

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

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

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

      10. distribute-neg-in N/A

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

      11. +-commutative N/A

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

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

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

   8. Applied rewrites 97.1%

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

   9. Taylor expanded in x around inf

      \[\leadsto \frac{\frac{1}{2} \cdot x}{a} \cdot y \]
   10. Step-by-step derivation

       1. lower-*.f64 99.8

          \[\leadsto \frac{0.5 \cdot x}{a} \cdot y \]

   11. Applied rewrites 99.8%

       \[\leadsto \frac{0.5 \cdot x}{a} \cdot y \]

   if -inf.0 < (*.f64 x y) < 1.9999999999999999e267

   1. Initial program 95.6%

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

      1. lift--.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*l* N/A

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

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

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

      6. lift-*.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. lower-neg.f64 N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 95.7

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

   4. Applied rewrites 95.7%

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

   6. Applied rewrites 95.7%

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

      1. lift-*.f64 N/A

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

      2. count-2-rev N/A

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

      3. lower-+.f64 95.7

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

   8. Applied rewrites 95.7%

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

4. Final simplification 96.3%

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

Alternative 12: 50.9% accurate, 1.8× speedup

Math

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

FPCore

a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m) :precision binary64 (* a_s (/ (* y x) (+ a_m a_m))))

C

a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
	return a_s * ((y * x) / (a_m + a_m));
}

Fortran

a\_m =     private
a\_s =     private
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m 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(a_s, x, y, z, t, a_m)
use fmin_fmax_functions
    real(8), intent (in) :: a_s
    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_m
    code = a_s * ((y * x) / (a_m + a_m))
end function

Java

a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
assert x < y && y < z && z < t && t < a_m;
assert x < y && y < z && z < t && t < a_m;
public static double code(double a_s, double x, double y, double z, double t, double a_m) {
	return a_s * ((y * x) / (a_m + a_m));
}

Python

a\_m = math.fabs(a)
a\_s = math.copysign(1.0, a)
[x, y, z, t, a_m] = sort([x, y, z, t, a_m])
[x, y, z, t, a_m] = sort([x, y, z, t, a_m])
def code(a_s, x, y, z, t, a_m):
	return a_s * ((y * x) / (a_m + a_m))

Julia

a\_m = abs(a)
a\_s = copysign(1.0, a)
x, y, z, t, a_m = sort([x, y, z, t, a_m])
x, y, z, t, a_m = sort([x, y, z, t, a_m])
function code(a_s, x, y, z, t, a_m)
	return Float64(a_s * Float64(Float64(y * x) / Float64(a_m + a_m)))
end

MATLAB

a\_m = abs(a);
a\_s = sign(a) * abs(1.0);
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
function tmp = code(a_s, x, y, z, t, a_m)
	tmp = a_s * ((y * x) / (a_m + a_m));
end

Wolfram

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

Derivation

1. Initial program 91.1%

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

3. Taylor expanded in x around inf

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

   1. *-commutative N/A

      \[\leadsto \frac{y \cdot \color{blue}{x}}{a \cdot 2} \]

   2. lower-*.f64 50.4

      \[\leadsto \frac{y \cdot \color{blue}{x}}{a \cdot 2} \]

5. Applied rewrites 50.4%

   \[\leadsto \frac{\color{blue}{y \cdot x}}{a \cdot 2} \]
6. Step-by-step derivation

   1. lift-*.f64 N/A

      \[\leadsto \frac{y \cdot x}{\color{blue}{a \cdot 2}} \]

   2. *-commutative N/A

      \[\leadsto \frac{y \cdot x}{\color{blue}{2 \cdot a}} \]

   3. count-2 N/A

      \[\leadsto \frac{y \cdot x}{\color{blue}{a + a}} \]

   4. lift-+.f64 50.4

      \[\leadsto \frac{y \cdot x}{\color{blue}{a + a}} \]

7. Applied rewrites 50.4%

   \[\leadsto \frac{y \cdot x}{\color{blue}{a + a}} \]
8. Add Preprocessing

Developer Target 1: 94.1% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a < -2.090464557976709 \cdot 10^{+86}:\\ \;\;\;\;0.5 \cdot \frac{y \cdot x}{a} - 4.5 \cdot \frac{t}{\frac{a}{z}}\\ \mathbf{elif}\;a < 2.144030707833976 \cdot 10^{+99}:\\ \;\;\;\;\frac{x \cdot y - z \cdot \left(9 \cdot t\right)}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{a} \cdot \left(x \cdot 0.5\right) - \frac{t}{a} \cdot \left(z \cdot 4.5\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (< a -2.090464557976709e+86)
   (- (* 0.5 (/ (* y x) a)) (* 4.5 (/ t (/ a z))))
   (if (< a 2.144030707833976e+99)
     (/ (- (* x y) (* z (* 9.0 t))) (* a 2.0))
     (- (* (/ y a) (* x 0.5)) (* (/ t a) (* z 4.5))))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (a < -2.090464557976709e+86) {
		tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z)));
	} else if (a < 2.144030707833976e+99) {
		tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
	} else {
		tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5));
	}
	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 (a < (-2.090464557976709d+86)) then
        tmp = (0.5d0 * ((y * x) / a)) - (4.5d0 * (t / (a / z)))
    else if (a < 2.144030707833976d+99) then
        tmp = ((x * y) - (z * (9.0d0 * t))) / (a * 2.0d0)
    else
        tmp = ((y / a) * (x * 0.5d0)) - ((t / a) * (z * 4.5d0))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (a < -2.090464557976709e+86) {
		tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z)));
	} else if (a < 2.144030707833976e+99) {
		tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
	} else {
		tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5));
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if a < -2.090464557976709e+86:
		tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z)))
	elif a < 2.144030707833976e+99:
		tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0)
	else:
		tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5))
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (a < -2.090464557976709e+86)
		tmp = Float64(Float64(0.5 * Float64(Float64(y * x) / a)) - Float64(4.5 * Float64(t / Float64(a / z))));
	elseif (a < 2.144030707833976e+99)
		tmp = Float64(Float64(Float64(x * y) - Float64(z * Float64(9.0 * t))) / Float64(a * 2.0));
	else
		tmp = Float64(Float64(Float64(y / a) * Float64(x * 0.5)) - Float64(Float64(t / a) * Float64(z * 4.5)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (a < -2.090464557976709e+86)
		tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z)));
	elseif (a < 2.144030707833976e+99)
		tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
	else
		tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Less[a, -2.090464557976709e+86], N[(N[(0.5 * N[(N[(y * x), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision] - N[(4.5 * N[(t / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Less[a, 2.144030707833976e+99], N[(N[(N[(x * y), $MachinePrecision] - N[(z * N[(9.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(y / a), $MachinePrecision] * N[(x * 0.5), $MachinePrecision]), $MachinePrecision] - N[(N[(t / a), $MachinePrecision] * N[(z * 4.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Reproduce

herbie shell --seed 2025026 
(FPCore (x y z t a)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, I"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< a -209046455797670900000000000000000000000000000000000000000000000000000000000000000000000) (- (* 1/2 (/ (* y x) a)) (* 9/2 (/ t (/ a z)))) (if (< a 2144030707833976000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ (- (* x y) (* z (* 9 t))) (* a 2)) (- (* (/ y a) (* x 1/2)) (* (/ t a) (* z 9/2))))))

  (/ (- (* x y) (* (* z 9.0) t)) (* a 2.0)))