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

Percentage Accurate: 95.7% → 98.8%

Time: 4.5s

Alternatives: 16

Speedup: 0.9×

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

Specification

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (+ (- (* x 2.0) (* (* (* y 9.0) z) t)) (* (* a 27.0) b)))

C

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

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, b)
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), intent (in) :: b
    code = ((x * 2.0d0) - (((y * 9.0d0) * z) * t)) + ((a * 27.0d0) * b)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 95.7% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (+ (- (* x 2.0) (* (* (* y 9.0) z) t)) (* (* a 27.0) b)))

C

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

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, b)
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), intent (in) :: b
    code = ((x * 2.0d0) - (((y * 9.0d0) * z) * t)) + ((a * 27.0d0) * b)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 98.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} t_1 := \mathsf{fma}\left(b \cdot a, 27, 2 \cdot x\right)\\ \mathbf{if}\;t \leq 7 \cdot 10^{+31}:\\ \;\;\;\;\mathsf{fma}\left(\left(t \cdot y\right) \cdot -9, z, t\_1\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-9 \cdot \left(z \cdot y\right), t, t\_1\right)\\ \end{array} \end{array} \]

FPCore

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

C

assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = fma((b * a), 27.0, (2.0 * x));
	double tmp;
	if (t <= 7e+31) {
		tmp = fma(((t * y) * -9.0), z, t_1);
	} else {
		tmp = fma((-9.0 * (z * y)), t, t_1);
	}
	return tmp;
}

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	t_1 = fma(Float64(b * a), 27.0, Float64(2.0 * x))
	tmp = 0.0
	if (t <= 7e+31)
		tmp = fma(Float64(Float64(t * y) * -9.0), z, t_1);
	else
		tmp = fma(Float64(-9.0 * Float64(z * y)), t, t_1);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < 7e31

   1. Initial program 93.3%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-*.f64 N/A

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

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

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lift-*.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. *-commutative N/A

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

      10. associate-*r* N/A

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

      11. associate-+l+ N/A

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

   4. Applied rewrites 99.2%

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

   if 7e31 < t

   1. Initial program 97.8%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-*.f64 N/A

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

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

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lift-*.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. *-commutative N/A

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

      10. associate-*r* N/A

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

      11. associate-+l+ N/A

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

   4. Applied rewrites 98.4%

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

Alternative 2: 56.1% accurate, 0.5× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} t_1 := \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\\ \mathbf{if}\;t\_1 \leq -5 \cdot 10^{+26}:\\ \;\;\;\;\left(y \cdot \left(t \cdot z\right)\right) \cdot -9\\ \mathbf{elif}\;t\_1 \leq 10^{-321}:\\ \;\;\;\;x + x\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+60}:\\ \;\;\;\;\left(27 \cdot b\right) \cdot a\\ \mathbf{else}:\\ \;\;\;\;\left(\left(y \cdot z\right) \cdot -9\right) \cdot t\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* (* (* y 9.0) z) t)))
   (if (<= t_1 -5e+26)
     (* (* y (* t z)) -9.0)
     (if (<= t_1 1e-321)
       (+ x x)
       (if (<= t_1 5e+60) (* (* 27.0 b) a) (* (* (* y z) -9.0) t))))))

C

assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = ((y * 9.0) * z) * t;
	double tmp;
	if (t_1 <= -5e+26) {
		tmp = (y * (t * z)) * -9.0;
	} else if (t_1 <= 1e-321) {
		tmp = x + x;
	} else if (t_1 <= 5e+60) {
		tmp = (27.0 * b) * a;
	} else {
		tmp = ((y * z) * -9.0) * t;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b 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, b)
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), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = ((y * 9.0d0) * z) * t
    if (t_1 <= (-5d+26)) then
        tmp = (y * (t * z)) * (-9.0d0)
    else if (t_1 <= 1d-321) then
        tmp = x + x
    else if (t_1 <= 5d+60) then
        tmp = (27.0d0 * b) * a
    else
        tmp = ((y * z) * (-9.0d0)) * t
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = ((y * 9.0) * z) * t;
	double tmp;
	if (t_1 <= -5e+26) {
		tmp = (y * (t * z)) * -9.0;
	} else if (t_1 <= 1e-321) {
		tmp = x + x;
	} else if (t_1 <= 5e+60) {
		tmp = (27.0 * b) * a;
	} else {
		tmp = ((y * z) * -9.0) * t;
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	t_1 = ((y * 9.0) * z) * t
	tmp = 0
	if t_1 <= -5e+26:
		tmp = (y * (t * z)) * -9.0
	elif t_1 <= 1e-321:
		tmp = x + x
	elif t_1 <= 5e+60:
		tmp = (27.0 * b) * a
	else:
		tmp = ((y * z) * -9.0) * t
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(Float64(y * 9.0) * z) * t)
	tmp = 0.0
	if (t_1 <= -5e+26)
		tmp = Float64(Float64(y * Float64(t * z)) * -9.0);
	elseif (t_1 <= 1e-321)
		tmp = Float64(x + x);
	elseif (t_1 <= 5e+60)
		tmp = Float64(Float64(27.0 * b) * a);
	else
		tmp = Float64(Float64(Float64(y * z) * -9.0) * t);
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	t_1 = ((y * 9.0) * z) * t;
	tmp = 0.0;
	if (t_1 <= -5e+26)
		tmp = (y * (t * z)) * -9.0;
	elseif (t_1 <= 1e-321)
		tmp = x + x;
	elseif (t_1 <= 5e+60)
		tmp = (27.0 * b) * a;
	else
		tmp = ((y * z) * -9.0) * t;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(N[(y * 9.0), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+26], N[(N[(y * N[(t * z), $MachinePrecision]), $MachinePrecision] * -9.0), $MachinePrecision], If[LessEqual[t$95$1, 1e-321], N[(x + x), $MachinePrecision], If[LessEqual[t$95$1, 5e+60], N[(N[(27.0 * b), $MachinePrecision] * a), $MachinePrecision], N[(N[(N[(y * z), $MachinePrecision] * -9.0), $MachinePrecision] * t), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < -5.0000000000000001e26

   1. Initial program 91.2%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. lower-*.f64 15.4

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

   5. Applied rewrites 15.4%

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

   6. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

      4. lower-*.f64 N/A

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

      5. lower-*.f64 66.0

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

   8. Applied rewrites 66.0%

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

      1. lift-*.f64 N/A

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

      2. lift-*.f64 N/A

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

      3. associate-*l* N/A

         \[\leadsto \left(y \cdot \left(z \cdot t\right)\right) \cdot -9 \]

      4. *-commutative N/A

         \[\leadsto \left(y \cdot \left(t \cdot z\right)\right) \cdot -9 \]

      5. lower-*.f64 N/A

         \[\leadsto \left(y \cdot \left(t \cdot z\right)\right) \cdot -9 \]

      6. lift-*.f64 66.5

         \[\leadsto \left(y \cdot \left(t \cdot z\right)\right) \cdot -9 \]

   10. Applied rewrites 66.5%

       \[\leadsto \left(y \cdot \left(t \cdot z\right)\right) \cdot -9 \]

   if -5.0000000000000001e26 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < 9.98013e-322

   1. Initial program 99.2%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. lower-*.f64 45.4

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

   5. Applied rewrites 45.4%

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

      1. lift-*.f64 N/A

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

      2. count-2-rev N/A

         \[\leadsto x + \color{blue}{x} \]

      3. lower-+.f64 45.4

         \[\leadsto x + \color{blue}{x} \]

   7. Applied rewrites 45.4%

      \[\leadsto x + \color{blue}{x} \]

   if 9.98013e-322 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < 4.99999999999999975e60

   1. Initial program 99.7%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in a around inf

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

   5. Applied rewrites 86.4%

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

   6. Taylor expanded in a around inf

      \[\leadsto \left(27 \cdot b\right) \cdot a \]
   7. Step-by-step derivation

      1. lower-*.f64 45.7

         \[\leadsto \left(27 \cdot b\right) \cdot a \]

   8. Applied rewrites 45.7%

      \[\leadsto \left(27 \cdot b\right) \cdot a \]

   if 4.99999999999999975e60 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t)

   1. Initial program 91.8%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. lower-*.f64 12.8

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

   5. Applied rewrites 12.8%

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

   6. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

      4. lower-*.f64 N/A

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

      5. lower-*.f64 71.1

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

   8. Applied rewrites 71.1%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

      3. lift-*.f64 N/A

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

      4. *-commutative N/A

         \[\leadsto \left(t \cdot \left(y \cdot z\right)\right) \cdot -9 \]

      5. *-commutative N/A

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

      6. *-commutative N/A

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

      7. *-commutative N/A

         \[\leadsto -9 \cdot \left(\left(z \cdot y\right) \cdot t\right) \]

      8. associate-*l* N/A

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

      9. *-commutative N/A

         \[\leadsto \left(-9 \cdot \left(y \cdot z\right)\right) \cdot t \]

      10. lower-*.f64 N/A

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

      11. *-commutative N/A

          \[\leadsto \left(\left(y \cdot z\right) \cdot -9\right) \cdot t \]

      12. lower-*.f64 N/A

          \[\leadsto \left(\left(y \cdot z\right) \cdot -9\right) \cdot t \]

      13. lift-*.f64 71.1

          \[\leadsto \left(\left(y \cdot z\right) \cdot -9\right) \cdot t \]

   10. Applied rewrites 71.1%

       \[\leadsto \left(\left(y \cdot z\right) \cdot -9\right) \cdot \color{blue}{t} \]
3. Recombined 4 regimes into one program.
4. Add Preprocessing

Alternative 3: 56.1% accurate, 0.5× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} t_1 := \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\\ \mathbf{if}\;t\_1 \leq -5 \cdot 10^{+26}:\\ \;\;\;\;\left(y \cdot \left(t \cdot z\right)\right) \cdot -9\\ \mathbf{elif}\;t\_1 \leq 10^{-321}:\\ \;\;\;\;x + x\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+60}:\\ \;\;\;\;\left(27 \cdot b\right) \cdot a\\ \mathbf{else}:\\ \;\;\;\;\left(y \cdot z\right) \cdot \left(t \cdot -9\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* (* (* y 9.0) z) t)))
   (if (<= t_1 -5e+26)
     (* (* y (* t z)) -9.0)
     (if (<= t_1 1e-321)
       (+ x x)
       (if (<= t_1 5e+60) (* (* 27.0 b) a) (* (* y z) (* t -9.0)))))))

