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

Percentage Accurate: 100.0% → 100.0%

Time: 5.9s

Alternatives: 13

Speedup: N/A×

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.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]
2. Add Preprocessing

3. Taylor expanded in x around 0

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

5. Applied rewrites 100.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(-0.5 + x, y, 0.918938533204673 - x\right)} \]
6. Step-by-step derivation

7. Applied rewrites 100.0%

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

Alternative 2: 99.8% accurate, 0.3× 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 -1 \cdot 10^{+37} \lor \neg \left(t\_0 \leq 20000000000000\right):\\ \;\;\;\;\mathsf{fma}\left(-0.5 + x, y, -x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-0.5, y, 0.918938533204673 - x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (+ (- (* x (- y 1.0)) (* y 0.5)) 0.918938533204673)))
   (if (or (<= t_0 -1e+37) (not (<= t_0 20000000000000.0)))
     (fma (+ -0.5 x) y (- x))
     (fma -0.5 y (- 0.918938533204673 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 <= -1e+37) || !(t_0 <= 20000000000000.0)) {
		tmp = fma((-0.5 + x), y, -x);
	} else {
		tmp = fma(-0.5, y, (0.918938533204673 - 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 <= -1e+37) || !(t_0 <= 20000000000000.0))
		tmp = fma(Float64(-0.5 + x), y, Float64(-x));
	else
		tmp = fma(-0.5, y, Float64(0.918938533204673 - x));
	end
	return 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[Or[LessEqual[t$95$0, -1e+37], N[Not[LessEqual[t$95$0, 20000000000000.0]], $MachinePrecision]], N[(N[(-0.5 + x), $MachinePrecision] * y + (-x)), $MachinePrecision], N[(-0.5 * y + N[(0.918938533204673 - x), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 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)) < -9.99999999999999954e36 or 2e13 < (+.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. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in x around inf

      \[\leadsto \mathsf{fma}\left(\frac{-1}{2} + x, y, -1 \cdot x\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 100.0%

      \[\leadsto \mathsf{fma}\left(-0.5 + x, y, -x\right) \]

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

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 99.4%

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

4. Final simplification 99.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \leq -1 \cdot 10^{+37} \lor \neg \left(\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \leq 20000000000000\right):\\ \;\;\;\;\mathsf{fma}\left(-0.5 + x, y, -x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-0.5, y, 0.918938533204673 - x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 73.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -5.5 \cdot 10^{+234}:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;y \leq -62:\\ \;\;\;\;-0.5 \cdot y\\ \mathbf{elif}\;y \leq 1.55:\\ \;\;\;\;0.918938533204673 - x\\ \mathbf{elif}\;y \leq 7 \cdot 10^{+216}:\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -5.5e+234)
   (* y x)
   (if (<= y -62.0)
     (* -0.5 y)
     (if (<= y 1.55)
       (- 0.918938533204673 x)
       (if (<= y 7e+216) (* y x) (* -0.5 y))))))

C

double code(double x, double y) {
	double tmp;
	if (y <= -5.5e+234) {
		tmp = y * x;
	} else if (y <= -62.0) {
		tmp = -0.5 * y;
	} else if (y <= 1.55) {
		tmp = 0.918938533204673 - x;
	} else if (y <= 7e+216) {
		tmp = y * x;
	} else {
		tmp = -0.5 * y;
	}
	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 <= (-5.5d+234)) then
        tmp = y * x
    else if (y <= (-62.0d0)) then
        tmp = (-0.5d0) * y
    else if (y <= 1.55d0) then
        tmp = 0.918938533204673d0 - x
    else if (y <= 7d+216) then
        tmp = y * x
    else
        tmp = (-0.5d0) * y
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= -5.5e+234) {
		tmp = y * x;
	} else if (y <= -62.0) {
		tmp = -0.5 * y;
	} else if (y <= 1.55) {
		tmp = 0.918938533204673 - x;
	} else if (y <= 7e+216) {
		tmp = y * x;
	} else {
		tmp = -0.5 * y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -5.5e+234:
		tmp = y * x
	elif y <= -62.0:
		tmp = -0.5 * y
	elif y <= 1.55:
		tmp = 0.918938533204673 - x
	elif y <= 7e+216:
		tmp = y * x
	else:
		tmp = -0.5 * y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -5.5e+234)
		tmp = Float64(y * x);
	elseif (y <= -62.0)
		tmp = Float64(-0.5 * y);
	elseif (y <= 1.55)
		tmp = Float64(0.918938533204673 - x);
	elseif (y <= 7e+216)
		tmp = Float64(y * x);
	else
		tmp = Float64(-0.5 * y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -5.5e+234)
		tmp = y * x;
	elseif (y <= -62.0)
		tmp = -0.5 * y;
	elseif (y <= 1.55)
		tmp = 0.918938533204673 - x;
	elseif (y <= 7e+216)
		tmp = y * x;
	else
		tmp = -0.5 * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -5.5e+234], N[(y * x), $MachinePrecision], If[LessEqual[y, -62.0], N[(-0.5 * y), $MachinePrecision], If[LessEqual[y, 1.55], N[(0.918938533204673 - x), $MachinePrecision], If[LessEqual[y, 7e+216], N[(y * x), $MachinePrecision], N[(-0.5 * y), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if y < -5.5e234 or 1.55000000000000004 < y < 6.99999999999999984e216

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 94.2

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

   5. Applied rewrites 94.2%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 62.2%

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

   if -5.5e234 < y < -62 or 6.99999999999999984e216 < y

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 98.3

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

   5. Applied rewrites 98.3%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 55.2%

      \[\leadsto -0.5 \cdot \color{blue}{y} \]

   if -62 < y < 1.55000000000000004

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

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

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

      2. metadata-eval N/A

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

      3. *-lft-identity N/A

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

      4. lower--.f64 97.9

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

   5. Applied rewrites 97.9%

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

Alternative 4: 98.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1 \lor \neg \left(y \leq 1\right):\\ \;\;\;\;\left(-0.5 + x\right) \cdot y + 0.918938533204673\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-0.5, y, 0.918938533204673 - x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -1.0) (not (<= y 1.0)))
   (+ (* (+ -0.5 x) y) 0.918938533204673)
   (fma -0.5 y (- 0.918938533204673 x))))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -1.0) || !(y <= 1.0)) {
		tmp = ((-0.5 + x) * y) + 0.918938533204673;
	} else {
		tmp = fma(-0.5, y, (0.918938533204673 - x));
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -1.0) || !(y <= 1.0))
		tmp = Float64(Float64(Float64(-0.5 + x) * y) + 0.918938533204673);
	else
		tmp = fma(-0.5, y, Float64(0.918938533204673 - x));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1 or 1 < y

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 98.4%

      \[\leadsto \mathsf{fma}\left(-0.5 + x, y, 0.918938533204673\right) \]
   9. Step-by-step derivation

   10. Applied rewrites 98.4%

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

   if -1 < y < 1

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 98.9%

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

