FastMath test3

Percentage Accurate: 97.9% → 100.0%

Time: 3.3s

Alternatives: 9

Speedup: 1.6×

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

Specification

Math

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

FPCore

(FPCore (d1 d2 d3) :precision binary64 (+ (+ (* d1 3.0) (* d1 d2)) (* d1 d3)))

C

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 97.9% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (d1 d2 d3) :precision binary64 (+ (+ (* d1 3.0) (* d1 d2)) (* d1 d3)))

C

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(d1, 3, \left(d3 + d2\right) \cdot d1\right) \end{array} \]

FPCore

(FPCore (d1 d2 d3) :precision binary64 (fma d1 3.0 (* (+ d3 d2) d1)))

C

double code(double d1, double d2, double d3) {
	return fma(d1, 3.0, ((d3 + d2) * d1));
}

Julia

function code(d1, d2, d3)
	return fma(d1, 3.0, Float64(Float64(d3 + d2) * d1))
end

Wolfram

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

Derivation

1. Initial program 97.9%

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

   1. lift-*.f64 N/A

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

   2. lift-+.f64 N/A

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

   3. lift-*.f64 N/A

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

   4. lift-*.f64 N/A

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

   5. lift-+.f64 N/A

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

   6. associate-+l+ N/A

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

   7. lower-fma.f64 N/A

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

   8. distribute-lft-out N/A

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

   9. *-commutative N/A

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

   10. lower-*.f64 N/A

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

   11. +-commutative N/A

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

   12. lower-+.f64 100.0

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

3. Applied rewrites 100.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(d1, 3, \left(d3 + d2\right) \cdot d1\right)} \]
4. Add Preprocessing

Alternative 2: 99.9% accurate, 1.6× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 97.9%

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

   1. lift-*.f64 N/A

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

   2. lift-+.f64 N/A

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

   3. lift-*.f64 N/A

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

   4. lift-*.f64 N/A

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

   5. lift-+.f64 N/A

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

   6. associate-+l+ N/A

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

   7. lower-fma.f64 N/A

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

   8. distribute-lft-out N/A

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

   9. *-commutative N/A

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

   10. lower-*.f64 N/A

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

   11. +-commutative N/A

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

   12. lower-+.f64 100.0

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

3. Applied rewrites 100.0%

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

   1. lift-*.f64 N/A

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

   2. lift-+.f64 N/A

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

   3. lower-fma.f64 N/A

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

   4. *-commutative N/A

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

   5. +-commutative N/A

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

   6. distribute-rgt-out N/A

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

   7. *-commutative N/A

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

   8. lower-*.f64 N/A

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

   9. metadata-eval N/A

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

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

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

   11. metadata-eval N/A

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

   12. metadata-eval N/A

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

   13. lower--.f64 N/A

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

   14. +-commutative N/A

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

   15. lower-+.f64 99.9

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

5. Applied rewrites 99.9%

   \[\leadsto \color{blue}{\left(\left(d2 + d3\right) - -3\right) \cdot d1} \]
6. Add Preprocessing

Alternative 3: 76.0% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (d1 d2 d3)
 :precision binary64
 (if (<= (+ (+ (* d1 3.0) (* d1 d2)) (* d1 d3)) 5e-259)
   (fma d1 3.0 (* d2 d1))
   (fma d1 3.0 (* d3 d1))))

C

double code(double d1, double d2, double d3) {
	double tmp;
	if ((((d1 * 3.0) + (d1 * d2)) + (d1 * d3)) <= 5e-259) {
		tmp = fma(d1, 3.0, (d2 * d1));
	} else {
		tmp = fma(d1, 3.0, (d3 * d1));
	}
	return tmp;
}

Julia

function code(d1, d2, d3)
	tmp = 0.0
	if (Float64(Float64(Float64(d1 * 3.0) + Float64(d1 * d2)) + Float64(d1 * d3)) <= 5e-259)
		tmp = fma(d1, 3.0, Float64(d2 * d1));
	else
		tmp = fma(d1, 3.0, Float64(d3 * d1));
	end
	return tmp
end

Wolfram

