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

Percentage Accurate: 78.5% → 98.8%

Time: 9.1s

Alternatives: 8

Speedup: 7.7×

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: 78.5% 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: 98.8% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{e^{-y}}{x}\\ \mathbf{if}\;x \leq -80000000000:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq 3.3 \cdot 10^{-21}:\\ \;\;\;\;\frac{1}{x}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (/ (exp (- y)) x)))
   (if (<= x -80000000000.0) t_0 (if (<= x 3.3e-21) (/ 1.0 x) t_0))))

C

double code(double x, double y) {
	double t_0 = exp(-y) / x;
	double tmp;
	if (x <= -80000000000.0) {
		tmp = t_0;
	} else if (x <= 3.3e-21) {
		tmp = 1.0 / x;
	} 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 = exp(-y) / x
    if (x <= (-80000000000.0d0)) then
        tmp = t_0
    else if (x <= 3.3d-21) then
        tmp = 1.0d0 / x
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = Math.exp(-y) / x;
	double tmp;
	if (x <= -80000000000.0) {
		tmp = t_0;
	} else if (x <= 3.3e-21) {
		tmp = 1.0 / x;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = math.exp(-y) / x
	tmp = 0
	if x <= -80000000000.0:
		tmp = t_0
	elif x <= 3.3e-21:
		tmp = 1.0 / x
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y)
	t_0 = Float64(exp(Float64(-y)) / x)
	tmp = 0.0
	if (x <= -80000000000.0)
		tmp = t_0;
	elseif (x <= 3.3e-21)
		tmp = Float64(1.0 / x);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = exp(-y) / x;
	tmp = 0.0;
	if (x <= -80000000000.0)
		tmp = t_0;
	elseif (x <= 3.3e-21)
		tmp = 1.0 / x;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[Exp[(-y)], $MachinePrecision] / x), $MachinePrecision]}, If[LessEqual[x, -80000000000.0], t$95$0, If[LessEqual[x, 3.3e-21], N[(1.0 / x), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if x < -8e10 or 3.30000000000000009e-21 < x

   1. Initial program 78.0%

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

   3. Taylor expanded in y around 0

      \[\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 -8e10 < x < 3.30000000000000009e-21

   1. Initial program 81.7%

      \[\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}}{x} \]
   4. Step-by-step derivation

   5. Applied rewrites 99.9%

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

Alternative 2: 86.5% accurate, 4.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \mathsf{fma}\left(\mathsf{fma}\left(y, x, x\right), y, x\right)\\ \mathbf{if}\;x \leq -3.1 \cdot 10^{+211}:\\ \;\;\;\;\frac{1}{t\_0}\\ \mathbf{elif}\;x \leq -80000000000:\\ \;\;\;\;\frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.16666666666666666, y, 0.5\right), y, -1\right), y, 1\right)}{x}\\ \mathbf{elif}\;x \leq 3.3 \cdot 10^{-21}:\\ \;\;\;\;\frac{1}{x}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\mathsf{fma}\left(t\_0, y, x\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (fma (fma y x x) y x)))
   (if (<= x -3.1e+211)
     (/ 1.0 t_0)
     (if (<= x -80000000000.0)
       (/ (fma (fma (fma -0.16666666666666666 y 0.5) y -1.0) y 1.0) x)
       (if (<= x 3.3e-21) (/ 1.0 x) (/ 1.0 (fma t_0 y x)))))))

C

double code(double x, double y) {
	double t_0 = fma(fma(y, x, x), y, x);
	double tmp;
	if (x <= -3.1e+211) {
		tmp = 1.0 / t_0;
	} else if (x <= -80000000000.0) {
		tmp = fma(fma(fma(-0.16666666666666666, y, 0.5), y, -1.0), y, 1.0) / x;
	} else if (x <= 3.3e-21) {
		tmp = 1.0 / x;
	} else {
		tmp = 1.0 / fma(t_0, y, x);
	}
	return tmp;
}

Julia