4. Final simplification 98.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1 \lor \neg \left(y \leq 1\right):\\ \;\;\;\;\left(-0.5 + x\right) \cdot y + 0.918938533204673\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-0.5, y, 0.918938533204673 - x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 74.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.3 \cdot 10^{-15}:\\ \;\;\;\;0.918938533204673 - x\\ \mathbf{elif}\;x \leq 0.5:\\ \;\;\;\;\mathsf{fma}\left(-0.5, y, 0.918938533204673\right)\\ \mathbf{elif}\;x \leq 3 \cdot 10^{+153}:\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;-x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -1.3e-15)
   (- 0.918938533204673 x)
   (if (<= x 0.5)
     (fma -0.5 y 0.918938533204673)
     (if (<= x 3e+153) (* y x) (- x)))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -1.3e-15) {
		tmp = 0.918938533204673 - x;
	} else if (x <= 0.5) {
		tmp = fma(-0.5, y, 0.918938533204673);
	} else if (x <= 3e+153) {
		tmp = y * x;
	} else {
		tmp = -x;
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -1.3e-15)
		tmp = Float64(0.918938533204673 - x);
	elseif (x <= 0.5)
		tmp = fma(-0.5, y, 0.918938533204673);
	elseif (x <= 3e+153)
		tmp = Float64(y * x);
	else
		tmp = Float64(-x);
	end
	return tmp
end

Wolfram

code[x_, y_] := If[LessEqual[x, -1.3e-15], N[(0.918938533204673 - x), $MachinePrecision], If[LessEqual[x, 0.5], N[(-0.5 * y + 0.918938533204673), $MachinePrecision], If[LessEqual[x, 3e+153], N[(y * x), $MachinePrecision], (-x)]]]

