Numeric.SpecFunctions:logGamma from math-functions-0.1.5.2, A

Percentage Accurate: 100.0% → 100.0%

Time: 2.7s

Alternatives: 10

Speedup: 1.2×

Specification

Math

\[\begin{array}{l} \\ \left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (+ (- (* x (- y 1.0)) (* y 0.5)) 0.918938533204673))

C

double code(double x, double y) {
	return ((x * (y - 1.0)) - (y * 0.5)) + 0.918938533204673;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = ((x * (y - 1.0d0)) - (y * 0.5d0)) + 0.918938533204673d0
end function

Java

public static double code(double x, double y) {
	return ((x * (y - 1.0)) - (y * 0.5)) + 0.918938533204673;
}

Python

def code(x, y):
	return ((x * (y - 1.0)) - (y * 0.5)) + 0.918938533204673

Julia

function code(x, y)
	return Float64(Float64(Float64(x * Float64(y - 1.0)) - Float64(y * 0.5)) + 0.918938533204673)
end

MATLAB

function tmp = code(x, y)
	tmp = ((x * (y - 1.0)) - (y * 0.5)) + 0.918938533204673;
end

Wolfram

code[x_, y_] := N[(N[(N[(x * N[(y - 1.0), $MachinePrecision]), $MachinePrecision] - N[(y * 0.5), $MachinePrecision]), $MachinePrecision] + 0.918938533204673), $MachinePrecision]

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (+ (- (* x (- y 1.0)) (* y 0.5)) 0.918938533204673))

C

double code(double x, double y) {
	return ((x * (y - 1.0)) - (y * 0.5)) + 0.918938533204673;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = ((x * (y - 1.0d0)) - (y * 0.5d0)) + 0.918938533204673d0
end function

Java

public static double code(double x, double y) {
	return ((x * (y - 1.0)) - (y * 0.5)) + 0.918938533204673;
}

Python

def code(x, y):
	return ((x * (y - 1.0)) - (y * 0.5)) + 0.918938533204673

Julia

function code(x, y)
	return Float64(Float64(Float64(x * Float64(y - 1.0)) - Float64(y * 0.5)) + 0.918938533204673)
end

MATLAB

function tmp = code(x, y)
	tmp = ((x * (y - 1.0)) - (y * 0.5)) + 0.918938533204673;
end

Wolfram

code[x_, y_] := N[(N[(N[(x * N[(y - 1.0), $MachinePrecision]), $MachinePrecision] - N[(y * 0.5), $MachinePrecision]), $MachinePrecision] + 0.918938533204673), $MachinePrecision]

Alternative 1: 100.0% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(y - 1, x, \mathsf{fma}\left(-0.5, y, 0.918938533204673\right)\right) \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (fma (- y 1.0) x (fma -0.5 y 0.918938533204673)))

C

double code(double x, double y) {
	return fma((y - 1.0), x, fma(-0.5, y, 0.918938533204673));
}

Julia

function code(x, y)
	return fma(Float64(y - 1.0), x, fma(-0.5, y, 0.918938533204673))
end

Wolfram

