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

Percentage Accurate: 71.7% → 99.8%

Time: 8.3s

Alternatives: 11

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: 71.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.8% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 100.0%

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

      1. lift-log.f64 N/A

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

      2. lift--.f64 N/A

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

      3. sub-neg N/A

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

      4. lower-log1p.f64 N/A

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

      5. lift-/.f64 N/A

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

      6. distribute-neg-frac N/A

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

      7. lower-/.f64 N/A

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

      8. neg-sub0 N/A

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

      9. lift--.f64 N/A

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

      10. sub-neg N/A

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

      11. +-commutative N/A

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

      12. associate--r+ N/A

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

      13. neg-sub0 N/A

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

      14. remove-double-neg N/A

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

      15. lower--.f64 100.0

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

   4. Applied rewrites 100.0%

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

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

   1. Initial program 5.8%

      \[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 + -1 \cdot x}{y}\right) - 1}{y}\right) - x}{y}\right)} \]

   5. Applied rewrites 100.0%

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

Alternative 2: 97.0% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (/ (- x y) (- 1.0 y))))
   (if (<= t_0 -40000000000.0)
     (- 1.0 (log (/ x (+ -1.0 y))))
     (if (<= t_0 0.9999998)
       (- 1.0 (log1p (/ y (- 1.0 y))))
       (- 1.0 (log (/ (- x 1.0) y)))))))

C

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

Java

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

Python

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

Julia

