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

Percentage Accurate: 84.7% → 99.1%

Time: 13.3s

Alternatives: 7

Speedup: 13.2×

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.7% 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.1% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -5e+26) (not (<= y 4.4e-58)))
   (+ x (/ (exp (- z)) y))
   (+ x (/ (pow (exp y) (log (/ y (+ y z)))) y))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -5e+26) || !(y <= 4.4e-58)) {
		tmp = x + (exp(-z) / y);
	} else {
		tmp = x + (pow(exp(y), log((y / (y + z)))) / 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 <= (-5d+26)) .or. (.not. (y <= 4.4d-58))) then
        tmp = x + (exp(-z) / y)
    else
        tmp = x + ((exp(y) ** log((y / (y + z)))) / y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -5e+26) || !(y <= 4.4e-58)) {
		tmp = x + (Math.exp(-z) / y);
	} else {
		tmp = x + (Math.pow(Math.exp(y), Math.log((y / (y + z)))) / y);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -5e+26) or not (y <= 4.4e-58):
		tmp = x + (math.exp(-z) / y)
	else:
		tmp = x + (math.pow(math.exp(y), math.log((y / (y + z)))) / y)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -5e+26) || !(y <= 4.4e-58))
		tmp = Float64(x + Float64(exp(Float64(-z)) / y));
	else
		tmp = Float64(x + Float64((exp(y) ^ log(Float64(y / Float64(y + z)))) / y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -5e+26) || ~((y <= 4.4e-58)))
		tmp = x + (exp(-z) / y);
	else
		tmp = x + ((exp(y) ^ log((y / (y + z)))) / y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -5e+26], N[Not[LessEqual[y, 4.4e-58]], $MachinePrecision]], N[(x + N[(N[Exp[(-z)], $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], N[(x + N[(N[Power[N[Exp[y], $MachinePrecision], N[Log[N[(y / N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -5.0000000000000001e26 or 4.40000000000000011e-58 < y

   1. Initial program 91.2%

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

      1. *-commutative 91.2%

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

      2. exp-to-pow 91.2%

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

      3. +-commutative 91.2%

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

   3. Simplified 91.2%

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

   5. Taylor expanded in y around inf 100.0%

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

      1. mul-1-neg 100.0%

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

   7. Simplified 100.0%

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

   if -5.0000000000000001e26 < y < 4.40000000000000011e-58

   1. Initial program 89.2%

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

      1. exp-prod 99.9%

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

      2. +-commutative 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{x + \frac{{\left(e^{y}\right)}^{\log \left(\frac{y}{y + z}\right)}}{y}} \]
   4. Add Preprocessing
3. Recombined 2 regimes into one program.

4. Final simplification 99.9%

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

Alternative 2: 88.5% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.9 \cdot 10^{+154}:\\ \;\;\;\;\frac{1 + z \cdot \left(z \cdot 0.5 + -1\right)}{y}\\ \mathbf{elif}\;z \leq -3.05 \cdot 10^{+128} \lor \neg \left(z \leq -450\right):\\ \;\;\;\;x + \frac{1}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{e^{-z}}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -1.9e+154)
   (/ (+ 1.0 (* z (+ (* z 0.5) -1.0))) y)
   (if (or (<= z -3.05e+128) (not (<= z -450.0)))
     (+ x (/ 1.0 y))
     (/ (exp (- z)) y))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -1.9e+154) {
		tmp = (1.0 + (z * ((z * 0.5) + -1.0))) / y;
	} else if ((z <= -3.05e+128) || !(z <= -450.0)) {
		tmp = x + (1.0 / y);
	} else {
		tmp = exp(-z) / 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 (z <= (-1.9d+154)) then
        tmp = (1.0d0 + (z * ((z * 0.5d0) + (-1.0d0)))) / y
    else if ((z <= (-3.05d+128)) .or. (.not. (z <= (-450.0d0)))) then
        tmp = x + (1.0d0 / y)
    else
        tmp = exp(-z) / y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z <= -1.9e+154) {
		tmp = (1.0 + (z * ((z * 0.5) + -1.0))) / y;
	} else if ((z <= -3.05e+128) || !(z <= -450.0)) {
		tmp = x + (1.0 / y);
	} else {
		tmp = Math.exp(-z) / y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -1.9e+154:
		tmp = (1.0 + (z * ((z * 0.5) + -1.0))) / y
	elif (z <= -3.05e+128) or not (z <= -450.0):
		tmp = x + (1.0 / y)
	else:
		tmp = math.exp(-z) / y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -1.9e+154)
		tmp = Float64(Float64(1.0 + Float64(z * Float64(Float64(z * 0.5) + -1.0))) / y);
	elseif ((z <= -3.05e+128) || !(z <= -450.0))
		tmp = Float64(x + Float64(1.0 / y));
	else
		tmp = Float64(exp(Float64(-z)) / y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -1.9e+154)
		tmp = (1.0 + (z * ((z * 0.5) + -1.0))) / y;
	elseif ((z <= -3.05e+128) || ~((z <= -450.0)))
		tmp = x + (1.0 / y);
	else
		tmp = exp(-z) / y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -1.9e+154], N[(N[(1.0 + N[(z * N[(N[(z * 0.5), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision], If[Or[LessEqual[z, -3.05e+128], N[Not[LessEqual[z, -450.0]], $MachinePrecision]], N[(x + N[(1.0 / y), $MachinePrecision]), $MachinePrecision], N[(N[Exp[(-z)], $MachinePrecision] / y), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -1.8999999999999999e154

   1. Initial program 80.2%

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

      1. exp-prod 92.9%

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

      2. +-commutative 92.9%

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

   3. Simplified 92.9%

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

   5. Taylor expanded in z around 0 71.5%

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

   6. Taylor expanded in y around inf 73.6%

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

      1. *-commutative 73.6%

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

   8. Simplified 73.6%

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

   9. Taylor expanded in x around 0 73.6%

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

   10. Taylor expanded in y around 0 73.6%

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

   if -1.8999999999999999e154 < z < -3.0500000000000001e128 or -450 < z

   1. Initial program 95.5%

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

      1. exp-prod 99.0%

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

      2. +-commutative 99.0%

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

   3. Simplified 99.0%

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

   5. Taylor expanded in y around inf 97.4%

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

      1. +-commutative 97.4%

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

   7. Simplified 97.4%

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

   if -3.0500000000000001e128 < z < -450

   1. Initial program 56.3%

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

      1. *-commutative 56.3%

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

      2. exp-to-pow 56.3%

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

      3. +-commutative 56.3%

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

   3. Simplified 56.3%

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

   5. Taylor expanded in y around inf 64.9%

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

      1. mul-1-neg 64.9%

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

   7. Simplified 64.9%

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

   8. Taylor expanded in x around 0 64.9%

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

4. Final simplification 92.7%

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

Alternative 3: 98.8% accurate, 1.8× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -150000.0) (not (<= y 4.4e-58)))
   (+ x (/ (exp (- z)) y))
   (/ (+ 1.0 (* y x)) y)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -150000.0) || !(y <= 4.4e-58)) {
		tmp = x + (exp(-z) / y);
	} else {
		tmp = (1.0 + (y * x)) / 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 <= (-150000.0d0)) .or. (.not. (y <= 4.4d-58))) then
        tmp = x + (exp(-z) / y)
    else
        tmp = (1.0d0 + (y * x)) / y
    end if
    code = tmp
end function

Java

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

Python

def code(x, y, z):
	tmp = 0
	if (y <= -150000.0) or not (y <= 4.4e-58):
		tmp = x + (math.exp(-z) / y)
	else:
		tmp = (1.0 + (y * x)) / y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -150000.0) || !(y <= 4.4e-58))
		tmp = Float64(x + Float64(exp(Float64(-z)) / y));
	else
		tmp = Float64(Float64(1.0 + Float64(y * x)) / y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -150000.0) || ~((y <= 4.4e-58)))
		tmp = x + (exp(-z) / y);
	else
		tmp = (1.0 + (y * x)) / y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -150000.0], N[Not[LessEqual[y, 4.4e-58]], $MachinePrecision]], N[(x + N[(N[Exp[(-z)], $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + N[(y * x), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1.5e5 or 4.40000000000000011e-58 < y

   1. Initial program 91.4%

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

      1. *-commutative 91.4%

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

      2. exp-to-pow 91.4%

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

      3. +-commutative 91.4%

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

   3. Simplified 91.4%

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

   5. Taylor expanded in y around inf 100.0%

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

      1. mul-1-neg 100.0%

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

   7. Simplified 100.0%

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

   if -1.5e5 < y < 4.40000000000000011e-58

   1. Initial program 88.8%

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

      1. exp-prod 99.9%

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

      2. +-commutative 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in y around inf 99.2%

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

      1. +-commutative 99.2%

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

   7. Simplified 99.2%

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

   8. Taylor expanded in y around 0 99.2%

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

      1. *-commutative 99.2%

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

   10. Simplified 99.2%

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

4. Final simplification 99.7%

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

Alternative 4: 86.3% accurate, 13.2× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -1.9e+154) (/ (+ 1.0 (* z (+ (* z 0.5) -1.0))) y) (+ x (/ 1.0 y))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -1.9e+154) {
		tmp = (1.0 + (z * ((z * 0.5) + -1.0))) / 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 (z <= (-1.9d+154)) then
        tmp = (1.0d0 + (z * ((z * 0.5d0) + (-1.0d0)))) / 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 (z <= -1.9e+154) {
		tmp = (1.0 + (z * ((z * 0.5) + -1.0))) / y;
	} else {
		tmp = x + (1.0 / y);
	}
	return tmp;
}

Python

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

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -1.9e+154)
		tmp = Float64(Float64(1.0 + Float64(z * Float64(Float64(z * 0.5) + -1.0))) / 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 (z <= -1.9e+154)
		tmp = (1.0 + (z * ((z * 0.5) + -1.0))) / y;
	else
		tmp = x + (1.0 / y);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -1.8999999999999999e154

   1. Initial program 80.2%

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

      1. exp-prod 92.9%

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

      2. +-commutative 92.9%

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

   3. Simplified 92.9%

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

   5. Taylor expanded in z around 0 71.5%

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

   6. Taylor expanded in y around inf 73.6%

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

      1. *-commutative 73.6%

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

   8. Simplified 73.6%

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

   9. Taylor expanded in x around 0 73.6%

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

   10. Taylor expanded in y around 0 73.6%

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

   if -1.8999999999999999e154 < z

   1. Initial program 91.1%

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

      1. exp-prod 94.2%

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

      2. +-commutative 94.2%

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

   3. Simplified 94.2%

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

   5. Taylor expanded in y around inf 90.6%

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

      1. +-commutative 90.6%

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

   7. Simplified 90.6%

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

4. Final simplification 89.7%

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

Alternative 5: 67.2% accurate, 16.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -4.1 \cdot 10^{-26}:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 3.7 \cdot 10^{-38}:\\ \;\;\;\;\frac{1}{y}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -4.1e-26) x (if (<= y 3.7e-38) (/ 1.0 y) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -4.1e-26) {
		tmp = x;
	} else if (y <= 3.7e-38) {
		tmp = 1.0 / y;
	} else {
		tmp = x;
	}
	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 <= (-4.1d-26)) then
        tmp = x
    else if (y <= 3.7d-38) then
        tmp = 1.0d0 / y
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (y <= -4.1e-26) {
		tmp = x;
	} else if (y <= 3.7e-38) {
		tmp = 1.0 / y;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if y <= -4.1e-26:
		tmp = x
	elif y <= 3.7e-38:
		tmp = 1.0 / y
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -4.1e-26)
		tmp = x;
	elseif (y <= 3.7e-38)
		tmp = Float64(1.0 / y);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= -4.1e-26)
		tmp = x;
	elseif (y <= 3.7e-38)
		tmp = 1.0 / y;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -4.1e-26], x, If[LessEqual[y, 3.7e-38], N[(1.0 / y), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if y < -4.0999999999999999e-26 or 3.7e-38 < y

   1. Initial program 91.4%

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

      1. exp-prod 91.4%

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

      2. +-commutative 91.4%

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

   3. Simplified 91.4%

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

   5. Taylor expanded in x around inf 70.0%

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

   if -4.0999999999999999e-26 < y < 3.7e-38

   1. Initial program 88.7%

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

      1. exp-prod 100.0%

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

      2. +-commutative 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in y around 0 81.4%

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

4. Final simplification 73.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -4.1 \cdot 10^{-26}:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 3.7 \cdot 10^{-38}:\\ \;\;\;\;\frac{1}{y}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 84.4% accurate, 42.2× 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 90.5%

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

   1. exp-prod 94.1%

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

   2. +-commutative 94.1%

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

3. Simplified 94.1%

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

5. Taylor expanded in y around inf 87.2%

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

   1. +-commutative 87.2%

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

7. Simplified 87.2%

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

8. Final simplification 87.2%

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

Alternative 7: 48.7% accurate, 211.0× speedup

Math

\[\begin{array}{l} \\ x \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 x)

C

double code(double x, double y, double z) {
	return 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 = x
end function

Java

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

Python

def code(x, y, z):
	return x

Julia

function code(x, y, z)
	return x
end

MATLAB

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

Wolfram

code[x_, y_, z_] := x

Derivation

1. Initial program 90.5%

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

   1. exp-prod 94.1%

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

   2. +-commutative 94.1%

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

3. Simplified 94.1%

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

5. Taylor expanded in x around inf 54.0%

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

6. Final simplification 54.0%

   \[\leadsto x \]
7. Add Preprocessing

Developer target: 91.2% 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 2024055 
(FPCore (x y z)
  :name "Numeric.SpecFunctions:invIncompleteBetaWorker from math-functions-0.1.5.2, G"
  :precision binary64

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

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