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

Percentage Accurate: 95.0% → 99.9%

Time: 8.6s

Alternatives: 11

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

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x + (y / ((1.1283791670955126d0 * exp(z)) - (x * y)))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (exp.f64 z) < 0.0

   1. Initial program 88.7%

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

   3. Taylor expanded in y around inf 100.0%

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

   if 0.0 < (exp.f64 z)

   1. Initial program 98.8%

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

      1. remove-double-neg 98.8%

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

      2. distribute-frac-neg 98.8%

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

      3. unsub-neg 98.8%

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

      4. distribute-frac-neg 98.8%

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

      5. distribute-neg-frac2 98.8%

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

      6. neg-sub0 98.8%

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

      7. associate--r- 98.8%

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

      8. neg-sub0 98.8%

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

      9. +-commutative 98.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
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 99.3% 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 1:\\ \;\;\;\;x + \frac{y}{1.1283791670955126 + \left(z \cdot \left(1.1283791670955126 - z \cdot \left(z \cdot -0.18806319451591877 - 0.5641895835477563\right)\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) 1.0)
     (+
      x
      (/
       y
       (+
        1.1283791670955126
        (-
         (*
          z
          (-
           1.1283791670955126
           (* z (- (* z -0.18806319451591877) 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) <= 1.0) {
		tmp = x + (y / (1.1283791670955126 + ((z * (1.1283791670955126 - (z * ((z * -0.18806319451591877) - 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) <= 1.0d0) then
        tmp = x + (y / (1.1283791670955126d0 + ((z * (1.1283791670955126d0 - (z * ((z * (-0.18806319451591877d0)) - 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) <= 1.0) {
		tmp = x + (y / (1.1283791670955126 + ((z * (1.1283791670955126 - (z * ((z * -0.18806319451591877) - 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) <= 1.0:
		tmp = x + (y / (1.1283791670955126 + ((z * (1.1283791670955126 - (z * ((z * -0.18806319451591877) - 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) <= 1.0)
		tmp = Float64(x + Float64(y / Float64(1.1283791670955126 + Float64(Float64(z * Float64(1.1283791670955126 - Float64(z * Float64(Float64(z * -0.18806319451591877) - 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) <= 1.0)
		tmp = x + (y / (1.1283791670955126 + ((z * (1.1283791670955126 - (z * ((z * -0.18806319451591877) - 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], 1.0], N[(x + N[(y / N[(1.1283791670955126 + N[(N[(z * N[(1.1283791670955126 - N[(z * N[(N[(z * -0.18806319451591877), $MachinePrecision] - 0.5641895835477563), $MachinePrecision]), $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 88.7%

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

   1. Initial program 96.7%

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

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

Alternative 3: 98.3% accurate, 0.5× speedup

Math

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

   1. Initial program 88.7%

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

   3. Taylor expanded in y around inf 100.0%

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

   if 0.0 < (exp.f64 z)

   1. Initial program 98.8%

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

4. Final simplification 99.1%

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

Alternative 4: 70.6% accurate, 4.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -7 \cdot 10^{-5}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq -4.8 \cdot 10^{-197}:\\ \;\;\;\;\frac{-1}{x}\\ \mathbf{elif}\;x \leq 2.15 \cdot 10^{-196}:\\ \;\;\;\;y \cdot 0.8862269254527579\\ \mathbf{elif}\;x \leq 3.9 \cdot 10^{-94}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 10^{-36}:\\ \;\;\;\;\frac{-1}{x}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -7e-5)
   x
   (if (<= x -4.8e-197)
     (/ -1.0 x)
     (if (<= x 2.15e-196)
       (* y 0.8862269254527579)
       (if (<= x 3.9e-94) x (if (<= x 1e-36) (/ -1.0 x) x))))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -7e-5) {
		tmp = x;
	} else if (x <= -4.8e-197) {
		tmp = -1.0 / x;
	} else if (x <= 2.15e-196) {
		tmp = y * 0.8862269254527579;
	} else if (x <= 3.9e-94) {
		tmp = x;
	} else if (x <= 1e-36) {
		tmp = -1.0 / x;
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (x <= (-7d-5)) then
        tmp = x
    else if (x <= (-4.8d-197)) then
        tmp = (-1.0d0) / x
    else if (x <= 2.15d-196) then
        tmp = y * 0.8862269254527579d0
    else if (x <= 3.9d-94) then
        tmp = x
    else if (x <= 1d-36) then
        tmp = (-1.0d0) / x
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -7e-5) {
		tmp = x;
	} else if (x <= -4.8e-197) {
		tmp = -1.0 / x;
	} else if (x <= 2.15e-196) {
		tmp = y * 0.8862269254527579;
	} else if (x <= 3.9e-94) {
		tmp = x;
	} else if (x <= 1e-36) {
		tmp = -1.0 / x;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -7e-5:
		tmp = x
	elif x <= -4.8e-197:
		tmp = -1.0 / x
	elif x <= 2.15e-196:
		tmp = y * 0.8862269254527579
	elif x <= 3.9e-94:
		tmp = x
	elif x <= 1e-36:
		tmp = -1.0 / x
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -7e-5)
		tmp = x;
	elseif (x <= -4.8e-197)
		tmp = Float64(-1.0 / x);
	elseif (x <= 2.15e-196)
		tmp = Float64(y * 0.8862269254527579);
	elseif (x <= 3.9e-94)
		tmp = x;
	elseif (x <= 1e-36)
		tmp = Float64(-1.0 / x);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -7e-5)
		tmp = x;
	elseif (x <= -4.8e-197)
		tmp = -1.0 / x;
	elseif (x <= 2.15e-196)
		tmp = y * 0.8862269254527579;
	elseif (x <= 3.9e-94)
		tmp = x;
	elseif (x <= 1e-36)
		tmp = -1.0 / x;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -7e-5], x, If[LessEqual[x, -4.8e-197], N[(-1.0 / x), $MachinePrecision], If[LessEqual[x, 2.15e-196], N[(y * 0.8862269254527579), $MachinePrecision], If[LessEqual[x, 3.9e-94], x, If[LessEqual[x, 1e-36], N[(-1.0 / x), $MachinePrecision], x]]]]]

Derivation

1. Split input into 3 regimes

2. if x < -6.9999999999999994e-5 or 2.1499999999999999e-196 < x < 3.9000000000000002e-94 or 9.9999999999999994e-37 < x

   1. Initial program 97.9%

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

   3. Taylor expanded in x around inf 92.9%

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

   if -6.9999999999999994e-5 < x < -4.8000000000000002e-197 or 3.9000000000000002e-94 < x < 9.9999999999999994e-37

   1. Initial program 94.7%

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

   3. Taylor expanded in x around inf 55.8%

      \[\leadsto \color{blue}{x \cdot \left(1 - \frac{1}{{x}^{2}}\right)} \]

   4. Taylor expanded in x around 0 61.0%

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

   if -4.8000000000000002e-197 < x < 2.1499999999999999e-196

   1. Initial program 91.9%

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

      1. remove-double-neg 91.9%

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

      2. distribute-frac-neg 91.9%

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

      3. unsub-neg 91.9%

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

      4. distribute-frac-neg 91.9%

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

      5. distribute-neg-frac2 91.9%

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

      6. neg-sub0 91.8%

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

      7. associate--r- 91.8%

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

      8. neg-sub0 92.2%

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

      9. +-commutative 92.2%

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

      10. fma-define 92.2%

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

      11. *-commutative 92.2%

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

      12. distribute-rgt-neg-in 92.2%

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

      13. metadata-eval 92.2%

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

   3. Simplified 92.2%

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

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

   6. Taylor expanded in x around 0 56.2%

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

      1. *-commutative 56.2%

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

   8. Simplified 56.2%

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

Alternative 5: 98.6% accurate, 4.1× speedup

Math

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

   1. Initial program 88.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 -5.59999999999999999e26 < z < 5.39999999999999961e-12

   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.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 5.39999999999999961e-12 < z

   1. Initial program 96.7%

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

   3. Taylor expanded in x around inf 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 -5.6 \cdot 10^{+26}:\\ \;\;\;\;x - \frac{1}{x}\\ \mathbf{elif}\;z \leq 5.4 \cdot 10^{-12}:\\ \;\;\;\;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 6: 86.6% accurate, 4.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x - \frac{1}{x}\\ t_1 := x - \frac{y}{-1.1283791670955126}\\ \mathbf{if}\;z \leq -8.8 \cdot 10^{-40}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;z \leq 1.76 \cdot 10^{-128}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 1.6 \cdot 10^{-91}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;z \leq 2.1 \cdot 10^{-13}:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (- x (/ 1.0 x))) (t_1 (- x (/ y -1.1283791670955126))))
   (if (<= z -8.8e-40)
     t_0
     (if (<= z 1.76e-128)
       t_1
       (if (<= z 1.6e-91) t_0 (if (<= z 2.1e-13) t_1 x))))))

C

double code(double x, double y, double z) {
	double t_0 = x - (1.0 / x);
	double t_1 = x - (y / -1.1283791670955126);
	double tmp;
	if (z <= -8.8e-40) {
		tmp = t_0;
	} else if (z <= 1.76e-128) {
		tmp = t_1;
	} else if (z <= 1.6e-91) {
		tmp = t_0;
	} else if (z <= 2.1e-13) {
		tmp = t_1;
	} 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) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = x - (1.0d0 / x)
    t_1 = x - (y / (-1.1283791670955126d0))
    if (z <= (-8.8d-40)) then
        tmp = t_0
    else if (z <= 1.76d-128) then
        tmp = t_1
    else if (z <= 1.6d-91) then
        tmp = t_0
    else if (z <= 2.1d-13) then
        tmp = t_1
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = x - (1.0 / x);
	double t_1 = x - (y / -1.1283791670955126);
	double tmp;
	if (z <= -8.8e-40) {
		tmp = t_0;
	} else if (z <= 1.76e-128) {
		tmp = t_1;
	} else if (z <= 1.6e-91) {
		tmp = t_0;
	} else if (z <= 2.1e-13) {
		tmp = t_1;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = x - (1.0 / x)
	t_1 = x - (y / -1.1283791670955126)
	tmp = 0
	if z <= -8.8e-40:
		tmp = t_0
	elif z <= 1.76e-128:
		tmp = t_1
	elif z <= 1.6e-91:
		tmp = t_0
	elif z <= 2.1e-13:
		tmp = t_1
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(x - Float64(1.0 / x))
	t_1 = Float64(x - Float64(y / -1.1283791670955126))
	tmp = 0.0
	if (z <= -8.8e-40)
		tmp = t_0;
	elseif (z <= 1.76e-128)
		tmp = t_1;
	elseif (z <= 1.6e-91)
		tmp = t_0;
	elseif (z <= 2.1e-13)
		tmp = t_1;
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = x - (1.0 / x);
	t_1 = x - (y / -1.1283791670955126);
	tmp = 0.0;
	if (z <= -8.8e-40)
		tmp = t_0;
	elseif (z <= 1.76e-128)
		tmp = t_1;
	elseif (z <= 1.6e-91)
		tmp = t_0;
	elseif (z <= 2.1e-13)
		tmp = t_1;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(x - N[(1.0 / x), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(x - N[(y / -1.1283791670955126), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -8.8e-40], t$95$0, If[LessEqual[z, 1.76e-128], t$95$1, If[LessEqual[z, 1.6e-91], t$95$0, If[LessEqual[z, 2.1e-13], t$95$1, x]]]]]]

Derivation

1. Split input into 3 regimes

2. if z < -8.80000000000000036e-40 or 1.76000000000000002e-128 < z < 1.59999999999999998e-91

   1. Initial program 90.8%

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

   3. Taylor expanded in y around inf 98.9%

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

   if -8.80000000000000036e-40 < z < 1.76000000000000002e-128 or 1.59999999999999998e-91 < z < 2.09999999999999989e-13

   1. Initial program 99.7%

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

      1. remove-double-neg 99.7%

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

      2. distribute-frac-neg 99.7%

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

      3. unsub-neg 99.7%

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

      4. distribute-frac-neg 99.7%

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

      5. distribute-neg-frac2 99.7%

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

      6. neg-sub0 99.7%

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

      7. associate--r- 99.7%

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

      8. neg-sub0 99.7%

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

      9. +-commutative 99.7%

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

      10. fma-define 99.7%

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

      11. *-commutative 99.7%

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

      12. distribute-rgt-neg-in 99.7%

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

      13. metadata-eval 99.7%

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

   3. Simplified 99.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 99.7%

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

   6. Taylor expanded in x around 0 77.7%

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

   if 2.09999999999999989e-13 < z

   1. Initial program 96.7%

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

   3. Taylor expanded in x around inf 100.0%

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

Alternative 7: 98.6% accurate, 4.8× speedup

Math

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

C

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

   1. Initial program 88.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 -5.59999999999999999e26 < z < 5.39999999999999961e-12

   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}} \]

   if 5.39999999999999961e-12 < z

   1. Initial program 96.7%

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

   3. Taylor expanded in x around inf 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 -5.6 \cdot 10^{+26}:\\ \;\;\;\;x - \frac{1}{x}\\ \mathbf{elif}\;z \leq 5.4 \cdot 10^{-12}:\\ \;\;\;\;x + \frac{y}{1.1283791670955126 - \left(x \cdot y + z \cdot -1.1283791670955126\right)}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 98.5% accurate, 5.8× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -5.6e+26)
   (- x (/ 1.0 x))
   (if (<= z 5.4e-12) (+ x (/ y (- 1.1283791670955126 (* x y)))) x)))

C

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

Python

def code(x, y, z):
	tmp = 0
	if z <= -5.6e+26:
		tmp = x - (1.0 / x)
	elif z <= 5.4e-12:
		tmp = x + (y / (1.1283791670955126 - (x * y)))
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -5.6e+26)
		tmp = Float64(x - Float64(1.0 / x));
	elseif (z <= 5.4e-12)
		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 <= -5.6e+26)
		tmp = x - (1.0 / x);
	elseif (z <= 5.4e-12)
		tmp = x + (y / (1.1283791670955126 - (x * y)));
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -5.6e+26], N[(x - N[(1.0 / x), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 5.4e-12], 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 < -5.59999999999999999e26

   1. Initial program 88.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 -5.59999999999999999e26 < z < 5.39999999999999961e-12

   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 5.39999999999999961e-12 < z

   1. Initial program 96.7%

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

   3. Taylor expanded in x around inf 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 -5.6 \cdot 10^{+26}:\\ \;\;\;\;x - \frac{1}{x}\\ \mathbf{elif}\;z \leq 5.4 \cdot 10^{-12}:\\ \;\;\;\;x + \frac{y}{1.1283791670955126 - x \cdot y}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 79.7% accurate, 8.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq 10^{-281}:\\ \;\;\;\;x - \frac{1}{x}\\ \mathbf{elif}\;z \leq 1.05 \cdot 10^{-211}:\\ \;\;\;\;y \cdot 0.8862269254527579\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z 1e-281)
   (- x (/ 1.0 x))
   (if (<= z 1.05e-211) (* y 0.8862269254527579) x)))

C

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

Python

def code(x, y, z):
	tmp = 0
	if z <= 1e-281:
		tmp = x - (1.0 / x)
	elif z <= 1.05e-211:
		tmp = y * 0.8862269254527579
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= 1e-281)
		tmp = Float64(x - Float64(1.0 / x));
	elseif (z <= 1.05e-211)
		tmp = Float64(y * 0.8862269254527579);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= 1e-281)
		tmp = x - (1.0 / x);
	elseif (z <= 1.05e-211)
		tmp = y * 0.8862269254527579;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, 1e-281], N[(x - N[(1.0 / x), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.05e-211], N[(y * 0.8862269254527579), $MachinePrecision], x]]

Derivation

1. Split input into 3 regimes

2. if z < 1e-281

   1. Initial program 93.9%

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

   3. Taylor expanded in y around inf 83.1%

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

   if 1e-281 < z < 1.05000000000000004e-211

   1. Initial program 99.6%

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

      1. remove-double-neg 99.6%

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

      2. distribute-frac-neg 99.6%

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

      3. unsub-neg 99.6%

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

      4. distribute-frac-neg 99.6%

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

      5. distribute-neg-frac2 99.6%

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

      6. neg-sub0 99.6%

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

      7. associate--r- 99.6%

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

      8. neg-sub0 99.6%

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

      9. +-commutative 99.6%

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

      10. fma-define 99.6%

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

      11. *-commutative 99.6%

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

      12. distribute-rgt-neg-in 99.6%

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

      13. metadata-eval 99.6%

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

   3. Simplified 99.6%

      \[\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 - \color{blue}{\frac{y}{x \cdot y - 1.1283791670955126}} \]

   6. Taylor expanded in x around 0 67.7%

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

      1. *-commutative 67.7%

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

   8. Simplified 67.7%

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

   if 1.05000000000000004e-211 < z

   1. Initial program 98.1%

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

   3. Taylor expanded in x around inf 86.6%

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

Alternative 10: 69.8% accurate, 8.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.25 \cdot 10^{-196}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 2.2 \cdot 10^{-195}:\\ \;\;\;\;y \cdot 0.8862269254527579\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -1.25e-196) x (if (<= x 2.2e-195) (* y 0.8862269254527579) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -1.25e-196) {
		tmp = x;
	} else if (x <= 2.2e-195) {
		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 <= (-1.25d-196)) then
        tmp = x
    else if (x <= 2.2d-195) 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 <= -1.25e-196) {
		tmp = x;
	} else if (x <= 2.2e-195) {
		tmp = y * 0.8862269254527579;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -1.25e-196:
		tmp = x
	elif x <= 2.2e-195:
		tmp = y * 0.8862269254527579
	else:
		tmp = x
	return tmp

Julia

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

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -1.25e-196], x, If[LessEqual[x, 2.2e-195], N[(y * 0.8862269254527579), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if x < -1.2500000000000001e-196 or 2.20000000000000005e-195 < x

   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 75.5%

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

   if -1.2500000000000001e-196 < x < 2.20000000000000005e-195

   1. Initial program 91.9%

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

      1. remove-double-neg 91.9%

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

      2. distribute-frac-neg 91.9%

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

      3. unsub-neg 91.9%

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

      4. distribute-frac-neg 91.9%

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

      5. distribute-neg-frac2 91.9%

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

      6. neg-sub0 91.8%

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

      7. associate--r- 91.8%

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

      8. neg-sub0 92.2%

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

      9. +-commutative 92.2%

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

      10. fma-define 92.2%

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

      11. *-commutative 92.2%

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

      12. distribute-rgt-neg-in 92.2%

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

      13. metadata-eval 92.2%

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

   3. Simplified 92.2%

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

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

   6. Taylor expanded in x around 0 56.2%

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

      1. *-commutative 56.2%

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

   8. Simplified 56.2%

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

Alternative 11: 68.2% 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 96.0%

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

3. Taylor expanded in x around inf 64.9%

   \[\leadsto \color{blue}{x} \]
4. 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 2024100 
(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)))))