FastMath dist4

Percentage Accurate: 87.7% → 96.5%

Time: 3.8s

Alternatives: 10

Speedup: 1.2×

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

Specification

Math

\[\begin{array}{l} \\ \left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \end{array} \]

FPCore

(FPCore (d1 d2 d3 d4)
 :precision binary64
 (- (+ (- (* d1 d2) (* d1 d3)) (* d4 d1)) (* d1 d1)))

C

double code(double d1, double d2, double d3, double d4) {
	return (((d1 * d2) - (d1 * d3)) + (d4 * d1)) - (d1 * d1);
}

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(d1, d2, d3, d4)
use fmin_fmax_functions
    real(8), intent (in) :: d1
    real(8), intent (in) :: d2
    real(8), intent (in) :: d3
    real(8), intent (in) :: d4
    code = (((d1 * d2) - (d1 * d3)) + (d4 * d1)) - (d1 * d1)
end function

Java

public static double code(double d1, double d2, double d3, double d4) {
	return (((d1 * d2) - (d1 * d3)) + (d4 * d1)) - (d1 * d1);
}

Python

def code(d1, d2, d3, d4):
	return (((d1 * d2) - (d1 * d3)) + (d4 * d1)) - (d1 * d1)

Julia

function code(d1, d2, d3, d4)
	return Float64(Float64(Float64(Float64(d1 * d2) - Float64(d1 * d3)) + Float64(d4 * d1)) - Float64(d1 * d1))
end

MATLAB

function tmp = code(d1, d2, d3, d4)
	tmp = (((d1 * d2) - (d1 * d3)) + (d4 * d1)) - (d1 * d1);
end

Wolfram

code[d1_, d2_, d3_, d4_] := N[(N[(N[(N[(d1 * d2), $MachinePrecision] - N[(d1 * d3), $MachinePrecision]), $MachinePrecision] + N[(d4 * d1), $MachinePrecision]), $MachinePrecision] - N[(d1 * d1), $MachinePrecision]), $MachinePrecision]

Initial Program: 87.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \end{array} \]

FPCore

(FPCore (d1 d2 d3 d4)
 :precision binary64
 (- (+ (- (* d1 d2) (* d1 d3)) (* d4 d1)) (* d1 d1)))

C

double code(double d1, double d2, double d3, double d4) {
	return (((d1 * d2) - (d1 * d3)) + (d4 * d1)) - (d1 * d1);
}

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(d1, d2, d3, d4)
use fmin_fmax_functions
    real(8), intent (in) :: d1
    real(8), intent (in) :: d2
    real(8), intent (in) :: d3
    real(8), intent (in) :: d4
    code = (((d1 * d2) - (d1 * d3)) + (d4 * d1)) - (d1 * d1)
end function

Java

public static double code(double d1, double d2, double d3, double d4) {
	return (((d1 * d2) - (d1 * d3)) + (d4 * d1)) - (d1 * d1);
}

Python

def code(d1, d2, d3, d4):
	return (((d1 * d2) - (d1 * d3)) + (d4 * d1)) - (d1 * d1)

Julia

function code(d1, d2, d3, d4)
	return Float64(Float64(Float64(Float64(d1 * d2) - Float64(d1 * d3)) + Float64(d4 * d1)) - Float64(d1 * d1))
end

MATLAB

function tmp = code(d1, d2, d3, d4)
	tmp = (((d1 * d2) - (d1 * d3)) + (d4 * d1)) - (d1 * d1);
end

Wolfram

code[d1_, d2_, d3_, d4_] := N[(N[(N[(N[(d1 * d2), $MachinePrecision] - N[(d1 * d3), $MachinePrecision]), $MachinePrecision] + N[(d4 * d1), $MachinePrecision]), $MachinePrecision] - N[(d1 * d1), $MachinePrecision]), $MachinePrecision]

Alternative 1: 96.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} [d1, d2, d3, d4] = \mathsf{sort}([d1, d2, d3, d4])\\ \\ \begin{array}{l} \mathbf{if}\;d4 \leq 5 \cdot 10^{+198}:\\ \;\;\;\;\mathsf{fma}\left(d2 - d3, d1, \mathsf{fma}\left(d4, d1, \left(-d1\right) \cdot d1\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\left(d4 + d2\right) - d3\right) \cdot d1\\ \end{array} \end{array} \]

FPCore

NOTE: d1, d2, d3, and d4 should be sorted in increasing order before calling this function.
(FPCore (d1 d2 d3 d4)
 :precision binary64
 (if (<= d4 5e+198)
   (fma (- d2 d3) d1 (fma d4 d1 (* (- d1) d1)))
   (* (- (+ d4 d2) d3) d1)))

C

assert(d1 < d2 && d2 < d3 && d3 < d4);
double code(double d1, double d2, double d3, double d4) {
	double tmp;
	if (d4 <= 5e+198) {
		tmp = fma((d2 - d3), d1, fma(d4, d1, (-d1 * d1)));
	} else {
		tmp = ((d4 + d2) - d3) * d1;
	}
	return tmp;
}

Julia

d1, d2, d3, d4 = sort([d1, d2, d3, d4])
function code(d1, d2, d3, d4)
	tmp = 0.0
	if (d4 <= 5e+198)
		tmp = fma(Float64(d2 - d3), d1, fma(d4, d1, Float64(Float64(-d1) * d1)));
	else
		tmp = Float64(Float64(Float64(d4 + d2) - d3) * d1);
	end
	return tmp
end

Wolfram