C

assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = ((y * 9.0) * z) * t;
	double tmp;
	if (t_1 <= -5e+26) {
		tmp = (y * (t * z)) * -9.0;
	} else if (t_1 <= 1e-321) {
		tmp = x + x;
	} else if (t_1 <= 5e+60) {
		tmp = (27.0 * b) * a;
	} else {
		tmp = (y * z) * (t * -9.0);
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b 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, b)
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), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = ((y * 9.0d0) * z) * t
    if (t_1 <= (-5d+26)) then
        tmp = (y * (t * z)) * (-9.0d0)
    else if (t_1 <= 1d-321) then
        tmp = x + x
    else if (t_1 <= 5d+60) then
        tmp = (27.0d0 * b) * a
    else
        tmp = (y * z) * (t * (-9.0d0))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = ((y * 9.0) * z) * t;
	double tmp;
	if (t_1 <= -5e+26) {
		tmp = (y * (t * z)) * -9.0;
	} else if (t_1 <= 1e-321) {
		tmp = x + x;
	} else if (t_1 <= 5e+60) {
		tmp = (27.0 * b) * a;
	} else {
		tmp = (y * z) * (t * -9.0);
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	t_1 = ((y * 9.0) * z) * t
	tmp = 0
	if t_1 <= -5e+26:
		tmp = (y * (t * z)) * -9.0
	elif t_1 <= 1e-321:
		tmp = x + x
	elif t_1 <= 5e+60:
		tmp = (27.0 * b) * a
	else:
		tmp = (y * z) * (t * -9.0)
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(Float64(y * 9.0) * z) * t)
	tmp = 0.0
	if (t_1 <= -5e+26)
		tmp = Float64(Float64(y * Float64(t * z)) * -9.0);
	elseif (t_1 <= 1e-321)
		tmp = Float64(x + x);
	elseif (t_1 <= 5e+60)
		tmp = Float64(Float64(27.0 * b) * a);
	else
		tmp = Float64(Float64(y * z) * Float64(t * -9.0));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	t_1 = ((y * 9.0) * z) * t;
	tmp = 0.0;
	if (t_1 <= -5e+26)
		tmp = (y * (t * z)) * -9.0;
	elseif (t_1 <= 1e-321)
		tmp = x + x;
	elseif (t_1 <= 5e+60)
		tmp = (27.0 * b) * a;
	else
		tmp = (y * z) * (t * -9.0);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(N[(y * 9.0), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+26], N[(N[(y * N[(t * z), $MachinePrecision]), $MachinePrecision] * -9.0), $MachinePrecision], If[LessEqual[t$95$1, 1e-321], N[(x + x), $MachinePrecision], If[LessEqual[t$95$1, 5e+60], N[(N[(27.0 * b), $MachinePrecision] * a), $MachinePrecision], N[(N[(y * z), $MachinePrecision] * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < -5.0000000000000001e26

   1. Initial program 91.2%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. lower-*.f64 15.4

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

   5. Applied rewrites 15.4%

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

   6. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

      4. lower-*.f64 N/A

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

      5. lower-*.f64 66.0

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

   8. Applied rewrites 66.0%

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

      1. lift-*.f64 N/A

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

      2. lift-*.f64 N/A

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

      3. associate-*l* N/A

         \[\leadsto \left(y \cdot \left(z \cdot t\right)\right) \cdot -9 \]

      4. *-commutative N/A

         \[\leadsto \left(y \cdot \left(t \cdot z\right)\right) \cdot -9 \]

      5. lower-*.f64 N/A

         \[\leadsto \left(y \cdot \left(t \cdot z\right)\right) \cdot -9 \]

      6. lift-*.f64 66.5

         \[\leadsto \left(y \cdot \left(t \cdot z\right)\right) \cdot -9 \]

   10. Applied rewrites 66.5%

       \[\leadsto \left(y \cdot \left(t \cdot z\right)\right) \cdot -9 \]

   if -5.0000000000000001e26 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < 9.98013e-322

   1. Initial program 99.2%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. lower-*.f64 45.4

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

   5. Applied rewrites 45.4%

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

      1. lift-*.f64 N/A

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

      2. count-2-rev N/A

         \[\leadsto x + \color{blue}{x} \]

      3. lower-+.f64 45.4

         \[\leadsto x + \color{blue}{x} \]

   7. Applied rewrites 45.4%

      \[\leadsto x + \color{blue}{x} \]

   if 9.98013e-322 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < 4.99999999999999975e60

   1. Initial program 99.7%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in a around inf

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

   5. Applied rewrites 86.4%

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

   6. Taylor expanded in a around inf

      \[\leadsto \left(27 \cdot b\right) \cdot a \]
   7. Step-by-step derivation

      1. lower-*.f64 45.7

         \[\leadsto \left(27 \cdot b\right) \cdot a \]

   8. Applied rewrites 45.7%

      \[\leadsto \left(27 \cdot b\right) \cdot a \]

   if 4.99999999999999975e60 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t)

   1. Initial program 91.8%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. lower-*.f64 12.8

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

   5. Applied rewrites 12.8%

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

   6. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

      4. lower-*.f64 N/A

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

      5. lower-*.f64 71.1

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

   8. Applied rewrites 71.1%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

      3. lift-*.f64 N/A

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

      4. associate-*l* N/A

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

      5. lower-*.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lower-*.f64 71.0

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

   10. Applied rewrites 71.0%

       \[\leadsto \left(y \cdot z\right) \cdot \color{blue}{\left(t \cdot -9\right)} \]
3. Recombined 4 regimes into one program.
4. Add Preprocessing

Alternative 4: 56.1% accurate, 0.5× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} t_1 := \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\\ \mathbf{if}\;t\_1 \leq -5 \cdot 10^{+56}:\\ \;\;\;\;-9 \cdot \left(\left(z \cdot y\right) \cdot t\right)\\ \mathbf{elif}\;t\_1 \leq 10^{-321}:\\ \;\;\;\;x + x\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+60}:\\ \;\;\;\;\left(27 \cdot b\right) \cdot a\\ \mathbf{else}:\\ \;\;\;\;\left(y \cdot z\right) \cdot \left(t \cdot -9\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* (* (* y 9.0) z) t)))
   (if (<= t_1 -5e+56)
     (* -9.0 (* (* z y) t))
     (if (<= t_1 1e-321)
       (+ x x)
       (if (<= t_1 5e+60) (* (* 27.0 b) a) (* (* y z) (* t -9.0)))))))

