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

Percentage Accurate: 85.4% → 99.5%

Time: 13.3s

Alternatives: 9

Speedup: 10.5×

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

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -5 \cdot 10^{+80} \lor \neg \left(y \leq 0.02\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+80) (not (<= y 0.02)))
   (+ 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+80) || !(y <= 0.02)) {
		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+80)) .or. (.not. (y <= 0.02d0))) 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+80) || !(y <= 0.02)) {
		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+80) or not (y <= 0.02):
		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+80) || !(y <= 0.02))
		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+80) || ~((y <= 0.02)))
		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+80], N[Not[LessEqual[y, 0.02]], $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 < -4.99999999999999961e80 or 0.0200000000000000004 < y

   1. Initial program 85.4%

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

      1. *-commutative 85.4%

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

      2. exp-to-pow 85.4%

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

      3. +-commutative 85.4%

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

   3. Simplified 85.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 -4.99999999999999961e80 < y < 0.0200000000000000004

   1. Initial program 83.4%

      \[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
3. Recombined 2 regimes into one program.

4. Final simplification 100.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -5 \cdot 10^{+80} \lor \neg \left(y \leq 0.02\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: 99.7% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -125 \lor \neg \left(y \leq 0.02\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 -125.0) (not (<= y 0.02)))
   (+ x (/ (exp (- z)) y))
   (+ x (/ 1.0 y))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -125.0) || !(y <= 0.02)) {
		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 <= (-125.0d0)) .or. (.not. (y <= 0.02d0))) 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 <= -125.0) || !(y <= 0.02)) {
		tmp = x + (Math.exp(-z) / y);
	} else {
		tmp = x + (1.0 / y);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -125.0) or not (y <= 0.02):
		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 <= -125.0) || !(y <= 0.02))
		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 <= -125.0) || ~((y <= 0.02)))
		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, -125.0], N[Not[LessEqual[y, 0.02]], $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 < -125 or 0.0200000000000000004 < y

   1. Initial program 86.9%

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

      1. *-commutative 86.9%

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

      2. exp-to-pow 86.9%

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

      3. +-commutative 86.9%

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

   3. Simplified 86.9%

      \[\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 -125 < y < 0.0200000000000000004

   1. Initial program 80.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 inf 99.9%

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

      1. +-commutative 99.9%

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

   7. Simplified 99.9%

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

4. Final simplification 100.0%

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

Alternative 3: 87.2% accurate, 8.8× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -125

   1. Initial program 84.2%

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

      1. *-commutative 84.2%

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

      2. exp-to-pow 84.2%

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

      3. +-commutative 84.2%

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

   3. Simplified 84.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} \]

   8. Taylor expanded in z around 0 83.3%

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

   9. Taylor expanded in z around inf 83.3%

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

       1. *-commutative 83.3%

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

   11. Simplified 83.3%

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

   if -125 < y

   1. Initial program 84.6%

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

      1. exp-prod 95.6%

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

      2. +-commutative 95.6%

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

   3. Simplified 95.6%

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

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

      1. +-commutative 92.8%

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

   7. Simplified 92.8%

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

4. Final simplification 89.8%

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

Alternative 4: 88.3% accurate, 8.8× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -125

   1. Initial program 84.2%

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

      1. *-commutative 84.2%

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

      2. exp-to-pow 84.2%

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

      3. +-commutative 84.2%

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

   3. Simplified 84.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} \]

   8. Taylor expanded in z around 0 83.3%

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

   9. Taylor expanded in y around 0 89.1%

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

   if -125 < y

   1. Initial program 84.6%

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

      1. exp-prod 95.6%

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

      2. +-commutative 95.6%

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

   3. Simplified 95.6%

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

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

      1. +-commutative 92.8%

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

   7. Simplified 92.8%

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

4. Final simplification 91.7%

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

