NMSE Section 6.1 mentioned, A

Percentage Accurate: 73.6% → 99.5%

Time: 19.5s

Alternatives: 12

Speedup: 2.0×

• 38.3% of points produce a very large (infinite) output. You may want to add a precondition.

• could not determine a ground truth

  1. x = -1.99999999999999997e77
  2. eps = -2e-231

Specification

Math

\[\begin{array}{l} \\ \frac{\left(1 + \frac{1}{\varepsilon}\right) \cdot e^{-\left(1 - \varepsilon\right) \cdot x} - \left(\frac{1}{\varepsilon} - 1\right) \cdot e^{-\left(1 + \varepsilon\right) \cdot x}}{2} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (/
  (-
   (* (+ 1.0 (/ 1.0 eps)) (exp (- (* (- 1.0 eps) x))))
   (* (- (/ 1.0 eps) 1.0) (exp (- (* (+ 1.0 eps) x)))))
  2.0))

C

double code(double x, double eps) {
	return (((1.0 + (1.0 / eps)) * exp(-((1.0 - eps) * x))) - (((1.0 / eps) - 1.0) * exp(-((1.0 + eps) * x)))) / 2.0;
}

Fortran

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

Java

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

Python

def code(x, eps):
	return (((1.0 + (1.0 / eps)) * math.exp(-((1.0 - eps) * x))) - (((1.0 / eps) - 1.0) * math.exp(-((1.0 + eps) * x)))) / 2.0

Julia

function code(x, eps)
	return Float64(Float64(Float64(Float64(1.0 + Float64(1.0 / eps)) * exp(Float64(-Float64(Float64(1.0 - eps) * x)))) - Float64(Float64(Float64(1.0 / eps) - 1.0) * exp(Float64(-Float64(Float64(1.0 + eps) * x))))) / 2.0)
end

MATLAB

function tmp = code(x, eps)
	tmp = (((1.0 + (1.0 / eps)) * exp(-((1.0 - eps) * x))) - (((1.0 / eps) - 1.0) * exp(-((1.0 + eps) * x)))) / 2.0;
end

Wolfram

