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

Percentage Accurate: 85.2% → 99.0%

Time: 8.7s

Alternatives: 5

Speedup: 1.9×

• could not determine a ground truth

  1. x = 6.156232617208215e-100
  2. y = 6.780212880655567e+39
  3. z = -2.1338092008112254e-24

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.2% 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.0% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{e^{-z}}{y} + x\\ \mathbf{if}\;y \leq -1.22 \cdot 10^{+30}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 2.3 \cdot 10^{-9}:\\ \;\;\;\;\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 -1.22e+30) t_0 (if (<= y 2.3e-9) (+ (/ 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 <= -1.22e+30) {
		tmp = t_0;
	} else if (y <= 2.3e-9) {
		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 <= (-1.22d+30)) then
        tmp = t_0
    else if (y <= 2.3d-9) 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 <= -1.22e+30) {
		tmp = t_0;
	} else if (y <= 2.3e-9) {
		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 <= -1.22e+30:
		tmp = t_0
	elif y <= 2.3e-9:
		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 <= -1.22e+30)
		tmp = t_0;
	elseif (y <= 2.3e-9)
		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 <= -1.22e+30)
		tmp = t_0;
	elseif (y <= 2.3e-9)
		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, -1.22e+30], t$95$0, If[LessEqual[y, 2.3e-9], N[(N[(1.0 / y), $MachinePrecision] + x), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -1.22e30 or 2.2999999999999999e-9 < y

   1. Initial program 85.0%

      \[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{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 -1.22e30 < y < 2.2999999999999999e-9

   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 z around 0

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

   5. Applied rewrites 98.7%

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

4. Final simplification 99.4%

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

Alternative 2: 87.3% accurate, 1.9× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (+ (/ 1.0 y) x)))
   (if (<= z -5.8e+138) t_0 (if (<= z -1600000.0) (/ (exp (- z)) y) t_0))))

C

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

Java

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

Python

def code(x, y, z):
	t_0 = (1.0 / y) + x
	tmp = 0
	if z <= -5.8e+138:
		tmp = t_0
	elif z <= -1600000.0:
		tmp = math.exp(-z) / y
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(1.0 / y) + x)
	tmp = 0.0
	if (z <= -5.8e+138)
		tmp = t_0;
	elseif (z <= -1600000.0)
		tmp = Float64(exp(Float64(-z)) / y);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (1.0 / y) + x;
	tmp = 0.0;
	if (z <= -5.8e+138)
		tmp = t_0;
	elseif (z <= -1600000.0)
		tmp = exp(-z) / y;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -5.80000000000000019e138 or -1.6e6 < z

   1. Initial program 90.8%

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

   5. Applied rewrites 93.4%

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

   if -5.80000000000000019e138 < z < -1.6e6

   1. Initial program 36.5%

      \[x + \frac{e^{y \cdot \log \left(\frac{y}{z + y}\right)}}{y} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lower-+.f64 36.5

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

      4. lift-exp.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lift-log.f64 N/A

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

      8. exp-to-pow N/A

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

      9. lower-pow.f64 36.5

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

   4. Applied rewrites 36.5%

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

   5. Taylor expanded in x around 0

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

      1. lower-/.f64 N/A

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

      2. lower-pow.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-+.f64 33.0

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

   7. Applied rewrites 33.0%

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

   8. Taylor expanded in y around inf

      \[\leadsto \frac{e^{-1 \cdot z}}{y} \]
   9. Step-by-step derivation

   10. Applied rewrites 81.7%

       \[\leadsto \frac{e^{-z}}{y} \]
3. Recombined 2 regimes into one program.

4. Final simplification 92.2%

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

Alternative 3: 84.6% accurate, 3.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 1.71999999999999992e196

   1. Initial program 86.2%

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

   5. Applied rewrites 87.1%

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

   if 1.71999999999999992e196 < y

   1. Initial program 77.5%

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

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

      \[\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. 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 96.2%

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

4. Final simplification 88.1%

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

Alternative 4: 85.1% 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 85.3%

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

5. Applied rewrites 86.1%

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

6. Final simplification 86.1%

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

Alternative 5: 39.3% 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 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 \color{blue}{\frac{1}{y}} \]
4. Step-by-step derivation

   1. lower-/.f64 41.5

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

5. Applied rewrites 41.5%

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

Developer Target 1: 91.7% 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 2024254 
(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)))