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

Percentage Accurate: 95.6% → 99.4%

Time: 11.9s

Alternatives: 14

Speedup: 0.5×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 95.6% 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.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{y}{1.1283791670955126 - x \cdot y}\\ \mathbf{else}:\\ \;\;\;\;x + \frac{y}{e^{z} \cdot 1.1283791670955126}\\ \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 (* x y))))
     (+ 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 if (exp(z) <= 1.0) {
		tmp = x + (y / (1.1283791670955126 - (x * y)));
	} else {
		tmp = x + (y / (exp(z) * 1.1283791670955126));
	}
	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 - (x * y)))
    else
        tmp = x + (y / (exp(z) * 1.1283791670955126d0))
    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 - (x * y)));
	} else {
		tmp = x + (y / (Math.exp(z) * 1.1283791670955126));
	}
	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 - (x * y)))
	else:
		tmp = x + (y / (math.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));
	elseif (exp(z) <= 1.0)
		tmp = Float64(x + Float64(y / Float64(1.1283791670955126 - Float64(x * y))));
	else
		tmp = Float64(x + Float64(y / Float64(exp(z) * 1.1283791670955126)));
	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 - (x * y)));
	else
		tmp = x + (y / (exp(z) * 1.1283791670955126));
	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[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x + N[(y / N[(N[Exp[z], $MachinePrecision] * 1.1283791670955126), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if (exp.f64 z) < 0.0

   1. Initial program 90.5%

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

   3. Taylor expanded in y around inf

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

      1. sub-neg N/A

         \[\leadsto \color{blue}{x + \left(\mathsf{neg}\left(\frac{1}{x}\right)\right)} \]

      2. +-lowering-+.f64 N/A

         \[\leadsto \color{blue}{x + \left(\mathsf{neg}\left(\frac{1}{x}\right)\right)} \]

      3. distribute-neg-frac N/A

         \[\leadsto x + \color{blue}{\frac{\mathsf{neg}\left(1\right)}{x}} \]

      4. metadata-eval N/A

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

      5. /-lowering-/.f64 100.0

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

   5. Simplified 100.0%

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

   if 0.0 < (exp.f64 z) < 1

   1. Initial program 99.9%

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

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{x + \frac{y}{\frac{5641895835477563}{5000000000000000} - x \cdot y}} \]
   4. Step-by-step derivation

      1. +-lowering-+.f64 N/A

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

      2. /-lowering-/.f64 N/A

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

      3. --lowering--.f64 N/A

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

      4. *-commutative N/A

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

      5. *-lowering-*.f64 99.9

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

   5. Simplified 99.9%

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

   if 1 < (exp.f64 z)

   1. Initial program 89.3%

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

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. *-lowering-*.f64 N/A

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

      3. exp-lowering-exp.f64 100.0

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

   5. Simplified 100.0%

      \[\leadsto x + \frac{y}{\color{blue}{e^{z} \cdot 1.1283791670955126}} \]
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{y}{1.1283791670955126 - x \cdot y}\\ \mathbf{else}:\\ \;\;\;\;x + \frac{y}{e^{z} \cdot 1.1283791670955126}\\ \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{y}{1.1283791670955126 - x \cdot y}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(e^{0 - z}, y \cdot 0.8862269254527579, x\right)\\ \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 (* x y))))
     (fma (exp (- 0.0 z)) (* y 0.8862269254527579) 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 - (x * y)));
	} else {
		tmp = fma(exp((0.0 - z)), (y * 0.8862269254527579), 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(x * y))));
	else
		tmp = fma(exp(Float64(0.0 - z)), Float64(y * 0.8862269254527579), x);
	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], If[LessEqual[N[Exp[z], $MachinePrecision], 1.0], N[(x + N[(y / N[(1.1283791670955126 - N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Exp[N[(0.0 - z), $MachinePrecision]], $MachinePrecision] * N[(y * 0.8862269254527579), $MachinePrecision] + x), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if (exp.f64 z) < 0.0

   1. Initial program 90.5%

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

   3. Taylor expanded in y around inf

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

      1. sub-neg N/A

         \[\leadsto \color{blue}{x + \left(\mathsf{neg}\left(\frac{1}{x}\right)\right)} \]

      2. +-lowering-+.f64 N/A

         \[\leadsto \color{blue}{x + \left(\mathsf{neg}\left(\frac{1}{x}\right)\right)} \]

      3. distribute-neg-frac N/A

         \[\leadsto x + \color{blue}{\frac{\mathsf{neg}\left(1\right)}{x}} \]

      4. metadata-eval N/A

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

      5. /-lowering-/.f64 100.0

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

   5. Simplified 100.0%

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

   if 0.0 < (exp.f64 z) < 1

   1. Initial program 99.9%

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

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{x + \frac{y}{\frac{5641895835477563}{5000000000000000} - x \cdot y}} \]
   4. Step-by-step derivation

      1. +-lowering-+.f64 N/A

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

      2. /-lowering-/.f64 N/A

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

      3. --lowering--.f64 N/A

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

      4. *-commutative N/A

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

      5. *-lowering-*.f64 99.9

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

   5. Simplified 99.9%

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

   if 1 < (exp.f64 z)

   1. Initial program 89.3%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-lft-identity N/A

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

      3. associate-*l/ N/A

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

      4. associate-*l* N/A

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

      5. *-commutative N/A

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

      6. associate-*l* N/A

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

      7. accelerator-lowering-fma.f64 N/A

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

      8. rec-exp N/A

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

      9. neg-mul-1 N/A

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

      10. exp-lowering-exp.f64 N/A

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

      11. neg-mul-1 N/A

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

      12. neg-sub0 N/A

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

      13. --lowering--.f64 N/A

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

      14. *-lowering-*.f64 100.0

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

   5. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(e^{0 - z}, 0.8862269254527579 \cdot y, x\right)} \]
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{y}{1.1283791670955126 - x \cdot y}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(e^{0 - z}, y \cdot 0.8862269254527579, x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 87.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x + \frac{-1}{x}\\ t_1 := x + \frac{y}{e^{z} \cdot 1.1283791670955126 - x \cdot y}\\ \mathbf{if}\;t\_1 \leq -100000:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;t\_1 \leq 4:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (+ x (/ -1.0 x)))
        (t_1 (+ x (/ y (- (* (exp z) 1.1283791670955126) (* x y))))))
   (if (<= t_1 -100000.0) t_0 (if (<= t_1 4.0) x t_0))))