function code(x, y)
	t_0 = Float64(Float64(x - y) / Float64(1.0 - y))
	tmp = 0.0
	if (t_0 <= -40000000000.0)
		tmp = Float64(1.0 - log(Float64(x / Float64(-1.0 + y))));
	elseif (t_0 <= 0.9999998)
		tmp = Float64(1.0 - log1p(Float64(y / Float64(1.0 - y))));
	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[(N[(x - y), $MachinePrecision] / N[(1.0 - y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -40000000000.0], N[(1.0 - N[Log[N[(x / N[(-1.0 + y), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 0.9999998], N[(1.0 - N[Log[1 + N[(y / N[(1.0 - y), $MachinePrecision]), $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 (-.f64 x y) (-.f64 #s(literal 1 binary64) y)) < -4e10

   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. mul-1-neg N/A

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

      2. distribute-neg-frac2 N/A

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

      3. lower-/.f64 N/A

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

      4. sub-neg N/A

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

      5. mul-1-neg N/A

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

      6. distribute-neg-in N/A

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

      7. metadata-eval N/A

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

      8. mul-1-neg N/A

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

      9. remove-double-neg N/A

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

      10. lower-+.f64 100.0

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

   5. Applied rewrites 100.0%

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

   if -4e10 < (/.f64 (-.f64 x y) (-.f64 #s(literal 1 binary64) y)) < 0.999999799999999994

   1. Initial program 99.6%

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

   3. Taylor expanded in x around 0

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

      1. lower-log1p.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 99.4

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

   5. Applied rewrites 99.4%

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

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

   1. Initial program 3.8%

      \[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{1 + -1 \cdot x}{y}\right)} \]
   4. Step-by-step derivation

      1. associate-*r/ N/A

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

      2. neg-mul-1 N/A

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

      3. +-commutative N/A

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

      4. distribute-neg-in N/A

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

      5. mul-1-neg N/A

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

      6. remove-double-neg N/A

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

      7. sub-neg N/A

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

      8. lower-/.f64 N/A

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

      9. lower--.f64 100.0

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

   5. Applied rewrites 100.0%

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

Alternative 3: 87.7% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (/ (- x y) (- 1.0 y))))
   (if (<= t_0 -40000000000.0)
     (- 1.0 (log (/ x (+ -1.0 y))))
     (if (<= t_0 0.9999999999979322)
       (- 1.0 (log1p (/ y (- 1.0 y))))
       (- 1.0 (log (/ -1.0 y)))))))

C

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

Java

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   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. mul-1-neg N/A

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

      2. distribute-neg-frac2 N/A

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

      3. lower-/.f64 N/A

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

      4. sub-neg N/A

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

      5. mul-1-neg N/A

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

      6. distribute-neg-in N/A

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

      7. metadata-eval N/A

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

      8. mul-1-neg N/A

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

      9. remove-double-neg N/A

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

      10. lower-+.f64 100.0

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

   5. Applied rewrites 100.0%

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

   if -4e10 < (/.f64 (-.f64 x y) (-.f64 #s(literal 1 binary64) y)) < 0.99999999999793221

   1. Initial program 99.1%

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

   3. Taylor expanded in x around 0

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

      1. lower-log1p.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 98.6

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

   5. Applied rewrites 98.6%

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

   if 0.99999999999793221 < (/.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. Add Preprocessing

   3. Taylor expanded in y around inf

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

      1. associate-*r/ N/A

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

      2. neg-mul-1 N/A

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

      3. +-commutative N/A

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

      4. distribute-neg-in N/A

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

      5. mul-1-neg N/A

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

      6. remove-double-neg N/A

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

      7. sub-neg N/A

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

      8. lower-/.f64 N/A

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

      9. lower--.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 72.5%

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

Alternative 4: 99.7% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 100.0%

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

      1. lift-log.f64 N/A

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

      2. lift--.f64 N/A

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

      3. sub-neg N/A

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

      4. lower-log1p.f64 N/A

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

      5. lift-/.f64 N/A

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

      6. distribute-neg-frac N/A

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

      7. lower-/.f64 N/A

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

      8. neg-sub0 N/A

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

      9. lift--.f64 N/A

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

      10. sub-neg N/A

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

      11. +-commutative N/A

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

      12. associate--r+ N/A

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

      13. neg-sub0 N/A

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

      14. remove-double-neg N/A

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

      15. lower--.f64 100.0

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

   4. Applied rewrites 100.0%

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

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

   1. Initial program 5.8%

      \[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)} \]

   5. Applied rewrites 99.6%

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

Alternative 5: 99.8% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 99.8%

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

      1. lift-log.f64 N/A

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

      2. lift--.f64 N/A

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

      3. sub-neg N/A

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

      4. lower-log1p.f64 N/A

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

      5. lift-/.f64 N/A

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

      6. distribute-neg-frac N/A

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

      7. lower-/.f64 N/A

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

      8. neg-sub0 N/A

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

      9. lift--.f64 N/A

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

      10. sub-neg N/A

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

      11. +-commutative N/A

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

      12. associate--r+ N/A

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

      13. neg-sub0 N/A

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

      14. remove-double-neg N/A

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

      15. lower--.f64 99.8

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

   4. Applied rewrites 99.8%

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

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

   1. Initial program 3.8%

      \[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{1 + -1 \cdot x}{y}\right)} \]
   4. Step-by-step derivation

      1. associate-*r/ N/A

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

      2. neg-mul-1 N/A

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

      3. +-commutative N/A

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

      4. distribute-neg-in N/A

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

      5. mul-1-neg N/A

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

      6. remove-double-neg N/A

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

      7. sub-neg N/A

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

      8. lower-/.f64 N/A

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

      9. lower--.f64 100.0

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

   5. Applied rewrites 100.0%

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

Alternative 6: 80.1% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -42 or 1 < y

   1. Initial program 33.2%

      \[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. mul-1-neg N/A

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

      2. distribute-neg-frac2 N/A

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

      3. lower-/.f64 N/A

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

      4. sub-neg N/A

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

      5. mul-1-neg N/A

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

      6. distribute-neg-in N/A

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

      7. metadata-eval N/A

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

      8. mul-1-neg N/A

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

      9. remove-double-neg N/A

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

      10. lower-+.f64 53.5

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

   5. Applied rewrites 53.5%

      \[\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

   8. Applied rewrites 52.6%

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

   if -42 < 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 - \color{blue}{\left(\log \left(1 - x\right) + y \cdot \left(-1 \cdot \frac{x}{1 - x} + \frac{1}{1 - x}\right)\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. sub-neg N/A

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

      4. sub-neg N/A

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

      5. mul-1-neg N/A

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

      6. sub-neg N/A

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

      7. mul-1-neg N/A

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

      8. div-sub N/A

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

      9. sub-neg N/A

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

      10. mul-1-neg N/A

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

      11. *-inverses N/A

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

      12. *-rgt-identity N/A

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

      13. lower-+.f64 N/A

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

   5. Applied rewrites 99.2%

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

4. Final simplification 80.4%

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

Alternative 7: 89.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if y < -28

   1. Initial program 24.8%

      \[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{1 + -1 \cdot x}{y}\right)} \]
   4. Step-by-step derivation

      1. associate-*r/ N/A

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

      2. neg-mul-1 N/A

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

      3. +-commutative N/A

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

      4. distribute-neg-in N/A

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

      5. mul-1-neg N/A

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

      6. remove-double-neg N/A

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

      7. sub-neg N/A

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

      8. lower-/.f64 N/A

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

      9. lower--.f64 98.4

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

   5. Applied rewrites 98.4%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 62.8%

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

   if -28 < 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 - \color{blue}{\left(\log \left(1 - x\right) + y \cdot \left(-1 \cdot \frac{x}{1 - x} + \frac{1}{1 - x}\right)\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. sub-neg N/A

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

      4. sub-neg N/A

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

      5. mul-1-neg N/A

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

      6. sub-neg N/A

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

      7. mul-1-neg N/A

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

      8. div-sub N/A

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

      9. sub-neg N/A

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

      10. mul-1-neg N/A

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

      11. *-inverses N/A

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

      12. *-rgt-identity N/A

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

      13. lower-+.f64 N/A

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

   5. Applied rewrites 99.2%

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

   if 1 < y

   1. Initial program 68.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. mul-1-neg N/A

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

      2. distribute-neg-frac2 N/A

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

      3. lower-/.f64 N/A

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

      4. sub-neg N/A

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

      5. mul-1-neg N/A

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

      6. distribute-neg-in N/A

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

      7. metadata-eval N/A

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

      8. mul-1-neg N/A

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

      9. remove-double-neg N/A

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

      10. lower-+.f64 100.0

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

   5. Applied rewrites 100.0%

      \[\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

   8. Applied rewrites 97.3%

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

Alternative 8: 62.4% accurate, 1.2× 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 73.1%

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

3. Taylor expanded in y around 0

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

   1. sub-neg N/A

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

   2. mul-1-neg N/A

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

   3. lower-log1p.f64 N/A

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

   4. mul-1-neg N/A

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

   5. lower-neg.f64 63.1

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

5. Applied rewrites 63.1%

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

Alternative 9: 42.4% 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

real(8) function code(x, y)
    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 73.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(1 - x\right)} \]
4. Step-by-step derivation

   1. lower--.f64 63.1

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

5. Applied rewrites 63.1%

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

6. Taylor expanded in x around 0

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

8. Applied rewrites 47.0%

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

Alternative 10: 42.6% accurate, 20.7× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 73.1%

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

3. Taylor expanded in y around 0

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

   1. sub-neg N/A

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

   2. mul-1-neg N/A

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

   3. lower-log1p.f64 N/A

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

   4. mul-1-neg N/A

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

   5. lower-neg.f64 63.1

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

5. Applied rewrites 63.1%

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

6. Taylor expanded in x around 0

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

8. Applied rewrites 46.7%

   \[\leadsto 1 - \left(-x\right) \]
9. Add Preprocessing

Alternative 11: 41.3% accurate, 31.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 73.1%

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

3. Taylor expanded in y around 0

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

   1. sub-neg N/A

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

   2. mul-1-neg N/A

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

   3. lower-log1p.f64 N/A

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

   4. mul-1-neg N/A

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

   5. lower-neg.f64 63.1

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

5. Applied rewrites 63.1%

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

6. Taylor expanded in x around 0

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

8. Applied rewrites 46.7%

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

10. Applied rewrites 46.5%

    \[\leadsto 1 - \frac{0 - x \cdot x}{0 + \color{blue}{x}} \]
11. Step-by-step derivation

12. Applied rewrites 46.1%

    \[\leadsto 1 - x \]
13. 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 2024313 
(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))))))