C

assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = ((y * 9.0) * z) * t;
	double tmp;
	if (t_1 <= -5e+56) {
		tmp = -9.0 * ((z * y) * t);
	} else if (t_1 <= 1e-321) {
		tmp = x + x;
	} else if (t_1 <= 5e+60) {
		tmp = (27.0 * b) * a;
	} else {
		tmp = (y * z) * (t * -9.0);
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b 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, b)
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), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = ((y * 9.0d0) * z) * t
    if (t_1 <= (-5d+56)) then
        tmp = (-9.0d0) * ((z * y) * t)
    else if (t_1 <= 1d-321) then
        tmp = x + x
    else if (t_1 <= 5d+60) then
        tmp = (27.0d0 * b) * a
    else
        tmp = (y * z) * (t * (-9.0d0))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = ((y * 9.0) * z) * t;
	double tmp;
	if (t_1 <= -5e+56) {
		tmp = -9.0 * ((z * y) * t);
	} else if (t_1 <= 1e-321) {
		tmp = x + x;
	} else if (t_1 <= 5e+60) {
		tmp = (27.0 * b) * a;
	} else {
		tmp = (y * z) * (t * -9.0);
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	t_1 = ((y * 9.0) * z) * t
	tmp = 0
	if t_1 <= -5e+56:
		tmp = -9.0 * ((z * y) * t)
	elif t_1 <= 1e-321:
		tmp = x + x
	elif t_1 <= 5e+60:
		tmp = (27.0 * b) * a
	else:
		tmp = (y * z) * (t * -9.0)
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(Float64(y * 9.0) * z) * t)
	tmp = 0.0
	if (t_1 <= -5e+56)
		tmp = Float64(-9.0 * Float64(Float64(z * y) * t));
	elseif (t_1 <= 1e-321)
		tmp = Float64(x + x);
	elseif (t_1 <= 5e+60)
		tmp = Float64(Float64(27.0 * b) * a);
	else
		tmp = Float64(Float64(y * z) * Float64(t * -9.0));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	t_1 = ((y * 9.0) * z) * t;
	tmp = 0.0;
	if (t_1 <= -5e+56)
		tmp = -9.0 * ((z * y) * t);
	elseif (t_1 <= 1e-321)
		tmp = x + x;
	elseif (t_1 <= 5e+60)
		tmp = (27.0 * b) * a;
	else
		tmp = (y * z) * (t * -9.0);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(N[(y * 9.0), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+56], N[(-9.0 * N[(N[(z * y), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1e-321], N[(x + x), $MachinePrecision], If[LessEqual[t$95$1, 5e+60], N[(N[(27.0 * b), $MachinePrecision] * a), $MachinePrecision], N[(N[(y * z), $MachinePrecision] * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < -5.00000000000000024e56

   1. Initial program 90.4%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

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

      1. lower-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

         \[\leadsto -9 \cdot \left(\left(z \cdot y\right) \cdot t\right) \]

      5. lower-*.f64 69.2

         \[\leadsto -9 \cdot \left(\left(z \cdot y\right) \cdot t\right) \]

   5. Applied rewrites 69.2%

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

   if -5.00000000000000024e56 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < 9.98013e-322

   1. Initial program 99.2%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. lower-*.f64 45.0

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

   5. Applied rewrites 45.0%

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

      1. lift-*.f64 N/A

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

      2. count-2-rev N/A

         \[\leadsto x + \color{blue}{x} \]

      3. lower-+.f64 45.0

         \[\leadsto x + \color{blue}{x} \]

   7. Applied rewrites 45.0%

      \[\leadsto x + \color{blue}{x} \]

   if 9.98013e-322 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < 4.99999999999999975e60

   1. Initial program 99.7%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in a around inf

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

   5. Applied rewrites 86.4%

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

   6. Taylor expanded in a around inf

      \[\leadsto \left(27 \cdot b\right) \cdot a \]
   7. Step-by-step derivation

      1. lower-*.f64 45.7

         \[\leadsto \left(27 \cdot b\right) \cdot a \]

   8. Applied rewrites 45.7%

      \[\leadsto \left(27 \cdot b\right) \cdot a \]

   if 4.99999999999999975e60 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t)

   1. Initial program 91.8%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. lower-*.f64 12.8

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

   5. Applied rewrites 12.8%

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

   6. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

      4. lower-*.f64 N/A

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

      5. lower-*.f64 71.1

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

   8. Applied rewrites 71.1%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

      3. lift-*.f64 N/A

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

      4. associate-*l* N/A

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

      5. lower-*.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lower-*.f64 71.0

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

   10. Applied rewrites 71.0%

       \[\leadsto \left(y \cdot z\right) \cdot \color{blue}{\left(t \cdot -9\right)} \]
3. Recombined 4 regimes into one program.
4. Add Preprocessing

Alternative 5: 56.1% accurate, 0.5× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} t_1 := -9 \cdot \left(\left(z \cdot y\right) \cdot t\right)\\ t_2 := \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\\ \mathbf{if}\;t\_2 \leq -5 \cdot 10^{+56}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 \leq 10^{-321}:\\ \;\;\;\;x + x\\ \mathbf{elif}\;t\_2 \leq 5 \cdot 10^{+60}:\\ \;\;\;\;\left(27 \cdot b\right) \cdot a\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* -9.0 (* (* z y) t))) (t_2 (* (* (* y 9.0) z) t)))
   (if (<= t_2 -5e+56)
     t_1
     (if (<= t_2 1e-321) (+ x x) (if (<= t_2 5e+60) (* (* 27.0 b) a) t_1)))))

C

assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = -9.0 * ((z * y) * t);
	double t_2 = ((y * 9.0) * z) * t;
	double tmp;
	if (t_2 <= -5e+56) {
		tmp = t_1;
	} else if (t_2 <= 1e-321) {
		tmp = x + x;
	} else if (t_2 <= 5e+60) {
		tmp = (27.0 * b) * a;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b 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, b)
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), intent (in) :: b
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = (-9.0d0) * ((z * y) * t)
    t_2 = ((y * 9.0d0) * z) * t
    if (t_2 <= (-5d+56)) then
        tmp = t_1
    else if (t_2 <= 1d-321) then
        tmp = x + x
    else if (t_2 <= 5d+60) then
        tmp = (27.0d0 * b) * a
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = -9.0 * ((z * y) * t);
	double t_2 = ((y * 9.0) * z) * t;
	double tmp;
	if (t_2 <= -5e+56) {
		tmp = t_1;
	} else if (t_2 <= 1e-321) {
		tmp = x + x;
	} else if (t_2 <= 5e+60) {
		tmp = (27.0 * b) * a;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	t_1 = -9.0 * ((z * y) * t)
	t_2 = ((y * 9.0) * z) * t
	tmp = 0
	if t_2 <= -5e+56:
		tmp = t_1
	elif t_2 <= 1e-321:
		tmp = x + x
	elif t_2 <= 5e+60:
		tmp = (27.0 * b) * a
	else:
		tmp = t_1
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	t_1 = Float64(-9.0 * Float64(Float64(z * y) * t))
	t_2 = Float64(Float64(Float64(y * 9.0) * z) * t)
	tmp = 0.0
	if (t_2 <= -5e+56)
		tmp = t_1;
	elseif (t_2 <= 1e-321)
		tmp = Float64(x + x);
	elseif (t_2 <= 5e+60)
		tmp = Float64(Float64(27.0 * b) * a);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	t_1 = -9.0 * ((z * y) * t);
	t_2 = ((y * 9.0) * z) * t;
	tmp = 0.0;
	if (t_2 <= -5e+56)
		tmp = t_1;
	elseif (t_2 <= 1e-321)
		tmp = x + x;
	elseif (t_2 <= 5e+60)
		tmp = (27.0 * b) * a;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < -5.00000000000000024e56 or 4.99999999999999975e60 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t)

   1. Initial program 91.1%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

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

      1. lower-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

         \[\leadsto -9 \cdot \left(\left(z \cdot y\right) \cdot t\right) \]

      5. lower-*.f64 70.1

         \[\leadsto -9 \cdot \left(\left(z \cdot y\right) \cdot t\right) \]

   5. Applied rewrites 70.1%

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

   if -5.00000000000000024e56 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < 9.98013e-322

   1. Initial program 99.2%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. lower-*.f64 45.0

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

   5. Applied rewrites 45.0%

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

      1. lift-*.f64 N/A

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

      2. count-2-rev N/A

         \[\leadsto x + \color{blue}{x} \]

      3. lower-+.f64 45.0

         \[\leadsto x + \color{blue}{x} \]

   7. Applied rewrites 45.0%

      \[\leadsto x + \color{blue}{x} \]

   if 9.98013e-322 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < 4.99999999999999975e60

   1. Initial program 99.7%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in a around inf

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

   5. Applied rewrites 86.4%

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

   6. Taylor expanded in a around inf

      \[\leadsto \left(27 \cdot b\right) \cdot a \]
   7. Step-by-step derivation

      1. lower-*.f64 45.7

         \[\leadsto \left(27 \cdot b\right) \cdot a \]

   8. Applied rewrites 45.7%

      \[\leadsto \left(27 \cdot b\right) \cdot a \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 6: 85.0% accurate, 0.6× speedup

Math

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

FPCore

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

C

assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = ((y * 9.0) * z) * t;
	double tmp;
	if (t_1 <= -1e-81) {
		tmp = fma(((t * z) * -9.0), y, (x + x));
	} else if (t_1 <= 5e+60) {
		tmp = (x + x) + ((a * 27.0) * b);
	} else {
		tmp = fma((-9.0 * t), (z * y), (2.0 * x));
	}
	return tmp;
}

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(Float64(y * 9.0) * z) * t)
	tmp = 0.0
	if (t_1 <= -1e-81)
		tmp = fma(Float64(Float64(t * z) * -9.0), y, Float64(x + x));
	elseif (t_1 <= 5e+60)
		tmp = Float64(Float64(x + x) + Float64(Float64(a * 27.0) * b));
	else
		tmp = fma(Float64(-9.0 * t), Float64(z * y), Float64(2.0 * x));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < -9.9999999999999996e-82

   1. Initial program 92.8%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-*.f64 N/A

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

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

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lift-*.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. *-commutative N/A

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

      10. associate-*r* N/A

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

      11. associate-+l+ N/A

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

   4. Applied rewrites 93.7%

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

   5. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 74.6

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

   7. Applied rewrites 74.6%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. count-2-rev N/A

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

      4. lift-+.f64 74.6

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

   9. Applied rewrites 74.6%

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

   if -9.9999999999999996e-82 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < 4.99999999999999975e60

   1. Initial program 99.3%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{2 \cdot x} + \left(a \cdot 27\right) \cdot b \]
   4. Step-by-step derivation

      1. lower-*.f64 93.1

         \[\leadsto 2 \cdot \color{blue}{x} + \left(a \cdot 27\right) \cdot b \]

   5. Applied rewrites 93.1%

      \[\leadsto \color{blue}{2 \cdot x} + \left(a \cdot 27\right) \cdot b \]
   6. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto 2 \cdot \color{blue}{x} + \left(a \cdot 27\right) \cdot b \]

      2. count-2-rev N/A

         \[\leadsto \left(x + \color{blue}{x}\right) + \left(a \cdot 27\right) \cdot b \]

      3. lower-+.f64 93.1

         \[\leadsto \left(x + \color{blue}{x}\right) + \left(a \cdot 27\right) \cdot b \]

   7. Applied rewrites 93.1%

      \[\leadsto \left(x + \color{blue}{x}\right) + \left(a \cdot 27\right) \cdot b \]

   if 4.99999999999999975e60 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t)

   1. Initial program 91.8%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

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

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

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. associate-*r* N/A

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

      5. lower-fma.f64 N/A

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

      6. lower-*.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

      9. lower-*.f64 81.2

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

   5. Applied rewrites 81.2%

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

