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

Percentage Accurate: 72.7% → 99.3%

Time: 10.0s

Alternatives: 9

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

real(8) function code(x, y)
    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.7% 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

real(8) function code(x, y)
    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.3% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (/ (- x y) (- 1.0 y)) 0.005)
   (- 1.0 (log1p (fma x (/ 1.0 (+ y -1.0)) (/ y (- (- -1.0) y)))))
   (log (* y (/ E (+ x -1.0))))))

C

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

Julia

function code(x, y)
	tmp = 0.0
	if (Float64(Float64(x - y) / Float64(1.0 - y)) <= 0.005)
		tmp = Float64(1.0 - log1p(fma(x, Float64(1.0 / Float64(y + -1.0)), Float64(y / Float64(Float64(-(-1.0)) - y)))));
	else
		tmp = log(Float64(y * Float64(exp(1) / Float64(x + -1.0))));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 100.0%

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

      1. sub-neg 100.0%

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

      2. log1p-define 100.0%

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

      3. distribute-neg-frac2 100.0%

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

      4. neg-sub0 100.0%

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

      5. associate--r- 100.0%

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

      6. metadata-eval 100.0%

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

      7. +-commutative 100.0%

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

   3. Simplified 100.0%

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

      1. div-sub 100.0%

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

      2. div-inv 100.0%

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

      3. fmm-def 100.0%

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

   6. Applied egg-rr 100.0%

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

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

   1. Initial program 3.1%

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

      1. sub-neg 3.1%

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

      2. log1p-define 3.1%

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

      3. distribute-neg-frac2 3.1%

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

      4. neg-sub0 3.1%

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

      5. associate--r- 3.1%

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

      6. metadata-eval 3.1%

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

      7. +-commutative 3.1%

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

   3. Simplified 3.1%

      \[\leadsto \color{blue}{1 - \mathsf{log1p}\left(\frac{x - y}{y + -1}\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around inf 18.2%

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

      1. log-rec 18.2%

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

      2. unsub-neg 18.2%

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

      3. sub-neg 18.2%

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

      4. metadata-eval 18.2%

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

      5. +-commutative 18.2%

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

   7. Simplified 18.2%

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

      1. add-log-exp 18.2%

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

      2. exp-diff 18.2%

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

      3. diff-log 100.0%

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

      4. add-exp-log 100.0%

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

      5. +-commutative 100.0%

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

   9. Applied egg-rr 100.0%

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

       1. associate-/r/ 100.0%

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

       2. exp-1-e 100.0%

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

       3. +-commutative 100.0%

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

   11. Simplified 100.0%

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

4. Final simplification 100.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{x - y}{1 - y} \leq 0.005:\\ \;\;\;\;1 - \mathsf{log1p}\left(\mathsf{fma}\left(x, \frac{1}{y + -1}, \frac{y}{\left(--1\right) - y}\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\log \left(y \cdot \frac{e}{x + -1}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 99.3% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (/ (- x y) (- 1.0 y)) 0.005)
   (- 1.0 (log1p (/ (- x y) (+ y -1.0))))
   (log (* y (/ E (+ x -1.0))))))

C

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

Java

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

Python

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

Julia

function code(x, y)
	tmp = 0.0
	if (Float64(Float64(x - y) / Float64(1.0 - y)) <= 0.005)
		tmp = Float64(1.0 - log1p(Float64(Float64(x - y) / Float64(y + -1.0))));
	else
		tmp = log(Float64(y * Float64(exp(1) / Float64(x + -1.0))));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 100.0%

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

      1. sub-neg 100.0%

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

      2. log1p-define 100.0%

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

      3. distribute-neg-frac2 100.0%

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

      4. neg-sub0 100.0%

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

      5. associate--r- 100.0%

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

      6. metadata-eval 100.0%

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

      7. +-commutative 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{1 - \mathsf{log1p}\left(\frac{x - y}{y + -1}\right)} \]
   4. Add Preprocessing

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

   1. Initial program 3.1%

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

      1. sub-neg 3.1%

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

      2. log1p-define 3.1%

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

      3. distribute-neg-frac2 3.1%

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

      4. neg-sub0 3.1%

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

      5. associate--r- 3.1%

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

      6. metadata-eval 3.1%

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

      7. +-commutative 3.1%

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

   3. Simplified 3.1%

      \[\leadsto \color{blue}{1 - \mathsf{log1p}\left(\frac{x - y}{y + -1}\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around inf 18.2%

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

      1. log-rec 18.2%

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

      2. unsub-neg 18.2%

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

      3. sub-neg 18.2%

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

      4. metadata-eval 18.2%

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

      5. +-commutative 18.2%

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

   7. Simplified 18.2%

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

      1. add-log-exp 18.2%

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

      2. exp-diff 18.2%

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

      3. diff-log 100.0%

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

      4. add-exp-log 100.0%

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

      5. +-commutative 100.0%

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

   9. Applied egg-rr 100.0%

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

       1. associate-/r/ 100.0%

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

       2. exp-1-e 100.0%

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

       3. +-commutative 100.0%

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

   11. Simplified 100.0%

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

4. Final simplification 100.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{x - y}{1 - y} \leq 0.005:\\ \;\;\;\;1 - \mathsf{log1p}\left(\frac{x - y}{y + -1}\right)\\ \mathbf{else}:\\ \;\;\;\;\log \left(y \cdot \frac{e}{x + -1}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 98.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.7 \lor \neg \left(y \leq 1\right):\\ \;\;\;\;\log \left(y \cdot \frac{e}{x + -1}\right)\\ \mathbf{else}:\\ \;\;\;\;1 - \left(y + \mathsf{log1p}\left(-x\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -1.7) (not (<= y 1.0)))
   (log (* y (/ E (+ x -1.0))))
   (- 1.0 (+ y (log1p (- x))))))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -1.7) || !(y <= 1.0)) {
		tmp = log((y * (((double) M_E) / (x + -1.0))));
	} else {
		tmp = 1.0 - (y + log1p(-x));
	}
	return tmp;
}

Java

public static double code(double x, double y) {
	double tmp;
	if ((y <= -1.7) || !(y <= 1.0)) {
		tmp = Math.log((y * (Math.E / (x + -1.0))));
	} else {
		tmp = 1.0 - (y + Math.log1p(-x));
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -1.7) or not (y <= 1.0):
		tmp = math.log((y * (math.e / (x + -1.0))))
	else:
		tmp = 1.0 - (y + math.log1p(-x))
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -1.7) || !(y <= 1.0))
		tmp = log(Float64(y * Float64(exp(1) / Float64(x + -1.0))));
	else
		tmp = Float64(1.0 - Float64(y + log1p(Float64(-x))));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1.69999999999999996 or 1 < y

   1. Initial program 23.3%

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

      1. sub-neg 23.3%

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

      2. log1p-define 23.3%

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

      3. distribute-neg-frac2 23.3%

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

      4. neg-sub0 23.3%

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

      5. associate--r- 23.3%

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

      6. metadata-eval 23.3%

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

      7. +-commutative 23.3%

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

   3. Simplified 23.3%

      \[\leadsto \color{blue}{1 - \mathsf{log1p}\left(\frac{x - y}{y + -1}\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around inf 24.6%

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

      1. log-rec 24.6%

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

      2. unsub-neg 24.6%

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

      3. sub-neg 24.6%

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

      4. metadata-eval 24.6%

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

      5. +-commutative 24.6%

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

   7. Simplified 24.6%

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

      1. add-log-exp 24.6%

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

      2. exp-diff 24.6%

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

      3. diff-log 99.9%

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

      4. add-exp-log 100.0%

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

      5. +-commutative 100.0%

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

   9. Applied egg-rr 100.0%

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

       1. associate-/r/ 100.0%

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

       2. exp-1-e 100.0%

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

       3. +-commutative 100.0%

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

   11. Simplified 100.0%

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

   if -1.69999999999999996 < y < 1

   1. Initial program 100.0%

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

      1. sub-neg 100.0%

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

      2. log1p-define 100.0%

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

      3. distribute-neg-frac2 100.0%

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

      4. neg-sub0 100.0%

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

      5. associate--r- 100.0%

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

      6. metadata-eval 100.0%

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

      7. +-commutative 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{1 - \mathsf{log1p}\left(\frac{x - y}{y + -1}\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 99.7%

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

      1. +-commutative 99.7%

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

      2. div-sub 99.7%

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

      3. mul-1-neg 99.7%

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

      4. sub-neg 99.7%

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

      5. *-inverses 99.7%

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

      6. *-rgt-identity 99.7%

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

      7. log1p-define 99.8%

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

      8. mul-1-neg 99.8%

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

   7. Simplified 99.8%

      \[\leadsto 1 - \color{blue}{\left(y + \mathsf{log1p}\left(-x\right)\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.7 \lor \neg \left(y \leq 1\right):\\ \;\;\;\;\log \left(y \cdot \frac{e}{x + -1}\right)\\ \mathbf{else}:\\ \;\;\;\;1 - \left(y + \mathsf{log1p}\left(-x\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 73.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -3 \lor \neg \left(y \leq 1\right):\\ \;\;\;\;1 - \mathsf{log1p}\left(\frac{x}{y}\right)\\ \mathbf{else}:\\ \;\;\;\;1 - \left(y + \mathsf{log1p}\left(-x\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -3.0) (not (<= y 1.0)))
   (- 1.0 (log1p (/ x y)))
   (- 1.0 (+ y (log1p (- x))))))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -3.0) || !(y <= 1.0)) {
		tmp = 1.0 - log1p((x / y));
	} else {
		tmp = 1.0 - (y + log1p(-x));
	}
	return tmp;
}

Java

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

Python

def code(x, y):
	tmp = 0
	if (y <= -3.0) or not (y <= 1.0):
		tmp = 1.0 - math.log1p((x / y))
	else:
		tmp = 1.0 - (y + math.log1p(-x))
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -3.0) || !(y <= 1.0))
		tmp = Float64(1.0 - log1p(Float64(x / y)));
	else
		tmp = Float64(1.0 - Float64(y + log1p(Float64(-x))));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -3 or 1 < y

   1. Initial program 23.3%

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

      1. sub-neg 23.3%

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

      2. log1p-define 23.3%

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

      3. distribute-neg-frac2 23.3%

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

      4. neg-sub0 23.3%

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

      5. associate--r- 23.3%

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

      6. metadata-eval 23.3%

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

      7. +-commutative 23.3%

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

   3. Simplified 23.3%

      \[\leadsto \color{blue}{1 - \mathsf{log1p}\left(\frac{x - y}{y + -1}\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 29.7%

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

   6. Taylor expanded in y around inf 29.7%

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

   if -3 < y < 1

   1. Initial program 100.0%

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

      1. sub-neg 100.0%

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

      2. log1p-define 100.0%

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

      3. distribute-neg-frac2 100.0%

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

      4. neg-sub0 100.0%

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

      5. associate--r- 100.0%

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

      6. metadata-eval 100.0%

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

      7. +-commutative 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{1 - \mathsf{log1p}\left(\frac{x - y}{y + -1}\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 99.7%

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

      1. +-commutative 99.7%

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

      2. div-sub 99.7%

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

      3. mul-1-neg 99.7%

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

      4. sub-neg 99.7%

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

      5. *-inverses 99.7%

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

      6. *-rgt-identity 99.7%

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

      7. log1p-define 99.8%

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

      8. mul-1-neg 99.8%

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

   7. Simplified 99.8%

      \[\leadsto 1 - \color{blue}{\left(y + \mathsf{log1p}\left(-x\right)\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 73.5%

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

Alternative 5: 72.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1 \lor \neg \left(y \leq 3.8 \cdot 10^{-18}\right):\\ \;\;\;\;1 - \mathsf{log1p}\left(\frac{x}{y}\right)\\ \mathbf{else}:\\ \;\;\;\;1 - \mathsf{log1p}\left(-x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -1.0) (not (<= y 3.8e-18)))
   (- 1.0 (log1p (/ x y)))
   (- 1.0 (log1p (- x)))))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -1.0) || !(y <= 3.8e-18)) {
		tmp = 1.0 - log1p((x / y));
	} else {
		tmp = 1.0 - log1p(-x);
	}
	return tmp;
}

Java

public static double code(double x, double y) {
	double tmp;
	if ((y <= -1.0) || !(y <= 3.8e-18)) {
		tmp = 1.0 - Math.log1p((x / y));
	} else {
		tmp = 1.0 - Math.log1p(-x);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -1.0) or not (y <= 3.8e-18):
		tmp = 1.0 - math.log1p((x / y))
	else:
		tmp = 1.0 - math.log1p(-x)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -1.0) || !(y <= 3.8e-18))
		tmp = Float64(1.0 - log1p(Float64(x / y)));
	else
		tmp = Float64(1.0 - log1p(Float64(-x)));
	end
	return tmp
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -1.0], N[Not[LessEqual[y, 3.8e-18]], $MachinePrecision]], N[(1.0 - N[Log[1 + N[(x / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(1.0 - N[Log[1 + (-x)], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1 or 3.7999999999999998e-18 < y

   1. Initial program 24.9%

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

      1. sub-neg 24.9%

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

      2. log1p-define 24.9%

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

      3. distribute-neg-frac2 24.9%

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

      4. neg-sub0 24.9%

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

      5. associate--r- 24.9%

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

      6. metadata-eval 24.9%

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

      7. +-commutative 24.9%

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

   3. Simplified 24.9%

      \[\leadsto \color{blue}{1 - \mathsf{log1p}\left(\frac{x - y}{y + -1}\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 31.1%

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

   6. Taylor expanded in y around inf 31.0%

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

   if -1 < y < 3.7999999999999998e-18

   1. Initial program 100.0%

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

      1. sub-neg 100.0%

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

      2. log1p-define 100.0%

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

      3. distribute-neg-frac2 100.0%

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

      4. neg-sub0 100.0%

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

      5. associate--r- 100.0%

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

      6. metadata-eval 100.0%

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

      7. +-commutative 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{1 - \mathsf{log1p}\left(\frac{x - y}{y + -1}\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 99.5%

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

      1. log1p-define 99.5%

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

      2. mul-1-neg 99.5%

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

   7. Simplified 99.5%

      \[\leadsto \color{blue}{1 - \mathsf{log1p}\left(-x\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 73.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1 \lor \neg \left(y \leq 3.8 \cdot 10^{-18}\right):\\ \;\;\;\;1 - \mathsf{log1p}\left(\frac{x}{y}\right)\\ \mathbf{else}:\\ \;\;\;\;1 - \mathsf{log1p}\left(-x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 63.1% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Initial program 71.2%

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

   1. sub-neg 71.2%

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

   2. log1p-define 71.2%

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

   3. distribute-neg-frac2 71.2%

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

   4. neg-sub0 71.2%

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

   5. associate--r- 71.2%

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

   6. metadata-eval 71.2%

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

   7. +-commutative 71.2%

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

3. Simplified 71.2%

   \[\leadsto \color{blue}{1 - \mathsf{log1p}\left(\frac{x - y}{y + -1}\right)} \]
4. Add Preprocessing

5. Taylor expanded in y around 0 65.8%

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

   1. log1p-define 65.8%

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

   2. mul-1-neg 65.8%

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

7. Simplified 65.8%

   \[\leadsto \color{blue}{1 - \mathsf{log1p}\left(-x\right)} \]
8. Add Preprocessing

Alternative 7: 45.2% accurate, 15.9× speedup

Math

\[\begin{array}{l} \\ 1 - \frac{x}{y + -1} \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = 1.0d0 - (x / (y + (-1.0d0)))
end function

Java

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

Python

def code(x, y):
	return 1.0 - (x / (y + -1.0))

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 71.2%

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

   1. sub-neg 71.2%

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

   2. log1p-define 71.2%

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

   3. distribute-neg-frac2 71.2%

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

   4. neg-sub0 71.2%

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

   5. associate--r- 71.2%

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

   6. metadata-eval 71.2%

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

   7. +-commutative 71.2%

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

3. Simplified 71.2%

   \[\leadsto \color{blue}{1 - \mathsf{log1p}\left(\frac{x - y}{y + -1}\right)} \]
4. Add Preprocessing

5. Taylor expanded in x around inf 73.4%

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

6. Taylor expanded in x around 0 47.2%

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

7. Final simplification 47.2%

   \[\leadsto 1 - \frac{x}{y + -1} \]
8. Add Preprocessing

Alternative 8: 43.8% accurate, 37.0× speedup

Math

\[\begin{array}{l} \\ x + 1 \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (+ x 1.0))

C

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

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = x + 1.0d0
end function

Java

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

Python

def code(x, y):
	return x + 1.0

Julia

function code(x, y)
	return Float64(x + 1.0)
end

MATLAB

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

Wolfram

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

Derivation

1. Initial program 71.2%

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

   1. sub-neg 71.2%

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

   2. log1p-define 71.2%

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

   3. distribute-neg-frac2 71.2%

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

   4. neg-sub0 71.2%

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

   5. associate--r- 71.2%

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

   6. metadata-eval 71.2%

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

   7. +-commutative 71.2%

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

3. Simplified 71.2%

   \[\leadsto \color{blue}{1 - \mathsf{log1p}\left(\frac{x - y}{y + -1}\right)} \]
4. Add Preprocessing

5. Taylor expanded in y around 0 65.8%

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

6. Taylor expanded in x around 0 46.1%

   \[\leadsto \color{blue}{1 + x} \]

7. Final simplification 46.1%

   \[\leadsto x + 1 \]
8. Add Preprocessing

Alternative 9: 43.4% accurate, 111.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 1.0)

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return 1.0

Julia

function code(x, y)
	return 1.0
end

MATLAB

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

Wolfram

code[x_, y_] := 1.0

Derivation

1. Initial program 71.2%

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

   1. sub-neg 71.2%

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

   2. log1p-define 71.2%

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

   3. distribute-neg-frac2 71.2%

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

   4. neg-sub0 71.2%

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

   5. associate--r- 71.2%

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

   6. metadata-eval 71.2%

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

   7. +-commutative 71.2%

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

3. Simplified 71.2%

   \[\leadsto \color{blue}{1 - \mathsf{log1p}\left(\frac{x - y}{y + -1}\right)} \]
4. Add Preprocessing

5. Taylor expanded in x around inf 73.4%

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

6. Taylor expanded in x around 0 45.9%

   \[\leadsto \color{blue}{1} \]
7. 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

real(8) function code(x, y)
    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 2024186 
(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))))))