Derivation

1. Split input into 4 regimes

2. if x < -1.30000000000000002e-15

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

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

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

      2. metadata-eval N/A

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

      3. *-lft-identity N/A

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

      4. lower--.f64 52.7

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

   5. Applied rewrites 52.7%

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

   if -1.30000000000000002e-15 < x < 0.5

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

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

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 96.8

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

   5. Applied rewrites 96.8%

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

   if 0.5 < x < 3.00000000000000019e153

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 69.8

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

   5. Applied rewrites 69.8%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 68.3%

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

   if 3.00000000000000019e153 < x

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

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

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

      2. metadata-eval N/A

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

      3. *-lft-identity N/A

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

      4. lower--.f64 61.7

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

   5. Applied rewrites 61.7%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 61.7%

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

Alternative 6: 98.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1 \lor \neg \left(y \leq 1\right):\\ \;\;\;\;\mathsf{fma}\left(-0.5 + x, y, 0.918938533204673\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-0.5, y, 0.918938533204673 - x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -1.0) (not (<= y 1.0)))
   (fma (+ -0.5 x) y 0.918938533204673)
   (fma -0.5 y (- 0.918938533204673 x))))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -1.0) || !(y <= 1.0)) {
		tmp = fma((-0.5 + x), y, 0.918938533204673);
	} else {
		tmp = fma(-0.5, y, (0.918938533204673 - x));
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -1.0) || !(y <= 1.0))
		tmp = fma(Float64(-0.5 + x), y, 0.918938533204673);
	else
		tmp = fma(-0.5, y, Float64(0.918938533204673 - x));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1 or 1 < y

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 98.4%

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

   if -1 < y < 1

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 98.9%

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