function code(x, y)
	t_0 = fma(fma(y, x, x), y, x)
	tmp = 0.0
	if (x <= -3.1e+211)
		tmp = Float64(1.0 / t_0);
	elseif (x <= -80000000000.0)
		tmp = Float64(fma(fma(fma(-0.16666666666666666, y, 0.5), y, -1.0), y, 1.0) / x);
	elseif (x <= 3.3e-21)
		tmp = Float64(1.0 / x);
	else
		tmp = Float64(1.0 / fma(t_0, y, x));
	end
	return tmp
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(y * x + x), $MachinePrecision] * y + x), $MachinePrecision]}, If[LessEqual[x, -3.1e+211], N[(1.0 / t$95$0), $MachinePrecision], If[LessEqual[x, -80000000000.0], N[(N[(N[(N[(-0.16666666666666666 * y + 0.5), $MachinePrecision] * y + -1.0), $MachinePrecision] * y + 1.0), $MachinePrecision] / x), $MachinePrecision], If[LessEqual[x, 3.3e-21], N[(1.0 / x), $MachinePrecision], N[(1.0 / N[(t$95$0 * y + x), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if x < -3.1000000000000002e211

   1. Initial program 76.7%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. unsub-neg N/A

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

      4. lower--.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-/.f64 64.1

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

   5. Applied rewrites 64.1%

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

   7. Applied rewrites 64.1%

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

   8. Taylor expanded in y around 0

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

   10. Applied rewrites 93.8%

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

   if -3.1000000000000002e211 < x < -8e10

   1. Initial program 89.8%

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

   3. Taylor expanded in y around 0

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

   5. Applied rewrites 85.1%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 87.2%

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

   if -8e10 < x < 3.30000000000000009e-21

   1. Initial program 81.7%

      \[\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}}{x} \]
   4. Step-by-step derivation

   5. Applied rewrites 99.9%

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

   if 3.30000000000000009e-21 < x

   1. Initial program 71.6%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. unsub-neg N/A

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

      4. lower--.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-/.f64 58.4

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

   5. Applied rewrites 58.4%

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

   7. Applied rewrites 58.4%

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

   8. Taylor expanded in y around 0

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

   10. Applied rewrites 71.7%

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

Alternative 3: 85.9% accurate, 5.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{1}{\mathsf{fma}\left(\mathsf{fma}\left(y, x, x\right), y, x\right)}\\ \mathbf{if}\;x \leq -3.1 \cdot 10^{+211}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq -80000000000:\\ \;\;\;\;\frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.16666666666666666, y, 0.5\right), y, -1\right), y, 1\right)}{x}\\ \mathbf{elif}\;x \leq 3.3 \cdot 10^{-21}:\\ \;\;\;\;\frac{1}{x}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (/ 1.0 (fma (fma y x x) y x))))
   (if (<= x -3.1e+211)
     t_0
     (if (<= x -80000000000.0)
       (/ (fma (fma (fma -0.16666666666666666 y 0.5) y -1.0) y 1.0) x)
       (if (<= x 3.3e-21) (/ 1.0 x) t_0)))))

C

double code(double x, double y) {
	double t_0 = 1.0 / fma(fma(y, x, x), y, x);
	double tmp;
	if (x <= -3.1e+211) {
		tmp = t_0;
	} else if (x <= -80000000000.0) {
		tmp = fma(fma(fma(-0.16666666666666666, y, 0.5), y, -1.0), y, 1.0) / x;
	} else if (x <= 3.3e-21) {
		tmp = 1.0 / x;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y)
	t_0 = Float64(1.0 / fma(fma(y, x, x), y, x))
	tmp = 0.0
	if (x <= -3.1e+211)
		tmp = t_0;
	elseif (x <= -80000000000.0)
		tmp = Float64(fma(fma(fma(-0.16666666666666666, y, 0.5), y, -1.0), y, 1.0) / x);
	elseif (x <= 3.3e-21)
		tmp = Float64(1.0 / x);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(1.0 / N[(N[(y * x + x), $MachinePrecision] * y + x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -3.1e+211], t$95$0, If[LessEqual[x, -80000000000.0], N[(N[(N[(N[(-0.16666666666666666 * y + 0.5), $MachinePrecision] * y + -1.0), $MachinePrecision] * y + 1.0), $MachinePrecision] / x), $MachinePrecision], If[LessEqual[x, 3.3e-21], N[(1.0 / x), $MachinePrecision], t$95$0]]]]

Derivation

1. Split input into 3 regimes

2. if x < -3.1000000000000002e211 or 3.30000000000000009e-21 < x

   1. Initial program 72.4%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. unsub-neg N/A

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

      4. lower--.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-/.f64 59.3

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

   5. Applied rewrites 59.3%

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

   7. Applied rewrites 59.4%

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

   8. Taylor expanded in y around 0

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

   10. Applied rewrites 74.5%

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

   if -3.1000000000000002e211 < x < -8e10

   1. Initial program 89.8%

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

   3. Taylor expanded in y around 0

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

   5. Applied rewrites 85.1%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 87.2%

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

   if -8e10 < x < 3.30000000000000009e-21

   1. Initial program 81.7%

      \[\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}}{x} \]
   4. Step-by-step derivation

   5. Applied rewrites 99.9%

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

