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

Percentage Accurate: 95.5% → 98.9%

Time: 4.3s

Alternatives: 12

Speedup: 0.9×

• 27.2% 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.5% 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.9% accurate, 0.9× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq -1 \cdot 10^{-276}:\\ \;\;\;\;\mathsf{fma}\left(b \cdot 27, a, \mathsf{fma}\left(-9 \cdot y, t \cdot z, x + x\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\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} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
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 -1e-276)
   (fma (* b 27.0) a (fma (* -9.0 y) (* t z) (+ x x)))
   (+ (- (* x 2.0) (* (* (* y 9.0) z) t)) (* (* a 27.0) b))))

C

assert(x < y && y < z && z < t && t < a && a < b);
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 <= -1e-276) {
		tmp = fma((b * 27.0), a, fma((-9.0 * y), (t * z), (x + x)));
	} else {
		tmp = ((x * 2.0) - (((y * 9.0) * z) * t)) + ((a * 27.0) * b);
	}
	return tmp;
}

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
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 <= -1e-276)
		tmp = fma(Float64(b * 27.0), a, fma(Float64(-9.0 * y), Float64(t * z), Float64(x + x)));
	else
		tmp = Float64(Float64(Float64(x * 2.0) - Float64(Float64(Float64(y * 9.0) * z) * t)) + Float64(Float64(a * 27.0) * b));
	end
	return tmp
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
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, -1e-276], N[(N[(b * 27.0), $MachinePrecision] * a + N[(N[(-9.0 * y), $MachinePrecision] * N[(t * z), $MachinePrecision] + N[(x + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 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]]

Derivation

1. Split input into 2 regimes

2. if z < -1e-276

   1. Initial program 95.5%

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

   3. Applied rewrites 96.6%

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

   if -1e-276 < z

   1. Initial program 95.5%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 98.6% accurate, 0.9× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq -5 \cdot 10^{+53}:\\ \;\;\;\;\mathsf{fma}\left(b \cdot 27, a, \mathsf{fma}\left(-9 \cdot y, t \cdot z, x + x\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(t \cdot y, z \cdot -9, \mathsf{fma}\left(b \cdot a, 27, x + 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.
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 -5e+53)
   (fma (* b 27.0) a (fma (* -9.0 y) (* t z) (+ x x)))
   (fma (* t y) (* z -9.0) (fma (* b a) 27.0 (+ x x)))))

C

assert(x < y && y < z && z < t && t < a && a < b);
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 <= -5e+53) {
		tmp = fma((b * 27.0), a, fma((-9.0 * y), (t * z), (x + x)));
	} else {
		tmp = fma((t * y), (z * -9.0), fma((b * a), 27.0, (x + x)));
	}
	return tmp;
}

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
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 (y <= -5e+53)
		tmp = fma(Float64(b * 27.0), a, fma(Float64(-9.0 * y), Float64(t * z), Float64(x + x)));
	else
		tmp = fma(Float64(t * y), Float64(z * -9.0), fma(Float64(b * a), 27.0, 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.
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[y, -5e+53], N[(N[(b * 27.0), $MachinePrecision] * a + N[(N[(-9.0 * y), $MachinePrecision] * N[(t * z), $MachinePrecision] + N[(x + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t * y), $MachinePrecision] * N[(z * -9.0), $MachinePrecision] + N[(N[(b * a), $MachinePrecision] * 27.0 + N[(x + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -5.0000000000000004e53

   1. Initial program 95.5%

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

   3. Applied rewrites 96.6%

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

   if -5.0000000000000004e53 < y

   1. Initial program 95.5%

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

   3. Applied rewrites 93.6%

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

Alternative 3: 97.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq 6.2 \cdot 10^{+25}:\\ \;\;\;\;\mathsf{fma}\left(b \cdot 27, a, \mathsf{fma}\left(-9 \cdot y, t \cdot z, x + x\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\left(y \cdot z\right) \cdot t, -9, 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.
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 6.2e+25)
   (fma (* b 27.0) a (fma (* -9.0 y) (* t z) (+ x x)))
   (fma (* (* y z) t) -9.0 (+ x x))))

C

assert(x < y && y < z && z < t && t < a && a < b);
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 <= 6.2e+25) {
		tmp = fma((b * 27.0), a, fma((-9.0 * y), (t * z), (x + x)));
	} else {
		tmp = fma(((y * z) * t), -9.0, (x + x));
	}
	return tmp;
}

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
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 <= 6.2e+25)
		tmp = fma(Float64(b * 27.0), a, fma(Float64(-9.0 * y), Float64(t * z), Float64(x + x)));
	else
		tmp = fma(Float64(Float64(y * z) * t), -9.0, 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.
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, 6.2e+25], N[(N[(b * 27.0), $MachinePrecision] * a + N[(N[(-9.0 * y), $MachinePrecision] * N[(t * z), $MachinePrecision] + N[(x + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(y * z), $MachinePrecision] * t), $MachinePrecision] * -9.0 + N[(x + x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < 6.1999999999999996e25

   1. Initial program 95.5%

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

   3. Applied rewrites 96.6%

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

   if 6.1999999999999996e25 < z

   1. Initial program 95.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. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   4. Applied rewrites 86.6%

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

   5. Taylor expanded in x around inf

      \[\leadsto 2 \cdot x \]
   6. Step-by-step derivation

   7. Applied rewrites 31.3%

      \[\leadsto 2 \cdot x \]

   8. Taylor expanded in a around 0

      \[\leadsto \color{blue}{2 \cdot x - 9 \cdot \left(t \cdot \left(y \cdot z\right)\right)} \]
   9. 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. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. lower-*.f64 N/A

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

      9. count-2-rev N/A

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

      10. lift-+.f64 65.1

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

   10. Applied rewrites 65.1%

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

Alternative 4: 86.1% accurate, 0.6× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [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 -3.4 \cdot 10^{+136}:\\ \;\;\;\;\mathsf{fma}\left(y \cdot t, -9 \cdot z, \left(a \cdot b\right) \cdot 27\right)\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+44}:\\ \;\;\;\;\mathsf{fma}\left(a \cdot 27, b, x + x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-9, \left(z \cdot y\right) \cdot t, \left(b \cdot a\right) \cdot 27\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
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 -3.4e+136)
     (fma (* y t) (* -9.0 z) (* (* a b) 27.0))
     (if (<= t_1 5e+44)
       (fma (* a 27.0) b (+ x x))
       (fma -9.0 (* (* z y) t) (* (* b a) 27.0))))))

C

assert(x < y && y < z && z < t && t < a && a < b);
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 <= -3.4e+136) {
		tmp = fma((y * t), (-9.0 * z), ((a * b) * 27.0));
	} else if (t_1 <= 5e+44) {
		tmp = fma((a * 27.0), b, (x + x));
	} else {
		tmp = fma(-9.0, ((z * y) * t), ((b * a) * 27.0));
	}
	return tmp;
}

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
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 <= -3.4e+136)
		tmp = fma(Float64(y * t), Float64(-9.0 * z), Float64(Float64(a * b) * 27.0));
	elseif (t_1 <= 5e+44)
		tmp = fma(Float64(a * 27.0), b, Float64(x + x));
	else
		tmp = fma(-9.0, Float64(Float64(z * y) * t), Float64(Float64(b * a) * 27.0));
	end
	return tmp
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
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, -3.4e+136], N[(N[(y * t), $MachinePrecision] * N[(-9.0 * z), $MachinePrecision] + N[(N[(a * b), $MachinePrecision] * 27.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+44], N[(N[(a * 27.0), $MachinePrecision] * b + N[(x + x), $MachinePrecision]), $MachinePrecision], N[(-9.0 * N[(N[(z * y), $MachinePrecision] * t), $MachinePrecision] + N[(N[(b * a), $MachinePrecision] * 27.0), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 95.5%

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

   3. Applied rewrites 93.5%

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

   4. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 64.6

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

   6. Applied rewrites 64.6%

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

      1. lift-fma.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*l* N/A

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

      5. lower-fma.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. lower-*.f64 64.6

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

   8. Applied rewrites 64.6%

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

   if -3.39999999999999997e136 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < 4.9999999999999996e44

   1. Initial program 95.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. Taylor expanded in y around 0

      \[\leadsto \color{blue}{2 \cdot x + 27 \cdot \left(a \cdot b\right)} \]
   3. 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. count-2-rev N/A

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

      7. lower-+.f64 64.4

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

   4. Applied rewrites 64.4%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-fma.f64 N/A

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

      4. *-commutative N/A

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

      5. *-commutative N/A

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

      6. associate-*r* N/A

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

      7. count-2-rev N/A

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

      8. lower-fma.f64 N/A

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

      9. *-commutative N/A

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

      10. lift-*.f64 N/A

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

      11. count-2-rev N/A

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

      12. lift-+.f64 64.3

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

   6. Applied rewrites 64.3%

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

   if 4.9999999999999996e44 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t)

   1. Initial program 95.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. 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)} \]
   3. 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 66.4

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

   4. Applied rewrites 66.4%

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

Alternative 5: 85.6% accurate, 0.6× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} t_1 := \mathsf{fma}\left(-9, \left(z \cdot y\right) \cdot t, \left(b \cdot a\right) \cdot 27\right)\\ t_2 := \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\\ \mathbf{if}\;t\_2 \leq -3.4 \cdot 10^{+136}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 \leq 5 \cdot 10^{+44}:\\ \;\;\;\;\mathsf{fma}\left(a \cdot 27, b, x + x\right)\\ \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.
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 -9.0 (* (* z y) t) (* (* b a) 27.0)))
        (t_2 (* (* (* y 9.0) z) t)))
   (if (<= t_2 -3.4e+136)
     t_1
     (if (<= t_2 5e+44) (fma (* a 27.0) b (+ x x)) t_1))))

C

assert(x < y && y < z && z < t && t < a && a < b);
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(-9.0, ((z * y) * t), ((b * a) * 27.0));
	double t_2 = ((y * 9.0) * z) * t;
	double tmp;
	if (t_2 <= -3.4e+136) {
		tmp = t_1;
	} else if (t_2 <= 5e+44) {
		tmp = fma((a * 27.0), b, (x + x));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	t_1 = fma(-9.0, Float64(Float64(z * y) * t), Float64(Float64(b * a) * 27.0))
	t_2 = Float64(Float64(Float64(y * 9.0) * z) * t)
	tmp = 0.0
	if (t_2 <= -3.4e+136)
		tmp = t_1;
	elseif (t_2 <= 5e+44)
		tmp = fma(Float64(a * 27.0), b, Float64(x + x));
	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.
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] + N[(N[(b * a), $MachinePrecision] * 27.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(y * 9.0), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision]}, If[LessEqual[t$95$2, -3.4e+136], t$95$1, If[LessEqual[t$95$2, 5e+44], N[(N[(a * 27.0), $MachinePrecision] * b + N[(x + x), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < -3.39999999999999997e136 or 4.9999999999999996e44 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t)

   1. Initial program 95.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. 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)} \]
   3. 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 66.4

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

   4. Applied rewrites 66.4%

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

   if -3.39999999999999997e136 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < 4.9999999999999996e44

   1. Initial program 95.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. Taylor expanded in y around 0

      \[\leadsto \color{blue}{2 \cdot x + 27 \cdot \left(a \cdot b\right)} \]
   3. 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. count-2-rev N/A

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

      7. lower-+.f64 64.4

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

   4. Applied rewrites 64.4%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-fma.f64 N/A

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

      4. *-commutative N/A

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

      5. *-commutative N/A

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

      6. associate-*r* N/A

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

      7. count-2-rev N/A

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

      8. lower-fma.f64 N/A

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

      9. *-commutative N/A

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

      10. lift-*.f64 N/A

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

      11. count-2-rev N/A

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

      12. lift-+.f64 64.3

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

   6. Applied rewrites 64.3%

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

Alternative 6: 83.1% accurate, 0.6× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [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 -2 \cdot 10^{+253}:\\ \;\;\;\;\left(\left(t \cdot y\right) \cdot z\right) \cdot -9\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+52}:\\ \;\;\;\;\mathsf{fma}\left(a \cdot 27, b, x + x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\left(y \cdot z\right) \cdot t, -9, 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.
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 -2e+253)
     (* (* (* t y) z) -9.0)
     (if (<= t_1 2e+52)
       (fma (* a 27.0) b (+ x x))
       (fma (* (* y z) t) -9.0 (+ x x))))))

C

assert(x < y && y < z && z < t && t < a && a < b);
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 <= -2e+253) {
		tmp = ((t * y) * z) * -9.0;
	} else if (t_1 <= 2e+52) {
		tmp = fma((a * 27.0), b, (x + x));
	} else {
		tmp = fma(((y * z) * t), -9.0, (x + x));
	}
	return tmp;
}

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
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 <= -2e+253)
		tmp = Float64(Float64(Float64(t * y) * z) * -9.0);
	elseif (t_1 <= 2e+52)
		tmp = fma(Float64(a * 27.0), b, Float64(x + x));
	else
		tmp = fma(Float64(Float64(y * z) * t), -9.0, 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.
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, -2e+253], N[(N[(N[(t * y), $MachinePrecision] * z), $MachinePrecision] * -9.0), $MachinePrecision], If[LessEqual[t$95$1, 2e+52], N[(N[(a * 27.0), $MachinePrecision] * b + N[(x + x), $MachinePrecision]), $MachinePrecision], N[(N[(N[(y * z), $MachinePrecision] * t), $MachinePrecision] * -9.0 + N[(x + x), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 95.5%

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

   3. 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, x + x\right)\right)} \]

   4. Taylor expanded in y around inf

      \[\leadsto \color{blue}{-9 \cdot \left(t \cdot \left(y \cdot z\right)\right)} \]
   5. 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 36.4

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

   6. Applied rewrites 36.4%

      \[\leadsto \color{blue}{\left(\left(y \cdot z\right) \cdot t\right) \cdot -9} \]
   7. 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. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. lower-*.f64 N/A

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

      6. lower-*.f64 35.1

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

   8. Applied rewrites 35.1%

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

   if -1.9999999999999999e253 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < 2e52

   1. Initial program 95.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. Taylor expanded in y around 0

      \[\leadsto \color{blue}{2 \cdot x + 27 \cdot \left(a \cdot b\right)} \]
   3. 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. count-2-rev N/A

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

      7. lower-+.f64 64.4

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

   4. Applied rewrites 64.4%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-fma.f64 N/A

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

      4. *-commutative N/A

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

      5. *-commutative N/A

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

      6. associate-*r* N/A

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

      7. count-2-rev N/A

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

      8. lower-fma.f64 N/A

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

      9. *-commutative N/A

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

      10. lift-*.f64 N/A

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

      11. count-2-rev N/A

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

      12. lift-+.f64 64.3

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

   6. Applied rewrites 64.3%

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

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

   1. Initial program 95.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. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   4. Applied rewrites 86.6%

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

   5. Taylor expanded in x around inf

      \[\leadsto 2 \cdot x \]
   6. Step-by-step derivation

   7. Applied rewrites 31.3%

      \[\leadsto 2 \cdot x \]

   8. Taylor expanded in a around 0

      \[\leadsto \color{blue}{2 \cdot x - 9 \cdot \left(t \cdot \left(y \cdot z\right)\right)} \]
   9. 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. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. lower-*.f64 N/A

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

      9. count-2-rev N/A

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

      10. lift-+.f64 65.1

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

   10. Applied rewrites 65.1%

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

