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

Percentage Accurate: 84.3% → 99.6%

Time: 9.1s

Alternatives: 8

Speedup: 6.7×

• could not determine a ground truth

  1. x = -1.7468869136853145e+107
  2. y = 6.814777842626347e+36
  3. z = -9.656446956965463e-146

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 84.3% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.6% accurate, 1.8× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -15.0) (not (<= y 5e-21)))
   (+ x (/ (exp (- z)) y))
   (+ x (/ 1.0 y))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -15.0) || !(y <= 5e-21)) {
		tmp = x + (exp(-z) / y);
	} else {
		tmp = x + (1.0 / y);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((y <= (-15.0d0)) .or. (.not. (y <= 5d-21))) then
        tmp = x + (exp(-z) / y)
    else
        tmp = x + (1.0d0 / y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -15.0) || !(y <= 5e-21)) {
		tmp = x + (Math.exp(-z) / y);
	} else {
		tmp = x + (1.0 / y);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -15.0) or not (y <= 5e-21):
		tmp = x + (math.exp(-z) / y)
	else:
		tmp = x + (1.0 / y)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -15.0) || !(y <= 5e-21))
		tmp = Float64(x + Float64(exp(Float64(-z)) / y));
	else
		tmp = Float64(x + Float64(1.0 / y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -15.0) || ~((y <= 5e-21)))
		tmp = x + (exp(-z) / y);
	else
		tmp = x + (1.0 / y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -15.0], N[Not[LessEqual[y, 5e-21]], $MachinePrecision]], N[(x + N[(N[Exp[(-z)], $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], N[(x + N[(1.0 / y), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -15 or 4.99999999999999973e-21 < y

   1. Initial program 86.0%

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

   3. Taylor expanded in y around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 100.0

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

   5. Applied rewrites 100.0%

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

   if -15 < y < 4.99999999999999973e-21

   1. Initial program 82.7%

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

   3. Taylor expanded in y around 0

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

   5. Applied rewrites 99.5%

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

4. Final simplification 99.8%

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

Alternative 2: 39.6% accurate, 2.3× speedup

Math

\[\begin{array}{l} \\ {y}^{-1} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

function code(x, y, z)
	return y ^ -1.0
end

MATLAB

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

Wolfram

code[x_, y_, z_] := N[Power[y, -1.0], $MachinePrecision]

Derivation

1. Initial program 84.6%

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

3. Taylor expanded in y around 0

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

   1. lower-/.f64 41.1

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

5. Applied rewrites 41.1%

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

6. Final simplification 41.1%

   \[\leadsto {y}^{-1} \]
7. Add Preprocessing

Alternative 3: 85.2% accurate, 4.9× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -5.6e+136)
   (+ x (/ (/ (* (fma 0.5 y 0.5) (* z z)) y) y))
   (+ x (/ 1.0 y))))

C

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

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -5.6e+136)
		tmp = Float64(x + Float64(Float64(Float64(fma(0.5, y, 0.5) * Float64(z * z)) / y) / y));
	else
		tmp = Float64(x + Float64(1.0 / y));
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -5.6e+136], N[(x + N[(N[(N[(N[(0.5 * y + 0.5), $MachinePrecision] * N[(z * z), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], N[(x + N[(1.0 / y), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -5.6000000000000004e136

   1. Initial program 80.4%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 N/A

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

      9. associate-*r/ N/A

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

      10. metadata-eval N/A

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

      11. lower-/.f64 82.9

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

   5. Applied rewrites 82.9%

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

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 75.1%

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

   9. Taylor expanded in z around inf

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

   11. Applied rewrites 90.2%

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

   if -5.6000000000000004e136 < y

   1. Initial program 85.4%

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

   3. Taylor expanded in y around 0

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

   5. Applied rewrites 89.9%

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

Alternative 4: 88.0% accurate, 5.7× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -15.0)
   (+ x (/ (fma (- (* (fma -0.16666666666666666 z 0.5) z) 1.0) z 1.0) y))
   (+ x (/ 1.0 y))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -15

   1. Initial program 86.4%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

   5. Applied rewrites 85.2%

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

   6. Taylor expanded in y around inf

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

   8. Applied rewrites 85.2%

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

   if -15 < y

   1. Initial program 83.9%

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

   3. Taylor expanded in y around 0

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

   5. Applied rewrites 91.8%

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

Alternative 5: 85.6% accurate, 5.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -6 \cdot 10^{+164}:\\ \;\;\;\;x + \frac{\frac{y - z \cdot y}{y}}{y}\\ \mathbf{else}:\\ \;\;\;\;x + \frac{1}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -6e+164) (+ x (/ (/ (- y (* z y)) y) y)) (+ x (/ 1.0 y))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -6e+164) {
		tmp = x + (((y - (z * y)) / y) / y);
	} else {
		tmp = x + (1.0 / y);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (y <= (-6d+164)) then
        tmp = x + (((y - (z * y)) / y) / y)
    else
        tmp = x + (1.0d0 / y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (y <= -6e+164) {
		tmp = x + (((y - (z * y)) / y) / y);
	} else {
		tmp = x + (1.0 / y);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if y <= -6e+164:
		tmp = x + (((y - (z * y)) / y) / y)
	else:
		tmp = x + (1.0 / y)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -6e+164)
		tmp = Float64(x + Float64(Float64(Float64(y - Float64(z * y)) / y) / y));
	else
		tmp = Float64(x + Float64(1.0 / y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= -6e+164)
		tmp = x + (((y - (z * y)) / y) / y);
	else
		tmp = x + (1.0 / y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -6e+164], N[(x + N[(N[(N[(y - N[(z * y), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], N[(x + N[(1.0 / y), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -6.00000000000000001e164

   1. Initial program 77.6%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 N/A

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

      9. associate-*r/ N/A

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

      10. metadata-eval N/A

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

      11. lower-/.f64 83.2

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

   5. Applied rewrites 83.2%

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

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 71.6%

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

   9. Taylor expanded in z around 0

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

   11. Applied rewrites 85.9%

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

   if -6.00000000000000001e164 < y

   1. Initial program 85.7%

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

   3. Taylor expanded in y around 0

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

   5. Applied rewrites 89.7%

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

Alternative 6: 87.0% accurate, 6.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -15

   1. Initial program 86.4%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 N/A

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

      9. associate-*r/ N/A

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

      10. metadata-eval N/A

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

      11. lower-/.f64 82.5

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

   5. Applied rewrites 82.5%

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

   6. Taylor expanded in y around inf

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

   8. Applied rewrites 82.5%

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

   if -15 < y

   1. Initial program 83.9%

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

   3. Taylor expanded in y around 0

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

   5. Applied rewrites 91.8%

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

Alternative 7: 84.2% accurate, 15.6× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 84.6%

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

3. Taylor expanded in y around 0

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

5. Applied rewrites 87.2%

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

Alternative 8: 2.2% accurate, 19.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 84.6%

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

3. Taylor expanded in y around 0

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

   1. lower-/.f64 41.1

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

5. Applied rewrites 41.1%

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

7. Applied rewrites 10.9%

   \[\leadsto {\left(y \cdot y\right)}^{\color{blue}{-0.5}} \]

8. Taylor expanded in y around -inf

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

10. Applied rewrites 2.2%

    \[\leadsto \frac{-1}{\color{blue}{y}} \]
11. Add Preprocessing

Developer Target 1: 91.1% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{y}{z + y} < 7.11541576 \cdot 10^{-315}:\\ \;\;\;\;x + \frac{e^{\frac{-1}{z}}}{y}\\ \mathbf{else}:\\ \;\;\;\;x + \frac{e^{\log \left({\left(\frac{y}{y + z}\right)}^{y}\right)}}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (< (/ y (+ z y)) 7.11541576e-315)
   (+ x (/ (exp (/ -1.0 z)) y))
   (+ x (/ (exp (log (pow (/ y (+ y z)) y))) y))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y / (z + y)) < 7.11541576e-315) {
		tmp = x + (exp((-1.0 / z)) / y);
	} else {
		tmp = x + (exp(log(pow((y / (y + z)), y))) / y);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((y / (z + y)) < 7.11541576d-315) then
        tmp = x + (exp(((-1.0d0) / z)) / y)
    else
        tmp = x + (exp(log(((y / (y + z)) ** y))) / y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y / (z + y)) < 7.11541576e-315) {
		tmp = x + (Math.exp((-1.0 / z)) / y);
	} else {
		tmp = x + (Math.exp(Math.log(Math.pow((y / (y + z)), y))) / y);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y / (z + y)) < 7.11541576e-315:
		tmp = x + (math.exp((-1.0 / z)) / y)
	else:
		tmp = x + (math.exp(math.log(math.pow((y / (y + z)), y))) / y)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (Float64(y / Float64(z + y)) < 7.11541576e-315)
		tmp = Float64(x + Float64(exp(Float64(-1.0 / z)) / y));
	else
		tmp = Float64(x + Float64(exp(log((Float64(y / Float64(y + z)) ^ y))) / y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y / (z + y)) < 7.11541576e-315)
		tmp = x + (exp((-1.0 / z)) / y);
	else
		tmp = x + (exp(log(((y / (y + z)) ^ y))) / y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Less[N[(y / N[(z + y), $MachinePrecision]), $MachinePrecision], 7.11541576e-315], N[(x + N[(N[Exp[N[(-1.0 / z), $MachinePrecision]], $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], N[(x + N[(N[Exp[N[Log[N[Power[N[(y / N[(y + z), $MachinePrecision]), $MachinePrecision], y], $MachinePrecision]], $MachinePrecision]], $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]]

Reproduce

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

  :alt
  (! :herbie-platform default (if (< (/ y (+ z y)) 17788539399477/2500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (+ x (/ (exp (/ -1 z)) y)) (+ x (/ (exp (log (pow (/ y (+ y z)) y))) y))))

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