Alternative 4: 85.9% accurate, 5.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{1}{\mathsf{fma}\left(\mathsf{fma}\left(y, x, x\right), y, x\right)}\\ \mathbf{if}\;x \leq -3.1 \cdot 10^{+211}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq -80000000000:\\ \;\;\;\;\frac{\mathsf{fma}\left(\mathsf{fma}\left(-0.16666666666666666 \cdot y, y, -1\right), y, 1\right)}{x}\\ \mathbf{elif}\;x \leq 3.3 \cdot 10^{-21}:\\ \;\;\;\;\frac{1}{x}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (/ 1.0 (fma (fma y x x) y x))))
   (if (<= x -3.1e+211)
     t_0
     (if (<= x -80000000000.0)
       (/ (fma (fma (* -0.16666666666666666 y) y -1.0) y 1.0) x)
       (if (<= x 3.3e-21) (/ 1.0 x) t_0)))))

C

double code(double x, double y) {
	double t_0 = 1.0 / fma(fma(y, x, x), y, x);
	double tmp;
	if (x <= -3.1e+211) {
		tmp = t_0;
	} else if (x <= -80000000000.0) {
		tmp = fma(fma((-0.16666666666666666 * y), y, -1.0), y, 1.0) / x;
	} else if (x <= 3.3e-21) {
		tmp = 1.0 / x;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y)
	t_0 = Float64(1.0 / fma(fma(y, x, x), y, x))
	tmp = 0.0
	if (x <= -3.1e+211)
		tmp = t_0;
	elseif (x <= -80000000000.0)
		tmp = Float64(fma(fma(Float64(-0.16666666666666666 * y), y, -1.0), y, 1.0) / x);
	elseif (x <= 3.3e-21)
		tmp = Float64(1.0 / x);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(1.0 / N[(N[(y * x + x), $MachinePrecision] * y + x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -3.1e+211], t$95$0, If[LessEqual[x, -80000000000.0], N[(N[(N[(N[(-0.16666666666666666 * y), $MachinePrecision] * y + -1.0), $MachinePrecision] * y + 1.0), $MachinePrecision] / x), $MachinePrecision], If[LessEqual[x, 3.3e-21], N[(1.0 / x), $MachinePrecision], t$95$0]]]]

Derivation

1. Split input into 3 regimes

2. if x < -3.1000000000000002e211 or 3.30000000000000009e-21 < x

   1. Initial program 72.4%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. unsub-neg N/A

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

      4. lower--.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-/.f64 59.3

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

   5. Applied rewrites 59.3%

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

   7. Applied rewrites 59.4%

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

   8. Taylor expanded in y around 0

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

   10. Applied rewrites 74.5%

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

   if -3.1000000000000002e211 < x < -8e10

   1. Initial program 89.8%

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

   3. Taylor expanded in y around 0

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

   5. Applied rewrites 85.1%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 87.2%

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

   9. Taylor expanded in y around inf

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

   11. Applied rewrites 86.9%

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

   if -8e10 < x < 3.30000000000000009e-21

   1. Initial program 81.7%

      \[\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}}{x} \]
   4. Step-by-step derivation

   5. Applied rewrites 99.9%

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

Alternative 5: 85.1% accurate, 5.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{1}{\mathsf{fma}\left(\mathsf{fma}\left(y, x, x\right), y, x\right)}\\ \mathbf{if}\;x \leq -1.9 \cdot 10^{+211}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq -80000000000:\\ \;\;\;\;\frac{\mathsf{fma}\left(\mathsf{fma}\left(0.5, y, -1\right), y, 1\right)}{x}\\ \mathbf{elif}\;x \leq 3.3 \cdot 10^{-21}:\\ \;\;\;\;\frac{1}{x}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (/ 1.0 (fma (fma y x x) y x))))
   (if (<= x -1.9e+211)
     t_0
     (if (<= x -80000000000.0)
       (/ (fma (fma 0.5 y -1.0) y 1.0) x)
       (if (<= x 3.3e-21) (/ 1.0 x) t_0)))))

C