code[x_, y_] := N[(N[(y - 1.0), $MachinePrecision] * x + N[(-0.5 * y + 0.918938533204673), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]
2. Step-by-step derivation

   1. lift-+.f64 N/A

      \[\leadsto \color{blue}{\left(x \cdot \left(y - 1\right) - y \cdot \frac{1}{2}\right) + \frac{918938533204673}{1000000000000000}} \]

   2. lift--.f64 N/A

      \[\leadsto \color{blue}{\left(x \cdot \left(y - 1\right) - y \cdot \frac{1}{2}\right)} + \frac{918938533204673}{1000000000000000} \]

   3. lift--.f64 N/A

      \[\leadsto \left(x \cdot \color{blue}{\left(y - 1\right)} - y \cdot \frac{1}{2}\right) + \frac{918938533204673}{1000000000000000} \]

   4. lift-*.f64 N/A

      \[\leadsto \left(\color{blue}{x \cdot \left(y - 1\right)} - y \cdot \frac{1}{2}\right) + \frac{918938533204673}{1000000000000000} \]

   5. associate-+l- N/A

      \[\leadsto \color{blue}{x \cdot \left(y - 1\right) - \left(y \cdot \frac{1}{2} - \frac{918938533204673}{1000000000000000}\right)} \]

   6. lift-*.f64 N/A

      \[\leadsto x \cdot \left(y - 1\right) - \left(\color{blue}{y \cdot \frac{1}{2}} - \frac{918938533204673}{1000000000000000}\right) \]

   7. *-commutative N/A

      \[\leadsto x \cdot \left(y - 1\right) - \left(\color{blue}{\frac{1}{2} \cdot y} - \frac{918938533204673}{1000000000000000}\right) \]

   8. associate-+l- N/A

      \[\leadsto \color{blue}{\left(x \cdot \left(y - 1\right) - \frac{1}{2} \cdot y\right) + \frac{918938533204673}{1000000000000000}} \]

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

      \[\leadsto \color{blue}{\left(x \cdot \left(y - 1\right) + \left(\mathsf{neg}\left(\frac{1}{2}\right)\right) \cdot y\right)} + \frac{918938533204673}{1000000000000000} \]

   10. metadata-eval N/A

       \[\leadsto \left(x \cdot \left(y - 1\right) + \color{blue}{\frac{-1}{2}} \cdot y\right) + \frac{918938533204673}{1000000000000000} \]

   11. associate-+l+ N/A

       \[\leadsto \color{blue}{x \cdot \left(y - 1\right) + \left(\frac{-1}{2} \cdot y + \frac{918938533204673}{1000000000000000}\right)} \]

   12. *-commutative N/A

       \[\leadsto \color{blue}{\left(y - 1\right) \cdot x} + \left(\frac{-1}{2} \cdot y + \frac{918938533204673}{1000000000000000}\right) \]

   13. +-commutative N/A

       \[\leadsto \left(y - 1\right) \cdot x + \color{blue}{\left(\frac{918938533204673}{1000000000000000} + \frac{-1}{2} \cdot y\right)} \]

   14. metadata-eval N/A

       \[\leadsto \left(y - 1\right) \cdot x + \left(\frac{918938533204673}{1000000000000000} + \color{blue}{\left(\mathsf{neg}\left(\frac{1}{2}\right)\right)} \cdot y\right) \]

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

       \[\leadsto \left(y - 1\right) \cdot x + \color{blue}{\left(\frac{918938533204673}{1000000000000000} - \frac{1}{2} \cdot y\right)} \]

   16. lower-fma.f64 N/A

       \[\leadsto \color{blue}{\mathsf{fma}\left(y - 1, x, \frac{918938533204673}{1000000000000000} - \frac{1}{2} \cdot y\right)} \]

   17. lift--.f64 N/A

       \[\leadsto \mathsf{fma}\left(\color{blue}{y - 1}, x, \frac{918938533204673}{1000000000000000} - \frac{1}{2} \cdot y\right) \]

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

       \[\leadsto \mathsf{fma}\left(y - 1, x, \color{blue}{\frac{918938533204673}{1000000000000000} + \left(\mathsf{neg}\left(\frac{1}{2}\right)\right) \cdot y}\right) \]

   19. metadata-eval N/A

       \[\leadsto \mathsf{fma}\left(y - 1, x, \frac{918938533204673}{1000000000000000} + \color{blue}{\frac{-1}{2}} \cdot y\right) \]

   20. +-commutative N/A

       \[\leadsto \mathsf{fma}\left(y - 1, x, \color{blue}{\frac{-1}{2} \cdot y + \frac{918938533204673}{1000000000000000}}\right) \]

   21. lower-fma.f64 100.0

       \[\leadsto \mathsf{fma}\left(y - 1, x, \color{blue}{\mathsf{fma}\left(-0.5, y, 0.918938533204673\right)}\right) \]

3. Applied rewrites 100.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(y - 1, x, \mathsf{fma}\left(-0.5, y, 0.918938533204673\right)\right)} \]
4. Add Preprocessing

Alternative 2: 98.6% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(y - 1\right) \cdot x\\ \mathbf{if}\;x \leq -23000000000:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq 125000:\\ \;\;\;\;\mathsf{fma}\left(y, x, \mathsf{fma}\left(-0.5, y, 0.918938533204673\right)\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (* (- y 1.0) x)))
   (if (<= x -23000000000.0)
     t_0
     (if (<= x 125000.0) (fma y x (fma -0.5 y 0.918938533204673)) t_0))))

C