code[d1_, d2_, d3_] := If[LessEqual[N[(N[(N[(d1 * 3.0), $MachinePrecision] + N[(d1 * d2), $MachinePrecision]), $MachinePrecision] + N[(d1 * d3), $MachinePrecision]), $MachinePrecision], 5e-259], N[(d1 * 3.0 + N[(d2 * d1), $MachinePrecision]), $MachinePrecision], N[(d1 * 3.0 + N[(d3 * d1), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (+.f64 (*.f64 d1 #s(literal 3 binary64)) (*.f64 d1 d2)) (*.f64 d1 d3)) < 4.99999999999999977e-259

   1. Initial program 99.9%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. associate-+l+ N/A

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

      7. lower-fma.f64 N/A

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

      8. distribute-lft-out N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. +-commutative N/A

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

      12. lower-+.f64 100.0

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

   3. Applied rewrites 100.0%

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

   4. Taylor expanded in d2 around inf

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

   6. Applied rewrites 65.3%

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

   if 4.99999999999999977e-259 < (+.f64 (+.f64 (*.f64 d1 #s(literal 3 binary64)) (*.f64 d1 d2)) (*.f64 d1 d3))

   1. Initial program 95.8%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. associate-+l+ N/A

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

      7. lower-fma.f64 N/A

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

      8. distribute-lft-out N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. +-commutative N/A

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

      12. lower-+.f64 100.0

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

   3. Applied rewrites 100.0%

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

   4. Taylor expanded in d2 around 0

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

   6. Applied rewrites 62.3%

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

Alternative 4: 63.8% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (d1 d2 d3)
 :precision binary64
 (if (<= (+ (+ (* d1 3.0) (* d1 d2)) (* d1 d3)) 5e-259)
   (fma d1 3.0 (* d2 d1))
   (* (- d3 -3.0) d1)))

C

double code(double d1, double d2, double d3) {
	double tmp;
	if ((((d1 * 3.0) + (d1 * d2)) + (d1 * d3)) <= 5e-259) {
		tmp = fma(d1, 3.0, (d2 * d1));
	} else {
		tmp = (d3 - -3.0) * d1;
	}
	return tmp;
}

Julia

function code(d1, d2, d3)
	tmp = 0.0
	if (Float64(Float64(Float64(d1 * 3.0) + Float64(d1 * d2)) + Float64(d1 * d3)) <= 5e-259)
		tmp = fma(d1, 3.0, Float64(d2 * d1));
	else
		tmp = Float64(Float64(d3 - -3.0) * d1);
	end
	return tmp
end

Wolfram

code[d1_, d2_, d3_] := If[LessEqual[N[(N[(N[(d1 * 3.0), $MachinePrecision] + N[(d1 * d2), $MachinePrecision]), $MachinePrecision] + N[(d1 * d3), $MachinePrecision]), $MachinePrecision], 5e-259], N[(d1 * 3.0 + N[(d2 * d1), $MachinePrecision]), $MachinePrecision], N[(N[(d3 - -3.0), $MachinePrecision] * d1), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (+.f64 (*.f64 d1 #s(literal 3 binary64)) (*.f64 d1 d2)) (*.f64 d1 d3)) < 4.99999999999999977e-259

   1. Initial program 99.9%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. associate-+l+ N/A

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

      7. lower-fma.f64 N/A

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

      8. distribute-lft-out N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. +-commutative N/A

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

      12. lower-+.f64 100.0

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

   3. Applied rewrites 100.0%

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

   4. Taylor expanded in d2 around inf

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

   6. Applied rewrites 65.3%

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

   if 4.99999999999999977e-259 < (+.f64 (+.f64 (*.f64 d1 #s(literal 3 binary64)) (*.f64 d1 d2)) (*.f64 d1 d3))

   1. Initial program 95.8%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. associate-+l+ N/A

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

      7. distribute-lft-out N/A

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

      8. distribute-lft-in N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. +-commutative N/A

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

      12. lower-+.f64 N/A

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

      13. +-commutative N/A

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

      14. lower-+.f64 99.9

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

   3. Applied rewrites 99.9%

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

   4. Taylor expanded in d2 around 0

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

      1. +-commutative N/A

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

      2. metadata-eval N/A

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

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

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

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. lower--.f64 62.3

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

   6. Applied rewrites 62.3%

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

Alternative 5: 63.8% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (d1 d2 d3)
 :precision binary64
 (if (<= (+ (+ (* d1 3.0) (* d1 d2)) (* d1 d3)) -2e-166)
   (* (- d2 -3.0) d1)
   (* (- d3 -3.0) d1)))

C

double code(double d1, double d2, double d3) {
	double tmp;
	if ((((d1 * 3.0) + (d1 * d2)) + (d1 * d3)) <= -2e-166) {
		tmp = (d2 - -3.0) * d1;
	} else {
		tmp = (d3 - -3.0) * 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)
use fmin_fmax_functions
    real(8), intent (in) :: d1
    real(8), intent (in) :: d2
    real(8), intent (in) :: d3
    real(8) :: tmp
    if ((((d1 * 3.0d0) + (d1 * d2)) + (d1 * d3)) <= (-2d-166)) then
        tmp = (d2 - (-3.0d0)) * d1
    else
        tmp = (d3 - (-3.0d0)) * d1
    end if
    code = tmp
end function

Java

public static double code(double d1, double d2, double d3) {
	double tmp;
	if ((((d1 * 3.0) + (d1 * d2)) + (d1 * d3)) <= -2e-166) {
		tmp = (d2 - -3.0) * d1;
	} else {
		tmp = (d3 - -3.0) * d1;
	}
	return tmp;
}

Python

def code(d1, d2, d3):
	tmp = 0
	if (((d1 * 3.0) + (d1 * d2)) + (d1 * d3)) <= -2e-166:
		tmp = (d2 - -3.0) * d1
	else:
		tmp = (d3 - -3.0) * d1
	return tmp

Julia

function code(d1, d2, d3)
	tmp = 0.0
	if (Float64(Float64(Float64(d1 * 3.0) + Float64(d1 * d2)) + Float64(d1 * d3)) <= -2e-166)
		tmp = Float64(Float64(d2 - -3.0) * d1);
	else
		tmp = Float64(Float64(d3 - -3.0) * d1);
	end
	return tmp
end

MATLAB

function tmp_2 = code(d1, d2, d3)
	tmp = 0.0;
	if ((((d1 * 3.0) + (d1 * d2)) + (d1 * d3)) <= -2e-166)
		tmp = (d2 - -3.0) * d1;
	else
		tmp = (d3 - -3.0) * d1;
	end
	tmp_2 = tmp;
end

Wolfram

code[d1_, d2_, d3_] := If[LessEqual[N[(N[(N[(d1 * 3.0), $MachinePrecision] + N[(d1 * d2), $MachinePrecision]), $MachinePrecision] + N[(d1 * d3), $MachinePrecision]), $MachinePrecision], -2e-166], N[(N[(d2 - -3.0), $MachinePrecision] * d1), $MachinePrecision], N[(N[(d3 - -3.0), $MachinePrecision] * d1), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (+.f64 (*.f64 d1 #s(literal 3 binary64)) (*.f64 d1 d2)) (*.f64 d1 d3)) < -2.00000000000000008e-166

   1. Initial program 99.9%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. associate-+l+ N/A

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

      7. distribute-lft-out N/A

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

      8. distribute-lft-in N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. +-commutative N/A

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

      12. lower-+.f64 N/A

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

      13. +-commutative N/A

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

      14. lower-+.f64 99.9

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

   3. Applied rewrites 99.9%

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

   4. Taylor expanded in d3 around 0

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

      1. +-commutative N/A

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

      2. metadata-eval N/A

         \[\leadsto \left(d2 + 3 \cdot \color{blue}{1}\right) \cdot d1 \]

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

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

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. lower--.f64 62.7

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

   6. Applied rewrites 62.7%

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

   if -2.00000000000000008e-166 < (+.f64 (+.f64 (*.f64 d1 #s(literal 3 binary64)) (*.f64 d1 d2)) (*.f64 d1 d3))

   1. Initial program 96.2%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. associate-+l+ N/A

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

      7. distribute-lft-out N/A

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

      8. distribute-lft-in N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. +-commutative N/A

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

      12. lower-+.f64 N/A

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

      13. +-commutative N/A

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

      14. lower-+.f64 99.9

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

   3. Applied rewrites 99.9%

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

   4. Taylor expanded in d2 around 0

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

      1. +-commutative N/A

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

      2. metadata-eval N/A

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

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

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

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. lower--.f64 64.5

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

   6. Applied rewrites 64.5%

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

Alternative 6: 63.8% accurate, 1.5× speedup

Math

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

FPCore

(FPCore (d1 d2 d3)
 :precision binary64
 (if (<= d3 1.1e+40) (* (- d2 -3.0) d1) (* d3 d1)))

C

double code(double d1, double d2, double d3) {
	double tmp;
	if (d3 <= 1.1e+40) {
		tmp = (d2 - -3.0) * d1;
	} else {
		tmp = 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)
use fmin_fmax_functions
    real(8), intent (in) :: d1
    real(8), intent (in) :: d2
    real(8), intent (in) :: d3
    real(8) :: tmp
    if (d3 <= 1.1d+40) then
        tmp = (d2 - (-3.0d0)) * d1
    else
        tmp = d3 * d1
    end if
    code = tmp
end function

Java

public static double code(double d1, double d2, double d3) {
	double tmp;
	if (d3 <= 1.1e+40) {
		tmp = (d2 - -3.0) * d1;
	} else {
		tmp = d3 * d1;
	}
	return tmp;
}

Python

def code(d1, d2, d3):
	tmp = 0
	if d3 <= 1.1e+40:
		tmp = (d2 - -3.0) * d1
	else:
		tmp = d3 * d1
	return tmp

Julia

function code(d1, d2, d3)
	tmp = 0.0
	if (d3 <= 1.1e+40)
		tmp = Float64(Float64(d2 - -3.0) * d1);
	else
		tmp = Float64(d3 * d1);
	end
	return tmp
end

MATLAB

function tmp_2 = code(d1, d2, d3)
	tmp = 0.0;
	if (d3 <= 1.1e+40)
		tmp = (d2 - -3.0) * d1;
	else
		tmp = d3 * d1;
	end
	tmp_2 = tmp;
end

Wolfram

code[d1_, d2_, d3_] := If[LessEqual[d3, 1.1e+40], N[(N[(d2 - -3.0), $MachinePrecision] * d1), $MachinePrecision], N[(d3 * d1), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if d3 < 1.0999999999999999e40

   1. Initial program 98.6%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. associate-+l+ N/A

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

      7. distribute-lft-out N/A

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

      8. distribute-lft-in N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. +-commutative N/A

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

      12. lower-+.f64 N/A

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

      13. +-commutative N/A

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

      14. lower-+.f64 99.9

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

   3. Applied rewrites 99.9%

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

   4. Taylor expanded in d3 around 0

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

      1. +-commutative N/A

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

      2. metadata-eval N/A

         \[\leadsto \left(d2 + 3 \cdot \color{blue}{1}\right) \cdot d1 \]

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

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

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. lower--.f64 75.0

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

   6. Applied rewrites 75.0%

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

   if 1.0999999999999999e40 < d3

   1. Initial program 95.1%

      \[\left(d1 \cdot 3 + d1 \cdot d2\right) + d1 \cdot d3 \]

   2. Taylor expanded in d3 around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 79.6

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

   4. Applied rewrites 79.6%

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

Alternative 7: 63.7% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(d1 \cdot 3 + d1 \cdot d2\right) + d1 \cdot d3\\ \mathbf{if}\;t\_0 \leq -2 \cdot 10^{-166}:\\ \;\;\;\;d2 \cdot d1\\ \mathbf{elif}\;t\_0 \leq 5 \cdot 10^{-43}:\\ \;\;\;\;d1 \cdot 3\\ \mathbf{else}:\\ \;\;\;\;d3 \cdot d1\\ \end{array} \end{array} \]

FPCore

(FPCore (d1 d2 d3)
 :precision binary64
 (let* ((t_0 (+ (+ (* d1 3.0) (* d1 d2)) (* d1 d3))))
   (if (<= t_0 -2e-166) (* d2 d1) (if (<= t_0 5e-43) (* d1 3.0) (* d3 d1)))))

C

double code(double d1, double d2, double d3) {
	double t_0 = ((d1 * 3.0) + (d1 * d2)) + (d1 * d3);
	double tmp;
	if (t_0 <= -2e-166) {
		tmp = d2 * d1;
	} else if (t_0 <= 5e-43) {
		tmp = d1 * 3.0;
	} else {
		tmp = 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)
use fmin_fmax_functions
    real(8), intent (in) :: d1
    real(8), intent (in) :: d2
    real(8), intent (in) :: d3
    real(8) :: t_0
    real(8) :: tmp
    t_0 = ((d1 * 3.0d0) + (d1 * d2)) + (d1 * d3)
    if (t_0 <= (-2d-166)) then
        tmp = d2 * d1
    else if (t_0 <= 5d-43) then
        tmp = d1 * 3.0d0
    else
        tmp = d3 * d1
    end if
    code = tmp
end function

Java

public static double code(double d1, double d2, double d3) {
	double t_0 = ((d1 * 3.0) + (d1 * d2)) + (d1 * d3);
	double tmp;
	if (t_0 <= -2e-166) {
		tmp = d2 * d1;
	} else if (t_0 <= 5e-43) {
		tmp = d1 * 3.0;
	} else {
		tmp = d3 * d1;
	}
	return tmp;
}

Python

def code(d1, d2, d3):
	t_0 = ((d1 * 3.0) + (d1 * d2)) + (d1 * d3)
	tmp = 0
	if t_0 <= -2e-166:
		tmp = d2 * d1
	elif t_0 <= 5e-43:
		tmp = d1 * 3.0
	else:
		tmp = d3 * d1
	return tmp

Julia

function code(d1, d2, d3)
	t_0 = Float64(Float64(Float64(d1 * 3.0) + Float64(d1 * d2)) + Float64(d1 * d3))
	tmp = 0.0
	if (t_0 <= -2e-166)
		tmp = Float64(d2 * d1);
	elseif (t_0 <= 5e-43)
		tmp = Float64(d1 * 3.0);
	else
		tmp = Float64(d3 * d1);
	end
	return tmp
end

MATLAB

function tmp_2 = code(d1, d2, d3)
	t_0 = ((d1 * 3.0) + (d1 * d2)) + (d1 * d3);
	tmp = 0.0;
	if (t_0 <= -2e-166)
		tmp = d2 * d1;
	elseif (t_0 <= 5e-43)
		tmp = d1 * 3.0;
	else
		tmp = d3 * d1;
	end
	tmp_2 = tmp;
end

Wolfram

code[d1_, d2_, d3_] := Block[{t$95$0 = N[(N[(N[(d1 * 3.0), $MachinePrecision] + N[(d1 * d2), $MachinePrecision]), $MachinePrecision] + N[(d1 * d3), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -2e-166], N[(d2 * d1), $MachinePrecision], If[LessEqual[t$95$0, 5e-43], N[(d1 * 3.0), $MachinePrecision], N[(d3 * d1), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (+.f64 (+.f64 (*.f64 d1 #s(literal 3 binary64)) (*.f64 d1 d2)) (*.f64 d1 d3)) < -2.00000000000000008e-166

   1. Initial program 99.9%

      \[\left(d1 \cdot 3 + d1 \cdot d2\right) + d1 \cdot d3 \]

   2. Taylor expanded in d2 around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 41.2

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

   4. Applied rewrites 41.2%

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

   if -2.00000000000000008e-166 < (+.f64 (+.f64 (*.f64 d1 #s(literal 3 binary64)) (*.f64 d1 d2)) (*.f64 d1 d3)) < 5.00000000000000019e-43

   1. Initial program 99.8%

      \[\left(d1 \cdot 3 + d1 \cdot d2\right) + d1 \cdot d3 \]

   2. Taylor expanded in d2 around 0

      \[\leadsto \color{blue}{3 \cdot d1 + d1 \cdot d3} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto 3 \cdot d1 + d3 \cdot \color{blue}{d1} \]

      2. distribute-rgt-out N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 74.4

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

   4. Applied rewrites 74.4%

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

   5. Taylor expanded in d3 around 0

      \[\leadsto d1 \cdot 3 \]
   6. Step-by-step derivation

   7. Applied rewrites 52.3%

      \[\leadsto d1 \cdot 3 \]

   if 5.00000000000000019e-43 < (+.f64 (+.f64 (*.f64 d1 #s(literal 3 binary64)) (*.f64 d1 d2)) (*.f64 d1 d3))

   1. Initial program 94.8%

      \[\left(d1 \cdot 3 + d1 \cdot d2\right) + d1 \cdot d3 \]

   2. Taylor expanded in d3 around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 41.1

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

   4. Applied rewrites 41.1%

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

Alternative 8: 43.0% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;d2 \leq -3.2:\\ \;\;\;\;d2 \cdot d1\\ \mathbf{elif}\;d2 \leq 3:\\ \;\;\;\;d1 \cdot 3\\ \mathbf{else}:\\ \;\;\;\;d2 \cdot d1\\ \end{array} \end{array} \]

FPCore

(FPCore (d1 d2 d3)
 :precision binary64
 (if (<= d2 -3.2) (* d2 d1) (if (<= d2 3.0) (* d1 3.0) (* d2 d1))))

C

double code(double d1, double d2, double d3) {
	double tmp;
	if (d2 <= -3.2) {
		tmp = d2 * d1;
	} else if (d2 <= 3.0) {
		tmp = d1 * 3.0;
	} else {
		tmp = 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)
use fmin_fmax_functions
    real(8), intent (in) :: d1
    real(8), intent (in) :: d2
    real(8), intent (in) :: d3
    real(8) :: tmp
    if (d2 <= (-3.2d0)) then
        tmp = d2 * d1
    else if (d2 <= 3.0d0) then
        tmp = d1 * 3.0d0
    else
        tmp = d2 * d1
    end if
    code = tmp
end function

Java

public static double code(double d1, double d2, double d3) {
	double tmp;
	if (d2 <= -3.2) {
		tmp = d2 * d1;
	} else if (d2 <= 3.0) {
		tmp = d1 * 3.0;
	} else {
		tmp = d2 * d1;
	}
	return tmp;
}

Python

def code(d1, d2, d3):
	tmp = 0
	if d2 <= -3.2:
		tmp = d2 * d1
	elif d2 <= 3.0:
		tmp = d1 * 3.0
	else:
		tmp = d2 * d1
	return tmp

Julia

function code(d1, d2, d3)
	tmp = 0.0
	if (d2 <= -3.2)
		tmp = Float64(d2 * d1);
	elseif (d2 <= 3.0)
		tmp = Float64(d1 * 3.0);
	else
		tmp = Float64(d2 * d1);
	end
	return tmp
end

MATLAB

function tmp_2 = code(d1, d2, d3)
	tmp = 0.0;
	if (d2 <= -3.2)
		tmp = d2 * d1;
	elseif (d2 <= 3.0)
		tmp = d1 * 3.0;
	else
		tmp = d2 * d1;
	end
	tmp_2 = tmp;
end

Wolfram

code[d1_, d2_, d3_] := If[LessEqual[d2, -3.2], N[(d2 * d1), $MachinePrecision], If[LessEqual[d2, 3.0], N[(d1 * 3.0), $MachinePrecision], N[(d2 * d1), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if d2 < -3.2000000000000002 or 3 < d2

   1. Initial program 95.8%

      \[\left(d1 \cdot 3 + d1 \cdot d2\right) + d1 \cdot d3 \]

   2. Taylor expanded in d2 around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 76.6

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

   4. Applied rewrites 76.6%

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

   if -3.2000000000000002 < d2 < 3

   1. Initial program 99.9%

      \[\left(d1 \cdot 3 + d1 \cdot d2\right) + d1 \cdot d3 \]

   2. Taylor expanded in d2 around 0

      \[\leadsto \color{blue}{3 \cdot d1 + d1 \cdot d3} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto 3 \cdot d1 + d3 \cdot \color{blue}{d1} \]

      2. distribute-rgt-out N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 98.7

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

   4. Applied rewrites 98.7%

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

   5. Taylor expanded in d3 around 0

      \[\leadsto d1 \cdot 3 \]
   6. Step-by-step derivation

   7. Applied rewrites 51.1%

      \[\leadsto d1 \cdot 3 \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 9: 27.5% accurate, 3.9× speedup

Math

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

FPCore

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

C

double code(double d1, double d2, double d3) {
	return d1 * 3.0;
}

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 97.9%

   \[\left(d1 \cdot 3 + d1 \cdot d2\right) + d1 \cdot d3 \]

2. Taylor expanded in d2 around 0

   \[\leadsto \color{blue}{3 \cdot d1 + d1 \cdot d3} \]
3. Step-by-step derivation

   1. *-commutative N/A

      \[\leadsto 3 \cdot d1 + d3 \cdot \color{blue}{d1} \]

   2. distribute-rgt-out N/A

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

   3. lower-*.f64 N/A

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

   4. lower-+.f64 63.7

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

4. Applied rewrites 63.7%

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

5. Taylor expanded in d3 around 0

   \[\leadsto d1 \cdot 3 \]
6. Step-by-step derivation

7. Applied rewrites 27.5%

   \[\leadsto d1 \cdot 3 \]
8. Add Preprocessing

Developer Target 1: 99.9% accurate, 1.6× speedup

Math

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

FPCore

(FPCore (d1 d2 d3) :precision binary64 (* d1 (+ (+ 3.0 d2) d3)))

C

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2025122 
(FPCore (d1 d2 d3)
  :name "FastMath test3"
  :precision binary64

  :alt
  (! :herbie-platform c (* d1 (+ 3 d2 d3)))

  (+ (+ (* d1 3.0) (* d1 d2)) (* d1 d3)))