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

Percentage Accurate: 95.7% → 99.7%

Time: 11.9s

Alternatives: 10

Speedup: 5.8×

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

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	double tmp;
	if (exp(z) <= 0.0) {
		tmp = x + (-1.0 / x);
	} else if (exp(z) <= 2.0) {
		tmp = x + (y / (1.1283791670955126 + ((z * (1.1283791670955126 - (z * -0.5641895835477563))) - (x * 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 (exp(z) <= 0.0d0) then
        tmp = x + ((-1.0d0) / x)
    else if (exp(z) <= 2.0d0) then
        tmp = x + (y / (1.1283791670955126d0 + ((z * (1.1283791670955126d0 - (z * (-0.5641895835477563d0)))) - (x * y))))
    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) <= 0.0) {
		tmp = x + (-1.0 / x);
	} else if (Math.exp(z) <= 2.0) {
		tmp = x + (y / (1.1283791670955126 + ((z * (1.1283791670955126 - (z * -0.5641895835477563))) - (x * y))));
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if math.exp(z) <= 0.0:
		tmp = x + (-1.0 / x)
	elif math.exp(z) <= 2.0:
		tmp = x + (y / (1.1283791670955126 + ((z * (1.1283791670955126 - (z * -0.5641895835477563))) - (x * y))))
	else:
		tmp = x
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (exp.f64 z) < 0.0

   1. Initial program 94.2%

      \[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) < 2

   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 x - \frac{y}{\color{blue}{\left(x \cdot y + z \cdot \left(-0.5641895835477563 \cdot z - 1.1283791670955126\right)\right) - 1.1283791670955126}} \]

   if 2 < (exp.f64 z)

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

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

Alternative 2: 97.3% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ x - \frac{y}{\mathsf{fma}\left(x, y, e^{z} \cdot -1.1283791670955126\right)} \end{array} \]

FPCore

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

C

double code(double x, double y, double z) {
	return x - (y / fma(x, y, (exp(z) * -1.1283791670955126)));
}

Julia

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

Wolfram

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

Derivation

1. Initial program 97.6%

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

   1. remove-double-neg 97.6%

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

   2. distribute-frac-neg 97.6%

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

   3. unsub-neg 97.6%

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

   4. distribute-frac-neg 97.6%

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

   5. distribute-neg-frac2 97.6%

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

   6. neg-sub0 97.7%

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

   7. associate--r- 97.7%

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

   8. neg-sub0 97.7%

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

   9. +-commutative 97.7%

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

   10. fma-define 98.4%

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

   11. *-commutative 98.4%

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

   12. distribute-rgt-neg-in 98.4%

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

   13. metadata-eval 98.4%

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

3. Simplified 98.4%

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

5. Final simplification 98.4%

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

Alternative 3: 95.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 97.6%

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

3. Final simplification 97.6%

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

Alternative 4: 70.6% accurate, 4.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -3.5 \cdot 10^{-212}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq -4.1 \cdot 10^{-231} \lor \neg \left(x \leq -5.5 \cdot 10^{-258}\right) \land x \leq 6 \cdot 10^{-134}:\\ \;\;\;\;y \cdot 0.8862269254527579\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -3.5e-212)
   x
   (if (or (<= x -4.1e-231) (and (not (<= x -5.5e-258)) (<= x 6e-134)))
     (* y 0.8862269254527579)
     x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -3.5e-212) {
		tmp = x;
	} else if ((x <= -4.1e-231) || (!(x <= -5.5e-258) && (x <= 6e-134))) {
		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 <= (-3.5d-212)) then
        tmp = x
    else if ((x <= (-4.1d-231)) .or. (.not. (x <= (-5.5d-258))) .and. (x <= 6d-134)) 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 <= -3.5e-212) {
		tmp = x;
	} else if ((x <= -4.1e-231) || (!(x <= -5.5e-258) && (x <= 6e-134))) {
		tmp = y * 0.8862269254527579;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -3.5e-212:
		tmp = x
	elif (x <= -4.1e-231) or (not (x <= -5.5e-258) and (x <= 6e-134)):
		tmp = y * 0.8862269254527579
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -3.5e-212)
		tmp = x;
	elseif ((x <= -4.1e-231) || (!(x <= -5.5e-258) && (x <= 6e-134)))
		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 <= -3.5e-212)
		tmp = x;
	elseif ((x <= -4.1e-231) || (~((x <= -5.5e-258)) && (x <= 6e-134)))
		tmp = y * 0.8862269254527579;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -3.5e-212], x, If[Or[LessEqual[x, -4.1e-231], And[N[Not[LessEqual[x, -5.5e-258]], $MachinePrecision], LessEqual[x, 6e-134]]], N[(y * 0.8862269254527579), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if x < -3.4999999999999998e-212 or -4.1000000000000002e-231 < x < -5.49999999999999969e-258 or 6e-134 < x

   1. Initial program 98.8%

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

   3. Taylor expanded in x around inf 77.3%

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

   if -3.4999999999999998e-212 < x < -4.1000000000000002e-231 or -5.49999999999999969e-258 < x < 6e-134

   1. Initial program 93.4%

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

      1. remove-double-neg 93.4%

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

      2. distribute-frac-neg 93.4%

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

      3. unsub-neg 93.4%

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

      4. distribute-frac-neg 93.4%

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

      5. distribute-neg-frac2 93.4%

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

      6. neg-sub0 93.7%

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

      7. associate--r- 93.7%

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

      8. neg-sub0 93.7%

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

      9. +-commutative 93.7%

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

      10. fma-define 93.7%

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

      11. *-commutative 93.7%

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

      12. distribute-rgt-neg-in 93.7%

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

      13. metadata-eval 93.7%

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

   3. Simplified 93.7%

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

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

   6. Taylor expanded in y around 0 63.7%

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

   7. Taylor expanded in x around 0 52.4%

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

      1. associate-*r/ 52.4%

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

      2. sub-neg 52.4%

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

      3. *-commutative 52.4%

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

      4. metadata-eval 52.4%

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

      5. distribute-lft1-in 52.4%

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

      6. *-commutative 52.4%

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

      7. times-frac 52.4%

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

      8. metadata-eval 52.2%

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

   9. Simplified 52.2%

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

   10. Taylor expanded in z around 0 51.0%

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

       1. *-commutative 51.0%

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

   12. Simplified 51.0%

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

4. Final simplification 71.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -3.5 \cdot 10^{-212}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq -4.1 \cdot 10^{-231} \lor \neg \left(x \leq -5.5 \cdot 10^{-258}\right) \land x \leq 6 \cdot 10^{-134}:\\ \;\;\;\;y \cdot 0.8862269254527579\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 99.3% accurate, 4.8× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -220.0)
   (+ x (/ -1.0 x))
   (if (<= z 8.8e-19)
     (+ x (/ y (- 1.1283791670955126 (+ (* x y) (* z -1.1283791670955126)))))
     x)))

