Numeric.SpecFunctions:invErfc from math-functions-0.1.5.2, A

Percentage Accurate: 95.9% → 99.9%

Time: 11.8s

Alternatives: 10

Speedup: 0.5×

Specification

Math

\[\begin{array}{l} \\ x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \end{array} \]

FPCore

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

C

double code(double x, double y, double z) {
	return x + (y / ((1.1283791670955126 * exp(z)) - (x * 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 + (y / ((1.1283791670955126d0 * exp(z)) - (x * y)))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 95.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \end{array} \]

FPCore

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

C

double code(double x, double y, double z) {
	return x + (y / ((1.1283791670955126 * exp(z)) - (x * 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 + (y / ((1.1283791670955126d0 * exp(z)) - (x * y)))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= (exp z) 0.0)
   (+ x (/ -1.0 x))
   (- x (/ y (fma x y (* (exp z) -1.1283791670955126))))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (exp.f64 z) < 0.0

   1. Initial program 90.3%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 100.0%

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

   if 0.0 < (exp.f64 z)

   1. Initial program 96.7%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]
   2. Step-by-step derivation

      1. remove-double-neg 96.7%

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

      2. distribute-frac-neg 96.7%

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

      3. unsub-neg 96.7%

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

      4. distribute-frac-neg 96.7%

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

      5. distribute-neg-frac2 96.7%

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

      6. neg-sub0 96.7%

         \[\leadsto x - \frac{y}{\color{blue}{0 - \left(1.1283791670955126 \cdot e^{z} - x \cdot y\right)}} \]

      7. associate--r- 96.7%

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

      8. neg-sub0 96.7%

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

      9. +-commutative 96.7%

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

      10. fma-define 99.9%

          \[\leadsto x - \frac{y}{\color{blue}{\mathsf{fma}\left(x, y, -1.1283791670955126 \cdot e^{z}\right)}} \]

      11. *-commutative 99.9%

          \[\leadsto x - \frac{y}{\mathsf{fma}\left(x, y, -\color{blue}{e^{z} \cdot 1.1283791670955126}\right)} \]

      12. distribute-rgt-neg-in 99.9%

          \[\leadsto x - \frac{y}{\mathsf{fma}\left(x, y, \color{blue}{e^{z} \cdot \left(-1.1283791670955126\right)}\right)} \]

      13. metadata-eval 99.9%

          \[\leadsto x - \frac{y}{\mathsf{fma}\left(x, y, e^{z} \cdot \color{blue}{-1.1283791670955126}\right)} \]

   3. Simplified 99.9%

      \[\leadsto \color{blue}{x - \frac{y}{\mathsf{fma}\left(x, y, e^{z} \cdot -1.1283791670955126\right)}} \]
   4. Add Preprocessing
3. Recombined 2 regimes into one program.

4. Final simplification 99.9%

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

Alternative 2: 98.2% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Java

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

Python

def code(x, y, z):
	t_0 = x + (y / ((math.exp(z) * 1.1283791670955126) - (x * y)))
	tmp = 0
	if t_0 <= 2e+239:
		tmp = t_0
	else:
		tmp = x + (-1.0 / x)
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(x + Float64(y / Float64(Float64(exp(z) * 1.1283791670955126) - Float64(x * y))))
	tmp = 0.0
	if (t_0 <= 2e+239)
		tmp = t_0;
	else
		tmp = Float64(x + Float64(-1.0 / x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = x + (y / ((exp(z) * 1.1283791670955126) - (x * y)));
	tmp = 0.0;
	if (t_0 <= 2e+239)
		tmp = t_0;
	else
		tmp = x + (-1.0 / x);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 x (/.f64 y (-.f64 (*.f64 #s(literal 5641895835477563/5000000000000000 binary64) (exp.f64 z)) (*.f64 x y)))) < 1.99999999999999998e239

   1. Initial program 99.1%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]
   2. Add Preprocessing

   if 1.99999999999999998e239 < (+.f64 x (/.f64 y (-.f64 (*.f64 #s(literal 5641895835477563/5000000000000000 binary64) (exp.f64 z)) (*.f64 x y))))

   1. Initial program 68.5%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 100.0%

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

4. Final simplification 99.2%

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

Alternative 3: 99.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;e^{z} \leq 5.4 \cdot 10^{-79}:\\ \;\;\;\;x + \frac{-1}{x}\\ \mathbf{elif}\;e^{z} \leq 1:\\ \;\;\;\;x - \frac{-1}{\frac{1.1283791670955126}{y} - x}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= (exp z) 5.4e-79)
   (+ x (/ -1.0 x))
   (if (<= (exp z) 1.0) (- x (/ -1.0 (- (/ 1.1283791670955126 y) x))) x)))

C

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

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (Math.exp(z) <= 5.4e-79) {
		tmp = x + (-1.0 / x);
	} else if (Math.exp(z) <= 1.0) {
		tmp = x - (-1.0 / ((1.1283791670955126 / y) - x));
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if math.exp(z) <= 5.4e-79:
		tmp = x + (-1.0 / x)
	elif math.exp(z) <= 1.0:
		tmp = x - (-1.0 / ((1.1283791670955126 / y) - x))
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (exp(z) <= 5.4e-79)
		tmp = Float64(x + Float64(-1.0 / x));
	elseif (exp(z) <= 1.0)
		tmp = Float64(x - Float64(-1.0 / Float64(Float64(1.1283791670955126 / y) - x)));
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (exp(z) <= 5.4e-79)
		tmp = x + (-1.0 / x);
	elseif (exp(z) <= 1.0)
		tmp = x - (-1.0 / ((1.1283791670955126 / y) - x));
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[N[Exp[z], $MachinePrecision], 5.4e-79], N[(x + N[(-1.0 / x), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Exp[z], $MachinePrecision], 1.0], N[(x - N[(-1.0 / N[(N[(1.1283791670955126 / y), $MachinePrecision] - x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], x]]

Derivation

1. Split input into 3 regimes

2. if (exp.f64 z) < 5.4000000000000004e-79

   1. Initial program 90.3%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 100.0%

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

   if 5.4000000000000004e-79 < (exp.f64 z) < 1

   1. Initial program 99.8%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]
   2. Step-by-step derivation

      1. remove-double-neg 99.8%

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

      2. distribute-frac-neg 99.8%

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

      3. unsub-neg 99.8%

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

      4. distribute-frac-neg 99.8%

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

      5. distribute-neg-frac2 99.8%

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

      6. neg-sub0 99.8%

         \[\leadsto x - \frac{y}{\color{blue}{0 - \left(1.1283791670955126 \cdot e^{z} - x \cdot y\right)}} \]

      7. associate--r- 99.8%

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

      8. neg-sub0 99.8%

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

      9. +-commutative 99.8%

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

      10. fma-define 99.8%

          \[\leadsto x - \frac{y}{\color{blue}{\mathsf{fma}\left(x, y, -1.1283791670955126 \cdot e^{z}\right)}} \]

      11. *-commutative 99.8%

          \[\leadsto x - \frac{y}{\mathsf{fma}\left(x, y, -\color{blue}{e^{z} \cdot 1.1283791670955126}\right)} \]

      12. distribute-rgt-neg-in 99.8%

          \[\leadsto x - \frac{y}{\mathsf{fma}\left(x, y, \color{blue}{e^{z} \cdot \left(-1.1283791670955126\right)}\right)} \]

      13. metadata-eval 99.8%

          \[\leadsto x - \frac{y}{\mathsf{fma}\left(x, y, e^{z} \cdot \color{blue}{-1.1283791670955126}\right)} \]

   3. Simplified 99.8%

      \[\leadsto \color{blue}{x - \frac{y}{\mathsf{fma}\left(x, y, e^{z} \cdot -1.1283791670955126\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around inf 99.8%

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

      1. associate-*r/ 99.8%

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

      2. *-commutative 99.8%

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

   7. Simplified 99.8%

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

   8. Taylor expanded in z around 0 99.8%

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

      1. associate-*r/ 99.8%

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

      2. metadata-eval 99.8%

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

   10. Simplified 99.8%

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

   if 1 < (exp.f64 z)

   1. Initial program 90.8%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 100.0%

      \[\leadsto \color{blue}{x} \]
3. Recombined 3 regimes into one program.

4. Final simplification 99.9%

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

Alternative 4: 99.9% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= (exp z) 4e-309)
   (+ x (/ -1.0 x))
   (- x (/ y (* y (+ x (/ (* (exp z) -1.1283791670955126) y)))))))

C

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

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (Math.exp(z) <= 4e-309) {
		tmp = x + (-1.0 / x);
	} else {
		tmp = x - (y / (y * (x + ((Math.exp(z) * -1.1283791670955126) / y))));
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if math.exp(z) <= 4e-309:
		tmp = x + (-1.0 / x)
	else:
		tmp = x - (y / (y * (x + ((math.exp(z) * -1.1283791670955126) / y))))
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (exp(z) <= 4e-309)
		tmp = x + (-1.0 / x);
	else
		tmp = x - (y / (y * (x + ((exp(z) * -1.1283791670955126) / y))));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (exp.f64 z) < 3.9999999999999977e-309

   1. Initial program 90.3%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 100.0%

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

   if 3.9999999999999977e-309 < (exp.f64 z)

   1. Initial program 96.7%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]
   2. Step-by-step derivation

      1. remove-double-neg 96.7%

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

      2. distribute-frac-neg 96.7%

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

      3. unsub-neg 96.7%

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

      4. distribute-frac-neg 96.7%

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

      5. distribute-neg-frac2 96.7%

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

      6. neg-sub0 96.7%

         \[\leadsto x - \frac{y}{\color{blue}{0 - \left(1.1283791670955126 \cdot e^{z} - x \cdot y\right)}} \]

      7. associate--r- 96.7%

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

      8. neg-sub0 96.7%

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

      9. +-commutative 96.7%

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

      10. fma-define 99.9%

          \[\leadsto x - \frac{y}{\color{blue}{\mathsf{fma}\left(x, y, -1.1283791670955126 \cdot e^{z}\right)}} \]

      11. *-commutative 99.9%

          \[\leadsto x - \frac{y}{\mathsf{fma}\left(x, y, -\color{blue}{e^{z} \cdot 1.1283791670955126}\right)} \]

      12. distribute-rgt-neg-in 99.9%

          \[\leadsto x - \frac{y}{\mathsf{fma}\left(x, y, \color{blue}{e^{z} \cdot \left(-1.1283791670955126\right)}\right)} \]

      13. metadata-eval 99.9%

          \[\leadsto x - \frac{y}{\mathsf{fma}\left(x, y, e^{z} \cdot \color{blue}{-1.1283791670955126}\right)} \]

   3. Simplified 99.9%

      \[\leadsto \color{blue}{x - \frac{y}{\mathsf{fma}\left(x, y, e^{z} \cdot -1.1283791670955126\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around inf 99.9%

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

      1. associate-*r/ 99.9%

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

      2. *-commutative 99.9%

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

   7. Simplified 99.9%

      \[\leadsto x - \frac{y}{\color{blue}{y \cdot \left(x + \frac{e^{z} \cdot -1.1283791670955126}{y}\right)}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.9%

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

Alternative 5: 71.2% accurate, 6.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -9.2 \cdot 10^{-146}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 2.05 \cdot 10^{-238}:\\ \;\;\;\;\frac{y}{1.1283791670955126}\\ \mathbf{elif}\;x \leq 6 \cdot 10^{-25}:\\ \;\;\;\;\frac{-1}{x}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -9.2e-146)
   x
   (if (<= x 2.05e-238)
     (/ y 1.1283791670955126)
     (if (<= x 6e-25) (/ -1.0 x) x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -9.2e-146) {
		tmp = x;
	} else if (x <= 2.05e-238) {
		tmp = y / 1.1283791670955126;
	} else if (x <= 6e-25) {
		tmp = -1.0 / x;
	} 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 (x <= (-9.2d-146)) then
        tmp = x
    else if (x <= 2.05d-238) then
        tmp = y / 1.1283791670955126d0
    else if (x <= 6d-25) then
        tmp = (-1.0d0) / x
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -9.2e-146) {
		tmp = x;
	} else if (x <= 2.05e-238) {
		tmp = y / 1.1283791670955126;
	} else if (x <= 6e-25) {
		tmp = -1.0 / x;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -9.2e-146:
		tmp = x
	elif x <= 2.05e-238:
		tmp = y / 1.1283791670955126
	elif x <= 6e-25:
		tmp = -1.0 / x
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -9.2e-146)
		tmp = x;
	elseif (x <= 2.05e-238)
		tmp = Float64(y / 1.1283791670955126);
	elseif (x <= 6e-25)
		tmp = Float64(-1.0 / x);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -9.2e-146)
		tmp = x;
	elseif (x <= 2.05e-238)
		tmp = y / 1.1283791670955126;
	elseif (x <= 6e-25)
		tmp = -1.0 / x;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -9.2e-146], x, If[LessEqual[x, 2.05e-238], N[(y / 1.1283791670955126), $MachinePrecision], If[LessEqual[x, 6e-25], N[(-1.0 / x), $MachinePrecision], x]]]

Derivation

1. Split input into 3 regimes

2. if x < -9.2000000000000003e-146 or 5.9999999999999995e-25 < x

   1. Initial program 96.4%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 93.3%

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

   if -9.2000000000000003e-146 < x < 2.05e-238

   1. Initial program 92.6%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 50.8%

      \[\leadsto \color{blue}{0.8862269254527579 \cdot \frac{y}{e^{z}}} \]

   4. Taylor expanded in z around 0 49.5%

      \[\leadsto \color{blue}{0.8862269254527579 \cdot y} \]
   5. Step-by-step derivation

      1. *-commutative 49.5%

         \[\leadsto \color{blue}{y \cdot 0.8862269254527579} \]

   6. Simplified 49.5%

      \[\leadsto \color{blue}{y \cdot 0.8862269254527579} \]
   7. Step-by-step derivation

      1. metadata-eval 49.6%

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

      2. div-inv 49.6%

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

   8. Applied egg-rr 49.6%

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

   if 2.05e-238 < x < 5.9999999999999995e-25

   1. Initial program 91.9%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]
   2. Step-by-step derivation

      1. remove-double-neg 91.9%

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

      2. distribute-frac-neg 91.9%

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

      3. unsub-neg 91.9%

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

      4. distribute-frac-neg 91.9%

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

      5. distribute-neg-frac2 91.9%

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

      6. neg-sub0 92.0%

         \[\leadsto x - \frac{y}{\color{blue}{0 - \left(1.1283791670955126 \cdot e^{z} - x \cdot y\right)}} \]

      7. associate--r- 92.0%

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

      8. neg-sub0 92.1%

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

      9. +-commutative 92.1%

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

      10. fma-define 92.1%

          \[\leadsto x - \frac{y}{\color{blue}{\mathsf{fma}\left(x, y, -1.1283791670955126 \cdot e^{z}\right)}} \]

      11. *-commutative 92.1%

          \[\leadsto x - \frac{y}{\mathsf{fma}\left(x, y, -\color{blue}{e^{z} \cdot 1.1283791670955126}\right)} \]

      12. distribute-rgt-neg-in 92.1%

          \[\leadsto x - \frac{y}{\mathsf{fma}\left(x, y, \color{blue}{e^{z} \cdot \left(-1.1283791670955126\right)}\right)} \]

      13. metadata-eval 92.1%

          \[\leadsto x - \frac{y}{\mathsf{fma}\left(x, y, e^{z} \cdot \color{blue}{-1.1283791670955126}\right)} \]

   3. Simplified 92.1%

      \[\leadsto \color{blue}{x - \frac{y}{\mathsf{fma}\left(x, y, e^{z} \cdot -1.1283791670955126\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 43.6%

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

      1. *-commutative 43.6%

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

   7. Simplified 43.6%

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

   8. Taylor expanded in x around 0 51.4%

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

Alternative 6: 71.2% accurate, 6.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -7.5 \cdot 10^{-146}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 8 \cdot 10^{-236}:\\ \;\;\;\;y \cdot 0.8862269254527579\\ \mathbf{elif}\;x \leq 5.4 \cdot 10^{-24}:\\ \;\;\;\;\frac{-1}{x}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -7.5e-146)
   x
   (if (<= x 8e-236)
     (* y 0.8862269254527579)
     (if (<= x 5.4e-24) (/ -1.0 x) x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -7.5e-146) {
		tmp = x;
	} else if (x <= 8e-236) {
		tmp = y * 0.8862269254527579;
	} else if (x <= 5.4e-24) {
		tmp = -1.0 / x;
	} 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 (x <= (-7.5d-146)) then
        tmp = x
    else if (x <= 8d-236) then
        tmp = y * 0.8862269254527579d0
    else if (x <= 5.4d-24) then
        tmp = (-1.0d0) / x
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -7.5e-146) {
		tmp = x;
	} else if (x <= 8e-236) {
		tmp = y * 0.8862269254527579;
	} else if (x <= 5.4e-24) {
		tmp = -1.0 / x;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -7.5e-146:
		tmp = x
	elif x <= 8e-236:
		tmp = y * 0.8862269254527579
	elif x <= 5.4e-24:
		tmp = -1.0 / x
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -7.5e-146)
		tmp = x;
	elseif (x <= 8e-236)
		tmp = Float64(y * 0.8862269254527579);
	elseif (x <= 5.4e-24)
		tmp = Float64(-1.0 / x);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -7.5e-146)
		tmp = x;
	elseif (x <= 8e-236)
		tmp = y * 0.8862269254527579;
	elseif (x <= 5.4e-24)
		tmp = -1.0 / x;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -7.5e-146], x, If[LessEqual[x, 8e-236], N[(y * 0.8862269254527579), $MachinePrecision], If[LessEqual[x, 5.4e-24], N[(-1.0 / x), $MachinePrecision], x]]]

Derivation

1. Split input into 3 regimes

2. if x < -7.49999999999999981e-146 or 5.40000000000000014e-24 < x

   1. Initial program 96.4%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 93.3%

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

   if -7.49999999999999981e-146 < x < 8.0000000000000004e-236

   1. Initial program 92.6%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 50.8%

      \[\leadsto \color{blue}{0.8862269254527579 \cdot \frac{y}{e^{z}}} \]

   4. Taylor expanded in z around 0 49.5%

      \[\leadsto \color{blue}{0.8862269254527579 \cdot y} \]
   5. Step-by-step derivation

      1. *-commutative 49.5%

         \[\leadsto \color{blue}{y \cdot 0.8862269254527579} \]

   6. Simplified 49.5%

      \[\leadsto \color{blue}{y \cdot 0.8862269254527579} \]

   if 8.0000000000000004e-236 < x < 5.40000000000000014e-24

   1. Initial program 91.9%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]
   2. Step-by-step derivation

      1. remove-double-neg 91.9%

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

      2. distribute-frac-neg 91.9%

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

      3. unsub-neg 91.9%

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

      4. distribute-frac-neg 91.9%

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

      5. distribute-neg-frac2 91.9%

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

      6. neg-sub0 92.0%

         \[\leadsto x - \frac{y}{\color{blue}{0 - \left(1.1283791670955126 \cdot e^{z} - x \cdot y\right)}} \]

      7. associate--r- 92.0%

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

      8. neg-sub0 92.1%

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

      9. +-commutative 92.1%

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

      10. fma-define 92.1%

          \[\leadsto x - \frac{y}{\color{blue}{\mathsf{fma}\left(x, y, -1.1283791670955126 \cdot e^{z}\right)}} \]

      11. *-commutative 92.1%

          \[\leadsto x - \frac{y}{\mathsf{fma}\left(x, y, -\color{blue}{e^{z} \cdot 1.1283791670955126}\right)} \]

      12. distribute-rgt-neg-in 92.1%

          \[\leadsto x - \frac{y}{\mathsf{fma}\left(x, y, \color{blue}{e^{z} \cdot \left(-1.1283791670955126\right)}\right)} \]

      13. metadata-eval 92.1%

          \[\leadsto x - \frac{y}{\mathsf{fma}\left(x, y, e^{z} \cdot \color{blue}{-1.1283791670955126}\right)} \]

   3. Simplified 92.1%

      \[\leadsto \color{blue}{x - \frac{y}{\mathsf{fma}\left(x, y, e^{z} \cdot -1.1283791670955126\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 43.6%

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

      1. *-commutative 43.6%

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

   7. Simplified 43.6%

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

   8. Taylor expanded in x around 0 51.4%

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

Alternative 7: 86.1% accurate, 7.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.1 \cdot 10^{-49}:\\ \;\;\;\;x + \frac{-1}{x}\\ \mathbf{elif}\;z \leq 1.9 \cdot 10^{-31}:\\ \;\;\;\;x - \frac{y}{-1.1283791670955126}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -1.1e-49)
   (+ x (/ -1.0 x))
   (if (<= z 1.9e-31) (- x (/ y -1.1283791670955126)) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -1.1e-49) {
		tmp = x + (-1.0 / x);
	} else if (z <= 1.9e-31) {
		tmp = x - (y / -1.1283791670955126);
	} 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 (z <= (-1.1d-49)) then
        tmp = x + ((-1.0d0) / x)
    else if (z <= 1.9d-31) then
        tmp = x - (y / (-1.1283791670955126d0))
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z <= -1.1e-49) {
		tmp = x + (-1.0 / x);
	} else if (z <= 1.9e-31) {
		tmp = x - (y / -1.1283791670955126);
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -1.1e-49:
		tmp = x + (-1.0 / x)
	elif z <= 1.9e-31:
		tmp = x - (y / -1.1283791670955126)
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -1.1e-49)
		tmp = Float64(x + Float64(-1.0 / x));
	elseif (z <= 1.9e-31)
		tmp = Float64(x - Float64(y / -1.1283791670955126));
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -1.1e-49)
		tmp = x + (-1.0 / x);
	elseif (z <= 1.9e-31)
		tmp = x - (y / -1.1283791670955126);
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -1.1e-49], N[(x + N[(-1.0 / x), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.9e-31], N[(x - N[(y / -1.1283791670955126), $MachinePrecision]), $MachinePrecision], x]]

Derivation

1. Split input into 3 regimes

2. if z < -1.09999999999999995e-49

   1. Initial program 91.5%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 97.5%

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

   if -1.09999999999999995e-49 < z < 1.9e-31

   1. Initial program 99.8%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]
   2. Step-by-step derivation

      1. remove-double-neg 99.8%

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

      2. distribute-frac-neg 99.8%

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

      3. unsub-neg 99.8%

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

      4. distribute-frac-neg 99.8%

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

      5. distribute-neg-frac2 99.8%

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

      6. neg-sub0 99.8%

         \[\leadsto x - \frac{y}{\color{blue}{0 - \left(1.1283791670955126 \cdot e^{z} - x \cdot y\right)}} \]

      7. associate--r- 99.8%

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

      8. neg-sub0 99.8%

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

      9. +-commutative 99.8%

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

      10. fma-define 99.8%

          \[\leadsto x - \frac{y}{\color{blue}{\mathsf{fma}\left(x, y, -1.1283791670955126 \cdot e^{z}\right)}} \]

      11. *-commutative 99.8%

          \[\leadsto x - \frac{y}{\mathsf{fma}\left(x, y, -\color{blue}{e^{z} \cdot 1.1283791670955126}\right)} \]

      12. distribute-rgt-neg-in 99.8%

          \[\leadsto x - \frac{y}{\mathsf{fma}\left(x, y, \color{blue}{e^{z} \cdot \left(-1.1283791670955126\right)}\right)} \]

      13. metadata-eval 99.8%

          \[\leadsto x - \frac{y}{\mathsf{fma}\left(x, y, e^{z} \cdot \color{blue}{-1.1283791670955126}\right)} \]

   3. Simplified 99.8%

      \[\leadsto \color{blue}{x - \frac{y}{\mathsf{fma}\left(x, y, e^{z} \cdot -1.1283791670955126\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in z around 0 99.8%

      \[\leadsto \color{blue}{x - \frac{y}{x \cdot y - 1.1283791670955126}} \]

   6. Taylor expanded in x around 0 80.8%

      \[\leadsto x - \frac{y}{\color{blue}{-1.1283791670955126}} \]

   if 1.9e-31 < z

   1. Initial program 91.0%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 100.0%

      \[\leadsto \color{blue}{x} \]
3. Recombined 3 regimes into one program.

4. Final simplification 90.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.1 \cdot 10^{-49}:\\ \;\;\;\;x + \frac{-1}{x}\\ \mathbf{elif}\;z \leq 1.9 \cdot 10^{-31}:\\ \;\;\;\;x - \frac{y}{-1.1283791670955126}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 70.7% accurate, 8.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -8.5 \cdot 10^{-145}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 9.5 \cdot 10^{-116}:\\ \;\;\;\;y \cdot 0.8862269254527579\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -8.5e-145) x (if (<= x 9.5e-116) (* y 0.8862269254527579) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -8.5e-145) {
		tmp = x;
	} else if (x <= 9.5e-116) {
		tmp = y * 0.8862269254527579;
	} 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 (x <= (-8.5d-145)) then
        tmp = x
    else if (x <= 9.5d-116) then
        tmp = y * 0.8862269254527579d0
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -8.5e-145) {
		tmp = x;
	} else if (x <= 9.5e-116) {
		tmp = y * 0.8862269254527579;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -8.5e-145:
		tmp = x
	elif x <= 9.5e-116:
		tmp = y * 0.8862269254527579
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -8.5e-145)
		tmp = x;
	elseif (x <= 9.5e-116)
		tmp = Float64(y * 0.8862269254527579);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -8.5e-145)
		tmp = x;
	elseif (x <= 9.5e-116)
		tmp = y * 0.8862269254527579;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -8.5e-145], x, If[LessEqual[x, 9.5e-116], N[(y * 0.8862269254527579), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if x < -8.50000000000000043e-145 or 9.4999999999999998e-116 < x

   1. Initial program 96.7%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 88.5%

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

   if -8.50000000000000043e-145 < x < 9.4999999999999998e-116

   1. Initial program 90.8%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 45.2%

      \[\leadsto \color{blue}{0.8862269254527579 \cdot \frac{y}{e^{z}}} \]

   4. Taylor expanded in z around 0 44.1%

      \[\leadsto \color{blue}{0.8862269254527579 \cdot y} \]
   5. Step-by-step derivation

      1. *-commutative 44.1%

         \[\leadsto \color{blue}{y \cdot 0.8862269254527579} \]

   6. Simplified 44.1%

      \[\leadsto \color{blue}{y \cdot 0.8862269254527579} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 9: 81.2% accurate, 11.1× speedup

Math

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

FPCore

(FPCore (x y z) :precision binary64 (if (<= z 5e-300) (+ x (/ -1.0 x)) x))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := If[LessEqual[z, 5e-300], N[(x + N[(-1.0 / x), $MachinePrecision]), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if z < 4.99999999999999996e-300

   1. Initial program 94.8%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 80.4%

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

   if 4.99999999999999996e-300 < z

   1. Initial program 95.2%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 84.1%

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

4. Final simplification 82.3%

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

Alternative 10: 69.3% accurate, 111.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 95.0%

   \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]
2. Add Preprocessing

3. Taylor expanded in x around inf 69.2%

   \[\leadsto \color{blue}{x} \]
4. Add Preprocessing

Developer Target 1: 99.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x + \frac{1}{\frac{1.1283791670955126}{y} \cdot e^{z} - x} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (+ x (/ 1.0 (- (* (/ 1.1283791670955126 y) (exp z)) x))))

C

double code(double x, double y, double z) {
	return x + (1.0 / (((1.1283791670955126 / y) * exp(z)) - 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 + (1.0d0 / (((1.1283791670955126d0 / y) * exp(z)) - x))
end function

Java

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

Python

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

Julia

function code(x, y, z)
	return Float64(x + Float64(1.0 / Float64(Float64(Float64(1.1283791670955126 / y) * exp(z)) - x)))
end

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024139 
(FPCore (x y z)
  :name "Numeric.SpecFunctions:invErfc from math-functions-0.1.5.2, A"
  :precision binary64

  :alt
  (! :herbie-platform default (+ x (/ 1 (- (* (/ 5641895835477563/5000000000000000 y) (exp z)) x))))

  (+ x (/ y (- (* 1.1283791670955126 (exp z)) (* x y)))))