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

Percentage Accurate: 90.8% → 97.3%

Time: 7.9s

Alternatives: 12

Speedup: 0.7×

• 28.4% 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: 90.8% 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: 97.3% accurate, 0.4× speedup

Math

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

FPCore

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (- (* x y) (* (* z 9.0) t))))
   (if (<= t_1 -1e+297)
     (fma y (/ x (* 2.0 a)) (* (- z) (* 4.5 (/ t a))))
     (if (<= t_1 1e+291)
       (/ (fma (* -9.0 z) t (* y x)) (+ a a))
       (fma (/ z a) (* -4.5 t) (* (- y) (/ x (* -2.0 a))))))))

C

assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	double t_1 = (x * y) - ((z * 9.0) * t);
	double tmp;
	if (t_1 <= -1e+297) {
		tmp = fma(y, (x / (2.0 * a)), (-z * (4.5 * (t / a))));
	} else if (t_1 <= 1e+291) {
		tmp = fma((-9.0 * z), t, (y * x)) / (a + a);
	} else {
		tmp = fma((z / a), (-4.5 * t), (-y * (x / (-2.0 * a))));
	}
	return tmp;
}

Julia

x, y, z, t, a = sort([x, y, z, t, a])
x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	t_1 = Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t))
	tmp = 0.0
	if (t_1 <= -1e+297)
		tmp = fma(y, Float64(x / Float64(2.0 * a)), Float64(Float64(-z) * Float64(4.5 * Float64(t / a))));
	elseif (t_1 <= 1e+291)
		tmp = Float64(fma(Float64(-9.0 * z), t, Float64(y * x)) / Float64(a + a));
	else
		tmp = fma(Float64(z / a), Float64(-4.5 * t), Float64(Float64(-y) * Float64(x / Float64(-2.0 * a))));
	end
	return tmp
end

