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

Percentage Accurate: 95.6% → 99.2%

Time: 10.0s

Alternatives: 10

Speedup: 0.5×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 95.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.2% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (exp.f64 z) < 5.50000000000000003e-95

   1. Initial program 93.0%

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

   3. Taylor expanded in y around inf 100.0%

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

   if 5.50000000000000003e-95 < (exp.f64 z) < 1

   1. Initial program 99.9%

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

      1. remove-double-neg 99.9%

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

      2. distribute-frac-neg 99.9%

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

      3. unsub-neg 99.9%

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

      4. distribute-frac-neg 99.9%

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

      5. distribute-neg-frac2 99.9%

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

      6. neg-sub0 99.9%

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

      7. associate--r- 99.9%

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

      8. neg-sub0 99.9%

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

      9. +-commutative 99.9%

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

      10. fma-define 99.9%

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

      11. *-commutative 99.9%

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

      12. distribute-rgt-neg-in 99.9%

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

      13. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in z around 0 99.9%

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

      1. clear-num 99.9%

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

      2. inv-pow 99.9%

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

      3. *-commutative 99.9%

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

      4. div-sub 99.9%

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

      5. *-commutative 99.9%

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

      6. associate-/l* 99.9%

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

      7. *-inverses 99.9%

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

      8. *-commutative 99.9%

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

      9. *-un-lft-identity 99.9%

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

   7. Applied egg-rr 99.9%

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

      1. unpow-1 99.9%

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

   9. Simplified 99.9%

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

   if 1 < (exp.f64 z)

   1. Initial program 94.1%

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

   3. Taylor expanded in x around inf 100.0%

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

4. Final simplification 100.0%

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

Alternative 2: 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 93.0%

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

   3. Taylor expanded in y around inf 100.0%

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

   if 0.0 < (exp.f64 z)

   1. Initial program 97.8%

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

      1. remove-double-neg 97.8%

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

      2. distribute-frac-neg 97.8%

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

      3. unsub-neg 97.8%

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

      4. distribute-frac-neg 97.8%

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

      5. distribute-neg-frac2 97.8%

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

      6. neg-sub0 97.8%

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

      7. associate--r- 97.8%

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

      8. neg-sub0 97.8%

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

      9. +-commutative 97.8%

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

      10. fma-define 99.9%

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

      11. *-commutative 99.9%

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

      12. distribute-rgt-neg-in 99.9%

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

      13. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

4. Final simplification 99.9%

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

Alternative 3: 98.6% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[Exp[z], $MachinePrecision] * 1.1283791670955126), $MachinePrecision]}, If[LessEqual[N[(x + N[(y / N[(t$95$0 - N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1e+281], N[(x + N[(-1.0 / N[(N[(N[(x * y), $MachinePrecision] - t$95$0), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 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)))) < 1e281

   1. Initial program 99.1%

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

      1. clear-num 99.1%

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

      2. inv-pow 99.1%

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

   4. Applied egg-rr 99.1%

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

      1. unpow-1 99.1%

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

      2. *-commutative 99.1%

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

   6. Simplified 99.1%

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

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

   1. Initial program 59.9%

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

   3. Taylor expanded in y around inf 100.0%

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

4. Final simplification 99.2%

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

Alternative 4: 98.5% 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 10^{+281}:\\ \;\;\;\;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 1e+281) 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 <= 1e+281) {
		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 <= 1d+281) 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 <= 1e+281) {
		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 <= 1e+281:
		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 <= 1e+281)
		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 <= 1e+281)
		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, 1e+281], 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)))) < 1e281

   1. Initial program 99.1%

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

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

   1. Initial program 59.9%

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

   3. Taylor expanded in y around inf 100.0%

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

4. Final simplification 99.1%

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

Alternative 5: 84.7% accurate, 7.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.45 \cdot 10^{-213}:\\ \;\;\;\;x + \frac{-1}{x}\\ \mathbf{elif}\;z \leq 4.3 \cdot 10^{-36}:\\ \;\;\;\;x - \frac{y}{-1.1283791670955126}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -1.45e-213)
   (+ x (/ -1.0 x))
   (if (<= z 4.3e-36) (- x (/ y -1.1283791670955126)) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -1.45e-213) {
		tmp = x + (-1.0 / x);
	} else if (z <= 4.3e-36) {
		tmp = x - (y / -1.1283791670955126);
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= (-1.45d-213)) then
        tmp = x + ((-1.0d0) / x)
    else if (z <= 4.3d-36) then
        tmp = x - (y / (-1.1283791670955126d0))
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z <= -1.45e-213) {
		tmp = x + (-1.0 / x);
	} else if (z <= 4.3e-36) {
		tmp = x - (y / -1.1283791670955126);
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -1.45e-213:
		tmp = x + (-1.0 / x)
	elif z <= 4.3e-36:
		tmp = x - (y / -1.1283791670955126)
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -1.45e-213)
		tmp = Float64(x + Float64(-1.0 / x));
	elseif (z <= 4.3e-36)
		tmp = Float64(x - Float64(y / -1.1283791670955126));
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -1.45e-213)
		tmp = x + (-1.0 / x);
	elseif (z <= 4.3e-36)
		tmp = x - (y / -1.1283791670955126);
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -1.45e-213], N[(x + N[(-1.0 / x), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 4.3e-36], N[(x - N[(y / -1.1283791670955126), $MachinePrecision]), $MachinePrecision], x]]