NOTE: d1, d2, d3, and d4 should be sorted in increasing order before calling this function.
code[d1_, d2_, d3_, d4_] := If[LessEqual[d4, 5e+198], N[(N[(d2 - d3), $MachinePrecision] * d1 + N[(d4 * d1 + N[((-d1) * d1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(d4 + d2), $MachinePrecision] - d3), $MachinePrecision] * d1), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if d4 < 5.00000000000000049e198

   1. Initial program 86.0%

      \[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. pow2 N/A

         \[\leadsto \left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - \color{blue}{{d1}^{2}} \]

      2. associate--l+ N/A

         \[\leadsto \color{blue}{\left(d1 \cdot d2 - d1 \cdot d3\right) + \left(d4 \cdot d1 - {d1}^{2}\right)} \]

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

         \[\leadsto \color{blue}{d1 \cdot \left(d2 - d3\right)} + \left(d4 \cdot d1 - {d1}^{2}\right) \]

      4. *-commutative N/A

         \[\leadsto \color{blue}{\left(d2 - d3\right) \cdot d1} + \left(d4 \cdot d1 - {d1}^{2}\right) \]

      5. *-commutative N/A

         \[\leadsto \left(d2 - d3\right) \cdot d1 + \left(\color{blue}{d1 \cdot d4} - {d1}^{2}\right) \]

      6. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(d2 - d3, d1, d1 \cdot d4 - {d1}^{2}\right)} \]

      7. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{d2 - d3}, d1, d1 \cdot d4 - {d1}^{2}\right) \]

      8. pow2 N/A

         \[\leadsto \mathsf{fma}\left(d2 - d3, d1, d1 \cdot d4 - \color{blue}{d1 \cdot d1}\right) \]

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

         \[\leadsto \mathsf{fma}\left(d2 - d3, d1, \color{blue}{d1 \cdot d4 + \left(\mathsf{neg}\left(d1\right)\right) \cdot d1}\right) \]

      10. *-commutative N/A

          \[\leadsto \mathsf{fma}\left(d2 - d3, d1, \color{blue}{d4 \cdot d1} + \left(\mathsf{neg}\left(d1\right)\right) \cdot d1\right) \]

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

          \[\leadsto \mathsf{fma}\left(d2 - d3, d1, d4 \cdot d1 + \color{blue}{\left(\mathsf{neg}\left(d1 \cdot d1\right)\right)}\right) \]

      12. pow2 N/A

          \[\leadsto \mathsf{fma}\left(d2 - d3, d1, d4 \cdot d1 + \left(\mathsf{neg}\left(\color{blue}{{d1}^{2}}\right)\right)\right) \]

      13. lower-fma.f64 N/A

          \[\leadsto \mathsf{fma}\left(d2 - d3, d1, \color{blue}{\mathsf{fma}\left(d4, d1, \mathsf{neg}\left({d1}^{2}\right)\right)}\right) \]

      14. pow2 N/A

          \[\leadsto \mathsf{fma}\left(d2 - d3, d1, \mathsf{fma}\left(d4, d1, \mathsf{neg}\left(\color{blue}{d1 \cdot d1}\right)\right)\right) \]

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

          \[\leadsto \mathsf{fma}\left(d2 - d3, d1, \mathsf{fma}\left(d4, d1, \color{blue}{\left(\mathsf{neg}\left(d1\right)\right) \cdot d1}\right)\right) \]

      16. mul-1-neg N/A

          \[\leadsto \mathsf{fma}\left(d2 - d3, d1, \mathsf{fma}\left(d4, d1, \color{blue}{\left(-1 \cdot d1\right)} \cdot d1\right)\right) \]

      17. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(d2 - d3, d1, \mathsf{fma}\left(d4, d1, \color{blue}{\left(-1 \cdot d1\right) \cdot d1}\right)\right) \]

      18. mul-1-neg N/A

          \[\leadsto \mathsf{fma}\left(d2 - d3, d1, \mathsf{fma}\left(d4, d1, \color{blue}{\left(\mathsf{neg}\left(d1\right)\right)} \cdot d1\right)\right) \]

      19. lower-neg.f64 96.4

          \[\leadsto \mathsf{fma}\left(d2 - d3, d1, \mathsf{fma}\left(d4, d1, \color{blue}{\left(-d1\right)} \cdot d1\right)\right) \]

   4. Applied rewrites 96.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(d2 - d3, d1, \mathsf{fma}\left(d4, d1, \left(-d1\right) \cdot d1\right)\right)} \]

   if 5.00000000000000049e198 < d4

   1. Initial program 80.0%

      \[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]
   2. Add Preprocessing

   3. Taylor expanded in d1 around 0

      \[\leadsto \color{blue}{d1 \cdot \left(\left(d2 + d4\right) - d3\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(\left(d2 + d4\right) - d3\right) \cdot \color{blue}{d1} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(\left(d2 + d4\right) - d3\right) \cdot \color{blue}{d1} \]

      3. lower--.f64 N/A

         \[\leadsto \left(\left(d2 + d4\right) - d3\right) \cdot d1 \]

      4. +-commutative N/A

         \[\leadsto \left(\left(d4 + d2\right) - d3\right) \cdot d1 \]

      5. lower-+.f64 100.0

         \[\leadsto \left(\left(d4 + d2\right) - d3\right) \cdot d1 \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\left(\left(d4 + d2\right) - d3\right) \cdot d1} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 89.6% accurate, 1.1× speedup

Math

\[\begin{array}{l} [d1, d2, d3, d4] = \mathsf{sort}([d1, d2, d3, d4])\\ \\ \begin{array}{l} \mathbf{if}\;d1 \leq -8.5 \cdot 10^{+100}:\\ \;\;\;\;\mathsf{fma}\left(d1, d4 - d3, \left(-d1\right) \cdot d1\right)\\ \mathbf{elif}\;d1 \leq 1.45 \cdot 10^{+138}:\\ \;\;\;\;\mathsf{fma}\left(d2 - d3, d1, d4 \cdot d1\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\left(-d1\right) + d4\right) \cdot d1\\ \end{array} \end{array} \]

FPCore

NOTE: d1, d2, d3, and d4 should be sorted in increasing order before calling this function.
(FPCore (d1 d2 d3 d4)
 :precision binary64
 (if (<= d1 -8.5e+100)
   (fma d1 (- d4 d3) (* (- d1) d1))
   (if (<= d1 1.45e+138) (fma (- d2 d3) d1 (* d4 d1)) (* (+ (- d1) d4) d1))))

C

assert(d1 < d2 && d2 < d3 && d3 < d4);
double code(double d1, double d2, double d3, double d4) {
	double tmp;
	if (d1 <= -8.5e+100) {
		tmp = fma(d1, (d4 - d3), (-d1 * d1));
	} else if (d1 <= 1.45e+138) {
		tmp = fma((d2 - d3), d1, (d4 * d1));
	} else {
		tmp = (-d1 + d4) * d1;
	}
	return tmp;
}

Julia

d1, d2, d3, d4 = sort([d1, d2, d3, d4])
function code(d1, d2, d3, d4)
	tmp = 0.0
	if (d1 <= -8.5e+100)
		tmp = fma(d1, Float64(d4 - d3), Float64(Float64(-d1) * d1));
	elseif (d1 <= 1.45e+138)
		tmp = fma(Float64(d2 - d3), d1, Float64(d4 * d1));
	else
		tmp = Float64(Float64(Float64(-d1) + d4) * d1);
	end
	return tmp
end

Wolfram

NOTE: d1, d2, d3, and d4 should be sorted in increasing order before calling this function.
code[d1_, d2_, d3_, d4_] := If[LessEqual[d1, -8.5e+100], N[(d1 * N[(d4 - d3), $MachinePrecision] + N[((-d1) * d1), $MachinePrecision]), $MachinePrecision], If[LessEqual[d1, 1.45e+138], N[(N[(d2 - d3), $MachinePrecision] * d1 + N[(d4 * d1), $MachinePrecision]), $MachinePrecision], N[(N[((-d1) + d4), $MachinePrecision] * d1), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if d1 < -8.50000000000000043e100

   1. Initial program 51.2%

      \[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]
   2. Add Preprocessing

   3. Taylor expanded in d2 around 0

      \[\leadsto \color{blue}{d1 \cdot d4 - \left(d1 \cdot d3 + {d1}^{2}\right)} \]
   4. Step-by-step derivation

      1. associate--r+ N/A

         \[\leadsto \left(d1 \cdot d4 - d1 \cdot d3\right) - \color{blue}{{d1}^{2}} \]

      2. pow2 N/A

         \[\leadsto \left(d1 \cdot d4 - d1 \cdot d3\right) - d1 \cdot \color{blue}{d1} \]

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

         \[\leadsto \left(d1 \cdot d4 - d1 \cdot d3\right) + \color{blue}{\left(\mathsf{neg}\left(d1\right)\right) \cdot d1} \]

      4. distribute-lft-out-- N/A

         \[\leadsto d1 \cdot \left(d4 - d3\right) + \color{blue}{\left(\mathsf{neg}\left(d1\right)\right)} \cdot d1 \]

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

         \[\leadsto d1 \cdot \left(d4 - d3\right) + \left(\mathsf{neg}\left(d1 \cdot d1\right)\right) \]

      6. pow2 N/A

         \[\leadsto d1 \cdot \left(d4 - d3\right) + \left(\mathsf{neg}\left({d1}^{2}\right)\right) \]

      7. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(d1, \color{blue}{d4 - d3}, \mathsf{neg}\left({d1}^{2}\right)\right) \]

      8. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(d1, d4 - \color{blue}{d3}, \mathsf{neg}\left({d1}^{2}\right)\right) \]

      9. pow2 N/A

         \[\leadsto \mathsf{fma}\left(d1, d4 - d3, \mathsf{neg}\left(d1 \cdot d1\right)\right) \]

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

          \[\leadsto \mathsf{fma}\left(d1, d4 - d3, \left(\mathsf{neg}\left(d1\right)\right) \cdot d1\right) \]

      11. mul-1-neg N/A

          \[\leadsto \mathsf{fma}\left(d1, d4 - d3, \left(-1 \cdot d1\right) \cdot d1\right) \]

      12. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(d1, d4 - d3, \left(-1 \cdot d1\right) \cdot d1\right) \]

      13. mul-1-neg N/A

          \[\leadsto \mathsf{fma}\left(d1, d4 - d3, \left(\mathsf{neg}\left(d1\right)\right) \cdot d1\right) \]

      14. lower-neg.f64 81.6

          \[\leadsto \mathsf{fma}\left(d1, d4 - d3, \left(-d1\right) \cdot d1\right) \]

   5. Applied rewrites 81.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(d1, d4 - d3, \left(-d1\right) \cdot d1\right)} \]

   if -8.50000000000000043e100 < d1 < 1.45000000000000005e138

   1. Initial program 100.0%

      \[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. pow2 N/A

         \[\leadsto \left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - \color{blue}{{d1}^{2}} \]

      2. associate--l+ N/A

         \[\leadsto \color{blue}{\left(d1 \cdot d2 - d1 \cdot d3\right) + \left(d4 \cdot d1 - {d1}^{2}\right)} \]

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

         \[\leadsto \color{blue}{d1 \cdot \left(d2 - d3\right)} + \left(d4 \cdot d1 - {d1}^{2}\right) \]

      4. *-commutative N/A

         \[\leadsto \color{blue}{\left(d2 - d3\right) \cdot d1} + \left(d4 \cdot d1 - {d1}^{2}\right) \]

      5. *-commutative N/A

         \[\leadsto \left(d2 - d3\right) \cdot d1 + \left(\color{blue}{d1 \cdot d4} - {d1}^{2}\right) \]

      6. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(d2 - d3, d1, d1 \cdot d4 - {d1}^{2}\right)} \]

      7. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{d2 - d3}, d1, d1 \cdot d4 - {d1}^{2}\right) \]

      8. pow2 N/A

         \[\leadsto \mathsf{fma}\left(d2 - d3, d1, d1 \cdot d4 - \color{blue}{d1 \cdot d1}\right) \]

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

         \[\leadsto \mathsf{fma}\left(d2 - d3, d1, \color{blue}{d1 \cdot d4 + \left(\mathsf{neg}\left(d1\right)\right) \cdot d1}\right) \]

      10. *-commutative N/A

          \[\leadsto \mathsf{fma}\left(d2 - d3, d1, \color{blue}{d4 \cdot d1} + \left(\mathsf{neg}\left(d1\right)\right) \cdot d1\right) \]

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

          \[\leadsto \mathsf{fma}\left(d2 - d3, d1, d4 \cdot d1 + \color{blue}{\left(\mathsf{neg}\left(d1 \cdot d1\right)\right)}\right) \]

      12. pow2 N/A

          \[\leadsto \mathsf{fma}\left(d2 - d3, d1, d4 \cdot d1 + \left(\mathsf{neg}\left(\color{blue}{{d1}^{2}}\right)\right)\right) \]

      13. lower-fma.f64 N/A

          \[\leadsto \mathsf{fma}\left(d2 - d3, d1, \color{blue}{\mathsf{fma}\left(d4, d1, \mathsf{neg}\left({d1}^{2}\right)\right)}\right) \]

      14. pow2 N/A

          \[\leadsto \mathsf{fma}\left(d2 - d3, d1, \mathsf{fma}\left(d4, d1, \mathsf{neg}\left(\color{blue}{d1 \cdot d1}\right)\right)\right) \]

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

          \[\leadsto \mathsf{fma}\left(d2 - d3, d1, \mathsf{fma}\left(d4, d1, \color{blue}{\left(\mathsf{neg}\left(d1\right)\right) \cdot d1}\right)\right) \]

      16. mul-1-neg N/A

          \[\leadsto \mathsf{fma}\left(d2 - d3, d1, \mathsf{fma}\left(d4, d1, \color{blue}{\left(-1 \cdot d1\right)} \cdot d1\right)\right) \]

      17. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(d2 - d3, d1, \mathsf{fma}\left(d4, d1, \color{blue}{\left(-1 \cdot d1\right) \cdot d1}\right)\right) \]

      18. mul-1-neg N/A

          \[\leadsto \mathsf{fma}\left(d2 - d3, d1, \mathsf{fma}\left(d4, d1, \color{blue}{\left(\mathsf{neg}\left(d1\right)\right)} \cdot d1\right)\right) \]

      19. lower-neg.f64 100.0

          \[\leadsto \mathsf{fma}\left(d2 - d3, d1, \mathsf{fma}\left(d4, d1, \color{blue}{\left(-d1\right)} \cdot d1\right)\right) \]

   4. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(d2 - d3, d1, \mathsf{fma}\left(d4, d1, \left(-d1\right) \cdot d1\right)\right)} \]

   5. Taylor expanded in d1 around 0

      \[\leadsto \mathsf{fma}\left(d2 - d3, d1, \color{blue}{d1 \cdot d4}\right) \]
   6. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(d2 - d3, d1, d4 \cdot \color{blue}{d1}\right) \]

      2. lower-*.f64 96.5

         \[\leadsto \mathsf{fma}\left(d2 - d3, d1, d4 \cdot \color{blue}{d1}\right) \]

   7. Applied rewrites 96.5%

      \[\leadsto \mathsf{fma}\left(d2 - d3, d1, \color{blue}{d4 \cdot d1}\right) \]

   if 1.45000000000000005e138 < d1

   1. Initial program 50.0%

      \[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]
   2. Add Preprocessing

   3. Taylor expanded in d2 around 0

      \[\leadsto \color{blue}{d1 \cdot d4 - \left(d1 \cdot d3 + {d1}^{2}\right)} \]
   4. Step-by-step derivation

      1. associate--r+ N/A

         \[\leadsto \left(d1 \cdot d4 - d1 \cdot d3\right) - \color{blue}{{d1}^{2}} \]

      2. pow2 N/A

         \[\leadsto \left(d1 \cdot d4 - d1 \cdot d3\right) - d1 \cdot \color{blue}{d1} \]

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

         \[\leadsto \left(d1 \cdot d4 - d1 \cdot d3\right) + \color{blue}{\left(\mathsf{neg}\left(d1\right)\right) \cdot d1} \]

      4. distribute-lft-out-- N/A

         \[\leadsto d1 \cdot \left(d4 - d3\right) + \color{blue}{\left(\mathsf{neg}\left(d1\right)\right)} \cdot d1 \]

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

         \[\leadsto d1 \cdot \left(d4 - d3\right) + \left(\mathsf{neg}\left(d1 \cdot d1\right)\right) \]

      6. pow2 N/A

         \[\leadsto d1 \cdot \left(d4 - d3\right) + \left(\mathsf{neg}\left({d1}^{2}\right)\right) \]

      7. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(d1, \color{blue}{d4 - d3}, \mathsf{neg}\left({d1}^{2}\right)\right) \]

      8. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(d1, d4 - \color{blue}{d3}, \mathsf{neg}\left({d1}^{2}\right)\right) \]

      9. pow2 N/A

         \[\leadsto \mathsf{fma}\left(d1, d4 - d3, \mathsf{neg}\left(d1 \cdot d1\right)\right) \]

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

          \[\leadsto \mathsf{fma}\left(d1, d4 - d3, \left(\mathsf{neg}\left(d1\right)\right) \cdot d1\right) \]

      11. mul-1-neg N/A

          \[\leadsto \mathsf{fma}\left(d1, d4 - d3, \left(-1 \cdot d1\right) \cdot d1\right) \]

      12. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(d1, d4 - d3, \left(-1 \cdot d1\right) \cdot d1\right) \]

      13. mul-1-neg N/A

          \[\leadsto \mathsf{fma}\left(d1, d4 - d3, \left(\mathsf{neg}\left(d1\right)\right) \cdot d1\right) \]

      14. lower-neg.f64 79.4

          \[\leadsto \mathsf{fma}\left(d1, d4 - d3, \left(-d1\right) \cdot d1\right) \]

   5. Applied rewrites 79.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(d1, d4 - d3, \left(-d1\right) \cdot d1\right)} \]

   6. Taylor expanded in d3 around 0

      \[\leadsto -1 \cdot {d1}^{2} + \color{blue}{d1 \cdot d4} \]
   7. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto -1 \cdot {d1}^{2} + d4 \cdot d1 \]

      2. +-commutative N/A

         \[\leadsto d4 \cdot d1 + -1 \cdot \color{blue}{{d1}^{2}} \]

      3. mul-1-neg N/A

         \[\leadsto d4 \cdot d1 + \left(\mathsf{neg}\left({d1}^{2}\right)\right) \]

      4. pow2 N/A

         \[\leadsto d4 \cdot d1 + \left(\mathsf{neg}\left(d1 \cdot d1\right)\right) \]

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

         \[\leadsto d4 \cdot d1 + \left(\mathsf{neg}\left(d1\right)\right) \cdot d1 \]

      6. distribute-rgt-out N/A

         \[\leadsto d1 \cdot \left(d4 + \color{blue}{\left(\mathsf{neg}\left(d1\right)\right)}\right) \]

      7. mul-1-neg N/A

         \[\leadsto d1 \cdot \left(d4 + -1 \cdot d1\right) \]

      8. *-commutative N/A

         \[\leadsto \left(d4 + -1 \cdot d1\right) \cdot d1 \]

      9. lower-*.f64 N/A

         \[\leadsto \left(d4 + -1 \cdot d1\right) \cdot d1 \]

      10. +-commutative N/A

          \[\leadsto \left(-1 \cdot d1 + d4\right) \cdot d1 \]

      11. lower-fma.f64 88.2

          \[\leadsto \mathsf{fma}\left(-1, d1, d4\right) \cdot d1 \]

   8. Applied rewrites 88.2%

      \[\leadsto \mathsf{fma}\left(-1, d1, d4\right) \cdot \color{blue}{d1} \]
   9. Step-by-step derivation

      1. lower-+.f64 N/A

         \[\leadsto \left(-1 \cdot d1 + d4\right) \cdot d1 \]

      2. mul-1-neg N/A

         \[\leadsto \left(\left(\mathsf{neg}\left(d1\right)\right) + d4\right) \cdot d1 \]

      3. lower-neg.f64 88.2

         \[\leadsto \left(\left(-d1\right) + d4\right) \cdot d1 \]

   10. Applied rewrites 88.2%

       \[\leadsto \left(\left(-d1\right) + d4\right) \cdot d1 \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 3: 88.1% accurate, 1.2× speedup

Math

\[\begin{array}{l} [d1, d2, d3, d4] = \mathsf{sort}([d1, d2, d3, d4])\\ \\ \begin{array}{l} \mathbf{if}\;d1 \leq -4.1 \cdot 10^{+225}:\\ \;\;\;\;\left(-d1\right) \cdot d1\\ \mathbf{elif}\;d1 \leq 1.45 \cdot 10^{+138}:\\ \;\;\;\;\left(\left(d4 + d2\right) - d3\right) \cdot d1\\ \mathbf{else}:\\ \;\;\;\;\left(\left(-d1\right) + d4\right) \cdot d1\\ \end{array} \end{array} \]

FPCore

NOTE: d1, d2, d3, and d4 should be sorted in increasing order before calling this function.
(FPCore (d1 d2 d3 d4)
 :precision binary64
 (if (<= d1 -4.1e+225)
   (* (- d1) d1)
   (if (<= d1 1.45e+138) (* (- (+ d4 d2) d3) d1) (* (+ (- d1) d4) d1))))

C

assert(d1 < d2 && d2 < d3 && d3 < d4);
double code(double d1, double d2, double d3, double d4) {
	double tmp;
	if (d1 <= -4.1e+225) {
		tmp = -d1 * d1;
	} else if (d1 <= 1.45e+138) {
		tmp = ((d4 + d2) - d3) * d1;
	} else {
		tmp = (-d1 + d4) * d1;
	}
	return tmp;
}

Fortran

NOTE: d1, d2, d3, and d4 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(d1, d2, d3, d4)
use fmin_fmax_functions
    real(8), intent (in) :: d1
    real(8), intent (in) :: d2
    real(8), intent (in) :: d3
    real(8), intent (in) :: d4
    real(8) :: tmp
    if (d1 <= (-4.1d+225)) then
        tmp = -d1 * d1
    else if (d1 <= 1.45d+138) then
        tmp = ((d4 + d2) - d3) * d1
    else
        tmp = (-d1 + d4) * d1
    end if
    code = tmp
end function

Java

assert d1 < d2 && d2 < d3 && d3 < d4;
public static double code(double d1, double d2, double d3, double d4) {
	double tmp;
	if (d1 <= -4.1e+225) {
		tmp = -d1 * d1;
	} else if (d1 <= 1.45e+138) {
		tmp = ((d4 + d2) - d3) * d1;
	} else {
		tmp = (-d1 + d4) * d1;
	}
	return tmp;
}

Python

[d1, d2, d3, d4] = sort([d1, d2, d3, d4])
def code(d1, d2, d3, d4):
	tmp = 0
	if d1 <= -4.1e+225:
		tmp = -d1 * d1
	elif d1 <= 1.45e+138:
		tmp = ((d4 + d2) - d3) * d1
	else:
		tmp = (-d1 + d4) * d1
	return tmp

Julia

d1, d2, d3, d4 = sort([d1, d2, d3, d4])
function code(d1, d2, d3, d4)
	tmp = 0.0
	if (d1 <= -4.1e+225)
		tmp = Float64(Float64(-d1) * d1);
	elseif (d1 <= 1.45e+138)
		tmp = Float64(Float64(Float64(d4 + d2) - d3) * d1);
	else
		tmp = Float64(Float64(Float64(-d1) + d4) * d1);
	end
	return tmp
end

MATLAB

d1, d2, d3, d4 = num2cell(sort([d1, d2, d3, d4])){:}
function tmp_2 = code(d1, d2, d3, d4)
	tmp = 0.0;
	if (d1 <= -4.1e+225)
		tmp = -d1 * d1;
	elseif (d1 <= 1.45e+138)
		tmp = ((d4 + d2) - d3) * d1;
	else
		tmp = (-d1 + d4) * d1;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: d1, d2, d3, and d4 should be sorted in increasing order before calling this function.
code[d1_, d2_, d3_, d4_] := If[LessEqual[d1, -4.1e+225], N[((-d1) * d1), $MachinePrecision], If[LessEqual[d1, 1.45e+138], N[(N[(N[(d4 + d2), $MachinePrecision] - d3), $MachinePrecision] * d1), $MachinePrecision], N[(N[((-d1) + d4), $MachinePrecision] * d1), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if d1 < -4.0999999999999999e225

   1. Initial program 15.8%

      \[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]
   2. Add Preprocessing

   3. Taylor expanded in d1 around inf

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

      1. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left({d1}^{2}\right) \]

      2. pow2 N/A

         \[\leadsto \mathsf{neg}\left(d1 \cdot d1\right) \]

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

         \[\leadsto \left(\mathsf{neg}\left(d1\right)\right) \cdot \color{blue}{d1} \]

      4. mul-1-neg N/A

         \[\leadsto \left(-1 \cdot d1\right) \cdot d1 \]

      5. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot d1\right) \cdot \color{blue}{d1} \]

      6. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(d1\right)\right) \cdot d1 \]

      7. lower-neg.f64 89.5

         \[\leadsto \left(-d1\right) \cdot d1 \]

   5. Applied rewrites 89.5%

      \[\leadsto \color{blue}{\left(-d1\right) \cdot d1} \]

   if -4.0999999999999999e225 < d1 < 1.45000000000000005e138

   1. Initial program 97.5%

      \[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]
   2. Add Preprocessing

   3. Taylor expanded in d1 around 0

      \[\leadsto \color{blue}{d1 \cdot \left(\left(d2 + d4\right) - d3\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(\left(d2 + d4\right) - d3\right) \cdot \color{blue}{d1} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(\left(d2 + d4\right) - d3\right) \cdot \color{blue}{d1} \]

      3. lower--.f64 N/A

         \[\leadsto \left(\left(d2 + d4\right) - d3\right) \cdot d1 \]

      4. +-commutative N/A

         \[\leadsto \left(\left(d4 + d2\right) - d3\right) \cdot d1 \]

      5. lower-+.f64 94.1

         \[\leadsto \left(\left(d4 + d2\right) - d3\right) \cdot d1 \]

   5. Applied rewrites 94.1%

      \[\leadsto \color{blue}{\left(\left(d4 + d2\right) - d3\right) \cdot d1} \]

   if 1.45000000000000005e138 < d1

   1. Initial program 50.0%

      \[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]
   2. Add Preprocessing

   3. Taylor expanded in d2 around 0

      \[\leadsto \color{blue}{d1 \cdot d4 - \left(d1 \cdot d3 + {d1}^{2}\right)} \]
   4. Step-by-step derivation

      1. associate--r+ N/A

         \[\leadsto \left(d1 \cdot d4 - d1 \cdot d3\right) - \color{blue}{{d1}^{2}} \]

      2. pow2 N/A

         \[\leadsto \left(d1 \cdot d4 - d1 \cdot d3\right) - d1 \cdot \color{blue}{d1} \]

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

         \[\leadsto \left(d1 \cdot d4 - d1 \cdot d3\right) + \color{blue}{\left(\mathsf{neg}\left(d1\right)\right) \cdot d1} \]

      4. distribute-lft-out-- N/A

         \[\leadsto d1 \cdot \left(d4 - d3\right) + \color{blue}{\left(\mathsf{neg}\left(d1\right)\right)} \cdot d1 \]

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

         \[\leadsto d1 \cdot \left(d4 - d3\right) + \left(\mathsf{neg}\left(d1 \cdot d1\right)\right) \]

      6. pow2 N/A

         \[\leadsto d1 \cdot \left(d4 - d3\right) + \left(\mathsf{neg}\left({d1}^{2}\right)\right) \]

      7. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(d1, \color{blue}{d4 - d3}, \mathsf{neg}\left({d1}^{2}\right)\right) \]

      8. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(d1, d4 - \color{blue}{d3}, \mathsf{neg}\left({d1}^{2}\right)\right) \]

      9. pow2 N/A

         \[\leadsto \mathsf{fma}\left(d1, d4 - d3, \mathsf{neg}\left(d1 \cdot d1\right)\right) \]

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

          \[\leadsto \mathsf{fma}\left(d1, d4 - d3, \left(\mathsf{neg}\left(d1\right)\right) \cdot d1\right) \]

      11. mul-1-neg N/A

          \[\leadsto \mathsf{fma}\left(d1, d4 - d3, \left(-1 \cdot d1\right) \cdot d1\right) \]

      12. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(d1, d4 - d3, \left(-1 \cdot d1\right) \cdot d1\right) \]

      13. mul-1-neg N/A

          \[\leadsto \mathsf{fma}\left(d1, d4 - d3, \left(\mathsf{neg}\left(d1\right)\right) \cdot d1\right) \]

      14. lower-neg.f64 79.4

          \[\leadsto \mathsf{fma}\left(d1, d4 - d3, \left(-d1\right) \cdot d1\right) \]

   5. Applied rewrites 79.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(d1, d4 - d3, \left(-d1\right) \cdot d1\right)} \]

   6. Taylor expanded in d3 around 0

      \[\leadsto -1 \cdot {d1}^{2} + \color{blue}{d1 \cdot d4} \]
   7. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto -1 \cdot {d1}^{2} + d4 \cdot d1 \]

      2. +-commutative N/A

         \[\leadsto d4 \cdot d1 + -1 \cdot \color{blue}{{d1}^{2}} \]

      3. mul-1-neg N/A

         \[\leadsto d4 \cdot d1 + \left(\mathsf{neg}\left({d1}^{2}\right)\right) \]

      4. pow2 N/A

         \[\leadsto d4 \cdot d1 + \left(\mathsf{neg}\left(d1 \cdot d1\right)\right) \]

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

         \[\leadsto d4 \cdot d1 + \left(\mathsf{neg}\left(d1\right)\right) \cdot d1 \]

      6. distribute-rgt-out N/A

         \[\leadsto d1 \cdot \left(d4 + \color{blue}{\left(\mathsf{neg}\left(d1\right)\right)}\right) \]

      7. mul-1-neg N/A

         \[\leadsto d1 \cdot \left(d4 + -1 \cdot d1\right) \]

      8. *-commutative N/A

         \[\leadsto \left(d4 + -1 \cdot d1\right) \cdot d1 \]

      9. lower-*.f64 N/A

         \[\leadsto \left(d4 + -1 \cdot d1\right) \cdot d1 \]

      10. +-commutative N/A

          \[\leadsto \left(-1 \cdot d1 + d4\right) \cdot d1 \]

      11. lower-fma.f64 88.2

          \[\leadsto \mathsf{fma}\left(-1, d1, d4\right) \cdot d1 \]

   8. Applied rewrites 88.2%

      \[\leadsto \mathsf{fma}\left(-1, d1, d4\right) \cdot \color{blue}{d1} \]
   9. Step-by-step derivation

      1. lower-+.f64 N/A

         \[\leadsto \left(-1 \cdot d1 + d4\right) \cdot d1 \]

      2. mul-1-neg N/A

         \[\leadsto \left(\left(\mathsf{neg}\left(d1\right)\right) + d4\right) \cdot d1 \]

      3. lower-neg.f64 88.2

         \[\leadsto \left(\left(-d1\right) + d4\right) \cdot d1 \]

   10. Applied rewrites 88.2%

       \[\leadsto \left(\left(-d1\right) + d4\right) \cdot d1 \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 4: 72.2% accurate, 1.3× speedup

Math

\[\begin{array}{l} [d1, d2, d3, d4] = \mathsf{sort}([d1, d2, d3, d4])\\ \\ \begin{array}{l} \mathbf{if}\;d4 \leq 33:\\ \;\;\;\;\left(d2 - d3\right) \cdot d1\\ \mathbf{elif}\;d4 \leq 3.4 \cdot 10^{+217}:\\ \;\;\;\;\left(\left(-d1\right) + d4\right) \cdot d1\\ \mathbf{else}:\\ \;\;\;\;\left(d4 + d2\right) \cdot d1\\ \end{array} \end{array} \]

FPCore

NOTE: d1, d2, d3, and d4 should be sorted in increasing order before calling this function.
(FPCore (d1 d2 d3 d4)
 :precision binary64
 (if (<= d4 33.0)
   (* (- d2 d3) d1)
   (if (<= d4 3.4e+217) (* (+ (- d1) d4) d1) (* (+ d4 d2) d1))))

C

assert(d1 < d2 && d2 < d3 && d3 < d4);
double code(double d1, double d2, double d3, double d4) {
	double tmp;
	if (d4 <= 33.0) {
		tmp = (d2 - d3) * d1;
	} else if (d4 <= 3.4e+217) {
		tmp = (-d1 + d4) * d1;
	} else {
		tmp = (d4 + d2) * d1;
	}
	return tmp;
}

Fortran

NOTE: d1, d2, d3, and d4 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(d1, d2, d3, d4)
use fmin_fmax_functions
    real(8), intent (in) :: d1
    real(8), intent (in) :: d2
    real(8), intent (in) :: d3
    real(8), intent (in) :: d4
    real(8) :: tmp
    if (d4 <= 33.0d0) then
        tmp = (d2 - d3) * d1
    else if (d4 <= 3.4d+217) then
        tmp = (-d1 + d4) * d1
    else
        tmp = (d4 + d2) * d1
    end if
    code = tmp
end function

Java

assert d1 < d2 && d2 < d3 && d3 < d4;
public static double code(double d1, double d2, double d3, double d4) {
	double tmp;
	if (d4 <= 33.0) {
		tmp = (d2 - d3) * d1;
	} else if (d4 <= 3.4e+217) {
		tmp = (-d1 + d4) * d1;
	} else {
		tmp = (d4 + d2) * d1;
	}
	return tmp;
}

Python

[d1, d2, d3, d4] = sort([d1, d2, d3, d4])
def code(d1, d2, d3, d4):
	tmp = 0
	if d4 <= 33.0:
		tmp = (d2 - d3) * d1
	elif d4 <= 3.4e+217:
		tmp = (-d1 + d4) * d1
	else:
		tmp = (d4 + d2) * d1
	return tmp

Julia

d1, d2, d3, d4 = sort([d1, d2, d3, d4])
function code(d1, d2, d3, d4)
	tmp = 0.0
	if (d4 <= 33.0)
		tmp = Float64(Float64(d2 - d3) * d1);
	elseif (d4 <= 3.4e+217)
		tmp = Float64(Float64(Float64(-d1) + d4) * d1);
	else
		tmp = Float64(Float64(d4 + d2) * d1);
	end
	return tmp
end

MATLAB

d1, d2, d3, d4 = num2cell(sort([d1, d2, d3, d4])){:}
function tmp_2 = code(d1, d2, d3, d4)
	tmp = 0.0;
	if (d4 <= 33.0)
		tmp = (d2 - d3) * d1;
	elseif (d4 <= 3.4e+217)
		tmp = (-d1 + d4) * d1;
	else
		tmp = (d4 + d2) * d1;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: d1, d2, d3, and d4 should be sorted in increasing order before calling this function.
code[d1_, d2_, d3_, d4_] := If[LessEqual[d4, 33.0], N[(N[(d2 - d3), $MachinePrecision] * d1), $MachinePrecision], If[LessEqual[d4, 3.4e+217], N[(N[((-d1) + d4), $MachinePrecision] * d1), $MachinePrecision], N[(N[(d4 + d2), $MachinePrecision] * d1), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if d4 < 33

   1. Initial program 87.0%

      \[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]
   2. Add Preprocessing

   3. Taylor expanded in d1 around 0

      \[\leadsto \color{blue}{d1 \cdot \left(\left(d2 + d4\right) - d3\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(\left(d2 + d4\right) - d3\right) \cdot \color{blue}{d1} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(\left(d2 + d4\right) - d3\right) \cdot \color{blue}{d1} \]

      3. lower--.f64 N/A

         \[\leadsto \left(\left(d2 + d4\right) - d3\right) \cdot d1 \]

      4. +-commutative N/A

         \[\leadsto \left(\left(d4 + d2\right) - d3\right) \cdot d1 \]

      5. lower-+.f64 82.6

         \[\leadsto \left(\left(d4 + d2\right) - d3\right) \cdot d1 \]

   5. Applied rewrites 82.6%

      \[\leadsto \color{blue}{\left(\left(d4 + d2\right) - d3\right) \cdot d1} \]

   6. Taylor expanded in d2 around inf

      \[\leadsto \left(d2 - d3\right) \cdot d1 \]
   7. Step-by-step derivation

   8. Applied rewrites 63.2%

      \[\leadsto \left(d2 - d3\right) \cdot d1 \]

   if 33 < d4 < 3.3999999999999999e217

   1. Initial program 83.7%

      \[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]
   2. Add Preprocessing

   3. Taylor expanded in d2 around 0

      \[\leadsto \color{blue}{d1 \cdot d4 - \left(d1 \cdot d3 + {d1}^{2}\right)} \]
   4. Step-by-step derivation

      1. associate--r+ N/A

         \[\leadsto \left(d1 \cdot d4 - d1 \cdot d3\right) - \color{blue}{{d1}^{2}} \]

      2. pow2 N/A

         \[\leadsto \left(d1 \cdot d4 - d1 \cdot d3\right) - d1 \cdot \color{blue}{d1} \]

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

         \[\leadsto \left(d1 \cdot d4 - d1 \cdot d3\right) + \color{blue}{\left(\mathsf{neg}\left(d1\right)\right) \cdot d1} \]

      4. distribute-lft-out-- N/A

         \[\leadsto d1 \cdot \left(d4 - d3\right) + \color{blue}{\left(\mathsf{neg}\left(d1\right)\right)} \cdot d1 \]

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

         \[\leadsto d1 \cdot \left(d4 - d3\right) + \left(\mathsf{neg}\left(d1 \cdot d1\right)\right) \]

      6. pow2 N/A

         \[\leadsto d1 \cdot \left(d4 - d3\right) + \left(\mathsf{neg}\left({d1}^{2}\right)\right) \]

      7. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(d1, \color{blue}{d4 - d3}, \mathsf{neg}\left({d1}^{2}\right)\right) \]

      8. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(d1, d4 - \color{blue}{d3}, \mathsf{neg}\left({d1}^{2}\right)\right) \]

      9. pow2 N/A

         \[\leadsto \mathsf{fma}\left(d1, d4 - d3, \mathsf{neg}\left(d1 \cdot d1\right)\right) \]

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

          \[\leadsto \mathsf{fma}\left(d1, d4 - d3, \left(\mathsf{neg}\left(d1\right)\right) \cdot d1\right) \]

      11. mul-1-neg N/A

          \[\leadsto \mathsf{fma}\left(d1, d4 - d3, \left(-1 \cdot d1\right) \cdot d1\right) \]

      12. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(d1, d4 - d3, \left(-1 \cdot d1\right) \cdot d1\right) \]

      13. mul-1-neg N/A

          \[\leadsto \mathsf{fma}\left(d1, d4 - d3, \left(\mathsf{neg}\left(d1\right)\right) \cdot d1\right) \]

      14. lower-neg.f64 86.3

          \[\leadsto \mathsf{fma}\left(d1, d4 - d3, \left(-d1\right) \cdot d1\right) \]

   5. Applied rewrites 86.3%

      \[\leadsto \color{blue}{\mathsf{fma}\left(d1, d4 - d3, \left(-d1\right) \cdot d1\right)} \]

   6. Taylor expanded in d3 around 0

      \[\leadsto -1 \cdot {d1}^{2} + \color{blue}{d1 \cdot d4} \]
   7. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto -1 \cdot {d1}^{2} + d4 \cdot d1 \]

      2. +-commutative N/A

         \[\leadsto d4 \cdot d1 + -1 \cdot \color{blue}{{d1}^{2}} \]

      3. mul-1-neg N/A

         \[\leadsto d4 \cdot d1 + \left(\mathsf{neg}\left({d1}^{2}\right)\right) \]

      4. pow2 N/A

         \[\leadsto d4 \cdot d1 + \left(\mathsf{neg}\left(d1 \cdot d1\right)\right) \]

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

         \[\leadsto d4 \cdot d1 + \left(\mathsf{neg}\left(d1\right)\right) \cdot d1 \]

      6. distribute-rgt-out N/A

         \[\leadsto d1 \cdot \left(d4 + \color{blue}{\left(\mathsf{neg}\left(d1\right)\right)}\right) \]

      7. mul-1-neg N/A

         \[\leadsto d1 \cdot \left(d4 + -1 \cdot d1\right) \]

      8. *-commutative N/A

         \[\leadsto \left(d4 + -1 \cdot d1\right) \cdot d1 \]

      9. lower-*.f64 N/A

         \[\leadsto \left(d4 + -1 \cdot d1\right) \cdot d1 \]

      10. +-commutative N/A

          \[\leadsto \left(-1 \cdot d1 + d4\right) \cdot d1 \]

      11. lower-fma.f64 65.5

          \[\leadsto \mathsf{fma}\left(-1, d1, d4\right) \cdot d1 \]

   8. Applied rewrites 65.5%

      \[\leadsto \mathsf{fma}\left(-1, d1, d4\right) \cdot \color{blue}{d1} \]
   9. Step-by-step derivation

      1. lower-+.f64 N/A

         \[\leadsto \left(-1 \cdot d1 + d4\right) \cdot d1 \]

      2. mul-1-neg N/A

         \[\leadsto \left(\left(\mathsf{neg}\left(d1\right)\right) + d4\right) \cdot d1 \]

      3. lower-neg.f64 65.5

         \[\leadsto \left(\left(-d1\right) + d4\right) \cdot d1 \]

   10. Applied rewrites 65.5%

       \[\leadsto \left(\left(-d1\right) + d4\right) \cdot d1 \]

   if 3.3999999999999999e217 < d4

   1. Initial program 75.0%

      \[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]
   2. Add Preprocessing

   3. Taylor expanded in d1 around 0

      \[\leadsto \color{blue}{d1 \cdot \left(\left(d2 + d4\right) - d3\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(\left(d2 + d4\right) - d3\right) \cdot \color{blue}{d1} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(\left(d2 + d4\right) - d3\right) \cdot \color{blue}{d1} \]

      3. lower--.f64 N/A

         \[\leadsto \left(\left(d2 + d4\right) - d3\right) \cdot d1 \]

      4. +-commutative N/A

         \[\leadsto \left(\left(d4 + d2\right) - d3\right) \cdot d1 \]

      5. lower-+.f64 100.0

         \[\leadsto \left(\left(d4 + d2\right) - d3\right) \cdot d1 \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\left(\left(d4 + d2\right) - d3\right) \cdot d1} \]

   6. Taylor expanded in d3 around 0

      \[\leadsto \left(d2 + d4\right) \cdot d1 \]
   7. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \left(d4 + d2\right) \cdot d1 \]

      2. lower-+.f64 96.4

         \[\leadsto \left(d4 + d2\right) \cdot d1 \]

   8. Applied rewrites 96.4%

      \[\leadsto \left(d4 + d2\right) \cdot d1 \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 5: 68.0% accurate, 1.4× speedup

Math

\[\begin{array}{l} [d1, d2, d3, d4] = \mathsf{sort}([d1, d2, d3, d4])\\ \\ \begin{array}{l} \mathbf{if}\;d3 \leq -3.35 \cdot 10^{+186} \lor \neg \left(d3 \leq 4.9 \cdot 10^{+102}\right):\\ \;\;\;\;\left(-d3\right) \cdot d1\\ \mathbf{else}:\\ \;\;\;\;\left(d4 + d2\right) \cdot d1\\ \end{array} \end{array} \]

FPCore

NOTE: d1, d2, d3, and d4 should be sorted in increasing order before calling this function.
(FPCore (d1 d2 d3 d4)
 :precision binary64
 (if (or (<= d3 -3.35e+186) (not (<= d3 4.9e+102)))
   (* (- d3) d1)
   (* (+ d4 d2) d1)))

C

assert(d1 < d2 && d2 < d3 && d3 < d4);
double code(double d1, double d2, double d3, double d4) {
	double tmp;
	if ((d3 <= -3.35e+186) || !(d3 <= 4.9e+102)) {
		tmp = -d3 * d1;
	} else {
		tmp = (d4 + d2) * d1;
	}
	return tmp;
}

Fortran

NOTE: d1, d2, d3, and d4 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(d1, d2, d3, d4)
use fmin_fmax_functions
    real(8), intent (in) :: d1
    real(8), intent (in) :: d2
    real(8), intent (in) :: d3
    real(8), intent (in) :: d4
    real(8) :: tmp
    if ((d3 <= (-3.35d+186)) .or. (.not. (d3 <= 4.9d+102))) then
        tmp = -d3 * d1
    else
        tmp = (d4 + d2) * d1
    end if
    code = tmp
end function

Java

assert d1 < d2 && d2 < d3 && d3 < d4;
public static double code(double d1, double d2, double d3, double d4) {
	double tmp;
	if ((d3 <= -3.35e+186) || !(d3 <= 4.9e+102)) {
		tmp = -d3 * d1;
	} else {
		tmp = (d4 + d2) * d1;
	}
	return tmp;
}

Python

[d1, d2, d3, d4] = sort([d1, d2, d3, d4])
def code(d1, d2, d3, d4):
	tmp = 0
	if (d3 <= -3.35e+186) or not (d3 <= 4.9e+102):
		tmp = -d3 * d1
	else:
		tmp = (d4 + d2) * d1
	return tmp

Julia

d1, d2, d3, d4 = sort([d1, d2, d3, d4])
function code(d1, d2, d3, d4)
	tmp = 0.0
	if ((d3 <= -3.35e+186) || !(d3 <= 4.9e+102))
		tmp = Float64(Float64(-d3) * d1);
	else
		tmp = Float64(Float64(d4 + d2) * d1);
	end
	return tmp
end

MATLAB

d1, d2, d3, d4 = num2cell(sort([d1, d2, d3, d4])){:}
function tmp_2 = code(d1, d2, d3, d4)
	tmp = 0.0;
	if ((d3 <= -3.35e+186) || ~((d3 <= 4.9e+102)))
		tmp = -d3 * d1;
	else
		tmp = (d4 + d2) * d1;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: d1, d2, d3, and d4 should be sorted in increasing order before calling this function.
code[d1_, d2_, d3_, d4_] := If[Or[LessEqual[d3, -3.35e+186], N[Not[LessEqual[d3, 4.9e+102]], $MachinePrecision]], N[((-d3) * d1), $MachinePrecision], N[(N[(d4 + d2), $MachinePrecision] * d1), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if d3 < -3.35000000000000014e186 or 4.90000000000000045e102 < d3

   1. Initial program 81.9%

      \[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]
   2. Add Preprocessing

   3. Taylor expanded in d3 around inf

      \[\leadsto \color{blue}{-1 \cdot \left(d1 \cdot d3\right)} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left(d1 \cdot d3\right) \]

      2. *-commutative N/A

         \[\leadsto \mathsf{neg}\left(d3 \cdot d1\right) \]

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

         \[\leadsto \left(\mathsf{neg}\left(d3\right)\right) \cdot \color{blue}{d1} \]

      4. mul-1-neg N/A

         \[\leadsto \left(-1 \cdot d3\right) \cdot d1 \]

      5. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot d3\right) \cdot \color{blue}{d1} \]

      6. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(d3\right)\right) \cdot d1 \]

      7. lower-neg.f64 76.8

         \[\leadsto \left(-d3\right) \cdot d1 \]

   5. Applied rewrites 76.8%

      \[\leadsto \color{blue}{\left(-d3\right) \cdot d1} \]

   if -3.35000000000000014e186 < d3 < 4.90000000000000045e102

   1. Initial program 86.4%

      \[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]
   2. Add Preprocessing

   3. Taylor expanded in d1 around 0

      \[\leadsto \color{blue}{d1 \cdot \left(\left(d2 + d4\right) - d3\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(\left(d2 + d4\right) - d3\right) \cdot \color{blue}{d1} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(\left(d2 + d4\right) - d3\right) \cdot \color{blue}{d1} \]

      3. lower--.f64 N/A

         \[\leadsto \left(\left(d2 + d4\right) - d3\right) \cdot d1 \]

      4. +-commutative N/A

         \[\leadsto \left(\left(d4 + d2\right) - d3\right) \cdot d1 \]

      5. lower-+.f64 81.6

         \[\leadsto \left(\left(d4 + d2\right) - d3\right) \cdot d1 \]

   5. Applied rewrites 81.6%

      \[\leadsto \color{blue}{\left(\left(d4 + d2\right) - d3\right) \cdot d1} \]

   6. Taylor expanded in d3 around 0

      \[\leadsto \left(d2 + d4\right) \cdot d1 \]
   7. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \left(d4 + d2\right) \cdot d1 \]

      2. lower-+.f64 75.5

         \[\leadsto \left(d4 + d2\right) \cdot d1 \]

   8. Applied rewrites 75.5%

      \[\leadsto \left(d4 + d2\right) \cdot d1 \]
3. Recombined 2 regimes into one program.

4. Final simplification 75.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;d3 \leq -3.35 \cdot 10^{+186} \lor \neg \left(d3 \leq 4.9 \cdot 10^{+102}\right):\\ \;\;\;\;\left(-d3\right) \cdot d1\\ \mathbf{else}:\\ \;\;\;\;\left(d4 + d2\right) \cdot d1\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 50.8% accurate, 1.5× speedup

Math

\[\begin{array}{l} [d1, d2, d3, d4] = \mathsf{sort}([d1, d2, d3, d4])\\ \\ \begin{array}{l} \mathbf{if}\;d4 \leq 12:\\ \;\;\;\;d2 \cdot d1\\ \mathbf{elif}\;d4 \leq 3.4 \cdot 10^{+62}:\\ \;\;\;\;\left(-d1\right) \cdot d1\\ \mathbf{else}:\\ \;\;\;\;d4 \cdot d1\\ \end{array} \end{array} \]

FPCore

NOTE: d1, d2, d3, and d4 should be sorted in increasing order before calling this function.
(FPCore (d1 d2 d3 d4)
 :precision binary64
 (if (<= d4 12.0) (* d2 d1) (if (<= d4 3.4e+62) (* (- d1) d1) (* d4 d1))))

C

assert(d1 < d2 && d2 < d3 && d3 < d4);
double code(double d1, double d2, double d3, double d4) {
	double tmp;
	if (d4 <= 12.0) {
		tmp = d2 * d1;
	} else if (d4 <= 3.4e+62) {
		tmp = -d1 * d1;
	} else {
		tmp = d4 * d1;
	}
	return tmp;
}

Fortran

NOTE: d1, d2, d3, and d4 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(d1, d2, d3, d4)
use fmin_fmax_functions
    real(8), intent (in) :: d1
    real(8), intent (in) :: d2
    real(8), intent (in) :: d3
    real(8), intent (in) :: d4
    real(8) :: tmp
    if (d4 <= 12.0d0) then
        tmp = d2 * d1
    else if (d4 <= 3.4d+62) then
        tmp = -d1 * d1
    else
        tmp = d4 * d1
    end if
    code = tmp
end function

Java

assert d1 < d2 && d2 < d3 && d3 < d4;
public static double code(double d1, double d2, double d3, double d4) {
	double tmp;
	if (d4 <= 12.0) {
		tmp = d2 * d1;
	} else if (d4 <= 3.4e+62) {
		tmp = -d1 * d1;
	} else {
		tmp = d4 * d1;
	}
	return tmp;
}

Python

[d1, d2, d3, d4] = sort([d1, d2, d3, d4])
def code(d1, d2, d3, d4):
	tmp = 0
	if d4 <= 12.0:
		tmp = d2 * d1
	elif d4 <= 3.4e+62:
		tmp = -d1 * d1
	else:
		tmp = d4 * d1
	return tmp

Julia

d1, d2, d3, d4 = sort([d1, d2, d3, d4])
function code(d1, d2, d3, d4)
	tmp = 0.0
	if (d4 <= 12.0)
		tmp = Float64(d2 * d1);
	elseif (d4 <= 3.4e+62)
		tmp = Float64(Float64(-d1) * d1);
	else
		tmp = Float64(d4 * d1);
	end
	return tmp
end

MATLAB

d1, d2, d3, d4 = num2cell(sort([d1, d2, d3, d4])){:}
function tmp_2 = code(d1, d2, d3, d4)
	tmp = 0.0;
	if (d4 <= 12.0)
		tmp = d2 * d1;
	elseif (d4 <= 3.4e+62)
		tmp = -d1 * d1;
	else
		tmp = d4 * d1;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: d1, d2, d3, and d4 should be sorted in increasing order before calling this function.
code[d1_, d2_, d3_, d4_] := If[LessEqual[d4, 12.0], N[(d2 * d1), $MachinePrecision], If[LessEqual[d4, 3.4e+62], N[((-d1) * d1), $MachinePrecision], N[(d4 * d1), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if d4 < 12

   1. Initial program 86.9%

      \[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]
   2. Add Preprocessing

   3. Taylor expanded in d2 around inf

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

      1. *-commutative N/A

         \[\leadsto d2 \cdot \color{blue}{d1} \]

      2. lower-*.f64 37.5

         \[\leadsto d2 \cdot \color{blue}{d1} \]

   5. Applied rewrites 37.5%

      \[\leadsto \color{blue}{d2 \cdot d1} \]

   if 12 < d4 < 3.40000000000000014e62

   1. Initial program 84.6%

      \[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]
   2. Add Preprocessing

   3. Taylor expanded in d1 around inf

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

      1. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left({d1}^{2}\right) \]

      2. pow2 N/A

         \[\leadsto \mathsf{neg}\left(d1 \cdot d1\right) \]

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

         \[\leadsto \left(\mathsf{neg}\left(d1\right)\right) \cdot \color{blue}{d1} \]

      4. mul-1-neg N/A

         \[\leadsto \left(-1 \cdot d1\right) \cdot d1 \]

      5. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot d1\right) \cdot \color{blue}{d1} \]

      6. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(d1\right)\right) \cdot d1 \]

      7. lower-neg.f64 40.7

         \[\leadsto \left(-d1\right) \cdot d1 \]

   5. Applied rewrites 40.7%

      \[\leadsto \color{blue}{\left(-d1\right) \cdot d1} \]

   if 3.40000000000000014e62 < d4

   1. Initial program 79.7%

      \[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]
   2. Add Preprocessing

   3. Taylor expanded in d4 around inf

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

      1. *-commutative N/A

         \[\leadsto d4 \cdot \color{blue}{d1} \]

      2. lower-*.f64 70.0

         \[\leadsto d4 \cdot \color{blue}{d1} \]

   5. Applied rewrites 70.0%

      \[\leadsto \color{blue}{d4 \cdot d1} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 7: 74.6% accurate, 2.0× speedup

Math

\[\begin{array}{l} [d1, d2, d3, d4] = \mathsf{sort}([d1, d2, d3, d4])\\ \\ \begin{array}{l} \mathbf{if}\;d4 \leq 3200:\\ \;\;\;\;\left(d2 - d3\right) \cdot d1\\ \mathbf{else}:\\ \;\;\;\;\left(d4 - d3\right) \cdot d1\\ \end{array} \end{array} \]

FPCore

NOTE: d1, d2, d3, and d4 should be sorted in increasing order before calling this function.
(FPCore (d1 d2 d3 d4)
 :precision binary64
 (if (<= d4 3200.0) (* (- d2 d3) d1) (* (- d4 d3) d1)))

C

assert(d1 < d2 && d2 < d3 && d3 < d4);
double code(double d1, double d2, double d3, double d4) {
	double tmp;
	if (d4 <= 3200.0) {
		tmp = (d2 - d3) * d1;
	} else {
		tmp = (d4 - d3) * d1;
	}
	return tmp;
}

Fortran

NOTE: d1, d2, d3, and d4 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(d1, d2, d3, d4)
use fmin_fmax_functions
    real(8), intent (in) :: d1
    real(8), intent (in) :: d2
    real(8), intent (in) :: d3
    real(8), intent (in) :: d4
    real(8) :: tmp
    if (d4 <= 3200.0d0) then
        tmp = (d2 - d3) * d1
    else
        tmp = (d4 - d3) * d1
    end if
    code = tmp
end function

Java

assert d1 < d2 && d2 < d3 && d3 < d4;
public static double code(double d1, double d2, double d3, double d4) {
	double tmp;
	if (d4 <= 3200.0) {
		tmp = (d2 - d3) * d1;
	} else {
		tmp = (d4 - d3) * d1;
	}
	return tmp;
}

Python

[d1, d2, d3, d4] = sort([d1, d2, d3, d4])
def code(d1, d2, d3, d4):
	tmp = 0
	if d4 <= 3200.0:
		tmp = (d2 - d3) * d1
	else:
		tmp = (d4 - d3) * d1
	return tmp

Julia

d1, d2, d3, d4 = sort([d1, d2, d3, d4])
function code(d1, d2, d3, d4)
	tmp = 0.0
	if (d4 <= 3200.0)
		tmp = Float64(Float64(d2 - d3) * d1);
	else
		tmp = Float64(Float64(d4 - d3) * d1);
	end
	return tmp
end

MATLAB

d1, d2, d3, d4 = num2cell(sort([d1, d2, d3, d4])){:}
function tmp_2 = code(d1, d2, d3, d4)
	tmp = 0.0;
	if (d4 <= 3200.0)
		tmp = (d2 - d3) * d1;
	else
		tmp = (d4 - d3) * d1;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: d1, d2, d3, and d4 should be sorted in increasing order before calling this function.
code[d1_, d2_, d3_, d4_] := If[LessEqual[d4, 3200.0], N[(N[(d2 - d3), $MachinePrecision] * d1), $MachinePrecision], N[(N[(d4 - d3), $MachinePrecision] * d1), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if d4 < 3200

   1. Initial program 87.0%

      \[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]
   2. Add Preprocessing

   3. Taylor expanded in d1 around 0

      \[\leadsto \color{blue}{d1 \cdot \left(\left(d2 + d4\right) - d3\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(\left(d2 + d4\right) - d3\right) \cdot \color{blue}{d1} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(\left(d2 + d4\right) - d3\right) \cdot \color{blue}{d1} \]

      3. lower--.f64 N/A

         \[\leadsto \left(\left(d2 + d4\right) - d3\right) \cdot d1 \]

      4. +-commutative N/A

         \[\leadsto \left(\left(d4 + d2\right) - d3\right) \cdot d1 \]

      5. lower-+.f64 82.6

         \[\leadsto \left(\left(d4 + d2\right) - d3\right) \cdot d1 \]

   5. Applied rewrites 82.6%

      \[\leadsto \color{blue}{\left(\left(d4 + d2\right) - d3\right) \cdot d1} \]

   6. Taylor expanded in d2 around inf

      \[\leadsto \left(d2 - d3\right) \cdot d1 \]
   7. Step-by-step derivation

   8. Applied rewrites 63.2%

      \[\leadsto \left(d2 - d3\right) \cdot d1 \]

   if 3200 < d4

   1. Initial program 80.3%

      \[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]
   2. Add Preprocessing

   3. Taylor expanded in d1 around 0

      \[\leadsto \color{blue}{d1 \cdot \left(\left(d2 + d4\right) - d3\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(\left(d2 + d4\right) - d3\right) \cdot \color{blue}{d1} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(\left(d2 + d4\right) - d3\right) \cdot \color{blue}{d1} \]

      3. lower--.f64 N/A

         \[\leadsto \left(\left(d2 + d4\right) - d3\right) \cdot d1 \]

      4. +-commutative N/A

         \[\leadsto \left(\left(d4 + d2\right) - d3\right) \cdot d1 \]

      5. lower-+.f64 86.2

         \[\leadsto \left(\left(d4 + d2\right) - d3\right) \cdot d1 \]

   5. Applied rewrites 86.2%

      \[\leadsto \color{blue}{\left(\left(d4 + d2\right) - d3\right) \cdot d1} \]

   6. Taylor expanded in d2 around 0

      \[\leadsto \left(d4 - d3\right) \cdot d1 \]
   7. Step-by-step derivation

   8. Applied rewrites 77.0%

      \[\leadsto \left(d4 - d3\right) \cdot d1 \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 8: 72.1% accurate, 2.0× speedup

Math

\[\begin{array}{l} [d1, d2, d3, d4] = \mathsf{sort}([d1, d2, d3, d4])\\ \\ \begin{array}{l} \mathbf{if}\;d4 \leq 2.7 \cdot 10^{+59}:\\ \;\;\;\;\left(d2 - d3\right) \cdot d1\\ \mathbf{else}:\\ \;\;\;\;\left(d4 + d2\right) \cdot d1\\ \end{array} \end{array} \]

FPCore

NOTE: d1, d2, d3, and d4 should be sorted in increasing order before calling this function.
(FPCore (d1 d2 d3 d4)
 :precision binary64
 (if (<= d4 2.7e+59) (* (- d2 d3) d1) (* (+ d4 d2) d1)))

C

assert(d1 < d2 && d2 < d3 && d3 < d4);
double code(double d1, double d2, double d3, double d4) {
	double tmp;
	if (d4 <= 2.7e+59) {
		tmp = (d2 - d3) * d1;
	} else {
		tmp = (d4 + d2) * d1;
	}
	return tmp;
}

Fortran

NOTE: d1, d2, d3, and d4 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(d1, d2, d3, d4)
use fmin_fmax_functions
    real(8), intent (in) :: d1
    real(8), intent (in) :: d2
    real(8), intent (in) :: d3
    real(8), intent (in) :: d4
    real(8) :: tmp
    if (d4 <= 2.7d+59) then
        tmp = (d2 - d3) * d1
    else
        tmp = (d4 + d2) * d1
    end if
    code = tmp
end function

Java

assert d1 < d2 && d2 < d3 && d3 < d4;
public static double code(double d1, double d2, double d3, double d4) {
	double tmp;
	if (d4 <= 2.7e+59) {
		tmp = (d2 - d3) * d1;
	} else {
		tmp = (d4 + d2) * d1;
	}
	return tmp;
}

Python

[d1, d2, d3, d4] = sort([d1, d2, d3, d4])
def code(d1, d2, d3, d4):
	tmp = 0
	if d4 <= 2.7e+59:
		tmp = (d2 - d3) * d1
	else:
		tmp = (d4 + d2) * d1
	return tmp

Julia

d1, d2, d3, d4 = sort([d1, d2, d3, d4])
function code(d1, d2, d3, d4)
	tmp = 0.0
	if (d4 <= 2.7e+59)
		tmp = Float64(Float64(d2 - d3) * d1);
	else
		tmp = Float64(Float64(d4 + d2) * d1);
	end
	return tmp
end

MATLAB

d1, d2, d3, d4 = num2cell(sort([d1, d2, d3, d4])){:}
function tmp_2 = code(d1, d2, d3, d4)
	tmp = 0.0;
	if (d4 <= 2.7e+59)
		tmp = (d2 - d3) * d1;
	else
		tmp = (d4 + d2) * d1;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: d1, d2, d3, and d4 should be sorted in increasing order before calling this function.
code[d1_, d2_, d3_, d4_] := If[LessEqual[d4, 2.7e+59], N[(N[(d2 - d3), $MachinePrecision] * d1), $MachinePrecision], N[(N[(d4 + d2), $MachinePrecision] * d1), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if d4 < 2.7000000000000001e59

   1. Initial program 86.8%

      \[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]
   2. Add Preprocessing

   3. Taylor expanded in d1 around 0

      \[\leadsto \color{blue}{d1 \cdot \left(\left(d2 + d4\right) - d3\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(\left(d2 + d4\right) - d3\right) \cdot \color{blue}{d1} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(\left(d2 + d4\right) - d3\right) \cdot \color{blue}{d1} \]

      3. lower--.f64 N/A

         \[\leadsto \left(\left(d2 + d4\right) - d3\right) \cdot d1 \]

      4. +-commutative N/A

         \[\leadsto \left(\left(d4 + d2\right) - d3\right) \cdot d1 \]

      5. lower-+.f64 81.7

         \[\leadsto \left(\left(d4 + d2\right) - d3\right) \cdot d1 \]

   5. Applied rewrites 81.7%

      \[\leadsto \color{blue}{\left(\left(d4 + d2\right) - d3\right) \cdot d1} \]

   6. Taylor expanded in d2 around inf

      \[\leadsto \left(d2 - d3\right) \cdot d1 \]
   7. Step-by-step derivation

   8. Applied rewrites 63.4%

      \[\leadsto \left(d2 - d3\right) \cdot d1 \]

   if 2.7000000000000001e59 < d4

   1. Initial program 79.7%

      \[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]
   2. Add Preprocessing

   3. Taylor expanded in d1 around 0

      \[\leadsto \color{blue}{d1 \cdot \left(\left(d2 + d4\right) - d3\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(\left(d2 + d4\right) - d3\right) \cdot \color{blue}{d1} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(\left(d2 + d4\right) - d3\right) \cdot \color{blue}{d1} \]

      3. lower--.f64 N/A

         \[\leadsto \left(\left(d2 + d4\right) - d3\right) \cdot d1 \]

      4. +-commutative N/A

         \[\leadsto \left(\left(d4 + d2\right) - d3\right) \cdot d1 \]

      5. lower-+.f64 90.1

         \[\leadsto \left(\left(d4 + d2\right) - d3\right) \cdot d1 \]

   5. Applied rewrites 90.1%

      \[\leadsto \color{blue}{\left(\left(d4 + d2\right) - d3\right) \cdot d1} \]

   6. Taylor expanded in d3 around 0

      \[\leadsto \left(d2 + d4\right) \cdot d1 \]
   7. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \left(d4 + d2\right) \cdot d1 \]

      2. lower-+.f64 79.6

         \[\leadsto \left(d4 + d2\right) \cdot d1 \]

   8. Applied rewrites 79.6%

      \[\leadsto \left(d4 + d2\right) \cdot d1 \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 9: 49.9% accurate, 2.5× speedup

Math

\[\begin{array}{l} [d1, d2, d3, d4] = \mathsf{sort}([d1, d2, d3, d4])\\ \\ \begin{array}{l} \mathbf{if}\;d4 \leq 43:\\ \;\;\;\;d2 \cdot d1\\ \mathbf{else}:\\ \;\;\;\;d4 \cdot d1\\ \end{array} \end{array} \]

FPCore

NOTE: d1, d2, d3, and d4 should be sorted in increasing order before calling this function.
(FPCore (d1 d2 d3 d4)
 :precision binary64
 (if (<= d4 43.0) (* d2 d1) (* d4 d1)))

C

assert(d1 < d2 && d2 < d3 && d3 < d4);
double code(double d1, double d2, double d3, double d4) {
	double tmp;
	if (d4 <= 43.0) {
		tmp = d2 * d1;
	} else {
		tmp = d4 * d1;
	}
	return tmp;
}

Fortran

NOTE: d1, d2, d3, and d4 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(d1, d2, d3, d4)
use fmin_fmax_functions
    real(8), intent (in) :: d1
    real(8), intent (in) :: d2
    real(8), intent (in) :: d3
    real(8), intent (in) :: d4
    real(8) :: tmp
    if (d4 <= 43.0d0) then
        tmp = d2 * d1
    else
        tmp = d4 * d1
    end if
    code = tmp
end function

Java

assert d1 < d2 && d2 < d3 && d3 < d4;
public static double code(double d1, double d2, double d3, double d4) {
	double tmp;
	if (d4 <= 43.0) {
		tmp = d2 * d1;
	} else {
		tmp = d4 * d1;
	}
	return tmp;
}

Python

[d1, d2, d3, d4] = sort([d1, d2, d3, d4])
def code(d1, d2, d3, d4):
	tmp = 0
	if d4 <= 43.0:
		tmp = d2 * d1
	else:
		tmp = d4 * d1
	return tmp

Julia

d1, d2, d3, d4 = sort([d1, d2, d3, d4])
function code(d1, d2, d3, d4)
	tmp = 0.0
	if (d4 <= 43.0)
		tmp = Float64(d2 * d1);
	else
		tmp = Float64(d4 * d1);
	end
	return tmp
end

MATLAB

d1, d2, d3, d4 = num2cell(sort([d1, d2, d3, d4])){:}
function tmp_2 = code(d1, d2, d3, d4)
	tmp = 0.0;
	if (d4 <= 43.0)
		tmp = d2 * d1;
	else
		tmp = d4 * d1;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: d1, d2, d3, and d4 should be sorted in increasing order before calling this function.
code[d1_, d2_, d3_, d4_] := If[LessEqual[d4, 43.0], N[(d2 * d1), $MachinePrecision], N[(d4 * d1), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if d4 < 43

   1. Initial program 87.0%

      \[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]
   2. Add Preprocessing

   3. Taylor expanded in d2 around inf

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

      1. *-commutative N/A

         \[\leadsto d2 \cdot \color{blue}{d1} \]

      2. lower-*.f64 37.8

         \[\leadsto d2 \cdot \color{blue}{d1} \]

   5. Applied rewrites 37.8%

      \[\leadsto \color{blue}{d2 \cdot d1} \]

   if 43 < d4

   1. Initial program 80.3%

      \[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]
   2. Add Preprocessing

   3. Taylor expanded in d4 around inf

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

      1. *-commutative N/A

         \[\leadsto d4 \cdot \color{blue}{d1} \]

      2. lower-*.f64 58.7

         \[\leadsto d4 \cdot \color{blue}{d1} \]

   5. Applied rewrites 58.7%

      \[\leadsto \color{blue}{d4 \cdot d1} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 10: 31.4% accurate, 5.0× speedup

Math

\[\begin{array}{l} [d1, d2, d3, d4] = \mathsf{sort}([d1, d2, d3, d4])\\ \\ d2 \cdot d1 \end{array} \]

FPCore

NOTE: d1, d2, d3, and d4 should be sorted in increasing order before calling this function.
(FPCore (d1 d2 d3 d4) :precision binary64 (* d2 d1))

C

assert(d1 < d2 && d2 < d3 && d3 < d4);
double code(double d1, double d2, double d3, double d4) {
	return d2 * d1;
}

Fortran

NOTE: d1, d2, d3, and d4 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(d1, d2, d3, d4)
use fmin_fmax_functions
    real(8), intent (in) :: d1
    real(8), intent (in) :: d2
    real(8), intent (in) :: d3
    real(8), intent (in) :: d4
    code = d2 * d1
end function

Java

assert d1 < d2 && d2 < d3 && d3 < d4;
public static double code(double d1, double d2, double d3, double d4) {
	return d2 * d1;
}

Python

[d1, d2, d3, d4] = sort([d1, d2, d3, d4])
def code(d1, d2, d3, d4):
	return d2 * d1

Julia

d1, d2, d3, d4 = sort([d1, d2, d3, d4])
function code(d1, d2, d3, d4)
	return Float64(d2 * d1)
end

MATLAB

d1, d2, d3, d4 = num2cell(sort([d1, d2, d3, d4])){:}
function tmp = code(d1, d2, d3, d4)
	tmp = d2 * d1;
end

Wolfram

NOTE: d1, d2, d3, and d4 should be sorted in increasing order before calling this function.
code[d1_, d2_, d3_, d4_] := N[(d2 * d1), $MachinePrecision]

Derivation

1. Initial program 85.1%

   \[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]
2. Add Preprocessing

3. Taylor expanded in d2 around inf

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

   1. *-commutative N/A

      \[\leadsto d2 \cdot \color{blue}{d1} \]

   2. lower-*.f64 31.4

      \[\leadsto d2 \cdot \color{blue}{d1} \]

5. Applied rewrites 31.4%

   \[\leadsto \color{blue}{d2 \cdot d1} \]
6. Add Preprocessing

Developer Target 1: 100.0% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ d1 \cdot \left(\left(\left(d2 - d3\right) + d4\right) - d1\right) \end{array} \]

FPCore

(FPCore (d1 d2 d3 d4) :precision binary64 (* d1 (- (+ (- d2 d3) d4) d1)))

C

double code(double d1, double d2, double d3, double d4) {
	return d1 * (((d2 - d3) + d4) - d1);
}

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(d1, d2, d3, d4)
use fmin_fmax_functions
    real(8), intent (in) :: d1
    real(8), intent (in) :: d2
    real(8), intent (in) :: d3
    real(8), intent (in) :: d4
    code = d1 * (((d2 - d3) + d4) - d1)
end function

Java

public static double code(double d1, double d2, double d3, double d4) {
	return d1 * (((d2 - d3) + d4) - d1);
}

Python

def code(d1, d2, d3, d4):
	return d1 * (((d2 - d3) + d4) - d1)

Julia

function code(d1, d2, d3, d4)
	return Float64(d1 * Float64(Float64(Float64(d2 - d3) + d4) - d1))
end

MATLAB

function tmp = code(d1, d2, d3, d4)
	tmp = d1 * (((d2 - d3) + d4) - d1);
end

Wolfram

code[d1_, d2_, d3_, d4_] := N[(d1 * N[(N[(N[(d2 - d3), $MachinePrecision] + d4), $MachinePrecision] - d1), $MachinePrecision]), $MachinePrecision]

Reproduce

herbie shell --seed 2025044 
(FPCore (d1 d2 d3 d4)
  :name "FastMath dist4"
  :precision binary64

  :alt
  (! :herbie-platform default (* d1 (- (+ (- d2 d3) d4) d1)))

  (- (+ (- (* d1 d2) (* d1 d3)) (* d4 d1)) (* d1 d1)))