Alternative 7: 81.6% accurate, 0.7× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [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 -2 \cdot 10^{+253}:\\ \;\;\;\;\left(\left(t \cdot y\right) \cdot z\right) \cdot -9\\ \mathbf{elif}\;t\_1 \leq 10^{+71}:\\ \;\;\;\;\mathsf{fma}\left(a \cdot 27, b, x + x\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\left(y \cdot z\right) \cdot t\right) \cdot -9\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
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 -2e+253)
     (* (* (* t y) z) -9.0)
     (if (<= t_1 1e+71) (fma (* a 27.0) b (+ x x)) (* (* (* y z) t) -9.0)))))

C

assert(x < y && y < z && z < t && t < a && a < b);
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 <= -2e+253) {
		tmp = ((t * y) * z) * -9.0;
	} else if (t_1 <= 1e+71) {
		tmp = fma((a * 27.0), b, (x + x));
	} else {
		tmp = ((y * z) * t) * -9.0;
	}
	return tmp;
}

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
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 <= -2e+253)
		tmp = Float64(Float64(Float64(t * y) * z) * -9.0);
	elseif (t_1 <= 1e+71)
		tmp = fma(Float64(a * 27.0), b, Float64(x + x));
	else
		tmp = 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.
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, -2e+253], N[(N[(N[(t * y), $MachinePrecision] * z), $MachinePrecision] * -9.0), $MachinePrecision], If[LessEqual[t$95$1, 1e+71], N[(N[(a * 27.0), $MachinePrecision] * b + N[(x + x), $MachinePrecision]), $MachinePrecision], N[(N[(N[(y * z), $MachinePrecision] * t), $MachinePrecision] * -9.0), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 95.5%

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

   3. 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, x + x\right)\right)} \]

   4. Taylor expanded in y around inf

      \[\leadsto \color{blue}{-9 \cdot \left(t \cdot \left(y \cdot z\right)\right)} \]
   5. 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 36.4

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

   6. Applied rewrites 36.4%

      \[\leadsto \color{blue}{\left(\left(y \cdot z\right) \cdot t\right) \cdot -9} \]
   7. 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. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. lower-*.f64 N/A

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

      6. lower-*.f64 35.1

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

   8. Applied rewrites 35.1%

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

   if -1.9999999999999999e253 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < 1e71

   1. Initial program 95.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. Taylor expanded in y around 0

      \[\leadsto \color{blue}{2 \cdot x + 27 \cdot \left(a \cdot b\right)} \]
   3. 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. count-2-rev N/A

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

      7. lower-+.f64 64.4

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

   4. Applied rewrites 64.4%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-fma.f64 N/A

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

      4. *-commutative N/A

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

      5. *-commutative N/A

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

      6. associate-*r* N/A

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

      7. count-2-rev N/A

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

      8. lower-fma.f64 N/A

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

      9. *-commutative N/A

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

      10. lift-*.f64 N/A

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

      11. count-2-rev N/A

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

      12. lift-+.f64 64.3

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

   6. Applied rewrites 64.3%

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

   if 1e71 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t)

   1. Initial program 95.5%

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

   3. 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, x + x\right)\right)} \]

   4. Taylor expanded in y around inf

      \[\leadsto \color{blue}{-9 \cdot \left(t \cdot \left(y \cdot z\right)\right)} \]
   5. 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 36.4

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

   6. Applied rewrites 36.4%

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