double code(double x, double y) {
	double t_0 = (y - 1.0) * x;
	double tmp;
	if (x <= -23000000000.0) {
		tmp = t_0;
	} else if (x <= 125000.0) {
		tmp = fma(y, x, fma(-0.5, y, 0.918938533204673));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y)
	t_0 = Float64(Float64(y - 1.0) * x)
	tmp = 0.0
	if (x <= -23000000000.0)
		tmp = t_0;
	elseif (x <= 125000.0)
		tmp = fma(y, x, fma(-0.5, y, 0.918938533204673));
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(y - 1.0), $MachinePrecision] * x), $MachinePrecision]}, If[LessEqual[x, -23000000000.0], t$95$0, If[LessEqual[x, 125000.0], N[(y * x + N[(-0.5 * y + 0.918938533204673), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if x < -2.3e10 or 125000 < x

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]

   2. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \left(y - 1\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lift--.f64 99.4

         \[\leadsto \left(y - 1\right) \cdot x \]

   4. Applied rewrites 99.4%

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

   if -2.3e10 < x < 125000

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]
   2. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \color{blue}{\left(x \cdot \left(y - 1\right) - y \cdot \frac{1}{2}\right) + \frac{918938533204673}{1000000000000000}} \]

      2. lift--.f64 N/A

         \[\leadsto \color{blue}{\left(x \cdot \left(y - 1\right) - y \cdot \frac{1}{2}\right)} + \frac{918938533204673}{1000000000000000} \]

      3. lift--.f64 N/A

         \[\leadsto \left(x \cdot \color{blue}{\left(y - 1\right)} - y \cdot \frac{1}{2}\right) + \frac{918938533204673}{1000000000000000} \]

      4. lift-*.f64 N/A

         \[\leadsto \left(\color{blue}{x \cdot \left(y - 1\right)} - y \cdot \frac{1}{2}\right) + \frac{918938533204673}{1000000000000000} \]

      5. associate-+l- N/A

         \[\leadsto \color{blue}{x \cdot \left(y - 1\right) - \left(y \cdot \frac{1}{2} - \frac{918938533204673}{1000000000000000}\right)} \]

      6. lift-*.f64 N/A

         \[\leadsto x \cdot \left(y - 1\right) - \left(\color{blue}{y \cdot \frac{1}{2}} - \frac{918938533204673}{1000000000000000}\right) \]

      7. *-commutative N/A

         \[\leadsto x \cdot \left(y - 1\right) - \left(\color{blue}{\frac{1}{2} \cdot y} - \frac{918938533204673}{1000000000000000}\right) \]

      8. associate-+l- N/A

         \[\leadsto \color{blue}{\left(x \cdot \left(y - 1\right) - \frac{1}{2} \cdot y\right) + \frac{918938533204673}{1000000000000000}} \]

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

         \[\leadsto \color{blue}{\left(x \cdot \left(y - 1\right) + \left(\mathsf{neg}\left(\frac{1}{2}\right)\right) \cdot y\right)} + \frac{918938533204673}{1000000000000000} \]

      10. metadata-eval N/A

          \[\leadsto \left(x \cdot \left(y - 1\right) + \color{blue}{\frac{-1}{2}} \cdot y\right) + \frac{918938533204673}{1000000000000000} \]

      11. associate-+l+ N/A

          \[\leadsto \color{blue}{x \cdot \left(y - 1\right) + \left(\frac{-1}{2} \cdot y + \frac{918938533204673}{1000000000000000}\right)} \]

      12. *-commutative N/A

          \[\leadsto \color{blue}{\left(y - 1\right) \cdot x} + \left(\frac{-1}{2} \cdot y + \frac{918938533204673}{1000000000000000}\right) \]

      13. +-commutative N/A

          \[\leadsto \left(y - 1\right) \cdot x + \color{blue}{\left(\frac{918938533204673}{1000000000000000} + \frac{-1}{2} \cdot y\right)} \]

      14. metadata-eval N/A

          \[\leadsto \left(y - 1\right) \cdot x + \left(\frac{918938533204673}{1000000000000000} + \color{blue}{\left(\mathsf{neg}\left(\frac{1}{2}\right)\right)} \cdot y\right) \]

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

          \[\leadsto \left(y - 1\right) \cdot x + \color{blue}{\left(\frac{918938533204673}{1000000000000000} - \frac{1}{2} \cdot y\right)} \]

      16. lower-fma.f64 N/A

          \[\leadsto \color{blue}{\mathsf{fma}\left(y - 1, x, \frac{918938533204673}{1000000000000000} - \frac{1}{2} \cdot y\right)} \]

      17. lift--.f64 N/A

          \[\leadsto \mathsf{fma}\left(\color{blue}{y - 1}, x, \frac{918938533204673}{1000000000000000} - \frac{1}{2} \cdot y\right) \]

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

          \[\leadsto \mathsf{fma}\left(y - 1, x, \color{blue}{\frac{918938533204673}{1000000000000000} + \left(\mathsf{neg}\left(\frac{1}{2}\right)\right) \cdot y}\right) \]

      19. metadata-eval N/A

          \[\leadsto \mathsf{fma}\left(y - 1, x, \frac{918938533204673}{1000000000000000} + \color{blue}{\frac{-1}{2}} \cdot y\right) \]

      20. +-commutative N/A

          \[\leadsto \mathsf{fma}\left(y - 1, x, \color{blue}{\frac{-1}{2} \cdot y + \frac{918938533204673}{1000000000000000}}\right) \]

      21. lower-fma.f64 100.0

          \[\leadsto \mathsf{fma}\left(y - 1, x, \color{blue}{\mathsf{fma}\left(-0.5, y, 0.918938533204673\right)}\right) \]

   3. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y - 1, x, \mathsf{fma}\left(-0.5, y, 0.918938533204673\right)\right)} \]

   4. Taylor expanded in y around inf

      \[\leadsto \mathsf{fma}\left(\color{blue}{y}, x, \mathsf{fma}\left(\frac{-1}{2}, y, \frac{918938533204673}{1000000000000000}\right)\right) \]
   5. Step-by-step derivation

   6. Applied rewrites 97.8%

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

Alternative 3: 98.6% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(y - 1\right) \cdot x\\ \mathbf{if}\;x \leq -23000000000:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq 125000:\\ \;\;\;\;\left(x - 0.5\right) \cdot y + 0.918938533204673\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (* (- y 1.0) x)))
   (if (<= x -23000000000.0)
     t_0
     (if (<= x 125000.0) (+ (* (- x 0.5) y) 0.918938533204673) t_0))))

C