C

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

Python

def code(x, y, z):
	tmp = 0
	if z <= -220.0:
		tmp = x + (-1.0 / x)
	elif z <= 8.8e-19:
		tmp = x + (y / (1.1283791670955126 - ((x * y) + (z * -1.1283791670955126))))
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -220.0)
		tmp = Float64(x + Float64(-1.0 / x));
	elseif (z <= 8.8e-19)
		tmp = Float64(x + Float64(y / Float64(1.1283791670955126 - Float64(Float64(x * y) + Float64(z * -1.1283791670955126)))));
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -220.0)
		tmp = x + (-1.0 / x);
	elseif (z <= 8.8e-19)
		tmp = x + (y / (1.1283791670955126 - ((x * y) + (z * -1.1283791670955126))));
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if z < -220

   1. Initial program 94.2%

      \[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 -220 < z < 8.7999999999999994e-19

   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.6%

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

   if 8.7999999999999994e-19 < z

   1. Initial program 97.1%

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

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

Alternative 6: 99.3% accurate, 5.8× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -140.0)
   (+ x (/ -1.0 x))
   (if (<= z 8.8e-19) (+ x (/ y (- 1.1283791670955126 (* x y)))) x)))

C

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

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z <= -140.0) {
		tmp = x + (-1.0 / x);
	} else if (z <= 8.8e-19) {
		tmp = x + (y / (1.1283791670955126 - (x * y)));
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -140.0:
		tmp = x + (-1.0 / x)
	elif z <= 8.8e-19:
		tmp = x + (y / (1.1283791670955126 - (x * y)))
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -140.0)
		tmp = Float64(x + Float64(-1.0 / x));
	elseif (z <= 8.8e-19)
		tmp = Float64(x + Float64(y / Float64(1.1283791670955126 - Float64(x * y))));
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -140.0)
		tmp = x + (-1.0 / x);
	elseif (z <= 8.8e-19)
		tmp = x + (y / (1.1283791670955126 - (x * y)));
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if z < -140

   1. Initial program 94.2%

      \[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 -140 < z < 8.7999999999999994e-19

   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.1%

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

   if 8.7999999999999994e-19 < z

   1. Initial program 97.1%

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

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

Alternative 7: 74.9% accurate, 7.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -4.8 \cdot 10^{-9}:\\ \;\;\;\;x\\ \mathbf{elif}\;z \leq 8.5 \cdot 10^{-19}:\\ \;\;\;\;x + y \cdot 0.8862269254527579\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -4.8e-9) x (if (<= z 8.5e-19) (+ x (* y 0.8862269254527579)) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -4.8e-9) {
		tmp = x;
	} else if (z <= 8.5e-19) {
		tmp = x + (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 (z <= (-4.8d-9)) then
        tmp = x
    else if (z <= 8.5d-19) then
        tmp = x + (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 (z <= -4.8e-9) {
		tmp = x;
	} else if (z <= 8.5e-19) {
		tmp = x + (y * 0.8862269254527579);
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -4.8e-9:
		tmp = x
	elif z <= 8.5e-19:
		tmp = x + (y * 0.8862269254527579)
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -4.8e-9)
		tmp = x;
	elseif (z <= 8.5e-19)
		tmp = Float64(x + Float64(y * 0.8862269254527579));
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -4.8e-9)
		tmp = x;
	elseif (z <= 8.5e-19)
		tmp = x + (y * 0.8862269254527579);
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -4.8e-9], x, If[LessEqual[z, 8.5e-19], N[(x + N[(y * 0.8862269254527579), $MachinePrecision]), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if z < -4.8e-9 or 8.50000000000000003e-19 < z

   1. Initial program 95.8%

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

   3. Taylor expanded in x around inf 76.1%

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

   if -4.8e-9 < z < 8.50000000000000003e-19

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0 72.4%

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

      1. associate-*r/ 72.4%

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

   5. Simplified 72.4%

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

   6. Taylor expanded in z around 0 72.1%

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

      1. *-commutative 72.1%

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

   8. Simplified 72.1%

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

4. Final simplification 74.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -4.8 \cdot 10^{-9}:\\ \;\;\;\;x\\ \mathbf{elif}\;z \leq 8.5 \cdot 10^{-19}:\\ \;\;\;\;x + y \cdot 0.8862269254527579\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 86.0% accurate, 7.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -3.1 \cdot 10^{-135}:\\ \;\;\;\;x + \frac{-1}{x}\\ \mathbf{elif}\;z \leq 8.8 \cdot 10^{-19}:\\ \;\;\;\;x + y \cdot 0.8862269254527579\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -3.1e-135)
   (+ x (/ -1.0 x))
   (if (<= z 8.8e-19) (+ x (* y 0.8862269254527579)) x)))