Wolfram

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+297], N[(y * N[(x / N[(2.0 * a), $MachinePrecision]), $MachinePrecision] + N[((-z) * N[(4.5 * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1e+291], N[(N[(N[(-9.0 * z), $MachinePrecision] * t + N[(y * x), $MachinePrecision]), $MachinePrecision] / N[(a + a), $MachinePrecision]), $MachinePrecision], N[(N[(z / a), $MachinePrecision] * N[(-4.5 * t), $MachinePrecision] + N[((-y) * N[(x / N[(-2.0 * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 77.3%

      \[\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. fp-cancel-sub-sign-inv N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. *-commutative N/A

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

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

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

      9. lower-*.f64 N/A

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

      10. metadata-eval 77.3

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

      11. lift-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 77.3

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

   4. Applied rewrites 77.3%

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

   6. Applied rewrites 94.5%

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

   if -1e297 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < 9.9999999999999996e290

   1. Initial program 99.3%

      \[\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. fp-cancel-sub-sign-inv N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. *-commutative N/A

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

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

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

      9. lower-*.f64 N/A

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

      10. metadata-eval 99.4

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

      11. lift-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 99.4

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

   4. Applied rewrites 99.4%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. count-2-rev N/A

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

      4. lower-+.f64 99.4

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

   6. Applied rewrites 99.4%

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

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

   1. Initial program 72.9%

      \[\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. fp-cancel-sub-sign-inv N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. *-commutative N/A

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

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

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

      9. lower-*.f64 N/A

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

      10. metadata-eval 72.9

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

      11. lift-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 72.9

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

   4. Applied rewrites 72.9%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. count-2-rev N/A

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

      4. lower-+.f64 72.9

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

   6. Applied rewrites 72.9%

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

   8. Applied rewrites 93.2%

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

Alternative 2: 97.4% accurate, 0.4× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\ [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} t_1 := x \cdot y - \left(z \cdot 9\right) \cdot t\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{+297} \lor \neg \left(t\_1 \leq 10^{+291}\right):\\ \;\;\;\;\mathsf{fma}\left(y, \frac{x}{2 \cdot a}, \left(-z\right) \cdot \left(4.5 \cdot \frac{t}{a}\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(-9 \cdot z, t, y \cdot x\right)}{a + a}\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (- (* x y) (* (* z 9.0) t))))
   (if (or (<= t_1 -1e+297) (not (<= t_1 1e+291)))
     (fma y (/ x (* 2.0 a)) (* (- z) (* 4.5 (/ t a))))
     (/ (fma (* -9.0 z) t (* y x)) (+ a a)))))

C

assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	double t_1 = (x * y) - ((z * 9.0) * t);
	double tmp;
	if ((t_1 <= -1e+297) || !(t_1 <= 1e+291)) {
		tmp = fma(y, (x / (2.0 * a)), (-z * (4.5 * (t / a))));
	} else {
		tmp = fma((-9.0 * z), t, (y * x)) / (a + a);
	}
	return tmp;
}

Julia

x, y, z, t, a = sort([x, y, z, t, a])
x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	t_1 = Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t))
	tmp = 0.0
	if ((t_1 <= -1e+297) || !(t_1 <= 1e+291))
		tmp = fma(y, Float64(x / Float64(2.0 * a)), Float64(Float64(-z) * Float64(4.5 * Float64(t / a))));
	else
		tmp = Float64(fma(Float64(-9.0 * z), t, Float64(y * x)) / Float64(a + a));
	end
	return tmp
end

Wolfram

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$1, -1e+297], N[Not[LessEqual[t$95$1, 1e+291]], $MachinePrecision]], N[(y * N[(x / N[(2.0 * a), $MachinePrecision]), $MachinePrecision] + N[((-z) * N[(4.5 * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(-9.0 * z), $MachinePrecision] * t + N[(y * x), $MachinePrecision]), $MachinePrecision] / N[(a + a), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < -1e297 or 9.9999999999999996e290 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t))

   1. Initial program 75.3%

      \[\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. fp-cancel-sub-sign-inv N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. *-commutative N/A

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

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

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

      9. lower-*.f64 N/A

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

      10. metadata-eval 75.3

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

      11. lift-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 75.3

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

   4. Applied rewrites 75.3%

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

   6. Applied rewrites 95.4%

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

   if -1e297 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < 9.9999999999999996e290

   1. Initial program 99.3%

      \[\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. fp-cancel-sub-sign-inv N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. *-commutative N/A

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

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

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

      9. lower-*.f64 N/A

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

      10. metadata-eval 99.4

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

      11. lift-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 99.4

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

   4. Applied rewrites 99.4%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. count-2-rev N/A

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

      4. lower-+.f64 99.4

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

   6. Applied rewrites 99.4%

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

4. Final simplification 98.3%

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

Alternative 3: 93.1% accurate, 0.5× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\ [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} \mathbf{if}\;x \cdot y - \left(z \cdot 9\right) \cdot t \leq -5 \cdot 10^{+274}:\\ \;\;\;\;\frac{\mathsf{fma}\left(0.5, x, t \cdot \left(\frac{z}{y} \cdot -4.5\right)\right)}{a} \cdot y\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(-9 \cdot z, t, y \cdot x\right)}{a + a}\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
 :precision binary64
 (if (<= (- (* x y) (* (* z 9.0) t)) -5e+274)
   (* (/ (fma 0.5 x (* t (* (/ z y) -4.5))) a) y)
   (/ (fma (* -9.0 z) t (* y x)) (+ a a))))

C

assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (((x * y) - ((z * 9.0) * t)) <= -5e+274) {
		tmp = (fma(0.5, x, (t * ((z / y) * -4.5))) / a) * y;
	} else {
		tmp = fma((-9.0 * z), t, (y * x)) / (a + a);
	}
	return tmp;
}

Julia

x, y, z, t, a = sort([x, y, z, t, a])
x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	tmp = 0.0
	if (Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t)) <= -5e+274)
		tmp = Float64(Float64(fma(0.5, x, Float64(t * Float64(Float64(z / y) * -4.5))) / a) * y);
	else
		tmp = Float64(fma(Float64(-9.0 * z), t, Float64(y * x)) / Float64(a + a));
	end
	return tmp
end

Wolfram

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := If[LessEqual[N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision], -5e+274], N[(N[(N[(0.5 * x + N[(t * N[(N[(z / y), $MachinePrecision] * -4.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision] * y), $MachinePrecision], N[(N[(N[(-9.0 * z), $MachinePrecision] * t + N[(y * x), $MachinePrecision]), $MachinePrecision] / N[(a + a), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 79.4%

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

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

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

      2. metadata-eval N/A

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

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

         \[\leadsto \color{blue}{\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} \]

      4. cancel-sign-sub-inv N/A

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

      5. distribute-rgt-in N/A

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

      6. metadata-eval N/A

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

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

         \[\leadsto y \cdot \left(\color{blue}{\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) \]

      8. distribute-neg-in N/A

         \[\leadsto y \cdot \color{blue}{\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)} \]

      9. +-commutative N/A

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

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

          \[\leadsto \color{blue}{\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)} \]

      11. mul-1-neg N/A

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

      12. *-commutative N/A

          \[\leadsto -1 \cdot \color{blue}{\left(\left(\frac{-1}{2} \cdot \frac{x}{a} + \frac{9}{2} \cdot \frac{t \cdot z}{a \cdot y}\right) \cdot y\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 -4.9999999999999998e274 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t))

   1. Initial program 95.5%

      \[\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. fp-cancel-sub-sign-inv N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. *-commutative N/A

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

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

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

      9. lower-*.f64 N/A

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

      10. metadata-eval 95.5

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

      11. lift-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 95.5

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

   4. Applied rewrites 95.5%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. count-2-rev N/A

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

      4. lower-+.f64 95.5

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

   6. Applied rewrites 95.5%

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

Alternative 4: 74.0% accurate, 0.6× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\ [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} t_1 := \left(z \cdot 9\right) \cdot t\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{-60}:\\ \;\;\;\;\left(-4.5 \cdot t\right) \cdot \frac{z}{a}\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{-18}:\\ \;\;\;\;\frac{y \cdot x}{a} \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;\left(z \cdot \frac{t}{a}\right) \cdot -4.5\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (* (* z 9.0) t)))
   (if (<= t_1 -1e-60)
     (* (* -4.5 t) (/ z a))
     (if (<= t_1 2e-18) (* (/ (* y x) a) 0.5) (* (* z (/ t a)) -4.5)))))

C

assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	double t_1 = (z * 9.0) * t;
	double tmp;
	if (t_1 <= -1e-60) {
		tmp = (-4.5 * t) * (z / a);
	} else if (t_1 <= 2e-18) {
		tmp = ((y * x) / a) * 0.5;
	} else {
		tmp = (z * (t / a)) * -4.5;
	}
	return tmp;
}

Fortran

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

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

real(8) function code(x, 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) :: t_1
    real(8) :: tmp
    t_1 = (z * 9.0d0) * t
    if (t_1 <= (-1d-60)) then
        tmp = ((-4.5d0) * t) * (z / a)
    else if (t_1 <= 2d-18) then
        tmp = ((y * x) / a) * 0.5d0
    else
        tmp = (z * (t / a)) * (-4.5d0)
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a;
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
	double t_1 = (z * 9.0) * t;
	double tmp;
	if (t_1 <= -1e-60) {
		tmp = (-4.5 * t) * (z / a);
	} else if (t_1 <= 2e-18) {
		tmp = ((y * x) / a) * 0.5;
	} else {
		tmp = (z * (t / a)) * -4.5;
	}
	return tmp;
}

Python

[x, y, z, t, a] = sort([x, y, z, t, a])
[x, y, z, t, a] = sort([x, y, z, t, a])
def code(x, y, z, t, a):
	t_1 = (z * 9.0) * t
	tmp = 0
	if t_1 <= -1e-60:
		tmp = (-4.5 * t) * (z / a)
	elif t_1 <= 2e-18:
		tmp = ((y * x) / a) * 0.5
	else:
		tmp = (z * (t / a)) * -4.5
	return tmp

Julia

x, y, z, t, a = sort([x, y, z, t, a])
x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	t_1 = Float64(Float64(z * 9.0) * t)
	tmp = 0.0
	if (t_1 <= -1e-60)
		tmp = Float64(Float64(-4.5 * t) * Float64(z / a));
	elseif (t_1 <= 2e-18)
		tmp = Float64(Float64(Float64(y * x) / a) * 0.5);
	else
		tmp = Float64(Float64(z * Float64(t / a)) * -4.5);
	end
	return tmp
end

MATLAB

x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
	t_1 = (z * 9.0) * t;
	tmp = 0.0;
	if (t_1 <= -1e-60)
		tmp = (-4.5 * t) * (z / a);
	elseif (t_1 <= 2e-18)
		tmp = ((y * x) / a) * 0.5;
	else
		tmp = (z * (t / a)) * -4.5;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]}, If[LessEqual[t$95$1, -1e-60], N[(N[(-4.5 * t), $MachinePrecision] * N[(z / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e-18], N[(N[(N[(y * x), $MachinePrecision] / a), $MachinePrecision] * 0.5), $MachinePrecision], N[(N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision] * -4.5), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < -9.9999999999999997e-61

   1. Initial program 92.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}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-*.f64 70.8

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

   5. Applied rewrites 70.8%

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

   7. Applied rewrites 77.4%

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

   if -9.9999999999999997e-61 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 2.0000000000000001e-18

   1. Initial program 96.5%

      \[\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}{\frac{1}{2} \cdot \frac{x \cdot y}{a}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 83.8

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

   5. Applied rewrites 83.8%

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

   if 2.0000000000000001e-18 < (*.f64 (*.f64 z #s(literal 9 binary64)) t)

   1. Initial program 88.8%

      \[\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 \color{blue}{\frac{t \cdot z}{a} \cdot \frac{-9}{2}} \]

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-*.f64 64.5

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

   5. Applied rewrites 64.5%

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

   7. Applied rewrites 70.2%

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

Alternative 5: 92.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\ [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} \mathbf{if}\;x \leq -1.2 \cdot 10^{+112}:\\ \;\;\;\;\frac{\mathsf{fma}\left(0.5, y, t \cdot \left(\frac{z}{x} \cdot -4.5\right)\right)}{a} \cdot x\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(y, x, \left(t \cdot -9\right) \cdot z\right)}{a + a}\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
 :precision binary64
 (if (<= x -1.2e+112)
   (* (/ (fma 0.5 y (* t (* (/ z x) -4.5))) a) x)
   (/ (fma y x (* (* t -9.0) z)) (+ a a))))

C

assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (x <= -1.2e+112) {
		tmp = (fma(0.5, y, (t * ((z / x) * -4.5))) / a) * x;
	} else {
		tmp = fma(y, x, ((t * -9.0) * z)) / (a + a);
	}
	return tmp;
}

Julia

x, y, z, t, a = sort([x, y, z, t, a])
x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	tmp = 0.0
	if (x <= -1.2e+112)
		tmp = Float64(Float64(fma(0.5, y, Float64(t * Float64(Float64(z / x) * -4.5))) / a) * x);
	else
		tmp = Float64(fma(y, x, Float64(Float64(t * -9.0) * z)) / Float64(a + a));
	end
	return tmp
end

Wolfram

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := If[LessEqual[x, -1.2e+112], N[(N[(N[(0.5 * y + N[(t * N[(N[(z / x), $MachinePrecision] * -4.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision] * x), $MachinePrecision], N[(N[(y * x + N[(N[(t * -9.0), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] / N[(a + a), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.2e112

   1. Initial program 79.2%

      \[\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 99.7%

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

   if -1.2e112 < x

   1. Initial program 95.9%

      \[\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. fp-cancel-sub-sign-inv N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. *-commutative N/A

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

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

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

      9. lower-*.f64 N/A

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

      10. metadata-eval 95.9

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

      11. lift-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 95.9

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

   4. Applied rewrites 95.9%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. count-2-rev N/A

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

      4. lower-+.f64 95.9

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

   6. Applied rewrites 95.9%

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

      1. lift-fma.f64 N/A

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

      2. *-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*l* N/A

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

      5. lift-*.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. +-commutative N/A

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

      8. lift-*.f64 N/A

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

      9. lift-fma.f64 95.9

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

   8. Applied rewrites 95.9%

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

Alternative 6: 92.7% accurate, 0.7× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\ [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} \mathbf{if}\;\left(z \cdot 9\right) \cdot t \leq -1 \cdot 10^{+287}:\\ \;\;\;\;\left(z \cdot \frac{t}{a}\right) \cdot -4.5\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(t \cdot z, -9, y \cdot x\right)}{a + a}\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
 :precision binary64
 (if (<= (* (* z 9.0) t) -1e+287)
   (* (* z (/ t a)) -4.5)
   (/ (fma (* t z) -9.0 (* y x)) (+ a a))))

C

assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (((z * 9.0) * t) <= -1e+287) {
		tmp = (z * (t / a)) * -4.5;
	} else {
		tmp = fma((t * z), -9.0, (y * x)) / (a + a);
	}
	return tmp;
}

Julia

x, y, z, t, a = sort([x, y, z, t, a])
x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	tmp = 0.0
	if (Float64(Float64(z * 9.0) * t) <= -1e+287)
		tmp = Float64(Float64(z * Float64(t / a)) * -4.5);
	else
		tmp = Float64(fma(Float64(t * z), -9.0, Float64(y * x)) / Float64(a + a));
	end
	return tmp
end

Wolfram

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := If[LessEqual[N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision], -1e+287], N[(N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision] * -4.5), $MachinePrecision], N[(N[(N[(t * z), $MachinePrecision] * -9.0 + N[(y * x), $MachinePrecision]), $MachinePrecision] / N[(a + a), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 73.5%

      \[\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 \color{blue}{\frac{t \cdot z}{a} \cdot \frac{-9}{2}} \]

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-*.f64 73.4

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

   5. Applied rewrites 73.4%

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

   7. Applied rewrites 99.7%

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

   if -1.0000000000000001e287 < (*.f64 (*.f64 z #s(literal 9 binary64)) t)

   1. Initial program 94.7%

      \[\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. fp-cancel-sub-sign-inv N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. lift-*.f64 N/A

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

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

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

      8. associate-*r* N/A

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

      9. lower-fma.f64 N/A

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

      10. lower-*.f64 N/A

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

      11. metadata-eval 94.7

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

      12. lift-*.f64 N/A

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

      13. *-commutative N/A

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

      14. lower-*.f64 94.7

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

   4. Applied rewrites 94.7%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. count-2-rev N/A

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

      4. lower-+.f64 94.7

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

   6. Applied rewrites 94.7%

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

Alternative 7: 92.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\ [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} \mathbf{if}\;\left(z \cdot 9\right) \cdot t \leq -\infty:\\ \;\;\;\;\left(z \cdot \frac{t}{a}\right) \cdot -4.5\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(-9 \cdot z, t, y \cdot x\right)}{a + a}\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
 :precision binary64
 (if (<= (* (* z 9.0) t) (- INFINITY))
   (* (* z (/ t a)) -4.5)
   (/ (fma (* -9.0 z) t (* y x)) (+ a a))))

C

assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (((z * 9.0) * t) <= -((double) INFINITY)) {
		tmp = (z * (t / a)) * -4.5;
	} else {
		tmp = fma((-9.0 * z), t, (y * x)) / (a + a);
	}
	return tmp;
}

Julia

x, y, z, t, a = sort([x, y, z, t, a])
x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	tmp = 0.0
	if (Float64(Float64(z * 9.0) * t) <= Float64(-Inf))
		tmp = Float64(Float64(z * Float64(t / a)) * -4.5);
	else
		tmp = Float64(fma(Float64(-9.0 * z), t, Float64(y * x)) / Float64(a + a));
	end
	return tmp
end

Wolfram

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := If[LessEqual[N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision], (-Infinity)], N[(N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision] * -4.5), $MachinePrecision], N[(N[(N[(-9.0 * z), $MachinePrecision] * t + N[(y * x), $MachinePrecision]), $MachinePrecision] / N[(a + a), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 69.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 \color{blue}{\frac{t \cdot z}{a} \cdot \frac{-9}{2}} \]

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-*.f64 69.1

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

   5. Applied rewrites 69.1%

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

   7. Applied rewrites 99.6%

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

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

   1. Initial program 94.8%

      \[\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. fp-cancel-sub-sign-inv N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. *-commutative N/A

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

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

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

      9. lower-*.f64 N/A

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

      10. metadata-eval 94.8

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

      11. lift-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 94.8

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

   4. Applied rewrites 94.8%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. count-2-rev N/A

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

      4. lower-+.f64 94.8

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

   6. Applied rewrites 94.8%

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

Alternative 8: 92.7% accurate, 0.7× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\ [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} \mathbf{if}\;\left(z \cdot 9\right) \cdot t \leq -1 \cdot 10^{+280}:\\ \;\;\;\;\left(z \cdot \frac{t}{a}\right) \cdot -4.5\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(y, x, \left(t \cdot -9\right) \cdot z\right)}{a + a}\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
 :precision binary64
 (if (<= (* (* z 9.0) t) -1e+280)
   (* (* z (/ t a)) -4.5)
   (/ (fma y x (* (* t -9.0) z)) (+ a a))))

C

assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (((z * 9.0) * t) <= -1e+280) {
		tmp = (z * (t / a)) * -4.5;
	} else {
		tmp = fma(y, x, ((t * -9.0) * z)) / (a + a);
	}
	return tmp;
}

Julia

x, y, z, t, a = sort([x, y, z, t, a])
x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	tmp = 0.0
	if (Float64(Float64(z * 9.0) * t) <= -1e+280)
		tmp = Float64(Float64(z * Float64(t / a)) * -4.5);
	else
		tmp = Float64(fma(y, x, Float64(Float64(t * -9.0) * z)) / Float64(a + a));
	end
	return tmp
end

Wolfram

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := If[LessEqual[N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision], -1e+280], N[(N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision] * -4.5), $MachinePrecision], N[(N[(y * x + N[(N[(t * -9.0), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] / N[(a + a), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 75.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}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-*.f64 75.7

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

   5. Applied rewrites 75.7%

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

   7. Applied rewrites 99.6%

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

   if -1e280 < (*.f64 (*.f64 z #s(literal 9 binary64)) t)

   1. Initial program 94.7%

      \[\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. fp-cancel-sub-sign-inv N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. *-commutative N/A

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

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

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

      9. lower-*.f64 N/A

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

      10. metadata-eval 94.7

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

      11. lift-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 94.7

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

   4. Applied rewrites 94.7%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. count-2-rev N/A

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

      4. lower-+.f64 94.7

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

   6. Applied rewrites 94.7%

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

      1. lift-fma.f64 N/A

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

      2. *-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*l* N/A

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

      5. lift-*.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. +-commutative N/A

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

      8. lift-*.f64 N/A

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

      9. lift-fma.f64 94.7

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

   8. Applied rewrites 94.7%

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

Alternative 9: 74.0% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\ [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} \mathbf{if}\;x \cdot y \leq -5 \cdot 10^{+109} \lor \neg \left(x \cdot y \leq 10^{-37}\right):\\ \;\;\;\;\left(0.5 \cdot y\right) \cdot \frac{x}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{t \cdot z}{a} \cdot -4.5\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
 :precision binary64
 (if (or (<= (* x y) -5e+109) (not (<= (* x y) 1e-37)))
   (* (* 0.5 y) (/ x a))
   (* (/ (* t z) a) -4.5)))

C

assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (((x * y) <= -5e+109) || !((x * y) <= 1e-37)) {
		tmp = (0.5 * y) * (x / a);
	} else {
		tmp = ((t * z) / a) * -4.5;
	}
	return tmp;
}

Fortran

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

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

real(8) function code(x, 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 (((x * y) <= (-5d+109)) .or. (.not. ((x * y) <= 1d-37))) then
        tmp = (0.5d0 * y) * (x / a)
    else
        tmp = ((t * z) / a) * (-4.5d0)
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a;
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (((x * y) <= -5e+109) || !((x * y) <= 1e-37)) {
		tmp = (0.5 * y) * (x / a);
	} else {
		tmp = ((t * z) / a) * -4.5;
	}
	return tmp;
}

Python

[x, y, z, t, a] = sort([x, y, z, t, a])
[x, y, z, t, a] = sort([x, y, z, t, a])
def code(x, y, z, t, a):
	tmp = 0
	if ((x * y) <= -5e+109) or not ((x * y) <= 1e-37):
		tmp = (0.5 * y) * (x / a)
	else:
		tmp = ((t * z) / a) * -4.5
	return tmp

Julia

x, y, z, t, a = sort([x, y, z, t, a])
x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	tmp = 0.0
	if ((Float64(x * y) <= -5e+109) || !(Float64(x * y) <= 1e-37))
		tmp = Float64(Float64(0.5 * y) * Float64(x / a));
	else
		tmp = Float64(Float64(Float64(t * z) / a) * -4.5);
	end
	return tmp
end

MATLAB

x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (((x * y) <= -5e+109) || ~(((x * y) <= 1e-37)))
		tmp = (0.5 * y) * (x / a);
	else
		tmp = ((t * z) / a) * -4.5;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := If[Or[LessEqual[N[(x * y), $MachinePrecision], -5e+109], N[Not[LessEqual[N[(x * y), $MachinePrecision], 1e-37]], $MachinePrecision]], N[(N[(0.5 * y), $MachinePrecision] * N[(x / a), $MachinePrecision]), $MachinePrecision], N[(N[(N[(t * z), $MachinePrecision] / a), $MachinePrecision] * -4.5), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x y) < -5.0000000000000001e109 or 1.00000000000000007e-37 < (*.f64 x y)

   1. Initial program 89.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 94.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 x around inf

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

   8. Applied rewrites 78.1%

      \[\leadsto \frac{0.5 \cdot y}{a} \cdot x \]
   9. Step-by-step derivation

   10. Applied rewrites 76.5%

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

   if -5.0000000000000001e109 < (*.f64 x y) < 1.00000000000000007e-37

   1. Initial program 95.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}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-*.f64 74.9

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

   5. Applied rewrites 74.9%

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

4. Final simplification 75.6%

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

Alternative 10: 74.0% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\ [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} \mathbf{if}\;x \cdot y \leq -5 \cdot 10^{+109} \lor \neg \left(x \cdot y \leq 10^{-37}\right):\\ \;\;\;\;\left(0.5 \cdot y\right) \cdot \frac{x}{a}\\ \mathbf{else}:\\ \;\;\;\;\left(t \cdot z\right) \cdot \frac{-4.5}{a}\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
 :precision binary64
 (if (or (<= (* x y) -5e+109) (not (<= (* x y) 1e-37)))
   (* (* 0.5 y) (/ x a))
   (* (* t z) (/ -4.5 a))))

C

assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (((x * y) <= -5e+109) || !((x * y) <= 1e-37)) {
		tmp = (0.5 * y) * (x / a);
	} else {
		tmp = (t * z) * (-4.5 / a);
	}
	return tmp;
}

Fortran

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

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

real(8) function code(x, 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 (((x * y) <= (-5d+109)) .or. (.not. ((x * y) <= 1d-37))) then
        tmp = (0.5d0 * y) * (x / a)
    else
        tmp = (t * z) * ((-4.5d0) / a)
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a;
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (((x * y) <= -5e+109) || !((x * y) <= 1e-37)) {
		tmp = (0.5 * y) * (x / a);
	} else {
		tmp = (t * z) * (-4.5 / a);
	}
	return tmp;
}

Python

[x, y, z, t, a] = sort([x, y, z, t, a])
[x, y, z, t, a] = sort([x, y, z, t, a])
def code(x, y, z, t, a):
	tmp = 0
	if ((x * y) <= -5e+109) or not ((x * y) <= 1e-37):
		tmp = (0.5 * y) * (x / a)
	else:
		tmp = (t * z) * (-4.5 / a)
	return tmp

Julia

x, y, z, t, a = sort([x, y, z, t, a])
x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	tmp = 0.0
	if ((Float64(x * y) <= -5e+109) || !(Float64(x * y) <= 1e-37))
		tmp = Float64(Float64(0.5 * y) * Float64(x / a));
	else
		tmp = Float64(Float64(t * z) * Float64(-4.5 / a));
	end
	return tmp
end

MATLAB

x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (((x * y) <= -5e+109) || ~(((x * y) <= 1e-37)))
		tmp = (0.5 * y) * (x / a);
	else
		tmp = (t * z) * (-4.5 / a);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := If[Or[LessEqual[N[(x * y), $MachinePrecision], -5e+109], N[Not[LessEqual[N[(x * y), $MachinePrecision], 1e-37]], $MachinePrecision]], N[(N[(0.5 * y), $MachinePrecision] * N[(x / a), $MachinePrecision]), $MachinePrecision], N[(N[(t * z), $MachinePrecision] * N[(-4.5 / a), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x y) < -5.0000000000000001e109 or 1.00000000000000007e-37 < (*.f64 x y)

   1. Initial program 89.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 94.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 x around inf

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

   8. Applied rewrites 78.1%

      \[\leadsto \frac{0.5 \cdot y}{a} \cdot x \]
   9. Step-by-step derivation

   10. Applied rewrites 76.5%

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

   if -5.0000000000000001e109 < (*.f64 x y) < 1.00000000000000007e-37

   1. Initial program 95.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}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-*.f64 74.9

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

   5. Applied rewrites 74.9%

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

   7. Applied rewrites 74.9%

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

4. Final simplification 75.6%

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

Alternative 11: 73.0% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\ [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} \mathbf{if}\;x \cdot y \leq -5 \cdot 10^{+109} \lor \neg \left(x \cdot y \leq 10^{-37}\right):\\ \;\;\;\;\left(0.5 \cdot y\right) \cdot \frac{x}{a}\\ \mathbf{else}:\\ \;\;\;\;t \cdot \left(\frac{z}{a} \cdot -4.5\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
 :precision binary64
 (if (or (<= (* x y) -5e+109) (not (<= (* x y) 1e-37)))
   (* (* 0.5 y) (/ x a))
   (* t (* (/ z a) -4.5))))

C

assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (((x * y) <= -5e+109) || !((x * y) <= 1e-37)) {
		tmp = (0.5 * y) * (x / a);
	} else {
		tmp = t * ((z / a) * -4.5);
	}
	return tmp;
}

Fortran

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

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

real(8) function code(x, 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 (((x * y) <= (-5d+109)) .or. (.not. ((x * y) <= 1d-37))) then
        tmp = (0.5d0 * y) * (x / a)
    else
        tmp = t * ((z / a) * (-4.5d0))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a;
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (((x * y) <= -5e+109) || !((x * y) <= 1e-37)) {
		tmp = (0.5 * y) * (x / a);
	} else {
		tmp = t * ((z / a) * -4.5);
	}
	return tmp;
}

Python

[x, y, z, t, a] = sort([x, y, z, t, a])
[x, y, z, t, a] = sort([x, y, z, t, a])
def code(x, y, z, t, a):
	tmp = 0
	if ((x * y) <= -5e+109) or not ((x * y) <= 1e-37):
		tmp = (0.5 * y) * (x / a)
	else:
		tmp = t * ((z / a) * -4.5)
	return tmp

Julia

x, y, z, t, a = sort([x, y, z, t, a])
x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	tmp = 0.0
	if ((Float64(x * y) <= -5e+109) || !(Float64(x * y) <= 1e-37))
		tmp = Float64(Float64(0.5 * y) * Float64(x / a));
	else
		tmp = Float64(t * Float64(Float64(z / a) * -4.5));
	end
	return tmp
end

MATLAB

x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (((x * y) <= -5e+109) || ~(((x * y) <= 1e-37)))
		tmp = (0.5 * y) * (x / a);
	else
		tmp = t * ((z / a) * -4.5);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := If[Or[LessEqual[N[(x * y), $MachinePrecision], -5e+109], N[Not[LessEqual[N[(x * y), $MachinePrecision], 1e-37]], $MachinePrecision]], N[(N[(0.5 * y), $MachinePrecision] * N[(x / a), $MachinePrecision]), $MachinePrecision], N[(t * N[(N[(z / a), $MachinePrecision] * -4.5), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x y) < -5.0000000000000001e109 or 1.00000000000000007e-37 < (*.f64 x y)

   1. Initial program 89.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 94.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 x around inf

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

   8. Applied rewrites 78.1%

      \[\leadsto \frac{0.5 \cdot y}{a} \cdot x \]
   9. Step-by-step derivation

   10. Applied rewrites 76.5%

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

   if -5.0000000000000001e109 < (*.f64 x y) < 1.00000000000000007e-37

   1. Initial program 95.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}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-*.f64 74.9

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

   5. Applied rewrites 74.9%

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

   7. Applied rewrites 75.0%

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

4. Final simplification 75.7%

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

Alternative 12: 51.3% accurate, 1.6× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\ [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ t \cdot \left(\frac{z}{a} \cdot -4.5\right) \end{array} \]

FPCore

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a) :precision binary64 (* t (* (/ z a) -4.5)))

C

assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	return t * ((z / a) * -4.5);
}

Fortran

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

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

real(8) function code(x, 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 = t * ((z / a) * (-4.5d0))
end function

Java

assert x < y && y < z && z < t && t < a;
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
	return t * ((z / a) * -4.5);
}

Python

[x, y, z, t, a] = sort([x, y, z, t, a])
[x, y, z, t, a] = sort([x, y, z, t, a])
def code(x, y, z, t, a):
	return t * ((z / a) * -4.5)

Julia

x, y, z, t, a = sort([x, y, z, t, a])
x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	return Float64(t * Float64(Float64(z / a) * -4.5))
end

MATLAB

x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp = code(x, y, z, t, a)
	tmp = t * ((z / a) * -4.5);
end

Wolfram

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := N[(t * N[(N[(z / a), $MachinePrecision] * -4.5), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 93.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}} \]
4. Step-by-step derivation

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. lower-/.f64 N/A

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

   4. lower-*.f64 50.0

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

5. Applied rewrites 50.0%

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

7. Applied rewrites 52.2%

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

Developer Target 1: 93.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 2024350 
(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)))