double code(double x, double y) {
	double t_0 = (y - 1.0) * x;
	double tmp;
	if (x <= -23000000000.0) {
		tmp = t_0;
	} else if (x <= 125000.0) {
		tmp = ((x - 0.5) * y) + 0.918938533204673;
	} 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(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (y - 1.0d0) * x
    if (x <= (-23000000000.0d0)) then
        tmp = t_0
    else if (x <= 125000.0d0) then
        tmp = ((x - 0.5d0) * y) + 0.918938533204673d0
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = (y - 1.0) * x;
	double tmp;
	if (x <= -23000000000.0) {
		tmp = t_0;
	} else if (x <= 125000.0) {
		tmp = ((x - 0.5) * y) + 0.918938533204673;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = (y - 1.0) * x
	tmp = 0
	if x <= -23000000000.0:
		tmp = t_0
	elif x <= 125000.0:
		tmp = ((x - 0.5) * y) + 0.918938533204673
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y)
	t_0 = Float64(Float64(y - 1.0) * x)
	tmp = 0.0
	if (x <= -23000000000.0)
		tmp = t_0;
	elseif (x <= 125000.0)
		tmp = Float64(Float64(Float64(x - 0.5) * y) + 0.918938533204673);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = (y - 1.0) * x;
	tmp = 0.0;
	if (x <= -23000000000.0)
		tmp = t_0;
	elseif (x <= 125000.0)
		tmp = ((x - 0.5) * y) + 0.918938533204673;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(y - 1.0), $MachinePrecision] * x), $MachinePrecision]}, If[LessEqual[x, -23000000000.0], t$95$0, If[LessEqual[x, 125000.0], N[(N[(N[(x - 0.5), $MachinePrecision] * y), $MachinePrecision] + 0.918938533204673), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if x < -2.3e10 or 125000 < x

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]

   2. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \left(y - 1\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lift--.f64 99.4

         \[\leadsto \left(y - 1\right) \cdot x \]

   4. Applied rewrites 99.4%

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

   if -2.3e10 < x < 125000

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]

   2. Taylor expanded in y around inf

      \[\leadsto \color{blue}{y \cdot \left(x - \frac{1}{2}\right)} + \frac{918938533204673}{1000000000000000} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(x - \frac{1}{2}\right) \cdot \color{blue}{y} + \frac{918938533204673}{1000000000000000} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(x - \frac{1}{2}\right) \cdot \color{blue}{y} + \frac{918938533204673}{1000000000000000} \]

      3. lower--.f64 97.8

         \[\leadsto \left(x - 0.5\right) \cdot y + 0.918938533204673 \]

   4. Applied rewrites 97.8%

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

Alternative 4: 97.9% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(y - 1\right) \cdot x\\ \mathbf{if}\;x \leq -0.66:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq 0.85:\\ \;\;\;\;\mathsf{fma}\left(-0.5, y, 0.918938533204673\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (* (- y 1.0) x)))
   (if (<= x -0.66) t_0 (if (<= x 0.85) (fma -0.5 y 0.918938533204673) t_0))))

C

double code(double x, double y) {
	double t_0 = (y - 1.0) * x;
	double tmp;
	if (x <= -0.66) {
		tmp = t_0;
	} else if (x <= 0.85) {
		tmp = fma(-0.5, y, 0.918938533204673);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y)
	t_0 = Float64(Float64(y - 1.0) * x)
	tmp = 0.0
	if (x <= -0.66)
		tmp = t_0;
	elseif (x <= 0.85)
		tmp = fma(-0.5, y, 0.918938533204673);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(y - 1.0), $MachinePrecision] * x), $MachinePrecision]}, If[LessEqual[x, -0.66], t$95$0, If[LessEqual[x, 0.85], N[(-0.5 * y + 0.918938533204673), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if x < -0.660000000000000031 or 0.849999999999999978 < x

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]

   2. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \left(y - 1\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lift--.f64 97.7

         \[\leadsto \left(y - 1\right) \cdot x \]

   4. Applied rewrites 97.7%

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

   if -0.660000000000000031 < x < 0.849999999999999978

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]

   2. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{918938533204673}{1000000000000000} - \frac{1}{2} \cdot y} \]
   3. Step-by-step derivation

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

         \[\leadsto \frac{918938533204673}{1000000000000000} + \color{blue}{\left(\mathsf{neg}\left(\frac{1}{2}\right)\right) \cdot y} \]

      2. metadata-eval N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} + \frac{-1}{2} \cdot y \]

      3. +-commutative N/A

         \[\leadsto \frac{-1}{2} \cdot y + \color{blue}{\frac{918938533204673}{1000000000000000}} \]

      4. lower-fma.f64 97.7

         \[\leadsto \mathsf{fma}\left(-0.5, \color{blue}{y}, 0.918938533204673\right) \]

   4. Applied rewrites 97.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-0.5, y, 0.918938533204673\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 97.7% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(x - 0.5\right) \cdot y\\ \mathbf{if}\;y \leq -1.5:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 1.05:\\ \;\;\;\;0.918938533204673 - x\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (* (- x 0.5) y)))
   (if (<= y -1.5) t_0 (if (<= y 1.05) (- 0.918938533204673 x) t_0))))

C

double code(double x, double y) {
	double t_0 = (x - 0.5) * y;
	double tmp;
	if (y <= -1.5) {
		tmp = t_0;
	} else if (y <= 1.05) {
		tmp = 0.918938533204673 - x;
	} 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(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (x - 0.5d0) * y
    if (y <= (-1.5d0)) then
        tmp = t_0
    else if (y <= 1.05d0) then
        tmp = 0.918938533204673d0 - x
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = (x - 0.5) * y;
	double tmp;
	if (y <= -1.5) {
		tmp = t_0;
	} else if (y <= 1.05) {
		tmp = 0.918938533204673 - x;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = (x - 0.5) * y
	tmp = 0
	if y <= -1.5:
		tmp = t_0
	elif y <= 1.05:
		tmp = 0.918938533204673 - x
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y)
	t_0 = Float64(Float64(x - 0.5) * y)
	tmp = 0.0
	if (y <= -1.5)
		tmp = t_0;
	elseif (y <= 1.05)
		tmp = Float64(0.918938533204673 - x);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = (x - 0.5) * y;
	tmp = 0.0;
	if (y <= -1.5)
		tmp = t_0;
	elseif (y <= 1.05)
		tmp = 0.918938533204673 - x;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(x - 0.5), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[y, -1.5], t$95$0, If[LessEqual[y, 1.05], N[(0.918938533204673 - x), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -1.5 or 1.05000000000000004 < y

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]

   2. Taylor expanded in y around inf

      \[\leadsto \color{blue}{y \cdot \left(x - \frac{1}{2}\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(x - \frac{1}{2}\right) \cdot \color{blue}{y} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(x - \frac{1}{2}\right) \cdot \color{blue}{y} \]

      3. lower--.f64 98.0

         \[\leadsto \left(x - 0.5\right) \cdot y \]

   4. Applied rewrites 98.0%

      \[\leadsto \color{blue}{\left(x - 0.5\right) \cdot y} \]

   if -1.5 < y < 1.05000000000000004

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]

   2. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\frac{918938533204673}{1000000000000000} + -1 \cdot x} \]
   3. Step-by-step derivation

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

         \[\leadsto \frac{918938533204673}{1000000000000000} - \color{blue}{\left(\mathsf{neg}\left(-1\right)\right) \cdot x} \]

      2. metadata-eval N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - 1 \cdot x \]

      3. *-lft-identity N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - x \]

      4. lower--.f64 97.7

         \[\leadsto 0.918938533204673 - \color{blue}{x} \]

   4. Applied rewrites 97.7%

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

