NMSE Section 6.1 mentioned, A

Percentage Accurate: 74.1% → 99.0%

Time: 5.6s

Alternatives: 11

Speedup: 1.9×

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

• could not determine a ground truth

  1. x = -4.533652549768183e+43
  2. eps = -6.082667707643474e-129

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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, eps)
use fmin_fmax_functions
    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: 74.1% 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, eps)
use fmin_fmax_functions
    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.0% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\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} \leq 0:\\ \;\;\;\;\left(e^{-x} \cdot 2\right) \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;\left(\frac{1}{e^{x \cdot \left(-\varepsilon\right)}} - \left(-e^{-x \cdot \varepsilon}\right)\right) \cdot 0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (if (<=
      (-
       (* (+ 1.0 (/ 1.0 eps)) (exp (- (* (- 1.0 eps) x))))
       (* (- (/ 1.0 eps) 1.0) (exp (- (* (+ 1.0 eps) x)))))
      0.0)
   (* (* (exp (- x)) 2.0) 0.5)
   (* (- (/ 1.0 (exp (* x (- eps)))) (- (exp (- (* x eps))))) 0.5)))

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, eps)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: eps
    real(8) :: tmp
    if ((((1.0d0 + (1.0d0 / eps)) * exp(-((1.0d0 - eps) * x))) - (((1.0d0 / eps) - 1.0d0) * exp(-((1.0d0 + eps) * x)))) <= 0.0d0) then
        tmp = (exp(-x) * 2.0d0) * 0.5d0
    else
        tmp = ((1.0d0 / exp((x * -eps))) - -exp(-(x * eps))) * 0.5d0
    end if
    code = tmp
end function

Java

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

Python

def code(x, eps):
	tmp = 0
	if (((1.0 + (1.0 / eps)) * math.exp(-((1.0 - eps) * x))) - (((1.0 / eps) - 1.0) * math.exp(-((1.0 + eps) * x)))) <= 0.0:
		tmp = (math.exp(-x) * 2.0) * 0.5
	else:
		tmp = ((1.0 / math.exp((x * -eps))) - -math.exp(-(x * eps))) * 0.5
	return tmp

Julia

