Numeric.SpecFunctions:invIncompleteGamma from math-functions-0.1.5.2, B

Percentage Accurate: 72.1% → 99.9%

Time: 5.0s

Alternatives: 14

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ 1 - \log \left(1 - \frac{x - y}{1 - y}\right) \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (- 1.0 (log (- 1.0 (/ (- x y) (- 1.0 y))))))

C

double code(double x, double y) {
	return 1.0 - log((1.0 - ((x - y) / (1.0 - 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)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = 1.0d0 - log((1.0d0 - ((x - y) / (1.0d0 - y))))
end function

Java

public static double code(double x, double y) {
	return 1.0 - Math.log((1.0 - ((x - y) / (1.0 - y))));
}

Python

def code(x, y):
	return 1.0 - math.log((1.0 - ((x - y) / (1.0 - y))))

Julia

function code(x, y)
	return Float64(1.0 - log(Float64(1.0 - Float64(Float64(x - y) / Float64(1.0 - y)))))
end

MATLAB

function tmp = code(x, y)
	tmp = 1.0 - log((1.0 - ((x - y) / (1.0 - y))));
end

Wolfram

code[x_, y_] := N[(1.0 - N[Log[N[(1.0 - N[(N[(x - y), $MachinePrecision] / N[(1.0 - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Initial Program: 72.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ 1 - \log \left(1 - \frac{x - y}{1 - y}\right) \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (- 1.0 (log (- 1.0 (/ (- x y) (- 1.0 y))))))

C

double code(double x, double y) {
	return 1.0 - log((1.0 - ((x - y) / (1.0 - 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)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = 1.0d0 - log((1.0d0 - ((x - y) / (1.0d0 - y))))
end function

Java

public static double code(double x, double y) {
	return 1.0 - Math.log((1.0 - ((x - y) / (1.0 - y))));
}

Python

def code(x, y):
	return 1.0 - math.log((1.0 - ((x - y) / (1.0 - y))))

Julia

function code(x, y)
	return Float64(1.0 - log(Float64(1.0 - Float64(Float64(x - y) / Float64(1.0 - y)))))
end

MATLAB

function tmp = code(x, y)
	tmp = 1.0 - log((1.0 - ((x - y) / (1.0 - y))));
end

Wolfram

code[x_, y_] := N[(1.0 - N[Log[N[(1.0 - N[(N[(x - y), $MachinePrecision] / N[(1.0 - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.9% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 1 - \log \left(1 - \frac{x - y}{1 - y}\right)\\ \mathbf{if}\;t\_0 \leq 2:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;1 - \log \left(-\frac{\mathsf{fma}\left(\frac{\mathsf{fma}\left(\frac{\mathsf{fma}\left(-1, x + \frac{x - 1}{y}, 1\right)}{y}, -1, x\right) - 1}{y}, -1, 1\right) - x}{y}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (- 1.0 (log (- 1.0 (/ (- x y) (- 1.0 y)))))))
   (if (<= t_0 2.0)
     t_0
     (-
      1.0
      (log
       (-
        (/
         (-
          (fma
           (/
            (- (fma (/ (fma -1.0 (+ x (/ (- x 1.0) y)) 1.0) y) -1.0 x) 1.0)
            y)
           -1.0
           1.0)
          x)
         y)))))))

C

double code(double x, double y) {
	double t_0 = 1.0 - log((1.0 - ((x - y) / (1.0 - y))));
	double tmp;
	if (t_0 <= 2.0) {
		tmp = t_0;
	} else {
		tmp = 1.0 - log(-((fma(((fma((fma(-1.0, (x + ((x - 1.0) / y)), 1.0) / y), -1.0, x) - 1.0) / y), -1.0, 1.0) - x) / y));
	}
	return tmp;
}

Julia

function code(x, y)
	t_0 = Float64(1.0 - log(Float64(1.0 - Float64(Float64(x - y) / Float64(1.0 - y)))))
	tmp = 0.0
	if (t_0 <= 2.0)
		tmp = t_0;
	else
		tmp = Float64(1.0 - log(Float64(-Float64(Float64(fma(Float64(Float64(fma(Float64(fma(-1.0, Float64(x + Float64(Float64(x - 1.0) / y)), 1.0) / y), -1.0, x) - 1.0) / y), -1.0, 1.0) - x) / y))));
	end
	return tmp
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(1.0 - N[Log[N[(1.0 - N[(N[(x - y), $MachinePrecision] / N[(1.0 - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 2.0], t$95$0, N[(1.0 - N[Log[(-N[(N[(N[(N[(N[(N[(N[(N[(-1.0 * N[(x + N[(N[(x - 1.0), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / y), $MachinePrecision] * -1.0 + x), $MachinePrecision] - 1.0), $MachinePrecision] / y), $MachinePrecision] * -1.0 + 1.0), $MachinePrecision] - x), $MachinePrecision] / y), $MachinePrecision])], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 100.0%

      \[1 - \log \left(1 - \frac{x - y}{1 - y}\right) \]
   2. Add Preprocessing

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

   1. Initial program 7.2%

      \[1 - \log \left(1 - \frac{x - y}{1 - y}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-/.f64 N/A

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

   5. Applied rewrites 99.7%

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

Alternative 2: 98.5% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (- 1.0 (log (- 1.0 (/ (- x y) (- 1.0 y)))))))
   (if (<= t_0 -20.0)
     (- 1.0 (log (/ (- x) (- 1.0 y))))
     (if (<= t_0 2.0)
       (- 1.0 (log (- (fma (- 1.0 x) y 1.0) x)))
       (- 1.0 (log (* (/ -1.0 y) (- 1.0 x))))))))

C

double code(double x, double y) {
	double t_0 = 1.0 - log((1.0 - ((x - y) / (1.0 - y))));
	double tmp;
	if (t_0 <= -20.0) {
		tmp = 1.0 - log((-x / (1.0 - y)));
	} else if (t_0 <= 2.0) {
		tmp = 1.0 - log((fma((1.0 - x), y, 1.0) - x));
	} else {
		tmp = 1.0 - log(((-1.0 / y) * (1.0 - x)));
	}
	return tmp;
}

Julia

function code(x, y)
	t_0 = Float64(1.0 - log(Float64(1.0 - Float64(Float64(x - y) / Float64(1.0 - y)))))
	tmp = 0.0
	if (t_0 <= -20.0)
		tmp = Float64(1.0 - log(Float64(Float64(-x) / Float64(1.0 - y))));
	elseif (t_0 <= 2.0)
		tmp = Float64(1.0 - log(Float64(fma(Float64(1.0 - x), y, 1.0) - x)));
	else
		tmp = Float64(1.0 - log(Float64(Float64(-1.0 / y) * Float64(1.0 - x))));
	end
	return tmp
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(1.0 - N[Log[N[(1.0 - N[(N[(x - y), $MachinePrecision] / N[(1.0 - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -20.0], N[(1.0 - N[Log[N[((-x) / N[(1.0 - y), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 2.0], N[(1.0 - N[Log[N[(N[(N[(1.0 - x), $MachinePrecision] * y + 1.0), $MachinePrecision] - x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(1.0 - N[Log[N[(N[(-1.0 / y), $MachinePrecision] * N[(1.0 - x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 100.0%

      \[1 - \log \left(1 - \frac{x - y}{1 - y}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lift--.f64 99.9

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

   5. Applied rewrites 99.9%

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

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

   1. Initial program 99.9%

      \[1 - \log \left(1 - \frac{x - y}{1 - y}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

      1. lower--.f64 N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-fma.f64 97.3

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

   5. Applied rewrites 97.3%

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

      1. lift-fma.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lift-neg.f64 97.3

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

   7. Applied rewrites 97.3%

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

   8. Taylor expanded in y around 0

      \[\leadsto 1 - \log \left(\left(1 + y \cdot \left(1 - x\right)\right) - x\right) \]
   9. Step-by-step derivation

      1. mul-1-neg N/A

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

      2. +-commutative N/A

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

      3. +-commutative N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. lower--.f64 97.3

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

   10. Applied rewrites 97.3%

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

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

   1. Initial program 7.2%

      \[1 - \log \left(1 - \frac{x - y}{1 - y}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around -inf

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

      1. +-commutative N/A

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

      2. sum-log N/A

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

      3. lower-log.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 98.9

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

   5. Applied rewrites 98.9%

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

Alternative 3: 98.5% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 1 - \log \left(1 - \frac{x - y}{1 - y}\right)\\ \mathbf{if}\;t\_0 \leq -20:\\ \;\;\;\;1 - \log \left(\frac{-x}{1 - y}\right)\\ \mathbf{elif}\;t\_0 \leq 2:\\ \;\;\;\;1 - \log \left(\mathsf{fma}\left(1 - x, y, 1\right) - x\right)\\ \mathbf{else}:\\ \;\;\;\;1 - \log \left(\frac{x - 1}{y}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (- 1.0 (log (- 1.0 (/ (- x y) (- 1.0 y)))))))
   (if (<= t_0 -20.0)
     (- 1.0 (log (/ (- x) (- 1.0 y))))
     (if (<= t_0 2.0)
       (- 1.0 (log (- (fma (- 1.0 x) y 1.0) x)))
       (- 1.0 (log (/ (- x 1.0) y)))))))

C

double code(double x, double y) {
	double t_0 = 1.0 - log((1.0 - ((x - y) / (1.0 - y))));
	double tmp;
	if (t_0 <= -20.0) {
		tmp = 1.0 - log((-x / (1.0 - y)));
	} else if (t_0 <= 2.0) {
		tmp = 1.0 - log((fma((1.0 - x), y, 1.0) - x));
	} else {
		tmp = 1.0 - log(((x - 1.0) / y));
	}
	return tmp;
}

Julia

function code(x, y)
	t_0 = Float64(1.0 - log(Float64(1.0 - Float64(Float64(x - y) / Float64(1.0 - y)))))
	tmp = 0.0
	if (t_0 <= -20.0)
		tmp = Float64(1.0 - log(Float64(Float64(-x) / Float64(1.0 - y))));
	elseif (t_0 <= 2.0)
		tmp = Float64(1.0 - log(Float64(fma(Float64(1.0 - x), y, 1.0) - x)));
	else
		tmp = Float64(1.0 - log(Float64(Float64(x - 1.0) / y)));
	end
	return tmp
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(1.0 - N[Log[N[(1.0 - N[(N[(x - y), $MachinePrecision] / N[(1.0 - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -20.0], N[(1.0 - N[Log[N[((-x) / N[(1.0 - y), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 2.0], N[(1.0 - N[Log[N[(N[(N[(1.0 - x), $MachinePrecision] * y + 1.0), $MachinePrecision] - x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(1.0 - N[Log[N[(N[(x - 1.0), $MachinePrecision] / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 100.0%

      \[1 - \log \left(1 - \frac{x - y}{1 - y}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lift--.f64 99.9

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

   5. Applied rewrites 99.9%

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

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

   1. Initial program 99.9%

      \[1 - \log \left(1 - \frac{x - y}{1 - y}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

      1. lower--.f64 N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-fma.f64 97.3

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

   5. Applied rewrites 97.3%

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

      1. lift-fma.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lift-neg.f64 97.3

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

   7. Applied rewrites 97.3%

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

   8. Taylor expanded in y around 0

      \[\leadsto 1 - \log \left(\left(1 + y \cdot \left(1 - x\right)\right) - x\right) \]
   9. Step-by-step derivation

      1. mul-1-neg N/A

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

      2. +-commutative N/A

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

      3. +-commutative N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. lower--.f64 97.3

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

   10. Applied rewrites 97.3%

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

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

   1. Initial program 7.2%

      \[1 - \log \left(1 - \frac{x - y}{1 - y}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower--.f64 99.4

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

   5. Applied rewrites 99.4%

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

   6. Taylor expanded in y around inf

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

      1. lift-/.f64 N/A

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

      2. lift--.f64 98.9

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

   8. Applied rewrites 98.9%

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

Alternative 4: 99.9% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 1 - \log \left(1 - \frac{x - y}{1 - y}\right)\\ \mathbf{if}\;t\_0 \leq 20:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;1 - \log \left(-\frac{\mathsf{fma}\left(\frac{x - 1}{y}, -1, 1\right) - x}{y}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (- 1.0 (log (- 1.0 (/ (- x y) (- 1.0 y)))))))
   (if (<= t_0 20.0)
     t_0
     (- 1.0 (log (- (/ (- (fma (/ (- x 1.0) y) -1.0 1.0) x) y)))))))

C

double code(double x, double y) {
	double t_0 = 1.0 - log((1.0 - ((x - y) / (1.0 - y))));
	double tmp;
	if (t_0 <= 20.0) {
		tmp = t_0;
	} else {
		tmp = 1.0 - log(-((fma(((x - 1.0) / y), -1.0, 1.0) - x) / y));
	}
	return tmp;
}

Julia

function code(x, y)
	t_0 = Float64(1.0 - log(Float64(1.0 - Float64(Float64(x - y) / Float64(1.0 - y)))))
	tmp = 0.0
	if (t_0 <= 20.0)
		tmp = t_0;
	else
		tmp = Float64(1.0 - log(Float64(-Float64(Float64(fma(Float64(Float64(x - 1.0) / y), -1.0, 1.0) - x) / y))));
	end
	return tmp
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(1.0 - N[Log[N[(1.0 - N[(N[(x - y), $MachinePrecision] / N[(1.0 - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 20.0], t$95$0, N[(1.0 - N[Log[(-N[(N[(N[(N[(N[(x - 1.0), $MachinePrecision] / y), $MachinePrecision] * -1.0 + 1.0), $MachinePrecision] - x), $MachinePrecision] / y), $MachinePrecision])], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 99.8%

      \[1 - \log \left(1 - \frac{x - y}{1 - y}\right) \]
   2. Add Preprocessing

   if 20 < (-.f64 #s(literal 1 binary64) (log.f64 (-.f64 #s(literal 1 binary64) (/.f64 (-.f64 x y) (-.f64 #s(literal 1 binary64) y)))))

   1. Initial program 4.6%

      \[1 - \log \left(1 - \frac{x - y}{1 - y}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower--.f64 100.0

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

   5. Applied rewrites 100.0%

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

Alternative 5: 99.8% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 1 - \log \left(1 - \frac{x - y}{1 - y}\right)\\ \mathbf{if}\;t\_0 \leq 20:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;1 - \log \left(\frac{-1}{y} \cdot \left(1 - x\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (- 1.0 (log (- 1.0 (/ (- x y) (- 1.0 y)))))))
   (if (<= t_0 20.0) t_0 (- 1.0 (log (* (/ -1.0 y) (- 1.0 x)))))))

C

double code(double x, double y) {
	double t_0 = 1.0 - log((1.0 - ((x - y) / (1.0 - y))));
	double tmp;
	if (t_0 <= 20.0) {
		tmp = t_0;
	} else {
		tmp = 1.0 - log(((-1.0 / y) * (1.0 - x)));
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: t_0
    real(8) :: tmp
    t_0 = 1.0d0 - log((1.0d0 - ((x - y) / (1.0d0 - y))))
    if (t_0 <= 20.0d0) then
        tmp = t_0
    else
        tmp = 1.0d0 - log((((-1.0d0) / y) * (1.0d0 - x)))
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = 1.0 - Math.log((1.0 - ((x - y) / (1.0 - y))));
	double tmp;
	if (t_0 <= 20.0) {
		tmp = t_0;
	} else {
		tmp = 1.0 - Math.log(((-1.0 / y) * (1.0 - x)));
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = 1.0 - math.log((1.0 - ((x - y) / (1.0 - y))))
	tmp = 0
	if t_0 <= 20.0:
		tmp = t_0
	else:
		tmp = 1.0 - math.log(((-1.0 / y) * (1.0 - x)))
	return tmp

Julia

function code(x, y)
	t_0 = Float64(1.0 - log(Float64(1.0 - Float64(Float64(x - y) / Float64(1.0 - y)))))
	tmp = 0.0
	if (t_0 <= 20.0)
		tmp = t_0;
	else
		tmp = Float64(1.0 - log(Float64(Float64(-1.0 / y) * Float64(1.0 - x))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = 1.0 - log((1.0 - ((x - y) / (1.0 - y))));
	tmp = 0.0;
	if (t_0 <= 20.0)
		tmp = t_0;
	else
		tmp = 1.0 - log(((-1.0 / y) * (1.0 - x)));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(1.0 - N[Log[N[(1.0 - N[(N[(x - y), $MachinePrecision] / N[(1.0 - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 20.0], t$95$0, N[(1.0 - N[Log[N[(N[(-1.0 / y), $MachinePrecision] * N[(1.0 - x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 99.8%

      \[1 - \log \left(1 - \frac{x - y}{1 - y}\right) \]
   2. Add Preprocessing

   if 20 < (-.f64 #s(literal 1 binary64) (log.f64 (-.f64 #s(literal 1 binary64) (/.f64 (-.f64 x y) (-.f64 #s(literal 1 binary64) y)))))

   1. Initial program 4.6%

      \[1 - \log \left(1 - \frac{x - y}{1 - y}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around -inf

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

      1. +-commutative N/A

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

      2. sum-log N/A

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

      3. lower-log.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 99.8

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

   5. Applied rewrites 99.8%

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

Alternative 6: 80.7% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;1 - \log \left(1 - \frac{x - y}{1 - y}\right) \leq 2:\\ \;\;\;\;1 - \log \left(\left(y + 1\right) - x\right)\\ \mathbf{else}:\\ \;\;\;\;1 - \log \left(\frac{-1}{y}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (- 1.0 (log (- 1.0 (/ (- x y) (- 1.0 y))))) 2.0)
   (- 1.0 (log (- (+ y 1.0) x)))
   (- 1.0 (log (/ -1.0 y)))))

C

double code(double x, double y) {
	double tmp;
	if ((1.0 - log((1.0 - ((x - y) / (1.0 - y))))) <= 2.0) {
		tmp = 1.0 - log(((y + 1.0) - x));
	} else {
		tmp = 1.0 - log((-1.0 / y));
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((1.0d0 - log((1.0d0 - ((x - y) / (1.0d0 - y))))) <= 2.0d0) then
        tmp = 1.0d0 - log(((y + 1.0d0) - x))
    else
        tmp = 1.0d0 - log(((-1.0d0) / y))
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((1.0 - Math.log((1.0 - ((x - y) / (1.0 - y))))) <= 2.0) {
		tmp = 1.0 - Math.log(((y + 1.0) - x));
	} else {
		tmp = 1.0 - Math.log((-1.0 / y));
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (1.0 - math.log((1.0 - ((x - y) / (1.0 - y))))) <= 2.0:
		tmp = 1.0 - math.log(((y + 1.0) - x))
	else:
		tmp = 1.0 - math.log((-1.0 / y))
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (Float64(1.0 - log(Float64(1.0 - Float64(Float64(x - y) / Float64(1.0 - y))))) <= 2.0)
		tmp = Float64(1.0 - log(Float64(Float64(y + 1.0) - x)));
	else
		tmp = Float64(1.0 - log(Float64(-1.0 / y)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((1.0 - log((1.0 - ((x - y) / (1.0 - y))))) <= 2.0)
		tmp = 1.0 - log(((y + 1.0) - x));
	else
		tmp = 1.0 - log((-1.0 / y));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[N[(1.0 - N[Log[N[(1.0 - N[(N[(x - y), $MachinePrecision] / N[(1.0 - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 2.0], N[(1.0 - N[Log[N[(N[(y + 1.0), $MachinePrecision] - x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(1.0 - N[Log[N[(-1.0 / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 100.0%

      \[1 - \log \left(1 - \frac{x - y}{1 - y}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

      1. lower--.f64 N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-fma.f64 85.2

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

   5. Applied rewrites 85.2%

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

   6. Taylor expanded in x around 0

      \[\leadsto 1 - \log \left(\left(1 + y\right) - x\right) \]
   7. Step-by-step derivation

      1. +-commutative N/A

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

      2. lower-+.f64 86.4

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

   8. Applied rewrites 86.4%

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

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

   1. Initial program 7.2%

      \[1 - \log \left(1 - \frac{x - y}{1 - y}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around -inf

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

      1. +-commutative N/A

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

      2. sum-log N/A

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

      3. lower-log.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 98.9

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

   5. Applied rewrites 98.9%

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

   6. Taylor expanded in x around 0

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

      1. lift-/.f64 67.5

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

   8. Applied rewrites 67.5%

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

Alternative 7: 64.7% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\log \left(1 - \frac{x - y}{1 - y}\right) \leq -5:\\ \;\;\;\;1 - \log 1\\ \mathbf{else}:\\ \;\;\;\;1 - \log \left(\left(y + 1\right) - x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (log (- 1.0 (/ (- x y) (- 1.0 y)))) -5.0)
   (- 1.0 (log 1.0))
   (- 1.0 (log (- (+ y 1.0) x)))))

C

double code(double x, double y) {
	double tmp;
	if (log((1.0 - ((x - y) / (1.0 - y)))) <= -5.0) {
		tmp = 1.0 - log(1.0);
	} else {
		tmp = 1.0 - log(((y + 1.0) - x));
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (log((1.0d0 - ((x - y) / (1.0d0 - y)))) <= (-5.0d0)) then
        tmp = 1.0d0 - log(1.0d0)
    else
        tmp = 1.0d0 - log(((y + 1.0d0) - x))
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (Math.log((1.0 - ((x - y) / (1.0 - y)))) <= -5.0) {
		tmp = 1.0 - Math.log(1.0);
	} else {
		tmp = 1.0 - Math.log(((y + 1.0) - x));
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if math.log((1.0 - ((x - y) / (1.0 - y)))) <= -5.0:
		tmp = 1.0 - math.log(1.0)
	else:
		tmp = 1.0 - math.log(((y + 1.0) - x))
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (log(Float64(1.0 - Float64(Float64(x - y) / Float64(1.0 - y)))) <= -5.0)
		tmp = Float64(1.0 - log(1.0));
	else
		tmp = Float64(1.0 - log(Float64(Float64(y + 1.0) - x)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (log((1.0 - ((x - y) / (1.0 - y)))) <= -5.0)
		tmp = 1.0 - log(1.0);
	else
		tmp = 1.0 - log(((y + 1.0) - x));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[N[Log[N[(1.0 - N[(N[(x - y), $MachinePrecision] / N[(1.0 - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], -5.0], N[(1.0 - N[Log[1.0], $MachinePrecision]), $MachinePrecision], N[(1.0 - N[Log[N[(N[(y + 1.0), $MachinePrecision] - x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 6.3%

      \[1 - \log \left(1 - \frac{x - y}{1 - y}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

      1. lower--.f64 N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-fma.f64 0.0

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

   5. Applied rewrites 0.0%

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

   6. Taylor expanded in x around 0

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

      1. +-commutative N/A

         \[\leadsto 1 - \log \left(y + 1\right) \]

      2. lower-+.f64 0.3

         \[\leadsto 1 - \log \left(y + 1\right) \]

   8. Applied rewrites 0.3%

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

   9. Taylor expanded in y around 0

      \[\leadsto 1 - \log 1 \]
   10. Step-by-step derivation

   11. Applied rewrites 14.2%

       \[\leadsto 1 - \log 1 \]

   if -5 < (log.f64 (-.f64 #s(literal 1 binary64) (/.f64 (-.f64 x y) (-.f64 #s(literal 1 binary64) y))))

   1. Initial program 100.0%

      \[1 - \log \left(1 - \frac{x - y}{1 - y}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

      1. lower--.f64 N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-fma.f64 84.9

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

   5. Applied rewrites 84.9%

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

   6. Taylor expanded in x around 0

      \[\leadsto 1 - \log \left(\left(1 + y\right) - x\right) \]
   7. Step-by-step derivation

      1. +-commutative N/A

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

      2. lower-+.f64 86.0

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

   8. Applied rewrites 86.0%

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

Alternative 8: 63.2% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\log \left(1 - \frac{x - y}{1 - y}\right) \leq 0.5:\\ \;\;\;\;1 - \log 1\\ \mathbf{else}:\\ \;\;\;\;1 - \log \left(y - x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (log (- 1.0 (/ (- x y) (- 1.0 y)))) 0.5)
   (- 1.0 (log 1.0))
   (- 1.0 (log (- y x)))))

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (log((1.0d0 - ((x - y) / (1.0d0 - y)))) <= 0.5d0) then
        tmp = 1.0d0 - log(1.0d0)
    else
        tmp = 1.0d0 - log((y - x))
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (Math.log((1.0 - ((x - y) / (1.0 - y)))) <= 0.5) {
		tmp = 1.0 - Math.log(1.0);
	} else {
		tmp = 1.0 - Math.log((y - x));
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if math.log((1.0 - ((x - y) / (1.0 - y)))) <= 0.5:
		tmp = 1.0 - math.log(1.0)
	else:
		tmp = 1.0 - math.log((y - x))
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (log((1.0 - ((x - y) / (1.0 - y)))) <= 0.5)
		tmp = 1.0 - log(1.0);
	else
		tmp = 1.0 - log((y - x));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[N[Log[N[(1.0 - N[(N[(x - y), $MachinePrecision] / N[(1.0 - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 0.5], N[(1.0 - N[Log[1.0], $MachinePrecision]), $MachinePrecision], N[(1.0 - N[Log[N[(y - x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 60.0%

      \[1 - \log \left(1 - \frac{x - y}{1 - y}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

      1. lower--.f64 N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-fma.f64 56.4

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

   5. Applied rewrites 56.4%

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

   6. Taylor expanded in x around 0

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

      1. +-commutative N/A

         \[\leadsto 1 - \log \left(y + 1\right) \]

      2. lower-+.f64 55.3

         \[\leadsto 1 - \log \left(y + 1\right) \]

   8. Applied rewrites 55.3%

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

   9. Taylor expanded in y around 0

      \[\leadsto 1 - \log 1 \]
   10. Step-by-step derivation

   11. Applied rewrites 60.8%

       \[\leadsto 1 - \log 1 \]

   if 0.5 < (log.f64 (-.f64 #s(literal 1 binary64) (/.f64 (-.f64 x y) (-.f64 #s(literal 1 binary64) y))))

   1. Initial program 100.0%

      \[1 - \log \left(1 - \frac{x - y}{1 - y}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

      1. lower--.f64 N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-fma.f64 67.3

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

   5. Applied rewrites 67.3%

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

   6. Taylor expanded in x around 0

      \[\leadsto 1 - \log \left(\left(1 + y\right) - x\right) \]
   7. Step-by-step derivation

      1. +-commutative N/A

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

      2. lower-+.f64 69.9

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

   8. Applied rewrites 69.9%

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

   9. Taylor expanded in y around inf

      \[\leadsto 1 - \log \left(y - x\right) \]
   10. Step-by-step derivation

   11. Applied rewrites 68.5%

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

Alternative 9: 63.2% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\log \left(1 - \frac{x - y}{1 - y}\right) \leq 0.5:\\ \;\;\;\;1 - \log 1\\ \mathbf{else}:\\ \;\;\;\;1 - \log \left(-x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (log (- 1.0 (/ (- x y) (- 1.0 y)))) 0.5)
   (- 1.0 (log 1.0))
   (- 1.0 (log (- x)))))

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (log((1.0d0 - ((x - y) / (1.0d0 - y)))) <= 0.5d0) then
        tmp = 1.0d0 - log(1.0d0)
    else
        tmp = 1.0d0 - log(-x)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (Math.log((1.0 - ((x - y) / (1.0 - y)))) <= 0.5) {
		tmp = 1.0 - Math.log(1.0);
	} else {
		tmp = 1.0 - Math.log(-x);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if math.log((1.0 - ((x - y) / (1.0 - y)))) <= 0.5:
		tmp = 1.0 - math.log(1.0)
	else:
		tmp = 1.0 - math.log(-x)
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (log((1.0 - ((x - y) / (1.0 - y)))) <= 0.5)
		tmp = 1.0 - log(1.0);
	else
		tmp = 1.0 - log(-x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[N[Log[N[(1.0 - N[(N[(x - y), $MachinePrecision] / N[(1.0 - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 0.5], N[(1.0 - N[Log[1.0], $MachinePrecision]), $MachinePrecision], N[(1.0 - N[Log[(-x)], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 60.0%

      \[1 - \log \left(1 - \frac{x - y}{1 - y}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

      1. lower--.f64 N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-fma.f64 56.4

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

   5. Applied rewrites 56.4%

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

   6. Taylor expanded in x around 0

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

      1. +-commutative N/A

         \[\leadsto 1 - \log \left(y + 1\right) \]

      2. lower-+.f64 55.3

         \[\leadsto 1 - \log \left(y + 1\right) \]

   8. Applied rewrites 55.3%

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

   9. Taylor expanded in y around 0

      \[\leadsto 1 - \log 1 \]
   10. Step-by-step derivation

   11. Applied rewrites 60.8%

       \[\leadsto 1 - \log 1 \]

   if 0.5 < (log.f64 (-.f64 #s(literal 1 binary64) (/.f64 (-.f64 x y) (-.f64 #s(literal 1 binary64) y))))

   1. Initial program 100.0%

      \[1 - \log \left(1 - \frac{x - y}{1 - y}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lift--.f64 98.5

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

   5. Applied rewrites 98.5%

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

   6. Taylor expanded in y around 0

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

      1. mul-1-neg N/A

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

      2. lift-neg.f64 68.5

         \[\leadsto 1 - \log \left(-x\right) \]

   8. Applied rewrites 68.5%

      \[\leadsto 1 - \log \left(-x\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 10: 98.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 1 - \log \left(\frac{x - 1}{y}\right)\\ \mathbf{if}\;y \leq -0.82:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 1:\\ \;\;\;\;1 - \log \left(\mathsf{fma}\left(1 - x, y, 1\right) - x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (- 1.0 (log (/ (- x 1.0) y)))))
   (if (<= y -0.82)
     t_0
     (if (<= y 1.0) (- 1.0 (log (- (fma (- 1.0 x) y 1.0) x))) t_0))))

C

double code(double x, double y) {
	double t_0 = 1.0 - log(((x - 1.0) / y));
	double tmp;
	if (y <= -0.82) {
		tmp = t_0;
	} else if (y <= 1.0) {
		tmp = 1.0 - log((fma((1.0 - x), y, 1.0) - x));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y)
	t_0 = Float64(1.0 - log(Float64(Float64(x - 1.0) / y)))
	tmp = 0.0
	if (y <= -0.82)
		tmp = t_0;
	elseif (y <= 1.0)
		tmp = Float64(1.0 - log(Float64(fma(Float64(1.0 - x), y, 1.0) - x)));
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(1.0 - N[Log[N[(N[(x - 1.0), $MachinePrecision] / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -0.82], t$95$0, If[LessEqual[y, 1.0], N[(1.0 - N[Log[N[(N[(N[(1.0 - x), $MachinePrecision] * y + 1.0), $MachinePrecision] - x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -0.819999999999999951 or 1 < y

   1. Initial program 30.2%

      \[1 - \log \left(1 - \frac{x - y}{1 - y}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower--.f64 99.1

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

   5. Applied rewrites 99.1%

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

   6. Taylor expanded in y around inf

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

      1. lift-/.f64 N/A

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

      2. lift--.f64 98.4

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

   8. Applied rewrites 98.4%

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

   if -0.819999999999999951 < y < 1

   1. Initial program 100.0%

      \[1 - \log \left(1 - \frac{x - y}{1 - y}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

      1. lower--.f64 N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-fma.f64 99.2

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

   5. Applied rewrites 99.2%

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

      1. lift-fma.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lift-neg.f64 99.2

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

   7. Applied rewrites 99.2%

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

   8. Taylor expanded in y around 0

      \[\leadsto 1 - \log \left(\left(1 + y \cdot \left(1 - x\right)\right) - x\right) \]
   9. Step-by-step derivation

      1. mul-1-neg N/A

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

      2. +-commutative N/A

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

      3. +-commutative N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. lower--.f64 99.2

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

   10. Applied rewrites 99.2%

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

Alternative 11: 89.5% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -1.0)
   (- 1.0 (log (/ -1.0 y)))
   (if (<= y 1.0)
     (- 1.0 (log (- (fma (- 1.0 x) y 1.0) x)))
     (- 1.0 (log (/ x y))))))

C

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

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -1.0)
		tmp = Float64(1.0 - log(Float64(-1.0 / y)));
	elseif (y <= 1.0)
		tmp = Float64(1.0 - log(Float64(fma(Float64(1.0 - x), y, 1.0) - x)));
	else
		tmp = Float64(1.0 - log(Float64(x / y)));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if y < -1

   1. Initial program 22.2%

      \[1 - \log \left(1 - \frac{x - y}{1 - y}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around -inf

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

      1. +-commutative N/A

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

      2. sum-log N/A

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

      3. lower-log.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 98.4

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

   5. Applied rewrites 98.4%

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

   6. Taylor expanded in x around 0

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

      1. lift-/.f64 67.7

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

   8. Applied rewrites 67.7%

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

   if -1 < y < 1

   1. Initial program 100.0%

      \[1 - \log \left(1 - \frac{x - y}{1 - y}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

      1. lower--.f64 N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-fma.f64 99.2

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

   5. Applied rewrites 99.2%

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

      1. lift-fma.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lift-neg.f64 99.2

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

   7. Applied rewrites 99.2%

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

   8. Taylor expanded in y around 0

      \[\leadsto 1 - \log \left(\left(1 + y \cdot \left(1 - x\right)\right) - x\right) \]
   9. Step-by-step derivation

      1. mul-1-neg N/A

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

      2. +-commutative N/A

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

      3. +-commutative N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. lower--.f64 99.2

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

   10. Applied rewrites 99.2%

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

   if 1 < y

   1. Initial program 54.4%

      \[1 - \log \left(1 - \frac{x - y}{1 - y}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lift--.f64 98.6

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

   5. Applied rewrites 98.6%

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

   6. Taylor expanded in y around inf

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

      1. lower-/.f64 96.9

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

   8. Applied rewrites 96.9%

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

Alternative 12: 89.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.85:\\ \;\;\;\;1 - \log \left(\frac{-1}{y}\right)\\ \mathbf{elif}\;y \leq 1:\\ \;\;\;\;1 - \log \left(\left(y + 1\right) - x\right)\\ \mathbf{else}:\\ \;\;\;\;1 - \log \left(\frac{x}{y}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -1.85)
   (- 1.0 (log (/ -1.0 y)))
   (if (<= y 1.0) (- 1.0 (log (- (+ y 1.0) x))) (- 1.0 (log (/ x y))))))

C

double code(double x, double y) {
	double tmp;
	if (y <= -1.85) {
		tmp = 1.0 - log((-1.0 / y));
	} else if (y <= 1.0) {
		tmp = 1.0 - log(((y + 1.0) - x));
	} else {
		tmp = 1.0 - log((x / y));
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (y <= (-1.85d0)) then
        tmp = 1.0d0 - log(((-1.0d0) / y))
    else if (y <= 1.0d0) then
        tmp = 1.0d0 - log(((y + 1.0d0) - x))
    else
        tmp = 1.0d0 - log((x / y))
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= -1.85) {
		tmp = 1.0 - Math.log((-1.0 / y));
	} else if (y <= 1.0) {
		tmp = 1.0 - Math.log(((y + 1.0) - x));
	} else {
		tmp = 1.0 - Math.log((x / y));
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -1.85:
		tmp = 1.0 - math.log((-1.0 / y))
	elif y <= 1.0:
		tmp = 1.0 - math.log(((y + 1.0) - x))
	else:
		tmp = 1.0 - math.log((x / y))
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -1.85)
		tmp = Float64(1.0 - log(Float64(-1.0 / y)));
	elseif (y <= 1.0)
		tmp = Float64(1.0 - log(Float64(Float64(y + 1.0) - x)));
	else
		tmp = Float64(1.0 - log(Float64(x / y)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -1.85)
		tmp = 1.0 - log((-1.0 / y));
	elseif (y <= 1.0)
		tmp = 1.0 - log(((y + 1.0) - x));
	else
		tmp = 1.0 - log((x / y));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -1.85], N[(1.0 - N[Log[N[(-1.0 / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.0], N[(1.0 - N[Log[N[(N[(y + 1.0), $MachinePrecision] - x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(1.0 - N[Log[N[(x / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -1.8500000000000001

   1. Initial program 22.2%

      \[1 - \log \left(1 - \frac{x - y}{1 - y}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around -inf

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

      1. +-commutative N/A

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

      2. sum-log N/A

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

      3. lower-log.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 98.4

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

   5. Applied rewrites 98.4%

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

   6. Taylor expanded in x around 0

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

      1. lift-/.f64 67.7

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

   8. Applied rewrites 67.7%

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

   if -1.8500000000000001 < y < 1

   1. Initial program 100.0%

      \[1 - \log \left(1 - \frac{x - y}{1 - y}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

      1. lower--.f64 N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-fma.f64 99.2

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

   5. Applied rewrites 99.2%

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

   6. Taylor expanded in x around 0

      \[\leadsto 1 - \log \left(\left(1 + y\right) - x\right) \]
   7. Step-by-step derivation

      1. +-commutative N/A

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

      2. lower-+.f64 98.9

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

   8. Applied rewrites 98.9%

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

   if 1 < y

   1. Initial program 54.4%

      \[1 - \log \left(1 - \frac{x - y}{1 - y}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lift--.f64 98.6

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

   5. Applied rewrites 98.6%

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

   6. Taylor expanded in y around inf

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

      1. lower-/.f64 96.9

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

   8. Applied rewrites 96.9%

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

Alternative 13: 63.0% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ 1 - \log \left(1 - x\right) \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (- 1.0 (log (- 1.0 x))))

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

public static double code(double x, double y) {
	return 1.0 - Math.log((1.0 - x));
}

Python

def code(x, y):
	return 1.0 - math.log((1.0 - x))

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 72.1%

   \[1 - \log \left(1 - \frac{x - y}{1 - y}\right) \]
2. Add Preprocessing

3. Taylor expanded in y around 0

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

5. Applied rewrites 63.0%

   \[\leadsto 1 - \log \left(1 - \color{blue}{x}\right) \]
6. Add Preprocessing

Alternative 14: 42.9% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ 1 - \log 1 \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (- 1.0 (log 1.0)))

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

public static double code(double x, double y) {
	return 1.0 - Math.log(1.0);
}

Python

def code(x, y):
	return 1.0 - math.log(1.0)

Julia

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

MATLAB

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

Wolfram

code[x_, y_] := N[(1.0 - N[Log[1.0], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 72.1%

   \[1 - \log \left(1 - \frac{x - y}{1 - y}\right) \]
2. Add Preprocessing

3. Taylor expanded in y around 0

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

   1. lower--.f64 N/A

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

   2. +-commutative N/A

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

   3. *-commutative N/A

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

   4. lower-fma.f64 N/A

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

   5. +-commutative N/A

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

   6. lower-fma.f64 59.7

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

5. Applied rewrites 59.7%

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

6. Taylor expanded in x around 0

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

   1. +-commutative N/A

      \[\leadsto 1 - \log \left(y + 1\right) \]

   2. lower-+.f64 39.7

      \[\leadsto 1 - \log \left(y + 1\right) \]

8. Applied rewrites 39.7%

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

9. Taylor expanded in y around 0

   \[\leadsto 1 - \log 1 \]
10. Step-by-step derivation

11. Applied rewrites 42.9%

    \[\leadsto 1 - \log 1 \]
12. Add Preprocessing

Developer Target 1: 99.8% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 1 - \log \left(\frac{x}{y \cdot y} - \left(\frac{1}{y} - \frac{x}{y}\right)\right)\\ \mathbf{if}\;y < -81284752.61947241:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y < 3.0094271212461764 \cdot 10^{+25}:\\ \;\;\;\;\log \left(\frac{e^{1}}{1 - \frac{x - y}{1 - y}}\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (- 1.0 (log (- (/ x (* y y)) (- (/ 1.0 y) (/ x y)))))))
   (if (< y -81284752.61947241)
     t_0
     (if (< y 3.0094271212461764e+25)
       (log (/ (exp 1.0) (- 1.0 (/ (- x y) (- 1.0 y)))))
       t_0))))

C

double code(double x, double y) {
	double t_0 = 1.0 - log(((x / (y * y)) - ((1.0 / y) - (x / y))));
	double tmp;
	if (y < -81284752.61947241) {
		tmp = t_0;
	} else if (y < 3.0094271212461764e+25) {
		tmp = log((exp(1.0) / (1.0 - ((x - y) / (1.0 - y)))));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: t_0
    real(8) :: tmp
    t_0 = 1.0d0 - log(((x / (y * y)) - ((1.0d0 / y) - (x / y))))
    if (y < (-81284752.61947241d0)) then
        tmp = t_0
    else if (y < 3.0094271212461764d+25) then
        tmp = log((exp(1.0d0) / (1.0d0 - ((x - y) / (1.0d0 - y)))))
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = 1.0 - Math.log(((x / (y * y)) - ((1.0 / y) - (x / y))));
	double tmp;
	if (y < -81284752.61947241) {
		tmp = t_0;
	} else if (y < 3.0094271212461764e+25) {
		tmp = Math.log((Math.exp(1.0) / (1.0 - ((x - y) / (1.0 - y)))));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = 1.0 - math.log(((x / (y * y)) - ((1.0 / y) - (x / y))))
	tmp = 0
	if y < -81284752.61947241:
		tmp = t_0
	elif y < 3.0094271212461764e+25:
		tmp = math.log((math.exp(1.0) / (1.0 - ((x - y) / (1.0 - y)))))
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y)
	t_0 = Float64(1.0 - log(Float64(Float64(x / Float64(y * y)) - Float64(Float64(1.0 / y) - Float64(x / y)))))
	tmp = 0.0
	if (y < -81284752.61947241)
		tmp = t_0;
	elseif (y < 3.0094271212461764e+25)
		tmp = log(Float64(exp(1.0) / Float64(1.0 - Float64(Float64(x - y) / Float64(1.0 - y)))));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = 1.0 - log(((x / (y * y)) - ((1.0 / y) - (x / y))));
	tmp = 0.0;
	if (y < -81284752.61947241)
		tmp = t_0;
	elseif (y < 3.0094271212461764e+25)
		tmp = log((exp(1.0) / (1.0 - ((x - y) / (1.0 - y)))));
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(1.0 - N[Log[N[(N[(x / N[(y * y), $MachinePrecision]), $MachinePrecision] - N[(N[(1.0 / y), $MachinePrecision] - N[(x / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[Less[y, -81284752.61947241], t$95$0, If[Less[y, 3.0094271212461764e+25], N[Log[N[(N[Exp[1.0], $MachinePrecision] / N[(1.0 - N[(N[(x - y), $MachinePrecision] / N[(1.0 - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], t$95$0]]]

Reproduce

herbie shell --seed 2025089 
(FPCore (x y)
  :name "Numeric.SpecFunctions:invIncompleteGamma from math-functions-0.1.5.2, B"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< y -8128475261947241/100000000) (- 1 (log (- (/ x (* y y)) (- (/ 1 y) (/ x y))))) (if (< y 30094271212461764000000000) (log (/ (exp 1) (- 1 (/ (- x y) (- 1 y))))) (- 1 (log (- (/ x (* y y)) (- (/ 1 y) (/ x y))))))))

  (- 1.0 (log (- 1.0 (/ (- x y) (- 1.0 y))))))