Alternative 5: 86.4% accurate, 10.5× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -3.1e5

   1. Initial program 84.2%

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

      1. exp-prod 84.2%

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

      2. +-commutative 84.2%

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

   3. Simplified 84.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 69.8%

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

      1. mul-1-neg 69.8%

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

      2. unsub-neg 69.8%

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

   7. Simplified 69.8%

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

   8. Taylor expanded in x around inf 70.9%

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

      1. associate--l+ 70.9%

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

      2. *-commutative 70.9%

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

      3. associate-/r* 76.9%

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

   10. Simplified 76.9%

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

   if -3.1e5 < y

   1. Initial program 84.6%

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

      1. exp-prod 95.6%

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

      2. +-commutative 95.6%

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

   3. Simplified 95.6%

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

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

      1. +-commutative 92.8%

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

   7. Simplified 92.8%

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

4. Final simplification 87.9%

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

Alternative 6: 87.6% accurate, 10.5× speedup

Math

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

FPCore

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

C

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

Python

def code(x, y, z):
	tmp = 0
	if y <= -125.0:
		tmp = x + ((1.0 / y) + ((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 (y <= -125.0)
		tmp = Float64(x + Float64(Float64(1.0 / y) + Float64(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 (y <= -125.0)
		tmp = x + ((1.0 / y) + ((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[y, -125.0], N[(x + N[(N[(1.0 / y), $MachinePrecision] + N[(N[(z * N[(N[(z * 0.5), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x + N[(1.0 / y), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -125

   1. Initial program 84.2%

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

      1. *-commutative 84.2%

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

      2. exp-to-pow 84.2%

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

      3. +-commutative 84.2%

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

   3. Simplified 84.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} \]

   8. Taylor expanded in z around 0 83.3%

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

   9. Taylor expanded in y around 0 89.1%

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

   10. Taylor expanded in z around 0 81.9%

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

       1. *-commutative 81.9%

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

   12. Simplified 81.9%

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

   if -125 < y

   1. Initial program 84.6%

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

      1. exp-prod 95.6%

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

      2. +-commutative 95.6%

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

   3. Simplified 95.6%

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

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

      1. +-commutative 92.8%

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

   7. Simplified 92.8%

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

4. Final simplification 89.4%

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

Alternative 7: 68.2% accurate, 16.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -2.1 \cdot 10^{-31}:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 1.15 \cdot 10^{-22}:\\ \;\;\;\;\frac{1}{y}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -2.1e-31) x (if (<= y 1.15e-22) (/ 1.0 y) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -2.1e-31) {
		tmp = x;
	} else if (y <= 1.15e-22) {
		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 <= (-2.1d-31)) then
        tmp = x
    else if (y <= 1.15d-22) 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 <= -2.1e-31) {
		tmp = x;
	} else if (y <= 1.15e-22) {
		tmp = 1.0 / y;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if y <= -2.1e-31:
		tmp = x
	elif y <= 1.15e-22:
		tmp = 1.0 / y
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -2.1e-31)
		tmp = x;
	elseif (y <= 1.15e-22)
		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 <= -2.1e-31)
		tmp = x;
	elseif (y <= 1.15e-22)
		tmp = 1.0 / y;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -2.1e-31], x, If[LessEqual[y, 1.15e-22], N[(1.0 / y), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if y < -2.09999999999999991e-31 or 1.1499999999999999e-22 < y

   1. Initial program 87.7%

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

      1. exp-prod 87.7%

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

      2. +-commutative 87.7%

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

   3. Simplified 87.7%

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

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

   if -2.09999999999999991e-31 < y < 1.1499999999999999e-22

   1. Initial program 78.6%

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

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

4. Final simplification 73.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2.1 \cdot 10^{-31}:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 1.15 \cdot 10^{-22}:\\ \;\;\;\;\frac{1}{y}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 84.9% 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 84.5%

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

   1. exp-prod 92.1%

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

   2. +-commutative 92.1%

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

3. Simplified 92.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 85.5%

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

   1. +-commutative 85.5%

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

7. Simplified 85.5%

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

8. Final simplification 85.5%

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

Alternative 9: 49.3% 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 84.5%

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

   1. exp-prod 92.1%

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

   2. +-commutative 92.1%

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

3. Simplified 92.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 53.5%

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

6. Final simplification 53.5%

   \[\leadsto x \]
7. Add Preprocessing

Developer target: 92.0% 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 2024095 
(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)))