Alternative 6: 74.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -720000000000:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;y \leq 1.2 \cdot 10^{-6}:\\ \;\;\;\;0.918938533204673 - x\\ \mathbf{elif}\;y \leq 9.2 \cdot 10^{+57}:\\ \;\;\;\;\mathsf{fma}\left(-0.5, y, 0.918938533204673\right)\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -720000000000.0)
   (* y x)
   (if (<= y 1.2e-6)
     (- 0.918938533204673 x)
     (if (<= y 9.2e+57) (fma -0.5 y 0.918938533204673) (* y x)))))

C

double code(double x, double y) {
	double tmp;
	if (y <= -720000000000.0) {
		tmp = y * x;
	} else if (y <= 1.2e-6) {
		tmp = 0.918938533204673 - x;
	} else if (y <= 9.2e+57) {
		tmp = fma(-0.5, y, 0.918938533204673);
	} else {
		tmp = y * x;
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -720000000000.0)
		tmp = Float64(y * x);
	elseif (y <= 1.2e-6)
		tmp = Float64(0.918938533204673 - x);
	elseif (y <= 9.2e+57)
		tmp = fma(-0.5, y, 0.918938533204673);
	else
		tmp = Float64(y * x);
	end
	return tmp
end

Wolfram

code[x_, y_] := If[LessEqual[y, -720000000000.0], N[(y * x), $MachinePrecision], If[LessEqual[y, 1.2e-6], N[(0.918938533204673 - x), $MachinePrecision], If[LessEqual[y, 9.2e+57], N[(-0.5 * y + 0.918938533204673), $MachinePrecision], N[(y * x), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if y < -7.2e11 or 9.1999999999999995e57 < y

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]

   2. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \left(y - 1\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lift--.f64 51.4

         \[\leadsto \left(y - 1\right) \cdot x \]

   4. Applied rewrites 51.4%

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

   5. Taylor expanded in y around inf

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

   7. Applied rewrites 51.3%

      \[\leadsto y \cdot x \]

   if -7.2e11 < y < 1.1999999999999999e-6

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]

   2. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\frac{918938533204673}{1000000000000000} + -1 \cdot x} \]
   3. Step-by-step derivation

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

         \[\leadsto \frac{918938533204673}{1000000000000000} - \color{blue}{\left(\mathsf{neg}\left(-1\right)\right) \cdot x} \]

      2. metadata-eval N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - 1 \cdot x \]

      3. *-lft-identity N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - x \]

      4. lower--.f64 97.0

         \[\leadsto 0.918938533204673 - \color{blue}{x} \]

   4. Applied rewrites 97.0%

      \[\leadsto \color{blue}{0.918938533204673 - x} \]

   if 1.1999999999999999e-6 < y < 9.1999999999999995e57

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]

   2. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{918938533204673}{1000000000000000} - \frac{1}{2} \cdot y} \]
   3. Step-by-step derivation

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

         \[\leadsto \frac{918938533204673}{1000000000000000} + \color{blue}{\left(\mathsf{neg}\left(\frac{1}{2}\right)\right) \cdot y} \]

      2. metadata-eval N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} + \frac{-1}{2} \cdot y \]

      3. +-commutative N/A

         \[\leadsto \frac{-1}{2} \cdot y + \color{blue}{\frac{918938533204673}{1000000000000000}} \]

      4. lower-fma.f64 50.3

         \[\leadsto \mathsf{fma}\left(-0.5, \color{blue}{y}, 0.918938533204673\right) \]

   4. Applied rewrites 50.3%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-0.5, y, 0.918938533204673\right)} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 7: 74.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -720000000000:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;y \leq 1.05:\\ \;\;\;\;0.918938533204673 - x\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -720000000000.0)
   (* y x)
   (if (<= y 1.05) (- 0.918938533204673 x) (* y x))))

C