Alternative 8: 81.5% accurate, 0.7× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [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 -2 \cdot 10^{+253}:\\ \;\;\;\;\left(\left(t \cdot y\right) \cdot z\right) \cdot -9\\ \mathbf{elif}\;t\_1 \leq 10^{+71}:\\ \;\;\;\;\mathsf{fma}\left(27 \cdot b, a, x + x\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\left(y \cdot z\right) \cdot t\right) \cdot -9\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
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 -2e+253)
     (* (* (* t y) z) -9.0)
     (if (<= t_1 1e+71) (fma (* 27.0 b) a (+ x x)) (* (* (* y z) t) -9.0)))))

C

assert(x < y && y < z && z < t && t < a && a < b);
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 <= -2e+253) {
		tmp = ((t * y) * z) * -9.0;
	} else if (t_1 <= 1e+71) {
		tmp = fma((27.0 * b), a, (x + x));
	} else {
		tmp = ((y * z) * t) * -9.0;
	}
	return tmp;
}

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
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 <= -2e+253)
		tmp = Float64(Float64(Float64(t * y) * z) * -9.0);
	elseif (t_1 <= 1e+71)
		tmp = fma(Float64(27.0 * b), a, Float64(x + x));
	else
		tmp = 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.
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, -2e+253], N[(N[(N[(t * y), $MachinePrecision] * z), $MachinePrecision] * -9.0), $MachinePrecision], If[LessEqual[t$95$1, 1e+71], N[(N[(27.0 * b), $MachinePrecision] * a + N[(x + x), $MachinePrecision]), $MachinePrecision], N[(N[(N[(y * z), $MachinePrecision] * t), $MachinePrecision] * -9.0), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 95.5%

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

   3. 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, x + x\right)\right)} \]

   4. Taylor expanded in y around inf

      \[\leadsto \color{blue}{-9 \cdot \left(t \cdot \left(y \cdot z\right)\right)} \]
   5. 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 36.4

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

   6. Applied rewrites 36.4%

      \[\leadsto \color{blue}{\left(\left(y \cdot z\right) \cdot t\right) \cdot -9} \]
   7. 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. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. lower-*.f64 N/A

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

      6. lower-*.f64 35.1

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

   8. Applied rewrites 35.1%

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

   if -1.9999999999999999e253 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < 1e71

   1. Initial program 95.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. Taylor expanded in y around 0

      \[\leadsto \color{blue}{2 \cdot x + 27 \cdot \left(a \cdot b\right)} \]
   3. 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. count-2-rev N/A

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

      7. lower-+.f64 64.4

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

   4. Applied rewrites 64.4%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-fma.f64 N/A

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

      4. associate-*l* N/A

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

      5. *-commutative N/A

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

      6. associate-*l* N/A

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

      7. *-commutative N/A

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

      8. count-2-rev N/A

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

      9. lower-fma.f64 N/A

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

      10. lower-*.f64 N/A

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

      11. count-2-rev N/A

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

      12. lift-+.f64 64.4

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

   6. Applied rewrites 64.4%

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

   if 1e71 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t)

   1. Initial program 95.5%

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

   3. 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, x + x\right)\right)} \]

   4. Taylor expanded in y around inf

      \[\leadsto \color{blue}{-9 \cdot \left(t \cdot \left(y \cdot z\right)\right)} \]
   5. 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 36.4

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

   6. Applied rewrites 36.4%

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