4. Final simplification 98.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1 \lor \neg \left(y \leq 1\right):\\ \;\;\;\;\mathsf{fma}\left(-0.5 + x, y, 0.918938533204673\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-0.5, y, 0.918938533204673 - x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 98.2% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -6 \cdot 10^{+19} \lor \neg \left(y \leq 2100000\right):\\ \;\;\;\;\left(x - 0.5\right) \cdot y\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-0.5, y, 0.918938533204673 - x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -6e+19) (not (<= y 2100000.0)))
   (* (- x 0.5) y)
   (fma -0.5 y (- 0.918938533204673 x))))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -6e+19) || !(y <= 2100000.0)) {
		tmp = (x - 0.5) * y;
	} else {
		tmp = fma(-0.5, y, (0.918938533204673 - x));
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -6e+19) || !(y <= 2100000.0))
		tmp = Float64(Float64(x - 0.5) * y);
	else
		tmp = fma(-0.5, y, Float64(0.918938533204673 - x));
	end
	return tmp
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -6e+19], N[Not[LessEqual[y, 2100000.0]], $MachinePrecision]], N[(N[(x - 0.5), $MachinePrecision] * y), $MachinePrecision], N[(-0.5 * y + N[(0.918938533204673 - x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -6e19 or 2.1e6 < y

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 99.7

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

   5. Applied rewrites 99.7%

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

   if -6e19 < y < 2.1e6

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 97.2%

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

4. Final simplification 98.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -6 \cdot 10^{+19} \lor \neg \left(y \leq 2100000\right):\\ \;\;\;\;\left(x - 0.5\right) \cdot y\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-0.5, y, 0.918938533204673 - x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 97.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.4 \lor \neg \left(y \leq 1.65\right):\\ \;\;\;\;\left(x - 0.5\right) \cdot y\\ \mathbf{else}:\\ \;\;\;\;0.918938533204673 - x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -1.4) (not (<= y 1.65)))
   (* (- x 0.5) y)
   (- 0.918938533204673 x)))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -1.4) || !(y <= 1.65)) {
		tmp = (x - 0.5) * y;
	} else {
		tmp = 0.918938533204673 - 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 <= (-1.4d0)) .or. (.not. (y <= 1.65d0))) then
        tmp = (x - 0.5d0) * y
    else
        tmp = 0.918938533204673d0 - x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y <= -1.4) || !(y <= 1.65)) {
		tmp = (x - 0.5) * y;
	} else {
		tmp = 0.918938533204673 - x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -1.4) or not (y <= 1.65):
		tmp = (x - 0.5) * y
	else:
		tmp = 0.918938533204673 - x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -1.4) || !(y <= 1.65))
		tmp = Float64(Float64(x - 0.5) * y);
	else
		tmp = Float64(0.918938533204673 - x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -1.4) || ~((y <= 1.65)))
		tmp = (x - 0.5) * y;
	else
		tmp = 0.918938533204673 - x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -1.4], N[Not[LessEqual[y, 1.65]], $MachinePrecision]], N[(N[(x - 0.5), $MachinePrecision] * y), $MachinePrecision], N[(0.918938533204673 - x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1.3999999999999999 or 1.6499999999999999 < y

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 96.6

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

   5. Applied rewrites 96.6%

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

   if -1.3999999999999999 < y < 1.6499999999999999

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

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

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

      2. metadata-eval N/A

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

      3. *-lft-identity N/A

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

      4. lower--.f64 97.9

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

   5. Applied rewrites 97.9%

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

4. Final simplification 97.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.4 \lor \neg \left(y \leq 1.65\right):\\ \;\;\;\;\left(x - 0.5\right) \cdot y\\ \mathbf{else}:\\ \;\;\;\;0.918938533204673 - x\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 98.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -0.68 \lor \neg \left(x \leq 0.62\right):\\ \;\;\;\;\left(-1 + y\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-0.5, y, 0.918938533204673\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -0.68) (not (<= x 0.62)))
   (* (+ -1.0 y) x)
   (fma -0.5 y 0.918938533204673)))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -0.68) || !(x <= 0.62)) {
		tmp = (-1.0 + y) * x;
	} else {
		tmp = fma(-0.5, y, 0.918938533204673);
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -0.68) || !(x <= 0.62))
		tmp = Float64(Float64(-1.0 + y) * x);
	else
		tmp = fma(-0.5, y, 0.918938533204673);
	end
	return tmp
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -0.68], N[Not[LessEqual[x, 0.62]], $MachinePrecision]], N[(N[(-1.0 + y), $MachinePrecision] * x), $MachinePrecision], N[(-0.5 * y + 0.918938533204673), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -0.680000000000000049 or 0.619999999999999996 < x

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in x around inf

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

      1. distribute-rgt-out-- N/A

         \[\leadsto \color{blue}{y \cdot x - 1 \cdot x} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{x \cdot y} - 1 \cdot x \]

      3. remove-double-neg N/A

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

      4. mul-1-neg N/A

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

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

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

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

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

      7. *-commutative N/A

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

      8. fp-cancel-sub-sign N/A

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

      9. mul-1-neg N/A

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

      10. mul-1-neg N/A

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

      11. distribute-lft-in N/A

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

      12. +-commutative N/A

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

      13. associate-*r* N/A

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

      14. mul-1-neg N/A

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

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

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

      16. *-commutative N/A

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

      17. lower-*.f64 N/A

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

      18. distribute-neg-in N/A

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

      19. metadata-eval N/A

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

      20. mul-1-neg N/A

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

      21. remove-double-neg N/A

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

      22. lower-+.f64 96.4

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

   8. Applied rewrites 96.4%

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

   if -0.680000000000000049 < x < 0.619999999999999996

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

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

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 95.8

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

   5. Applied rewrites 95.8%

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

4. Final simplification 96.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -0.68 \lor \neg \left(x \leq 0.62\right):\\ \;\;\;\;\left(-1 + y\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-0.5, y, 0.918938533204673\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 73.9% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -62 \lor \neg \left(y \leq 1.85\right):\\ \;\;\;\;-0.5 \cdot y\\ \mathbf{else}:\\ \;\;\;\;0.918938533204673 - x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -62.0) (not (<= y 1.85))) (* -0.5 y) (- 0.918938533204673 x)))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -62.0) || !(y <= 1.85)) {
		tmp = -0.5 * y;
	} else {
		tmp = 0.918938533204673 - 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 <= (-62.0d0)) .or. (.not. (y <= 1.85d0))) then
        tmp = (-0.5d0) * y
    else
        tmp = 0.918938533204673d0 - x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y <= -62.0) || !(y <= 1.85)) {
		tmp = -0.5 * y;
	} else {
		tmp = 0.918938533204673 - x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -62.0) or not (y <= 1.85):
		tmp = -0.5 * y
	else:
		tmp = 0.918938533204673 - x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -62.0) || !(y <= 1.85))
		tmp = Float64(-0.5 * y);
	else
		tmp = Float64(0.918938533204673 - x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -62.0) || ~((y <= 1.85)))
		tmp = -0.5 * y;
	else
		tmp = 0.918938533204673 - x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -62.0], N[Not[LessEqual[y, 1.85]], $MachinePrecision]], N[(-0.5 * y), $MachinePrecision], N[(0.918938533204673 - x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -62 or 1.8500000000000001 < y

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 96.6

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

   5. Applied rewrites 96.6%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 46.2%

      \[\leadsto -0.5 \cdot \color{blue}{y} \]

   if -62 < y < 1.8500000000000001

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

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

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

      2. metadata-eval N/A

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

      3. *-lft-identity N/A

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

      4. lower--.f64 97.9

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

   5. Applied rewrites 97.9%

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

4. Final simplification 73.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -62 \lor \neg \left(y \leq 1.85\right):\\ \;\;\;\;-0.5 \cdot y\\ \mathbf{else}:\\ \;\;\;\;0.918938533204673 - x\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 49.9% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -0.92 \lor \neg \left(x \leq 0.92\right):\\ \;\;\;\;-x\\ \mathbf{else}:\\ \;\;\;\;0.918938533204673\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -0.92) (not (<= x 0.92))) (- x) 0.918938533204673))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -0.92) || !(x <= 0.92)) {
		tmp = -x;
	} else {
		tmp = 0.918938533204673;
	}
	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.92d0)) .or. (.not. (x <= 0.92d0))) then
        tmp = -x
    else
        tmp = 0.918938533204673d0
    end if
    code = tmp
