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

Percentage Accurate: 95.4% → 98.1%

Time: 9.8s

Alternatives: 14

Speedup: 0.8×

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

Specification

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a, b)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = ((x * 2.0d0) - (((y * 9.0d0) * z) * t)) + ((a * 27.0d0) * b)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 95.4% 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.1% accurate, 0.8× 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}\;\left(y \cdot 9\right) \cdot z \leq 5 \cdot 10^{-31}:\\ \;\;\;\;\mathsf{fma}\left(-9 \cdot \left(z \cdot y\right), t, \mathsf{fma}\left(b \cdot 27, a, x + x\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(27 \cdot a, b, \mathsf{fma}\left(z \cdot t, y \cdot -9, x\right) + 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 (<= (* (* y 9.0) z) 5e-31)
   (fma (* -9.0 (* z y)) t (fma (* b 27.0) a (+ x x)))
   (fma (* 27.0 a) b (+ (fma (* z t) (* y -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 (((y * 9.0) * z) <= 5e-31) {
		tmp = fma((-9.0 * (z * y)), t, fma((b * 27.0), a, (x + x)));
	} else {
		tmp = fma((27.0 * a), b, (fma((z * t), (y * -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 (Float64(Float64(y * 9.0) * z) <= 5e-31)
		tmp = fma(Float64(-9.0 * Float64(z * y)), t, fma(Float64(b * 27.0), a, Float64(x + x)));
	else
		tmp = fma(Float64(27.0 * a), b, Float64(fma(Float64(z * t), Float64(y * -9.0), 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[N[(N[(y * 9.0), $MachinePrecision] * z), $MachinePrecision], 5e-31], N[(N[(-9.0 * N[(z * y), $MachinePrecision]), $MachinePrecision] * t + N[(N[(b * 27.0), $MachinePrecision] * a + N[(x + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(27.0 * a), $MachinePrecision] * b + N[(N[(N[(z * t), $MachinePrecision] * N[(y * -9.0), $MachinePrecision] + x), $MachinePrecision] + x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 y #s(literal 9 binary64)) z) < 5e-31

   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. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift--.f64 N/A

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

      4. lift-*.f64 N/A

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

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

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

      6. associate-+r+ N/A

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

      7. +-commutative N/A

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

      8. lower-fma.f64 N/A

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

      9. lift-*.f64 N/A

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

      10. lift-*.f64 N/A

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

      11. *-commutative N/A

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

      12. associate-*l* N/A

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

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

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

      14. *-commutative N/A

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

      15. lower-*.f64 N/A

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

      16. metadata-eval N/A

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

      17. lower-*.f64 N/A

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

      18. lift-*.f64 N/A

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

      19. lift-*.f64 N/A

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

      20. associate-*l* N/A

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

      21. *-commutative N/A

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

      22. lower-fma.f64 N/A

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

   4. Applied rewrites 95.5%

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

      1. lift-*.f64 N/A

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

      2. count-2-rev N/A

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

      3. lower-+.f64 95.5

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

   6. Applied rewrites 95.5%

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

   if 5e-31 < (*.f64 (*.f64 y #s(literal 9 binary64)) z)

   1. Initial program 93.5%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lower-fma.f64 97.3

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 97.3

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

      8. lift--.f64 N/A

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

      9. lift-*.f64 N/A

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

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

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

      11. +-commutative N/A

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

      12. lift-*.f64 N/A

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

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

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

      14. associate-*r* N/A

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

      15. *-commutative N/A

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

      16. associate-*r* N/A

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

      17. lower-fma.f64 N/A

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

   4. Applied rewrites 97.2%

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

      1. lift-fma.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. count-2-rev N/A

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

      4. associate-+r+ N/A

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

      5. lower-+.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. associate-*l* N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 93.9

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

      12. lift-*.f64 N/A

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

      13. *-commutative N/A

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

      14. lower-*.f64 93.9

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

   6. Applied rewrites 93.9%

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

Alternative 2: 86.7% accurate, 0.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])\\ \\ \begin{array}{l} t_1 := \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\\ t_2 := \left(b \cdot a\right) \cdot 27\\ \mathbf{if}\;t\_1 \leq -2 \cdot 10^{+39}:\\ \;\;\;\;\mathsf{fma}\left(b \cdot 27, a, \left(\left(z \cdot y\right) \cdot -9\right) \cdot t\right)\\ \mathbf{elif}\;t\_1 \leq 200000000:\\ \;\;\;\;\mathsf{fma}\left(2, x, t\_2\right)\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+299}:\\ \;\;\;\;\mathsf{fma}\left(\left(y \cdot z\right) \cdot t, -9, 2 \cdot x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(t \cdot \left(y \cdot -9\right), z, t\_2\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)) (t_2 (* (* b a) 27.0)))
   (if (<= t_1 -2e+39)
     (fma (* b 27.0) a (* (* (* z y) -9.0) t))
     (if (<= t_1 200000000.0)
       (fma 2.0 x t_2)
       (if (<= t_1 2e+299)
         (fma (* (* y z) t) -9.0 (* 2.0 x))
         (fma (* t (* y -9.0)) z 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 = ((y * 9.0) * z) * t;
	double t_2 = (b * a) * 27.0;
	double tmp;
	if (t_1 <= -2e+39) {
		tmp = fma((b * 27.0), a, (((z * y) * -9.0) * t));
	} else if (t_1 <= 200000000.0) {
		tmp = fma(2.0, x, t_2);
	} else if (t_1 <= 2e+299) {
		tmp = fma(((y * z) * t), -9.0, (2.0 * x));
	} else {
		tmp = fma((t * (y * -9.0)), z, 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(Float64(y * 9.0) * z) * t)
	t_2 = Float64(Float64(b * a) * 27.0)
	tmp = 0.0
	if (t_1 <= -2e+39)
		tmp = fma(Float64(b * 27.0), a, Float64(Float64(Float64(z * y) * -9.0) * t));
	elseif (t_1 <= 200000000.0)
		tmp = fma(2.0, x, t_2);
	elseif (t_1 <= 2e+299)
		tmp = fma(Float64(Float64(y * z) * t), -9.0, Float64(2.0 * x));
	else
		tmp = fma(Float64(t * Float64(y * -9.0)), z, t_2);
	end
	return tmp
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
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]}, Block[{t$95$2 = N[(N[(b * a), $MachinePrecision] * 27.0), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+39], N[(N[(b * 27.0), $MachinePrecision] * a + N[(N[(N[(z * y), $MachinePrecision] * -9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 200000000.0], N[(2.0 * x + t$95$2), $MachinePrecision], If[LessEqual[t$95$1, 2e+299], N[(N[(N[(y * z), $MachinePrecision] * t), $MachinePrecision] * -9.0 + N[(2.0 * x), $MachinePrecision]), $MachinePrecision], N[(N[(t * N[(y * -9.0), $MachinePrecision]), $MachinePrecision] * z + t$95$2), $MachinePrecision]]]]]]

Derivation

1. Split input into 4 regimes

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

   1. Initial program 85.6%

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

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 75.7

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

   5. Applied rewrites 75.7%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 79.4

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

   7. Applied rewrites 79.4%

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

   if -1.99999999999999988e39 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < 2e8

   1. Initial program 99.1%

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

   3. Taylor expanded in y around 0

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

      1. lower-fma.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 91.7

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

   5. Applied rewrites 91.7%

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

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

   1. Initial program 99.7%

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

   3. Taylor expanded in y around 0

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

      1. lower-fma.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 44.3

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

   5. Applied rewrites 44.3%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 23.9%

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

   9. Taylor expanded in a around 0

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

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

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

       3. +-commutative N/A

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

       4. *-commutative N/A

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

       5. lower-fma.f64 N/A

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

       6. *-commutative N/A

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

       7. lower-*.f64 N/A

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

       8. lower-*.f64 N/A

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

       9. lower-*.f64 76.8

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

   11. Applied rewrites 76.8%

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

   if 2.0000000000000001e299 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t)

   1. Initial program 83.8%

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

   3. Taylor expanded in x around 0

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

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

         \[\leadsto \color{blue}{27 \cdot \left(a \cdot b\right) + \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) + \color{blue}{-9} \cdot \left(t \cdot \left(y \cdot z\right)\right) \]

      3. +-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(-9, \color{blue}{\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, \color{blue}{\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, \color{blue}{\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, \color{blue}{\left(a \cdot b\right) \cdot 27}\right) \]

      11. *-commutative N/A

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

      12. lower-*.f64 83.9

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

   5. Applied rewrites 83.9%

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

   7. Applied rewrites 91.5%

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

Alternative 3: 85.8% accurate, 0.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])\\ \\ \begin{array}{l} t_1 := \mathsf{fma}\left(\left(y \cdot z\right) \cdot t, -9, 2 \cdot x\right)\\ t_2 := \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\\ t_3 := \left(b \cdot a\right) \cdot 27\\ \mathbf{if}\;t\_2 \leq -5 \cdot 10^{+16}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 \leq 200000000:\\ \;\;\;\;\mathsf{fma}\left(2, x, t\_3\right)\\ \mathbf{elif}\;t\_2 \leq 2 \cdot 10^{+299}:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(t \cdot \left(y \cdot -9\right), z, t\_3\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 (fma (* (* y z) t) -9.0 (* 2.0 x)))
        (t_2 (* (* (* y 9.0) z) t))
        (t_3 (* (* b a) 27.0)))
   (if (<= t_2 -5e+16)
     t_1
     (if (<= t_2 200000000.0)
       (fma 2.0 x t_3)
       (if (<= t_2 2e+299) t_1 (fma (* t (* y -9.0)) z t_3))))))

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(((y * z) * t), -9.0, (2.0 * x));
	double t_2 = ((y * 9.0) * z) * t;
	double t_3 = (b * a) * 27.0;
	double tmp;
	if (t_2 <= -5e+16) {
		tmp = t_1;
	} else if (t_2 <= 200000000.0) {
		tmp = fma(2.0, x, t_3);
	} else if (t_2 <= 2e+299) {
		tmp = t_1;
	} else {
		tmp = fma((t * (y * -9.0)), z, t_3);
	}
	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(Float64(Float64(y * z) * t), -9.0, Float64(2.0 * x))
	t_2 = Float64(Float64(Float64(y * 9.0) * z) * t)
	t_3 = Float64(Float64(b * a) * 27.0)
	tmp = 0.0
	if (t_2 <= -5e+16)
		tmp = t_1;
	elseif (t_2 <= 200000000.0)
		tmp = fma(2.0, x, t_3);
	elseif (t_2 <= 2e+299)
		tmp = t_1;
	else
		tmp = fma(Float64(t * Float64(y * -9.0)), z, t_3);
	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 * z), $MachinePrecision] * t), $MachinePrecision] * -9.0 + N[(2.0 * x), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(y * 9.0), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision]}, Block[{t$95$3 = N[(N[(b * a), $MachinePrecision] * 27.0), $MachinePrecision]}, If[LessEqual[t$95$2, -5e+16], t$95$1, If[LessEqual[t$95$2, 200000000.0], N[(2.0 * x + t$95$3), $MachinePrecision], If[LessEqual[t$95$2, 2e+299], t$95$1, N[(N[(t * N[(y * -9.0), $MachinePrecision]), $MachinePrecision] * z + t$95$3), $MachinePrecision]]]]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < -5e16 or 2e8 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < 2.0000000000000001e299

   1. Initial program 91.9%

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

   3. Taylor expanded in y around 0

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

      1. lower-fma.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 36.4

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

   5. Applied rewrites 36.4%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 21.4%

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

   9. Taylor expanded in a around 0

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

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

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

       3. +-commutative N/A

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

       4. *-commutative N/A

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

       5. lower-fma.f64 N/A

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

       6. *-commutative N/A

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

       7. lower-*.f64 N/A

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

       8. lower-*.f64 N/A

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

       9. lower-*.f64 79.2

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

   11. Applied rewrites 79.2%

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

   if -5e16 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < 2e8

   1. Initial program 99.1%

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

   3. Taylor expanded in y around 0

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

      1. lower-fma.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 92.2

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

   5. Applied rewrites 92.2%

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

   if 2.0000000000000001e299 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t)

   1. Initial program 83.8%

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

   3. Taylor expanded in x around 0

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

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

         \[\leadsto \color{blue}{27 \cdot \left(a \cdot b\right) + \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) + \color{blue}{-9} \cdot \left(t \cdot \left(y \cdot z\right)\right) \]

      3. +-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(-9, \color{blue}{\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, \color{blue}{\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, \color{blue}{\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, \color{blue}{\left(a \cdot b\right) \cdot 27}\right) \]

      11. *-commutative N/A

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

      12. lower-*.f64 83.9

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

   5. Applied rewrites 83.9%

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

   7. Applied rewrites 91.5%

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

Alternative 4: 85.7% accurate, 0.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])\\ \\ \begin{array}{l} t_1 := \mathsf{fma}\left(\left(y \cdot z\right) \cdot t, -9, 2 \cdot x\right)\\ t_2 := \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\\ t_3 := \left(b \cdot a\right) \cdot 27\\ \mathbf{if}\;t\_2 \leq -5 \cdot 10^{+16}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 \leq 200000000:\\ \;\;\;\;\mathsf{fma}\left(2, x, t\_3\right)\\ \mathbf{elif}\;t\_2 \leq 2 \cdot 10^{+299}:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-9, \left(t \cdot y\right) \cdot z, t\_3\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 (fma (* (* y z) t) -9.0 (* 2.0 x)))
        (t_2 (* (* (* y 9.0) z) t))
        (t_3 (* (* b a) 27.0)))
   (if (<= t_2 -5e+16)
     t_1
     (if (<= t_2 200000000.0)
       (fma 2.0 x t_3)
       (if (<= t_2 2e+299) t_1 (fma -9.0 (* (* t y) z) t_3))))))

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(((y * z) * t), -9.0, (2.0 * x));
	double t_2 = ((y * 9.0) * z) * t;
	double t_3 = (b * a) * 27.0;
	double tmp;
	if (t_2 <= -5e+16) {
		tmp = t_1;
	} else if (t_2 <= 200000000.0) {
		tmp = fma(2.0, x, t_3);
	} else if (t_2 <= 2e+299) {
		tmp = t_1;
	} else {
		tmp = fma(-9.0, ((t * y) * z), t_3);
	}
	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(Float64(Float64(y * z) * t), -9.0, Float64(2.0 * x))
	t_2 = Float64(Float64(Float64(y * 9.0) * z) * t)
	t_3 = Float64(Float64(b * a) * 27.0)
	tmp = 0.0
	if (t_2 <= -5e+16)
		tmp = t_1;
	elseif (t_2 <= 200000000.0)
		tmp = fma(2.0, x, t_3);
	elseif (t_2 <= 2e+299)
		tmp = t_1;
	else
		tmp = fma(-9.0, Float64(Float64(t * y) * z), t_3);
	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 * z), $MachinePrecision] * t), $MachinePrecision] * -9.0 + N[(2.0 * x), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(y * 9.0), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision]}, Block[{t$95$3 = N[(N[(b * a), $MachinePrecision] * 27.0), $MachinePrecision]}, If[LessEqual[t$95$2, -5e+16], t$95$1, If[LessEqual[t$95$2, 200000000.0], N[(2.0 * x + t$95$3), $MachinePrecision], If[LessEqual[t$95$2, 2e+299], t$95$1, N[(-9.0 * N[(N[(t * y), $MachinePrecision] * z), $MachinePrecision] + t$95$3), $MachinePrecision]]]]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < -5e16 or 2e8 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < 2.0000000000000001e299

   1. Initial program 91.9%

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

   3. Taylor expanded in y around 0

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

      1. lower-fma.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 36.4

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

   5. Applied rewrites 36.4%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 21.4%

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

   9. Taylor expanded in a around 0

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

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

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

       3. +-commutative N/A

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

       4. *-commutative N/A

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

       5. lower-fma.f64 N/A

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

       6. *-commutative N/A

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

       7. lower-*.f64 N/A

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

       8. lower-*.f64 N/A

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

       9. lower-*.f64 79.2

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

   11. Applied rewrites 79.2%

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

   if -5e16 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < 2e8

   1. Initial program 99.1%

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

   3. Taylor expanded in y around 0

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

      1. lower-fma.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 92.2

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

   5. Applied rewrites 92.2%

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

   if 2.0000000000000001e299 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t)

   1. Initial program 83.8%

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

   3. Taylor expanded in x around 0

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

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

         \[\leadsto \color{blue}{27 \cdot \left(a \cdot b\right) + \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) + \color{blue}{-9} \cdot \left(t \cdot \left(y \cdot z\right)\right) \]

      3. +-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(-9, \color{blue}{\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, \color{blue}{\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, \color{blue}{\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, \color{blue}{\left(a \cdot b\right) \cdot 27}\right) \]

      11. *-commutative N/A

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

      12. lower-*.f64 83.9

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

   5. Applied rewrites 83.9%

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

   7. Applied rewrites 91.7%

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

Alternative 5: 86.3% accurate, 0.5× 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^{+39}:\\ \;\;\;\;\mathsf{fma}\left(b \cdot 27, a, \left(\left(z \cdot y\right) \cdot -9\right) \cdot t\right)\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{-31}:\\ \;\;\;\;\mathsf{fma}\left(2, x, \left(b \cdot a\right) \cdot 27\right)\\ \mathbf{else}:\\ \;\;\;\;\left(z \cdot t\right) \cdot \left(y \cdot -9\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
 (let* ((t_1 (* (* (* y 9.0) z) t)))
   (if (<= t_1 -2e+39)
     (fma (* b 27.0) a (* (* (* z y) -9.0) t))
     (if (<= t_1 2e-31)
       (fma 2.0 x (* (* b a) 27.0))
       (+ (* (* z t) (* y -9.0)) (* (* 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 t_1 = ((y * 9.0) * z) * t;
	double tmp;
	if (t_1 <= -2e+39) {
		tmp = fma((b * 27.0), a, (((z * y) * -9.0) * t));
	} else if (t_1 <= 2e-31) {
		tmp = fma(2.0, x, ((b * a) * 27.0));
	} else {
		tmp = ((z * t) * (y * -9.0)) + ((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)
	t_1 = Float64(Float64(Float64(y * 9.0) * z) * t)
	tmp = 0.0
	if (t_1 <= -2e+39)
		tmp = fma(Float64(b * 27.0), a, Float64(Float64(Float64(z * y) * -9.0) * t));
	elseif (t_1 <= 2e-31)
		tmp = fma(2.0, x, Float64(Float64(b * a) * 27.0));
	else
		tmp = Float64(Float64(Float64(z * t) * Float64(y * -9.0)) + 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_] := Block[{t$95$1 = N[(N[(N[(y * 9.0), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+39], N[(N[(b * 27.0), $MachinePrecision] * a + N[(N[(N[(z * y), $MachinePrecision] * -9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e-31], N[(2.0 * x + N[(N[(b * a), $MachinePrecision] * 27.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(z * t), $MachinePrecision] * N[(y * -9.0), $MachinePrecision]), $MachinePrecision] + N[(N[(a * 27.0), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 85.6%

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

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 75.7

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

   5. Applied rewrites 75.7%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 79.4

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

   7. Applied rewrites 79.4%

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

   if -1.99999999999999988e39 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < 2e-31

   1. Initial program 99.0%

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

   3. Taylor expanded in y around 0

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

      1. lower-fma.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 92.7

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

   5. Applied rewrites 92.7%

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

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

   1. Initial program 94.4%

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

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 79.4

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

   5. Applied rewrites 79.4%

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

   7. Applied rewrites 76.4%

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

Alternative 6: 84.9% 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 -5 \cdot 10^{+16} \lor \neg \left(t\_1 \leq 200000000\right):\\ \;\;\;\;\mathsf{fma}\left(\left(y \cdot z\right) \cdot t, -9, 2 \cdot x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(2, x, \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 (or (<= t_1 -5e+16) (not (<= t_1 200000000.0)))
     (fma (* (* y z) t) -9.0 (* 2.0 x))
     (fma 2.0 x (* (* 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 <= -5e+16) || !(t_1 <= 200000000.0)) {
		tmp = fma(((y * z) * t), -9.0, (2.0 * x));
	} else {
		tmp = fma(2.0, x, ((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 <= -5e+16) || !(t_1 <= 200000000.0))
		tmp = fma(Float64(Float64(y * z) * t), -9.0, Float64(2.0 * x));
	else
		tmp = fma(2.0, x, 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[Or[LessEqual[t$95$1, -5e+16], N[Not[LessEqual[t$95$1, 200000000.0]], $MachinePrecision]], N[(N[(N[(y * z), $MachinePrecision] * t), $MachinePrecision] * -9.0 + N[(2.0 * x), $MachinePrecision]), $MachinePrecision], N[(2.0 * x + N[(N[(b * a), $MachinePrecision] * 27.0), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < -5e16 or 2e8 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t)

   1. Initial program 90.3%

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

   3. Taylor expanded in y around 0

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

      1. lower-fma.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 30.4

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

   5. Applied rewrites 30.4%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 18.4%

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

   9. Taylor expanded in a around 0

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

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

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

       3. +-commutative N/A

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

       4. *-commutative N/A

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

       5. lower-fma.f64 N/A

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

       6. *-commutative N/A

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

       7. lower-*.f64 N/A

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

       8. lower-*.f64 N/A

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

       9. lower-*.f64 81.7

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

   11. Applied rewrites 81.7%

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

   if -5e16 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < 2e8

   1. Initial program 99.1%

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

   3. Taylor expanded in y around 0

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

      1. lower-fma.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 92.2

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

   5. Applied rewrites 92.2%

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

4. Final simplification 87.2%

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

Alternative 7: 33.3% 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} \mathbf{if}\;\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \leq 5 \cdot 10^{+300}:\\ \;\;\;\;x + x\\ \mathbf{else}:\\ \;\;\;\;\left(x \cdot x\right) \cdot 4\\ \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 (<= (+ (- (* x 2.0) (* (* (* y 9.0) z) t)) (* (* a 27.0) b)) 5e+300)
   (+ x x)
   (* (* x x) 4.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 tmp;
	if ((((x * 2.0) - (((y * 9.0) * z) * t)) + ((a * 27.0) * b)) <= 5e+300) {
		tmp = x + x;
	} else {
		tmp = (x * x) * 4.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) :: tmp
    if ((((x * 2.0d0) - (((y * 9.0d0) * z) * t)) + ((a * 27.0d0) * b)) <= 5d+300) then
        tmp = x + x
    else
        tmp = (x * x) * 4.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 tmp;
	if ((((x * 2.0) - (((y * 9.0) * z) * t)) + ((a * 27.0) * b)) <= 5e+300) {
		tmp = x + x;
	} else {
		tmp = (x * x) * 4.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):
	tmp = 0
	if (((x * 2.0) - (((y * 9.0) * z) * t)) + ((a * 27.0) * b)) <= 5e+300:
		tmp = x + x
	else:
		tmp = (x * x) * 4.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)
	tmp = 0.0
	if (Float64(Float64(Float64(x * 2.0) - Float64(Float64(Float64(y * 9.0) * z) * t)) + Float64(Float64(a * 27.0) * b)) <= 5e+300)
		tmp = Float64(x + x);
	else
		tmp = Float64(Float64(x * x) * 4.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)
	tmp = 0.0;
	if ((((x * 2.0) - (((y * 9.0) * z) * t)) + ((a * 27.0) * b)) <= 5e+300)
		tmp = x + x;
	else
		tmp = (x * x) * 4.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_] := If[LessEqual[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], 5e+300], N[(x + x), $MachinePrecision], N[(N[(x * x), $MachinePrecision] * 4.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (-.f64 (*.f64 x #s(literal 2 binary64)) (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t)) (*.f64 (*.f64 a #s(literal 27 binary64)) b)) < 5.00000000000000026e300

   1. Initial program 98.4%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lower-fma.f64 98.4

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 98.4

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

      8. lift--.f64 N/A

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

      9. lift-*.f64 N/A

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

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

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

      11. +-commutative N/A

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

      12. lift-*.f64 N/A

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

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

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

      14. associate-*r* N/A

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

      15. *-commutative N/A

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

      16. associate-*r* N/A

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

      17. lower-fma.f64 N/A

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

   4. Applied rewrites 96.1%

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

      1. lift-fma.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. count-2-rev N/A

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

      4. associate-+r+ N/A

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

      5. lower-+.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. associate-*l* N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 93.9

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

      12. lift-*.f64 N/A

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

      13. *-commutative N/A

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

      14. lower-*.f64 93.9

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

   6. Applied rewrites 93.9%

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

   7. Taylor expanded in x around inf

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

      1. lower-*.f64 39.7

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

   9. Applied rewrites 39.7%

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

   11. Applied rewrites 39.7%

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

   if 5.00000000000000026e300 < (+.f64 (-.f64 (*.f64 x #s(literal 2 binary64)) (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t)) (*.f64 (*.f64 a #s(literal 27 binary64)) b))

   1. Initial program 79.3%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lower-fma.f64 87.8

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 87.8

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

      8. lift--.f64 N/A

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

      9. lift-*.f64 N/A

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

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

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

      11. +-commutative N/A

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

      12. lift-*.f64 N/A

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

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

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

      14. associate-*r* N/A

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

      15. *-commutative N/A

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

      16. associate-*r* N/A

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

      17. lower-fma.f64 N/A

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

   4. Applied rewrites 91.7%

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

      1. lift-fma.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. count-2-rev N/A

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

      4. associate-+r+ N/A

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

      5. lower-+.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. associate-*l* N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 93.8

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

      12. lift-*.f64 N/A

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

      13. *-commutative N/A

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

      14. lower-*.f64 93.8

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

   6. Applied rewrites 93.8%

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

   7. Taylor expanded in x around inf

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

      1. lower-*.f64 4.6

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

   9. Applied rewrites 4.6%

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

   11. Applied rewrites 15.7%

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

Alternative 8: 98.0% accurate, 0.8× 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}\;\left(y \cdot 9\right) \cdot z \leq 2 \cdot 10^{+289}:\\ \;\;\;\;\mathsf{fma}\left(-9 \cdot \left(z \cdot y\right), t, \mathsf{fma}\left(b \cdot 27, a, x + x\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(t \cdot \left(y \cdot -9\right), z, \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
 (if (<= (* (* y 9.0) z) 2e+289)
   (fma (* -9.0 (* z y)) t (fma (* b 27.0) a (+ x x)))
   (fma (* t (* y -9.0)) z (* (* 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 tmp;
	if (((y * 9.0) * z) <= 2e+289) {
		tmp = fma((-9.0 * (z * y)), t, fma((b * 27.0), a, (x + x)));
	} else {
		tmp = fma((t * (y * -9.0)), z, ((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)
	tmp = 0.0
	if (Float64(Float64(y * 9.0) * z) <= 2e+289)
		tmp = fma(Float64(-9.0 * Float64(z * y)), t, fma(Float64(b * 27.0), a, Float64(x + x)));
	else
		tmp = fma(Float64(t * Float64(y * -9.0)), z, 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_] := If[LessEqual[N[(N[(y * 9.0), $MachinePrecision] * z), $MachinePrecision], 2e+289], N[(N[(-9.0 * N[(z * y), $MachinePrecision]), $MachinePrecision] * t + N[(N[(b * 27.0), $MachinePrecision] * a + N[(x + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t * N[(y * -9.0), $MachinePrecision]), $MachinePrecision] * z + N[(N[(b * a), $MachinePrecision] * 27.0), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 y #s(literal 9 binary64)) z) < 2.0000000000000001e289

   1. Initial program 95.8%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift--.f64 N/A

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

      4. lift-*.f64 N/A

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

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

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

      6. associate-+r+ N/A

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

      7. +-commutative N/A

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

      8. lower-fma.f64 N/A

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

      9. lift-*.f64 N/A

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

      10. lift-*.f64 N/A

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

      11. *-commutative N/A

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

      12. associate-*l* N/A

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

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

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

      14. *-commutative N/A

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

      15. lower-*.f64 N/A

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

      16. metadata-eval N/A

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

      17. lower-*.f64 N/A

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

      18. lift-*.f64 N/A

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

      19. lift-*.f64 N/A

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

      20. associate-*l* N/A

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

      21. *-commutative N/A

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

      22. lower-fma.f64 N/A

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

   4. Applied rewrites 95.8%

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

      1. lift-*.f64 N/A

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

      2. count-2-rev N/A

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

      3. lower-+.f64 95.8

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

   6. Applied rewrites 95.8%

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

   if 2.0000000000000001e289 < (*.f64 (*.f64 y #s(literal 9 binary64)) z)

   1. Initial program 77.8%

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

   3. Taylor expanded in x around 0

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

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

         \[\leadsto \color{blue}{27 \cdot \left(a \cdot b\right) + \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) + \color{blue}{-9} \cdot \left(t \cdot \left(y \cdot z\right)\right) \]

      3. +-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(-9, \color{blue}{\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, \color{blue}{\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, \color{blue}{\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, \color{blue}{\left(a \cdot b\right) \cdot 27}\right) \]

      11. *-commutative N/A

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

      12. lower-*.f64 77.9

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

   5. Applied rewrites 77.9%

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

   7. Applied rewrites 92.2%

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

Alternative 9: 52.7% 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\\ \mathbf{if}\;t\_1 \leq -2.4 \cdot 10^{+50} \lor \neg \left(t\_1 \leq 1.3 \cdot 10^{+124}\right):\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;x + x\\ \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)))
   (if (or (<= t_1 -2.4e+50) (not (<= t_1 1.3e+124))) t_1 (+ 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 = (a * 27.0) * b;
	double tmp;
	if ((t_1 <= -2.4e+50) || !(t_1 <= 1.3e+124)) {
		tmp = t_1;
	} else {
		tmp = x + x;
	}
	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 = (a * 27.0d0) * b
    if ((t_1 <= (-2.4d+50)) .or. (.not. (t_1 <= 1.3d+124))) then
        tmp = t_1
    else
        tmp = x + x
    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 tmp;
	if ((t_1 <= -2.4e+50) || !(t_1 <= 1.3e+124)) {
		tmp = t_1;
	} else {
		tmp = x + x;
	}
	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
	tmp = 0
	if (t_1 <= -2.4e+50) or not (t_1 <= 1.3e+124):
		tmp = t_1
	else:
		tmp = 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(a * 27.0) * b)
	tmp = 0.0
	if ((t_1 <= -2.4e+50) || !(t_1 <= 1.3e+124))
		tmp = t_1;
	else
		tmp = Float64(x + x);
	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;
	tmp = 0.0;
	if ((t_1 <= -2.4e+50) || ~((t_1 <= 1.3e+124)))
		tmp = t_1;
	else
		tmp = x + x;
	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]}, If[Or[LessEqual[t$95$1, -2.4e+50], N[Not[LessEqual[t$95$1, 1.3e+124]], $MachinePrecision]], t$95$1, N[(x + x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 a #s(literal 27 binary64)) b) < -2.4000000000000002e50 or 1.3e124 < (*.f64 (*.f64 a #s(literal 27 binary64)) b)

   1. Initial program 89.0%

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

   3. Taylor expanded in y around 0

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

      1. lower-fma.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 79.6

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

   5. Applied rewrites 79.6%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 72.7%

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

   10. Applied rewrites 72.7%

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

   if -2.4000000000000002e50 < (*.f64 (*.f64 a #s(literal 27 binary64)) b) < 1.3e124

   1. Initial program 97.6%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lower-fma.f64 97.6

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 97.6

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

      8. lift--.f64 N/A

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

      9. lift-*.f64 N/A

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

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

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

      11. +-commutative N/A

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

      12. lift-*.f64 N/A

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

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

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

      14. associate-*r* N/A

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

      15. *-commutative N/A

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

      16. associate-*r* N/A

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

      17. lower-fma.f64 N/A

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

   4. Applied rewrites 96.0%

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

      1. lift-fma.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. count-2-rev N/A

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

      4. associate-+r+ N/A

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

      5. lower-+.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. associate-*l* N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 94.5

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

      12. lift-*.f64 N/A

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

      13. *-commutative N/A

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

      14. lower-*.f64 94.5

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

   6. Applied rewrites 94.5%

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

   7. Taylor expanded in x around inf

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

      1. lower-*.f64 44.7

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

   9. Applied rewrites 44.7%

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

   11. Applied rewrites 44.7%

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

4. Final simplification 53.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(a \cdot 27\right) \cdot b \leq -2.4 \cdot 10^{+50} \lor \neg \left(\left(a \cdot 27\right) \cdot b \leq 1.3 \cdot 10^{+124}\right):\\ \;\;\;\;\left(a \cdot 27\right) \cdot b\\ \mathbf{else}:\\ \;\;\;\;x + x\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 52.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} t_1 := \left(a \cdot 27\right) \cdot b\\ \mathbf{if}\;t\_1 \leq -2 \cdot 10^{+58}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+124}:\\ \;\;\;\;x + x\\ \mathbf{else}:\\ \;\;\;\;\left(b \cdot a\right) \cdot 27\\ \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)))
   (if (<= t_1 -2e+58) t_1 (if (<= t_1 2e+124) (+ x x) (* (* 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 = (a * 27.0) * b;
	double tmp;
	if (t_1 <= -2e+58) {
		tmp = t_1;
	} else if (t_1 <= 2e+124) {
		tmp = x + x;
	} else {
		tmp = (b * a) * 27.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 = (a * 27.0d0) * b
    if (t_1 <= (-2d+58)) then
        tmp = t_1
    else if (t_1 <= 2d+124) then
        tmp = x + x
    else
        tmp = (b * a) * 27.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 = (a * 27.0) * b;
	double tmp;
	if (t_1 <= -2e+58) {
		tmp = t_1;
	} else if (t_1 <= 2e+124) {
		tmp = x + x;
	} else {
		tmp = (b * a) * 27.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 = (a * 27.0) * b
	tmp = 0
	if t_1 <= -2e+58:
		tmp = t_1
	elif t_1 <= 2e+124:
		tmp = x + x
	else:
		tmp = (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(a * 27.0) * b)
	tmp = 0.0
	if (t_1 <= -2e+58)
		tmp = t_1;
	elseif (t_1 <= 2e+124)
		tmp = Float64(x + x);
	else
		tmp = Float64(Float64(b * a) * 27.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 = (a * 27.0) * b;
	tmp = 0.0;
	if (t_1 <= -2e+58)
		tmp = t_1;
	elseif (t_1 <= 2e+124)
		tmp = x + x;
	else
		tmp = (b * a) * 27.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[(a * 27.0), $MachinePrecision] * b), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+58], t$95$1, If[LessEqual[t$95$1, 2e+124], N[(x + x), $MachinePrecision], N[(N[(b * a), $MachinePrecision] * 27.0), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 82.6%

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

   3. Taylor expanded in y around 0

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

      1. lower-fma.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 77.8

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

   5. Applied rewrites 77.8%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 73.0%

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

   10. Applied rewrites 73.0%

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

   if -1.99999999999999989e58 < (*.f64 (*.f64 a #s(literal 27 binary64)) b) < 1.9999999999999999e124

   1. Initial program 97.6%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lower-fma.f64 97.6

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 97.6

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

      8. lift--.f64 N/A

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

      9. lift-*.f64 N/A

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

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

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

      11. +-commutative N/A

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

      12. lift-*.f64 N/A

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

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

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

      14. associate-*r* N/A

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

      15. *-commutative N/A

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

      16. associate-*r* N/A

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

      17. lower-fma.f64 N/A

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

   4. Applied rewrites 96.0%

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

      1. lift-fma.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. count-2-rev N/A

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

      4. associate-+r+ N/A

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

      5. lower-+.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. associate-*l* N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 94.5

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

      12. lift-*.f64 N/A

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

      13. *-commutative N/A

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

      14. lower-*.f64 94.5

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

   6. Applied rewrites 94.5%

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

   7. Taylor expanded in x around inf

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

      1. lower-*.f64 44.7

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

   9. Applied rewrites 44.7%

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

   11. Applied rewrites 44.7%

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

   if 1.9999999999999999e124 < (*.f64 (*.f64 a #s(literal 27 binary64)) b)

   1. Initial program 95.0%

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

   3. Taylor expanded in y around 0

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

      1. lower-fma.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 81.3

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

   5. Applied rewrites 81.3%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 72.5%

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

Alternative 11: 52.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} t_1 := \left(a \cdot 27\right) \cdot b\\ \mathbf{if}\;t\_1 \leq -2 \cdot 10^{+58}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+124}:\\ \;\;\;\;x + x\\ \mathbf{else}:\\ \;\;\;\;\left(b \cdot 27\right) \cdot a\\ \end{array} \end{array} \]

FPCore

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

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 tmp;
	if (t_1 <= -2e+58) {
		tmp = t_1;
	} else if (t_1 <= 2e+124) {
		tmp = x + x;
	} else {
		tmp = (b * 27.0) * a;
	}
	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 = (a * 27.0d0) * b
    if (t_1 <= (-2d+58)) then
        tmp = t_1
    else if (t_1 <= 2d+124) then
        tmp = x + x
    else
        tmp = (b * 27.0d0) * a
    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 tmp;
	if (t_1 <= -2e+58) {
		tmp = t_1;
	} else if (t_1 <= 2e+124) {
		tmp = x + x;
	} else {
		tmp = (b * 27.0) * a;
	}
	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
	tmp = 0
	if t_1 <= -2e+58:
		tmp = t_1
	elif t_1 <= 2e+124:
		tmp = x + x
	else:
		tmp = (b * 27.0) * a
	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)
	tmp = 0.0
	if (t_1 <= -2e+58)
		tmp = t_1;
	elseif (t_1 <= 2e+124)
		tmp = Float64(x + x);
	else
		tmp = Float64(Float64(b * 27.0) * a);
	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;
	tmp = 0.0;
	if (t_1 <= -2e+58)
		tmp = t_1;
	elseif (t_1 <= 2e+124)
		tmp = x + x;
	else
		tmp = (b * 27.0) * a;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 82.6%

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

   3. Taylor expanded in y around 0

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

      1. lower-fma.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 77.8

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

   5. Applied rewrites 77.8%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 73.0%

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

   10. Applied rewrites 73.0%

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

   if -1.99999999999999989e58 < (*.f64 (*.f64 a #s(literal 27 binary64)) b) < 1.9999999999999999e124

   1. Initial program 97.6%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lower-fma.f64 97.6

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 97.6

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

      8. lift--.f64 N/A

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

      9. lift-*.f64 N/A

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

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

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

      11. +-commutative N/A

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

      12. lift-*.f64 N/A

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

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

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

      14. associate-*r* N/A

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

      15. *-commutative N/A

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

      16. associate-*r* N/A

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

      17. lower-fma.f64 N/A

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

   4. Applied rewrites 96.0%

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

      1. lift-fma.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. count-2-rev N/A

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

      4. associate-+r+ N/A

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

      5. lower-+.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. associate-*l* N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 94.5

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

      12. lift-*.f64 N/A

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

      13. *-commutative N/A

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

      14. lower-*.f64 94.5

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

   6. Applied rewrites 94.5%

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

   7. Taylor expanded in x around inf

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

      1. lower-*.f64 44.7

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

   9. Applied rewrites 44.7%

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

   11. Applied rewrites 44.7%

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

   if 1.9999999999999999e124 < (*.f64 (*.f64 a #s(literal 27 binary64)) b)

   1. Initial program 95.0%

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

   3. Taylor expanded in y around 0

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

      1. lower-fma.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 81.3

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

   5. Applied rewrites 81.3%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 72.5%

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

   10. Applied rewrites 70.1%

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

Alternative 12: 64.1% accurate, 2.2× 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])\\ \\ \mathsf{fma}\left(2, x, \left(b \cdot a\right) \cdot 27\right) \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 (fma 2.0 x (* (* 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) {
	return fma(2.0, x, ((b * a) * 27.0));
}

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 fma(2.0, x, Float64(Float64(b * a) * 27.0))
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[(2.0 * x + N[(N[(b * a), $MachinePrecision] * 27.0), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 94.8%

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

3. Taylor expanded in y around 0

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

   1. lower-fma.f64 N/A

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

   2. *-commutative N/A

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

   3. lower-*.f64 N/A

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

   4. *-commutative N/A

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

   5. lower-*.f64 62.5

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

5. Applied rewrites 62.5%

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

Alternative 13: 64.1% accurate, 2.5× 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])\\ \\ \mathsf{fma}\left(b \cdot 27, a, x\right) + 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 (+ (fma (* b 27.0) a 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 fma((b * 27.0), a, 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(fma(Float64(b * 27.0), a, 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[(N[(N[(b * 27.0), $MachinePrecision] * a + x), $MachinePrecision] + x), $MachinePrecision]

Derivation

1. Initial program 94.8%

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

3. Taylor expanded in y around 0

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

   1. lower-fma.f64 N/A

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

   2. *-commutative N/A

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

   3. lower-*.f64 N/A

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

   4. *-commutative N/A

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

   5. lower-*.f64 62.5

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

5. Applied rewrites 62.5%

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

7. Applied rewrites 62.2%

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

Alternative 14: 30.6% accurate, 9.3× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, 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 94.8%

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

   1. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-*.f64 N/A

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

   4. lower-fma.f64 96.4

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

   5. lift-*.f64 N/A

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

   6. *-commutative N/A

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

   7. lower-*.f64 96.4

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

   8. lift--.f64 N/A

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

   9. lift-*.f64 N/A

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

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

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

   11. +-commutative N/A

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

   12. lift-*.f64 N/A

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

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

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

   14. associate-*r* N/A

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

   15. *-commutative N/A

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

   16. associate-*r* N/A

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

   17. lower-fma.f64 N/A

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

4. Applied rewrites 95.3%

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

   1. lift-fma.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. count-2-rev N/A

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

   4. associate-+r+ N/A

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

   5. lower-+.f64 N/A

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

   6. lift-*.f64 N/A

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

   7. associate-*l* N/A

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

   8. *-commutative N/A

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

   9. lower-fma.f64 N/A

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

   10. *-commutative N/A

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

   11. lower-*.f64 93.9

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

   12. lift-*.f64 N/A

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

   13. *-commutative N/A

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

   14. lower-*.f64 93.9

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

6. Applied rewrites 93.9%

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

7. Taylor expanded in x around inf

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

   1. lower-*.f64 33.3

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

9. Applied rewrites 33.3%

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

11. Applied rewrites 33.3%

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

Developer Target 1: 94.9% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a, b)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (y < 7.590524218811189d-161) then
        tmp = ((x * 2.0d0) - (((y * 9.0d0) * z) * t)) + (a * (27.0d0 * b))
    else
        tmp = ((x * 2.0d0) - (9.0d0 * (y * (t * z)))) + ((a * 27.0d0) * b)
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

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

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

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