C

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

Python

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

Julia

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

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = x + (-1.0 / x);
	t_1 = x + (y / ((exp(z) * 1.1283791670955126) - (x * y)));
	tmp = 0.0;
	if (t_1 <= -100000.0)
		tmp = t_0;
	elseif (t_1 <= 4.0)
		tmp = x;
	else
		tmp = t_0;
	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 / N[(N[(N[Exp[z], $MachinePrecision] * 1.1283791670955126), $MachinePrecision] - N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -100000.0], t$95$0, If[LessEqual[t$95$1, 4.0], x, t$95$0]]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 x (/.f64 y (-.f64 (*.f64 #s(literal 5641895835477563/5000000000000000 binary64) (exp.f64 z)) (*.f64 x y)))) < -1e5 or 4 < (+.f64 x (/.f64 y (-.f64 (*.f64 #s(literal 5641895835477563/5000000000000000 binary64) (exp.f64 z)) (*.f64 x y))))

   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

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

      1. sub-neg N/A

         \[\leadsto \color{blue}{x + \left(\mathsf{neg}\left(\frac{1}{x}\right)\right)} \]

      2. +-lowering-+.f64 N/A

         \[\leadsto \color{blue}{x + \left(\mathsf{neg}\left(\frac{1}{x}\right)\right)} \]

      3. distribute-neg-frac N/A

         \[\leadsto x + \color{blue}{\frac{\mathsf{neg}\left(1\right)}{x}} \]

      4. metadata-eval N/A

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

      5. /-lowering-/.f64 91.0

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

   5. Simplified 91.0%

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

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

   1. Initial program 99.8%

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

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x} \]
   4. Step-by-step derivation

   5. Simplified 76.5%

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

4. Final simplification 88.1%

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

Alternative 4: 98.6% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 98.5%

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

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

   1. Initial program 40.7%

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

   3. Taylor expanded in y around inf

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

      1. sub-neg N/A

         \[\leadsto \color{blue}{x + \left(\mathsf{neg}\left(\frac{1}{x}\right)\right)} \]

      2. +-lowering-+.f64 N/A

         \[\leadsto \color{blue}{x + \left(\mathsf{neg}\left(\frac{1}{x}\right)\right)} \]

      3. distribute-neg-frac N/A

         \[\leadsto x + \color{blue}{\frac{\mathsf{neg}\left(1\right)}{x}} \]

      4. metadata-eval N/A

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

      5. /-lowering-/.f64 100.0

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

   5. Simplified 100.0%

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

4. Final simplification 98.6%

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

Alternative 5: 99.8% 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 1000000:\\ \;\;\;\;x + \frac{y}{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, 0.18806319451591877, 0.5641895835477563\right), 1.1283791670955126\right), 1.1283791670955126 - 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) 1000000.0)
     (+
      x
      (/
       y
       (fma
        z
        (fma
         z
         (fma z 0.18806319451591877 0.5641895835477563)
         1.1283791670955126)
        (- 1.1283791670955126 (* 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) <= 1000000.0) {
		tmp = x + (y / fma(z, fma(z, fma(z, 0.18806319451591877, 0.5641895835477563), 1.1283791670955126), (1.1283791670955126 - (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) <= 1000000.0)
		tmp = Float64(x + Float64(y / fma(z, fma(z, fma(z, 0.18806319451591877, 0.5641895835477563), 1.1283791670955126), Float64(1.1283791670955126 - Float64(x * y)))));
	else
		tmp = x;
	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], If[LessEqual[N[Exp[z], $MachinePrecision], 1000000.0], N[(x + N[(y / N[(z * N[(z * N[(z * 0.18806319451591877 + 0.5641895835477563), $MachinePrecision] + 1.1283791670955126), $MachinePrecision] + N[(1.1283791670955126 - 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 90.5%

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

   3. Taylor expanded in y around inf

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

      1. sub-neg N/A

         \[\leadsto \color{blue}{x + \left(\mathsf{neg}\left(\frac{1}{x}\right)\right)} \]

      2. +-lowering-+.f64 N/A

         \[\leadsto \color{blue}{x + \left(\mathsf{neg}\left(\frac{1}{x}\right)\right)} \]

      3. distribute-neg-frac N/A

         \[\leadsto x + \color{blue}{\frac{\mathsf{neg}\left(1\right)}{x}} \]

      4. metadata-eval N/A

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

      5. /-lowering-/.f64 100.0

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

   5. Simplified 100.0%

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

   if 0.0 < (exp.f64 z) < 1e6

   1. Initial program 99.9%

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

   3. Taylor expanded in z around 0

      \[\leadsto x + \frac{y}{\color{blue}{\left(\frac{5641895835477563}{5000000000000000} + z \cdot \left(\frac{5641895835477563}{5000000000000000} + z \cdot \left(\frac{5641895835477563}{10000000000000000} + \frac{5641895835477563}{30000000000000000} \cdot z\right)\right)\right) - x \cdot y}} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto x + \frac{y}{\color{blue}{\left(z \cdot \left(\frac{5641895835477563}{5000000000000000} + z \cdot \left(\frac{5641895835477563}{10000000000000000} + \frac{5641895835477563}{30000000000000000} \cdot z\right)\right) + \frac{5641895835477563}{5000000000000000}\right)} - x \cdot y} \]

      2. associate--l+ N/A

         \[\leadsto x + \frac{y}{\color{blue}{z \cdot \left(\frac{5641895835477563}{5000000000000000} + z \cdot \left(\frac{5641895835477563}{10000000000000000} + \frac{5641895835477563}{30000000000000000} \cdot z\right)\right) + \left(\frac{5641895835477563}{5000000000000000} - x \cdot y\right)}} \]

      3. accelerator-lowering-fma.f64 N/A

         \[\leadsto x + \frac{y}{\color{blue}{\mathsf{fma}\left(z, \frac{5641895835477563}{5000000000000000} + z \cdot \left(\frac{5641895835477563}{10000000000000000} + \frac{5641895835477563}{30000000000000000} \cdot z\right), \frac{5641895835477563}{5000000000000000} - x \cdot y\right)}} \]

      4. +-commutative N/A

         \[\leadsto x + \frac{y}{\mathsf{fma}\left(z, \color{blue}{z \cdot \left(\frac{5641895835477563}{10000000000000000} + \frac{5641895835477563}{30000000000000000} \cdot z\right) + \frac{5641895835477563}{5000000000000000}}, \frac{5641895835477563}{5000000000000000} - x \cdot y\right)} \]

      5. accelerator-lowering-fma.f64 N/A

         \[\leadsto x + \frac{y}{\mathsf{fma}\left(z, \color{blue}{\mathsf{fma}\left(z, \frac{5641895835477563}{10000000000000000} + \frac{5641895835477563}{30000000000000000} \cdot z, \frac{5641895835477563}{5000000000000000}\right)}, \frac{5641895835477563}{5000000000000000} - x \cdot y\right)} \]

      6. +-commutative N/A

         \[\leadsto x + \frac{y}{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \color{blue}{\frac{5641895835477563}{30000000000000000} \cdot z + \frac{5641895835477563}{10000000000000000}}, \frac{5641895835477563}{5000000000000000}\right), \frac{5641895835477563}{5000000000000000} - x \cdot y\right)} \]

      7. *-commutative N/A

         \[\leadsto x + \frac{y}{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \color{blue}{z \cdot \frac{5641895835477563}{30000000000000000}} + \frac{5641895835477563}{10000000000000000}, \frac{5641895835477563}{5000000000000000}\right), \frac{5641895835477563}{5000000000000000} - x \cdot y\right)} \]

      8. accelerator-lowering-fma.f64 N/A

         \[\leadsto x + \frac{y}{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \color{blue}{\mathsf{fma}\left(z, \frac{5641895835477563}{30000000000000000}, \frac{5641895835477563}{10000000000000000}\right)}, \frac{5641895835477563}{5000000000000000}\right), \frac{5641895835477563}{5000000000000000} - x \cdot y\right)} \]

      9. --lowering--.f64 N/A

         \[\leadsto x + \frac{y}{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, \frac{5641895835477563}{30000000000000000}, \frac{5641895835477563}{10000000000000000}\right), \frac{5641895835477563}{5000000000000000}\right), \color{blue}{\frac{5641895835477563}{5000000000000000} - x \cdot y}\right)} \]

      10. *-commutative N/A

          \[\leadsto x + \frac{y}{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, \frac{5641895835477563}{30000000000000000}, \frac{5641895835477563}{10000000000000000}\right), \frac{5641895835477563}{5000000000000000}\right), \frac{5641895835477563}{5000000000000000} - \color{blue}{y \cdot x}\right)} \]

      11. *-lowering-*.f64 99.2

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

   5. Simplified 99.2%

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

   if 1e6 < (exp.f64 z)

   1. Initial program 88.9%

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

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x} \]
   4. Step-by-step derivation

   5. Simplified 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 1000000:\\ \;\;\;\;x + \frac{y}{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, 0.18806319451591877, 0.5641895835477563\right), 1.1283791670955126\right), 1.1283791670955126 - x \cdot y\right)}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 99.8% 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 1000000:\\ \;\;\;\;x + \frac{y}{\mathsf{fma}\left(z, \mathsf{fma}\left(z, 0.5641895835477563, 1.1283791670955126\right), 1.1283791670955126\right) - x \cdot y}\\ \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) 1000000.0)
     (+
      x
      (/
       y
       (-
        (fma
         z
         (fma z 0.5641895835477563 1.1283791670955126)
         1.1283791670955126)
        (* 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) <= 1000000.0) {
		tmp = x + (y / (fma(z, fma(z, 0.5641895835477563, 1.1283791670955126), 1.1283791670955126) - (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) <= 1000000.0)
		tmp = Float64(x + Float64(y / Float64(fma(z, fma(z, 0.5641895835477563, 1.1283791670955126), 1.1283791670955126) - Float64(x * y))));
	else
		tmp = x;
	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], If[LessEqual[N[Exp[z], $MachinePrecision], 1000000.0], N[(x + N[(y / N[(N[(z * N[(z * 0.5641895835477563 + 1.1283791670955126), $MachinePrecision] + 1.1283791670955126), $MachinePrecision] - N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], x]]

Derivation

1. Split input into 3 regimes

2. if (exp.f64 z) < 0.0

   1. Initial program 90.5%

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

   3. Taylor expanded in y around inf

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

      1. sub-neg N/A

         \[\leadsto \color{blue}{x + \left(\mathsf{neg}\left(\frac{1}{x}\right)\right)} \]

      2. +-lowering-+.f64 N/A

         \[\leadsto \color{blue}{x + \left(\mathsf{neg}\left(\frac{1}{x}\right)\right)} \]

      3. distribute-neg-frac N/A

         \[\leadsto x + \color{blue}{\frac{\mathsf{neg}\left(1\right)}{x}} \]

      4. metadata-eval N/A

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

      5. /-lowering-/.f64 100.0

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

   5. Simplified 100.0%

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

   if 0.0 < (exp.f64 z) < 1e6

   1. Initial program 99.9%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. accelerator-lowering-fma.f64 N/A

         \[\leadsto x + \frac{y}{\color{blue}{\mathsf{fma}\left(z, \frac{5641895835477563}{5000000000000000} + \frac{5641895835477563}{10000000000000000} \cdot z, \frac{5641895835477563}{5000000000000000}\right)} - x \cdot y} \]

      3. +-commutative N/A

         \[\leadsto x + \frac{y}{\mathsf{fma}\left(z, \color{blue}{\frac{5641895835477563}{10000000000000000} \cdot z + \frac{5641895835477563}{5000000000000000}}, \frac{5641895835477563}{5000000000000000}\right) - x \cdot y} \]

      4. *-commutative N/A

         \[\leadsto x + \frac{y}{\mathsf{fma}\left(z, \color{blue}{z \cdot \frac{5641895835477563}{10000000000000000}} + \frac{5641895835477563}{5000000000000000}, \frac{5641895835477563}{5000000000000000}\right) - x \cdot y} \]

      5. accelerator-lowering-fma.f64 99.2

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

   5. Simplified 99.2%

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

   if 1e6 < (exp.f64 z)

   1. Initial program 88.9%

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

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x} \]
   4. Step-by-step derivation

   5. Simplified 100.0%

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

Alternative 7: 99.7% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;e^{z} \leq 0:\\ \;\;\;\;x + \frac{-1}{x}\\ \mathbf{elif}\;e^{z} \leq 1000000:\\ \;\;\;\;x + \frac{y}{\mathsf{fma}\left(z, 1.1283791670955126, 1.1283791670955126\right) - x \cdot y}\\ \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) 1000000.0)
     (+ x (/ y (- (fma z 1.1283791670955126 1.1283791670955126) (* 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) <= 1000000.0) {
		tmp = x + (y / (fma(z, 1.1283791670955126, 1.1283791670955126) - (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) <= 1000000.0)
		tmp = Float64(x + Float64(y / Float64(fma(z, 1.1283791670955126, 1.1283791670955126) - Float64(x * y))));
	else
		tmp = x;
	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], If[LessEqual[N[Exp[z], $MachinePrecision], 1000000.0], N[(x + N[(y / N[(N[(z * 1.1283791670955126 + 1.1283791670955126), $MachinePrecision] - N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], x]]

Derivation

1. Split input into 3 regimes

2. if (exp.f64 z) < 0.0

   1. Initial program 90.5%

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

   3. Taylor expanded in y around inf

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

      1. sub-neg N/A

         \[\leadsto \color{blue}{x + \left(\mathsf{neg}\left(\frac{1}{x}\right)\right)} \]

      2. +-lowering-+.f64 N/A

         \[\leadsto \color{blue}{x + \left(\mathsf{neg}\left(\frac{1}{x}\right)\right)} \]

      3. distribute-neg-frac N/A

         \[\leadsto x + \color{blue}{\frac{\mathsf{neg}\left(1\right)}{x}} \]

      4. metadata-eval N/A

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

      5. /-lowering-/.f64 100.0

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

   5. Simplified 100.0%

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

   if 0.0 < (exp.f64 z) < 1e6

   1. Initial program 99.9%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. accelerator-lowering-fma.f64 99.2

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

   5. Simplified 99.2%

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

   if 1e6 < (exp.f64 z)

   1. Initial program 88.9%

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

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x} \]
   4. Step-by-step derivation

   5. Simplified 100.0%

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

Alternative 8: 99.6% 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 1000000:\\ \;\;\;\;x + \frac{y}{1.1283791670955126 - x \cdot y}\\ \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) 1000000.0) (+ x (/ y (- 1.1283791670955126 (* 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) <= 1000000.0) {
		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 (exp(z) <= 0.0d0) then
        tmp = x + ((-1.0d0) / x)
    else if (exp(z) <= 1000000.0d0) 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 (Math.exp(z) <= 0.0) {
		tmp = x + (-1.0 / x);
	} else if (Math.exp(z) <= 1000000.0) {
		tmp = x + (y / (1.1283791670955126 - (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) <= 1000000.0:
		tmp = x + (y / (1.1283791670955126 - (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) <= 1000000.0)
		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 (exp(z) <= 0.0)
		tmp = x + (-1.0 / x);
	elseif (exp(z) <= 1000000.0)
		tmp = x + (y / (1.1283791670955126 - (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], 1000000.0], N[(x + N[(y / N[(1.1283791670955126 - N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], x]]

Derivation

1. Split input into 3 regimes

2. if (exp.f64 z) < 0.0

   1. Initial program 90.5%

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

   3. Taylor expanded in y around inf

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

      1. sub-neg N/A

         \[\leadsto \color{blue}{x + \left(\mathsf{neg}\left(\frac{1}{x}\right)\right)} \]

      2. +-lowering-+.f64 N/A

         \[\leadsto \color{blue}{x + \left(\mathsf{neg}\left(\frac{1}{x}\right)\right)} \]

      3. distribute-neg-frac N/A

         \[\leadsto x + \color{blue}{\frac{\mathsf{neg}\left(1\right)}{x}} \]

      4. metadata-eval N/A

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

      5. /-lowering-/.f64 100.0

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

   5. Simplified 100.0%

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

   if 0.0 < (exp.f64 z) < 1e6

   1. Initial program 99.9%

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

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{x + \frac{y}{\frac{5641895835477563}{5000000000000000} - x \cdot y}} \]
   4. Step-by-step derivation

      1. +-lowering-+.f64 N/A

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

      2. /-lowering-/.f64 N/A

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

      3. --lowering--.f64 N/A

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

      4. *-commutative N/A

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

      5. *-lowering-*.f64 99.2

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

   5. Simplified 99.2%

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

   if 1e6 < (exp.f64 z)

   1. Initial program 88.9%

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

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x} \]
   4. Step-by-step derivation

   5. Simplified 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 1000000:\\ \;\;\;\;x + \frac{y}{1.1283791670955126 - x \cdot y}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 99.9% accurate, 0.5× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	double tmp;
	if (exp(z) <= 0.0) {
		tmp = x + (-1.0 / x);
	} else {
		tmp = fma((-1.0 / fma(x, y, (exp(z) * -1.1283791670955126))), y, x);
	}
	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 = fma(Float64(-1.0 / fma(x, y, Float64(exp(z) * -1.1283791670955126))), y, x);
	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[(N[(-1.0 / N[(x * y + N[(N[Exp[z], $MachinePrecision] * -1.1283791670955126), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * y + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (exp.f64 z) < 0.0

   1. Initial program 90.5%

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

   3. Taylor expanded in y around inf

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

      1. sub-neg N/A

         \[\leadsto \color{blue}{x + \left(\mathsf{neg}\left(\frac{1}{x}\right)\right)} \]

      2. +-lowering-+.f64 N/A

         \[\leadsto \color{blue}{x + \left(\mathsf{neg}\left(\frac{1}{x}\right)\right)} \]

      3. distribute-neg-frac N/A

         \[\leadsto x + \color{blue}{\frac{\mathsf{neg}\left(1\right)}{x}} \]

      4. metadata-eval N/A

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

      5. /-lowering-/.f64 100.0

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

   5. Simplified 100.0%

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

   if 0.0 < (exp.f64 z)

   1. Initial program 96.7%

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

      1. +-commutative N/A

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

      2. *-lft-identity N/A

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

      3. associate-*l/ N/A

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

      4. flip-- N/A

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

      5. clear-num N/A

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

      6. accelerator-lowering-fma.f64 N/A

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

   4. Applied egg-rr 99.9%

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

Alternative 10: 99.6% 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 1000000:\\ \;\;\;\;x - \frac{y}{\mathsf{fma}\left(y, x, -1.1283791670955126\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) 1000000.0) (- x (/ y (fma y x -1.1283791670955126))) 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) <= 1000000.0) {
		tmp = x - (y / fma(y, x, -1.1283791670955126));
	} 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) <= 1000000.0)
		tmp = Float64(x - Float64(y / fma(y, x, -1.1283791670955126)));
	else
		tmp = x;
	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], If[LessEqual[N[Exp[z], $MachinePrecision], 1000000.0], N[(x - N[(y / N[(y * x + -1.1283791670955126), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], x]]

Derivation

1. Split input into 3 regimes

2. if (exp.f64 z) < 0.0

   1. Initial program 90.5%

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

   3. Taylor expanded in y around inf

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

      1. sub-neg N/A

         \[\leadsto \color{blue}{x + \left(\mathsf{neg}\left(\frac{1}{x}\right)\right)} \]

      2. +-lowering-+.f64 N/A

         \[\leadsto \color{blue}{x + \left(\mathsf{neg}\left(\frac{1}{x}\right)\right)} \]

      3. distribute-neg-frac N/A

         \[\leadsto x + \color{blue}{\frac{\mathsf{neg}\left(1\right)}{x}} \]

      4. metadata-eval N/A

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

      5. /-lowering-/.f64 100.0

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

   5. Simplified 100.0%

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

   if 0.0 < (exp.f64 z) < 1e6

   1. Initial program 99.9%

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

      1. +-commutative N/A

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

      2. *-lft-identity N/A

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

      3. associate-*l/ N/A

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

      4. flip-- N/A

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

      5. clear-num N/A

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

      6. accelerator-lowering-fma.f64 N/A

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

   4. Applied egg-rr 99.8%

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

   5. Taylor expanded in z around 0

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

      1. mul-1-neg N/A

         \[\leadsto x + \color{blue}{\left(\mathsf{neg}\left(\frac{y}{x \cdot y - \frac{5641895835477563}{5000000000000000}}\right)\right)} \]

      2. unsub-neg N/A

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

      3. --lowering--.f64 N/A

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

      4. /-lowering-/.f64 N/A

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

      5. sub-neg N/A

         \[\leadsto x - \frac{y}{\color{blue}{x \cdot y + \left(\mathsf{neg}\left(\frac{5641895835477563}{5000000000000000}\right)\right)}} \]

      6. *-commutative N/A

         \[\leadsto x - \frac{y}{\color{blue}{y \cdot x} + \left(\mathsf{neg}\left(\frac{5641895835477563}{5000000000000000}\right)\right)} \]

      7. metadata-eval N/A

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

      8. accelerator-lowering-fma.f64 99.2

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

   7. Simplified 99.2%

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

   if 1e6 < (exp.f64 z)

   1. Initial program 88.9%

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

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x} \]
   4. Step-by-step derivation

   5. Simplified 100.0%

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

Alternative 11: 72.4% accurate, 4.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -4.4 \cdot 10^{-150}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 9 \cdot 10^{-49}:\\ \;\;\;\;\mathsf{fma}\left(0.8862269254527579, y, x\right)\\ \mathbf{elif}\;x \leq 0.00021:\\ \;\;\;\;\frac{-1}{x}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -4.4e-150)
   x
   (if (<= x 9e-49)
     (fma 0.8862269254527579 y x)
     (if (<= x 0.00021) (/ -1.0 x) x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -4.4e-150) {
		tmp = x;
	} else if (x <= 9e-49) {
		tmp = fma(0.8862269254527579, y, x);
	} else if (x <= 0.00021) {
		tmp = -1.0 / x;
	} else {
		tmp = x;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -4.4e-150)
		tmp = x;
	elseif (x <= 9e-49)
		tmp = fma(0.8862269254527579, y, x);
	elseif (x <= 0.00021)
		tmp = Float64(-1.0 / x);
	else
		tmp = x;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -4.4e-150], x, If[LessEqual[x, 9e-49], N[(0.8862269254527579 * y + x), $MachinePrecision], If[LessEqual[x, 0.00021], N[(-1.0 / x), $MachinePrecision], x]]]

Derivation

1. Split input into 3 regimes

2. if x < -4.3999999999999999e-150 or 2.1000000000000001e-4 < x

   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

      \[\leadsto \color{blue}{x} \]
   4. Step-by-step derivation

   5. Simplified 93.7%

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

   if -4.3999999999999999e-150 < x < 9.0000000000000004e-49

   1. Initial program 93.2%

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

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{x + \frac{y}{\frac{5641895835477563}{5000000000000000} - x \cdot y}} \]
   4. Step-by-step derivation

      1. +-lowering-+.f64 N/A

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

      2. /-lowering-/.f64 N/A

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

      3. --lowering--.f64 N/A

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

      4. *-commutative N/A

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

      5. *-lowering-*.f64 68.0

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

   5. Simplified 68.0%

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

   6. Taylor expanded in y around 0

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

      1. +-commutative N/A

         \[\leadsto \color{blue}{\frac{5000000000000000}{5641895835477563} \cdot y + x} \]

      2. accelerator-lowering-fma.f64 49.7

         \[\leadsto \color{blue}{\mathsf{fma}\left(0.8862269254527579, y, x\right)} \]

   8. Simplified 49.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(0.8862269254527579, y, x\right)} \]

   if 9.0000000000000004e-49 < x < 2.1000000000000001e-4

   1. Initial program 100.0%

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

      1. +-commutative N/A

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

      2. *-lft-identity N/A

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

      3. associate-*l/ N/A

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

      4. flip-- N/A

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

      5. clear-num N/A

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

      6. accelerator-lowering-fma.f64 N/A

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

   4. Applied egg-rr 99.8%

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

   5. Taylor expanded in z around 0

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

      1. mul-1-neg N/A

         \[\leadsto x + \color{blue}{\left(\mathsf{neg}\left(\frac{y}{x \cdot y - \frac{5641895835477563}{5000000000000000}}\right)\right)} \]

      2. unsub-neg N/A

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

      3. --lowering--.f64 N/A

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

      4. /-lowering-/.f64 N/A

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

      5. sub-neg N/A

         \[\leadsto x - \frac{y}{\color{blue}{x \cdot y + \left(\mathsf{neg}\left(\frac{5641895835477563}{5000000000000000}\right)\right)}} \]

      6. *-commutative N/A

         \[\leadsto x - \frac{y}{\color{blue}{y \cdot x} + \left(\mathsf{neg}\left(\frac{5641895835477563}{5000000000000000}\right)\right)} \]

      7. metadata-eval N/A

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

      8. accelerator-lowering-fma.f64 85.9

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

   7. Simplified 85.9%

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

   8. Taylor expanded in y around inf

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

      1. /-lowering-/.f64 100.0

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

   10. Simplified 100.0%

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

   11. Taylor expanded in x around 0

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

       1. /-lowering-/.f64 95.7

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

   13. Simplified 95.7%

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

Alternative 12: 72.7% accurate, 6.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -4.8 \cdot 10^{-150}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 8 \cdot 10^{-95}:\\ \;\;\;\;\mathsf{fma}\left(0.8862269254527579, y, x\right)\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -4.8e-150) x (if (<= x 8e-95) (fma 0.8862269254527579 y x) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -4.8e-150) {
		tmp = x;
	} else if (x <= 8e-95) {
		tmp = fma(0.8862269254527579, y, x);
	} else {
		tmp = x;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -4.8e-150)
		tmp = x;
	elseif (x <= 8e-95)
		tmp = fma(0.8862269254527579, y, x);
	else
		tmp = x;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -4.8e-150], x, If[LessEqual[x, 8e-95], N[(0.8862269254527579 * y + x), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if x < -4.8e-150 or 7.99999999999999992e-95 < x

   1. Initial program 96.3%

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

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x} \]
   4. Step-by-step derivation

   5. Simplified 88.1%

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

   if -4.8e-150 < x < 7.99999999999999992e-95

   1. Initial program 92.4%

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

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{x + \frac{y}{\frac{5641895835477563}{5000000000000000} - x \cdot y}} \]
   4. Step-by-step derivation

      1. +-lowering-+.f64 N/A

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

      2. /-lowering-/.f64 N/A

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

      3. --lowering--.f64 N/A

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

      4. *-commutative N/A

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

      5. *-lowering-*.f64 68.1

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

   5. Simplified 68.1%

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

   6. Taylor expanded in y around 0

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

      1. +-commutative N/A

         \[\leadsto \color{blue}{\frac{5000000000000000}{5641895835477563} \cdot y + x} \]

      2. accelerator-lowering-fma.f64 50.1

         \[\leadsto \color{blue}{\mathsf{fma}\left(0.8862269254527579, y, x\right)} \]

   8. Simplified 50.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left(0.8862269254527579, y, x\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 13: 69.4% accurate, 7.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1 \cdot 10^{-240}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 7.2 \cdot 10^{-111}:\\ \;\;\;\;y \cdot 0.8862269254527579\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -1e-240) x (if (<= x 7.2e-111) (* y 0.8862269254527579) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -1e-240) {
		tmp = x;
	} else if (x <= 7.2e-111) {
		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 <= (-1d-240)) then
        tmp = x
    else if (x <= 7.2d-111) 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 <= -1e-240) {
		tmp = x;
	} else if (x <= 7.2e-111) {
		tmp = y * 0.8862269254527579;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -1e-240:
		tmp = x
	elif x <= 7.2e-111:
		tmp = y * 0.8862269254527579
	else:
		tmp = x
	return tmp

Julia

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

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -1e-240], x, If[LessEqual[x, 7.2e-111], N[(y * 0.8862269254527579), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if x < -9.9999999999999997e-241 or 7.20000000000000019e-111 < x

   1. Initial program 95.8%

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

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x} \]
   4. Step-by-step derivation

   5. Simplified 81.3%

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

   if -9.9999999999999997e-241 < x < 7.20000000000000019e-111

   1. Initial program 92.5%

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

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{x + \frac{y}{\frac{5641895835477563}{5000000000000000} - x \cdot y}} \]
   4. Step-by-step derivation

      1. +-lowering-+.f64 N/A

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

      2. /-lowering-/.f64 N/A

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

      3. --lowering--.f64 N/A

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

      4. *-commutative N/A

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

      5. *-lowering-*.f64 72.7

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

   5. Simplified 72.7%

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

   6. Taylor expanded in x around 0

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

      1. *-lowering-*.f64 43.8

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

   8. Simplified 43.8%

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

4. Final simplification 73.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1 \cdot 10^{-240}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 7.2 \cdot 10^{-111}:\\ \;\;\;\;y \cdot 0.8862269254527579\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 14: 68.7% accurate, 128.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.1%

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

3. Taylor expanded in x around inf

   \[\leadsto \color{blue}{x} \]
4. Step-by-step derivation

5. Simplified 69.0%

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

Developer Target 1: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

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

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

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