Numeric.SpecFunctions:stirlingError from math-functions-0.1.5.2

Percentage Accurate: 99.8% → 99.8%

Time: 6.9s

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(\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 2: 74.4% 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 -2 \cdot 10^{+216}:\\ \;\;\;\;\left(1 - \log y\right) \cdot y\\ \mathbf{elif}\;t\_0 \leq -2 \cdot 10^{+49}:\\ \;\;\;\;1 \cdot x - z\\ \mathbf{elif}\;t\_0 \leq 500:\\ \;\;\;\;\mathsf{fma}\left(-0.5, \log y, -z\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{-z}{x}, x, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (+ (- x (* (+ y 0.5) (log y))) y)))
   (if (<= t_0 -2e+216)
     (* (- 1.0 (log y)) y)
     (if (<= t_0 -2e+49)
       (- (* 1.0 x) z)
       (if (<= t_0 500.0) (fma -0.5 (log y) (- z)) (fma (/ (- z) x) x x))))))

C

double code(double x, double y, double z) {
	double t_0 = (x - ((y + 0.5) * log(y))) + y;
	double tmp;
	if (t_0 <= -2e+216) {
		tmp = (1.0 - log(y)) * y;
	} else if (t_0 <= -2e+49) {
		tmp = (1.0 * x) - z;
	} else if (t_0 <= 500.0) {
		tmp = fma(-0.5, log(y), -z);
	} else {
		tmp = fma((-z / x), x, x);
	}
	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 <= -2e+216)
		tmp = Float64(Float64(1.0 - log(y)) * y);
	elseif (t_0 <= -2e+49)
		tmp = Float64(Float64(1.0 * x) - z);
	elseif (t_0 <= 500.0)
		tmp = fma(-0.5, log(y), Float64(-z));
	else
		tmp = fma(Float64(Float64(-z) / x), x, x);
	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, -2e+216], N[(N[(1.0 - N[Log[y], $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision], If[LessEqual[t$95$0, -2e+49], N[(N[(1.0 * x), $MachinePrecision] - z), $MachinePrecision], If[LessEqual[t$95$0, 500.0], N[(-0.5 * N[Log[y], $MachinePrecision] + (-z)), $MachinePrecision], N[(N[((-z) / x), $MachinePrecision] * x + x), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

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

   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 68.2

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

   5. Applied rewrites 68.2%

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

   if -2e216 < (+.f64 (-.f64 x (*.f64 (+.f64 y #s(literal 1/2 binary64)) (log.f64 y))) y) < -1.99999999999999989e49

   1. Initial program 99.7%

      \[\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. flip-+ N/A

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

      3. div-sub N/A

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

      4. lower--.f64 N/A

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

   4. Applied rewrites 65.2%

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

   5. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   7. Applied rewrites 84.2%

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

   8. Taylor expanded in x around inf

      \[\leadsto 1 \cdot x - z \]
   9. Step-by-step derivation

   10. Applied rewrites 58.6%

       \[\leadsto 1 \cdot x - z \]

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

   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 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. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower-log.f64 99.1

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

   5. Applied rewrites 99.1%

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

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 89.2%

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

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

   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 x around inf

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

      1. associate--l+ N/A

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

      2. div-add-rev N/A

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

      3. div-sub N/A

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

      4. +-commutative N/A

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

      5. distribute-rgt-in N/A

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

      6. *-lft-identity N/A

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

      7. lower-fma.f64 N/A

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 97.7%

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

Alternative 3: 68.1% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\left(x - \left(y + 0.5\right) \cdot \log y\right) + y\right) - z\\ \mathbf{if}\;t\_0 \leq -5 \cdot 10^{+36} \lor \neg \left(t\_0 \leq 500\right):\\ \;\;\;\;1 \cdot x - z\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \log y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (- (+ (- x (* (+ y 0.5) (log y))) y) z)))
   (if (or (<= t_0 -5e+36) (not (<= t_0 500.0)))
     (- (* 1.0 x) z)
     (* -0.5 (log y)))))

C

double code(double x, double y, double z) {
	double t_0 = ((x - ((y + 0.5) * log(y))) + y) - z;
	double tmp;
	if ((t_0 <= -5e+36) || !(t_0 <= 500.0)) {
		tmp = (1.0 * x) - z;
	} else {
		tmp = -0.5 * log(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, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: tmp
    t_0 = ((x - ((y + 0.5d0) * log(y))) + y) - z
    if ((t_0 <= (-5d+36)) .or. (.not. (t_0 <= 500.0d0))) then
        tmp = (1.0d0 * x) - z
    else
        tmp = (-0.5d0) * log(y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = ((x - ((y + 0.5) * Math.log(y))) + y) - z;
	double tmp;
	if ((t_0 <= -5e+36) || !(t_0 <= 500.0)) {
		tmp = (1.0 * x) - z;
	} else {
		tmp = -0.5 * Math.log(y);
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = ((x - ((y + 0.5) * math.log(y))) + y) - z
	tmp = 0
	if (t_0 <= -5e+36) or not (t_0 <= 500.0):
		tmp = (1.0 * x) - z
	else:
		tmp = -0.5 * math.log(y)
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(Float64(x - Float64(Float64(y + 0.5) * log(y))) + y) - z)
	tmp = 0.0
	if ((t_0 <= -5e+36) || !(t_0 <= 500.0))
		tmp = Float64(Float64(1.0 * x) - z);
	else
		tmp = Float64(-0.5 * log(y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = ((x - ((y + 0.5) * log(y))) + y) - z;
	tmp = 0.0;
	if ((t_0 <= -5e+36) || ~((t_0 <= 500.0)))
		tmp = (1.0 * x) - z;
	else
		tmp = -0.5 * log(y);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   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. flip-+ N/A

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

      3. div-sub N/A

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

      4. lower--.f64 N/A

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

   4. Applied rewrites 46.4%

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

   5. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   7. Applied rewrites 83.4%

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

   8. Taylor expanded in x around inf

      \[\leadsto 1 \cdot x - z \]
   9. Step-by-step derivation

   10. Applied rewrites 63.5%

       \[\leadsto 1 \cdot x - z \]

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

   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 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. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower-log.f64 98.4

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

   5. Applied rewrites 98.4%

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

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 80.8%

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

   9. Taylor expanded in z around 0

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

   11. Applied rewrites 80.9%

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

4. Final simplification 66.3%

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

Alternative 4: 90.0% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -1.06e+49) (not (<= x 1.4e+23)))
   (- x (* (- (log y) 1.0) y))
   (- (fma (- (- y) 0.5) (log y) y) z)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.06e+49) || !(x <= 1.4e+23)) {
		tmp = x - ((log(y) - 1.0) * y);
	} else {
		tmp = fma((-y - 0.5), log(y), y) - z;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -1.06e+49) || !(x <= 1.4e+23))
		tmp = Float64(x - Float64(Float64(log(y) - 1.0) * y));
	else
		tmp = Float64(fma(Float64(Float64(-y) - 0.5), log(y), y) - z);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -1.06e+49], N[Not[LessEqual[x, 1.4e+23]], $MachinePrecision]], N[(x - N[(N[(N[Log[y], $MachinePrecision] - 1.0), $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision], N[(N[(N[((-y) - 0.5), $MachinePrecision] * N[Log[y], $MachinePrecision] + y), $MachinePrecision] - z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.06e49 or 1.4e23 < x

   1. Initial program 99.9%

      \[\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 \color{blue}{\left(\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(y + \frac{1}{2}\right) \cdot \log y\right) + \left(y - z\right)} \]

      4. lift--.f64 N/A

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

      5. associate-+l- N/A

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

      6. lower--.f64 N/A

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

      7. lower--.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. lift-+.f64 N/A

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

      12. +-commutative N/A

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

      13. lower-+.f64 N/A

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

      14. lower--.f64 99.9

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

   4. Applied rewrites 99.9%

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

   5. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. mul-1-neg N/A

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

      3. log-rec N/A

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

      4. remove-double-neg N/A

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

      5. lower-*.f64 N/A

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

      6. lower--.f64 N/A

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

      7. lower-log.f64 84.2

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

   7. Applied rewrites 84.2%

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

   if -1.06e49 < x < 1.4e23

   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 x around 0

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

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

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

      2. +-commutative N/A

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

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

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

      4. distribute-rgt-in N/A

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

      5. +-commutative N/A

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

      6. distribute-neg-in N/A

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

      7. mul-1-neg N/A

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

      8. distribute-lft-neg-out N/A

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

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

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

      10. associate-*r* N/A

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

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

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

      12. *-commutative N/A

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

      13. lower-fma.f64 N/A

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

      14. mul-1-neg N/A

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

      15. lower--.f64 N/A

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

      16. lower-neg.f64 N/A

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

      17. lower-log.f64 99.4

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

   5. Applied rewrites 99.4%

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

4. Final simplification 92.8%

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

Alternative 5: 90.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.35 \cdot 10^{+48} \lor \neg \left(x \leq 1.4 \cdot 10^{+23}\right):\\ \;\;\;\;x - \left(\log y - 1\right) \cdot y\\ \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 (or (<= x -1.35e+48) (not (<= x 1.4e+23)))
   (- x (* (- (log y) 1.0) y))
   (- y (fma (+ 0.5 y) (log y) z))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.35e+48) || !(x <= 1.4e+23)) {
		tmp = x - ((log(y) - 1.0) * y);
	} else {
		tmp = y - fma((0.5 + y), log(y), z);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -1.35e+48) || !(x <= 1.4e+23))
		tmp = Float64(x - Float64(Float64(log(y) - 1.0) * y));
	else
		tmp = Float64(y - fma(Float64(0.5 + y), log(y), z));
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -1.35e+48], N[Not[LessEqual[x, 1.4e+23]], $MachinePrecision]], N[(x - N[(N[(N[Log[y], $MachinePrecision] - 1.0), $MachinePrecision] * y), $MachinePrecision]), $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 x < -1.35000000000000002e48 or 1.4e23 < 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. 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 \color{blue}{\left(\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(y + \frac{1}{2}\right) \cdot \log y\right) + \left(y - z\right)} \]

      4. lift--.f64 N/A

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

      5. associate-+l- N/A

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

      6. lower--.f64 N/A

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

      7. lower--.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. lift-+.f64 N/A

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

      12. +-commutative N/A

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

      13. lower-+.f64 N/A

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

      14. lower--.f64 99.8

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

   4. Applied rewrites 99.8%

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

   5. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. mul-1-neg N/A

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

      3. log-rec N/A

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

      4. remove-double-neg N/A

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

      5. lower-*.f64 N/A

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

      6. lower--.f64 N/A

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

      7. lower-log.f64 84.4

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

   7. Applied rewrites 84.4%

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

   if -1.35000000000000002e48 < x < 1.4e23

   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 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. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower-log.f64 99.3

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

   5. Applied rewrites 99.3%

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

4. Final simplification 92.7%

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

Alternative 6: 68.7% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -1.3e+46) (not (<= x 2.5e+36)))
   (- (* 1.0 x) z)
   (fma -0.5 (log y) (- z))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.3e+46) || !(x <= 2.5e+36)) {
		tmp = (1.0 * x) - z;
	} else {
		tmp = fma(-0.5, log(y), -z);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -1.3e+46) || !(x <= 2.5e+36))
		tmp = Float64(Float64(1.0 * x) - z);
	else
		tmp = fma(-0.5, log(y), Float64(-z));
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -1.3e+46], N[Not[LessEqual[x, 2.5e+36]], $MachinePrecision]], N[(N[(1.0 * x), $MachinePrecision] - z), $MachinePrecision], N[(-0.5 * N[Log[y], $MachinePrecision] + (-z)), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.30000000000000007e46 or 2.49999999999999988e36 < x

   1. Initial program 99.9%

      \[\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. flip-+ N/A

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

      3. div-sub N/A

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

      4. lower--.f64 N/A

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

   4. Applied rewrites 31.2%

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

   5. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   7. Applied rewrites 99.8%

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

   8. Taylor expanded in x around inf

      \[\leadsto 1 \cdot x - z \]
   9. Step-by-step derivation

   10. Applied rewrites 80.5%

       \[\leadsto 1 \cdot x - z \]

   if -1.30000000000000007e46 < x < 2.49999999999999988e36

   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 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. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower-log.f64 99.3

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

   5. Applied rewrites 99.3%

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

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 55.8%

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

4. Final simplification 66.6%

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

Alternative 7: 98.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 3.2 \cdot 10^{-23}:\\ \;\;\;\;\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 3.2e-23)
   (- (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 <= 3.2e-23) {
		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 <= 3.2e-23)
		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, 3.2e-23], 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 < 3.19999999999999976e-23

   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 100.0

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

   5. Applied rewrites 100.0%

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

   if 3.19999999999999976e-23 < 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 \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.0

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

   5. Applied rewrites 99.0%

      \[\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 8: 90.0% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y 480000000000.0)
   (- (fma -0.5 (log y) x) z)
   (- x (* (- (log y) 1.0) y))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 4.8e11

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

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

   5. Applied rewrites 99.2%

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

   if 4.8e11 < 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 \color{blue}{\left(\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(y + \frac{1}{2}\right) \cdot \log y\right) + \left(y - z\right)} \]

      4. lift--.f64 N/A

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

      5. associate-+l- N/A

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

      6. lower--.f64 N/A

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

      7. lower--.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. lift-+.f64 N/A

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

      12. +-commutative N/A

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

      13. lower-+.f64 N/A

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

      14. lower--.f64 99.6

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

   4. Applied rewrites 99.6%

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

   5. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. mul-1-neg N/A

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

      3. log-rec N/A

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

      4. remove-double-neg N/A

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

      5. lower-*.f64 N/A

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

      6. lower--.f64 N/A

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

      7. lower-log.f64 82.5

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

   7. Applied rewrites 82.5%

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

