Numeric.SpecFunctions:stirlingError from math-functions-0.1.5.2

Percentage Accurate: 99.8% → 99.8%

Time: 6.7s

Alternatives: 12

Speedup: 1.0×

Specification

Math

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

FPCore

(FPCore (x y z) :precision binary64 (- (+ (- x (* (+ y 0.5) (log y))) y) z))

C

double code(double x, double y, double z) {
	return ((x - ((y + 0.5) * log(y))) + y) - z;
}

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, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = ((x - ((y + 0.5d0) * log(y))) + y) - z
end function

Java

public static double code(double x, double y, double z) {
	return ((x - ((y + 0.5) * Math.log(y))) + y) - z;
}

Python

def code(x, y, z):
	return ((x - ((y + 0.5) * math.log(y))) + y) - z

Julia

function code(x, y, z)
	return Float64(Float64(Float64(x - Float64(Float64(y + 0.5) * log(y))) + y) - z)
end

MATLAB

function tmp = code(x, y, z)
	tmp = ((x - ((y + 0.5) * log(y))) + y) - z;
end

Wolfram

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

Initial Program: 99.8% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z) :precision binary64 (- (+ (- x (* (+ y 0.5) (log y))) y) z))

C

double code(double x, double y, double z) {
	return ((x - ((y + 0.5) * log(y))) + y) - z;
}

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, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = ((x - ((y + 0.5d0) * log(y))) + y) - z
end function

Java

public static double code(double x, double y, double z) {
	return ((x - ((y + 0.5) * Math.log(y))) + y) - z;
}

Python

def code(x, y, z):
	return ((x - ((y + 0.5) * math.log(y))) + y) - z

Julia

function code(x, y, z)
	return Float64(Float64(Float64(x - Float64(Float64(y + 0.5) * log(y))) + y) - z)
end

MATLAB

function tmp = code(x, y, z)
	tmp = ((x - ((y + 0.5) * log(y))) + y) - z;
end

Wolfram

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

Alternative 1: 99.8% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z) :precision binary64 (- (- x (- (* (log y) (+ 0.5 y)) y)) z))

C

double code(double x, double y, double z) {
	return (x - ((log(y) * (0.5 + y)) - y)) - z;
}

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, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (x - ((log(y) * (0.5d0 + y)) - y)) - z
end function

Java

public static double code(double x, double y, double z) {
	return (x - ((Math.log(y) * (0.5 + y)) - y)) - z;
}

Python

def code(x, y, z):
	return (x - ((math.log(y) * (0.5 + y)) - y)) - z

Julia

function code(x, y, z)
	return Float64(Float64(x - Float64(Float64(log(y) * Float64(0.5 + y)) - y)) - z)
end

MATLAB

function tmp = code(x, y, z)
	tmp = (x - ((log(y) * (0.5 + y)) - y)) - z;
end

Wolfram

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

Derivation

1. Initial program 99.8%

   \[\left(\left(x - \left(y + 0.5\right) \cdot \log y\right) + y\right) - z \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-+.f64 N/A

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

   2. lift--.f64 N/A

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

   3. associate-+l- N/A

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

   4. lower--.f64 N/A

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

   5. lower--.f64 99.8

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

   6. lift-*.f64 N/A

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

   7. *-commutative N/A

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

   8. lower-*.f64 99.8

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

   9. lift-+.f64 N/A

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

   10. +-commutative N/A

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

   11. lower-+.f64 99.8

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

4. Applied rewrites 99.8%

   \[\leadsto \color{blue}{\left(x - \left(\log y \cdot \left(0.5 + y\right) - y\right)\right)} - z \]
5. Add Preprocessing

Alternative 2: 72.5% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(x - \left(y + 0.5\right) \cdot \log y\right) + y\\ \mathbf{if}\;t\_0 \leq -3 \cdot 10^{+73}:\\ \;\;\;\;\left(1 - \log y\right) \cdot y\\ \mathbf{elif}\;t\_0 \leq -1 \cdot 10^{+14} \lor \neg \left(t\_0 \leq 500\right):\\ \;\;\;\;\mathsf{fma}\left(\frac{-z}{x}, x, x\right)\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \log y - z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (+ (- x (* (+ y 0.5) (log y))) y)))
   (if (<= t_0 -3e+73)
     (* (- 1.0 (log y)) y)
     (if (or (<= t_0 -1e+14) (not (<= t_0 500.0)))
       (fma (/ (- z) x) x x)
       (- (* -0.5 (log y)) z)))))