Alternative 9: 58.8% accurate, 0.3× speedup

Math

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

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
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 (- (* x 2.0) (* (* (* y 9.0) z) t))))
   (if (<= t_1 -5e+304)
     (* (* y (* t z)) -9.0)
     (if (<= t_1 -1e+66)
       (+ x x)
       (if (<= t_1 1e+184)
         (* (* 27.0 a) b)
         (if (<= t_1 6e+288) (+ x x) (* (* (* t y) z) -9.0)))))))

C

assert(x < y && y < z && z < t && t < a && a < b);
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 = (x * 2.0) - (((y * 9.0) * z) * t);
	double tmp;
	if (t_1 <= -5e+304) {
		tmp = (y * (t * z)) * -9.0;
	} else if (t_1 <= -1e+66) {
		tmp = x + x;
	} else if (t_1 <= 1e+184) {
		tmp = (27.0 * a) * b;
	} else if (t_1 <= 6e+288) {
		tmp = x + x;
	} else {
		tmp = ((t * y) * z) * -9.0;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
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 = (x * 2.0d0) - (((y * 9.0d0) * z) * t)
    if (t_1 <= (-5d+304)) then
        tmp = (y * (t * z)) * (-9.0d0)
    else if (t_1 <= (-1d+66)) then
        tmp = x + x
    else if (t_1 <= 1d+184) then
        tmp = (27.0d0 * a) * b
    else if (t_1 <= 6d+288) then
        tmp = x + x
    else
        tmp = ((t * y) * z) * (-9.0d0)
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
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 = (x * 2.0) - (((y * 9.0) * z) * t);
	double tmp;
	if (t_1 <= -5e+304) {
		tmp = (y * (t * z)) * -9.0;
	} else if (t_1 <= -1e+66) {
		tmp = x + x;
	} else if (t_1 <= 1e+184) {
		tmp = (27.0 * a) * b;
	} else if (t_1 <= 6e+288) {
		tmp = x + x;
	} else {
		tmp = ((t * y) * z) * -9.0;
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	t_1 = (x * 2.0) - (((y * 9.0) * z) * t)
	tmp = 0
	if t_1 <= -5e+304:
		tmp = (y * (t * z)) * -9.0
	elif t_1 <= -1e+66:
		tmp = x + x
	elif t_1 <= 1e+184:
		tmp = (27.0 * a) * b
	elif t_1 <= 6e+288:
		tmp = x + x
	else:
		tmp = ((t * y) * z) * -9.0
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
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(x * 2.0) - Float64(Float64(Float64(y * 9.0) * z) * t))
	tmp = 0.0
	if (t_1 <= -5e+304)
		tmp = Float64(Float64(y * Float64(t * z)) * -9.0);
	elseif (t_1 <= -1e+66)
		tmp = Float64(x + x);
	elseif (t_1 <= 1e+184)
		tmp = Float64(Float64(27.0 * a) * b);
	elseif (t_1 <= 6e+288)
		tmp = Float64(x + x);
	else
		tmp = Float64(Float64(Float64(t * y) * z) * -9.0);
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
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 = (x * 2.0) - (((y * 9.0) * z) * t);
	tmp = 0.0;
	if (t_1 <= -5e+304)
		tmp = (y * (t * z)) * -9.0;
	elseif (t_1 <= -1e+66)
		tmp = x + x;
	elseif (t_1 <= 1e+184)
		tmp = (27.0 * a) * b;
	elseif (t_1 <= 6e+288)
		tmp = x + x;
	else
		tmp = ((t * y) * z) * -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.
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[(x * 2.0), $MachinePrecision] - N[(N[(N[(y * 9.0), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+304], N[(N[(y * N[(t * z), $MachinePrecision]), $MachinePrecision] * -9.0), $MachinePrecision], If[LessEqual[t$95$1, -1e+66], N[(x + x), $MachinePrecision], If[LessEqual[t$95$1, 1e+184], N[(N[(27.0 * a), $MachinePrecision] * b), $MachinePrecision], If[LessEqual[t$95$1, 6e+288], N[(x + x), $MachinePrecision], N[(N[(N[(t * y), $MachinePrecision] * z), $MachinePrecision] * -9.0), $MachinePrecision]]]]]]

Derivation

1. Split input into 4 regimes

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

   1. Initial program 95.5%

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

   3. 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, x + x\right)\right)} \]

   4. Taylor expanded in y around inf

      \[\leadsto \color{blue}{-9 \cdot \left(t \cdot \left(y \cdot z\right)\right)} \]
   5. 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 36.4

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

   6. Applied rewrites 36.4%

      \[\leadsto \color{blue}{\left(\left(y \cdot z\right) \cdot t\right) \cdot -9} \]
   7. 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. lower-*.f64 36.8

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

   8. Applied rewrites 36.8%

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

   if -4.9999999999999997e304 < (-.f64 (*.f64 x #s(literal 2 binary64)) (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t)) < -9.99999999999999945e65 or 1.00000000000000002e184 < (-.f64 (*.f64 x #s(literal 2 binary64)) (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t)) < 5.9999999999999995e288

   1. Initial program 95.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. Taylor expanded in x around 0

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

      1. lower-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 66.4

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

   4. Applied rewrites 66.4%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. associate-*r* N/A

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

      7. lower-*.f64 N/A

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

      8. lower-*.f64 N/A

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

      9. *-commutative N/A

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

      10. lift-*.f64 66.3

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

   6. Applied rewrites 66.3%

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

   7. Taylor expanded in x around inf

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

      1. count-2-rev N/A

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

      2. lower-+.f64 31.3

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

   9. Applied rewrites 31.3%

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

   if -9.99999999999999945e65 < (-.f64 (*.f64 x #s(literal 2 binary64)) (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t)) < 1.00000000000000002e184

   1. Initial program 95.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. Taylor expanded in y around 0

      \[\leadsto \color{blue}{2 \cdot x + 27 \cdot \left(a \cdot b\right)} \]
   3. 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. count-2-rev N/A

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

      7. lower-+.f64 64.4

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

   4. Applied rewrites 64.4%

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

   5. Taylor expanded in b around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. associate-*r/ N/A

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

      7. lower-/.f64 N/A

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

      8. count-2-rev N/A

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

      9. lift-+.f64 57.3

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

   7. Applied rewrites 57.3%

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

   8. Taylor expanded in x around 0

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

      1. lower-*.f64 35.0

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

   10. Applied rewrites 35.0%

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

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

   1. Initial program 95.5%

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

   3. 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, x + x\right)\right)} \]

   4. Taylor expanded in y around inf

      \[\leadsto \color{blue}{-9 \cdot \left(t \cdot \left(y \cdot z\right)\right)} \]
   5. 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 36.4

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

   6. Applied rewrites 36.4%

      \[\leadsto \color{blue}{\left(\left(y \cdot z\right) \cdot t\right) \cdot -9} \]
   7. 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. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. lower-*.f64 N/A

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

      6. lower-*.f64 35.1

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

   8. Applied rewrites 35.1%

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