end function

Java

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

Python

def code(x, y):
	tmp = 0
	if (x <= -0.92) or not (x <= 0.92):
		tmp = -x
	else:
		tmp = 0.918938533204673
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -0.92) || !(x <= 0.92))
		tmp = Float64(-x);
	else
		tmp = 0.918938533204673;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x <= -0.92) || ~((x <= 0.92)))
		tmp = -x;
	else
		tmp = 0.918938533204673;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -0.92], N[Not[LessEqual[x, 0.92]], $MachinePrecision]], (-x), 0.918938533204673]

Derivation

1. Split input into 2 regimes

2. if x < -0.92000000000000004 or 0.92000000000000004 < x

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

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

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

      2. metadata-eval N/A

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

      3. *-lft-identity N/A

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

      4. lower--.f64 49.1

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

   5. Applied rewrites 49.1%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 47.3%

      \[\leadsto -x \]

   if -0.92000000000000004 < x < 0.92000000000000004

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

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

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

      2. metadata-eval N/A

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

      3. *-lft-identity N/A

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

      4. lower--.f64 56.9

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

   5. Applied rewrites 56.9%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 54.5%

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

4. Final simplification 51.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -0.92 \lor \neg \left(x \leq 0.92\right):\\ \;\;\;\;-x\\ \mathbf{else}:\\ \;\;\;\;0.918938533204673\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 50.9% accurate, 5.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (- 0.918938533204673 x))

C

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

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 - x
end function

Java

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

Python

def code(x, y):
	return 0.918938533204673 - x

Julia

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

MATLAB

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

Wolfram

code[x_, y_] := N[(0.918938533204673 - x), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]
2. Add Preprocessing

3. Taylor expanded in y around 0

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

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

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

   2. metadata-eval N/A

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

   3. *-lft-identity N/A

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

   4. lower--.f64 53.1

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

5. Applied rewrites 53.1%

   \[\leadsto \color{blue}{0.918938533204673 - x} \]
6. Add Preprocessing

Alternative 13: 26.9% accurate, 20.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. Add Preprocessing

3. Taylor expanded in y around 0

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

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

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

   2. metadata-eval N/A

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

   3. *-lft-identity N/A

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

   4. lower--.f64 53.1

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

5. Applied rewrites 53.1%

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

6. Taylor expanded in x around 0

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

8. Applied rewrites 29.6%

   \[\leadsto 0.918938533204673 \]
9. Add Preprocessing

Reproduce

herbie shell --seed 2024364 
(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))