C

double code(double x, double y, double z) {
	double t_0 = (x - ((y + 0.5) * log(y))) + y;
	double tmp;
	if (t_0 <= -3e+73) {
		tmp = (1.0 - log(y)) * y;
	} else if ((t_0 <= -1e+14) || !(t_0 <= 500.0)) {
		tmp = fma((-z / x), x, x);
	} else {
		tmp = (-0.5 * log(y)) - z;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(Float64(x - Float64(Float64(y + 0.5) * log(y))) + y)
	tmp = 0.0
	if (t_0 <= -3e+73)
		tmp = Float64(Float64(1.0 - log(y)) * y);
	elseif ((t_0 <= -1e+14) || !(t_0 <= 500.0))
		tmp = fma(Float64(Float64(-z) / x), x, x);
	else
		tmp = Float64(Float64(-0.5 * log(y)) - z);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(x - N[(N[(y + 0.5), $MachinePrecision] * N[Log[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + y), $MachinePrecision]}, If[LessEqual[t$95$0, -3e+73], N[(N[(1.0 - N[Log[y], $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision], If[Or[LessEqual[t$95$0, -1e+14], N[Not[LessEqual[t$95$0, 500.0]], $MachinePrecision]], N[(N[((-z) / x), $MachinePrecision] * x + x), $MachinePrecision], N[(N[(-0.5 * N[Log[y], $MachinePrecision]), $MachinePrecision] - z), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (+.f64 (-.f64 x (*.f64 (+.f64 y #s(literal 1/2 binary64)) (log.f64 y))) y) < -3.00000000000000011e73

   1. Initial program 99.7%

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

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. mul-1-neg N/A

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

      3. log-rec N/A

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

      4. remove-double-neg N/A

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

      5. lower-*.f64 N/A

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

      6. lower--.f64 N/A

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

      7. lower-log.f64 64.0

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

   5. Applied rewrites 64.0%

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

   if -3.00000000000000011e73 < (+.f64 (-.f64 x (*.f64 (+.f64 y #s(literal 1/2 binary64)) (log.f64 y))) y) < -1e14 or 500 < (+.f64 (-.f64 x (*.f64 (+.f64 y #s(literal 1/2 binary64)) (log.f64 y))) y)

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. associate--r+ N/A

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

      3. lower--.f64 N/A

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

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

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

      5. +-commutative N/A

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

      6. metadata-eval N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-log.f64 91.7

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

   5. Applied rewrites 91.7%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 91.7%

      \[\leadsto \mathsf{fma}\left(\frac{-0.5 \cdot \log y - z}{x}, \color{blue}{x}, x\right) \]

   9. Taylor expanded in z around inf

      \[\leadsto \mathsf{fma}\left(-1 \cdot \frac{z}{x}, x, x\right) \]
   10. Step-by-step derivation

   11. Applied rewrites 89.5%

       \[\leadsto \mathsf{fma}\left(\frac{-z}{x}, x, x\right) \]

   if -1e14 < (+.f64 (-.f64 x (*.f64 (+.f64 y #s(literal 1/2 binary64)) (log.f64 y))) y) < 500

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. associate--r+ N/A

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

      3. lower--.f64 N/A

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

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

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

      5. +-commutative N/A

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

      6. metadata-eval N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-log.f64 98.2

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

   5. Applied rewrites 98.2%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 98.2%

      \[\leadsto -0.5 \cdot \log y - z \]
3. Recombined 3 regimes into one program.

4. Final simplification 79.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(x - \left(y + 0.5\right) \cdot \log y\right) + y \leq -3 \cdot 10^{+73}:\\ \;\;\;\;\left(1 - \log y\right) \cdot y\\ \mathbf{elif}\;\left(x - \left(y + 0.5\right) \cdot \log y\right) + y \leq -1 \cdot 10^{+14} \lor \neg \left(\left(x - \left(y + 0.5\right) \cdot \log y\right) + y \leq 500\right):\\ \;\;\;\;\mathsf{fma}\left(\frac{-z}{x}, x, x\right)\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \log y - z\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 99.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 7.1 \cdot 10^{-9}:\\ \;\;\;\;\mathsf{fma}\left(-0.5, \log y, x\right) - z\\ \mathbf{else}:\\ \;\;\;\;\left(x - \left(\log y \cdot y - y\right)\right) - z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y 7.1e-9) (- (fma -0.5 (log y) x) z) (- (- x (- (* (log y) y) y)) z)))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= 7.1e-9) {
		tmp = fma(-0.5, log(y), x) - z;
	} else {
		tmp = (x - ((log(y) * y) - y)) - z;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= 7.1e-9)
		tmp = Float64(fma(-0.5, log(y), x) - z);
	else
		tmp = Float64(Float64(x - Float64(Float64(log(y) * y) - y)) - z);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, 7.1e-9], N[(N[(-0.5 * N[Log[y], $MachinePrecision] + x), $MachinePrecision] - z), $MachinePrecision], N[(N[(x - N[(N[(N[Log[y], $MachinePrecision] * y), $MachinePrecision] - y), $MachinePrecision]), $MachinePrecision] - z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 7.09999999999999988e-9

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. associate--r+ N/A

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

      3. lower--.f64 N/A

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

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

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

      5. +-commutative N/A

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

      6. metadata-eval N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-log.f64 99.7

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

   5. Applied rewrites 99.7%

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

   if 7.09999999999999988e-9 < y

   1. Initial program 99.7%

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

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. mul-1-neg N/A

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

      4. log-rec N/A

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

      5. remove-double-neg N/A

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

      6. lower-*.f64 N/A

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

      7. lower-log.f64 99.1

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

   5. Applied rewrites 99.1%

      \[\leadsto \left(\left(x - \color{blue}{\log y \cdot y}\right) + y\right) - z \]
   6. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. associate-+l- N/A

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

      4. lower--.f64 N/A

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

      5. lower--.f64 99.1

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

   7. Applied rewrites 99.1%

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

Alternative 4: 99.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 7.1 \cdot 10^{-9}:\\ \;\;\;\;\mathsf{fma}\left(-0.5, \log y, x\right) - z\\ \mathbf{else}:\\ \;\;\;\;\left(\left(x - \log y \cdot y\right) + y\right) - z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y 7.1e-9) (- (fma -0.5 (log y) x) z) (- (+ (- x (* (log y) y)) y) z)))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= 7.1e-9) {
		tmp = fma(-0.5, log(y), x) - z;
	} else {
		tmp = ((x - (log(y) * y)) + y) - z;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= 7.1e-9)
		tmp = Float64(fma(-0.5, log(y), x) - z);
	else
		tmp = Float64(Float64(Float64(x - Float64(log(y) * y)) + y) - z);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, 7.1e-9], N[(N[(-0.5 * N[Log[y], $MachinePrecision] + x), $MachinePrecision] - z), $MachinePrecision], N[(N[(N[(x - N[(N[Log[y], $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision] + y), $MachinePrecision] - z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 7.09999999999999988e-9

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. associate--r+ N/A

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

      3. lower--.f64 N/A

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

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

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

      5. +-commutative N/A

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

      6. metadata-eval N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-log.f64 99.7

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

   5. Applied rewrites 99.7%

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

   if 7.09999999999999988e-9 < y

   1. Initial program 99.7%

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

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. mul-1-neg N/A

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

      4. log-rec N/A

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

      5. remove-double-neg N/A

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

      6. lower-*.f64 N/A

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

      7. lower-log.f64 99.1

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

   5. Applied rewrites 99.1%

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

Alternative 5: 88.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 1.7 \cdot 10^{+115}:\\ \;\;\;\;\mathsf{fma}\left(-0.5, \log y, x\right) - z\\ \mathbf{else}:\\ \;\;\;\;y - \mathsf{fma}\left(0.5 + y, \log y, z\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y 1.7e+115)
   (- (fma -0.5 (log y) x) z)
   (- y (fma (+ 0.5 y) (log y) z))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= 1.7e+115) {
		tmp = fma(-0.5, log(y), x) - z;
	} else {
		tmp = y - fma((0.5 + y), log(y), z);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= 1.7e+115)
		tmp = Float64(fma(-0.5, log(y), x) - z);
	else
		tmp = Float64(y - fma(Float64(0.5 + y), log(y), z));
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, 1.7e+115], N[(N[(-0.5 * N[Log[y], $MachinePrecision] + x), $MachinePrecision] - z), $MachinePrecision], N[(y - N[(N[(0.5 + y), $MachinePrecision] * N[Log[y], $MachinePrecision] + z), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 1.7e115

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. associate--r+ N/A

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

      3. lower--.f64 N/A

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

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

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

      5. +-commutative N/A

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

      6. metadata-eval N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-log.f64 93.1

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

   5. Applied rewrites 93.1%

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

   if 1.7e115 < y

   1. Initial program 99.6%

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

   3. Taylor expanded in x around 0

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

      1. lower--.f64 N/A

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

      2. +-commutative N/A

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

      3. *-lft-identity N/A

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

      4. *-lft-identity N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

         \[\leadsto y - \color{blue}{\mathsf{fma}\left(\frac{1}{2} + y, \log y, z\right)} \]

      7. lower-+.f64 N/A

         \[\leadsto y - \mathsf{fma}\left(\color{blue}{\frac{1}{2} + y}, \log y, z\right) \]

      8. lower-log.f64 91.1

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

   5. Applied rewrites 91.1%

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

Alternative 6: 88.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 1.7 \cdot 10^{+115}:\\ \;\;\;\;\mathsf{fma}\left(-0.5, \log y, x\right) - z\\ \mathbf{else}:\\ \;\;\;\;\left(1 - \log y\right) \cdot y - z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y 1.7e+115) (- (fma -0.5 (log y) x) z) (- (* (- 1.0 (log y)) y) z)))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= 1.7e+115) {
		tmp = fma(-0.5, log(y), x) - z;
	} else {
		tmp = ((1.0 - log(y)) * y) - z;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= 1.7e+115)
		tmp = Float64(fma(-0.5, log(y), x) - z);
	else
		tmp = Float64(Float64(Float64(1.0 - log(y)) * y) - z);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, 1.7e+115], N[(N[(-0.5 * N[Log[y], $MachinePrecision] + x), $MachinePrecision] - z), $MachinePrecision], N[(N[(N[(1.0 - N[Log[y], $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision] - z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 1.7e115

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. associate--r+ N/A

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

      3. lower--.f64 N/A

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

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

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

      5. +-commutative N/A

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

      6. metadata-eval N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-log.f64 93.1

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

   5. Applied rewrites 93.1%

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

   if 1.7e115 < y

   1. Initial program 99.6%

      \[\left(\left(x - \left(y + 0.5\right) \cdot \log y\right) + y\right) - z \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. associate-+l- N/A

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

      4. lower--.f64 N/A

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

      5. lower--.f64 99.6

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

      6. lift-*.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 99.6

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

      9. lift-+.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 99.6

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

   4. Applied rewrites 99.6%

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

   5. Taylor expanded in y around inf

      \[\leadsto \color{blue}{y \cdot \left(1 - -1 \cdot \log \left(\frac{1}{y}\right)\right)} - z \]
   6. Step-by-step derivation

      1. *-commutative N/A

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

      2. mul-1-neg N/A

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

      3. log-rec N/A

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

      4. remove-double-neg N/A

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

      5. lower-*.f64 N/A

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

      6. lower--.f64 N/A

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

      7. lower-log.f64 91.0

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

   7. Applied rewrites 91.0%

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

Alternative 7: 99.8% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z) :precision binary64 (- (+ (- x (* (+ y 0.5) (log y))) y) z))

C

double code(double x, double y, double z) {
	return ((x - ((y + 0.5) * log(y))) + y) - z;
}

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, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = ((x - ((y + 0.5d0) * log(y))) + y) - z
end function

Java

public static double code(double x, double y, double z) {
	return ((x - ((y + 0.5) * Math.log(y))) + y) - z;
}

Python

def code(x, y, z):
	return ((x - ((y + 0.5) * math.log(y))) + y) - z

Julia

function code(x, y, z)
	return Float64(Float64(Float64(x - Float64(Float64(y + 0.5) * log(y))) + y) - z)
end

MATLAB

function tmp = code(x, y, z)
	tmp = ((x - ((y + 0.5) * log(y))) + y) - z;
end

Wolfram

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

Derivation

1. Initial program 99.8%

   \[\left(\left(x - \left(y + 0.5\right) \cdot \log y\right) + y\right) - z \]
2. Add Preprocessing
3. Add Preprocessing

Alternative 8: 83.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 2.2 \cdot 10^{+115}:\\ \;\;\;\;\mathsf{fma}\left(-0.5, \log y, x\right) - z\\ \mathbf{else}:\\ \;\;\;\;\left(1 - \log y\right) \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y 2.2e+115) (- (fma -0.5 (log y) x) z) (* (- 1.0 (log y)) y)))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= 2.2e+115) {
		tmp = fma(-0.5, log(y), x) - z;
	} else {
		tmp = (1.0 - log(y)) * y;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= 2.2e+115)
		tmp = Float64(fma(-0.5, log(y), x) - z);
	else
		tmp = Float64(Float64(1.0 - log(y)) * y);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, 2.2e+115], N[(N[(-0.5 * N[Log[y], $MachinePrecision] + x), $MachinePrecision] - z), $MachinePrecision], N[(N[(1.0 - N[Log[y], $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 2.2e115

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. associate--r+ N/A

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

      3. lower--.f64 N/A

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

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

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

      5. +-commutative N/A

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

      6. metadata-eval N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-log.f64 93.1

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

   5. Applied rewrites 93.1%

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

   if 2.2e115 < y

   1. Initial program 99.6%

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

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. mul-1-neg N/A

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

      3. log-rec N/A

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

      4. remove-double-neg N/A

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

      5. lower-*.f64 N/A

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

      6. lower--.f64 N/A

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

      7. lower-log.f64 82.3

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

   5. Applied rewrites 82.3%

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

Alternative 9: 63.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 2.1 \cdot 10^{+115}:\\ \;\;\;\;\mathsf{fma}\left(\frac{-z}{x}, x, x\right)\\ \mathbf{else}:\\ \;\;\;\;\left(1 - \log y\right) \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y 2.1e+115) (fma (/ (- z) x) x x) (* (- 1.0 (log y)) y)))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= 2.1e+115) {
		tmp = fma((-z / x), x, x);
	} else {
		tmp = (1.0 - log(y)) * y;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= 2.1e+115)
		tmp = fma(Float64(Float64(-z) / x), x, x);
	else
		tmp = Float64(Float64(1.0 - log(y)) * y);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, 2.1e+115], N[(N[((-z) / x), $MachinePrecision] * x + x), $MachinePrecision], N[(N[(1.0 - N[Log[y], $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 2.10000000000000003e115

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. associate--r+ N/A

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

      3. lower--.f64 N/A

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

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

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

      5. +-commutative N/A

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

      6. metadata-eval N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-log.f64 93.1

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

   5. Applied rewrites 93.1%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 79.7%

      \[\leadsto \mathsf{fma}\left(\frac{-0.5 \cdot \log y - z}{x}, \color{blue}{x}, x\right) \]

   9. Taylor expanded in z around inf

      \[\leadsto \mathsf{fma}\left(-1 \cdot \frac{z}{x}, x, x\right) \]
   10. Step-by-step derivation

   11. Applied rewrites 62.1%

       \[\leadsto \mathsf{fma}\left(\frac{-z}{x}, x, x\right) \]

   if 2.10000000000000003e115 < y

   1. Initial program 99.6%

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

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. mul-1-neg N/A

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

      3. log-rec N/A

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

      4. remove-double-neg N/A

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

      5. lower-*.f64 N/A

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

      6. lower--.f64 N/A

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

      7. lower-log.f64 82.3

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

   5. Applied rewrites 82.3%

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

Alternative 10: 58.4% accurate, 3.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -5.2 \cdot 10^{-24} \lor \neg \left(x \leq 0.00072\right):\\ \;\;\;\;\mathsf{fma}\left(\frac{-z}{x}, x, x\right)\\ \mathbf{else}:\\ \;\;\;\;-z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -5.2e-24) (not (<= x 0.00072))) (fma (/ (- z) x) x x) (- z)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -5.2e-24) || !(x <= 0.00072)) {
		tmp = fma((-z / x), x, x);
	} else {
		tmp = -z;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -5.2e-24) || !(x <= 0.00072))
		tmp = fma(Float64(Float64(-z) / x), x, x);
	else
		tmp = Float64(-z);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -5.2e-24], N[Not[LessEqual[x, 0.00072]], $MachinePrecision]], N[(N[((-z) / x), $MachinePrecision] * x + x), $MachinePrecision], (-z)]

Derivation

1. Split input into 2 regimes

2. if x < -5.2e-24 or 7.20000000000000045e-4 < x

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. associate--r+ N/A

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

      3. lower--.f64 N/A

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

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

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

      5. +-commutative N/A

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

      6. metadata-eval N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-log.f64 71.6

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

   5. Applied rewrites 71.6%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 71.6%

      \[\leadsto \mathsf{fma}\left(\frac{-0.5 \cdot \log y - z}{x}, \color{blue}{x}, x\right) \]

   9. Taylor expanded in z around inf

      \[\leadsto \mathsf{fma}\left(-1 \cdot \frac{z}{x}, x, x\right) \]
   10. Step-by-step derivation

   11. Applied rewrites 70.7%

       \[\leadsto \mathsf{fma}\left(\frac{-z}{x}, x, x\right) \]

   if -5.2e-24 < x < 7.20000000000000045e-4

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 36.8

         \[\leadsto \color{blue}{-z} \]

   5. Applied rewrites 36.8%

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

4. Final simplification 54.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -5.2 \cdot 10^{-24} \lor \neg \left(x \leq 0.00072\right):\\ \;\;\;\;\mathsf{fma}\left(\frac{-z}{x}, x, x\right)\\ \mathbf{else}:\\ \;\;\;\;-z\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 42.2% accurate, 3.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.05 \cdot 10^{+90} \lor \neg \left(z \leq 2.9 \cdot 10^{+20}\right):\\ \;\;\;\;-z\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x}{y}, y, y\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -1.05e+90) (not (<= z 2.9e+20))) (- z) (fma (/ x y) y y)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -1.05e+90) || !(z <= 2.9e+20)) {
		tmp = -z;
	} else {
		tmp = fma((x / y), y, y);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -1.05e+90) || !(z <= 2.9e+20))
		tmp = Float64(-z);
	else
		tmp = fma(Float64(x / y), y, y);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -1.05e+90], N[Not[LessEqual[z, 2.9e+20]], $MachinePrecision]], (-z), N[(N[(x / y), $MachinePrecision] * y + y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.0499999999999999e90 or 2.9e20 < z

   1. Initial program 99.9%

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

   3. Taylor expanded in z around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 62.1

         \[\leadsto \color{blue}{-z} \]

   5. Applied rewrites 62.1%

      \[\leadsto \color{blue}{-z} \]

   if -1.0499999999999999e90 < z < 2.9e20

   1. Initial program 99.8%

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

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. mul-1-neg N/A

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

      4. log-rec N/A

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

      5. remove-double-neg N/A

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

      6. lower-*.f64 N/A

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

      7. lower-log.f64 79.5

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

   5. Applied rewrites 79.5%

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

   6. Taylor expanded in x around inf

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

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

      5. associate-*l* N/A

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

      6. associate-*r* N/A

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

      7. *-rgt-identity N/A

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

      8. lower-fma.f64 N/A

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

   8. Applied rewrites 89.8%

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

   9. Taylor expanded in y around inf

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

   11. Applied rewrites 89.2%

       \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{x - z}{y} - \mathsf{fma}\left(\frac{\log y}{y}, 0.5, \log y\right), y, y\right)} \]

   12. Taylor expanded in x around inf

       \[\leadsto \mathsf{fma}\left(\frac{x}{y}, y, y\right) \]
   13. Step-by-step derivation

   14. Applied rewrites 27.3%

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

4. Final simplification 41.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.05 \cdot 10^{+90} \lor \neg \left(z \leq 2.9 \cdot 10^{+20}\right):\\ \;\;\;\;-z\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x}{y}, y, y\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 30.8% accurate, 39.3× speedup

Math

\[\begin{array}{l} \\ -z \end{array} \]

FPCore

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

C

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

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, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = -z
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := (-z)

Derivation

1. Initial program 99.8%

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

3. Taylor expanded in z around inf

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

   1. mul-1-neg N/A

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

   2. lower-neg.f64 28.1

      \[\leadsto \color{blue}{-z} \]

5. Applied rewrites 28.1%

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

Developer Target 1: 99.8% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z) :precision binary64 (- (- (+ y x) z) (* (+ y 0.5) (log y))))

C

double code(double x, double y, double z) {
	return ((y + x) - z) - ((y + 0.5) * log(y));
}

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, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = ((y + x) - z) - ((y + 0.5d0) * log(y))
end function

Java

public static double code(double x, double y, double z) {
	return ((y + x) - z) - ((y + 0.5) * Math.log(y));
}

Python

def code(x, y, z):
	return ((y + x) - z) - ((y + 0.5) * math.log(y))

Julia

function code(x, y, z)
	return Float64(Float64(Float64(y + x) - z) - Float64(Float64(y + 0.5) * log(y)))
end

MATLAB

function tmp = code(x, y, z)
	tmp = ((y + x) - z) - ((y + 0.5) * log(y));
end

Wolfram

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

Reproduce

herbie shell --seed 2024352 
(FPCore (x y z)
  :name "Numeric.SpecFunctions:stirlingError from math-functions-0.1.5.2"
  :precision binary64

  :alt
  (! :herbie-platform default (- (- (+ y x) z) (* (+ y 1/2) (log y))))

  (- (+ (- x (* (+ y 0.5) (log y))) y) z))