Alternative 10: 58.7% accurate, 0.3× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} t_1 := \left(y \cdot \left(t \cdot z\right)\right) \cdot -9\\ t_2 := x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\\ \mathbf{if}\;t\_2 \leq -5 \cdot 10^{+304}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 \leq -1 \cdot 10^{+66}:\\ \;\;\;\;x + x\\ \mathbf{elif}\;t\_2 \leq 10^{+184}:\\ \;\;\;\;\left(27 \cdot a\right) \cdot b\\ \mathbf{elif}\;t\_2 \leq 6 \cdot 10^{+288}:\\ \;\;\;\;x + x\\ \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.
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 (* t z)) -9.0)) (t_2 (- (* x 2.0) (* (* (* y 9.0) z) t))))
   (if (<= t_2 -5e+304)
     t_1
     (if (<= t_2 -1e+66)
       (+ x x)
       (if (<= t_2 1e+184)
         (* (* 27.0 a) b)
         (if (<= t_2 6e+288) (+ x x) t_1))))))

C

assert(x < y && y < z && z < t && t < a && a < b);
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 * (t * z)) * -9.0;
	double t_2 = (x * 2.0) - (((y * 9.0) * z) * t);
	double tmp;
	if (t_2 <= -5e+304) {
		tmp = t_1;
	} else if (t_2 <= -1e+66) {
		tmp = x + x;
	} else if (t_2 <= 1e+184) {
		tmp = (27.0 * a) * b;
	} else if (t_2 <= 6e+288) {
		tmp = x + x;
	} 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.
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 = (y * (t * z)) * (-9.0d0)
    t_2 = (x * 2.0d0) - (((y * 9.0d0) * z) * t)
    if (t_2 <= (-5d+304)) then
        tmp = t_1
    else if (t_2 <= (-1d+66)) then
        tmp = x + x
    else if (t_2 <= 1d+184) then
        tmp = (27.0d0 * a) * b
    else if (t_2 <= 6d+288) then
        tmp = x + x
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
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 * (t * z)) * -9.0;
	double t_2 = (x * 2.0) - (((y * 9.0) * z) * t);
	double tmp;
	if (t_2 <= -5e+304) {
		tmp = t_1;
	} else if (t_2 <= -1e+66) {
		tmp = x + x;
	} else if (t_2 <= 1e+184) {
		tmp = (27.0 * a) * b;
	} else if (t_2 <= 6e+288) {
		tmp = x + x;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	t_1 = (y * (t * z)) * -9.0
	t_2 = (x * 2.0) - (((y * 9.0) * z) * t)
	tmp = 0
	if t_2 <= -5e+304:
		tmp = t_1
	elif t_2 <= -1e+66:
		tmp = x + x
	elif t_2 <= 1e+184:
		tmp = (27.0 * a) * b
	elif t_2 <= 6e+288:
		tmp = x + x
	else:
		tmp = t_1
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
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(y * Float64(t * z)) * -9.0)
	t_2 = Float64(Float64(x * 2.0) - Float64(Float64(Float64(y * 9.0) * z) * t))
	tmp = 0.0
	if (t_2 <= -5e+304)
		tmp = t_1;
	elseif (t_2 <= -1e+66)
		tmp = Float64(x + x);
	elseif (t_2 <= 1e+184)
		tmp = Float64(Float64(27.0 * a) * b);
	elseif (t_2 <= 6e+288)
		tmp = Float64(x + x);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
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 * (t * z)) * -9.0;
	t_2 = (x * 2.0) - (((y * 9.0) * z) * t);
	tmp = 0.0;
	if (t_2 <= -5e+304)
		tmp = t_1;
	elseif (t_2 <= -1e+66)
		tmp = x + x;
	elseif (t_2 <= 1e+184)
		tmp = (27.0 * a) * b;
	elseif (t_2 <= 6e+288)
		tmp = x + x;
	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.
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[(y * N[(t * z), $MachinePrecision]), $MachinePrecision] * -9.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x * 2.0), $MachinePrecision] - N[(N[(N[(y * 9.0), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -5e+304], t$95$1, If[LessEqual[t$95$2, -1e+66], N[(x + x), $MachinePrecision], If[LessEqual[t$95$2, 1e+184], N[(N[(27.0 * a), $MachinePrecision] * b), $MachinePrecision], If[LessEqual[t$95$2, 6e+288], N[(x + x), $MachinePrecision], t$95$1]]]]]]

Derivation

1. Split input into 3 regimes

2. if (-.f64 (*.f64 x #s(literal 2 binary64)) (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t)) < -4.9999999999999997e304 or 5.9999999999999995e288 < (-.f64 (*.f64 x #s(literal 2 binary64)) (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t))

   1. Initial program 95.5%

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

   3. 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, x + x\right)\right)} \]

   4. Taylor expanded in y around inf

      \[\leadsto \color{blue}{-9 \cdot \left(t \cdot \left(y \cdot z\right)\right)} \]
   5. 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 36.4

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

   6. Applied rewrites 36.4%

      \[\leadsto \color{blue}{\left(\left(y \cdot z\right) \cdot t\right) \cdot -9} \]
   7. 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. lower-*.f64 36.8

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

   8. Applied rewrites 36.8%

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

   if -4.9999999999999997e304 < (-.f64 (*.f64 x #s(literal 2 binary64)) (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t)) < -9.99999999999999945e65 or 1.00000000000000002e184 < (-.f64 (*.f64 x #s(literal 2 binary64)) (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t)) < 5.9999999999999995e288

   1. Initial program 95.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. Taylor expanded in x around 0

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

      1. lower-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 66.4

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

   4. Applied rewrites 66.4%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. associate-*r* N/A

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

      7. lower-*.f64 N/A

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

      8. lower-*.f64 N/A

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

      9. *-commutative N/A

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

      10. lift-*.f64 66.3

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

   6. Applied rewrites 66.3%

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

   7. Taylor expanded in x around inf

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

      1. count-2-rev N/A

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

      2. lower-+.f64 31.3

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

   9. Applied rewrites 31.3%

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

   if -9.99999999999999945e65 < (-.f64 (*.f64 x #s(literal 2 binary64)) (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t)) < 1.00000000000000002e184

   1. Initial program 95.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. Taylor expanded in y around 0

      \[\leadsto \color{blue}{2 \cdot x + 27 \cdot \left(a \cdot b\right)} \]
   3. 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. count-2-rev N/A

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

      7. lower-+.f64 64.4

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

   4. Applied rewrites 64.4%

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

   5. Taylor expanded in b around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. associate-*r/ N/A

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

      7. lower-/.f64 N/A

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

      8. count-2-rev N/A

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

      9. lift-+.f64 57.3

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

   7. Applied rewrites 57.3%

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

   8. Taylor expanded in x around 0

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

      1. lower-*.f64 35.0

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

   10. Applied rewrites 35.0%

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

Alternative 11: 52.3% accurate, 0.9× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [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 a\right) \cdot b\\ \mathbf{if}\;t\_1 \leq -5 \cdot 10^{-66}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 10^{+63}:\\ \;\;\;\;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.
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 a) b)))
   (if (<= t_1 -5e-66) t_2 (if (<= t_1 1e+63) (+ x x) t_2))))