Alternative 7: 84.6% accurate, 0.6× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} t_1 := \mathsf{fma}\left(\left(t \cdot z\right) \cdot -9, y, x + x\right)\\ t_2 := \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\\ \mathbf{if}\;t\_2 \leq -1 \cdot 10^{-81}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 \leq 5 \cdot 10^{+108}:\\ \;\;\;\;\left(x + x\right) + \left(a \cdot 27\right) \cdot b\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (fma (* (* t z) -9.0) y (+ x x))) (t_2 (* (* (* y 9.0) z) t)))
   (if (<= t_2 -1e-81)
     t_1
     (if (<= t_2 5e+108) (+ (+ x x) (* (* a 27.0) b)) t_1))))

C

assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = fma(((t * z) * -9.0), y, (x + x));
	double t_2 = ((y * 9.0) * z) * t;
	double tmp;
	if (t_2 <= -1e-81) {
		tmp = t_1;
	} else if (t_2 <= 5e+108) {
		tmp = (x + x) + ((a * 27.0) * b);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	t_1 = fma(Float64(Float64(t * z) * -9.0), y, Float64(x + x))
	t_2 = Float64(Float64(Float64(y * 9.0) * z) * t)
	tmp = 0.0
	if (t_2 <= -1e-81)
		tmp = t_1;
	elseif (t_2 <= 5e+108)
		tmp = Float64(Float64(x + x) + Float64(Float64(a * 27.0) * b));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(N[(t * z), $MachinePrecision] * -9.0), $MachinePrecision] * y + N[(x + x), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(y * 9.0), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision]}, If[LessEqual[t$95$2, -1e-81], t$95$1, If[LessEqual[t$95$2, 5e+108], N[(N[(x + x), $MachinePrecision] + N[(N[(a * 27.0), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < -9.9999999999999996e-82 or 4.99999999999999991e108 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t)

   1. Initial program 91.9%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-*.f64 N/A

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

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

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lift-*.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. *-commutative N/A

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

      10. associate-*r* N/A

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

      11. associate-+l+ N/A

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

   4. Applied rewrites 92.8%

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

   5. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 77.7

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

   7. Applied rewrites 77.7%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. count-2-rev N/A

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

      4. lift-+.f64 77.7

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

   9. Applied rewrites 77.7%

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

   if -9.9999999999999996e-82 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < 4.99999999999999991e108

   1. Initial program 99.3%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{2 \cdot x} + \left(a \cdot 27\right) \cdot b \]
   4. Step-by-step derivation

      1. lower-*.f64 91.1

         \[\leadsto 2 \cdot \color{blue}{x} + \left(a \cdot 27\right) \cdot b \]

   5. Applied rewrites 91.1%

      \[\leadsto \color{blue}{2 \cdot x} + \left(a \cdot 27\right) \cdot b \]
   6. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto 2 \cdot \color{blue}{x} + \left(a \cdot 27\right) \cdot b \]

      2. count-2-rev N/A

         \[\leadsto \left(x + \color{blue}{x}\right) + \left(a \cdot 27\right) \cdot b \]

      3. lower-+.f64 91.1

         \[\leadsto \left(x + \color{blue}{x}\right) + \left(a \cdot 27\right) \cdot b \]

   7. Applied rewrites 91.1%

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

Alternative 8: 84.0% accurate, 0.6× speedup

Math

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

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* (* a 27.0) b)))
   (if (<= t_1 -2e+79)
     (fma -9.0 (* (* z y) t) (* (* b a) 27.0))
     (if (<= t_1 1e+30)
       (fma (* (* t z) -9.0) y (+ x x))
       (fma (* a b) 27.0 (* (* (* y z) t) -9.0))))))

C

assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (a * 27.0) * b;
	double tmp;
	if (t_1 <= -2e+79) {
		tmp = fma(-9.0, ((z * y) * t), ((b * a) * 27.0));
	} else if (t_1 <= 1e+30) {
		tmp = fma(((t * z) * -9.0), y, (x + x));
	} else {
		tmp = fma((a * b), 27.0, (((y * z) * t) * -9.0));
	}
	return tmp;
}

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(a * 27.0) * b)
	tmp = 0.0
	if (t_1 <= -2e+79)
		tmp = fma(-9.0, Float64(Float64(z * y) * t), Float64(Float64(b * a) * 27.0));
	elseif (t_1 <= 1e+30)
		tmp = fma(Float64(Float64(t * z) * -9.0), y, Float64(x + x));
	else
		tmp = fma(Float64(a * b), 27.0, Float64(Float64(Float64(y * z) * t) * -9.0));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 a #s(literal 27 binary64)) b) < -1.99999999999999993e79

   1. Initial program 93.9%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

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

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(-9, \left(z \cdot y\right) \cdot t, 27 \cdot \left(a \cdot b\right)\right) \]

      8. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(-9, \left(z \cdot y\right) \cdot t, 27 \cdot \left(a \cdot b\right)\right) \]

      9. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(-9, \left(z \cdot y\right) \cdot t, \left(a \cdot b\right) \cdot 27\right) \]

      10. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(-9, \left(z \cdot y\right) \cdot t, \left(a \cdot b\right) \cdot 27\right) \]

      11. *-commutative N/A

          \[\leadsto \mathsf{fma}\left(-9, \left(z \cdot y\right) \cdot t, \left(b \cdot a\right) \cdot 27\right) \]

      12. lower-*.f64 83.2

          \[\leadsto \mathsf{fma}\left(-9, \left(z \cdot y\right) \cdot t, \left(b \cdot a\right) \cdot 27\right) \]

   5. Applied rewrites 83.2%

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

   if -1.99999999999999993e79 < (*.f64 (*.f64 a #s(literal 27 binary64)) b) < 1e30

   1. Initial program 96.4%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-*.f64 N/A

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

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

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lift-*.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. *-commutative N/A

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

      10. associate-*r* N/A

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

      11. associate-+l+ N/A

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

   4. Applied rewrites 96.3%

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

   5. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 84.8

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

   7. Applied rewrites 84.8%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. count-2-rev N/A

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

      4. lift-+.f64 84.8

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

   9. Applied rewrites 84.8%

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

   if 1e30 < (*.f64 (*.f64 a #s(literal 27 binary64)) b)

   1. Initial program 95.6%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. lower-*.f64 15.1

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

   5. Applied rewrites 15.1%

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

   6. Taylor expanded in x around 0

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

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

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

      2. *-commutative N/A

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

      3. metadata-eval N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(a \cdot b, 27, -9 \cdot \left(t \cdot \left(y \cdot z\right)\right)\right) \]

      6. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(a \cdot b, 27, \left(t \cdot \left(y \cdot z\right)\right) \cdot -9\right) \]

      7. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(a \cdot b, 27, \left(t \cdot \left(y \cdot z\right)\right) \cdot -9\right) \]

      8. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(a \cdot b, 27, \left(\left(y \cdot z\right) \cdot t\right) \cdot -9\right) \]

      9. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(a \cdot b, 27, \left(\left(y \cdot z\right) \cdot t\right) \cdot -9\right) \]

      10. lower-*.f64 82.7

          \[\leadsto \mathsf{fma}\left(a \cdot b, 27, \left(\left(y \cdot z\right) \cdot t\right) \cdot -9\right) \]

   8. Applied rewrites 82.7%

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

Alternative 9: 84.0% accurate, 0.6× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} t_1 := \left(a \cdot 27\right) \cdot b\\ t_2 := \mathsf{fma}\left(-9, \left(z \cdot y\right) \cdot t, \left(b \cdot a\right) \cdot 27\right)\\ \mathbf{if}\;t\_1 \leq -2 \cdot 10^{+79}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 10^{+30}:\\ \;\;\;\;\mathsf{fma}\left(\left(t \cdot z\right) \cdot -9, y, x + x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* (* a 27.0) b)) (t_2 (fma -9.0 (* (* z y) t) (* (* b a) 27.0))))
   (if (<= t_1 -2e+79)
     t_2
     (if (<= t_1 1e+30) (fma (* (* t z) -9.0) y (+ x x)) t_2))))

C

assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (a * 27.0) * b;
	double t_2 = fma(-9.0, ((z * y) * t), ((b * a) * 27.0));
	double tmp;
	if (t_1 <= -2e+79) {
		tmp = t_2;
	} else if (t_1 <= 1e+30) {
		tmp = fma(((t * z) * -9.0), y, (x + x));
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(a * 27.0) * b)
	t_2 = fma(-9.0, Float64(Float64(z * y) * t), Float64(Float64(b * a) * 27.0))
	tmp = 0.0
	if (t_1 <= -2e+79)
		tmp = t_2;
	elseif (t_1 <= 1e+30)
		tmp = fma(Float64(Float64(t * z) * -9.0), y, Float64(x + x));
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 a #s(literal 27 binary64)) b) < -1.99999999999999993e79 or 1e30 < (*.f64 (*.f64 a #s(literal 27 binary64)) b)

   1. Initial program 94.8%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

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

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(-9, \left(z \cdot y\right) \cdot t, 27 \cdot \left(a \cdot b\right)\right) \]

      8. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(-9, \left(z \cdot y\right) \cdot t, 27 \cdot \left(a \cdot b\right)\right) \]

      9. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(-9, \left(z \cdot y\right) \cdot t, \left(a \cdot b\right) \cdot 27\right) \]

      10. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(-9, \left(z \cdot y\right) \cdot t, \left(a \cdot b\right) \cdot 27\right) \]

      11. *-commutative N/A

          \[\leadsto \mathsf{fma}\left(-9, \left(z \cdot y\right) \cdot t, \left(b \cdot a\right) \cdot 27\right) \]

      12. lower-*.f64 83.0

          \[\leadsto \mathsf{fma}\left(-9, \left(z \cdot y\right) \cdot t, \left(b \cdot a\right) \cdot 27\right) \]

   5. Applied rewrites 83.0%

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

   if -1.99999999999999993e79 < (*.f64 (*.f64 a #s(literal 27 binary64)) b) < 1e30

   1. Initial program 96.4%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-*.f64 N/A

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

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

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lift-*.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. *-commutative N/A

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

      10. associate-*r* N/A

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

      11. associate-+l+ N/A

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

   4. Applied rewrites 96.3%

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

   5. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 84.8

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

   7. Applied rewrites 84.8%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. count-2-rev N/A

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

      4. lift-+.f64 84.8

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

   9. Applied rewrites 84.8%

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

Alternative 10: 82.4% accurate, 0.6× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} t_1 := \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\\ \mathbf{if}\;t\_1 \leq -5 \cdot 10^{+56}:\\ \;\;\;\;\left(y \cdot \left(t \cdot z\right)\right) \cdot -9\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+108}:\\ \;\;\;\;\left(x + x\right) + \left(a \cdot 27\right) \cdot b\\ \mathbf{else}:\\ \;\;\;\;\left(\left(y \cdot z\right) \cdot -9\right) \cdot t\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* (* (* y 9.0) z) t)))
   (if (<= t_1 -5e+56)
     (* (* y (* t z)) -9.0)
     (if (<= t_1 5e+108)
       (+ (+ x x) (* (* a 27.0) b))
       (* (* (* y z) -9.0) t)))))

C

assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = ((y * 9.0) * z) * t;
	double tmp;
	if (t_1 <= -5e+56) {
		tmp = (y * (t * z)) * -9.0;
	} else if (t_1 <= 5e+108) {
		tmp = (x + x) + ((a * 27.0) * b);
	} else {
		tmp = ((y * z) * -9.0) * t;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b 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, b)
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), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = ((y * 9.0d0) * z) * t
    if (t_1 <= (-5d+56)) then
        tmp = (y * (t * z)) * (-9.0d0)
    else if (t_1 <= 5d+108) then
        tmp = (x + x) + ((a * 27.0d0) * b)
    else
        tmp = ((y * z) * (-9.0d0)) * t
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = ((y * 9.0) * z) * t;
	double tmp;
	if (t_1 <= -5e+56) {
		tmp = (y * (t * z)) * -9.0;
	} else if (t_1 <= 5e+108) {
		tmp = (x + x) + ((a * 27.0) * b);
	} else {
		tmp = ((y * z) * -9.0) * t;
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	t_1 = ((y * 9.0) * z) * t
	tmp = 0
	if t_1 <= -5e+56:
		tmp = (y * (t * z)) * -9.0
	elif t_1 <= 5e+108:
		tmp = (x + x) + ((a * 27.0) * b)
	else:
		tmp = ((y * z) * -9.0) * t
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(Float64(y * 9.0) * z) * t)
	tmp = 0.0
	if (t_1 <= -5e+56)
		tmp = Float64(Float64(y * Float64(t * z)) * -9.0);
	elseif (t_1 <= 5e+108)
		tmp = Float64(Float64(x + x) + Float64(Float64(a * 27.0) * b));
	else
		tmp = Float64(Float64(Float64(y * z) * -9.0) * t);
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	t_1 = ((y * 9.0) * z) * t;
	tmp = 0.0;
	if (t_1 <= -5e+56)
		tmp = (y * (t * z)) * -9.0;
	elseif (t_1 <= 5e+108)
		tmp = (x + x) + ((a * 27.0) * b);
	else
		tmp = ((y * z) * -9.0) * t;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < -5.00000000000000024e56

   1. Initial program 90.4%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. lower-*.f64 13.5

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

   5. Applied rewrites 13.5%

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

   6. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

      4. lower-*.f64 N/A

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

      5. lower-*.f64 69.2

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

   8. Applied rewrites 69.2%

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

      1. lift-*.f64 N/A

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

      2. lift-*.f64 N/A

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

      3. associate-*l* N/A

         \[\leadsto \left(y \cdot \left(z \cdot t\right)\right) \cdot -9 \]

      4. *-commutative N/A

         \[\leadsto \left(y \cdot \left(t \cdot z\right)\right) \cdot -9 \]

      5. lower-*.f64 N/A

         \[\leadsto \left(y \cdot \left(t \cdot z\right)\right) \cdot -9 \]

      6. lift-*.f64 69.8

         \[\leadsto \left(y \cdot \left(t \cdot z\right)\right) \cdot -9 \]

   10. Applied rewrites 69.8%

       \[\leadsto \left(y \cdot \left(t \cdot z\right)\right) \cdot -9 \]

   if -5.00000000000000024e56 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < 4.99999999999999991e108

   1. Initial program 99.4%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{2 \cdot x} + \left(a \cdot 27\right) \cdot b \]
   4. Step-by-step derivation

      1. lower-*.f64 89.3

         \[\leadsto 2 \cdot \color{blue}{x} + \left(a \cdot 27\right) \cdot b \]

   5. Applied rewrites 89.3%

      \[\leadsto \color{blue}{2 \cdot x} + \left(a \cdot 27\right) \cdot b \]
   6. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto 2 \cdot \color{blue}{x} + \left(a \cdot 27\right) \cdot b \]

      2. count-2-rev N/A

         \[\leadsto \left(x + \color{blue}{x}\right) + \left(a \cdot 27\right) \cdot b \]

      3. lower-+.f64 89.3

         \[\leadsto \left(x + \color{blue}{x}\right) + \left(a \cdot 27\right) \cdot b \]

   7. Applied rewrites 89.3%

      \[\leadsto \left(x + \color{blue}{x}\right) + \left(a \cdot 27\right) \cdot b \]

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

   1. Initial program 90.5%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. lower-*.f64 10.8

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

   5. Applied rewrites 10.8%

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

   6. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

      4. lower-*.f64 N/A

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

      5. lower-*.f64 75.6

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

   8. Applied rewrites 75.6%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

      3. lift-*.f64 N/A

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

      4. *-commutative N/A

         \[\leadsto \left(t \cdot \left(y \cdot z\right)\right) \cdot -9 \]

      5. *-commutative N/A

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

      6. *-commutative N/A

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

      7. *-commutative N/A

         \[\leadsto -9 \cdot \left(\left(z \cdot y\right) \cdot t\right) \]

      8. associate-*l* N/A

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

      9. *-commutative N/A

         \[\leadsto \left(-9 \cdot \left(y \cdot z\right)\right) \cdot t \]

      10. lower-*.f64 N/A

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

      11. *-commutative N/A

          \[\leadsto \left(\left(y \cdot z\right) \cdot -9\right) \cdot t \]

      12. lower-*.f64 N/A

          \[\leadsto \left(\left(y \cdot z\right) \cdot -9\right) \cdot t \]

      13. lift-*.f64 75.5

          \[\leadsto \left(\left(y \cdot z\right) \cdot -9\right) \cdot t \]

   10. Applied rewrites 75.5%

       \[\leadsto \left(\left(y \cdot z\right) \cdot -9\right) \cdot \color{blue}{t} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 11: 82.4% accurate, 0.6× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} t_1 := \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\\ \mathbf{if}\;t\_1 \leq -5 \cdot 10^{+56}:\\ \;\;\;\;\left(y \cdot \left(t \cdot z\right)\right) \cdot -9\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+108}:\\ \;\;\;\;\mathsf{fma}\left(b \cdot a, 27, 2 \cdot x\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\left(y \cdot z\right) \cdot -9\right) \cdot t\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* (* (* y 9.0) z) t)))
   (if (<= t_1 -5e+56)
     (* (* y (* t z)) -9.0)
     (if (<= t_1 5e+108)
       (fma (* b a) 27.0 (* 2.0 x))
       (* (* (* y z) -9.0) t)))))

C

assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = ((y * 9.0) * z) * t;
	double tmp;
	if (t_1 <= -5e+56) {
		tmp = (y * (t * z)) * -9.0;
	} else if (t_1 <= 5e+108) {
		tmp = fma((b * a), 27.0, (2.0 * x));
	} else {
		tmp = ((y * z) * -9.0) * t;
	}
	return tmp;
}

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(Float64(y * 9.0) * z) * t)
	tmp = 0.0
	if (t_1 <= -5e+56)
		tmp = Float64(Float64(y * Float64(t * z)) * -9.0);
	elseif (t_1 <= 5e+108)
		tmp = fma(Float64(b * a), 27.0, Float64(2.0 * x));
	else
		tmp = Float64(Float64(Float64(y * z) * -9.0) * t);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < -5.00000000000000024e56

   1. Initial program 90.4%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. lower-*.f64 13.5

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

   5. Applied rewrites 13.5%

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

   6. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

      4. lower-*.f64 N/A

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

      5. lower-*.f64 69.2

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

   8. Applied rewrites 69.2%

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

      1. lift-*.f64 N/A

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

      2. lift-*.f64 N/A

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

      3. associate-*l* N/A

         \[\leadsto \left(y \cdot \left(z \cdot t\right)\right) \cdot -9 \]

      4. *-commutative N/A

         \[\leadsto \left(y \cdot \left(t \cdot z\right)\right) \cdot -9 \]

      5. lower-*.f64 N/A

         \[\leadsto \left(y \cdot \left(t \cdot z\right)\right) \cdot -9 \]

      6. lift-*.f64 69.8

         \[\leadsto \left(y \cdot \left(t \cdot z\right)\right) \cdot -9 \]

   10. Applied rewrites 69.8%

       \[\leadsto \left(y \cdot \left(t \cdot z\right)\right) \cdot -9 \]

   if -5.00000000000000024e56 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < 4.99999999999999991e108

   1. Initial program 99.4%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{2 \cdot x + 27 \cdot \left(a \cdot b\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto 27 \cdot \left(a \cdot b\right) + \color{blue}{2 \cdot x} \]

      2. *-commutative N/A

         \[\leadsto \left(a \cdot b\right) \cdot 27 + \color{blue}{2} \cdot x \]

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(a \cdot b, \color{blue}{27}, 2 \cdot x\right) \]

      4. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(b \cdot a, 27, 2 \cdot x\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(b \cdot a, 27, 2 \cdot x\right) \]

      6. lower-*.f64 89.4

         \[\leadsto \mathsf{fma}\left(b \cdot a, 27, 2 \cdot x\right) \]

   5. Applied rewrites 89.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(b \cdot a, 27, 2 \cdot x\right)} \]

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

   1. Initial program 90.5%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. lower-*.f64 10.8

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

   5. Applied rewrites 10.8%

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

   6. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

      4. lower-*.f64 N/A

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

      5. lower-*.f64 75.6

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

   8. Applied rewrites 75.6%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

      3. lift-*.f64 N/A

         \[\leadsto \left(\left(y \cdot z\right) \cdot t\right) \cdot -9 \]

      4. *-commutative N/A

         \[\leadsto \left(t \cdot \left(y \cdot z\right)\right) \cdot -9 \]

      5. *-commutative N/A

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

      6. *-commutative N/A

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

      7. *-commutative N/A

         \[\leadsto -9 \cdot \left(\left(z \cdot y\right) \cdot t\right) \]

      8. associate-*l* N/A

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

      9. *-commutative N/A

         \[\leadsto \left(-9 \cdot \left(y \cdot z\right)\right) \cdot t \]

      10. lower-*.f64 N/A

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

      11. *-commutative N/A

          \[\leadsto \left(\left(y \cdot z\right) \cdot -9\right) \cdot t \]

      12. lower-*.f64 N/A

          \[\leadsto \left(\left(y \cdot z\right) \cdot -9\right) \cdot t \]

      13. lift-*.f64 75.5

          \[\leadsto \left(\left(y \cdot z\right) \cdot -9\right) \cdot t \]

   10. Applied rewrites 75.5%

       \[\leadsto \left(\left(y \cdot z\right) \cdot -9\right) \cdot \color{blue}{t} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 12: 98.1% accurate, 0.8× speedup

Math

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

FPCore

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

C

assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (((y * 9.0) * z) <= 5e+273) {
		tmp = fma((-9.0 * (z * y)), t, fma((b * a), 27.0, (2.0 * x)));
	} else {
		tmp = fma(((t * z) * -9.0), y, (x + x));
	}
	return tmp;
}

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	tmp = 0.0
	if (Float64(Float64(y * 9.0) * z) <= 5e+273)
		tmp = fma(Float64(-9.0 * Float64(z * y)), t, fma(Float64(b * a), 27.0, Float64(2.0 * x)));
	else
		tmp = fma(Float64(Float64(t * z) * -9.0), y, Float64(x + x));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 y #s(literal 9 binary64)) z) < 4.99999999999999961e273

   1. Initial program 98.7%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-*.f64 N/A

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

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

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lift-*.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. *-commutative N/A

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

      10. associate-*r* N/A

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

      11. associate-+l+ N/A

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

   4. Applied rewrites 99.1%

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

   if 4.99999999999999961e273 < (*.f64 (*.f64 y #s(literal 9 binary64)) z)

   1. Initial program 69.6%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-*.f64 N/A

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

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

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lift-*.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. *-commutative N/A

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

      10. associate-*r* N/A

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

      11. associate-+l+ N/A

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

   4. Applied rewrites 96.5%

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

   5. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 89.2

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

   7. Applied rewrites 89.2%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. count-2-rev N/A

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

      4. lift-+.f64 89.2

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

   9. Applied rewrites 89.2%

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

Alternative 13: 52.6% accurate, 0.9× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} t_1 := \left(a \cdot 27\right) \cdot b\\ \mathbf{if}\;t\_1 \leq -2 \cdot 10^{+79}:\\ \;\;\;\;\left(b \cdot a\right) \cdot 27\\ \mathbf{elif}\;t\_1 \leq 10^{+38}:\\ \;\;\;\;x + x\\ \mathbf{else}:\\ \;\;\;\;\left(27 \cdot b\right) \cdot a\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* (* a 27.0) b)))
   (if (<= t_1 -2e+79)
     (* (* b a) 27.0)
     (if (<= t_1 1e+38) (+ x x) (* (* 27.0 b) a)))))

