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

Percentage Accurate: 85.0% → 98.7%

Time: 8.1s

Alternatives: 4

Speedup: 8.7×

• could not determine a ground truth

  1. x = -1.2224144164201078e+56
  2. y = -1.1213097239543224e+40
  3. z = -3.179247340049393e-38

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: 85.0% 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: 98.7% accurate, 1.8× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (+ (/ (exp (- z)) y) x)))
   (if (<= y -3.8e+21) t_0 (if (<= y 2e-42) (+ (/ 1.0 y) x) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = (exp(-z) / y) + x;
	double tmp;
	if (y <= -3.8e+21) {
		tmp = t_0;
	} else if (y <= 2e-42) {
		tmp = (1.0 / y) + x;
	} else {
		tmp = t_0;
	}
	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) :: t_0
    real(8) :: tmp
    t_0 = (exp(-z) / y) + x
    if (y <= (-3.8d+21)) then
        tmp = t_0
    else if (y <= 2d-42) then
        tmp = (1.0d0 / y) + x
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = (Math.exp(-z) / y) + x;
	double tmp;
	if (y <= -3.8e+21) {
		tmp = t_0;
	} else if (y <= 2e-42) {
		tmp = (1.0 / y) + x;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = (math.exp(-z) / y) + x
	tmp = 0
	if y <= -3.8e+21:
		tmp = t_0
	elif y <= 2e-42:
		tmp = (1.0 / y) + x
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(exp(Float64(-z)) / y) + x)
	tmp = 0.0
	if (y <= -3.8e+21)
		tmp = t_0;
	elseif (y <= 2e-42)
		tmp = Float64(Float64(1.0 / y) + x);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (exp(-z) / y) + x;
	tmp = 0.0;
	if (y <= -3.8e+21)
		tmp = t_0;
	elseif (y <= 2e-42)
		tmp = (1.0 / y) + x;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(N[Exp[(-z)], $MachinePrecision] / y), $MachinePrecision] + x), $MachinePrecision]}, If[LessEqual[y, -3.8e+21], t$95$0, If[LessEqual[y, 2e-42], N[(N[(1.0 / y), $MachinePrecision] + x), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -3.8e21 or 2.00000000000000008e-42 < y

   1. Initial program 89.6%

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

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

   5. Applied rewrites 99.9%

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

   if -3.8e21 < y < 2.00000000000000008e-42

   1. Initial program 85.3%

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

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

4. Final simplification 99.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -3.8 \cdot 10^{+21}:\\ \;\;\;\;\frac{e^{-z}}{y} + x\\ \mathbf{elif}\;y \leq 2 \cdot 10^{-42}:\\ \;\;\;\;\frac{1}{y} + x\\ \mathbf{else}:\\ \;\;\;\;\frac{e^{-z}}{y} + x\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 85.7% accurate, 8.7× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y 2e-42) (+ (/ 1.0 y) x) (+ (/ 1.0 (fma z y y)) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= 2e-42) {
		tmp = (1.0 / y) + x;
	} else {
		tmp = (1.0 / fma(z, y, y)) + x;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 2.00000000000000008e-42

   1. Initial program 86.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 88.3%

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

   if 2.00000000000000008e-42 < y

   1. Initial program 90.7%

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

         \[\leadsto x + \frac{\mathsf{fma}\left(\color{blue}{z \cdot \left(\frac{1}{2} + \frac{1}{2} \cdot \frac{1}{y}\right) + \left(\mathsf{neg}\left(1\right)\right)}, 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} + \left(\mathsf{neg}\left(1\right)\right), z, 1\right)}{y} \]

      6. metadata-eval N/A

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

      7. lower-fma.f64 N/A

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

      8. +-commutative N/A

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

      9. lower-+.f64 N/A

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

      10. associate-*r/ N/A

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

      11. metadata-eval N/A

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

      12. lower-/.f64 74.4

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

   5. Applied rewrites 74.4%

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

      1. lift-/.f64 N/A

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

      2. clear-num N/A

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

      3. lower-/.f64 N/A

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

      4. lower-/.f64 74.4

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

   7. Applied rewrites 74.4%

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

   8. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 91.2

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

   10. Applied rewrites 91.2%

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

4. Final simplification 89.2%

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

Alternative 3: 84.8% accurate, 15.6× speedup

Math

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

FPCore

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

C

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

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) + x
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 88.0%

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

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

6. Final simplification 86.4%

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

Alternative 4: 39.7% 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 88.0%

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

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

5. Applied rewrites 38.0%

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

Developer Target 1: 91.5% 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 2024332 
(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)))