C

assert(x < y && y < z && z < t && t < a && a < b);
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 * a) * b;
	double tmp;
	if (t_1 <= -5e-66) {
		tmp = t_2;
	} else if (t_1 <= 1e+63) {
		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.
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 * a) * b
    if (t_1 <= (-5d-66)) then
        tmp = t_2
    else if (t_1 <= 1d+63) 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;
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 * a) * b;
	double tmp;
	if (t_1 <= -5e-66) {
		tmp = t_2;
	} else if (t_1 <= 1e+63) {
		tmp = x + x;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[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 * a) * b
	tmp = 0
	if t_1 <= -5e-66:
		tmp = t_2
	elif t_1 <= 1e+63:
		tmp = x + x
	else:
		tmp = t_2
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
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 * a) * b)
	tmp = 0.0
	if (t_1 <= -5e-66)
		tmp = t_2;
	elseif (t_1 <= 1e+63)
		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])){:}
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 * a) * b;
	tmp = 0.0;
	if (t_1 <= -5e-66)
		tmp = t_2;
	elseif (t_1 <= 1e+63)
		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.
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 * a), $MachinePrecision] * b), $MachinePrecision]}, If[LessEqual[t$95$1, -5e-66], t$95$2, If[LessEqual[t$95$1, 1e+63], N[(x + x), $MachinePrecision], t$95$2]]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 a #s(literal 27 binary64)) b) < -4.99999999999999962e-66 or 1.00000000000000006e63 < (*.f64 (*.f64 a #s(literal 27 binary64)) b)

   1. Initial program 95.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. Taylor expanded in y around 0

      \[\leadsto \color{blue}{2 \cdot x + 27 \cdot \left(a \cdot b\right)} \]
   3. 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. count-2-rev N/A

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

      7. lower-+.f64 64.4

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

   4. Applied rewrites 64.4%

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

   5. Taylor expanded in b around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. associate-*r/ N/A

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

      7. lower-/.f64 N/A

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

      8. count-2-rev N/A

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

      9. lift-+.f64 57.3

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

   7. Applied rewrites 57.3%

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

   8. Taylor expanded in x around 0

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

      1. lower-*.f64 35.0

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

   10. Applied rewrites 35.0%

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

   if -4.99999999999999962e-66 < (*.f64 (*.f64 a #s(literal 27 binary64)) b) < 1.00000000000000006e63

   1. Initial program 95.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. Taylor expanded in x around 0

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

      1. lower-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 66.4

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

   4. Applied rewrites 66.4%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. associate-*r* N/A

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

      7. lower-*.f64 N/A

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

      8. lower-*.f64 N/A

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

      9. *-commutative N/A

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

      10. lift-*.f64 66.3

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

   6. Applied rewrites 66.3%

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

   7. Taylor expanded in x around inf

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

      1. count-2-rev N/A

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

      2. lower-+.f64 31.3

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

   9. Applied rewrites 31.3%

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

Alternative 12: 31.3% accurate, 6.4× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [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.
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);
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.
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;
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])
[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])
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])){:}
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.
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.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. Taylor expanded in x around 0

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

   1. lower-*.f64 N/A

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

   2. *-commutative N/A

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

   3. lower-*.f64 N/A

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

   4. *-commutative N/A

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

   5. lower-*.f64 66.4

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

4. Applied rewrites 66.4%

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

   1. lift-*.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. *-commutative N/A

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

   4. lift-*.f64 N/A

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

   5. *-commutative N/A

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

   6. associate-*r* N/A

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

   7. lower-*.f64 N/A

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

   8. lower-*.f64 N/A

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

   9. *-commutative N/A

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

   10. lift-*.f64 66.3

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

6. Applied rewrites 66.3%

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

7. Taylor expanded in x around inf

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

   1. count-2-rev N/A

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

   2. lower-+.f64 31.3

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

9. Applied rewrites 31.3%

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

Reproduce

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