C

assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (a * 27.0) * b;
	double tmp;
	if (t_1 <= -2e+79) {
		tmp = (b * a) * 27.0;
	} else if (t_1 <= 1e+38) {
		tmp = x + x;
	} else {
		tmp = (27.0 * b) * a;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b 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, b)
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), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (a * 27.0d0) * b
    if (t_1 <= (-2d+79)) then
        tmp = (b * a) * 27.0d0
    else if (t_1 <= 1d+38) then
        tmp = x + x
    else
        tmp = (27.0d0 * b) * a
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (a * 27.0) * b;
	double tmp;
	if (t_1 <= -2e+79) {
		tmp = (b * a) * 27.0;
	} else if (t_1 <= 1e+38) {
		tmp = x + x;
	} else {
		tmp = (27.0 * b) * a;
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	t_1 = (a * 27.0) * b
	tmp = 0
	if t_1 <= -2e+79:
		tmp = (b * a) * 27.0
	elif t_1 <= 1e+38:
		tmp = x + x
	else:
		tmp = (27.0 * b) * a
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(a * 27.0) * b)
	tmp = 0.0
	if (t_1 <= -2e+79)
		tmp = Float64(Float64(b * a) * 27.0);
	elseif (t_1 <= 1e+38)
		tmp = Float64(x + x);
	else
		tmp = Float64(Float64(27.0 * b) * a);
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	t_1 = (a * 27.0) * b;
	tmp = 0.0;
	if (t_1 <= -2e+79)
		tmp = (b * a) * 27.0;
	elseif (t_1 <= 1e+38)
		tmp = x + x;
	else
		tmp = (27.0 * b) * a;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(a * 27.0), $MachinePrecision] * b), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+79], N[(N[(b * a), $MachinePrecision] * 27.0), $MachinePrecision], If[LessEqual[t$95$1, 1e+38], N[(x + x), $MachinePrecision], N[(N[(27.0 * b), $MachinePrecision] * a), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 a #s(literal 27 binary64)) b) < -1.99999999999999993e79

   1. Initial program 93.9%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in a around inf

      \[\leadsto \color{blue}{27 \cdot \left(a \cdot b\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(a \cdot b\right) \cdot \color{blue}{27} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(a \cdot b\right) \cdot \color{blue}{27} \]

      3. *-commutative N/A

         \[\leadsto \left(b \cdot a\right) \cdot 27 \]

      4. lower-*.f64 69.3

         \[\leadsto \left(b \cdot a\right) \cdot 27 \]

   5. Applied rewrites 69.3%

      \[\leadsto \color{blue}{\left(b \cdot a\right) \cdot 27} \]

   if -1.99999999999999993e79 < (*.f64 (*.f64 a #s(literal 27 binary64)) b) < 9.99999999999999977e37

   1. Initial program 96.4%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. lower-*.f64 42.6

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

   5. Applied rewrites 42.6%

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

      1. lift-*.f64 N/A

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

      2. count-2-rev N/A

         \[\leadsto x + \color{blue}{x} \]

      3. lower-+.f64 42.6

         \[\leadsto x + \color{blue}{x} \]

   7. Applied rewrites 42.6%

      \[\leadsto x + \color{blue}{x} \]

   if 9.99999999999999977e37 < (*.f64 (*.f64 a #s(literal 27 binary64)) b)

   1. Initial program 95.4%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in a around inf

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

   5. Applied rewrites 92.9%

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

   6. Taylor expanded in a around inf

      \[\leadsto \left(27 \cdot b\right) \cdot a \]
   7. Step-by-step derivation

      1. lower-*.f64 64.1

         \[\leadsto \left(27 \cdot b\right) \cdot a \]

   8. Applied rewrites 64.1%

      \[\leadsto \left(27 \cdot b\right) \cdot a \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 14: 52.6% accurate, 0.9× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} t_1 := \left(a \cdot 27\right) \cdot b\\ t_2 := \left(27 \cdot b\right) \cdot a\\ \mathbf{if}\;t\_1 \leq -2 \cdot 10^{+79}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 10^{+38}:\\ \;\;\;\;x + x\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* (* a 27.0) b)) (t_2 (* (* 27.0 b) a)))
   (if (<= t_1 -2e+79) t_2 (if (<= t_1 1e+38) (+ x x) t_2))))

C

assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (a * 27.0) * b;
	double t_2 = (27.0 * b) * a;
	double tmp;
	if (t_1 <= -2e+79) {
		tmp = t_2;
	} else if (t_1 <= 1e+38) {
		tmp = x + x;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b 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, b)
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), intent (in) :: b
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = (a * 27.0d0) * b
    t_2 = (27.0d0 * b) * a
    if (t_1 <= (-2d+79)) then
        tmp = t_2
    else if (t_1 <= 1d+38) then
        tmp = x + x
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (a * 27.0) * b;
	double t_2 = (27.0 * b) * a;
	double tmp;
	if (t_1 <= -2e+79) {
		tmp = t_2;
	} else if (t_1 <= 1e+38) {
		tmp = x + x;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	t_1 = (a * 27.0) * b
	t_2 = (27.0 * b) * a
	tmp = 0
	if t_1 <= -2e+79:
		tmp = t_2
	elif t_1 <= 1e+38:
		tmp = x + x
	else:
		tmp = t_2
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(a * 27.0) * b)
	t_2 = Float64(Float64(27.0 * b) * a)
	tmp = 0.0
	if (t_1 <= -2e+79)
		tmp = t_2;
	elseif (t_1 <= 1e+38)
		tmp = Float64(x + x);
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	t_1 = (a * 27.0) * b;
	t_2 = (27.0 * b) * a;
	tmp = 0.0;
	if (t_1 <= -2e+79)
		tmp = t_2;
	elseif (t_1 <= 1e+38)
		tmp = x + x;
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(a * 27.0), $MachinePrecision] * b), $MachinePrecision]}, Block[{t$95$2 = N[(N[(27.0 * b), $MachinePrecision] * a), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+79], t$95$2, If[LessEqual[t$95$1, 1e+38], N[(x + x), $MachinePrecision], t$95$2]]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 a #s(literal 27 binary64)) b) < -1.99999999999999993e79 or 9.99999999999999977e37 < (*.f64 (*.f64 a #s(literal 27 binary64)) b)

   1. Initial program 94.7%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in a around inf

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

   5. Applied rewrites 93.4%

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

   6. Taylor expanded in a around inf

      \[\leadsto \left(27 \cdot b\right) \cdot a \]
   7. Step-by-step derivation

      1. lower-*.f64 66.5

         \[\leadsto \left(27 \cdot b\right) \cdot a \]

   8. Applied rewrites 66.5%

      \[\leadsto \left(27 \cdot b\right) \cdot a \]

   if -1.99999999999999993e79 < (*.f64 (*.f64 a #s(literal 27 binary64)) b) < 9.99999999999999977e37

   1. Initial program 96.4%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. lower-*.f64 42.6

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

   5. Applied rewrites 42.6%

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

      1. lift-*.f64 N/A

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

      2. count-2-rev N/A

         \[\leadsto x + \color{blue}{x} \]

      3. lower-+.f64 42.6

         \[\leadsto x + \color{blue}{x} \]

   7. Applied rewrites 42.6%

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

Alternative 15: 98.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq -9.5 \cdot 10^{-65}:\\ \;\;\;\;\mathsf{fma}\left(z \cdot t, -9 \cdot y, \mathsf{fma}\left(a \cdot b, 27, x \cdot 2\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-9 \cdot \left(z \cdot y\right), t, \mathsf{fma}\left(b \cdot a, 27, 2 \cdot x\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (if (<= z -9.5e-65)
   (fma (* z t) (* -9.0 y) (fma (* a b) 27.0 (* x 2.0)))
   (fma (* -9.0 (* z y)) t (fma (* b a) 27.0 (* 2.0 x)))))

C

assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= -9.5e-65) {
		tmp = fma((z * t), (-9.0 * y), fma((a * b), 27.0, (x * 2.0)));
	} else {
		tmp = fma((-9.0 * (z * y)), t, fma((b * a), 27.0, (2.0 * x)));
	}
	return tmp;
}

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	tmp = 0.0
	if (z <= -9.5e-65)
		tmp = fma(Float64(z * t), Float64(-9.0 * y), fma(Float64(a * b), 27.0, Float64(x * 2.0)));
	else
		tmp = fma(Float64(-9.0 * Float64(z * y)), t, fma(Float64(b * a), 27.0, Float64(2.0 * x)));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -9.5000000000000004e-65

   1. Initial program 85.3%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-*.f64 N/A

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

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

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lift-*.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. *-commutative N/A

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

      10. associate-*r* N/A

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

      11. associate-+l+ N/A

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

   4. Applied rewrites 98.1%

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

      1. lift-fma.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. lift-fma.f64 N/A

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

      7. associate-*l* N/A

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

      8. +-commutative N/A

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

      9. *-commutative N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 N/A

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

      14. lower-*.f64 N/A

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

      15. +-commutative N/A

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

      16. *-commutative N/A

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

      17. lower-fma.f64 N/A

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

      18. lower-*.f64 N/A

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

      19. *-commutative N/A

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

      20. lower-*.f64 98.0

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

   6. Applied rewrites 98.0%

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

   if -9.5000000000000004e-65 < z

   1. Initial program 98.6%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-*.f64 N/A

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

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

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lift-*.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. *-commutative N/A

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

      10. associate-*r* N/A

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

      11. associate-+l+ N/A

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

   4. Applied rewrites 99.0%

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

Alternative 16: 30.6% accurate, 9.3× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ x + x \end{array} \]

FPCore

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

C

assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	return x + x;
}

Fortran

NOTE: x, y, z, t, a, and b 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, b)
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), intent (in) :: b
    code = x + x
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	return x + x;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	return x + x

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	return Float64(x + x)
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp = code(x, y, z, t, a, b)
	tmp = x + x;