function code(x, eps)
	tmp = 0.0
	if (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))))) <= 0.0)
		tmp = Float64(Float64(exp(Float64(-x)) * 2.0) * 0.5);
	else
		tmp = Float64(Float64(Float64(1.0 / exp(Float64(x * Float64(-eps)))) - Float64(-exp(Float64(-Float64(x * eps))))) * 0.5);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, eps)
	tmp = 0.0;
	if ((((1.0 + (1.0 / eps)) * exp(-((1.0 - eps) * x))) - (((1.0 / eps) - 1.0) * exp(-((1.0 + eps) * x)))) <= 0.0)
		tmp = (exp(-x) * 2.0) * 0.5;
	else
		tmp = ((1.0 / exp((x * -eps))) - -exp(-(x * eps))) * 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, eps_] := If[LessEqual[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], 0.0], N[(N[(N[Exp[(-x)], $MachinePrecision] * 2.0), $MachinePrecision] * 0.5), $MachinePrecision], N[(N[(N[(1.0 / N[Exp[N[(x * (-eps)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - (-N[Exp[(-N[(x * eps), $MachinePrecision])], $MachinePrecision])), $MachinePrecision] * 0.5), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (*.f64 (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) eps)) (exp.f64 (neg.f64 (*.f64 (-.f64 #s(literal 1 binary64) eps) x)))) (*.f64 (-.f64 (/.f64 #s(literal 1 binary64) eps) #s(literal 1 binary64)) (exp.f64 (neg.f64 (*.f64 (+.f64 #s(literal 1 binary64) eps) x))))) < 0.0

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

   2. Taylor expanded in eps around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   4. Applied rewrites 99.0%

      \[\leadsto \color{blue}{\left(e^{\left(-x\right) \cdot \left(1 - \varepsilon\right)} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot 0.5} \]

   5. Taylor expanded in eps around 0

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

      1. mul-1-neg N/A

         \[\leadsto \left(e^{\mathsf{neg}\left(x\right)} + e^{\mathsf{neg}\left(x\right)}\right) \cdot \frac{1}{2} \]

      2. lower-+.f64 N/A

         \[\leadsto \left(e^{\mathsf{neg}\left(x\right)} + e^{\mathsf{neg}\left(x\right)}\right) \cdot \frac{1}{2} \]

      3. lower-exp.f64 N/A

         \[\leadsto \left(e^{\mathsf{neg}\left(x\right)} + e^{\mathsf{neg}\left(x\right)}\right) \cdot \frac{1}{2} \]

      4. lift-neg.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lift-neg.f64 70.5

         \[\leadsto \left(e^{-x} + e^{-x}\right) \cdot 0.5 \]

   7. Applied rewrites 70.5%

      \[\leadsto \left(e^{-x} + e^{-x}\right) \cdot 0.5 \]
   8. Step-by-step derivation

   9. Applied rewrites 70.5%

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

   if 0.0 < (-.f64 (*.f64 (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) eps)) (exp.f64 (neg.f64 (*.f64 (-.f64 #s(literal 1 binary64) eps) x)))) (*.f64 (-.f64 (/.f64 #s(literal 1 binary64) eps) #s(literal 1 binary64)) (exp.f64 (neg.f64 (*.f64 (+.f64 #s(literal 1 binary64) eps) x)))))

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

   2. Taylor expanded in eps around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   4. Applied rewrites 99.0%

      \[\leadsto \color{blue}{\left(e^{\left(-x\right) \cdot \left(1 - \varepsilon\right)} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot 0.5} \]
   5. Step-by-step derivation

      1. lift-exp.f64 N/A

         \[\leadsto \left(e^{\left(-x\right) \cdot \left(1 - \varepsilon\right)} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot \frac{1}{2} \]

      2. lift-*.f64 N/A

         \[\leadsto \left(e^{\left(-x\right) \cdot \left(1 - \varepsilon\right)} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot \frac{1}{2} \]

      3. lift-neg.f64 N/A

         \[\leadsto \left(e^{\left(\mathsf{neg}\left(x\right)\right) \cdot \left(1 - \varepsilon\right)} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot \frac{1}{2} \]

      4. lift--.f64 N/A

         \[\leadsto \left(e^{\left(\mathsf{neg}\left(x\right)\right) \cdot \left(1 - \varepsilon\right)} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot \frac{1}{2} \]

      5. distribute-lft-neg-out N/A

         \[\leadsto \left(e^{\mathsf{neg}\left(x \cdot \left(1 - \varepsilon\right)\right)} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot \frac{1}{2} \]

      6. exp-neg N/A

         \[\leadsto \left(\frac{1}{e^{x \cdot \left(1 - \varepsilon\right)}} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot \frac{1}{2} \]

      7. *-commutative N/A

         \[\leadsto \left(\frac{1}{e^{\left(1 - \varepsilon\right) \cdot x}} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot \frac{1}{2} \]

      8. lower-/.f64 N/A

         \[\leadsto \left(\frac{1}{e^{\left(1 - \varepsilon\right) \cdot x}} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot \frac{1}{2} \]

      9. lower-exp.f64 N/A

         \[\leadsto \left(\frac{1}{e^{\left(1 - \varepsilon\right) \cdot x}} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot \frac{1}{2} \]

      10. *-commutative N/A

          \[\leadsto \left(\frac{1}{e^{x \cdot \left(1 - \varepsilon\right)}} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot \frac{1}{2} \]

      11. lower-*.f64 N/A

          \[\leadsto \left(\frac{1}{e^{x \cdot \left(1 - \varepsilon\right)}} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot \frac{1}{2} \]

      12. lift--.f64 99.0

          \[\leadsto \left(\frac{1}{e^{x \cdot \left(1 - \varepsilon\right)}} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot 0.5 \]

   6. Applied rewrites 99.0%

      \[\leadsto \left(\frac{1}{e^{x \cdot \left(1 - \varepsilon\right)}} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot 0.5 \]

   7. Taylor expanded in eps around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 89.0

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

   9. Applied rewrites 89.0%

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

   10. Taylor expanded in eps around inf

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

       1. mul-1-neg N/A

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

       2. lower-neg.f64 85.8

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

   12. Applied rewrites 85.8%

       \[\leadsto \left(\frac{1}{e^{x \cdot \left(-\varepsilon\right)}} - \left(-e^{-x \cdot \varepsilon}\right)\right) \cdot 0.5 \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 99.0% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \left(\frac{1}{e^{x \cdot \left(1 - \varepsilon\right)}} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot 0.5 \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (* (- (/ 1.0 (exp (* x (- 1.0 eps)))) (- (exp (- (fma x eps x))))) 0.5))

C

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

Julia

function code(x, eps)
	return Float64(Float64(Float64(1.0 / exp(Float64(x * Float64(1.0 - eps)))) - Float64(-exp(Float64(-fma(x, eps, x))))) * 0.5)
end

Wolfram

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

Derivation

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

2. Taylor expanded in eps around inf

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

4. Applied rewrites 99.0%

   \[\leadsto \color{blue}{\left(e^{\left(-x\right) \cdot \left(1 - \varepsilon\right)} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot 0.5} \]
5. Step-by-step derivation

   1. lift-exp.f64 N/A

      \[\leadsto \left(e^{\left(-x\right) \cdot \left(1 - \varepsilon\right)} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot \frac{1}{2} \]

   2. lift-*.f64 N/A

      \[\leadsto \left(e^{\left(-x\right) \cdot \left(1 - \varepsilon\right)} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot \frac{1}{2} \]

   3. lift-neg.f64 N/A

      \[\leadsto \left(e^{\left(\mathsf{neg}\left(x\right)\right) \cdot \left(1 - \varepsilon\right)} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot \frac{1}{2} \]

   4. lift--.f64 N/A

      \[\leadsto \left(e^{\left(\mathsf{neg}\left(x\right)\right) \cdot \left(1 - \varepsilon\right)} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot \frac{1}{2} \]

   5. distribute-lft-neg-out N/A

      \[\leadsto \left(e^{\mathsf{neg}\left(x \cdot \left(1 - \varepsilon\right)\right)} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot \frac{1}{2} \]

   6. exp-neg N/A

      \[\leadsto \left(\frac{1}{e^{x \cdot \left(1 - \varepsilon\right)}} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot \frac{1}{2} \]

   7. *-commutative N/A

      \[\leadsto \left(\frac{1}{e^{\left(1 - \varepsilon\right) \cdot x}} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot \frac{1}{2} \]

   8. lower-/.f64 N/A

      \[\leadsto \left(\frac{1}{e^{\left(1 - \varepsilon\right) \cdot x}} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot \frac{1}{2} \]

   9. lower-exp.f64 N/A

      \[\leadsto \left(\frac{1}{e^{\left(1 - \varepsilon\right) \cdot x}} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot \frac{1}{2} \]

   10. *-commutative N/A

       \[\leadsto \left(\frac{1}{e^{x \cdot \left(1 - \varepsilon\right)}} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot \frac{1}{2} \]

   11. lower-*.f64 N/A

       \[\leadsto \left(\frac{1}{e^{x \cdot \left(1 - \varepsilon\right)}} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot \frac{1}{2} \]

   12. lift--.f64 99.0

       \[\leadsto \left(\frac{1}{e^{x \cdot \left(1 - \varepsilon\right)}} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot 0.5 \]

6. Applied rewrites 99.0%

   \[\leadsto \left(\frac{1}{e^{x \cdot \left(1 - \varepsilon\right)}} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot 0.5 \]
7. Add Preprocessing

Alternative 3: 99.0% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \left(e^{\left(-x\right) \cdot \left(1 - \varepsilon\right)} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot 0.5 \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (* (- (exp (* (- x) (- 1.0 eps))) (- (exp (- (fma x eps x))))) 0.5))

C

double code(double x, double eps) {
	return (exp((-x * (1.0 - eps))) - -exp(-fma(x, eps, x))) * 0.5;
}

Julia

function code(x, eps)
	return Float64(Float64(exp(Float64(Float64(-x) * Float64(1.0 - eps))) - Float64(-exp(Float64(-fma(x, eps, x))))) * 0.5)
end

Wolfram

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

Derivation

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

2. Taylor expanded in eps around inf

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

4. Applied rewrites 99.0%

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

Alternative 4: 99.0% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\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} \leq 0:\\ \;\;\;\;\left(e^{-x} \cdot 2\right) \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;\left(e^{x \cdot \varepsilon} - \left(-e^{x \cdot \left(-1 - \varepsilon\right)}\right)\right) \cdot 0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (if (<=
      (-
       (* (+ 1.0 (/ 1.0 eps)) (exp (- (* (- 1.0 eps) x))))
       (* (- (/ 1.0 eps) 1.0) (exp (- (* (+ 1.0 eps) x)))))
      0.0)
   (* (* (exp (- x)) 2.0) 0.5)
   (* (- (exp (* x eps)) (- (exp (* x (- -1.0 eps))))) 0.5)))

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, eps)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: eps
    real(8) :: tmp
    if ((((1.0d0 + (1.0d0 / eps)) * exp(-((1.0d0 - eps) * x))) - (((1.0d0 / eps) - 1.0d0) * exp(-((1.0d0 + eps) * x)))) <= 0.0d0) then
        tmp = (exp(-x) * 2.0d0) * 0.5d0
    else
        tmp = (exp((x * eps)) - -exp((x * ((-1.0d0) - eps)))) * 0.5d0
    end if
    code = tmp
end function

Java

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

Python

def code(x, eps):
	tmp = 0
	if (((1.0 + (1.0 / eps)) * math.exp(-((1.0 - eps) * x))) - (((1.0 / eps) - 1.0) * math.exp(-((1.0 + eps) * x)))) <= 0.0:
		tmp = (math.exp(-x) * 2.0) * 0.5
	else:
		tmp = (math.exp((x * eps)) - -math.exp((x * (-1.0 - eps)))) * 0.5
	return tmp

Julia

function code(x, eps)
	tmp = 0.0
	if (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))))) <= 0.0)
		tmp = Float64(Float64(exp(Float64(-x)) * 2.0) * 0.5);
	else
		tmp = Float64(Float64(exp(Float64(x * eps)) - Float64(-exp(Float64(x * Float64(-1.0 - eps))))) * 0.5);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, eps)
	tmp = 0.0;
	if ((((1.0 + (1.0 / eps)) * exp(-((1.0 - eps) * x))) - (((1.0 / eps) - 1.0) * exp(-((1.0 + eps) * x)))) <= 0.0)
		tmp = (exp(-x) * 2.0) * 0.5;
	else
		tmp = (exp((x * eps)) - -exp((x * (-1.0 - eps)))) * 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, eps_] := If[LessEqual[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], 0.0], N[(N[(N[Exp[(-x)], $MachinePrecision] * 2.0), $MachinePrecision] * 0.5), $MachinePrecision], N[(N[(N[Exp[N[(x * eps), $MachinePrecision]], $MachinePrecision] - (-N[Exp[N[(x * N[(-1.0 - eps), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision] * 0.5), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (*.f64 (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) eps)) (exp.f64 (neg.f64 (*.f64 (-.f64 #s(literal 1 binary64) eps) x)))) (*.f64 (-.f64 (/.f64 #s(literal 1 binary64) eps) #s(literal 1 binary64)) (exp.f64 (neg.f64 (*.f64 (+.f64 #s(literal 1 binary64) eps) x))))) < 0.0

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

   2. Taylor expanded in eps around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   4. Applied rewrites 99.0%

      \[\leadsto \color{blue}{\left(e^{\left(-x\right) \cdot \left(1 - \varepsilon\right)} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot 0.5} \]

   5. Taylor expanded in eps around 0

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

      1. mul-1-neg N/A

         \[\leadsto \left(e^{\mathsf{neg}\left(x\right)} + e^{\mathsf{neg}\left(x\right)}\right) \cdot \frac{1}{2} \]

      2. lower-+.f64 N/A

         \[\leadsto \left(e^{\mathsf{neg}\left(x\right)} + e^{\mathsf{neg}\left(x\right)}\right) \cdot \frac{1}{2} \]

      3. lower-exp.f64 N/A

         \[\leadsto \left(e^{\mathsf{neg}\left(x\right)} + e^{\mathsf{neg}\left(x\right)}\right) \cdot \frac{1}{2} \]

      4. lift-neg.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lift-neg.f64 70.5

         \[\leadsto \left(e^{-x} + e^{-x}\right) \cdot 0.5 \]

   7. Applied rewrites 70.5%

      \[\leadsto \left(e^{-x} + e^{-x}\right) \cdot 0.5 \]
   8. Step-by-step derivation

   9. Applied rewrites 70.5%

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

   if 0.0 < (-.f64 (*.f64 (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) eps)) (exp.f64 (neg.f64 (*.f64 (-.f64 #s(literal 1 binary64) eps) x)))) (*.f64 (-.f64 (/.f64 #s(literal 1 binary64) eps) #s(literal 1 binary64)) (exp.f64 (neg.f64 (*.f64 (+.f64 #s(literal 1 binary64) eps) x)))))

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

   2. Taylor expanded in eps around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   4. Applied rewrites 99.0%

      \[\leadsto \color{blue}{\left(e^{\left(-x\right) \cdot \left(1 - \varepsilon\right)} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot 0.5} \]

   5. Taylor expanded in eps around inf

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

      1. *-commutative N/A

         \[\leadsto \left(e^{x \cdot \varepsilon} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot \frac{1}{2} \]

      2. lower-*.f64 88.9

         \[\leadsto \left(e^{x \cdot \varepsilon} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot 0.5 \]

   7. Applied rewrites 88.9%

      \[\leadsto \left(e^{x \cdot \varepsilon} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot 0.5 \]
   8. Step-by-step derivation

      1. lift-neg.f64 N/A

         \[\leadsto \left(e^{x \cdot \varepsilon} - \left(-e^{\mathsf{neg}\left(\mathsf{fma}\left(x, \varepsilon, x\right)\right)}\right)\right) \cdot \frac{1}{2} \]

      2. lift-fma.f64 N/A

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

      3. *-commutative N/A

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

      4. +-commutative N/A

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

      5. distribute-neg-in N/A

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

      6. mul-1-neg N/A

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

      7. mul-1-neg N/A

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

      8. associate-*r* N/A

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

      9. mul-1-neg N/A

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

      10. fp-cancel-sub-sign-inv N/A

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

      11. distribute-rgt-out-- N/A

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

      12. lower-*.f64 N/A

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

      13. lower--.f64 88.9

          \[\leadsto \left(e^{x \cdot \varepsilon} - \left(-e^{x \cdot \left(-1 - \varepsilon\right)}\right)\right) \cdot 0.5 \]

   9. Applied rewrites 88.9%

      \[\leadsto \left(e^{x \cdot \varepsilon} - \left(-e^{x \cdot \left(-1 - \varepsilon\right)}\right)\right) \cdot 0.5 \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 77.3% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(e^{-x} \cdot 2\right) \cdot 0.5\\ \mathbf{if}\;x \leq -700:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq -2.15 \cdot 10^{-94}:\\ \;\;\;\;\left(e^{\left(-x\right) \cdot \left(1 - \varepsilon\right)} - \left(x \cdot \varepsilon - 1\right)\right) \cdot 0.5\\ \mathbf{elif}\;x \leq 1.2 \cdot 10^{+16}:\\ \;\;\;\;\left(\mathsf{fma}\left(\varepsilon - 1, x, 1\right) - \left(-e^{-x \cdot \varepsilon}\right)\right) \cdot 0.5\\ \mathbf{elif}\;x \leq 2 \cdot 10^{+238}:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x - 2, x, 2\right) \cdot 0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (let* ((t_0 (* (* (exp (- x)) 2.0) 0.5)))
   (if (<= x -700.0)
     t_0
     (if (<= x -2.15e-94)
       (* (- (exp (* (- x) (- 1.0 eps))) (- (* x eps) 1.0)) 0.5)
       (if (<= x 1.2e+16)
         (* (- (fma (- eps 1.0) x 1.0) (- (exp (- (* x eps))))) 0.5)
         (if (<= x 2e+238) t_0 (* (fma (- x 2.0) x 2.0) 0.5)))))))

C

double code(double x, double eps) {
	double t_0 = (exp(-x) * 2.0) * 0.5;
	double tmp;
	if (x <= -700.0) {
		tmp = t_0;
	} else if (x <= -2.15e-94) {
		tmp = (exp((-x * (1.0 - eps))) - ((x * eps) - 1.0)) * 0.5;
	} else if (x <= 1.2e+16) {
		tmp = (fma((eps - 1.0), x, 1.0) - -exp(-(x * eps))) * 0.5;
	} else if (x <= 2e+238) {
		tmp = t_0;
	} else {
		tmp = fma((x - 2.0), x, 2.0) * 0.5;
	}
	return tmp;
}

Julia

function code(x, eps)
	t_0 = Float64(Float64(exp(Float64(-x)) * 2.0) * 0.5)
	tmp = 0.0
	if (x <= -700.0)
		tmp = t_0;
	elseif (x <= -2.15e-94)
		tmp = Float64(Float64(exp(Float64(Float64(-x) * Float64(1.0 - eps))) - Float64(Float64(x * eps) - 1.0)) * 0.5);
	elseif (x <= 1.2e+16)
		tmp = Float64(Float64(fma(Float64(eps - 1.0), x, 1.0) - Float64(-exp(Float64(-Float64(x * eps))))) * 0.5);
	elseif (x <= 2e+238)
		tmp = t_0;
	else
		tmp = Float64(fma(Float64(x - 2.0), x, 2.0) * 0.5);
	end
	return tmp
end

Wolfram

code[x_, eps_] := Block[{t$95$0 = N[(N[(N[Exp[(-x)], $MachinePrecision] * 2.0), $MachinePrecision] * 0.5), $MachinePrecision]}, If[LessEqual[x, -700.0], t$95$0, If[LessEqual[x, -2.15e-94], N[(N[(N[Exp[N[((-x) * N[(1.0 - eps), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - N[(N[(x * eps), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[x, 1.2e+16], N[(N[(N[(N[(eps - 1.0), $MachinePrecision] * x + 1.0), $MachinePrecision] - (-N[Exp[(-N[(x * eps), $MachinePrecision])], $MachinePrecision])), $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[x, 2e+238], t$95$0, N[(N[(N[(x - 2.0), $MachinePrecision] * x + 2.0), $MachinePrecision] * 0.5), $MachinePrecision]]]]]]

Derivation

1. Split input into 4 regimes

2. if x < -700 or 1.2e16 < x < 2.0000000000000001e238

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

   2. Taylor expanded in eps around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   4. Applied rewrites 99.0%

      \[\leadsto \color{blue}{\left(e^{\left(-x\right) \cdot \left(1 - \varepsilon\right)} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot 0.5} \]

   5. Taylor expanded in eps around 0

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

      1. mul-1-neg N/A

         \[\leadsto \left(e^{\mathsf{neg}\left(x\right)} + e^{\mathsf{neg}\left(x\right)}\right) \cdot \frac{1}{2} \]

      2. lower-+.f64 N/A

         \[\leadsto \left(e^{\mathsf{neg}\left(x\right)} + e^{\mathsf{neg}\left(x\right)}\right) \cdot \frac{1}{2} \]

      3. lower-exp.f64 N/A

         \[\leadsto \left(e^{\mathsf{neg}\left(x\right)} + e^{\mathsf{neg}\left(x\right)}\right) \cdot \frac{1}{2} \]

      4. lift-neg.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lift-neg.f64 70.5

         \[\leadsto \left(e^{-x} + e^{-x}\right) \cdot 0.5 \]

   7. Applied rewrites 70.5%

      \[\leadsto \left(e^{-x} + e^{-x}\right) \cdot 0.5 \]
   8. Step-by-step derivation

   9. Applied rewrites 70.5%

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

   if -700 < x < -2.1499999999999999e-94

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

   2. Taylor expanded in eps around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   4. Applied rewrites 99.0%

      \[\leadsto \color{blue}{\left(e^{\left(-x\right) \cdot \left(1 - \varepsilon\right)} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot 0.5} \]

   5. Taylor expanded in x around 0

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

      1. lower--.f64 N/A

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

      2. *-commutative N/A

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

      3. +-commutative N/A

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

      4. distribute-rgt1-in N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lift-fma.f64 64.4

         \[\leadsto \left(e^{\left(-x\right) \cdot \left(1 - \varepsilon\right)} - \left(\mathsf{fma}\left(x, \varepsilon, x\right) - 1\right)\right) \cdot 0.5 \]

   7. Applied rewrites 64.4%

      \[\leadsto \left(e^{\left(-x\right) \cdot \left(1 - \varepsilon\right)} - \left(\mathsf{fma}\left(x, \varepsilon, x\right) - 1\right)\right) \cdot 0.5 \]

   8. Taylor expanded in eps around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 64.5

         \[\leadsto \left(e^{\left(-x\right) \cdot \left(1 - \varepsilon\right)} - \left(x \cdot \varepsilon - 1\right)\right) \cdot 0.5 \]

   10. Applied rewrites 64.5%

       \[\leadsto \left(e^{\left(-x\right) \cdot \left(1 - \varepsilon\right)} - \left(x \cdot \varepsilon - 1\right)\right) \cdot 0.5 \]

   if -2.1499999999999999e-94 < x < 1.2e16

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

   2. Taylor expanded in eps around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   4. Applied rewrites 99.0%

      \[\leadsto \color{blue}{\left(e^{\left(-x\right) \cdot \left(1 - \varepsilon\right)} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot 0.5} \]
   5. Step-by-step derivation

      1. lift-exp.f64 N/A

         \[\leadsto \left(e^{\left(-x\right) \cdot \left(1 - \varepsilon\right)} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot \frac{1}{2} \]

      2. lift-*.f64 N/A

         \[\leadsto \left(e^{\left(-x\right) \cdot \left(1 - \varepsilon\right)} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot \frac{1}{2} \]

      3. lift-neg.f64 N/A

         \[\leadsto \left(e^{\left(\mathsf{neg}\left(x\right)\right) \cdot \left(1 - \varepsilon\right)} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot \frac{1}{2} \]

      4. lift--.f64 N/A

         \[\leadsto \left(e^{\left(\mathsf{neg}\left(x\right)\right) \cdot \left(1 - \varepsilon\right)} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot \frac{1}{2} \]

      5. distribute-lft-neg-out N/A

         \[\leadsto \left(e^{\mathsf{neg}\left(x \cdot \left(1 - \varepsilon\right)\right)} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot \frac{1}{2} \]

      6. exp-neg N/A

         \[\leadsto \left(\frac{1}{e^{x \cdot \left(1 - \varepsilon\right)}} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot \frac{1}{2} \]

      7. *-commutative N/A

         \[\leadsto \left(\frac{1}{e^{\left(1 - \varepsilon\right) \cdot x}} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot \frac{1}{2} \]

      8. lower-/.f64 N/A

         \[\leadsto \left(\frac{1}{e^{\left(1 - \varepsilon\right) \cdot x}} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot \frac{1}{2} \]

      9. lower-exp.f64 N/A

         \[\leadsto \left(\frac{1}{e^{\left(1 - \varepsilon\right) \cdot x}} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot \frac{1}{2} \]

      10. *-commutative N/A

          \[\leadsto \left(\frac{1}{e^{x \cdot \left(1 - \varepsilon\right)}} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot \frac{1}{2} \]

      11. lower-*.f64 N/A

          \[\leadsto \left(\frac{1}{e^{x \cdot \left(1 - \varepsilon\right)}} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot \frac{1}{2} \]

      12. lift--.f64 99.0

          \[\leadsto \left(\frac{1}{e^{x \cdot \left(1 - \varepsilon\right)}} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot 0.5 \]

   6. Applied rewrites 99.0%

      \[\leadsto \left(\frac{1}{e^{x \cdot \left(1 - \varepsilon\right)}} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot 0.5 \]

   7. Taylor expanded in eps around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 89.0

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

   9. Applied rewrites 89.0%

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

   10. Taylor expanded in x around 0

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

       1. +-commutative N/A

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

       2. *-commutative N/A

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

       3. lower-fma.f64 N/A

          \[\leadsto \left(\mathsf{fma}\left(\varepsilon - 1, x, 1\right) - \left(-e^{-x \cdot \varepsilon}\right)\right) \cdot \frac{1}{2} \]

       4. lift--.f64 64.5

          \[\leadsto \left(\mathsf{fma}\left(\varepsilon - 1, x, 1\right) - \left(-e^{-x \cdot \varepsilon}\right)\right) \cdot 0.5 \]

   12. Applied rewrites 64.5%

       \[\leadsto \left(\mathsf{fma}\left(\varepsilon - 1, x, 1\right) - \left(-e^{-x \cdot \varepsilon}\right)\right) \cdot 0.5 \]

   if 2.0000000000000001e238 < x

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

   2. Taylor expanded in eps around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   4. Applied rewrites 99.0%

      \[\leadsto \color{blue}{\left(e^{\left(-x\right) \cdot \left(1 - \varepsilon\right)} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot 0.5} \]

   5. Taylor expanded in eps around 0

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

      1. mul-1-neg N/A

         \[\leadsto \left(e^{\mathsf{neg}\left(x\right)} + e^{\mathsf{neg}\left(x\right)}\right) \cdot \frac{1}{2} \]

      2. lower-+.f64 N/A

         \[\leadsto \left(e^{\mathsf{neg}\left(x\right)} + e^{\mathsf{neg}\left(x\right)}\right) \cdot \frac{1}{2} \]

      3. lower-exp.f64 N/A

         \[\leadsto \left(e^{\mathsf{neg}\left(x\right)} + e^{\mathsf{neg}\left(x\right)}\right) \cdot \frac{1}{2} \]

      4. lift-neg.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lift-neg.f64 70.5

         \[\leadsto \left(e^{-x} + e^{-x}\right) \cdot 0.5 \]

   7. Applied rewrites 70.5%

      \[\leadsto \left(e^{-x} + e^{-x}\right) \cdot 0.5 \]

   8. Taylor expanded in x around 0

      \[\leadsto \left(2 + x \cdot \left(x - 2\right)\right) \cdot \frac{1}{2} \]
   9. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(x - 2, x, 2\right) \cdot \frac{1}{2} \]

      4. lower--.f64 57.7

         \[\leadsto \mathsf{fma}\left(x - 2, x, 2\right) \cdot 0.5 \]

   10. Applied rewrites 57.7%

       \[\leadsto \mathsf{fma}\left(x - 2, x, 2\right) \cdot 0.5 \]
3. Recombined 4 regimes into one program.
4. Add Preprocessing

Alternative 6: 76.9% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(e^{-x} \cdot 2\right) \cdot 0.5\\ \mathbf{if}\;x \leq -700:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq 85000000000:\\ \;\;\;\;\left(e^{\left(-x\right) \cdot \left(1 - \varepsilon\right)} - \left(x \cdot \varepsilon - 1\right)\right) \cdot 0.5\\ \mathbf{elif}\;x \leq 2 \cdot 10^{+238}:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x - 2, x, 2\right) \cdot 0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (let* ((t_0 (* (* (exp (- x)) 2.0) 0.5)))
   (if (<= x -700.0)
     t_0
     (if (<= x 85000000000.0)
       (* (- (exp (* (- x) (- 1.0 eps))) (- (* x eps) 1.0)) 0.5)
       (if (<= x 2e+238) t_0 (* (fma (- x 2.0) x 2.0) 0.5))))))

C

double code(double x, double eps) {
	double t_0 = (exp(-x) * 2.0) * 0.5;
	double tmp;
	if (x <= -700.0) {
		tmp = t_0;
	} else if (x <= 85000000000.0) {
		tmp = (exp((-x * (1.0 - eps))) - ((x * eps) - 1.0)) * 0.5;
	} else if (x <= 2e+238) {
		tmp = t_0;
	} else {
		tmp = fma((x - 2.0), x, 2.0) * 0.5;
	}
	return tmp;
}

Julia

function code(x, eps)
	t_0 = Float64(Float64(exp(Float64(-x)) * 2.0) * 0.5)
	tmp = 0.0
	if (x <= -700.0)
		tmp = t_0;
	elseif (x <= 85000000000.0)
		tmp = Float64(Float64(exp(Float64(Float64(-x) * Float64(1.0 - eps))) - Float64(Float64(x * eps) - 1.0)) * 0.5);
	elseif (x <= 2e+238)
		tmp = t_0;
	else
		tmp = Float64(fma(Float64(x - 2.0), x, 2.0) * 0.5);
	end
	return tmp
end

Wolfram

code[x_, eps_] := Block[{t$95$0 = N[(N[(N[Exp[(-x)], $MachinePrecision] * 2.0), $MachinePrecision] * 0.5), $MachinePrecision]}, If[LessEqual[x, -700.0], t$95$0, If[LessEqual[x, 85000000000.0], N[(N[(N[Exp[N[((-x) * N[(1.0 - eps), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - N[(N[(x * eps), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[x, 2e+238], t$95$0, N[(N[(N[(x - 2.0), $MachinePrecision] * x + 2.0), $MachinePrecision] * 0.5), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if x < -700 or 8.5e10 < x < 2.0000000000000001e238

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

   2. Taylor expanded in eps around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   4. Applied rewrites 99.0%

      \[\leadsto \color{blue}{\left(e^{\left(-x\right) \cdot \left(1 - \varepsilon\right)} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot 0.5} \]

   5. Taylor expanded in eps around 0

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

      1. mul-1-neg N/A

         \[\leadsto \left(e^{\mathsf{neg}\left(x\right)} + e^{\mathsf{neg}\left(x\right)}\right) \cdot \frac{1}{2} \]

      2. lower-+.f64 N/A

         \[\leadsto \left(e^{\mathsf{neg}\left(x\right)} + e^{\mathsf{neg}\left(x\right)}\right) \cdot \frac{1}{2} \]

      3. lower-exp.f64 N/A

         \[\leadsto \left(e^{\mathsf{neg}\left(x\right)} + e^{\mathsf{neg}\left(x\right)}\right) \cdot \frac{1}{2} \]

      4. lift-neg.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lift-neg.f64 70.5

         \[\leadsto \left(e^{-x} + e^{-x}\right) \cdot 0.5 \]

   7. Applied rewrites 70.5%

      \[\leadsto \left(e^{-x} + e^{-x}\right) \cdot 0.5 \]
   8. Step-by-step derivation

   9. Applied rewrites 70.5%

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

   if -700 < x < 8.5e10

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

   2. Taylor expanded in eps around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   4. Applied rewrites 99.0%

      \[\leadsto \color{blue}{\left(e^{\left(-x\right) \cdot \left(1 - \varepsilon\right)} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot 0.5} \]

   5. Taylor expanded in x around 0

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

      1. lower--.f64 N/A

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

      2. *-commutative N/A

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

      3. +-commutative N/A

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

      4. distribute-rgt1-in N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lift-fma.f64 64.4

         \[\leadsto \left(e^{\left(-x\right) \cdot \left(1 - \varepsilon\right)} - \left(\mathsf{fma}\left(x, \varepsilon, x\right) - 1\right)\right) \cdot 0.5 \]

   7. Applied rewrites 64.4%

      \[\leadsto \left(e^{\left(-x\right) \cdot \left(1 - \varepsilon\right)} - \left(\mathsf{fma}\left(x, \varepsilon, x\right) - 1\right)\right) \cdot 0.5 \]

   8. Taylor expanded in eps around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 64.5

         \[\leadsto \left(e^{\left(-x\right) \cdot \left(1 - \varepsilon\right)} - \left(x \cdot \varepsilon - 1\right)\right) \cdot 0.5 \]

   10. Applied rewrites 64.5%

       \[\leadsto \left(e^{\left(-x\right) \cdot \left(1 - \varepsilon\right)} - \left(x \cdot \varepsilon - 1\right)\right) \cdot 0.5 \]

   if 2.0000000000000001e238 < x

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

   2. Taylor expanded in eps around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   4. Applied rewrites 99.0%

      \[\leadsto \color{blue}{\left(e^{\left(-x\right) \cdot \left(1 - \varepsilon\right)} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot 0.5} \]

   5. Taylor expanded in eps around 0

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

      1. mul-1-neg N/A

         \[\leadsto \left(e^{\mathsf{neg}\left(x\right)} + e^{\mathsf{neg}\left(x\right)}\right) \cdot \frac{1}{2} \]

      2. lower-+.f64 N/A

         \[\leadsto \left(e^{\mathsf{neg}\left(x\right)} + e^{\mathsf{neg}\left(x\right)}\right) \cdot \frac{1}{2} \]

      3. lower-exp.f64 N/A

         \[\leadsto \left(e^{\mathsf{neg}\left(x\right)} + e^{\mathsf{neg}\left(x\right)}\right) \cdot \frac{1}{2} \]

      4. lift-neg.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lift-neg.f64 70.5

         \[\leadsto \left(e^{-x} + e^{-x}\right) \cdot 0.5 \]

   7. Applied rewrites 70.5%

      \[\leadsto \left(e^{-x} + e^{-x}\right) \cdot 0.5 \]

   8. Taylor expanded in x around 0

      \[\leadsto \left(2 + x \cdot \left(x - 2\right)\right) \cdot \frac{1}{2} \]
   9. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(x - 2, x, 2\right) \cdot \frac{1}{2} \]

      4. lower--.f64 57.7

         \[\leadsto \mathsf{fma}\left(x - 2, x, 2\right) \cdot 0.5 \]

   10. Applied rewrites 57.7%

       \[\leadsto \mathsf{fma}\left(x - 2, x, 2\right) \cdot 0.5 \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 7: 76.9% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(e^{-x} \cdot 2\right) \cdot 0.5\\ \mathbf{if}\;x \leq -700:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq 82000000000:\\ \;\;\;\;\left(e^{\left(-x\right) \cdot \left(1 - \varepsilon\right)} - -1\right) \cdot 0.5\\ \mathbf{elif}\;x \leq 2 \cdot 10^{+238}:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x - 2, x, 2\right) \cdot 0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (let* ((t_0 (* (* (exp (- x)) 2.0) 0.5)))
   (if (<= x -700.0)
     t_0
     (if (<= x 82000000000.0)
       (* (- (exp (* (- x) (- 1.0 eps))) -1.0) 0.5)
       (if (<= x 2e+238) t_0 (* (fma (- x 2.0) x 2.0) 0.5))))))

C

double code(double x, double eps) {
	double t_0 = (exp(-x) * 2.0) * 0.5;
	double tmp;
	if (x <= -700.0) {
		tmp = t_0;
	} else if (x <= 82000000000.0) {
		tmp = (exp((-x * (1.0 - eps))) - -1.0) * 0.5;
	} else if (x <= 2e+238) {
		tmp = t_0;
	} else {
		tmp = fma((x - 2.0), x, 2.0) * 0.5;
	}
	return tmp;
}

Julia

function code(x, eps)
	t_0 = Float64(Float64(exp(Float64(-x)) * 2.0) * 0.5)
	tmp = 0.0
	if (x <= -700.0)
		tmp = t_0;
	elseif (x <= 82000000000.0)
		tmp = Float64(Float64(exp(Float64(Float64(-x) * Float64(1.0 - eps))) - -1.0) * 0.5);
	elseif (x <= 2e+238)
		tmp = t_0;
	else
		tmp = Float64(fma(Float64(x - 2.0), x, 2.0) * 0.5);
	end
	return tmp
end

Wolfram

code[x_, eps_] := Block[{t$95$0 = N[(N[(N[Exp[(-x)], $MachinePrecision] * 2.0), $MachinePrecision] * 0.5), $MachinePrecision]}, If[LessEqual[x, -700.0], t$95$0, If[LessEqual[x, 82000000000.0], N[(N[(N[Exp[N[((-x) * N[(1.0 - eps), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - -1.0), $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[x, 2e+238], t$95$0, N[(N[(N[(x - 2.0), $MachinePrecision] * x + 2.0), $MachinePrecision] * 0.5), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if x < -700 or 8.2e10 < x < 2.0000000000000001e238

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

   2. Taylor expanded in eps around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   4. Applied rewrites 99.0%

      \[\leadsto \color{blue}{\left(e^{\left(-x\right) \cdot \left(1 - \varepsilon\right)} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot 0.5} \]

   5. Taylor expanded in eps around 0

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

      1. mul-1-neg N/A

         \[\leadsto \left(e^{\mathsf{neg}\left(x\right)} + e^{\mathsf{neg}\left(x\right)}\right) \cdot \frac{1}{2} \]

      2. lower-+.f64 N/A

         \[\leadsto \left(e^{\mathsf{neg}\left(x\right)} + e^{\mathsf{neg}\left(x\right)}\right) \cdot \frac{1}{2} \]

      3. lower-exp.f64 N/A

         \[\leadsto \left(e^{\mathsf{neg}\left(x\right)} + e^{\mathsf{neg}\left(x\right)}\right) \cdot \frac{1}{2} \]

      4. lift-neg.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lift-neg.f64 70.5

         \[\leadsto \left(e^{-x} + e^{-x}\right) \cdot 0.5 \]

   7. Applied rewrites 70.5%

      \[\leadsto \left(e^{-x} + e^{-x}\right) \cdot 0.5 \]
   8. Step-by-step derivation

   9. Applied rewrites 70.5%

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

   if -700 < x < 8.2e10

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

   2. Taylor expanded in eps around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   4. Applied rewrites 99.0%

      \[\leadsto \color{blue}{\left(e^{\left(-x\right) \cdot \left(1 - \varepsilon\right)} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot 0.5} \]

   5. Taylor expanded in x around 0

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

   7. Applied rewrites 63.7%

      \[\leadsto \left(e^{\left(-x\right) \cdot \left(1 - \varepsilon\right)} - -1\right) \cdot 0.5 \]

   if 2.0000000000000001e238 < x

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

   2. Taylor expanded in eps around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   4. Applied rewrites 99.0%

      \[\leadsto \color{blue}{\left(e^{\left(-x\right) \cdot \left(1 - \varepsilon\right)} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot 0.5} \]

   5. Taylor expanded in eps around 0

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

      1. mul-1-neg N/A

         \[\leadsto \left(e^{\mathsf{neg}\left(x\right)} + e^{\mathsf{neg}\left(x\right)}\right) \cdot \frac{1}{2} \]

      2. lower-+.f64 N/A

         \[\leadsto \left(e^{\mathsf{neg}\left(x\right)} + e^{\mathsf{neg}\left(x\right)}\right) \cdot \frac{1}{2} \]

      3. lower-exp.f64 N/A

         \[\leadsto \left(e^{\mathsf{neg}\left(x\right)} + e^{\mathsf{neg}\left(x\right)}\right) \cdot \frac{1}{2} \]

      4. lift-neg.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lift-neg.f64 70.5

         \[\leadsto \left(e^{-x} + e^{-x}\right) \cdot 0.5 \]

   7. Applied rewrites 70.5%

      \[\leadsto \left(e^{-x} + e^{-x}\right) \cdot 0.5 \]

   8. Taylor expanded in x around 0

      \[\leadsto \left(2 + x \cdot \left(x - 2\right)\right) \cdot \frac{1}{2} \]
   9. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(x - 2, x, 2\right) \cdot \frac{1}{2} \]

      4. lower--.f64 57.7

         \[\leadsto \mathsf{fma}\left(x - 2, x, 2\right) \cdot 0.5 \]

   10. Applied rewrites 57.7%

       \[\leadsto \mathsf{fma}\left(x - 2, x, 2\right) \cdot 0.5 \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 8: 70.6% accurate, 2.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 2 \cdot 10^{+238}:\\ \;\;\;\;\left(e^{-x} \cdot 2\right) \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x - 2, x, 2\right) \cdot 0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (if (<= x 2e+238) (* (* (exp (- x)) 2.0) 0.5) (* (fma (- x 2.0) x 2.0) 0.5)))

C

double code(double x, double eps) {
	double tmp;
	if (x <= 2e+238) {
		tmp = (exp(-x) * 2.0) * 0.5;
	} else {
		tmp = fma((x - 2.0), x, 2.0) * 0.5;
	}
	return tmp;
}

Julia

function code(x, eps)
	tmp = 0.0
	if (x <= 2e+238)
		tmp = Float64(Float64(exp(Float64(-x)) * 2.0) * 0.5);
	else
		tmp = Float64(fma(Float64(x - 2.0), x, 2.0) * 0.5);
	end
	return tmp
end

Wolfram

code[x_, eps_] := If[LessEqual[x, 2e+238], N[(N[(N[Exp[(-x)], $MachinePrecision] * 2.0), $MachinePrecision] * 0.5), $MachinePrecision], N[(N[(N[(x - 2.0), $MachinePrecision] * x + 2.0), $MachinePrecision] * 0.5), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 2.0000000000000001e238

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

   2. Taylor expanded in eps around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   4. Applied rewrites 99.0%

      \[\leadsto \color{blue}{\left(e^{\left(-x\right) \cdot \left(1 - \varepsilon\right)} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot 0.5} \]

   5. Taylor expanded in eps around 0

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

      1. mul-1-neg N/A

         \[\leadsto \left(e^{\mathsf{neg}\left(x\right)} + e^{\mathsf{neg}\left(x\right)}\right) \cdot \frac{1}{2} \]

      2. lower-+.f64 N/A

         \[\leadsto \left(e^{\mathsf{neg}\left(x\right)} + e^{\mathsf{neg}\left(x\right)}\right) \cdot \frac{1}{2} \]

      3. lower-exp.f64 N/A

         \[\leadsto \left(e^{\mathsf{neg}\left(x\right)} + e^{\mathsf{neg}\left(x\right)}\right) \cdot \frac{1}{2} \]

      4. lift-neg.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lift-neg.f64 70.5

         \[\leadsto \left(e^{-x} + e^{-x}\right) \cdot 0.5 \]

   7. Applied rewrites 70.5%

      \[\leadsto \left(e^{-x} + e^{-x}\right) \cdot 0.5 \]
   8. Step-by-step derivation

   9. Applied rewrites 70.5%

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

   if 2.0000000000000001e238 < x

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

   2. Taylor expanded in eps around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   4. Applied rewrites 99.0%

      \[\leadsto \color{blue}{\left(e^{\left(-x\right) \cdot \left(1 - \varepsilon\right)} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot 0.5} \]

   5. Taylor expanded in eps around 0

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

      1. mul-1-neg N/A

         \[\leadsto \left(e^{\mathsf{neg}\left(x\right)} + e^{\mathsf{neg}\left(x\right)}\right) \cdot \frac{1}{2} \]

      2. lower-+.f64 N/A

         \[\leadsto \left(e^{\mathsf{neg}\left(x\right)} + e^{\mathsf{neg}\left(x\right)}\right) \cdot \frac{1}{2} \]

      3. lower-exp.f64 N/A

         \[\leadsto \left(e^{\mathsf{neg}\left(x\right)} + e^{\mathsf{neg}\left(x\right)}\right) \cdot \frac{1}{2} \]

      4. lift-neg.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lift-neg.f64 70.5

         \[\leadsto \left(e^{-x} + e^{-x}\right) \cdot 0.5 \]

   7. Applied rewrites 70.5%

      \[\leadsto \left(e^{-x} + e^{-x}\right) \cdot 0.5 \]

   8. Taylor expanded in x around 0

      \[\leadsto \left(2 + x \cdot \left(x - 2\right)\right) \cdot \frac{1}{2} \]
   9. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(x - 2, x, 2\right) \cdot \frac{1}{2} \]

      4. lower--.f64 57.7

         \[\leadsto \mathsf{fma}\left(x - 2, x, 2\right) \cdot 0.5 \]

   10. Applied rewrites 57.7%

       \[\leadsto \mathsf{fma}\left(x - 2, x, 2\right) \cdot 0.5 \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 9: 63.1% accurate, 2.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \mathsf{fma}\left(x - 2, x, 2\right) \cdot 0.5\\ \mathbf{if}\;x \leq 1750000000:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq 2.5 \cdot 10^{+238}:\\ \;\;\;\;\frac{\frac{1}{\varepsilon} - \left(\frac{1}{\varepsilon} - 1\right)}{2}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (let* ((t_0 (* (fma (- x 2.0) x 2.0) 0.5)))
   (if (<= x 1750000000.0)
     t_0
     (if (<= x 2.5e+238) (/ (- (/ 1.0 eps) (- (/ 1.0 eps) 1.0)) 2.0) t_0))))

C

double code(double x, double eps) {
	double t_0 = fma((x - 2.0), x, 2.0) * 0.5;
	double tmp;
	if (x <= 1750000000.0) {
		tmp = t_0;
	} else if (x <= 2.5e+238) {
		tmp = ((1.0 / eps) - ((1.0 / eps) - 1.0)) / 2.0;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, eps)
	t_0 = Float64(fma(Float64(x - 2.0), x, 2.0) * 0.5)
	tmp = 0.0
	if (x <= 1750000000.0)
		tmp = t_0;
	elseif (x <= 2.5e+238)
		tmp = Float64(Float64(Float64(1.0 / eps) - Float64(Float64(1.0 / eps) - 1.0)) / 2.0);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, eps_] := Block[{t$95$0 = N[(N[(N[(x - 2.0), $MachinePrecision] * x + 2.0), $MachinePrecision] * 0.5), $MachinePrecision]}, If[LessEqual[x, 1750000000.0], t$95$0, If[LessEqual[x, 2.5e+238], N[(N[(N[(1.0 / eps), $MachinePrecision] - N[(N[(1.0 / eps), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if x < 1.75e9 or 2.49999999999999998e238 < x

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

   2. Taylor expanded in eps around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   4. Applied rewrites 99.0%

      \[\leadsto \color{blue}{\left(e^{\left(-x\right) \cdot \left(1 - \varepsilon\right)} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot 0.5} \]

   5. Taylor expanded in eps around 0

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

      1. mul-1-neg N/A

         \[\leadsto \left(e^{\mathsf{neg}\left(x\right)} + e^{\mathsf{neg}\left(x\right)}\right) \cdot \frac{1}{2} \]

      2. lower-+.f64 N/A

         \[\leadsto \left(e^{\mathsf{neg}\left(x\right)} + e^{\mathsf{neg}\left(x\right)}\right) \cdot \frac{1}{2} \]

      3. lower-exp.f64 N/A

         \[\leadsto \left(e^{\mathsf{neg}\left(x\right)} + e^{\mathsf{neg}\left(x\right)}\right) \cdot \frac{1}{2} \]

      4. lift-neg.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lift-neg.f64 70.5

         \[\leadsto \left(e^{-x} + e^{-x}\right) \cdot 0.5 \]

   7. Applied rewrites 70.5%

      \[\leadsto \left(e^{-x} + e^{-x}\right) \cdot 0.5 \]

   8. Taylor expanded in x around 0

      \[\leadsto \left(2 + x \cdot \left(x - 2\right)\right) \cdot \frac{1}{2} \]
   9. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(x - 2, x, 2\right) \cdot \frac{1}{2} \]

      4. lower--.f64 57.7

         \[\leadsto \mathsf{fma}\left(x - 2, x, 2\right) \cdot 0.5 \]

   10. Applied rewrites 57.7%

       \[\leadsto \mathsf{fma}\left(x - 2, x, 2\right) \cdot 0.5 \]

   if 1.75e9 < x < 2.49999999999999998e238

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

   2. Taylor expanded in x around 0

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

      1. lift-/.f64 N/A

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

      2. lift--.f64 38.6

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

   4. Applied rewrites 38.6%

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

   5. Taylor expanded in eps around 0

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

      1. lower-/.f64 N/A

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

      2. lower-exp.f64 N/A

         \[\leadsto \frac{\frac{e^{\mathsf{neg}\left(x\right)}}{\varepsilon} - \left(\frac{1}{\varepsilon} - 1\right)}{2} \]

      3. lift-neg.f64 12.1

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

   7. Applied rewrites 12.1%

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

   8. Taylor expanded in x around 0

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

      1. lift-/.f64 18.4

         \[\leadsto \frac{\frac{1}{\varepsilon} - \left(\frac{1}{\varepsilon} - 1\right)}{2} \]

   10. Applied rewrites 18.4%

       \[\leadsto \frac{\frac{1}{\color{blue}{\varepsilon}} - \left(\frac{1}{\varepsilon} - 1\right)}{2} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 10: 57.7% accurate, 5.1× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(x - 2, x, 2\right) \cdot 0.5 \end{array} \]

FPCore

(FPCore (x eps) :precision binary64 (* (fma (- x 2.0) x 2.0) 0.5))

C

double code(double x, double eps) {
	return fma((x - 2.0), x, 2.0) * 0.5;
}

Julia

function code(x, eps)
	return Float64(fma(Float64(x - 2.0), x, 2.0) * 0.5)
end

Wolfram

code[x_, eps_] := N[(N[(N[(x - 2.0), $MachinePrecision] * x + 2.0), $MachinePrecision] * 0.5), $MachinePrecision]

Derivation

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

2. Taylor expanded in eps around inf

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

4. Applied rewrites 99.0%

   \[\leadsto \color{blue}{\left(e^{\left(-x\right) \cdot \left(1 - \varepsilon\right)} - \left(-e^{-\mathsf{fma}\left(x, \varepsilon, x\right)}\right)\right) \cdot 0.5} \]

5. Taylor expanded in eps around 0

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

   1. mul-1-neg N/A

      \[\leadsto \left(e^{\mathsf{neg}\left(x\right)} + e^{\mathsf{neg}\left(x\right)}\right) \cdot \frac{1}{2} \]

   2. lower-+.f64 N/A

      \[\leadsto \left(e^{\mathsf{neg}\left(x\right)} + e^{\mathsf{neg}\left(x\right)}\right) \cdot \frac{1}{2} \]

   3. lower-exp.f64 N/A

      \[\leadsto \left(e^{\mathsf{neg}\left(x\right)} + e^{\mathsf{neg}\left(x\right)}\right) \cdot \frac{1}{2} \]

   4. lift-neg.f64 N/A

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

   5. lower-exp.f64 N/A

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

   6. lift-neg.f64 70.5

      \[\leadsto \left(e^{-x} + e^{-x}\right) \cdot 0.5 \]

7. Applied rewrites 70.5%

   \[\leadsto \left(e^{-x} + e^{-x}\right) \cdot 0.5 \]

8. Taylor expanded in x around 0

   \[\leadsto \left(2 + x \cdot \left(x - 2\right)\right) \cdot \frac{1}{2} \]
9. Step-by-step derivation

   1. +-commutative N/A

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

   2. *-commutative N/A

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

   3. lower-fma.f64 N/A

      \[\leadsto \mathsf{fma}\left(x - 2, x, 2\right) \cdot \frac{1}{2} \]

   4. lower--.f64 57.7

      \[\leadsto \mathsf{fma}\left(x - 2, x, 2\right) \cdot 0.5 \]

10. Applied rewrites 57.7%

    \[\leadsto \mathsf{fma}\left(x - 2, x, 2\right) \cdot 0.5 \]
11. Add Preprocessing

Alternative 11: 43.8% accurate, 58.4× speedup

Math

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

FPCore

(FPCore (x eps) :precision binary64 1.0)

C

double code(double x, double eps) {
	return 1.0;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, eps)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: eps
    code = 1.0d0
end function

Java

public static double code(double x, double eps) {
	return 1.0;
}

Python

def code(x, eps):
	return 1.0

Julia

function code(x, eps)
	return 1.0
end

MATLAB

function tmp = code(x, eps)
	tmp = 1.0;
end

Wolfram

code[x_, eps_] := 1.0

Derivation

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

2. Taylor expanded in x around 0

   \[\leadsto \color{blue}{1} \]
3. Step-by-step derivation

4. Applied rewrites 43.8%

   \[\leadsto \color{blue}{1} \]
5. Add Preprocessing

Reproduce

herbie shell --seed 2025142 
(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))