C

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

Python

def code(x, y, z):
	tmp = 0
	if z <= -3.1e-135:
		tmp = x + (-1.0 / x)
	elif z <= 8.8e-19:
		tmp = x + (y * 0.8862269254527579)
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -3.1e-135)
		tmp = Float64(x + Float64(-1.0 / x));
	elseif (z <= 8.8e-19)
		tmp = Float64(x + Float64(y * 0.8862269254527579));
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -3.1e-135)
		tmp = x + (-1.0 / x);
	elseif (z <= 8.8e-19)
		tmp = x + (y * 0.8862269254527579);
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -3.1e-135], N[(x + N[(-1.0 / x), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 8.8e-19], N[(x + N[(y * 0.8862269254527579), $MachinePrecision]), $MachinePrecision], x]]

Derivation

1. Split input into 3 regimes

2. if z < -3.1000000000000001e-135

   1. Initial program 95.8%

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

   3. Taylor expanded in y around inf 90.5%

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

   if -3.1000000000000001e-135 < z < 8.7999999999999994e-19

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0 75.9%

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

      1. associate-*r/ 75.9%

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

   5. Simplified 75.9%

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

   6. Taylor expanded in z around 0 75.9%

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

      1. *-commutative 75.9%

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

   8. Simplified 75.9%

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

   if 8.7999999999999994e-19 < z

   1. Initial program 97.1%

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

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -3.1 \cdot 10^{-135}:\\ \;\;\;\;x + \frac{-1}{x}\\ \mathbf{elif}\;z \leq 8.8 \cdot 10^{-19}:\\ \;\;\;\;x + y \cdot 0.8862269254527579\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 86.0% accurate, 7.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -2.75 \cdot 10^{-133}:\\ \;\;\;\;x + \frac{-1}{x}\\ \mathbf{elif}\;z \leq 1.2 \cdot 10^{-19}:\\ \;\;\;\;x - \frac{y}{-1.1283791670955126}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -2.75e-133)
   (+ x (/ -1.0 x))
   (if (<= z 1.2e-19) (- x (/ y -1.1283791670955126)) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -2.75e-133) {
		tmp = x + (-1.0 / x);
	} else if (z <= 1.2e-19) {
		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 <= (-2.75d-133)) then
        tmp = x + ((-1.0d0) / x)
    else if (z <= 1.2d-19) 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 <= -2.75e-133) {
		tmp = x + (-1.0 / x);
	} else if (z <= 1.2e-19) {
		tmp = x - (y / -1.1283791670955126);
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -2.75e-133:
		tmp = x + (-1.0 / x)
	elif z <= 1.2e-19:
		tmp = x - (y / -1.1283791670955126)
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -2.75e-133)
		tmp = Float64(x + Float64(-1.0 / x));
	elseif (z <= 1.2e-19)
		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 <= -2.75e-133)
		tmp = x + (-1.0 / x);
	elseif (z <= 1.2e-19)
		tmp = x - (y / -1.1283791670955126);
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -2.75e-133], N[(x + N[(-1.0 / x), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.2e-19], N[(x - N[(y / -1.1283791670955126), $MachinePrecision]), $MachinePrecision], x]]

