FastMath dist4

Percentage Accurate: 87.3% → 95.8%

Time: 4.4s

Alternatives: 12

Speedup: 0.5×

• 33.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.3% 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: 95.8% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1\\ \mathbf{if}\;t\_0 \leq \infty:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(d1, d4 - d3, \left(-d1\right) \cdot d1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (d1 d2 d3 d4)
 :precision binary64
 (let* ((t_0 (- (+ (- (* d1 d2) (* d1 d3)) (* d4 d1)) (* d1 d1))))
   (if (<= t_0 INFINITY) t_0 (fma d1 (- d4 d3) (* (- d1) d1)))))

C

double code(double d1, double d2, double d3, double d4) {
	double t_0 = (((d1 * d2) - (d1 * d3)) + (d4 * d1)) - (d1 * d1);
	double tmp;
	if (t_0 <= ((double) INFINITY)) {
		tmp = t_0;
	} else {
		tmp = fma(d1, (d4 - d3), (-d1 * d1));
	}
	return tmp;
}

Julia

function code(d1, d2, d3, d4)
	t_0 = Float64(Float64(Float64(Float64(d1 * d2) - Float64(d1 * d3)) + Float64(d4 * d1)) - Float64(d1 * d1))
	tmp = 0.0
	if (t_0 <= Inf)
		tmp = t_0;
	else
		tmp = fma(d1, Float64(d4 - d3), Float64(Float64(-d1) * d1));
	end
	return tmp
end

Wolfram