double code(double x, double y) {
	double t_0 = 1.0 / fma(fma(y, x, x), y, x);
	double tmp;
	if (x <= -1.9e+211) {
		tmp = t_0;
	} else if (x <= -80000000000.0) {
		tmp = fma(fma(0.5, y, -1.0), y, 1.0) / x;
	} else if (x <= 3.3e-21) {
		tmp = 1.0 / x;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y)
	t_0 = Float64(1.0 / fma(fma(y, x, x), y, x))
	tmp = 0.0
	if (x <= -1.9e+211)
		tmp = t_0;
	elseif (x <= -80000000000.0)
		tmp = Float64(fma(fma(0.5, y, -1.0), y, 1.0) / x);
	elseif (x <= 3.3e-21)
		tmp = Float64(1.0 / x);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(1.0 / N[(N[(y * x + x), $MachinePrecision] * y + x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -1.9e+211], t$95$0, If[LessEqual[x, -80000000000.0], N[(N[(N[(0.5 * y + -1.0), $MachinePrecision] * y + 1.0), $MachinePrecision] / x), $MachinePrecision], If[LessEqual[x, 3.3e-21], N[(1.0 / x), $MachinePrecision], t$95$0]]]]

Derivation

1. Split input into 3 regimes

2. if x < -1.90000000000000008e211 or 3.30000000000000009e-21 < x

   1. Initial program 72.4%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. unsub-neg N/A

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

      4. lower--.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-/.f64 59.3

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

   5. Applied rewrites 59.3%

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

   7. Applied rewrites 59.4%

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

   8. Taylor expanded in y around 0

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

   10. Applied rewrites 74.5%

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

   if -1.90000000000000008e211 < x < -8e10

   1. Initial program 89.8%

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

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

   5. Applied rewrites 80.8%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 85.0%

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

   if -8e10 < x < 3.30000000000000009e-21

   1. Initial program 81.7%

      \[\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}}{x} \]
   4. Step-by-step derivation

   5. Applied rewrites 99.9%

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

Alternative 6: 82.6% accurate, 7.7× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -80000000000.0)
   (/ (fma (fma 0.5 y -1.0) y 1.0) x)
   (if (<= x 3.3e-21) (/ 1.0 x) (/ 1.0 (fma y x x)))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -80000000000.0) {
		tmp = fma(fma(0.5, y, -1.0), y, 1.0) / x;
	} else if (x <= 3.3e-21) {
		tmp = 1.0 / x;
	} else {
		tmp = 1.0 / fma(y, x, x);
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -80000000000.0)
		tmp = Float64(fma(fma(0.5, y, -1.0), y, 1.0) / x);
	elseif (x <= 3.3e-21)
		tmp = Float64(1.0 / x);
	else
		tmp = Float64(1.0 / fma(y, x, x));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if x < -8e10

   1. Initial program 86.3%

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

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

   5. Applied rewrites 76.3%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 79.4%

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

   if -8e10 < x < 3.30000000000000009e-21

   1. Initial program 81.7%

      \[\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}}{x} \]
   4. Step-by-step derivation

   5. Applied rewrites 99.9%

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

   if 3.30000000000000009e-21 < x

   1. Initial program 71.6%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. unsub-neg N/A

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

      4. lower--.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-/.f64 58.4

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

   5. Applied rewrites 58.4%

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

   7. Applied rewrites 58.4%

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

   8. Taylor expanded in y around 0

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

   10. Applied rewrites 65.9%

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

Alternative 7: 80.5% accurate, 7.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{1}{\mathsf{fma}\left(y, x, x\right)}\\ \mathbf{if}\;x \leq -3 \cdot 10^{+17}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq 3.3 \cdot 10^{-21}:\\ \;\;\;\;\frac{1}{x}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (/ 1.0 (fma y x x))))
   (if (<= x -3e+17) t_0 (if (<= x 3.3e-21) (/ 1.0 x) t_0))))

C

double code(double x, double y) {
	double t_0 = 1.0 / fma(y, x, x);
	double tmp;
	if (x <= -3e+17) {
		tmp = t_0;
	} else if (x <= 3.3e-21) {
		tmp = 1.0 / x;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y)
	t_0 = Float64(1.0 / fma(y, x, x))
	tmp = 0.0
	if (x <= -3e+17)
		tmp = t_0;
	elseif (x <= 3.3e-21)
		tmp = Float64(1.0 / x);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -3e17 or 3.30000000000000009e-21 < x

   1. Initial program 78.0%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. unsub-neg N/A

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

      4. lower--.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-/.f64 64.0

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

   5. Applied rewrites 64.0%

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

   7. Applied rewrites 64.0%

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

   8. Taylor expanded in y around 0

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

   10. Applied rewrites 70.9%

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

   if -3e17 < x < 3.30000000000000009e-21

   1. Initial program 81.7%

      \[\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}}{x} \]
   4. Step-by-step derivation

   5. Applied rewrites 99.9%

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

Alternative 8: 74.4% 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 79.7%

   \[\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}}{x} \]
4. Step-by-step derivation

5. Applied rewrites 79.5%

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

Developer Target 1: 77.6% 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 2024268 
(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))