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

Percentage Accurate: 95.4% → 99.5%

Time: 12.1s

Alternatives: 13

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

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;e^{z} \leq 0.9999999999998:\\ \;\;\;\;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.9999999999998)
   (+ 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.9999999999998) {
		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.9999999999998)
		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.9999999999998], 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.999999999999800049

   1. Initial program 86.4%

      \[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.999999999999800049 < (exp.f64 z)

   1. Initial program 98.3%

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

      1. remove-double-neg 98.3%

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

      2. distribute-frac-neg 98.3%

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

      3. unsub-neg 98.3%

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

      4. distribute-frac-neg 98.3%

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

      5. distribute-neg-frac2 98.3%

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

      6. neg-sub0 98.3%

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

      7. associate--r- 98.3%

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

      8. neg-sub0 98.3%

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

      9. +-commutative 98.3%

         \[\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.9999999999998:\\ \;\;\;\;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: 99.4% accurate, 0.4× speedup

Math

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

FPCore

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

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) <= 1.0) {
		tmp = x + (1.0 / ((1.1283791670955126 / y) - x));
	} else {
		tmp = x - ((y / exp(z)) * -0.8862269254527579);
	}
	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) <= 1.0d0) then
        tmp = x + (1.0d0 / ((1.1283791670955126d0 / y) - x))
    else
        tmp = x - ((y / exp(z)) * (-0.8862269254527579d0))
    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) <= 1.0) {
		tmp = x + (1.0 / ((1.1283791670955126 / y) - x));
	} else {
		tmp = x - ((y / Math.exp(z)) * -0.8862269254527579);
	}
	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) <= 1.0:
		tmp = x + (1.0 / ((1.1283791670955126 / y) - x))
	else:
		tmp = x - ((y / math.exp(z)) * -0.8862269254527579)
	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) <= 1.0)
		tmp = Float64(x + Float64(1.0 / Float64(Float64(1.1283791670955126 / y) - x)));
	else
		tmp = Float64(x - Float64(Float64(y / exp(z)) * -0.8862269254527579));
	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) <= 1.0)
		tmp = x + (1.0 / ((1.1283791670955126 / y) - x));
	else
		tmp = x - ((y / exp(z)) * -0.8862269254527579);
	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], 1.0], N[(x + N[(1.0 / N[(N[(1.1283791670955126 / y), $MachinePrecision] - x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x - N[(N[(y / N[Exp[z], $MachinePrecision]), $MachinePrecision] * -0.8862269254527579), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if (exp.f64 z) < 0.0

   1. Initial program 86.0%

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

   1. Initial program 99.8%

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

      1. clear-num 99.8%

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

      2. inv-pow 99.8%

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

      3. *-commutative 99.8%

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

   4. Applied egg-rr 99.8%

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

      1. unpow-1 99.8%

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

      2. *-commutative 99.8%

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

   6. Simplified 99.8%

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

   7. Taylor expanded in z around 0 99.8%

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

   8. Taylor expanded in z around 0 99.8%

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

      1. associate-*r/ 99.8%

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

      2. metadata-eval 99.8%

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

   10. Simplified 99.8%

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

   if 1 < (exp.f64 z)

   1. Initial program 95.6%

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

      1. remove-double-neg 95.6%

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

      2. distribute-frac-neg 95.6%

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

      3. unsub-neg 95.6%

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

      4. distribute-frac-neg 95.6%

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

      5. distribute-neg-frac2 95.6%

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

      6. neg-sub0 95.6%

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

      7. associate--r- 95.6%

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

      8. neg-sub0 95.6%

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

      9. +-commutative 95.6%

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

      10. fma-define 100.0%

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

      11. *-commutative 100.0%

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

      12. distribute-rgt-neg-in 100.0%

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

      13. metadata-eval 100.0%

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

   3. Simplified 100.0%

      \[\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 0 100.0%

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

      1. *-commutative 100.0%

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

   7. Simplified 100.0%

      \[\leadsto x - \color{blue}{\frac{y}{e^{z}} \cdot -0.8862269254527579} \]
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 1:\\ \;\;\;\;x + \frac{1}{\frac{1.1283791670955126}{y} - x}\\ \mathbf{else}:\\ \;\;\;\;x - \frac{y}{e^{z}} \cdot -0.8862269254527579\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 99.4% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (exp.f64 z) < 0.999999999999800049

   1. Initial program 86.4%

      \[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.999999999999800049 < (exp.f64 z) < 40

   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.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 z around 0 99.2%

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

   if 40 < (exp.f64 z)

   1. Initial program 95.4%

      \[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}\;e^{z} \leq 0.9999999999998:\\ \;\;\;\;x + \frac{-1}{x}\\ \mathbf{elif}\;e^{z} \leq 40:\\ \;\;\;\;x - \frac{y}{\left(x \cdot y + z \cdot \left(z \cdot \left(z \cdot -0.18806319451591877 - 0.5641895835477563\right) - 1.1283791670955126\right)\right) - 1.1283791670955126}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 97.9% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (exp(z) <= 0.9999999999998d0) then
        tmp = x + ((-1.0d0) / x)
    else
        tmp = x + (1.0d0 / (((exp(z) * 1.1283791670955126d0) - (x * y)) / y))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (exp.f64 z) < 0.999999999999800049

   1. Initial program 86.4%

      \[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.999999999999800049 < (exp.f64 z)

   1. Initial program 98.3%

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

      1. clear-num 98.3%

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

      2. inv-pow 98.3%

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

      3. *-commutative 98.3%

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

   4. Applied egg-rr 98.3%

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

      1. unpow-1 98.3%

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

      2. *-commutative 98.3%

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

   6. Simplified 98.3%

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

4. Final simplification 98.7%

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

Alternative 5: 97.9% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (exp(z) <= 0.9999999999998d0) then
        tmp = x + ((-1.0d0) / x)
    else
        tmp = x + (y / ((exp(z) * 1.1283791670955126d0) - (x * y)))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (exp.f64 z) < 0.999999999999800049

   1. Initial program 86.4%

      \[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.999999999999800049 < (exp.f64 z)

   1. Initial program 98.3%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]
   2. Add Preprocessing
3. Recombined 2 regimes into one program.

4. Final simplification 98.7%

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

Alternative 6: 99.4% accurate, 4.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -2 \cdot 10^{-13}:\\ \;\;\;\;x + \frac{-1}{x}\\ \mathbf{elif}\;z \leq 32:\\ \;\;\;\;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 (<= z -2e-13)
   (+ x (/ -1.0 x))
   (if (<= z 32.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 (z <= -2e-13) {
		tmp = x + (-1.0 / x);
	} else if (z <= 32.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 (z <= (-2d-13)) then
        tmp = x + ((-1.0d0) / x)
    else if (z <= 32.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 (z <= -2e-13) {
		tmp = x + (-1.0 / x);
	} else if (z <= 32.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 z <= -2e-13:
		tmp = x + (-1.0 / x)
	elif z <= 32.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 (z <= -2e-13)
		tmp = Float64(x + Float64(-1.0 / x));
	elseif (z <= 32.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 (z <= -2e-13)
		tmp = x + (-1.0 / x);
	elseif (z <= 32.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[z, -2e-13], N[(x + N[(-1.0 / x), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 32.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 z < -2.0000000000000001e-13

   1. Initial program 86.4%

      \[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 -2.0000000000000001e-13 < z < 32

   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.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 z around 0 99.2%

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

   if 32 < z

   1. Initial program 95.4%

      \[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 -2 \cdot 10^{-13}:\\ \;\;\;\;x + \frac{-1}{x}\\ \mathbf{elif}\;z \leq 32:\\ \;\;\;\;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 7: 99.3% accurate, 4.4× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -1.02e+14)
   (+ x (/ -1.0 x))
   (if (<= z 31.0)
     (+ x (/ 1.0 (- (* 1.1283791670955126 (+ (/ z y) (/ 1.0 y))) x)))
     x)))

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if z < -1.02e14

   1. Initial program 85.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}} \]

   if -1.02e14 < z < 31

   1. Initial program 99.8%

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

      1. clear-num 99.8%

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

      2. inv-pow 99.8%

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

      3. *-commutative 99.8%

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

   4. Applied egg-rr 99.8%

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

      1. unpow-1 99.8%

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

      2. *-commutative 99.8%

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

   6. Simplified 99.8%

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

   7. Taylor expanded in z around 0 99.2%

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

      1. distribute-lft-out 99.2%

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

   9. Applied egg-rr 99.2%

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

   if 31 < z

   1. Initial program 95.4%

      \[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 -1.02 \cdot 10^{+14}:\\ \;\;\;\;x + \frac{-1}{x}\\ \mathbf{elif}\;z \leq 31:\\ \;\;\;\;x + \frac{1}{1.1283791670955126 \cdot \left(\frac{z}{y} + \frac{1}{y}\right) - x}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 99.4% accurate, 4.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -2 \cdot 10^{-13}:\\ \;\;\;\;x + \frac{-1}{x}\\ \mathbf{elif}\;z \leq 32:\\ \;\;\;\;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 -2e-13)
   (+ x (/ -1.0 x))
   (if (<= z 32.0)
     (+ x (/ y (- 1.1283791670955126 (+ (* x y) (* z -1.1283791670955126)))))
     x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -2e-13) {
		tmp = x + (-1.0 / x);
	} else if (z <= 32.0) {
		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 <= (-2d-13)) then
        tmp = x + ((-1.0d0) / x)
    else if (z <= 32.0d0) 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 <= -2e-13) {
		tmp = x + (-1.0 / x);
	} else if (z <= 32.0) {
		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 <= -2e-13:
		tmp = x + (-1.0 / x)
	elif z <= 32.0:
		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 <= -2e-13)
		tmp = Float64(x + Float64(-1.0 / x));
	elseif (z <= 32.0)
		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 <= -2e-13)
		tmp = x + (-1.0 / x);
	elseif (z <= 32.0)
		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, -2e-13], N[(x + N[(-1.0 / x), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 32.0], 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 < -2.0000000000000001e-13

   1. Initial program 86.4%

      \[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 -2.0000000000000001e-13 < z < 32

   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.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 z around 0 99.2%

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

   if 32 < z

   1. Initial program 95.4%

      \[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 -2 \cdot 10^{-13}:\\ \;\;\;\;x + \frac{-1}{x}\\ \mathbf{elif}\;z \leq 32:\\ \;\;\;\;x + \frac{y}{1.1283791670955126 - \left(x \cdot y + z \cdot -1.1283791670955126\right)}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 99.2% accurate, 5.8× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -1.02e+14)
   (+ x (/ -1.0 x))
   (if (<= z 32.0) (+ x (/ 1.0 (- (/ 1.1283791670955126 y) x))) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -1.02e+14) {
		tmp = x + (-1.0 / x);
	} else if (z <= 32.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 (z <= (-1.02d+14)) then
        tmp = x + ((-1.0d0) / x)
    else if (z <= 32.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 (z <= -1.02e+14) {
		tmp = x + (-1.0 / x);
	} else if (z <= 32.0) {
		tmp = x + (1.0 / ((1.1283791670955126 / y) - x));
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -1.02e+14:
		tmp = x + (-1.0 / x)
	elif z <= 32.0:
		tmp = x + (1.0 / ((1.1283791670955126 / y) - x))
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -1.02e+14)
		tmp = Float64(x + Float64(-1.0 / x));
	elseif (z <= 32.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 (z <= -1.02e+14)
		tmp = x + (-1.0 / x);
	elseif (z <= 32.0)
		tmp = x + (1.0 / ((1.1283791670955126 / y) - x));
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -1.02e+14], N[(x + N[(-1.0 / x), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 32.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 z < -1.02e14

   1. Initial program 85.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}} \]

   if -1.02e14 < z < 32

   1. Initial program 99.8%

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

      1. clear-num 99.8%

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

      2. inv-pow 99.8%

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

      3. *-commutative 99.8%

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

   4. Applied egg-rr 99.8%

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

      1. unpow-1 99.8%

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

      2. *-commutative 99.8%

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

   6. Simplified 99.8%

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

   7. Taylor expanded in z around 0 99.2%

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

   8. Taylor expanded in z around 0 98.9%

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

      1. associate-*r/ 98.9%

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

      2. metadata-eval 98.9%

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

   10. Simplified 98.9%

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

   if 32 < z

   1. Initial program 95.4%

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

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

Alternative 10: 74.1% accurate, 7.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -5.2 \cdot 10^{-37}:\\ \;\;\;\;x\\ \mathbf{elif}\;z \leq 3.2:\\ \;\;\;\;x - y \cdot -0.8862269254527579\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -5.2e-37) x (if (<= z 3.2) (- x (* y -0.8862269254527579)) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -5.2e-37) {
		tmp = x;
	} else if (z <= 3.2) {
		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 <= (-5.2d-37)) then
        tmp = x
    else if (z <= 3.2d0) 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 <= -5.2e-37) {
		tmp = x;
	} else if (z <= 3.2) {
		tmp = x - (y * -0.8862269254527579);
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -5.2e-37:
		tmp = x
	elif z <= 3.2:
		tmp = x - (y * -0.8862269254527579)
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -5.2e-37)
		tmp = x;
	elseif (z <= 3.2)
		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 <= -5.2e-37)
		tmp = x;
	elseif (z <= 3.2)
		tmp = x - (y * -0.8862269254527579);
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -5.2e-37], x, If[LessEqual[z, 3.2], N[(x - N[(y * -0.8862269254527579), $MachinePrecision]), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if z < -5.19999999999999959e-37 or 3.2000000000000002 < z

   1. Initial program 91.2%

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

   3. Taylor expanded in x around inf 72.2%

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

   if -5.19999999999999959e-37 < z < 3.2000000000000002

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

   6. Taylor expanded in y around 0 78.8%

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

   7. Taylor expanded in z around 0 78.4%

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

      1. *-commutative 78.4%

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

   9. Simplified 78.4%

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

4. Final simplification 75.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -5.2 \cdot 10^{-37}:\\ \;\;\;\;x\\ \mathbf{elif}\;z \leq 3.2:\\ \;\;\;\;x - y \cdot -0.8862269254527579\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 86.0% accurate, 7.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.85 \cdot 10^{-133}:\\ \;\;\;\;x + \frac{-1}{x}\\ \mathbf{elif}\;z \leq 13.5:\\ \;\;\;\;x - y \cdot -0.8862269254527579\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -1.85e-133)
   (+ x (/ -1.0 x))
   (if (<= z 13.5) (- x (* y -0.8862269254527579)) x)))

C

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

Python

def code(x, y, z):
	tmp = 0
	if z <= -1.85e-133:
		tmp = x + (-1.0 / x)
	elif z <= 13.5:
		tmp = x - (y * -0.8862269254527579)
	else:
		tmp = x
	return tmp

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if z < -1.85000000000000018e-133

   1. Initial program 89.8%

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

   3. Taylor expanded in y around inf 95.1%

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

   if -1.85000000000000018e-133 < z < 13.5

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

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

   6. Taylor expanded in y around 0 81.4%

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

   7. Taylor expanded in z around 0 80.9%

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

      1. *-commutative 80.9%

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

   9. Simplified 80.9%

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

   if 13.5 < z

   1. Initial program 95.4%

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

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

Alternative 12: 86.0% accurate, 7.4× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -1.85e-133)
   (+ x (/ -1.0 x))
   (if (<= z 3.2) (- x (/ y -1.1283791670955126)) x)))

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if z < -1.85000000000000018e-133

   1. Initial program 89.8%

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

   3. Taylor expanded in y around inf 95.1%

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

   if -1.85000000000000018e-133 < z < 3.2000000000000002

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

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

   6. Taylor expanded in y around 0 81.4%

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

   7. Taylor expanded in z around 0 81.0%

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

   if 3.2000000000000002 < z

   1. Initial program 95.4%

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

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

Alternative 13: 68.4% 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.3%

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

3. Taylor expanded in x around inf 68.0%

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

4. Final simplification 68.0%

   \[\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 2024115 
(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)))))