code[d1_, d2_, d3_, d4_] := Block[{t$95$0 = N[(N[(N[(N[(d1 * d2), $MachinePrecision] - N[(d1 * d3), $MachinePrecision]), $MachinePrecision] + N[(d4 * d1), $MachinePrecision]), $MachinePrecision] - N[(d1 * d1), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, Infinity], t$95$0, N[(d1 * N[(d4 - d3), $MachinePrecision] + N[((-d1) * d1), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (+.f64 (-.f64 (*.f64 d1 d2) (*.f64 d1 d3)) (*.f64 d4 d1)) (*.f64 d1 d1)) < +inf.0

   1. Initial program 100.0%

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

   if +inf.0 < (-.f64 (+.f64 (-.f64 (*.f64 d1 d2) (*.f64 d1 d3)) (*.f64 d4 d1)) (*.f64 d1 d1))

   1. Initial program 0.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 63.6

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

   5. Applied rewrites 63.6%

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

Alternative 2: 65.7% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(d2 - d3\right) \cdot d1\\ \mathbf{if}\;d3 \leq -7.6 \cdot 10^{+95}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;d3 \leq -3.8 \cdot 10^{-149}:\\ \;\;\;\;\left(-d1\right) \cdot d1\\ \mathbf{elif}\;d3 \leq 1.1 \cdot 10^{+52}:\\ \;\;\;\;\left(d4 + d2\right) \cdot d1\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (d1 d2 d3 d4)
 :precision binary64
 (let* ((t_0 (* (- d2 d3) d1)))
   (if (<= d3 -7.6e+95)
     t_0
     (if (<= d3 -3.8e-149)
       (* (- d1) d1)
       (if (<= d3 1.1e+52) (* (+ d4 d2) d1) t_0)))))

C

double code(double d1, double d2, double d3, double d4) {
	double t_0 = (d2 - d3) * d1;
	double tmp;
	if (d3 <= -7.6e+95) {
		tmp = t_0;
	} else if (d3 <= -3.8e-149) {
		tmp = -d1 * d1;
	} else if (d3 <= 1.1e+52) {
		tmp = (d4 + d2) * d1;
	} else {
		tmp = t_0;
	}
	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(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) :: t_0
    real(8) :: tmp
    t_0 = (d2 - d3) * d1
    if (d3 <= (-7.6d+95)) then
        tmp = t_0
    else if (d3 <= (-3.8d-149)) then
        tmp = -d1 * d1
    else if (d3 <= 1.1d+52) then
        tmp = (d4 + d2) * d1
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double d1, double d2, double d3, double d4) {
	double t_0 = (d2 - d3) * d1;
	double tmp;
	if (d3 <= -7.6e+95) {
		tmp = t_0;
	} else if (d3 <= -3.8e-149) {
		tmp = -d1 * d1;
	} else if (d3 <= 1.1e+52) {
		tmp = (d4 + d2) * d1;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(d1, d2, d3, d4):
	t_0 = (d2 - d3) * d1
	tmp = 0
	if d3 <= -7.6e+95:
		tmp = t_0
	elif d3 <= -3.8e-149:
		tmp = -d1 * d1
	elif d3 <= 1.1e+52:
		tmp = (d4 + d2) * d1
	else:
		tmp = t_0
	return tmp

Julia

function code(d1, d2, d3, d4)
	t_0 = Float64(Float64(d2 - d3) * d1)
	tmp = 0.0
	if (d3 <= -7.6e+95)
		tmp = t_0;
	elseif (d3 <= -3.8e-149)
		tmp = Float64(Float64(-d1) * d1);
	elseif (d3 <= 1.1e+52)
		tmp = Float64(Float64(d4 + d2) * d1);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(d1, d2, d3, d4)
	t_0 = (d2 - d3) * d1;
	tmp = 0.0;
	if (d3 <= -7.6e+95)
		tmp = t_0;
	elseif (d3 <= -3.8e-149)
		tmp = -d1 * d1;
	elseif (d3 <= 1.1e+52)
		tmp = (d4 + d2) * d1;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[d1_, d2_, d3_, d4_] := Block[{t$95$0 = N[(N[(d2 - d3), $MachinePrecision] * d1), $MachinePrecision]}, If[LessEqual[d3, -7.6e+95], t$95$0, If[LessEqual[d3, -3.8e-149], N[((-d1) * d1), $MachinePrecision], If[LessEqual[d3, 1.1e+52], N[(N[(d4 + d2), $MachinePrecision] * d1), $MachinePrecision], t$95$0]]]]

Derivation

1. Split input into 3 regimes

2. if d3 < -7.5999999999999999e95 or 1.1e52 < d3

   1. Initial program 77.1%

      \[\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.6

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

   5. Applied rewrites 90.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 72.9%

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

   if -7.5999999999999999e95 < d3 < -3.80000000000000005e-149

   1. Initial program 79.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 59.8

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

   5. Applied rewrites 59.8%

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

   if -3.80000000000000005e-149 < d3 < 1.1e52

   1. Initial program 90.2%

      \[\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 78.8

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

   5. Applied rewrites 78.8%

      \[\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. lift-+.f64 77.3

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

   8. Applied rewrites 77.3%

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

Alternative 3: 84.3% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(-d1\right) \cdot d1\\ \mathbf{if}\;d1 \leq -2 \cdot 10^{+245}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;d1 \leq 2.1 \cdot 10^{+36}:\\ \;\;\;\;\mathsf{fma}\left(d4 - d3, d1, d2 \cdot d1\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(d1, d4, t\_0\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (d1 d2 d3 d4)
 :precision binary64
 (let* ((t_0 (* (- d1) d1)))
   (if (<= d1 -2e+245)
     t_0
     (if (<= d1 2.1e+36) (fma (- d4 d3) d1 (* d2 d1)) (fma d1 d4 t_0)))))

C

double code(double d1, double d2, double d3, double d4) {
	double t_0 = -d1 * d1;
	double tmp;
	if (d1 <= -2e+245) {
		tmp = t_0;
	} else if (d1 <= 2.1e+36) {
		tmp = fma((d4 - d3), d1, (d2 * d1));
	} else {
		tmp = fma(d1, d4, t_0);
	}
	return tmp;
}

Julia

function code(d1, d2, d3, d4)
	t_0 = Float64(Float64(-d1) * d1)
	tmp = 0.0
	if (d1 <= -2e+245)
		tmp = t_0;
	elseif (d1 <= 2.1e+36)
		tmp = fma(Float64(d4 - d3), d1, Float64(d2 * d1));
	else
		tmp = fma(d1, d4, t_0);
	end
	return tmp
end

Wolfram

code[d1_, d2_, d3_, d4_] := Block[{t$95$0 = N[((-d1) * d1), $MachinePrecision]}, If[LessEqual[d1, -2e+245], t$95$0, If[LessEqual[d1, 2.1e+36], N[(N[(d4 - d3), $MachinePrecision] * d1 + N[(d2 * d1), $MachinePrecision]), $MachinePrecision], N[(d1 * d4 + t$95$0), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if d1 < -2.00000000000000009e245

   1. Initial program 33.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 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 100.0

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

   5. Applied rewrites 100.0%

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

   if -2.00000000000000009e245 < d1 < 2.10000000000000004e36

   1. Initial program 91.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 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 89.1

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

   5. Applied rewrites 89.1%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift--.f64 N/A

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

      4. *-commutative N/A

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

      5. +-commutative N/A

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

      6. associate--l+ N/A

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

      7. distribute-lft-out N/A

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

      8. +-commutative N/A

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

      9. *-commutative N/A

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

      10. lower-fma.f64 N/A

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

      11. lift--.f64 N/A

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

      12. *-commutative N/A

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

      13. lift-*.f64 88.6

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

   7. Applied rewrites 88.6%

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

   if 2.10000000000000004e36 < d1

   1. Initial program 66.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 77.5

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

   5. Applied rewrites 77.5%

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

   6. Taylor expanded in d3 around 0

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

   8. Applied rewrites 74.7%

      \[\leadsto \mathsf{fma}\left(d1, d4, \left(-d1\right) \cdot d1\right) \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 4: 40.3% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;d4 \leq 3.4 \cdot 10^{-199}:\\ \;\;\;\;d2 \cdot d1\\ \mathbf{elif}\;d4 \leq 39000000000:\\ \;\;\;\;\left(-d1\right) \cdot d1\\ \mathbf{elif}\;d4 \leq 9.8 \cdot 10^{+112}:\\ \;\;\;\;\left(-d3\right) \cdot d1\\ \mathbf{else}:\\ \;\;\;\;d4 \cdot d1\\ \end{array} \end{array} \]

FPCore

(FPCore (d1 d2 d3 d4)
 :precision binary64
 (if (<= d4 3.4e-199)
   (* d2 d1)
   (if (<= d4 39000000000.0)
     (* (- d1) d1)
     (if (<= d4 9.8e+112) (* (- d3) d1) (* d4 d1)))))

C

double code(double d1, double d2, double d3, double d4) {
	double tmp;
	if (d4 <= 3.4e-199) {
		tmp = d2 * d1;
	} else if (d4 <= 39000000000.0) {
		tmp = -d1 * d1;
	} else if (d4 <= 9.8e+112) {
		tmp = -d3 * d1;
	} else {
		tmp = d4 * d1;
	}
	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(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 <= 3.4d-199) then
        tmp = d2 * d1
    else if (d4 <= 39000000000.0d0) then
        tmp = -d1 * d1
    else if (d4 <= 9.8d+112) then
        tmp = -d3 * d1
    else
        tmp = d4 * d1
    end if
    code = tmp
end function

Java

public static double code(double d1, double d2, double d3, double d4) {
	double tmp;
	if (d4 <= 3.4e-199) {
		tmp = d2 * d1;
	} else if (d4 <= 39000000000.0) {
		tmp = -d1 * d1;
	} else if (d4 <= 9.8e+112) {
		tmp = -d3 * d1;
	} else {
		tmp = d4 * d1;
	}
	return tmp;
}

Python

def code(d1, d2, d3, d4):
	tmp = 0
	if d4 <= 3.4e-199:
		tmp = d2 * d1
	elif d4 <= 39000000000.0:
		tmp = -d1 * d1
	elif d4 <= 9.8e+112:
		tmp = -d3 * d1
	else:
		tmp = d4 * d1
	return tmp

Julia

function code(d1, d2, d3, d4)
	tmp = 0.0
	if (d4 <= 3.4e-199)
		tmp = Float64(d2 * d1);
	elseif (d4 <= 39000000000.0)
		tmp = Float64(Float64(-d1) * d1);
	elseif (d4 <= 9.8e+112)
		tmp = Float64(Float64(-d3) * d1);
	else
		tmp = Float64(d4 * d1);
	end
	return tmp
end

MATLAB

function tmp_2 = code(d1, d2, d3, d4)
	tmp = 0.0;
	if (d4 <= 3.4e-199)
		tmp = d2 * d1;
	elseif (d4 <= 39000000000.0)
		tmp = -d1 * d1;
	elseif (d4 <= 9.8e+112)
		tmp = -d3 * d1;
	else
		tmp = d4 * d1;
	end
	tmp_2 = tmp;
end

Wolfram

code[d1_, d2_, d3_, d4_] := If[LessEqual[d4, 3.4e-199], N[(d2 * d1), $MachinePrecision], If[LessEqual[d4, 39000000000.0], N[((-d1) * d1), $MachinePrecision], If[LessEqual[d4, 9.8e+112], N[((-d3) * d1), $MachinePrecision], N[(d4 * d1), $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if d4 < 3.40000000000000006e-199

   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 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 29.8

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

   5. Applied rewrites 29.8%

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

   if 3.40000000000000006e-199 < d4 < 3.9e10

   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. 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 55.7

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

   5. Applied rewrites 55.7%

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

   if 3.9e10 < d4 < 9.80000000000000008e112

   1. Initial program 94.4%

      \[\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 35.4

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

   5. Applied rewrites 35.4%

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

   if 9.80000000000000008e112 < d4

   1. Initial program 68.9%

      \[\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. lift-*.f64 73.8

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

   5. Applied rewrites 73.8%

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

Alternative 5: 84.8% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(-d1\right) \cdot d1\\ \mathbf{if}\;d1 \leq -2 \cdot 10^{+245}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;d1 \leq 2.1 \cdot 10^{+36}:\\ \;\;\;\;\left(\left(d4 + d2\right) - d3\right) \cdot d1\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(d1, d4, t\_0\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (d1 d2 d3 d4)
 :precision binary64
 (let* ((t_0 (* (- d1) d1)))
   (if (<= d1 -2e+245)
     t_0
     (if (<= d1 2.1e+36) (* (- (+ d4 d2) d3) d1) (fma d1 d4 t_0)))))

C

double code(double d1, double d2, double d3, double d4) {
	double t_0 = -d1 * d1;
	double tmp;
	if (d1 <= -2e+245) {
		tmp = t_0;
	} else if (d1 <= 2.1e+36) {
		tmp = ((d4 + d2) - d3) * d1;
	} else {
		tmp = fma(d1, d4, t_0);
	}
	return tmp;
}

Julia

function code(d1, d2, d3, d4)
	t_0 = Float64(Float64(-d1) * d1)
	tmp = 0.0
	if (d1 <= -2e+245)
		tmp = t_0;
	elseif (d1 <= 2.1e+36)
		tmp = Float64(Float64(Float64(d4 + d2) - d3) * d1);
	else
		tmp = fma(d1, d4, t_0);
	end
	return tmp
end

Wolfram

code[d1_, d2_, d3_, d4_] := Block[{t$95$0 = N[((-d1) * d1), $MachinePrecision]}, If[LessEqual[d1, -2e+245], t$95$0, If[LessEqual[d1, 2.1e+36], N[(N[(N[(d4 + d2), $MachinePrecision] - d3), $MachinePrecision] * d1), $MachinePrecision], N[(d1 * d4 + t$95$0), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if d1 < -2.00000000000000009e245

   1. Initial program 33.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 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 100.0

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

   5. Applied rewrites 100.0%

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

   if -2.00000000000000009e245 < d1 < 2.10000000000000004e36

   1. Initial program 91.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 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 89.1

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

   5. Applied rewrites 89.1%

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

   if 2.10000000000000004e36 < d1

   1. Initial program 66.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 77.5

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

   5. Applied rewrites 77.5%

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

   6. Taylor expanded in d3 around 0

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

   8. Applied rewrites 74.7%

      \[\leadsto \mathsf{fma}\left(d1, d4, \left(-d1\right) \cdot d1\right) \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 6: 85.9% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;d1 \leq -2 \cdot 10^{+245} \lor \neg \left(d1 \leq 7.5 \cdot 10^{+187}\right):\\ \;\;\;\;\left(-d1\right) \cdot d1\\ \mathbf{else}:\\ \;\;\;\;\left(\left(d4 + d2\right) - d3\right) \cdot d1\\ \end{array} \end{array} \]

FPCore

(FPCore (d1 d2 d3 d4)
 :precision binary64
 (if (or (<= d1 -2e+245) (not (<= d1 7.5e+187)))
   (* (- d1) d1)
   (* (- (+ d4 d2) d3) d1)))

C

double code(double d1, double d2, double d3, double d4) {
	double tmp;
	if ((d1 <= -2e+245) || !(d1 <= 7.5e+187)) {
		tmp = -d1 * d1;
	} else {
		tmp = ((d4 + d2) - d3) * d1;
	}
	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(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 <= (-2d+245)) .or. (.not. (d1 <= 7.5d+187))) then
        tmp = -d1 * d1
    else
        tmp = ((d4 + d2) - d3) * d1
    end if
    code = tmp
end function

Java

public static double code(double d1, double d2, double d3, double d4) {
	double tmp;
	if ((d1 <= -2e+245) || !(d1 <= 7.5e+187)) {
		tmp = -d1 * d1;
	} else {
		tmp = ((d4 + d2) - d3) * d1;
	}
	return tmp;
}

Python

def code(d1, d2, d3, d4):
	tmp = 0
	if (d1 <= -2e+245) or not (d1 <= 7.5e+187):
		tmp = -d1 * d1
	else:
		tmp = ((d4 + d2) - d3) * d1
	return tmp

Julia

function code(d1, d2, d3, d4)
	tmp = 0.0
	if ((d1 <= -2e+245) || !(d1 <= 7.5e+187))
		tmp = Float64(Float64(-d1) * d1);
	else
		tmp = Float64(Float64(Float64(d4 + d2) - d3) * d1);
	end
	return tmp
end

MATLAB

function tmp_2 = code(d1, d2, d3, d4)
	tmp = 0.0;
	if ((d1 <= -2e+245) || ~((d1 <= 7.5e+187)))
		tmp = -d1 * d1;
	else
		tmp = ((d4 + d2) - d3) * d1;
	end
	tmp_2 = tmp;
end

Wolfram

code[d1_, d2_, d3_, d4_] := If[Or[LessEqual[d1, -2e+245], N[Not[LessEqual[d1, 7.5e+187]], $MachinePrecision]], N[((-d1) * d1), $MachinePrecision], N[(N[(N[(d4 + d2), $MachinePrecision] - d3), $MachinePrecision] * d1), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if d1 < -2.00000000000000009e245 or 7.5000000000000002e187 < d1

   1. Initial program 40.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 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 88.9

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

   5. Applied rewrites 88.9%

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

   if -2.00000000000000009e245 < d1 < 7.5000000000000002e187

   1. Initial program 91.9%

      \[\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 85.7

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

   5. Applied rewrites 85.7%

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

4. Final simplification 86.2%

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

Alternative 7: 82.9% accurate, 1.3× speedup

Math

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

FPCore

(FPCore (d1 d2 d3 d4)
 :precision binary64
 (if (<= d2 -18.0) (* (- (+ d4 d2) d3) d1) (fma d1 (- d4 d3) (* (- d1) d1))))

C

double code(double d1, double d2, double d3, double d4) {
	double tmp;
	if (d2 <= -18.0) {
		tmp = ((d4 + d2) - d3) * d1;
	} else {
		tmp = fma(d1, (d4 - d3), (-d1 * d1));
	}
	return tmp;
}

Julia

function code(d1, d2, d3, d4)
	tmp = 0.0
	if (d2 <= -18.0)
		tmp = Float64(Float64(Float64(d4 + d2) - d3) * d1);
	else
		tmp = fma(d1, Float64(d4 - d3), Float64(Float64(-d1) * d1));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if d2 < -18

   1. Initial program 85.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 85.2

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

   5. Applied rewrites 85.2%

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

   if -18 < d2

   1. Initial program 82.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 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 80.1

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

   5. Applied rewrites 80.1%

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

Alternative 8: 67.0% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;d3 \leq -5.8 \cdot 10^{+168} \lor \neg \left(d3 \leq 2.15 \cdot 10^{+109}\right):\\ \;\;\;\;\left(-d3\right) \cdot d1\\ \mathbf{else}:\\ \;\;\;\;\left(d4 + d2\right) \cdot d1\\ \end{array} \end{array} \]

FPCore

(FPCore (d1 d2 d3 d4)
 :precision binary64
 (if (or (<= d3 -5.8e+168) (not (<= d3 2.15e+109)))
   (* (- d3) d1)
   (* (+ d4 d2) d1)))

C

double code(double d1, double d2, double d3, double d4) {
	double tmp;
	if ((d3 <= -5.8e+168) || !(d3 <= 2.15e+109)) {
		tmp = -d3 * d1;
	} else {
		tmp = (d4 + d2) * d1;
	}
	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(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 <= (-5.8d+168)) .or. (.not. (d3 <= 2.15d+109))) then
        tmp = -d3 * d1
    else
        tmp = (d4 + d2) * d1
    end if
    code = tmp
end function

Java

public static double code(double d1, double d2, double d3, double d4) {
	double tmp;
	if ((d3 <= -5.8e+168) || !(d3 <= 2.15e+109)) {
		tmp = -d3 * d1;
	} else {
		tmp = (d4 + d2) * d1;
	}
	return tmp;
}

Python

def code(d1, d2, d3, d4):
	tmp = 0
	if (d3 <= -5.8e+168) or not (d3 <= 2.15e+109):
		tmp = -d3 * d1
	else:
		tmp = (d4 + d2) * d1
	return tmp

Julia

function code(d1, d2, d3, d4)
	tmp = 0.0
	if ((d3 <= -5.8e+168) || !(d3 <= 2.15e+109))
		tmp = Float64(Float64(-d3) * d1);
	else
		tmp = Float64(Float64(d4 + d2) * d1);
	end
	return tmp
end

MATLAB

function tmp_2 = code(d1, d2, d3, d4)
	tmp = 0.0;
	if ((d3 <= -5.8e+168) || ~((d3 <= 2.15e+109)))
		tmp = -d3 * d1;
	else
		tmp = (d4 + d2) * d1;
	end
	tmp_2 = tmp;
end

Wolfram

code[d1_, d2_, d3_, d4_] := If[Or[LessEqual[d3, -5.8e+168], N[Not[LessEqual[d3, 2.15e+109]], $MachinePrecision]], N[((-d3) * d1), $MachinePrecision], N[(N[(d4 + d2), $MachinePrecision] * d1), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if d3 < -5.8e168 or 2.15e109 < d3

   1. Initial program 72.1%

      \[\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 74.7

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

   5. Applied rewrites 74.7%

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

   if -5.8e168 < d3 < 2.15e109

   1. Initial program 87.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 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 72.9

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

   5. Applied rewrites 72.9%

      \[\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. lift-+.f64 66.5

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

   8. Applied rewrites 66.5%

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

4. Final simplification 69.0%

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

Alternative 9: 39.6% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;d4 \leq 3.4 \cdot 10^{-199}:\\ \;\;\;\;d2 \cdot d1\\ \mathbf{elif}\;d4 \leq 2.7 \cdot 10^{+20}:\\ \;\;\;\;\left(-d1\right) \cdot d1\\ \mathbf{else}:\\ \;\;\;\;d4 \cdot d1\\ \end{array} \end{array} \]

FPCore

(FPCore (d1 d2 d3 d4)
 :precision binary64
 (if (<= d4 3.4e-199) (* d2 d1) (if (<= d4 2.7e+20) (* (- d1) d1) (* d4 d1))))

C

double code(double d1, double d2, double d3, double d4) {
	double tmp;
	if (d4 <= 3.4e-199) {
		tmp = d2 * d1;
	} else if (d4 <= 2.7e+20) {
		tmp = -d1 * d1;
	} else {
		tmp = d4 * d1;
	}
	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(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 <= 3.4d-199) then
        tmp = d2 * d1
    else if (d4 <= 2.7d+20) then
        tmp = -d1 * d1
    else
        tmp = d4 * d1
    end if
    code = tmp
end function

Java

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

Python

def code(d1, d2, d3, d4):
	tmp = 0
	if d4 <= 3.4e-199:
		tmp = d2 * d1
	elif d4 <= 2.7e+20:
		tmp = -d1 * d1
	else:
		tmp = d4 * d1
	return tmp

Julia

function code(d1, d2, d3, d4)
	tmp = 0.0
	if (d4 <= 3.4e-199)
		tmp = Float64(d2 * d1);
	elseif (d4 <= 2.7e+20)
		tmp = Float64(Float64(-d1) * d1);
	else
		tmp = Float64(d4 * d1);
	end
	return tmp
end

MATLAB

function tmp_2 = code(d1, d2, d3, d4)
	tmp = 0.0;
	if (d4 <= 3.4e-199)
		tmp = d2 * d1;
	elseif (d4 <= 2.7e+20)
		tmp = -d1 * d1;
	else
		tmp = d4 * d1;
	end
	tmp_2 = tmp;
end

Wolfram

code[d1_, d2_, d3_, d4_] := If[LessEqual[d4, 3.4e-199], N[(d2 * d1), $MachinePrecision], If[LessEqual[d4, 2.7e+20], N[((-d1) * d1), $MachinePrecision], N[(d4 * d1), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if d4 < 3.40000000000000006e-199

   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 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 29.8

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

   5. Applied rewrites 29.8%

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

   if 3.40000000000000006e-199 < d4 < 2.7e20

   1. Initial program 86.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 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 53.7

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

   5. Applied rewrites 53.7%

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

   if 2.7e20 < d4

   1. Initial program 75.4%

      \[\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. lift-*.f64 59.9

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

   5. Applied rewrites 59.9%

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

Alternative 10: 64.0% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;d4 \leq 9 \cdot 10^{+35}:\\ \;\;\;\;\left(d2 - d3\right) \cdot d1\\ \mathbf{else}:\\ \;\;\;\;\left(d4 - d3\right) \cdot d1\\ \end{array} \end{array} \]

FPCore

(FPCore (d1 d2 d3 d4)
 :precision binary64
 (if (<= d4 9e+35) (* (- d2 d3) d1) (* (- d4 d3) d1)))

C

double code(double d1, double d2, double d3, double d4) {
	double tmp;
	if (d4 <= 9e+35) {
		tmp = (d2 - d3) * d1;
	} else {
		tmp = (d4 - d3) * d1;
	}
	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(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 <= 9d+35) then
        tmp = (d2 - d3) * d1
    else
        tmp = (d4 - d3) * d1
    end if
    code = tmp
end function

Java

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

Python

def code(d1, d2, d3, d4):
	tmp = 0
	if d4 <= 9e+35:
		tmp = (d2 - d3) * d1
	else:
		tmp = (d4 - d3) * d1
	return tmp

Julia

function code(d1, d2, d3, d4)
	tmp = 0.0
	if (d4 <= 9e+35)
		tmp = Float64(Float64(d2 - d3) * d1);
	else
		tmp = Float64(Float64(d4 - d3) * d1);
	end
	return tmp
end

MATLAB

function tmp_2 = code(d1, d2, d3, d4)
	tmp = 0.0;
	if (d4 <= 9e+35)
		tmp = (d2 - d3) * d1;
	else
		tmp = (d4 - d3) * d1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if d4 < 8.9999999999999993e35

   1. Initial program 85.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 75.9

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

   5. Applied rewrites 75.9%

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

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

   if 8.9999999999999993e35 < d4

   1. Initial program 74.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 87.1

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

   5. Applied rewrites 87.1%

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

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

Alternative 11: 39.4% accurate, 2.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;d4 \leq 9.5 \cdot 10^{+37}:\\ \;\;\;\;d2 \cdot d1\\ \mathbf{else}:\\ \;\;\;\;d4 \cdot d1\\ \end{array} \end{array} \]

FPCore

(FPCore (d1 d2 d3 d4)
 :precision binary64
 (if (<= d4 9.5e+37) (* d2 d1) (* d4 d1)))

C

double code(double d1, double d2, double d3, double d4) {
	double tmp;
	if (d4 <= 9.5e+37) {
		tmp = d2 * d1;
	} else {
		tmp = d4 * d1;
	}
	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(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 <= 9.5d+37) then
        tmp = d2 * d1
    else
        tmp = d4 * d1
    end if
    code = tmp
end function

Java

public static double code(double d1, double d2, double d3, double d4) {
	double tmp;
	if (d4 <= 9.5e+37) {
		tmp = d2 * d1;
	} else {
		tmp = d4 * d1;
	}
	return tmp;
}

Python

def code(d1, d2, d3, d4):
	tmp = 0
	if d4 <= 9.5e+37:
		tmp = d2 * d1
	else:
		tmp = d4 * d1
	return tmp

Julia

function code(d1, d2, d3, d4)
	tmp = 0.0
	if (d4 <= 9.5e+37)
		tmp = Float64(d2 * d1);
	else
		tmp = Float64(d4 * d1);
	end
	return tmp
end

MATLAB

function tmp_2 = code(d1, d2, d3, d4)
	tmp = 0.0;
	if (d4 <= 9.5e+37)
		tmp = d2 * d1;
	else
		tmp = d4 * d1;
	end
	tmp_2 = tmp;
end

Wolfram

code[d1_, d2_, d3_, d4_] := If[LessEqual[d4, 9.5e+37], N[(d2 * d1), $MachinePrecision], N[(d4 * d1), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if d4 < 9.4999999999999995e37

   1. Initial program 85.3%

      \[\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 30.3

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

   5. Applied rewrites 30.3%

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

   if 9.4999999999999995e37 < d4

   1. Initial program 74.5%

      \[\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. lift-*.f64 61.9

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

   5. Applied rewrites 61.9%

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

Alternative 12: 31.3% accurate, 5.0× speedup

Math

\[\begin{array}{l} \\ d2 \cdot d1 \end{array} \]

FPCore

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

C

double code(double d1, double d2, double d3, double d4) {
	return d2 * 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 = d2 * d1
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 82.8%

   \[\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 28.7

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

5. Applied rewrites 28.7%

   \[\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 2025061 
(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)))