code[x_, eps_] := N[(N[(N[(N[(1.0 + N[(1.0 / eps), $MachinePrecision]), $MachinePrecision] * N[Exp[(-N[(N[(1.0 - eps), $MachinePrecision] * x), $MachinePrecision])], $MachinePrecision]), $MachinePrecision] - N[(N[(N[(1.0 / eps), $MachinePrecision] - 1.0), $MachinePrecision] * N[Exp[(-N[(N[(1.0 + eps), $MachinePrecision] * x), $MachinePrecision])], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision]

Initial Program: 73.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{\left(1 + \frac{1}{\varepsilon}\right) \cdot e^{-\left(1 - \varepsilon\right) \cdot x} - \left(\frac{1}{\varepsilon} - 1\right) \cdot e^{-\left(1 + \varepsilon\right) \cdot x}}{2} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (/
  (-
   (* (+ 1.0 (/ 1.0 eps)) (exp (- (* (- 1.0 eps) x))))
   (* (- (/ 1.0 eps) 1.0) (exp (- (* (+ 1.0 eps) x)))))
  2.0))

C

double code(double x, double eps) {
	return (((1.0 + (1.0 / eps)) * exp(-((1.0 - eps) * x))) - (((1.0 / eps) - 1.0) * exp(-((1.0 + eps) * x)))) / 2.0;
}

Fortran

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

Java

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

Python

def code(x, eps):
	return (((1.0 + (1.0 / eps)) * math.exp(-((1.0 - eps) * x))) - (((1.0 / eps) - 1.0) * math.exp(-((1.0 + eps) * x)))) / 2.0

Julia

function code(x, eps)
	return Float64(Float64(Float64(Float64(1.0 + Float64(1.0 / eps)) * exp(Float64(-Float64(Float64(1.0 - eps) * x)))) - Float64(Float64(Float64(1.0 / eps) - 1.0) * exp(Float64(-Float64(Float64(1.0 + eps) * x))))) / 2.0)
end

MATLAB

function tmp = code(x, eps)
	tmp = (((1.0 + (1.0 / eps)) * exp(-((1.0 - eps) * x))) - (((1.0 / eps) - 1.0) * exp(-((1.0 + eps) * x)))) / 2.0;
end

Wolfram

code[x_, eps_] := N[(N[(N[(N[(1.0 + N[(1.0 / eps), $MachinePrecision]), $MachinePrecision] * N[Exp[(-N[(N[(1.0 - eps), $MachinePrecision] * x), $MachinePrecision])], $MachinePrecision]), $MachinePrecision] - N[(N[(N[(1.0 / eps), $MachinePrecision] - 1.0), $MachinePrecision] * N[Exp[(-N[(N[(1.0 + eps), $MachinePrecision] * x), $MachinePrecision])], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision]

Alternative 1: 99.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} eps_m = \left|\varepsilon\right| \\ \begin{array}{l} \mathbf{if}\;eps\_m \leq 1.15 \cdot 10^{-52}:\\ \;\;\;\;\frac{\frac{eps\_m \cdot \left(e^{-x} \cdot \left(2 + x \cdot 2\right)\right)}{eps\_m}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{e^{x \cdot \left(-eps\_m\right)} + e^{x \cdot \left(eps\_m + -1\right)}}{2}\\ \end{array} \end{array} \]

FPCore

eps_m = (fabs.f64 eps)
(FPCore (x eps_m)
 :precision binary64
 (if (<= eps_m 1.15e-52)
   (/ (/ (* eps_m (* (exp (- x)) (+ 2.0 (* x 2.0)))) eps_m) 2.0)
   (/ (+ (exp (* x (- eps_m))) (exp (* x (+ eps_m -1.0)))) 2.0)))

C

eps_m = fabs(eps);
double code(double x, double eps_m) {
	double tmp;
	if (eps_m <= 1.15e-52) {
		tmp = ((eps_m * (exp(-x) * (2.0 + (x * 2.0)))) / eps_m) / 2.0;
	} else {
		tmp = (exp((x * -eps_m)) + exp((x * (eps_m + -1.0)))) / 2.0;
	}
	return tmp;
}

Fortran

eps_m = abs(eps)
real(8) function code(x, eps_m)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps_m
    real(8) :: tmp
    if (eps_m <= 1.15d-52) then
        tmp = ((eps_m * (exp(-x) * (2.0d0 + (x * 2.0d0)))) / eps_m) / 2.0d0
    else
        tmp = (exp((x * -eps_m)) + exp((x * (eps_m + (-1.0d0))))) / 2.0d0
    end if
    code = tmp
end function

Java

eps_m = Math.abs(eps);
public static double code(double x, double eps_m) {
	double tmp;
	if (eps_m <= 1.15e-52) {
		tmp = ((eps_m * (Math.exp(-x) * (2.0 + (x * 2.0)))) / eps_m) / 2.0;
	} else {
		tmp = (Math.exp((x * -eps_m)) + Math.exp((x * (eps_m + -1.0)))) / 2.0;
	}
	return tmp;
}

Python

eps_m = math.fabs(eps)
def code(x, eps_m):
	tmp = 0
	if eps_m <= 1.15e-52:
		tmp = ((eps_m * (math.exp(-x) * (2.0 + (x * 2.0)))) / eps_m) / 2.0
	else:
		tmp = (math.exp((x * -eps_m)) + math.exp((x * (eps_m + -1.0)))) / 2.0
	return tmp

Julia

eps_m = abs(eps)
function code(x, eps_m)
	tmp = 0.0
	if (eps_m <= 1.15e-52)
		tmp = Float64(Float64(Float64(eps_m * Float64(exp(Float64(-x)) * Float64(2.0 + Float64(x * 2.0)))) / eps_m) / 2.0);
	else
		tmp = Float64(Float64(exp(Float64(x * Float64(-eps_m))) + exp(Float64(x * Float64(eps_m + -1.0)))) / 2.0);
	end
	return tmp
end

MATLAB

eps_m = abs(eps);
function tmp_2 = code(x, eps_m)
	tmp = 0.0;
	if (eps_m <= 1.15e-52)
		tmp = ((eps_m * (exp(-x) * (2.0 + (x * 2.0)))) / eps_m) / 2.0;
	else
		tmp = (exp((x * -eps_m)) + exp((x * (eps_m + -1.0)))) / 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

eps_m = N[Abs[eps], $MachinePrecision]
code[x_, eps$95$m_] := If[LessEqual[eps$95$m, 1.15e-52], N[(N[(N[(eps$95$m * N[(N[Exp[(-x)], $MachinePrecision] * N[(2.0 + N[(x * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / eps$95$m), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[(N[Exp[N[(x * (-eps$95$m)), $MachinePrecision]], $MachinePrecision] + N[Exp[N[(x * N[(eps$95$m + -1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if eps < 1.14999999999999997e-52

   1. Initial program 64.1%

      \[\frac{\left(1 + \frac{1}{\varepsilon}\right) \cdot e^{-\left(1 - \varepsilon\right) \cdot x} - \left(\frac{1}{\varepsilon} - 1\right) \cdot e^{-\left(1 + \varepsilon\right) \cdot x}}{2} \]

   3. Simplified 58.2%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(1 + \frac{1}{\varepsilon}, e^{x \cdot \left(\varepsilon + -1\right)}, {\left(e^{1 + \varepsilon}\right)}^{\left(-x\right)} \cdot \left(1 + \frac{-1}{\varepsilon}\right)\right)}{2}} \]
   4. Add Preprocessing

   5. Taylor expanded in eps around 0 29.4%

      \[\leadsto \frac{\color{blue}{\frac{e^{-1 \cdot x} + \left(-1 \cdot e^{-1 \cdot x} + \varepsilon \cdot \left(2 \cdot e^{-1 \cdot x} + 2 \cdot \left(x \cdot e^{-1 \cdot x}\right)\right)\right)}{\varepsilon}}}{2} \]
   6. Step-by-step derivation

      1. associate-+r+ 65.9%

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

      2. distribute-rgt1-in 65.9%

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

      3. metadata-eval 65.9%

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

      4. mul0-lft 65.9%

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

      5. associate-*r* 65.9%

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

      6. distribute-rgt-out 65.9%

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

      7. mul-1-neg 65.9%

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

   7. Simplified 65.9%

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

   if 1.14999999999999997e-52 < eps

   1. Initial program 97.1%

      \[\frac{\left(1 + \frac{1}{\varepsilon}\right) \cdot e^{-\left(1 - \varepsilon\right) \cdot x} - \left(\frac{1}{\varepsilon} - 1\right) \cdot e^{-\left(1 + \varepsilon\right) \cdot x}}{2} \]

   3. Simplified 81.2%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(1 + \frac{1}{\varepsilon}, {\left(e^{x}\right)}^{\left(\varepsilon + -1\right)}, \frac{1 + \frac{-1}{\varepsilon}}{e^{\mathsf{fma}\left(\varepsilon, x, x\right)}}\right)}{2}} \]
   4. Add Preprocessing

   5. Taylor expanded in eps around inf 100.0%

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

   6. Taylor expanded in eps around inf 100.0%

      \[\leadsto \frac{e^{x \cdot \left(\varepsilon - 1\right)} + \frac{1}{e^{\color{blue}{\varepsilon \cdot x}}}}{2} \]
   7. Step-by-step derivation

      1. *-commutative 100.0%

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

   8. Simplified 100.0%

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

   9. Taylor expanded in x around inf 100.0%

      \[\leadsto \frac{e^{x \cdot \left(\varepsilon - 1\right)} + \color{blue}{\frac{1}{e^{\varepsilon \cdot x}}}}{2} \]
   10. Step-by-step derivation

       1. rec-exp 100.0%

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

       2. *-commutative 100.0%

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

       3. distribute-rgt-neg-in 100.0%

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

   11. Simplified 100.0%

       \[\leadsto \frac{e^{x \cdot \left(\varepsilon - 1\right)} + \color{blue}{e^{x \cdot \left(-\varepsilon\right)}}}{2} \]
3. Recombined 2 regimes into one program.

4. Final simplification 74.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\varepsilon \leq 1.15 \cdot 10^{-52}:\\ \;\;\;\;\frac{\frac{\varepsilon \cdot \left(e^{-x} \cdot \left(2 + x \cdot 2\right)\right)}{\varepsilon}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{e^{x \cdot \left(-\varepsilon\right)} + e^{x \cdot \left(\varepsilon + -1\right)}}{2}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 99.0% accurate, 1.1× speedup

Math

\[\begin{array}{l} eps_m = \left|\varepsilon\right| \\ \frac{\frac{1}{e^{x + x \cdot eps\_m}} + e^{x \cdot \left(eps\_m + -1\right)}}{2} \end{array} \]

FPCore

eps_m = (fabs.f64 eps)
(FPCore (x eps_m)
 :precision binary64
 (/ (+ (/ 1.0 (exp (+ x (* x eps_m)))) (exp (* x (+ eps_m -1.0)))) 2.0))

C

eps_m = fabs(eps);
double code(double x, double eps_m) {
	return ((1.0 / exp((x + (x * eps_m)))) + exp((x * (eps_m + -1.0)))) / 2.0;
}

Fortran

eps_m = abs(eps)
real(8) function code(x, eps_m)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps_m
    code = ((1.0d0 / exp((x + (x * eps_m)))) + exp((x * (eps_m + (-1.0d0))))) / 2.0d0
end function

Java

eps_m = Math.abs(eps);
public static double code(double x, double eps_m) {
	return ((1.0 / Math.exp((x + (x * eps_m)))) + Math.exp((x * (eps_m + -1.0)))) / 2.0;
}

Python

eps_m = math.fabs(eps)
def code(x, eps_m):
	return ((1.0 / math.exp((x + (x * eps_m)))) + math.exp((x * (eps_m + -1.0)))) / 2.0

Julia

eps_m = abs(eps)
function code(x, eps_m)
	return Float64(Float64(Float64(1.0 / exp(Float64(x + Float64(x * eps_m)))) + exp(Float64(x * Float64(eps_m + -1.0)))) / 2.0)
end

MATLAB

eps_m = abs(eps);
function tmp = code(x, eps_m)
	tmp = ((1.0 / exp((x + (x * eps_m)))) + exp((x * (eps_m + -1.0)))) / 2.0;
end

Wolfram

eps_m = N[Abs[eps], $MachinePrecision]
code[x_, eps$95$m_] := N[(N[(N[(1.0 / N[Exp[N[(x + N[(x * eps$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[Exp[N[(x * N[(eps$95$m + -1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision]

Derivation

1. Initial program 72.8%

   \[\frac{\left(1 + \frac{1}{\varepsilon}\right) \cdot e^{-\left(1 - \varepsilon\right) \cdot x} - \left(\frac{1}{\varepsilon} - 1\right) \cdot e^{-\left(1 + \varepsilon\right) \cdot x}}{2} \]

3. Simplified 65.0%

   \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(1 + \frac{1}{\varepsilon}, {\left(e^{x}\right)}^{\left(\varepsilon + -1\right)}, \frac{1 + \frac{-1}{\varepsilon}}{e^{\mathsf{fma}\left(\varepsilon, x, x\right)}}\right)}{2}} \]
4. Add Preprocessing

5. Taylor expanded in eps around inf 99.1%

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

6. Final simplification 99.1%

   \[\leadsto \frac{\frac{1}{e^{x + x \cdot \varepsilon}} + e^{x \cdot \left(\varepsilon + -1\right)}}{2} \]
7. Add Preprocessing

Alternative 3: 84.1% accurate, 1.8× speedup

Math

\[\begin{array}{l} eps_m = \left|\varepsilon\right| \\ \begin{array}{l} \mathbf{if}\;x \leq -4 \cdot 10^{-239}:\\ \;\;\;\;\frac{1 + e^{x \cdot \left(-1 - eps\_m\right)}}{2}\\ \mathbf{elif}\;x \leq 2600000000000 \lor \neg \left(x \leq 9.2 \cdot 10^{+180}\right):\\ \;\;\;\;\frac{1 + e^{x \cdot \left(eps\_m + -1\right)}}{2}\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]

FPCore

eps_m = (fabs.f64 eps)
(FPCore (x eps_m)
 :precision binary64
 (if (<= x -4e-239)
   (/ (+ 1.0 (exp (* x (- -1.0 eps_m)))) 2.0)
   (if (or (<= x 2600000000000.0) (not (<= x 9.2e+180)))
     (/ (+ 1.0 (exp (* x (+ eps_m -1.0)))) 2.0)
     0.0)))

C

eps_m = fabs(eps);
double code(double x, double eps_m) {
	double tmp;
	if (x <= -4e-239) {
		tmp = (1.0 + exp((x * (-1.0 - eps_m)))) / 2.0;
	} else if ((x <= 2600000000000.0) || !(x <= 9.2e+180)) {
		tmp = (1.0 + exp((x * (eps_m + -1.0)))) / 2.0;
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Fortran

eps_m = abs(eps)
real(8) function code(x, eps_m)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps_m
    real(8) :: tmp
    if (x <= (-4d-239)) then
        tmp = (1.0d0 + exp((x * ((-1.0d0) - eps_m)))) / 2.0d0
    else if ((x <= 2600000000000.0d0) .or. (.not. (x <= 9.2d+180))) then
        tmp = (1.0d0 + exp((x * (eps_m + (-1.0d0))))) / 2.0d0
    else
        tmp = 0.0d0
    end if
    code = tmp
end function

Java

eps_m = Math.abs(eps);
public static double code(double x, double eps_m) {
	double tmp;
	if (x <= -4e-239) {
		tmp = (1.0 + Math.exp((x * (-1.0 - eps_m)))) / 2.0;
	} else if ((x <= 2600000000000.0) || !(x <= 9.2e+180)) {
		tmp = (1.0 + Math.exp((x * (eps_m + -1.0)))) / 2.0;
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

eps_m = math.fabs(eps)
def code(x, eps_m):
	tmp = 0
	if x <= -4e-239:
		tmp = (1.0 + math.exp((x * (-1.0 - eps_m)))) / 2.0
	elif (x <= 2600000000000.0) or not (x <= 9.2e+180):
		tmp = (1.0 + math.exp((x * (eps_m + -1.0)))) / 2.0
	else:
		tmp = 0.0
	return tmp

Julia

eps_m = abs(eps)
function code(x, eps_m)
	tmp = 0.0
	if (x <= -4e-239)
		tmp = Float64(Float64(1.0 + exp(Float64(x * Float64(-1.0 - eps_m)))) / 2.0);
	elseif ((x <= 2600000000000.0) || !(x <= 9.2e+180))
		tmp = Float64(Float64(1.0 + exp(Float64(x * Float64(eps_m + -1.0)))) / 2.0);
	else
		tmp = 0.0;
	end
	return tmp
end

MATLAB

eps_m = abs(eps);
function tmp_2 = code(x, eps_m)
	tmp = 0.0;
	if (x <= -4e-239)
		tmp = (1.0 + exp((x * (-1.0 - eps_m)))) / 2.0;
	elseif ((x <= 2600000000000.0) || ~((x <= 9.2e+180)))
		tmp = (1.0 + exp((x * (eps_m + -1.0)))) / 2.0;
	else
		tmp = 0.0;
	end
	tmp_2 = tmp;
end

Wolfram

eps_m = N[Abs[eps], $MachinePrecision]
code[x_, eps$95$m_] := If[LessEqual[x, -4e-239], N[(N[(1.0 + N[Exp[N[(x * N[(-1.0 - eps$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], If[Or[LessEqual[x, 2600000000000.0], N[Not[LessEqual[x, 9.2e+180]], $MachinePrecision]], N[(N[(1.0 + N[Exp[N[(x * N[(eps$95$m + -1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], 0.0]]

Derivation

1. Split input into 3 regimes

2. if x < -4.0000000000000003e-239

   1. Initial program 66.4%

      \[\frac{\left(1 + \frac{1}{\varepsilon}\right) \cdot e^{-\left(1 - \varepsilon\right) \cdot x} - \left(\frac{1}{\varepsilon} - 1\right) \cdot e^{-\left(1 + \varepsilon\right) \cdot x}}{2} \]

   3. Simplified 66.4%

      \[\leadsto \color{blue}{\frac{\left(1 + \frac{1}{\varepsilon}\right) \cdot e^{\left(1 - \varepsilon\right) \cdot \left(-x\right)} - \left(\frac{1}{\varepsilon} + -1\right) \cdot e^{\left(1 + \varepsilon\right) \cdot \left(-x\right)}}{2}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 30.0%

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

   6. Taylor expanded in eps around inf 62.9%

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

   7. Taylor expanded in eps around -inf 62.9%

      \[\leadsto \frac{\color{blue}{1 - -1 \cdot e^{-1 \cdot \left(x \cdot \left(1 - -1 \cdot \varepsilon\right)\right)}}}{2} \]
   8. Step-by-step derivation

      1. sub-neg 62.9%

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

      2. mul-1-neg 62.9%

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

      3. remove-double-neg 62.9%

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

      4. mul-1-neg 62.9%

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

      5. distribute-rgt-neg-in 62.9%

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

      6. sub-neg 62.9%

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

      7. neg-mul-1 62.9%

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

      8. remove-double-neg 62.9%

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

      9. distribute-neg-in 62.9%

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

      10. metadata-eval 62.9%

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

      11. unsub-neg 62.9%

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

   9. Simplified 62.9%

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

   if -4.0000000000000003e-239 < x < 2.6e12 or 9.1999999999999995e180 < x

   1. Initial program 70.3%

      \[\frac{\left(1 + \frac{1}{\varepsilon}\right) \cdot e^{-\left(1 - \varepsilon\right) \cdot x} - \left(\frac{1}{\varepsilon} - 1\right) \cdot e^{-\left(1 + \varepsilon\right) \cdot x}}{2} \]

   3. Simplified 61.1%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(1 + \frac{1}{\varepsilon}, {\left(e^{x}\right)}^{\left(\varepsilon + -1\right)}, \frac{1 + \frac{-1}{\varepsilon}}{e^{\mathsf{fma}\left(\varepsilon, x, x\right)}}\right)}{2}} \]
   4. Add Preprocessing

   5. Taylor expanded in eps around inf 98.9%

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

   6. Taylor expanded in x around 0 67.0%

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

   if 2.6e12 < x < 9.1999999999999995e180

   1. Initial program 100.0%

      \[\frac{\left(1 + \frac{1}{\varepsilon}\right) \cdot e^{-\left(1 - \varepsilon\right) \cdot x} - \left(\frac{1}{\varepsilon} - 1\right) \cdot e^{-\left(1 + \varepsilon\right) \cdot x}}{2} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(1 + \frac{1}{\varepsilon}, e^{x \cdot \left(\varepsilon + -1\right)}, {\left(e^{1 + \varepsilon}\right)}^{\left(-x\right)} \cdot \left(1 + \frac{-1}{\varepsilon}\right)\right)}{2}} \]
   4. Add Preprocessing

   5. Taylor expanded in eps around 0 65.3%

      \[\leadsto \frac{\color{blue}{\frac{e^{-1 \cdot x} + -1 \cdot e^{-1 \cdot x}}{\varepsilon}}}{2} \]
   6. Step-by-step derivation

      1. mul-1-neg 65.3%

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

      2. mul-1-neg 65.3%

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

      3. rec-exp 65.3%

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

      4. sub-neg 65.3%

         \[\leadsto \frac{\frac{\color{blue}{e^{-1 \cdot x} - \frac{1}{e^{x}}}}{\varepsilon}}{2} \]

      5. div-sub 65.3%

         \[\leadsto \frac{\color{blue}{\frac{e^{-1 \cdot x}}{\varepsilon} - \frac{\frac{1}{e^{x}}}{\varepsilon}}}{2} \]

      6. mul-1-neg 65.3%

         \[\leadsto \frac{\frac{e^{\color{blue}{-x}}}{\varepsilon} - \frac{\frac{1}{e^{x}}}{\varepsilon}}{2} \]

      7. rec-exp 65.3%

         \[\leadsto \frac{\frac{\color{blue}{\frac{1}{e^{x}}}}{\varepsilon} - \frac{\frac{1}{e^{x}}}{\varepsilon}}{2} \]

      8. +-inverses 65.3%

         \[\leadsto \frac{\color{blue}{0}}{2} \]

   7. Simplified 65.3%

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

4. Final simplification 65.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -4 \cdot 10^{-239}:\\ \;\;\;\;\frac{1 + e^{x \cdot \left(-1 - \varepsilon\right)}}{2}\\ \mathbf{elif}\;x \leq 2600000000000 \lor \neg \left(x \leq 9.2 \cdot 10^{+180}\right):\\ \;\;\;\;\frac{1 + e^{x \cdot \left(\varepsilon + -1\right)}}{2}\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 84.9% accurate, 1.9× speedup

Math

\[\begin{array}{l} eps_m = \left|\varepsilon\right| \\ \begin{array}{l} \mathbf{if}\;eps\_m \leq 4.9 \cdot 10^{-12}:\\ \;\;\;\;\frac{\frac{eps\_m \cdot \left(e^{-x} \cdot \left(2 + x \cdot 2\right)\right)}{eps\_m}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{eps\_m \cdot \left(\frac{1 - \left(x - e^{x \cdot \left(eps\_m + -1\right)}\right)}{eps\_m} - x\right)}{2}\\ \end{array} \end{array} \]

FPCore

eps_m = (fabs.f64 eps)
(FPCore (x eps_m)
 :precision binary64
 (if (<= eps_m 4.9e-12)
   (/ (/ (* eps_m (* (exp (- x)) (+ 2.0 (* x 2.0)))) eps_m) 2.0)
   (/ (* eps_m (- (/ (- 1.0 (- x (exp (* x (+ eps_m -1.0))))) eps_m) x)) 2.0)))

C

eps_m = fabs(eps);
double code(double x, double eps_m) {
	double tmp;
	if (eps_m <= 4.9e-12) {
		tmp = ((eps_m * (exp(-x) * (2.0 + (x * 2.0)))) / eps_m) / 2.0;
	} else {
		tmp = (eps_m * (((1.0 - (x - exp((x * (eps_m + -1.0))))) / eps_m) - x)) / 2.0;
	}
	return tmp;
}

Fortran

eps_m = abs(eps)
real(8) function code(x, eps_m)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps_m
    real(8) :: tmp
    if (eps_m <= 4.9d-12) then
        tmp = ((eps_m * (exp(-x) * (2.0d0 + (x * 2.0d0)))) / eps_m) / 2.0d0
    else
        tmp = (eps_m * (((1.0d0 - (x - exp((x * (eps_m + (-1.0d0)))))) / eps_m) - x)) / 2.0d0
    end if
    code = tmp
end function

Java

eps_m = Math.abs(eps);
public static double code(double x, double eps_m) {
	double tmp;
	if (eps_m <= 4.9e-12) {
		tmp = ((eps_m * (Math.exp(-x) * (2.0 + (x * 2.0)))) / eps_m) / 2.0;
	} else {
		tmp = (eps_m * (((1.0 - (x - Math.exp((x * (eps_m + -1.0))))) / eps_m) - x)) / 2.0;
	}
	return tmp;
}

Python

eps_m = math.fabs(eps)
def code(x, eps_m):
	tmp = 0
	if eps_m <= 4.9e-12:
		tmp = ((eps_m * (math.exp(-x) * (2.0 + (x * 2.0)))) / eps_m) / 2.0
	else:
		tmp = (eps_m * (((1.0 - (x - math.exp((x * (eps_m + -1.0))))) / eps_m) - x)) / 2.0
	return tmp

Julia

eps_m = abs(eps)
function code(x, eps_m)
	tmp = 0.0
	if (eps_m <= 4.9e-12)
		tmp = Float64(Float64(Float64(eps_m * Float64(exp(Float64(-x)) * Float64(2.0 + Float64(x * 2.0)))) / eps_m) / 2.0);
	else
		tmp = Float64(Float64(eps_m * Float64(Float64(Float64(1.0 - Float64(x - exp(Float64(x * Float64(eps_m + -1.0))))) / eps_m) - x)) / 2.0);
	end
	return tmp
end

MATLAB

eps_m = abs(eps);
function tmp_2 = code(x, eps_m)
	tmp = 0.0;
	if (eps_m <= 4.9e-12)
		tmp = ((eps_m * (exp(-x) * (2.0 + (x * 2.0)))) / eps_m) / 2.0;
	else
		tmp = (eps_m * (((1.0 - (x - exp((x * (eps_m + -1.0))))) / eps_m) - x)) / 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

eps_m = N[Abs[eps], $MachinePrecision]
code[x_, eps$95$m_] := If[LessEqual[eps$95$m, 4.9e-12], N[(N[(N[(eps$95$m * N[(N[Exp[(-x)], $MachinePrecision] * N[(2.0 + N[(x * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / eps$95$m), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[(eps$95$m * N[(N[(N[(1.0 - N[(x - N[Exp[N[(x * N[(eps$95$m + -1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / eps$95$m), $MachinePrecision] - x), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if eps < 4.89999999999999972e-12

   1. Initial program 63.9%

      \[\frac{\left(1 + \frac{1}{\varepsilon}\right) \cdot e^{-\left(1 - \varepsilon\right) \cdot x} - \left(\frac{1}{\varepsilon} - 1\right) \cdot e^{-\left(1 + \varepsilon\right) \cdot x}}{2} \]

   3. Simplified 58.1%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(1 + \frac{1}{\varepsilon}, e^{x \cdot \left(\varepsilon + -1\right)}, {\left(e^{1 + \varepsilon}\right)}^{\left(-x\right)} \cdot \left(1 + \frac{-1}{\varepsilon}\right)\right)}{2}} \]
   4. Add Preprocessing

   5. Taylor expanded in eps around 0 29.8%

      \[\leadsto \frac{\color{blue}{\frac{e^{-1 \cdot x} + \left(-1 \cdot e^{-1 \cdot x} + \varepsilon \cdot \left(2 \cdot e^{-1 \cdot x} + 2 \cdot \left(x \cdot e^{-1 \cdot x}\right)\right)\right)}{\varepsilon}}}{2} \]
   6. Step-by-step derivation

      1. associate-+r+ 66.6%

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

      2. distribute-rgt1-in 66.6%

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

      3. metadata-eval 66.6%

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

      4. mul0-lft 66.6%

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

      5. associate-*r* 66.6%

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

      6. distribute-rgt-out 66.6%

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

      7. mul-1-neg 66.6%

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

   7. Simplified 66.6%

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

   if 4.89999999999999972e-12 < eps

   1. Initial program 100.0%

      \[\frac{\left(1 + \frac{1}{\varepsilon}\right) \cdot e^{-\left(1 - \varepsilon\right) \cdot x} - \left(\frac{1}{\varepsilon} - 1\right) \cdot e^{-\left(1 + \varepsilon\right) \cdot x}}{2} \]

   3. Simplified 83.1%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(1 + \frac{1}{\varepsilon}, {\left(e^{x}\right)}^{\left(\varepsilon + -1\right)}, \frac{1 + \frac{-1}{\varepsilon}}{e^{\mathsf{fma}\left(\varepsilon, x, x\right)}}\right)}{2}} \]
   4. Add Preprocessing

   5. Taylor expanded in eps around inf 100.0%

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

   6. Taylor expanded in x around 0 64.4%

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

   7. Taylor expanded in eps around -inf 81.8%

      \[\leadsto \frac{\color{blue}{-1 \cdot \left(\varepsilon \cdot \left(x + -1 \cdot \frac{1 + \left(e^{-1 \cdot \left(x \cdot \left(1 + -1 \cdot \varepsilon\right)\right)} + -1 \cdot x\right)}{\varepsilon}\right)\right)}}{2} \]
   8. Step-by-step derivation

      1. associate-*r* 81.8%

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

      2. neg-mul-1 81.8%

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

      3. mul-1-neg 81.8%

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

      4. associate-*r* 81.8%

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

      5. neg-mul-1 81.8%

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

      6. neg-mul-1 81.8%

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

      7. neg-mul-1 81.8%

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

   9. Simplified 81.8%

      \[\leadsto \frac{\color{blue}{\left(-\varepsilon\right) \cdot \left(x + \left(-\frac{1 + \left(e^{\left(-x\right) \cdot \left(1 + \left(-\varepsilon\right)\right)} + \left(-x\right)\right)}{\varepsilon}\right)\right)}}{2} \]
3. Recombined 2 regimes into one program.

4. Final simplification 70.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\varepsilon \leq 4.9 \cdot 10^{-12}:\\ \;\;\;\;\frac{\frac{\varepsilon \cdot \left(e^{-x} \cdot \left(2 + x \cdot 2\right)\right)}{\varepsilon}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\varepsilon \cdot \left(\frac{1 - \left(x - e^{x \cdot \left(\varepsilon + -1\right)}\right)}{\varepsilon} - x\right)}{2}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 77.3% accurate, 2.0× speedup

Math

\[\begin{array}{l} eps_m = \left|\varepsilon\right| \\ \begin{array}{l} \mathbf{if}\;x \leq 210000:\\ \;\;\;\;\frac{1 + e^{x \cdot \left(-1 - eps\_m\right)}}{2}\\ \mathbf{elif}\;x \leq 8.2 \cdot 10^{+180}:\\ \;\;\;\;0\\ \mathbf{else}:\\ \;\;\;\;\frac{2 + x \cdot \left(-1 + x \cdot 0.5\right)}{2}\\ \end{array} \end{array} \]

FPCore

eps_m = (fabs.f64 eps)
(FPCore (x eps_m)
 :precision binary64
 (if (<= x 210000.0)
   (/ (+ 1.0 (exp (* x (- -1.0 eps_m)))) 2.0)
   (if (<= x 8.2e+180) 0.0 (/ (+ 2.0 (* x (+ -1.0 (* x 0.5)))) 2.0))))

C

eps_m = fabs(eps);
double code(double x, double eps_m) {
	double tmp;
	if (x <= 210000.0) {
		tmp = (1.0 + exp((x * (-1.0 - eps_m)))) / 2.0;
	} else if (x <= 8.2e+180) {
		tmp = 0.0;
	} else {
		tmp = (2.0 + (x * (-1.0 + (x * 0.5)))) / 2.0;
	}
	return tmp;
}

Fortran

eps_m = abs(eps)
real(8) function code(x, eps_m)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps_m
    real(8) :: tmp
    if (x <= 210000.0d0) then
        tmp = (1.0d0 + exp((x * ((-1.0d0) - eps_m)))) / 2.0d0
    else if (x <= 8.2d+180) then
        tmp = 0.0d0
    else
        tmp = (2.0d0 + (x * ((-1.0d0) + (x * 0.5d0)))) / 2.0d0
    end if
    code = tmp
end function

Java

eps_m = Math.abs(eps);
public static double code(double x, double eps_m) {
	double tmp;
	if (x <= 210000.0) {
		tmp = (1.0 + Math.exp((x * (-1.0 - eps_m)))) / 2.0;
	} else if (x <= 8.2e+180) {
		tmp = 0.0;
	} else {
		tmp = (2.0 + (x * (-1.0 + (x * 0.5)))) / 2.0;
	}
	return tmp;
}

Python

eps_m = math.fabs(eps)
def code(x, eps_m):
	tmp = 0
	if x <= 210000.0:
		tmp = (1.0 + math.exp((x * (-1.0 - eps_m)))) / 2.0
	elif x <= 8.2e+180:
		tmp = 0.0
	else:
		tmp = (2.0 + (x * (-1.0 + (x * 0.5)))) / 2.0
	return tmp

Julia

eps_m = abs(eps)
function code(x, eps_m)
	tmp = 0.0
	if (x <= 210000.0)
		tmp = Float64(Float64(1.0 + exp(Float64(x * Float64(-1.0 - eps_m)))) / 2.0);
	elseif (x <= 8.2e+180)
		tmp = 0.0;
	else
		tmp = Float64(Float64(2.0 + Float64(x * Float64(-1.0 + Float64(x * 0.5)))) / 2.0);
	end
	return tmp
end

MATLAB

eps_m = abs(eps);
function tmp_2 = code(x, eps_m)
	tmp = 0.0;
	if (x <= 210000.0)
		tmp = (1.0 + exp((x * (-1.0 - eps_m)))) / 2.0;
	elseif (x <= 8.2e+180)
		tmp = 0.0;
	else
		tmp = (2.0 + (x * (-1.0 + (x * 0.5)))) / 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

eps_m = N[Abs[eps], $MachinePrecision]
code[x_, eps$95$m_] := If[LessEqual[x, 210000.0], N[(N[(1.0 + N[Exp[N[(x * N[(-1.0 - eps$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], If[LessEqual[x, 8.2e+180], 0.0, N[(N[(2.0 + N[(x * N[(-1.0 + N[(x * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < 2.1e5

   1. Initial program 60.8%

      \[\frac{\left(1 + \frac{1}{\varepsilon}\right) \cdot e^{-\left(1 - \varepsilon\right) \cdot x} - \left(\frac{1}{\varepsilon} - 1\right) \cdot e^{-\left(1 + \varepsilon\right) \cdot x}}{2} \]

   3. Simplified 60.8%

      \[\leadsto \color{blue}{\frac{\left(1 + \frac{1}{\varepsilon}\right) \cdot e^{\left(1 - \varepsilon\right) \cdot \left(-x\right)} - \left(\frac{1}{\varepsilon} + -1\right) \cdot e^{\left(1 + \varepsilon\right) \cdot \left(-x\right)}}{2}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 33.8%

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

   6. Taylor expanded in eps around inf 71.8%

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

   7. Taylor expanded in eps around -inf 71.8%

      \[\leadsto \frac{\color{blue}{1 - -1 \cdot e^{-1 \cdot \left(x \cdot \left(1 - -1 \cdot \varepsilon\right)\right)}}}{2} \]
   8. Step-by-step derivation

      1. sub-neg 71.8%

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

      2. mul-1-neg 71.8%

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

      3. remove-double-neg 71.8%

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

      4. mul-1-neg 71.8%

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

      5. distribute-rgt-neg-in 71.8%

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

      6. sub-neg 71.8%

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

      7. neg-mul-1 71.8%

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

      8. remove-double-neg 71.8%

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

      9. distribute-neg-in 71.8%

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

      10. metadata-eval 71.8%

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

      11. unsub-neg 71.8%

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

   9. Simplified 71.8%

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

   if 2.1e5 < x < 8.2e180

   1. Initial program 100.0%

      \[\frac{\left(1 + \frac{1}{\varepsilon}\right) \cdot e^{-\left(1 - \varepsilon\right) \cdot x} - \left(\frac{1}{\varepsilon} - 1\right) \cdot e^{-\left(1 + \varepsilon\right) \cdot x}}{2} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(1 + \frac{1}{\varepsilon}, e^{x \cdot \left(\varepsilon + -1\right)}, {\left(e^{1 + \varepsilon}\right)}^{\left(-x\right)} \cdot \left(1 + \frac{-1}{\varepsilon}\right)\right)}{2}} \]
   4. Add Preprocessing

   5. Taylor expanded in eps around 0 62.8%

      \[\leadsto \frac{\color{blue}{\frac{e^{-1 \cdot x} + -1 \cdot e^{-1 \cdot x}}{\varepsilon}}}{2} \]
   6. Step-by-step derivation

      1. mul-1-neg 62.8%

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

      2. mul-1-neg 62.8%

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

      3. rec-exp 62.8%

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

      4. sub-neg 62.8%

         \[\leadsto \frac{\frac{\color{blue}{e^{-1 \cdot x} - \frac{1}{e^{x}}}}{\varepsilon}}{2} \]

      5. div-sub 62.8%

         \[\leadsto \frac{\color{blue}{\frac{e^{-1 \cdot x}}{\varepsilon} - \frac{\frac{1}{e^{x}}}{\varepsilon}}}{2} \]

      6. mul-1-neg 62.8%

         \[\leadsto \frac{\frac{e^{\color{blue}{-x}}}{\varepsilon} - \frac{\frac{1}{e^{x}}}{\varepsilon}}{2} \]

      7. rec-exp 62.8%

         \[\leadsto \frac{\frac{\color{blue}{\frac{1}{e^{x}}}}{\varepsilon} - \frac{\frac{1}{e^{x}}}{\varepsilon}}{2} \]

      8. +-inverses 62.8%

         \[\leadsto \frac{\color{blue}{0}}{2} \]

   7. Simplified 62.8%

      \[\leadsto \frac{\color{blue}{0}}{2} \]

   if 8.2e180 < x

   1. Initial program 100.0%

      \[\frac{\left(1 + \frac{1}{\varepsilon}\right) \cdot e^{-\left(1 - \varepsilon\right) \cdot x} - \left(\frac{1}{\varepsilon} - 1\right) \cdot e^{-\left(1 + \varepsilon\right) \cdot x}}{2} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(1 + \frac{1}{\varepsilon}, {\left(e^{x}\right)}^{\left(\varepsilon + -1\right)}, \frac{1 + \frac{-1}{\varepsilon}}{e^{\mathsf{fma}\left(\varepsilon, x, x\right)}}\right)}{2}} \]
   4. Add Preprocessing

   5. Taylor expanded in eps around inf 100.0%

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

   6. Taylor expanded in eps around inf 76.1%

      \[\leadsto \frac{e^{x \cdot \left(\varepsilon - 1\right)} + \frac{1}{e^{\color{blue}{\varepsilon \cdot x}}}}{2} \]
   7. Step-by-step derivation

      1. *-commutative 76.1%

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

   8. Simplified 76.1%

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

   9. Taylor expanded in eps around 0 3.1%

      \[\leadsto \frac{\color{blue}{1 + e^{-1 \cdot x}}}{2} \]
   10. Step-by-step derivation

       1. neg-mul-1 3.1%

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

   11. Simplified 3.1%

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

   12. Taylor expanded in x around 0 56.8%

       \[\leadsto \frac{\color{blue}{2 + x \cdot \left(0.5 \cdot x - 1\right)}}{2} \]
3. Recombined 3 regimes into one program.

4. Final simplification 68.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 210000:\\ \;\;\;\;\frac{1 + e^{x \cdot \left(-1 - \varepsilon\right)}}{2}\\ \mathbf{elif}\;x \leq 8.2 \cdot 10^{+180}:\\ \;\;\;\;0\\ \mathbf{else}:\\ \;\;\;\;\frac{2 + x \cdot \left(-1 + x \cdot 0.5\right)}{2}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 70.0% accurate, 2.0× speedup

Math

\[\begin{array}{l} eps_m = \left|\varepsilon\right| \\ \begin{array}{l} \mathbf{if}\;x \leq 210000:\\ \;\;\;\;\frac{1 + e^{-x}}{2}\\ \mathbf{elif}\;x \leq 9.2 \cdot 10^{+180}:\\ \;\;\;\;0\\ \mathbf{else}:\\ \;\;\;\;\frac{2 + x \cdot \left(-1 + x \cdot 0.5\right)}{2}\\ \end{array} \end{array} \]

FPCore

eps_m = (fabs.f64 eps)
(FPCore (x eps_m)
 :precision binary64
 (if (<= x 210000.0)
   (/ (+ 1.0 (exp (- x))) 2.0)
   (if (<= x 9.2e+180) 0.0 (/ (+ 2.0 (* x (+ -1.0 (* x 0.5)))) 2.0))))

C

eps_m = fabs(eps);
double code(double x, double eps_m) {
	double tmp;
	if (x <= 210000.0) {
		tmp = (1.0 + exp(-x)) / 2.0;
	} else if (x <= 9.2e+180) {
		tmp = 0.0;
	} else {
		tmp = (2.0 + (x * (-1.0 + (x * 0.5)))) / 2.0;
	}
	return tmp;
}

Fortran

eps_m = abs(eps)
real(8) function code(x, eps_m)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps_m
    real(8) :: tmp
    if (x <= 210000.0d0) then
        tmp = (1.0d0 + exp(-x)) / 2.0d0
    else if (x <= 9.2d+180) then
        tmp = 0.0d0
    else
        tmp = (2.0d0 + (x * ((-1.0d0) + (x * 0.5d0)))) / 2.0d0
    end if
    code = tmp
end function

Java

eps_m = Math.abs(eps);
public static double code(double x, double eps_m) {
	double tmp;
	if (x <= 210000.0) {
		tmp = (1.0 + Math.exp(-x)) / 2.0;
	} else if (x <= 9.2e+180) {
		tmp = 0.0;
	} else {
		tmp = (2.0 + (x * (-1.0 + (x * 0.5)))) / 2.0;
	}
	return tmp;
}

Python

eps_m = math.fabs(eps)
def code(x, eps_m):
	tmp = 0
	if x <= 210000.0:
		tmp = (1.0 + math.exp(-x)) / 2.0
	elif x <= 9.2e+180:
		tmp = 0.0
	else:
		tmp = (2.0 + (x * (-1.0 + (x * 0.5)))) / 2.0
	return tmp

Julia

eps_m = abs(eps)
function code(x, eps_m)
	tmp = 0.0
	if (x <= 210000.0)
		tmp = Float64(Float64(1.0 + exp(Float64(-x))) / 2.0);
	elseif (x <= 9.2e+180)
		tmp = 0.0;
	else
		tmp = Float64(Float64(2.0 + Float64(x * Float64(-1.0 + Float64(x * 0.5)))) / 2.0);
	end
	return tmp
end

MATLAB

eps_m = abs(eps);
function tmp_2 = code(x, eps_m)
	tmp = 0.0;
	if (x <= 210000.0)
		tmp = (1.0 + exp(-x)) / 2.0;
	elseif (x <= 9.2e+180)
		tmp = 0.0;
	else
		tmp = (2.0 + (x * (-1.0 + (x * 0.5)))) / 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

eps_m = N[Abs[eps], $MachinePrecision]
code[x_, eps$95$m_] := If[LessEqual[x, 210000.0], N[(N[(1.0 + N[Exp[(-x)], $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], If[LessEqual[x, 9.2e+180], 0.0, N[(N[(2.0 + N[(x * N[(-1.0 + N[(x * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < 2.1e5

   1. Initial program 60.8%

      \[\frac{\left(1 + \frac{1}{\varepsilon}\right) \cdot e^{-\left(1 - \varepsilon\right) \cdot x} - \left(\frac{1}{\varepsilon} - 1\right) \cdot e^{-\left(1 + \varepsilon\right) \cdot x}}{2} \]

   3. Simplified 49.6%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(1 + \frac{1}{\varepsilon}, {\left(e^{x}\right)}^{\left(\varepsilon + -1\right)}, \frac{1 + \frac{-1}{\varepsilon}}{e^{\mathsf{fma}\left(\varepsilon, x, x\right)}}\right)}{2}} \]
   4. Add Preprocessing

   5. Taylor expanded in eps around inf 98.8%

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

   6. Taylor expanded in eps around inf 98.8%

      \[\leadsto \frac{e^{x \cdot \left(\varepsilon - 1\right)} + \frac{1}{e^{\color{blue}{\varepsilon \cdot x}}}}{2} \]
   7. Step-by-step derivation

      1. *-commutative 98.8%

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

   8. Simplified 98.8%

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

   9. Taylor expanded in eps around 0 77.9%

      \[\leadsto \frac{\color{blue}{1 + e^{-1 \cdot x}}}{2} \]
   10. Step-by-step derivation

       1. neg-mul-1 77.9%

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

   11. Simplified 77.9%

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

   if 2.1e5 < x < 9.1999999999999995e180

   1. Initial program 100.0%

      \[\frac{\left(1 + \frac{1}{\varepsilon}\right) \cdot e^{-\left(1 - \varepsilon\right) \cdot x} - \left(\frac{1}{\varepsilon} - 1\right) \cdot e^{-\left(1 + \varepsilon\right) \cdot x}}{2} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(1 + \frac{1}{\varepsilon}, e^{x \cdot \left(\varepsilon + -1\right)}, {\left(e^{1 + \varepsilon}\right)}^{\left(-x\right)} \cdot \left(1 + \frac{-1}{\varepsilon}\right)\right)}{2}} \]
   4. Add Preprocessing

   5. Taylor expanded in eps around 0 62.8%

      \[\leadsto \frac{\color{blue}{\frac{e^{-1 \cdot x} + -1 \cdot e^{-1 \cdot x}}{\varepsilon}}}{2} \]
   6. Step-by-step derivation

      1. mul-1-neg 62.8%

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

      2. mul-1-neg 62.8%

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

      3. rec-exp 62.8%

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

      4. sub-neg 62.8%

         \[\leadsto \frac{\frac{\color{blue}{e^{-1 \cdot x} - \frac{1}{e^{x}}}}{\varepsilon}}{2} \]

      5. div-sub 62.8%

         \[\leadsto \frac{\color{blue}{\frac{e^{-1 \cdot x}}{\varepsilon} - \frac{\frac{1}{e^{x}}}{\varepsilon}}}{2} \]

      6. mul-1-neg 62.8%

         \[\leadsto \frac{\frac{e^{\color{blue}{-x}}}{\varepsilon} - \frac{\frac{1}{e^{x}}}{\varepsilon}}{2} \]

      7. rec-exp 62.8%

         \[\leadsto \frac{\frac{\color{blue}{\frac{1}{e^{x}}}}{\varepsilon} - \frac{\frac{1}{e^{x}}}{\varepsilon}}{2} \]

      8. +-inverses 62.8%

         \[\leadsto \frac{\color{blue}{0}}{2} \]

   7. Simplified 62.8%

      \[\leadsto \frac{\color{blue}{0}}{2} \]

   if 9.1999999999999995e180 < x

   1. Initial program 100.0%

      \[\frac{\left(1 + \frac{1}{\varepsilon}\right) \cdot e^{-\left(1 - \varepsilon\right) \cdot x} - \left(\frac{1}{\varepsilon} - 1\right) \cdot e^{-\left(1 + \varepsilon\right) \cdot x}}{2} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(1 + \frac{1}{\varepsilon}, {\left(e^{x}\right)}^{\left(\varepsilon + -1\right)}, \frac{1 + \frac{-1}{\varepsilon}}{e^{\mathsf{fma}\left(\varepsilon, x, x\right)}}\right)}{2}} \]
   4. Add Preprocessing

   5. Taylor expanded in eps around inf 100.0%

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

   6. Taylor expanded in eps around inf 76.1%

      \[\leadsto \frac{e^{x \cdot \left(\varepsilon - 1\right)} + \frac{1}{e^{\color{blue}{\varepsilon \cdot x}}}}{2} \]
   7. Step-by-step derivation

      1. *-commutative 76.1%

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

   8. Simplified 76.1%

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

   9. Taylor expanded in eps around 0 3.1%

      \[\leadsto \frac{\color{blue}{1 + e^{-1 \cdot x}}}{2} \]
   10. Step-by-step derivation

       1. neg-mul-1 3.1%

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

   11. Simplified 3.1%

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

   12. Taylor expanded in x around 0 56.8%

       \[\leadsto \frac{\color{blue}{2 + x \cdot \left(0.5 \cdot x - 1\right)}}{2} \]
3. Recombined 3 regimes into one program.

4. Final simplification 72.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 210000:\\ \;\;\;\;\frac{1 + e^{-x}}{2}\\ \mathbf{elif}\;x \leq 9.2 \cdot 10^{+180}:\\ \;\;\;\;0\\ \mathbf{else}:\\ \;\;\;\;\frac{2 + x \cdot \left(-1 + x \cdot 0.5\right)}{2}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 63.7% accurate, 10.8× speedup

Math

\[\begin{array}{l} eps_m = \left|\varepsilon\right| \\ \begin{array}{l} \mathbf{if}\;x \leq 210000 \lor \neg \left(x \leq 8.8 \cdot 10^{+180}\right):\\ \;\;\;\;\frac{2 + x \cdot \left(-1 + x \cdot 0.5\right)}{2}\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]

FPCore

eps_m = (fabs.f64 eps)
(FPCore (x eps_m)
 :precision binary64
 (if (or (<= x 210000.0) (not (<= x 8.8e+180)))
   (/ (+ 2.0 (* x (+ -1.0 (* x 0.5)))) 2.0)
   0.0))

C

eps_m = fabs(eps);
double code(double x, double eps_m) {
	double tmp;
	if ((x <= 210000.0) || !(x <= 8.8e+180)) {
		tmp = (2.0 + (x * (-1.0 + (x * 0.5)))) / 2.0;
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Fortran

eps_m = abs(eps)
real(8) function code(x, eps_m)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps_m
    real(8) :: tmp
    if ((x <= 210000.0d0) .or. (.not. (x <= 8.8d+180))) then
        tmp = (2.0d0 + (x * ((-1.0d0) + (x * 0.5d0)))) / 2.0d0
    else
        tmp = 0.0d0
    end if
    code = tmp
end function

Java

eps_m = Math.abs(eps);
public static double code(double x, double eps_m) {
	double tmp;
	if ((x <= 210000.0) || !(x <= 8.8e+180)) {
		tmp = (2.0 + (x * (-1.0 + (x * 0.5)))) / 2.0;
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

eps_m = math.fabs(eps)
def code(x, eps_m):
	tmp = 0
	if (x <= 210000.0) or not (x <= 8.8e+180):
		tmp = (2.0 + (x * (-1.0 + (x * 0.5)))) / 2.0
	else:
		tmp = 0.0
	return tmp

Julia

eps_m = abs(eps)
function code(x, eps_m)
	tmp = 0.0
	if ((x <= 210000.0) || !(x <= 8.8e+180))
		tmp = Float64(Float64(2.0 + Float64(x * Float64(-1.0 + Float64(x * 0.5)))) / 2.0);
	else
		tmp = 0.0;
	end
	return tmp
end

MATLAB

eps_m = abs(eps);
function tmp_2 = code(x, eps_m)
	tmp = 0.0;
	if ((x <= 210000.0) || ~((x <= 8.8e+180)))
		tmp = (2.0 + (x * (-1.0 + (x * 0.5)))) / 2.0;
	else
		tmp = 0.0;
	end
	tmp_2 = tmp;
end

Wolfram

eps_m = N[Abs[eps], $MachinePrecision]
code[x_, eps$95$m_] := If[Or[LessEqual[x, 210000.0], N[Not[LessEqual[x, 8.8e+180]], $MachinePrecision]], N[(N[(2.0 + N[(x * N[(-1.0 + N[(x * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], 0.0]

Derivation

1. Split input into 2 regimes

2. if x < 2.1e5 or 8.7999999999999997e180 < x

   1. Initial program 68.2%

      \[\frac{\left(1 + \frac{1}{\varepsilon}\right) \cdot e^{-\left(1 - \varepsilon\right) \cdot x} - \left(\frac{1}{\varepsilon} - 1\right) \cdot e^{-\left(1 + \varepsilon\right) \cdot x}}{2} \]

   3. Simplified 59.1%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(1 + \frac{1}{\varepsilon}, {\left(e^{x}\right)}^{\left(\varepsilon + -1\right)}, \frac{1 + \frac{-1}{\varepsilon}}{e^{\mathsf{fma}\left(\varepsilon, x, x\right)}}\right)}{2}} \]
   4. Add Preprocessing

   5. Taylor expanded in eps around inf 99.0%

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

   6. Taylor expanded in eps around inf 94.5%

      \[\leadsto \frac{e^{x \cdot \left(\varepsilon - 1\right)} + \frac{1}{e^{\color{blue}{\varepsilon \cdot x}}}}{2} \]
   7. Step-by-step derivation

      1. *-commutative 94.5%

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

   8. Simplified 94.5%

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

   9. Taylor expanded in eps around 0 63.9%

      \[\leadsto \frac{\color{blue}{1 + e^{-1 \cdot x}}}{2} \]
   10. Step-by-step derivation

       1. neg-mul-1 63.9%

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

   11. Simplified 63.9%

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

   12. Taylor expanded in x around 0 65.7%

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

   if 2.1e5 < x < 8.7999999999999997e180

   1. Initial program 100.0%

      \[\frac{\left(1 + \frac{1}{\varepsilon}\right) \cdot e^{-\left(1 - \varepsilon\right) \cdot x} - \left(\frac{1}{\varepsilon} - 1\right) \cdot e^{-\left(1 + \varepsilon\right) \cdot x}}{2} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(1 + \frac{1}{\varepsilon}, e^{x \cdot \left(\varepsilon + -1\right)}, {\left(e^{1 + \varepsilon}\right)}^{\left(-x\right)} \cdot \left(1 + \frac{-1}{\varepsilon}\right)\right)}{2}} \]
   4. Add Preprocessing

   5. Taylor expanded in eps around 0 62.8%

      \[\leadsto \frac{\color{blue}{\frac{e^{-1 \cdot x} + -1 \cdot e^{-1 \cdot x}}{\varepsilon}}}{2} \]
   6. Step-by-step derivation

      1. mul-1-neg 62.8%

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

      2. mul-1-neg 62.8%

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

      3. rec-exp 62.8%

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

      4. sub-neg 62.8%

         \[\leadsto \frac{\frac{\color{blue}{e^{-1 \cdot x} - \frac{1}{e^{x}}}}{\varepsilon}}{2} \]

      5. div-sub 62.8%

         \[\leadsto \frac{\color{blue}{\frac{e^{-1 \cdot x}}{\varepsilon} - \frac{\frac{1}{e^{x}}}{\varepsilon}}}{2} \]

      6. mul-1-neg 62.8%

         \[\leadsto \frac{\frac{e^{\color{blue}{-x}}}{\varepsilon} - \frac{\frac{1}{e^{x}}}{\varepsilon}}{2} \]

      7. rec-exp 62.8%

         \[\leadsto \frac{\frac{\color{blue}{\frac{1}{e^{x}}}}{\varepsilon} - \frac{\frac{1}{e^{x}}}{\varepsilon}}{2} \]

      8. +-inverses 62.8%

         \[\leadsto \frac{\color{blue}{0}}{2} \]

   7. Simplified 62.8%

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

4. Final simplification 65.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 210000 \lor \neg \left(x \leq 8.8 \cdot 10^{+180}\right):\\ \;\;\;\;\frac{2 + x \cdot \left(-1 + x \cdot 0.5\right)}{2}\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 65.8% accurate, 10.8× speedup

Math

\[\begin{array}{l} eps_m = \left|\varepsilon\right| \\ \begin{array}{l} \mathbf{if}\;x \leq 2.5:\\ \;\;\;\;\frac{2 + x \cdot \left(-1 + x \cdot \left(0.5 + x \cdot -0.16666666666666666\right)\right)}{2}\\ \mathbf{elif}\;x \leq 9.2 \cdot 10^{+180}:\\ \;\;\;\;0\\ \mathbf{else}:\\ \;\;\;\;\frac{2 + x \cdot \left(-1 + x \cdot 0.5\right)}{2}\\ \end{array} \end{array} \]

FPCore

eps_m = (fabs.f64 eps)
(FPCore (x eps_m)
 :precision binary64
 (if (<= x 2.5)
   (/ (+ 2.0 (* x (+ -1.0 (* x (+ 0.5 (* x -0.16666666666666666)))))) 2.0)
   (if (<= x 9.2e+180) 0.0 (/ (+ 2.0 (* x (+ -1.0 (* x 0.5)))) 2.0))))

C

eps_m = fabs(eps);
double code(double x, double eps_m) {
	double tmp;
	if (x <= 2.5) {
		tmp = (2.0 + (x * (-1.0 + (x * (0.5 + (x * -0.16666666666666666)))))) / 2.0;
	} else if (x <= 9.2e+180) {
		tmp = 0.0;
	} else {
		tmp = (2.0 + (x * (-1.0 + (x * 0.5)))) / 2.0;
	}
	return tmp;
}

Fortran

eps_m = abs(eps)
real(8) function code(x, eps_m)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps_m
    real(8) :: tmp
    if (x <= 2.5d0) then
        tmp = (2.0d0 + (x * ((-1.0d0) + (x * (0.5d0 + (x * (-0.16666666666666666d0))))))) / 2.0d0
    else if (x <= 9.2d+180) then
        tmp = 0.0d0
    else
        tmp = (2.0d0 + (x * ((-1.0d0) + (x * 0.5d0)))) / 2.0d0
    end if
    code = tmp
end function

Java

eps_m = Math.abs(eps);
public static double code(double x, double eps_m) {
	double tmp;
	if (x <= 2.5) {
		tmp = (2.0 + (x * (-1.0 + (x * (0.5 + (x * -0.16666666666666666)))))) / 2.0;
	} else if (x <= 9.2e+180) {
		tmp = 0.0;
	} else {
		tmp = (2.0 + (x * (-1.0 + (x * 0.5)))) / 2.0;
	}
	return tmp;
}

Python

eps_m = math.fabs(eps)
def code(x, eps_m):
	tmp = 0
	if x <= 2.5:
		tmp = (2.0 + (x * (-1.0 + (x * (0.5 + (x * -0.16666666666666666)))))) / 2.0
	elif x <= 9.2e+180:
		tmp = 0.0
	else:
		tmp = (2.0 + (x * (-1.0 + (x * 0.5)))) / 2.0
	return tmp

Julia

eps_m = abs(eps)
function code(x, eps_m)
	tmp = 0.0
	if (x <= 2.5)
		tmp = Float64(Float64(2.0 + Float64(x * Float64(-1.0 + Float64(x * Float64(0.5 + Float64(x * -0.16666666666666666)))))) / 2.0);
	elseif (x <= 9.2e+180)
		tmp = 0.0;
	else
		tmp = Float64(Float64(2.0 + Float64(x * Float64(-1.0 + Float64(x * 0.5)))) / 2.0);
	end
	return tmp
end

MATLAB

eps_m = abs(eps);
function tmp_2 = code(x, eps_m)
	tmp = 0.0;
	if (x <= 2.5)
		tmp = (2.0 + (x * (-1.0 + (x * (0.5 + (x * -0.16666666666666666)))))) / 2.0;
	elseif (x <= 9.2e+180)
		tmp = 0.0;
	else
		tmp = (2.0 + (x * (-1.0 + (x * 0.5)))) / 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

eps_m = N[Abs[eps], $MachinePrecision]
code[x_, eps$95$m_] := If[LessEqual[x, 2.5], N[(N[(2.0 + N[(x * N[(-1.0 + N[(x * N[(0.5 + N[(x * -0.16666666666666666), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], If[LessEqual[x, 9.2e+180], 0.0, N[(N[(2.0 + N[(x * N[(-1.0 + N[(x * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < 2.5

   1. Initial program 60.9%

      \[\frac{\left(1 + \frac{1}{\varepsilon}\right) \cdot e^{-\left(1 - \varepsilon\right) \cdot x} - \left(\frac{1}{\varepsilon} - 1\right) \cdot e^{-\left(1 + \varepsilon\right) \cdot x}}{2} \]

   3. Simplified 49.6%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(1 + \frac{1}{\varepsilon}, {\left(e^{x}\right)}^{\left(\varepsilon + -1\right)}, \frac{1 + \frac{-1}{\varepsilon}}{e^{\mathsf{fma}\left(\varepsilon, x, x\right)}}\right)}{2}} \]
   4. Add Preprocessing

   5. Taylor expanded in eps around inf 99.2%

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

   6. Taylor expanded in eps around inf 99.2%

      \[\leadsto \frac{e^{x \cdot \left(\varepsilon - 1\right)} + \frac{1}{e^{\color{blue}{\varepsilon \cdot x}}}}{2} \]
   7. Step-by-step derivation

      1. *-commutative 99.2%

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

   8. Simplified 99.2%

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

   9. Taylor expanded in eps around 0 78.7%

      \[\leadsto \frac{\color{blue}{1 + e^{-1 \cdot x}}}{2} \]
   10. Step-by-step derivation

       1. neg-mul-1 78.7%

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

   11. Simplified 78.7%

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

   12. Taylor expanded in x around 0 71.6%

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

   if 2.5 < x < 9.1999999999999995e180

   1. Initial program 97.5%

      \[\frac{\left(1 + \frac{1}{\varepsilon}\right) \cdot e^{-\left(1 - \varepsilon\right) \cdot x} - \left(\frac{1}{\varepsilon} - 1\right) \cdot e^{-\left(1 + \varepsilon\right) \cdot x}}{2} \]

   3. Simplified 97.5%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(1 + \frac{1}{\varepsilon}, e^{x \cdot \left(\varepsilon + -1\right)}, {\left(e^{1 + \varepsilon}\right)}^{\left(-x\right)} \cdot \left(1 + \frac{-1}{\varepsilon}\right)\right)}{2}} \]
   4. Add Preprocessing

   5. Taylor expanded in eps around 0 59.7%

      \[\leadsto \frac{\color{blue}{\frac{e^{-1 \cdot x} + -1 \cdot e^{-1 \cdot x}}{\varepsilon}}}{2} \]
   6. Step-by-step derivation

      1. mul-1-neg 59.7%

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

      2. mul-1-neg 59.7%

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

      3. rec-exp 59.6%

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

      4. sub-neg 59.6%

         \[\leadsto \frac{\frac{\color{blue}{e^{-1 \cdot x} - \frac{1}{e^{x}}}}{\varepsilon}}{2} \]

      5. div-sub 59.6%

         \[\leadsto \frac{\color{blue}{\frac{e^{-1 \cdot x}}{\varepsilon} - \frac{\frac{1}{e^{x}}}{\varepsilon}}}{2} \]

      6. mul-1-neg 59.6%

         \[\leadsto \frac{\frac{e^{\color{blue}{-x}}}{\varepsilon} - \frac{\frac{1}{e^{x}}}{\varepsilon}}{2} \]

      7. rec-exp 59.7%

         \[\leadsto \frac{\frac{\color{blue}{\frac{1}{e^{x}}}}{\varepsilon} - \frac{\frac{1}{e^{x}}}{\varepsilon}}{2} \]

      8. +-inverses 59.7%

         \[\leadsto \frac{\color{blue}{0}}{2} \]

   7. Simplified 59.7%

      \[\leadsto \frac{\color{blue}{0}}{2} \]

   if 9.1999999999999995e180 < x

   1. Initial program 100.0%

      \[\frac{\left(1 + \frac{1}{\varepsilon}\right) \cdot e^{-\left(1 - \varepsilon\right) \cdot x} - \left(\frac{1}{\varepsilon} - 1\right) \cdot e^{-\left(1 + \varepsilon\right) \cdot x}}{2} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(1 + \frac{1}{\varepsilon}, {\left(e^{x}\right)}^{\left(\varepsilon + -1\right)}, \frac{1 + \frac{-1}{\varepsilon}}{e^{\mathsf{fma}\left(\varepsilon, x, x\right)}}\right)}{2}} \]
   4. Add Preprocessing

   5. Taylor expanded in eps around inf 100.0%

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

   6. Taylor expanded in eps around inf 76.1%

      \[\leadsto \frac{e^{x \cdot \left(\varepsilon - 1\right)} + \frac{1}{e^{\color{blue}{\varepsilon \cdot x}}}}{2} \]
   7. Step-by-step derivation

      1. *-commutative 76.1%

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

   8. Simplified 76.1%

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

   9. Taylor expanded in eps around 0 3.1%

      \[\leadsto \frac{\color{blue}{1 + e^{-1 \cdot x}}}{2} \]
   10. Step-by-step derivation

       1. neg-mul-1 3.1%

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

   11. Simplified 3.1%

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

   12. Taylor expanded in x around 0 56.8%

       \[\leadsto \frac{\color{blue}{2 + x \cdot \left(0.5 \cdot x - 1\right)}}{2} \]
3. Recombined 3 regimes into one program.

4. Final simplification 67.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 2.5:\\ \;\;\;\;\frac{2 + x \cdot \left(-1 + x \cdot \left(0.5 + x \cdot -0.16666666666666666\right)\right)}{2}\\ \mathbf{elif}\;x \leq 9.2 \cdot 10^{+180}:\\ \;\;\;\;0\\ \mathbf{else}:\\ \;\;\;\;\frac{2 + x \cdot \left(-1 + x \cdot 0.5\right)}{2}\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 63.9% accurate, 20.6× speedup

Math

\[\begin{array}{l} eps_m = \left|\varepsilon\right| \\ \begin{array}{l} \mathbf{if}\;x \leq -1:\\ \;\;\;\;\frac{x \cdot eps\_m}{-2}\\ \mathbf{elif}\;x \leq 210000:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]

FPCore

eps_m = (fabs.f64 eps)
(FPCore (x eps_m)
 :precision binary64
 (if (<= x -1.0) (/ (* x eps_m) (- 2.0)) (if (<= x 210000.0) 1.0 0.0)))

C

eps_m = fabs(eps);
double code(double x, double eps_m) {
	double tmp;
	if (x <= -1.0) {
		tmp = (x * eps_m) / -2.0;
	} else if (x <= 210000.0) {
		tmp = 1.0;
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Fortran

eps_m = abs(eps)
real(8) function code(x, eps_m)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps_m
    real(8) :: tmp
    if (x <= (-1.0d0)) then
        tmp = (x * eps_m) / -2.0d0
    else if (x <= 210000.0d0) then
        tmp = 1.0d0
    else
        tmp = 0.0d0
    end if
    code = tmp
end function

Java

eps_m = Math.abs(eps);
public static double code(double x, double eps_m) {
	double tmp;
	if (x <= -1.0) {
		tmp = (x * eps_m) / -2.0;
	} else if (x <= 210000.0) {
		tmp = 1.0;
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

eps_m = math.fabs(eps)
def code(x, eps_m):
	tmp = 0
	if x <= -1.0:
		tmp = (x * eps_m) / -2.0
	elif x <= 210000.0:
		tmp = 1.0
	else:
		tmp = 0.0
	return tmp

Julia

eps_m = abs(eps)
function code(x, eps_m)
	tmp = 0.0
	if (x <= -1.0)
		tmp = Float64(Float64(x * eps_m) / Float64(-2.0));
	elseif (x <= 210000.0)
		tmp = 1.0;
	else
		tmp = 0.0;
	end
	return tmp
end

MATLAB

eps_m = abs(eps);
function tmp_2 = code(x, eps_m)
	tmp = 0.0;
	if (x <= -1.0)
		tmp = (x * eps_m) / -2.0;
	elseif (x <= 210000.0)
		tmp = 1.0;
	else
		tmp = 0.0;
	end
	tmp_2 = tmp;
end

Wolfram

eps_m = N[Abs[eps], $MachinePrecision]
code[x_, eps$95$m_] := If[LessEqual[x, -1.0], N[(N[(x * eps$95$m), $MachinePrecision] / (-2.0)), $MachinePrecision], If[LessEqual[x, 210000.0], 1.0, 0.0]]

Derivation

1. Split input into 3 regimes

2. if x < -1

   1. Initial program 100.0%

      \[\frac{\left(1 + \frac{1}{\varepsilon}\right) \cdot e^{-\left(1 - \varepsilon\right) \cdot x} - \left(\frac{1}{\varepsilon} - 1\right) \cdot e^{-\left(1 + \varepsilon\right) \cdot x}}{2} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(1 + \frac{1}{\varepsilon}, {\left(e^{x}\right)}^{\left(\varepsilon + -1\right)}, \frac{1 + \frac{-1}{\varepsilon}}{e^{\mathsf{fma}\left(\varepsilon, x, x\right)}}\right)}{2}} \]
   4. Add Preprocessing

   5. Taylor expanded in eps around inf 100.0%

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

   6. Taylor expanded in x around 0 48.5%

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

   7. Taylor expanded in eps around inf 13.6%

      \[\leadsto \frac{\color{blue}{-1 \cdot \left(\varepsilon \cdot x\right)}}{2} \]
   8. Step-by-step derivation

      1. mul-1-neg 13.6%

         \[\leadsto \frac{\color{blue}{-\varepsilon \cdot x}}{2} \]

      2. *-commutative 13.6%

         \[\leadsto \frac{-\color{blue}{x \cdot \varepsilon}}{2} \]

      3. distribute-rgt-neg-in 13.6%

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

   9. Simplified 13.6%

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

   if -1 < x < 2.1e5

   1. Initial program 49.5%

      \[\frac{\left(1 + \frac{1}{\varepsilon}\right) \cdot e^{-\left(1 - \varepsilon\right) \cdot x} - \left(\frac{1}{\varepsilon} - 1\right) \cdot e^{-\left(1 + \varepsilon\right) \cdot x}}{2} \]

   3. Simplified 49.5%

      \[\leadsto \color{blue}{\frac{\left(1 + \frac{1}{\varepsilon}\right) \cdot e^{\left(1 - \varepsilon\right) \cdot \left(-x\right)} - \left(\frac{1}{\varepsilon} + -1\right) \cdot e^{\left(1 + \varepsilon\right) \cdot \left(-x\right)}}{2}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 72.6%

      \[\leadsto \frac{\color{blue}{2}}{2} \]

   if 2.1e5 < x

   1. Initial program 100.0%

      \[\frac{\left(1 + \frac{1}{\varepsilon}\right) \cdot e^{-\left(1 - \varepsilon\right) \cdot x} - \left(\frac{1}{\varepsilon} - 1\right) \cdot e^{-\left(1 + \varepsilon\right) \cdot x}}{2} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(1 + \frac{1}{\varepsilon}, e^{x \cdot \left(\varepsilon + -1\right)}, {\left(e^{1 + \varepsilon}\right)}^{\left(-x\right)} \cdot \left(1 + \frac{-1}{\varepsilon}\right)\right)}{2}} \]
   4. Add Preprocessing

   5. Taylor expanded in eps around 0 53.3%

      \[\leadsto \frac{\color{blue}{\frac{e^{-1 \cdot x} + -1 \cdot e^{-1 \cdot x}}{\varepsilon}}}{2} \]
   6. Step-by-step derivation

      1. mul-1-neg 53.3%

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

      2. mul-1-neg 53.3%

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

      3. rec-exp 53.3%

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

      4. sub-neg 53.3%

         \[\leadsto \frac{\frac{\color{blue}{e^{-1 \cdot x} - \frac{1}{e^{x}}}}{\varepsilon}}{2} \]

      5. div-sub 53.3%

         \[\leadsto \frac{\color{blue}{\frac{e^{-1 \cdot x}}{\varepsilon} - \frac{\frac{1}{e^{x}}}{\varepsilon}}}{2} \]

      6. mul-1-neg 53.3%

         \[\leadsto \frac{\frac{e^{\color{blue}{-x}}}{\varepsilon} - \frac{\frac{1}{e^{x}}}{\varepsilon}}{2} \]

      7. rec-exp 53.3%

         \[\leadsto \frac{\frac{\color{blue}{\frac{1}{e^{x}}}}{\varepsilon} - \frac{\frac{1}{e^{x}}}{\varepsilon}}{2} \]

      8. +-inverses 53.3%

         \[\leadsto \frac{\color{blue}{0}}{2} \]

   7. Simplified 53.3%

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

4. Final simplification 57.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1:\\ \;\;\;\;\frac{x \cdot \varepsilon}{-2}\\ \mathbf{elif}\;x \leq 210000:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 57.5% accurate, 22.7× speedup

Math

\[\begin{array}{l} eps_m = \left|\varepsilon\right| \\ \begin{array}{l} \mathbf{if}\;x \leq 2:\\ \;\;\;\;\frac{2 - x}{2}\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]

FPCore

eps_m = (fabs.f64 eps)
(FPCore (x eps_m) :precision binary64 (if (<= x 2.0) (/ (- 2.0 x) 2.0) 0.0))

C

eps_m = fabs(eps);
double code(double x, double eps_m) {
	double tmp;
	if (x <= 2.0) {
		tmp = (2.0 - x) / 2.0;
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Fortran

eps_m = abs(eps)
real(8) function code(x, eps_m)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps_m
    real(8) :: tmp
    if (x <= 2.0d0) then
        tmp = (2.0d0 - x) / 2.0d0
    else
        tmp = 0.0d0
    end if
    code = tmp
end function

Java

eps_m = Math.abs(eps);
public static double code(double x, double eps_m) {
	double tmp;
	if (x <= 2.0) {
		tmp = (2.0 - x) / 2.0;
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

eps_m = math.fabs(eps)
def code(x, eps_m):
	tmp = 0
	if x <= 2.0:
		tmp = (2.0 - x) / 2.0
	else:
		tmp = 0.0
	return tmp

Julia

eps_m = abs(eps)
function code(x, eps_m)
	tmp = 0.0
	if (x <= 2.0)
		tmp = Float64(Float64(2.0 - x) / 2.0);
	else
		tmp = 0.0;
	end
	return tmp
end

MATLAB

eps_m = abs(eps);
function tmp_2 = code(x, eps_m)
	tmp = 0.0;
	if (x <= 2.0)
		tmp = (2.0 - x) / 2.0;
	else
		tmp = 0.0;
	end
	tmp_2 = tmp;
end

Wolfram

eps_m = N[Abs[eps], $MachinePrecision]
code[x_, eps$95$m_] := If[LessEqual[x, 2.0], N[(N[(2.0 - x), $MachinePrecision] / 2.0), $MachinePrecision], 0.0]

Derivation

1. Split input into 2 regimes

2. if x < 2

   1. Initial program 60.9%

      \[\frac{\left(1 + \frac{1}{\varepsilon}\right) \cdot e^{-\left(1 - \varepsilon\right) \cdot x} - \left(\frac{1}{\varepsilon} - 1\right) \cdot e^{-\left(1 + \varepsilon\right) \cdot x}}{2} \]

   3. Simplified 49.6%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(1 + \frac{1}{\varepsilon}, {\left(e^{x}\right)}^{\left(\varepsilon + -1\right)}, \frac{1 + \frac{-1}{\varepsilon}}{e^{\mathsf{fma}\left(\varepsilon, x, x\right)}}\right)}{2}} \]
   4. Add Preprocessing

   5. Taylor expanded in eps around inf 99.2%

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

   6. Taylor expanded in eps around inf 99.2%

      \[\leadsto \frac{e^{x \cdot \left(\varepsilon - 1\right)} + \frac{1}{e^{\color{blue}{\varepsilon \cdot x}}}}{2} \]
   7. Step-by-step derivation

      1. *-commutative 99.2%

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

   8. Simplified 99.2%

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

   9. Taylor expanded in x around 0 57.7%

      \[\leadsto \frac{\color{blue}{2 + -1 \cdot x}}{2} \]
   10. Step-by-step derivation

       1. neg-mul-1 57.7%

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

       2. unsub-neg 57.7%

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

   11. Simplified 57.7%

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

   if 2 < x

   1. Initial program 98.8%

      \[\frac{\left(1 + \frac{1}{\varepsilon}\right) \cdot e^{-\left(1 - \varepsilon\right) \cdot x} - \left(\frac{1}{\varepsilon} - 1\right) \cdot e^{-\left(1 + \varepsilon\right) \cdot x}}{2} \]

   3. Simplified 98.8%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(1 + \frac{1}{\varepsilon}, e^{x \cdot \left(\varepsilon + -1\right)}, {\left(e^{1 + \varepsilon}\right)}^{\left(-x\right)} \cdot \left(1 + \frac{-1}{\varepsilon}\right)\right)}{2}} \]
   4. Add Preprocessing

   5. Taylor expanded in eps around 0 52.0%

      \[\leadsto \frac{\color{blue}{\frac{e^{-1 \cdot x} + -1 \cdot e^{-1 \cdot x}}{\varepsilon}}}{2} \]
   6. Step-by-step derivation

      1. mul-1-neg 52.0%

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

      2. mul-1-neg 52.0%

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

      3. rec-exp 52.0%

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

      4. sub-neg 52.0%

         \[\leadsto \frac{\frac{\color{blue}{e^{-1 \cdot x} - \frac{1}{e^{x}}}}{\varepsilon}}{2} \]

      5. div-sub 52.0%

         \[\leadsto \frac{\color{blue}{\frac{e^{-1 \cdot x}}{\varepsilon} - \frac{\frac{1}{e^{x}}}{\varepsilon}}}{2} \]

      6. mul-1-neg 52.0%

         \[\leadsto \frac{\frac{e^{\color{blue}{-x}}}{\varepsilon} - \frac{\frac{1}{e^{x}}}{\varepsilon}}{2} \]

      7. rec-exp 52.0%

         \[\leadsto \frac{\frac{\color{blue}{\frac{1}{e^{x}}}}{\varepsilon} - \frac{\frac{1}{e^{x}}}{\varepsilon}}{2} \]

      8. +-inverses 52.0%

         \[\leadsto \frac{\color{blue}{0}}{2} \]

   7. Simplified 52.0%

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

4. Final simplification 55.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 2:\\ \;\;\;\;\frac{2 - x}{2}\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 57.3% accurate, 37.7× speedup

Math

\[\begin{array}{l} eps_m = \left|\varepsilon\right| \\ \begin{array}{l} \mathbf{if}\;x \leq 210000:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]

FPCore

eps_m = (fabs.f64 eps)
(FPCore (x eps_m) :precision binary64 (if (<= x 210000.0) 1.0 0.0))

C

eps_m = fabs(eps);
double code(double x, double eps_m) {
	double tmp;
	if (x <= 210000.0) {
		tmp = 1.0;
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Fortran

eps_m = abs(eps)
real(8) function code(x, eps_m)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps_m
    real(8) :: tmp
    if (x <= 210000.0d0) then
        tmp = 1.0d0
    else
        tmp = 0.0d0
    end if
    code = tmp
end function

Java

eps_m = Math.abs(eps);
public static double code(double x, double eps_m) {
	double tmp;
	if (x <= 210000.0) {
		tmp = 1.0;
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

eps_m = math.fabs(eps)
def code(x, eps_m):
	tmp = 0
	if x <= 210000.0:
		tmp = 1.0
	else:
		tmp = 0.0
	return tmp

Julia

eps_m = abs(eps)
function code(x, eps_m)
	tmp = 0.0
	if (x <= 210000.0)
		tmp = 1.0;
	else
		tmp = 0.0;
	end
	return tmp
end

MATLAB

eps_m = abs(eps);
function tmp_2 = code(x, eps_m)
	tmp = 0.0;
	if (x <= 210000.0)
		tmp = 1.0;
	else
		tmp = 0.0;
	end
	tmp_2 = tmp;
end

Wolfram

eps_m = N[Abs[eps], $MachinePrecision]
code[x_, eps$95$m_] := If[LessEqual[x, 210000.0], 1.0, 0.0]

Derivation

1. Split input into 2 regimes

2. if x < 2.1e5

   1. Initial program 60.8%

      \[\frac{\left(1 + \frac{1}{\varepsilon}\right) \cdot e^{-\left(1 - \varepsilon\right) \cdot x} - \left(\frac{1}{\varepsilon} - 1\right) \cdot e^{-\left(1 + \varepsilon\right) \cdot x}}{2} \]

   3. Simplified 60.8%

      \[\leadsto \color{blue}{\frac{\left(1 + \frac{1}{\varepsilon}\right) \cdot e^{\left(1 - \varepsilon\right) \cdot \left(-x\right)} - \left(\frac{1}{\varepsilon} + -1\right) \cdot e^{\left(1 + \varepsilon\right) \cdot \left(-x\right)}}{2}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 57.0%

      \[\leadsto \frac{\color{blue}{2}}{2} \]

   if 2.1e5 < x

   1. Initial program 100.0%

      \[\frac{\left(1 + \frac{1}{\varepsilon}\right) \cdot e^{-\left(1 - \varepsilon\right) \cdot x} - \left(\frac{1}{\varepsilon} - 1\right) \cdot e^{-\left(1 + \varepsilon\right) \cdot x}}{2} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(1 + \frac{1}{\varepsilon}, e^{x \cdot \left(\varepsilon + -1\right)}, {\left(e^{1 + \varepsilon}\right)}^{\left(-x\right)} \cdot \left(1 + \frac{-1}{\varepsilon}\right)\right)}{2}} \]
   4. Add Preprocessing

   5. Taylor expanded in eps around 0 53.3%

      \[\leadsto \frac{\color{blue}{\frac{e^{-1 \cdot x} + -1 \cdot e^{-1 \cdot x}}{\varepsilon}}}{2} \]
   6. Step-by-step derivation

      1. mul-1-neg 53.3%

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

      2. mul-1-neg 53.3%

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

      3. rec-exp 53.3%

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

      4. sub-neg 53.3%

         \[\leadsto \frac{\frac{\color{blue}{e^{-1 \cdot x} - \frac{1}{e^{x}}}}{\varepsilon}}{2} \]

      5. div-sub 53.3%

         \[\leadsto \frac{\color{blue}{\frac{e^{-1 \cdot x}}{\varepsilon} - \frac{\frac{1}{e^{x}}}{\varepsilon}}}{2} \]

      6. mul-1-neg 53.3%

         \[\leadsto \frac{\frac{e^{\color{blue}{-x}}}{\varepsilon} - \frac{\frac{1}{e^{x}}}{\varepsilon}}{2} \]

      7. rec-exp 53.3%

         \[\leadsto \frac{\frac{\color{blue}{\frac{1}{e^{x}}}}{\varepsilon} - \frac{\frac{1}{e^{x}}}{\varepsilon}}{2} \]

      8. +-inverses 53.3%

         \[\leadsto \frac{\color{blue}{0}}{2} \]

   7. Simplified 53.3%

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

4. Final simplification 55.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 210000:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 16.6% accurate, 227.0× speedup

Math

\[\begin{array}{l} eps_m = \left|\varepsilon\right| \\ 0 \end{array} \]

FPCore

eps_m = (fabs.f64 eps)
(FPCore (x eps_m) :precision binary64 0.0)

C

eps_m = fabs(eps);
double code(double x, double eps_m) {
	return 0.0;
}

Fortran

eps_m = abs(eps)
real(8) function code(x, eps_m)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps_m
    code = 0.0d0
end function

Java

eps_m = Math.abs(eps);
public static double code(double x, double eps_m) {
	return 0.0;
}

Python

eps_m = math.fabs(eps)
def code(x, eps_m):
	return 0.0

Julia

eps_m = abs(eps)
function code(x, eps_m)
	return 0.0
end

MATLAB

eps_m = abs(eps);
function tmp = code(x, eps_m)
	tmp = 0.0;
end

Wolfram

eps_m = N[Abs[eps], $MachinePrecision]
code[x_, eps$95$m_] := 0.0

Derivation

1. Initial program 72.8%

   \[\frac{\left(1 + \frac{1}{\varepsilon}\right) \cdot e^{-\left(1 - \varepsilon\right) \cdot x} - \left(\frac{1}{\varepsilon} - 1\right) \cdot e^{-\left(1 + \varepsilon\right) \cdot x}}{2} \]

3. Simplified 63.4%

   \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(1 + \frac{1}{\varepsilon}, e^{x \cdot \left(\varepsilon + -1\right)}, {\left(e^{1 + \varepsilon}\right)}^{\left(-x\right)} \cdot \left(1 + \frac{-1}{\varepsilon}\right)\right)}{2}} \]
4. Add Preprocessing

5. Taylor expanded in eps around 0 17.7%

   \[\leadsto \frac{\color{blue}{\frac{e^{-1 \cdot x} + -1 \cdot e^{-1 \cdot x}}{\varepsilon}}}{2} \]
6. Step-by-step derivation

   1. mul-1-neg 17.7%

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

   2. mul-1-neg 17.7%

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

   3. rec-exp 17.7%

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

   4. sub-neg 17.7%

      \[\leadsto \frac{\frac{\color{blue}{e^{-1 \cdot x} - \frac{1}{e^{x}}}}{\varepsilon}}{2} \]

   5. div-sub 17.7%

      \[\leadsto \frac{\color{blue}{\frac{e^{-1 \cdot x}}{\varepsilon} - \frac{\frac{1}{e^{x}}}{\varepsilon}}}{2} \]

   6. mul-1-neg 17.7%

      \[\leadsto \frac{\frac{e^{\color{blue}{-x}}}{\varepsilon} - \frac{\frac{1}{e^{x}}}{\varepsilon}}{2} \]

   7. rec-exp 17.7%

      \[\leadsto \frac{\frac{\color{blue}{\frac{1}{e^{x}}}}{\varepsilon} - \frac{\frac{1}{e^{x}}}{\varepsilon}}{2} \]

   8. +-inverses 18.0%

      \[\leadsto \frac{\color{blue}{0}}{2} \]

7. Simplified 18.0%

   \[\leadsto \frac{\color{blue}{0}}{2} \]

8. Final simplification 18.0%

   \[\leadsto 0 \]
9. Add Preprocessing

Reproduce

herbie shell --seed 2024092 
(FPCore (x eps)
  :name "NMSE Section 6.1 mentioned, A"
  :precision binary64
  (/ (- (* (+ 1.0 (/ 1.0 eps)) (exp (- (* (- 1.0 eps) x)))) (* (- (/ 1.0 eps) 1.0) (exp (- (* (+ 1.0 eps) x))))) 2.0))