Numeric.SpecFunctions:invIncompleteBetaWorker from math-functions-0.1.5.2, F

Percentage Accurate: 77.4% → 99.3%

Time: 7.1s

Alternatives: 6

Speedup: 7.2×

Specification

Math

\[\begin{array}{l} \\ \frac{e^{x \cdot \log \left(\frac{x}{x + y}\right)}}{x} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (/ (exp (* x (log (/ x (+ x y))))) x))

C

double code(double x, double y) {
	return exp((x * log((x / (x + y))))) / x;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = exp((x * log((x / (x + y))))) / x
end function

Java

public static double code(double x, double y) {
	return Math.exp((x * Math.log((x / (x + y))))) / x;
}

Python

def code(x, y):
	return math.exp((x * math.log((x / (x + y))))) / x

Julia

function code(x, y)
	return Float64(exp(Float64(x * log(Float64(x / Float64(x + y))))) / x)
end

MATLAB

function tmp = code(x, y)
	tmp = exp((x * log((x / (x + y))))) / x;
end

Wolfram

code[x_, y_] := N[(N[Exp[N[(x * N[Log[N[(x / N[(x + y), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / x), $MachinePrecision]

Initial Program: 77.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{e^{x \cdot \log \left(\frac{x}{x + y}\right)}}{x} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (/ (exp (* x (log (/ x (+ x y))))) x))

C

double code(double x, double y) {
	return exp((x * log((x / (x + y))))) / x;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = exp((x * log((x / (x + y))))) / x
end function

Java

public static double code(double x, double y) {
	return Math.exp((x * Math.log((x / (x + y))))) / x;
}

Python

def code(x, y):
	return math.exp((x * math.log((x / (x + y))))) / x

Julia

function code(x, y)
	return Float64(exp(Float64(x * log(Float64(x / Float64(x + y))))) / x)
end

MATLAB

function tmp = code(x, y)
	tmp = exp((x * log((x / (x + y))))) / x;
end

Wolfram

code[x_, y_] := N[(N[Exp[N[(x * N[Log[N[(x / N[(x + y), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / x), $MachinePrecision]

Alternative 1: 99.3% accurate, 1.8× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -11000.0) (not (<= x 1.14e-10))) (/ (exp (- y)) x) (/ 1.0 x)))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -11000.0) || !(x <= 1.14e-10)) {
		tmp = exp(-y) / x;
	} else {
		tmp = 1.0 / x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((x <= (-11000.0d0)) .or. (.not. (x <= 1.14d-10))) then
        tmp = exp(-y) / x
    else
        tmp = 1.0d0 / x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((x <= -11000.0) || !(x <= 1.14e-10)) {
		tmp = Math.exp(-y) / x;
	} else {
		tmp = 1.0 / x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x <= -11000.0) or not (x <= 1.14e-10):
		tmp = math.exp(-y) / x
	else:
		tmp = 1.0 / x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -11000.0) || !(x <= 1.14e-10))
		tmp = Float64(exp(Float64(-y)) / x);
	else
		tmp = Float64(1.0 / x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x <= -11000.0) || ~((x <= 1.14e-10)))
		tmp = exp(-y) / x;
	else
		tmp = 1.0 / x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -11000.0], N[Not[LessEqual[x, 1.14e-10]], $MachinePrecision]], N[(N[Exp[(-y)], $MachinePrecision] / x), $MachinePrecision], N[(1.0 / x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -11000 or 1.1399999999999999e-10 < x

   1. Initial program 68.9%

      \[\frac{e^{x \cdot \log \left(\frac{x}{x + y}\right)}}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \frac{e^{\color{blue}{-1 \cdot y}}}{x} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \frac{e^{\color{blue}{\mathsf{neg}\left(y\right)}}}{x} \]

      2. lower-neg.f64 100.0

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

   5. Applied rewrites 100.0%

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

   if -11000 < x < 1.1399999999999999e-10

   1. Initial program 82.0%

      \[\frac{e^{x \cdot \log \left(\frac{x}{x + y}\right)}}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 99.7%

      \[\leadsto \frac{\color{blue}{1}}{x} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.9%

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

Alternative 2: 82.2% accurate, 3.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -11000:\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{0.5 \cdot \mathsf{fma}\left(y, x, y\right)}{x} - 1, y, 1\right)}{x}\\ \mathbf{elif}\;x \leq 9 \cdot 10^{+167}:\\ \;\;\;\;\frac{1}{x}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\mathsf{fma}\left(\mathsf{fma}\left(0.5 \cdot y - 1, y, 1\right), x, \left(y \cdot y\right) \cdot 0.5\right)}{x}}{x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -11000.0)
   (/ (fma (- (/ (* 0.5 (fma y x y)) x) 1.0) y 1.0) x)
   (if (<= x 9e+167)
     (/ 1.0 x)
     (/ (/ (fma (fma (- (* 0.5 y) 1.0) y 1.0) x (* (* y y) 0.5)) x) x))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -11000.0) {
		tmp = fma((((0.5 * fma(y, x, y)) / x) - 1.0), y, 1.0) / x;
	} else if (x <= 9e+167) {
		tmp = 1.0 / x;
	} else {
		tmp = (fma(fma(((0.5 * y) - 1.0), y, 1.0), x, ((y * y) * 0.5)) / x) / x;
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -11000.0)
		tmp = Float64(fma(Float64(Float64(Float64(0.5 * fma(y, x, y)) / x) - 1.0), y, 1.0) / x);
	elseif (x <= 9e+167)
		tmp = Float64(1.0 / x);
	else
		tmp = Float64(Float64(fma(fma(Float64(Float64(0.5 * y) - 1.0), y, 1.0), x, Float64(Float64(y * y) * 0.5)) / x) / x);
	end
	return tmp
end

Wolfram

code[x_, y_] := If[LessEqual[x, -11000.0], N[(N[(N[(N[(N[(0.5 * N[(y * x + y), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision] - 1.0), $MachinePrecision] * y + 1.0), $MachinePrecision] / x), $MachinePrecision], If[LessEqual[x, 9e+167], N[(1.0 / x), $MachinePrecision], N[(N[(N[(N[(N[(N[(0.5 * y), $MachinePrecision] - 1.0), $MachinePrecision] * y + 1.0), $MachinePrecision] * x + N[(N[(y * y), $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision] / x), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -11000

   1. Initial program 72.1%

      \[\frac{e^{x \cdot \log \left(\frac{x}{x + y}\right)}}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 N/A

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

      9. associate-*r/ N/A

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

      10. metadata-eval N/A

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

      11. lower-/.f64 73.7

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

   5. Applied rewrites 73.7%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 81.9%

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

   if -11000 < x < 8.9999999999999998e167

   1. Initial program 83.4%

      \[\frac{e^{x \cdot \log \left(\frac{x}{x + y}\right)}}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 91.8%

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

   if 8.9999999999999998e167 < x

   1. Initial program 47.8%

      \[\frac{e^{x \cdot \log \left(\frac{x}{x + y}\right)}}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 N/A

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

      9. associate-*r/ N/A

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

      10. metadata-eval N/A

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

      11. lower-/.f64 40.7

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

   5. Applied rewrites 40.7%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 56.1%

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

Alternative 3: 81.8% accurate, 4.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -11000 \lor \neg \left(x \leq 4 \cdot 10^{+168}\right):\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{0.5 \cdot \mathsf{fma}\left(y, x, y\right)}{x} - 1, y, 1\right)}{x}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -11000.0) (not (<= x 4e+168)))
   (/ (fma (- (/ (* 0.5 (fma y x y)) x) 1.0) y 1.0) x)
   (/ 1.0 x)))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -11000.0) || !(x <= 4e+168)) {
		tmp = fma((((0.5 * fma(y, x, y)) / x) - 1.0), y, 1.0) / x;
	} else {
		tmp = 1.0 / x;
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -11000.0) || !(x <= 4e+168))
		tmp = Float64(fma(Float64(Float64(Float64(0.5 * fma(y, x, y)) / x) - 1.0), y, 1.0) / x);
	else
		tmp = Float64(1.0 / x);
	end
	return tmp
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -11000.0], N[Not[LessEqual[x, 4e+168]], $MachinePrecision]], N[(N[(N[(N[(N[(0.5 * N[(y * x + y), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision] - 1.0), $MachinePrecision] * y + 1.0), $MachinePrecision] / x), $MachinePrecision], N[(1.0 / x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -11000 or 3.9999999999999997e168 < x

   1. Initial program 61.9%

      \[\frac{e^{x \cdot \log \left(\frac{x}{x + y}\right)}}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 N/A

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

      9. associate-*r/ N/A

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

      10. metadata-eval N/A

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

      11. lower-/.f64 59.8

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

   5. Applied rewrites 59.8%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 68.2%

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

   if -11000 < x < 3.9999999999999997e168

   1. Initial program 83.4%

      \[\frac{e^{x \cdot \log \left(\frac{x}{x + y}\right)}}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 91.8%

      \[\leadsto \frac{\color{blue}{1}}{x} \]
3. Recombined 2 regimes into one program.

4. Final simplification 82.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -11000 \lor \neg \left(x \leq 4 \cdot 10^{+168}\right):\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{0.5 \cdot \mathsf{fma}\left(y, x, y\right)}{x} - 1, y, 1\right)}{x}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{x}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 80.8% accurate, 5.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -11000 \lor \neg \left(x \leq 4 \cdot 10^{+168}\right):\\ \;\;\;\;\frac{\frac{x - x \cdot y}{x}}{x}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -11000.0) (not (<= x 4e+168)))
   (/ (/ (- x (* x y)) x) x)
   (/ 1.0 x)))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -11000.0) || !(x <= 4e+168)) {
		tmp = ((x - (x * y)) / x) / x;
	} else {
		tmp = 1.0 / x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((x <= (-11000.0d0)) .or. (.not. (x <= 4d+168))) then
        tmp = ((x - (x * y)) / x) / x
    else
        tmp = 1.0d0 / x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((x <= -11000.0) || !(x <= 4e+168)) {
		tmp = ((x - (x * y)) / x) / x;
	} else {
		tmp = 1.0 / x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x <= -11000.0) or not (x <= 4e+168):
		tmp = ((x - (x * y)) / x) / x
	else:
		tmp = 1.0 / x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -11000.0) || !(x <= 4e+168))
		tmp = Float64(Float64(Float64(x - Float64(x * y)) / x) / x);
	else
		tmp = Float64(1.0 / x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x <= -11000.0) || ~((x <= 4e+168)))
		tmp = ((x - (x * y)) / x) / x;
	else
		tmp = 1.0 / x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -11000.0], N[Not[LessEqual[x, 4e+168]], $MachinePrecision]], N[(N[(N[(x - N[(x * y), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision] / x), $MachinePrecision], N[(1.0 / x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -11000 or 3.9999999999999997e168 < x

   1. Initial program 61.9%

      \[\frac{e^{x \cdot \log \left(\frac{x}{x + y}\right)}}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 N/A

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

      9. associate-*r/ N/A

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

      10. metadata-eval N/A

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

      11. lower-/.f64 59.8

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

   5. Applied rewrites 59.8%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 68.0%

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

   9. Taylor expanded in y around 0

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

   11. Applied rewrites 66.9%

       \[\leadsto \frac{\frac{x - x \cdot y}{x}}{x} \]

   if -11000 < x < 3.9999999999999997e168

   1. Initial program 83.4%

      \[\frac{e^{x \cdot \log \left(\frac{x}{x + y}\right)}}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 91.8%

      \[\leadsto \frac{\color{blue}{1}}{x} \]
3. Recombined 2 regimes into one program.

4. Final simplification 81.8%

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

Alternative 5: 78.8% accurate, 7.2× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -11000.0) (/ (fma (- (* 0.5 y) 1.0) y 1.0) x) (/ 1.0 x)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -11000

   1. Initial program 72.1%

      \[\frac{e^{x \cdot \log \left(\frac{x}{x + y}\right)}}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 N/A

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

      9. associate-*r/ N/A

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

      10. metadata-eval N/A

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

      11. lower-/.f64 73.7

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

   5. Applied rewrites 73.7%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 73.7%

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

   if -11000 < x

   1. Initial program 75.6%

      \[\frac{e^{x \cdot \log \left(\frac{x}{x + y}\right)}}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 80.3%

      \[\leadsto \frac{\color{blue}{1}}{x} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 74.5% accurate, 19.3× speedup

Math

\[\begin{array}{l} \\ \frac{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 74.8%

   \[\frac{e^{x \cdot \log \left(\frac{x}{x + y}\right)}}{x} \]
2. Add Preprocessing

3. Taylor expanded in x around 0

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

5. Applied rewrites 76.1%

   \[\leadsto \frac{\color{blue}{1}}{x} \]
6. Add Preprocessing

Developer Target 1: 77.5% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{e^{\frac{-1}{y}}}{x}\\ t_1 := \frac{{\left(\frac{x}{y + x}\right)}^{x}}{x}\\ \mathbf{if}\;y < -3.7311844206647956 \cdot 10^{+94}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y < 2.817959242728288 \cdot 10^{+37}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y < 2.347387415166998 \cdot 10^{+178}:\\ \;\;\;\;\log \left(e^{t\_1}\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (/ (exp (/ -1.0 y)) x)) (t_1 (/ (pow (/ x (+ y x)) x) x)))
   (if (< y -3.7311844206647956e+94)
     t_0
     (if (< y 2.817959242728288e+37)
       t_1
       (if (< y 2.347387415166998e+178) (log (exp t_1)) t_0)))))

C

double code(double x, double y) {
	double t_0 = exp((-1.0 / y)) / x;
	double t_1 = pow((x / (y + x)), x) / x;
	double tmp;
	if (y < -3.7311844206647956e+94) {
		tmp = t_0;
	} else if (y < 2.817959242728288e+37) {
		tmp = t_1;
	} else if (y < 2.347387415166998e+178) {
		tmp = log(exp(t_1));
	} 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) :: t_1
    real(8) :: tmp
    t_0 = exp(((-1.0d0) / y)) / x
    t_1 = ((x / (y + x)) ** x) / x
    if (y < (-3.7311844206647956d+94)) then
        tmp = t_0
    else if (y < 2.817959242728288d+37) then
        tmp = t_1
    else if (y < 2.347387415166998d+178) then
        tmp = log(exp(t_1))
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = Math.exp((-1.0 / y)) / x;
	double t_1 = Math.pow((x / (y + x)), x) / x;
	double tmp;
	if (y < -3.7311844206647956e+94) {
		tmp = t_0;
	} else if (y < 2.817959242728288e+37) {
		tmp = t_1;
	} else if (y < 2.347387415166998e+178) {
		tmp = Math.log(Math.exp(t_1));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = math.exp((-1.0 / y)) / x
	t_1 = math.pow((x / (y + x)), x) / x
	tmp = 0
	if y < -3.7311844206647956e+94:
		tmp = t_0
	elif y < 2.817959242728288e+37:
		tmp = t_1
	elif y < 2.347387415166998e+178:
		tmp = math.log(math.exp(t_1))
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y)
	t_0 = Float64(exp(Float64(-1.0 / y)) / x)
	t_1 = Float64((Float64(x / Float64(y + x)) ^ x) / x)
	tmp = 0.0
	if (y < -3.7311844206647956e+94)
		tmp = t_0;
	elseif (y < 2.817959242728288e+37)
		tmp = t_1;
	elseif (y < 2.347387415166998e+178)
		tmp = log(exp(t_1));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = exp((-1.0 / y)) / x;
	t_1 = ((x / (y + x)) ^ x) / x;
	tmp = 0.0;
	if (y < -3.7311844206647956e+94)
		tmp = t_0;
	elseif (y < 2.817959242728288e+37)
		tmp = t_1;
	elseif (y < 2.347387415166998e+178)
		tmp = log(exp(t_1));
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[Exp[N[(-1.0 / y), $MachinePrecision]], $MachinePrecision] / x), $MachinePrecision]}, Block[{t$95$1 = N[(N[Power[N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision], x], $MachinePrecision] / x), $MachinePrecision]}, If[Less[y, -3.7311844206647956e+94], t$95$0, If[Less[y, 2.817959242728288e+37], t$95$1, If[Less[y, 2.347387415166998e+178], N[Log[N[Exp[t$95$1], $MachinePrecision]], $MachinePrecision], t$95$0]]]]]

Reproduce

herbie shell --seed 2024320 
(FPCore (x y)
  :name "Numeric.SpecFunctions:invIncompleteBetaWorker from math-functions-0.1.5.2, F"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< y -37311844206647956000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ (exp (/ -1 y)) x) (if (< y 28179592427282880000000000000000000000) (/ (pow (/ x (+ y x)) x) x) (if (< y 23473874151669980000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (log (exp (/ (pow (/ x (+ y x)) x) x))) (/ (exp (/ -1 y)) x)))))

  (/ (exp (* x (log (/ x (+ x y))))) x))