Derivation

1. Split input into 3 regimes

2. if z < -1.45e-213

   1. Initial program 95.9%

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

   3. Taylor expanded in y around inf 90.0%

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

   if -1.45e-213 < z < 4.3000000000000002e-36

   1. Initial program 99.9%

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

      1. remove-double-neg 99.9%

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

      2. distribute-frac-neg 99.9%

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

      3. unsub-neg 99.9%

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

      4. distribute-frac-neg 99.9%

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

      5. distribute-neg-frac2 99.9%

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

      6. neg-sub0 99.9%

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

      7. associate--r- 99.9%

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

      8. neg-sub0 99.9%

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

      9. +-commutative 99.9%

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

      10. fma-define 99.9%

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

      11. *-commutative 99.9%

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

      12. distribute-rgt-neg-in 99.9%

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

      13. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in z around 0 99.9%

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

   6. Taylor expanded in x around 0 81.2%

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

   if 4.3000000000000002e-36 < z

   1. Initial program 94.3%

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

   3. Taylor expanded in x around inf 100.0%

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

4. Final simplification 90.2%

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

Alternative 6: 70.8% accurate, 8.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.35 \cdot 10^{-190}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 3.1 \cdot 10^{-266}:\\ \;\;\;\;\frac{y}{1.1283791670955126}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -1.35e-190) x (if (<= x 3.1e-266) (/ y 1.1283791670955126) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -1.35e-190) {
		tmp = x;
	} else if (x <= 3.1e-266) {
		tmp = y / 1.1283791670955126;
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (x <= (-1.35d-190)) then
        tmp = x
    else if (x <= 3.1d-266) then
        tmp = y / 1.1283791670955126d0
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -1.35e-190) {
		tmp = x;
	} else if (x <= 3.1e-266) {
		tmp = y / 1.1283791670955126;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -1.35e-190:
		tmp = x
	elif x <= 3.1e-266:
		tmp = y / 1.1283791670955126
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -1.35e-190)
		tmp = x;
	elseif (x <= 3.1e-266)
		tmp = Float64(y / 1.1283791670955126);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -1.35e-190)
		tmp = x;
	elseif (x <= 3.1e-266)
		tmp = y / 1.1283791670955126;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -1.35e-190], x, If[LessEqual[x, 3.1e-266], N[(y / 1.1283791670955126), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if x < -1.35e-190 or 3.09999999999999995e-266 < x

   1. Initial program 97.2%

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

   3. Taylor expanded in x around inf 78.7%

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

   if -1.35e-190 < x < 3.09999999999999995e-266

   1. Initial program 93.1%

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

      1. remove-double-neg 93.1%

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

      2. distribute-frac-neg 93.1%

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

      3. unsub-neg 93.1%

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

      4. distribute-frac-neg 93.1%

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

      5. distribute-neg-frac2 93.1%

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

      6. neg-sub0 93.1%

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

      7. associate--r- 93.1%

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

      8. neg-sub0 93.3%

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

      9. +-commutative 93.3%

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

      10. fma-define 93.3%

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

      11. *-commutative 93.3%

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

      12. distribute-rgt-neg-in 93.3%

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

      13. metadata-eval 93.3%

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

   3. Simplified 93.3%

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

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

   6. Taylor expanded in x around 0 54.5%

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

      1. *-commutative 54.5%

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

   8. Simplified 54.5%

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

      1. metadata-eval 54.4%

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

      2. div-inv 54.6%

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

   10. Applied egg-rr 54.6%

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

Alternative 7: 70.8% accurate, 8.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -9.2 \cdot 10^{-191}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 3.8 \cdot 10^{-260}:\\ \;\;\;\;y \cdot 0.8862269254527579\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -9.2e-191) x (if (<= x 3.8e-260) (* y 0.8862269254527579) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -9.2e-191) {
		tmp = x;
	} else if (x <= 3.8e-260) {
		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 <= (-9.2d-191)) then
        tmp = x
    else if (x <= 3.8d-260) 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 <= -9.2e-191) {
		tmp = x;
	} else if (x <= 3.8e-260) {
		tmp = y * 0.8862269254527579;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -9.2e-191:
		tmp = x
	elif x <= 3.8e-260:
		tmp = y * 0.8862269254527579
	else:
		tmp = x
	return tmp

Julia

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

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -9.2e-191], x, If[LessEqual[x, 3.8e-260], N[(y * 0.8862269254527579), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if x < -9.20000000000000042e-191 or 3.8000000000000003e-260 < x

   1. Initial program 97.2%

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

   3. Taylor expanded in x around inf 78.7%

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

   if -9.20000000000000042e-191 < x < 3.8000000000000003e-260

   1. Initial program 93.1%

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

      1. remove-double-neg 93.1%

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

      2. distribute-frac-neg 93.1%

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

      3. unsub-neg 93.1%

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

      4. distribute-frac-neg 93.1%

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

      5. distribute-neg-frac2 93.1%

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

      6. neg-sub0 93.1%

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

      7. associate--r- 93.1%

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

      8. neg-sub0 93.3%

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

      9. +-commutative 93.3%

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

      10. fma-define 93.3%

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

      11. *-commutative 93.3%

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

      12. distribute-rgt-neg-in 93.3%

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

      13. metadata-eval 93.3%

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

   3. Simplified 93.3%

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

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

   6. Taylor expanded in x around 0 54.5%

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

      1. *-commutative 54.5%

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

   8. Simplified 54.5%

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

Alternative 8: 81.2% accurate, 11.1× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -3.7e-228) {
		tmp = x + (-1.0 / x);
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= (-3.7d-228)) then
        tmp = x + ((-1.0d0) / x)
    else
        tmp = x
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -3.7e-228

   1. Initial program 95.9%

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

   3. Taylor expanded in y around inf 90.0%

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

   if -3.7e-228 < z

   1. Initial program 97.2%

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

   3. Taylor expanded in x around inf 84.9%

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

4. Final simplification 87.1%

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

Alternative 9: 69.0% 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.6%

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

3. Taylor expanded in x around inf 71.5%

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

Alternative 10: 2.9% accurate, 111.0× speedup

Math

\[\begin{array}{l} \\ 0 \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 0.0)

C

double code(double x, double y, double z) {
	return 0.0;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = 0.0d0
end function

Java

public static double code(double x, double y, double z) {
	return 0.0;
}

Python

def code(x, y, z):
	return 0.0

Julia

function code(x, y, z)
	return 0.0
end

MATLAB

function tmp = code(x, y, z)
	tmp = 0.0;
end

Wolfram

code[x_, y_, z_] := 0.0

Derivation

1. Initial program 96.6%

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

   1. remove-double-neg 96.6%

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

   2. distribute-frac-neg 96.6%

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

   3. unsub-neg 96.6%

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

   4. distribute-frac-neg 96.6%

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

   5. distribute-neg-frac2 96.6%

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

   6. neg-sub0 96.6%

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

   7. associate--r- 96.6%

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

   8. neg-sub0 96.7%

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

   9. +-commutative 96.7%

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

   10. fma-define 98.3%

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

   11. *-commutative 98.3%

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

   12. distribute-rgt-neg-in 98.3%

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

   13. metadata-eval 98.3%

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

3. Simplified 98.3%

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

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

6. Taylor expanded in x around 0 13.4%

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

   1. *-commutative 13.4%

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

8. Simplified 13.4%

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

   1. metadata-eval 13.4%

      \[\leadsto y \cdot \color{blue}{\left(--0.8862269254527579\right)} \]

   2. metadata-eval 13.3%

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

   3. distribute-rgt-neg-in 13.3%

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

   4. div-inv 13.4%

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

   5. add-sqr-sqrt 7.1%

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

   6. sqrt-unprod 6.6%

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

   7. div-inv 6.6%

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

   8. div-inv 6.6%

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

   9. swap-sqr 6.6%

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

   10. metadata-eval 6.7%

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

   11. metadata-eval 6.6%

       \[\leadsto -\sqrt{\left(y \cdot y\right) \cdot \left(-0.8862269254527579 \cdot \color{blue}{-0.8862269254527579}\right)} \]

   12. metadata-eval 6.7%

       \[\leadsto -\sqrt{\left(y \cdot y\right) \cdot \color{blue}{0.7853981633974483}} \]

   13. metadata-eval 6.6%

       \[\leadsto -\sqrt{\left(y \cdot y\right) \cdot \color{blue}{\left(0.8862269254527579 \cdot 0.8862269254527579\right)}} \]

   14. swap-sqr 6.7%

       \[\leadsto -\sqrt{\color{blue}{\left(y \cdot 0.8862269254527579\right) \cdot \left(y \cdot 0.8862269254527579\right)}} \]

   15. sqrt-unprod 1.7%

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

   16. add-sqr-sqrt 3.2%

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

10. Applied egg-rr 3.2%

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

    1. add-sqr-sqrt 1.5%

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

    2. sqrt-unprod 6.5%

       \[\leadsto \color{blue}{\sqrt{\left(-y \cdot 0.8862269254527579\right) \cdot \left(-y \cdot 0.8862269254527579\right)}} \]

    3. sqr-neg 6.5%

       \[\leadsto \sqrt{\color{blue}{\left(y \cdot 0.8862269254527579\right) \cdot \left(y \cdot 0.8862269254527579\right)}} \]

    4. sqrt-unprod 6.3%

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

    5. add-sqr-sqrt 13.4%

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

    6. add-log-exp 3.1%

       \[\leadsto \color{blue}{\log \left(e^{y \cdot 0.8862269254527579}\right)} \]

    7. add-sqr-sqrt 3.1%

       \[\leadsto \log \color{blue}{\left(\sqrt{e^{y \cdot 0.8862269254527579}} \cdot \sqrt{e^{y \cdot 0.8862269254527579}}\right)} \]

    8. sqrt-unprod 3.1%

       \[\leadsto \log \color{blue}{\left(\sqrt{e^{y \cdot 0.8862269254527579} \cdot e^{y \cdot 0.8862269254527579}}\right)} \]

    9. exp-prod 3.1%

       \[\leadsto \log \left(\sqrt{\color{blue}{{\left(e^{y}\right)}^{0.8862269254527579}} \cdot e^{y \cdot 0.8862269254527579}}\right) \]

    10. add-sqr-sqrt 1.6%

        \[\leadsto \log \left(\sqrt{{\left(e^{y}\right)}^{0.8862269254527579} \cdot e^{\color{blue}{\sqrt{y \cdot 0.8862269254527579} \cdot \sqrt{y \cdot 0.8862269254527579}}}}\right) \]

    11. sqrt-unprod 2.3%

        \[\leadsto \log \left(\sqrt{{\left(e^{y}\right)}^{0.8862269254527579} \cdot e^{\color{blue}{\sqrt{\left(y \cdot 0.8862269254527579\right) \cdot \left(y \cdot 0.8862269254527579\right)}}}}\right) \]

    12. sqr-neg 2.3%

        \[\leadsto \log \left(\sqrt{{\left(e^{y}\right)}^{0.8862269254527579} \cdot e^{\sqrt{\color{blue}{\left(-y \cdot 0.8862269254527579\right) \cdot \left(-y \cdot 0.8862269254527579\right)}}}}\right) \]

    13. sqrt-unprod 0.7%

        \[\leadsto \log \left(\sqrt{{\left(e^{y}\right)}^{0.8862269254527579} \cdot e^{\color{blue}{\sqrt{-y \cdot 0.8862269254527579} \cdot \sqrt{-y \cdot 0.8862269254527579}}}}\right) \]

    14. add-sqr-sqrt 1.5%

        \[\leadsto \log \left(\sqrt{{\left(e^{y}\right)}^{0.8862269254527579} \cdot e^{\color{blue}{-y \cdot 0.8862269254527579}}}\right) \]

    15. distribute-rgt-neg-in 1.5%

        \[\leadsto \log \left(\sqrt{{\left(e^{y}\right)}^{0.8862269254527579} \cdot e^{\color{blue}{y \cdot \left(-0.8862269254527579\right)}}}\right) \]

    16. exp-prod 1.5%

        \[\leadsto \log \left(\sqrt{{\left(e^{y}\right)}^{0.8862269254527579} \cdot \color{blue}{{\left(e^{y}\right)}^{\left(-0.8862269254527579\right)}}}\right) \]

    17. pow-prod-up 2.9%

        \[\leadsto \log \left(\sqrt{\color{blue}{{\left(e^{y}\right)}^{\left(0.8862269254527579 + \left(-0.8862269254527579\right)\right)}}}\right) \]

    18. metadata-eval 2.9%

        \[\leadsto \log \left(\sqrt{{\left(e^{y}\right)}^{\left(0.8862269254527579 + \color{blue}{-0.8862269254527579}\right)}}\right) \]

    19. metadata-eval 2.9%

        \[\leadsto \log \left(\sqrt{{\left(e^{y}\right)}^{\color{blue}{0}}}\right) \]

    20. metadata-eval 2.9%

        \[\leadsto \log \left(\sqrt{\color{blue}{1}}\right) \]

    21. metadata-eval 2.9%

        \[\leadsto \log \color{blue}{1} \]

12. Applied egg-rr 2.9%

    \[\leadsto \color{blue}{0} \]
13. 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 2024180 
(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)))))