Derivation

1. Split input into 3 regimes

2. if z < -2.74999999999999988e-133

   1. Initial program 95.8%

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

   3. Taylor expanded in y around inf 90.5%

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

   if -2.74999999999999988e-133 < z < 1.20000000000000011e-19

   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 x - \frac{y}{\color{blue}{\left(-1.1283791670955126 \cdot z + x \cdot y\right) - 1.1283791670955126}} \]

   6. Taylor expanded in y around 0 76.0%

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

   7. Taylor expanded in z around 0 76.0%

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

   if 1.20000000000000011e-19 < z

   1. Initial program 97.1%

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

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -2.75 \cdot 10^{-133}:\\ \;\;\;\;x + \frac{-1}{x}\\ \mathbf{elif}\;z \leq 1.2 \cdot 10^{-19}:\\ \;\;\;\;x - \frac{y}{-1.1283791670955126}\\ \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 97.6%

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

3. Taylor expanded in x around inf 65.3%

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

4. Final simplification 65.3%

   \[\leadsto x \]
5. Add Preprocessing

Developer target: 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 2024130 
(FPCore (x y z)
  :name "Numeric.SpecFunctions:invErfc from math-functions-0.1.5.2, A"
  :precision binary64

  :alt
  (+ x (/ 1.0 (- (* (/ 1.1283791670955126 y) (exp z)) x)))

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