Alternative 9: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x - \left(\log y \cdot \left(0.5 + y\right) - \left(y - z\right)\right) \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(x - Float64(Float64(log(y) * Float64(0.5 + y)) - Float64(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[(x - N[(N[(N[Log[y], $MachinePrecision] * N[(0.5 + y), $MachinePrecision]), $MachinePrecision] - N[(y - z), $MachinePrecision]), $MachinePrecision]), $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 \color{blue}{\left(\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(y + \frac{1}{2}\right) \cdot \log y\right) + \left(y - z\right)} \]

   4. lift--.f64 N/A

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

   5. associate-+l- N/A

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

   6. lower--.f64 N/A

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

   7. lower--.f64 N/A

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

   8. lift-*.f64 N/A

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

   9. *-commutative N/A

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

   10. lower-*.f64 N/A

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

   11. lift-+.f64 N/A

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

   12. +-commutative N/A

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

   13. lower-+.f64 N/A

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

   14. lower--.f64 99.8

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

4. Applied rewrites 99.8%

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

Alternative 10: 84.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 1.25 \cdot 10^{+130}:\\ \;\;\;\;\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 1.25e+130) (- (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 <= 1.25e+130) {
		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 <= 1.25e+130)
		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, 1.25e+130], 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 < 1.2499999999999999e130

   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 86.6

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

   5. Applied rewrites 86.6%

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

   if 1.2499999999999999e130 < 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 73.3

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

   5. Applied rewrites 73.3%

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

Alternative 11: 58.0% accurate, 13.1× speedup

Math

\[\begin{array}{l} \\ 1 \cdot x - z \end{array} \]

FPCore

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

C

double code(double x, double y, double z) {
	return (1.0 * x) - 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 = (1.0d0 * x) - z
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := N[(N[(1.0 * x), $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. flip-+ N/A

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

   3. div-sub N/A

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

   4. lower--.f64 N/A

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

4. Applied rewrites 54.9%

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

5. Taylor expanded in x around inf

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

7. Applied rewrites 86.1%

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

8. Taylor expanded in x around inf

   \[\leadsto 1 \cdot x - z \]
9. Step-by-step derivation

10. Applied rewrites 54.0%

    \[\leadsto 1 \cdot x - z \]
11. Add Preprocessing

Alternative 12: 29.7% 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 25.9

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

5. Applied rewrites 25.9%

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