double code(double x, double y) {
	double tmp;
	if (y <= -720000000000.0) {
		tmp = y * x;
	} else if (y <= 1.05) {
		tmp = 0.918938533204673 - x;
	} else {
		tmp = y * x;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (y <= (-720000000000.0d0)) then
        tmp = y * x
    else if (y <= 1.05d0) then
        tmp = 0.918938533204673d0 - x
    else
        tmp = y * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= -720000000000.0) {
		tmp = y * x;
	} else if (y <= 1.05) {
		tmp = 0.918938533204673 - x;
	} else {
		tmp = y * x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -720000000000.0:
		tmp = y * x
	elif y <= 1.05:
		tmp = 0.918938533204673 - x
	else:
		tmp = y * x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -720000000000.0)
		tmp = Float64(y * x);
	elseif (y <= 1.05)
		tmp = Float64(0.918938533204673 - x);
	else
		tmp = Float64(y * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -720000000000.0)
		tmp = y * x;
	elseif (y <= 1.05)
		tmp = 0.918938533204673 - x;
	else
		tmp = y * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -720000000000.0], N[(y * x), $MachinePrecision], If[LessEqual[y, 1.05], N[(0.918938533204673 - x), $MachinePrecision], N[(y * x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if y < -7.2e11 or 1.05000000000000004 < y

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]

   2. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \left(y - 1\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lift--.f64 51.3

         \[\leadsto \left(y - 1\right) \cdot x \]

   4. Applied rewrites 51.3%

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

   5. Taylor expanded in y around inf

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

   7. Applied rewrites 50.7%

      \[\leadsto y \cdot x \]

   if -7.2e11 < y < 1.05000000000000004

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]

   2. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\frac{918938533204673}{1000000000000000} + -1 \cdot x} \]
   3. Step-by-step derivation

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

         \[\leadsto \frac{918938533204673}{1000000000000000} - \color{blue}{\left(\mathsf{neg}\left(-1\right)\right) \cdot x} \]

      2. metadata-eval N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - 1 \cdot x \]

      3. *-lft-identity N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - x \]

      4. lower--.f64 96.4

         \[\leadsto 0.918938533204673 - \color{blue}{x} \]

   4. Applied rewrites 96.4%

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

Alternative 8: 61.3% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673\\ \mathbf{if}\;t\_0 \leq -5 \cdot 10^{+221}:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;t\_0 \leq -5 \cdot 10^{+177}:\\ \;\;\;\;-0.5 \cdot y\\ \mathbf{elif}\;t\_0 \leq -10000:\\ \;\;\;\;-x\\ \mathbf{elif}\;t\_0 \leq 2:\\ \;\;\;\;0.918938533204673\\ \mathbf{elif}\;t\_0 \leq 2 \cdot 10^{+307}:\\ \;\;\;\;-x\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (+ (- (* x (- y 1.0)) (* y 0.5)) 0.918938533204673)))
   (if (<= t_0 -5e+221)
     (* y x)
     (if (<= t_0 -5e+177)
       (* -0.5 y)
       (if (<= t_0 -10000.0)
         (- x)
         (if (<= t_0 2.0)
           0.918938533204673
           (if (<= t_0 2e+307) (- x) (* y x))))))))

C

double code(double x, double y) {
	double t_0 = ((x * (y - 1.0)) - (y * 0.5)) + 0.918938533204673;
	double tmp;
	if (t_0 <= -5e+221) {
		tmp = y * x;
	} else if (t_0 <= -5e+177) {
		tmp = -0.5 * y;
	} else if (t_0 <= -10000.0) {
		tmp = -x;
	} else if (t_0 <= 2.0) {
		tmp = 0.918938533204673;
	} else if (t_0 <= 2e+307) {
		tmp = -x;
	} else {
		tmp = y * x;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: t_0
    real(8) :: tmp
    t_0 = ((x * (y - 1.0d0)) - (y * 0.5d0)) + 0.918938533204673d0
    if (t_0 <= (-5d+221)) then
        tmp = y * x
    else if (t_0 <= (-5d+177)) then
        tmp = (-0.5d0) * y
    else if (t_0 <= (-10000.0d0)) then
        tmp = -x
    else if (t_0 <= 2.0d0) then
        tmp = 0.918938533204673d0
    else if (t_0 <= 2d+307) then
        tmp = -x
    else
        tmp = y * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = ((x * (y - 1.0)) - (y * 0.5)) + 0.918938533204673;
	double tmp;
	if (t_0 <= -5e+221) {
		tmp = y * x;
	} else if (t_0 <= -5e+177) {
		tmp = -0.5 * y;
	} else if (t_0 <= -10000.0) {
		tmp = -x;
	} else if (t_0 <= 2.0) {
		tmp = 0.918938533204673;
	} else if (t_0 <= 2e+307) {
		tmp = -x;
	} else {
		tmp = y * x;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = ((x * (y - 1.0)) - (y * 0.5)) + 0.918938533204673
	tmp = 0
	if t_0 <= -5e+221:
		tmp = y * x
	elif t_0 <= -5e+177:
		tmp = -0.5 * y
	elif t_0 <= -10000.0:
		tmp = -x
	elif t_0 <= 2.0:
		tmp = 0.918938533204673
	elif t_0 <= 2e+307:
		tmp = -x
	else:
		tmp = y * x
	return tmp

Julia

function code(x, y)
	t_0 = Float64(Float64(Float64(x * Float64(y - 1.0)) - Float64(y * 0.5)) + 0.918938533204673)
	tmp = 0.0
	if (t_0 <= -5e+221)
		tmp = Float64(y * x);
	elseif (t_0 <= -5e+177)
		tmp = Float64(-0.5 * y);
	elseif (t_0 <= -10000.0)
		tmp = Float64(-x);
	elseif (t_0 <= 2.0)
		tmp = 0.918938533204673;
	elseif (t_0 <= 2e+307)
		tmp = Float64(-x);
	else
		tmp = Float64(y * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = ((x * (y - 1.0)) - (y * 0.5)) + 0.918938533204673;
	tmp = 0.0;
	if (t_0 <= -5e+221)
		tmp = y * x;
	elseif (t_0 <= -5e+177)
		tmp = -0.5 * y;
	elseif (t_0 <= -10000.0)
		tmp = -x;
	elseif (t_0 <= 2.0)
		tmp = 0.918938533204673;
	elseif (t_0 <= 2e+307)
		tmp = -x;
	else
		tmp = y * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(N[(x * N[(y - 1.0), $MachinePrecision]), $MachinePrecision] - N[(y * 0.5), $MachinePrecision]), $MachinePrecision] + 0.918938533204673), $MachinePrecision]}, If[LessEqual[t$95$0, -5e+221], N[(y * x), $MachinePrecision], If[LessEqual[t$95$0, -5e+177], N[(-0.5 * y), $MachinePrecision], If[LessEqual[t$95$0, -10000.0], (-x), If[LessEqual[t$95$0, 2.0], 0.918938533204673, If[LessEqual[t$95$0, 2e+307], (-x), N[(y * x), $MachinePrecision]]]]]]]