end

Wolfram

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

Derivation

1. Initial program 95.7%

   \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
2. Add Preprocessing

3. Taylor expanded in x around inf

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

   1. lower-*.f64 30.6

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

5. Applied rewrites 30.6%

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

   1. lift-*.f64 N/A

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

   2. count-2-rev N/A

      \[\leadsto x + \color{blue}{x} \]

   3. lower-+.f64 30.6

      \[\leadsto x + \color{blue}{x} \]

7. Applied rewrites 30.6%

   \[\leadsto x + \color{blue}{x} \]
8. Add Preprocessing

Developer Target 1: 95.4% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y < 7.590524218811189 \cdot 10^{-161}:\\ \;\;\;\;\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + a \cdot \left(27 \cdot b\right)\\ \mathbf{else}:\\ \;\;\;\;\left(x \cdot 2 - 9 \cdot \left(y \cdot \left(t \cdot z\right)\right)\right) + \left(a \cdot 27\right) \cdot b\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (< y 7.590524218811189e-161)
   (+ (- (* x 2.0) (* (* (* y 9.0) z) t)) (* a (* 27.0 b)))
   (+ (- (* x 2.0) (* 9.0 (* y (* t z)))) (* (* a 27.0) b))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (y < 7.590524218811189e-161) {
		tmp = ((x * 2.0) - (((y * 9.0) * z) * t)) + (a * (27.0 * b));
	} else {
		tmp = ((x * 2.0) - (9.0 * (y * (t * z)))) + ((a * 27.0) * b);
	}
	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, b)
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), intent (in) :: b
    real(8) :: tmp
    if (y < 7.590524218811189d-161) then
        tmp = ((x * 2.0d0) - (((y * 9.0d0) * z) * t)) + (a * (27.0d0 * b))
    else
        tmp = ((x * 2.0d0) - (9.0d0 * (y * (t * z)))) + ((a * 27.0d0) * b)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (y < 7.590524218811189e-161) {
		tmp = ((x * 2.0) - (((y * 9.0) * z) * t)) + (a * (27.0 * b));
	} else {
		tmp = ((x * 2.0) - (9.0 * (y * (t * z)))) + ((a * 27.0) * b);
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if y < 7.590524218811189e-161:
		tmp = ((x * 2.0) - (((y * 9.0) * z) * t)) + (a * (27.0 * b))
	else:
		tmp = ((x * 2.0) - (9.0 * (y * (t * z)))) + ((a * 27.0) * b)
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (y < 7.590524218811189e-161)
		tmp = Float64(Float64(Float64(x * 2.0) - Float64(Float64(Float64(y * 9.0) * z) * t)) + Float64(a * Float64(27.0 * b)));
	else
		tmp = Float64(Float64(Float64(x * 2.0) - Float64(9.0 * Float64(y * Float64(t * z)))) + Float64(Float64(a * 27.0) * b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (y < 7.590524218811189e-161)
		tmp = ((x * 2.0) - (((y * 9.0) * z) * t)) + (a * (27.0 * b));
	else
		tmp = ((x * 2.0) - (9.0 * (y * (t * z)))) + ((a * 27.0) * b);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Less[y, 7.590524218811189e-161], N[(N[(N[(x * 2.0), $MachinePrecision] - N[(N[(N[(y * 9.0), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] + N[(a * N[(27.0 * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x * 2.0), $MachinePrecision] - N[(9.0 * N[(y * N[(t * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(a * 27.0), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision]]

Reproduce

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

  :alt
  (! :herbie-platform default (if (< y 7590524218811189/100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (+ (- (* x 2) (* (* (* y 9) z) t)) (* a (* 27 b))) (+ (- (* x 2) (* 9 (* y (* t z)))) (* (* a 27) b))))

  (+ (- (* x 2.0) (* (* (* y 9.0) z) t)) (* (* a 27.0) b)))