Derivation

1. Split input into 4 regimes

2. if (+.f64 (-.f64 (*.f64 x (-.f64 y #s(literal 1 binary64))) (*.f64 y #s(literal 1/2 binary64))) #s(literal 918938533204673/1000000000000000 binary64)) < -5.0000000000000002e221 or 1.99999999999999997e307 < (+.f64 (-.f64 (*.f64 x (-.f64 y #s(literal 1 binary64))) (*.f64 y #s(literal 1/2 binary64))) #s(literal 918938533204673/1000000000000000 binary64))

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]

   2. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \left(y - 1\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lift--.f64 84.0

         \[\leadsto \left(y - 1\right) \cdot x \]

   4. Applied rewrites 84.0%

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

   5. Taylor expanded in y around inf

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

   7. Applied rewrites 68.6%

      \[\leadsto y \cdot x \]

   if -5.0000000000000002e221 < (+.f64 (-.f64 (*.f64 x (-.f64 y #s(literal 1 binary64))) (*.f64 y #s(literal 1/2 binary64))) #s(literal 918938533204673/1000000000000000 binary64)) < -5.0000000000000003e177

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]

   2. Taylor expanded in y around inf

      \[\leadsto \color{blue}{y \cdot \left(x - \frac{1}{2}\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(x - \frac{1}{2}\right) \cdot \color{blue}{y} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(x - \frac{1}{2}\right) \cdot \color{blue}{y} \]

      3. lower--.f64 61.3

         \[\leadsto \left(x - 0.5\right) \cdot y \]

   4. Applied rewrites 61.3%

      \[\leadsto \color{blue}{\left(x - 0.5\right) \cdot y} \]

   5. Taylor expanded in x around 0

      \[\leadsto \frac{-1}{2} \cdot y \]
   6. Step-by-step derivation

   7. Applied rewrites 37.5%

      \[\leadsto -0.5 \cdot y \]

   if -5.0000000000000003e177 < (+.f64 (-.f64 (*.f64 x (-.f64 y #s(literal 1 binary64))) (*.f64 y #s(literal 1/2 binary64))) #s(literal 918938533204673/1000000000000000 binary64)) < -1e4 or 2 < (+.f64 (-.f64 (*.f64 x (-.f64 y #s(literal 1 binary64))) (*.f64 y #s(literal 1/2 binary64))) #s(literal 918938533204673/1000000000000000 binary64)) < 1.99999999999999997e307

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]

   2. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\frac{918938533204673}{1000000000000000} + -1 \cdot x} \]
   3. Step-by-step derivation

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

         \[\leadsto \frac{918938533204673}{1000000000000000} - \color{blue}{\left(\mathsf{neg}\left(-1\right)\right) \cdot x} \]

      2. metadata-eval N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - 1 \cdot x \]

      3. *-lft-identity N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - x \]

      4. lower--.f64 42.9

         \[\leadsto 0.918938533204673 - \color{blue}{x} \]

   4. Applied rewrites 42.9%

      \[\leadsto \color{blue}{0.918938533204673 - x} \]

   5. Taylor expanded in x around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 41.7

         \[\leadsto -x \]

   7. Applied rewrites 41.7%

      \[\leadsto -x \]

   if -1e4 < (+.f64 (-.f64 (*.f64 x (-.f64 y #s(literal 1 binary64))) (*.f64 y #s(literal 1/2 binary64))) #s(literal 918938533204673/1000000000000000 binary64)) < 2

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]

   2. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\frac{918938533204673}{1000000000000000} + -1 \cdot x} \]
   3. Step-by-step derivation

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

         \[\leadsto \frac{918938533204673}{1000000000000000} - \color{blue}{\left(\mathsf{neg}\left(-1\right)\right) \cdot x} \]

      2. metadata-eval N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - 1 \cdot x \]

      3. *-lft-identity N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - x \]

      4. lower--.f64 97.2

         \[\leadsto 0.918938533204673 - \color{blue}{x} \]

   4. Applied rewrites 97.2%

      \[\leadsto \color{blue}{0.918938533204673 - x} \]

   5. Taylor expanded in x around 0

      \[\leadsto \frac{918938533204673}{1000000000000000} \]
   6. Step-by-step derivation

   7. Applied rewrites 94.5%

      \[\leadsto 0.918938533204673 \]
3. Recombined 4 regimes into one program.
4. Add Preprocessing

Alternative 9: 49.9% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -0.9:\\ \;\;\;\;-x\\ \mathbf{elif}\;x \leq 0.9:\\ \;\;\;\;0.918938533204673\\ \mathbf{else}:\\ \;\;\;\;-x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -0.9) (- x) (if (<= x 0.9) 0.918938533204673 (- x))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -0.9) {
		tmp = -x;
	} else if (x <= 0.9) {
		tmp = 0.918938533204673;
	} else {
		tmp = -x;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (x <= (-0.9d0)) then
        tmp = -x
    else if (x <= 0.9d0) then
        tmp = 0.918938533204673d0
    else
        tmp = -x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -0.9) {
		tmp = -x;
	} else if (x <= 0.9) {
		tmp = 0.918938533204673;
	} else {
		tmp = -x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -0.9:
		tmp = -x
	elif x <= 0.9:
		tmp = 0.918938533204673
	else:
		tmp = -x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -0.9)
		tmp = Float64(-x);
	elseif (x <= 0.9)
		tmp = 0.918938533204673;
	else
		tmp = Float64(-x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -0.9)
		tmp = -x;
	elseif (x <= 0.9)
		tmp = 0.918938533204673;
	else
		tmp = -x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -0.9], (-x), If[LessEqual[x, 0.9], 0.918938533204673, (-x)]]

Derivation

1. Split input into 2 regimes

2. if x < -0.900000000000000022 or 0.900000000000000022 < x

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]

   2. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\frac{918938533204673}{1000000000000000} + -1 \cdot x} \]
   3. Step-by-step derivation

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

         \[\leadsto \frac{918938533204673}{1000000000000000} - \color{blue}{\left(\mathsf{neg}\left(-1\right)\right) \cdot x} \]

      2. metadata-eval N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - 1 \cdot x \]

      3. *-lft-identity N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - x \]

      4. lower--.f64 50.3

         \[\leadsto 0.918938533204673 - \color{blue}{x} \]

   4. Applied rewrites 50.3%

      \[\leadsto \color{blue}{0.918938533204673 - x} \]

   5. Taylor expanded in x around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 49.4

         \[\leadsto -x \]

   7. Applied rewrites 49.4%

      \[\leadsto -x \]

   if -0.900000000000000022 < x < 0.900000000000000022

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]

   2. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\frac{918938533204673}{1000000000000000} + -1 \cdot x} \]
   3. Step-by-step derivation

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

         \[\leadsto \frac{918938533204673}{1000000000000000} - \color{blue}{\left(\mathsf{neg}\left(-1\right)\right) \cdot x} \]

      2. metadata-eval N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - 1 \cdot x \]

      3. *-lft-identity N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - x \]

      4. lower--.f64 51.5

         \[\leadsto 0.918938533204673 - \color{blue}{x} \]

   4. Applied rewrites 51.5%

      \[\leadsto \color{blue}{0.918938533204673 - x} \]

   5. Taylor expanded in x around 0

      \[\leadsto \frac{918938533204673}{1000000000000000} \]
   6. Step-by-step derivation

   7. Applied rewrites 50.4%

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

Alternative 10: 26.5% accurate, 11.0× speedup

Math

\[\begin{array}{l} \\ 0.918938533204673 \end{array} \]

FPCore

(FPCore (x y) :precision binary64 0.918938533204673)

C

double code(double x, double y) {
	return 0.918938533204673;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = 0.918938533204673d0
end function

Java

public static double code(double x, double y) {
	return 0.918938533204673;
}

Python

def code(x, y):
	return 0.918938533204673

Julia

function code(x, y)
	return 0.918938533204673
end

MATLAB

function tmp = code(x, y)
	tmp = 0.918938533204673;
end

Wolfram

code[x_, y_] := 0.918938533204673

Derivation

1. Initial program 100.0%

   \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]

2. Taylor expanded in y around 0

   \[\leadsto \color{blue}{\frac{918938533204673}{1000000000000000} + -1 \cdot x} \]
3. Step-by-step derivation

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

      \[\leadsto \frac{918938533204673}{1000000000000000} - \color{blue}{\left(\mathsf{neg}\left(-1\right)\right) \cdot x} \]

   2. metadata-eval N/A

      \[\leadsto \frac{918938533204673}{1000000000000000} - 1 \cdot x \]

   3. *-lft-identity N/A

      \[\leadsto \frac{918938533204673}{1000000000000000} - x \]

   4. lower--.f64 50.9

      \[\leadsto 0.918938533204673 - \color{blue}{x} \]

4. Applied rewrites 50.9%

   \[\leadsto \color{blue}{0.918938533204673 - x} \]

5. Taylor expanded in x around 0

   \[\leadsto \frac{918938533204673}{1000000000000000} \]
6. Step-by-step derivation

7. Applied rewrites 26.5%

   \[\leadsto 0.918938533204673 \]
8. Add Preprocessing

Reproduce

herbie shell --seed 2025101 
(FPCore (x y)
  :name "Numeric.SpecFunctions:logGamma from math-functions-0.1.5.2, A"
  :precision binary64
  (+ (- (* x (- y 1.0)) (* y 0.5)) 0.918938533204673))