NMSE Section 6.1 mentioned, A

Percentage Accurate: 73.8% → 98.8%

Time: 6.9s

Alternatives: 13

Speedup: 1.2×

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

• could not determine a ground truth

  1. x = -4.639979991826916e+151
  2. eps = 7.16861430937766e-43

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: 73.8% 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: 98.8% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \left(e^{x \cdot \left(-1 + \varepsilon\right)} + e^{-\mathsf{fma}\left(x, \varepsilon, x\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(x * Float64(-1.0 + eps))) + 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 75.0%

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

3. 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)} \]
4. 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}} \]

5. Applied rewrites 99.4%

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

6. Final simplification 99.4%

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

Alternative 2: 84.4% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\varepsilon \leq 0.106:\\ \;\;\;\;e^{-x}\\ \mathbf{else}:\\ \;\;\;\;\left(e^{x \cdot \varepsilon} + e^{-x \cdot \varepsilon}\right) \cdot 0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (if (<= eps 0.106)
   (exp (- x))
   (* (+ (exp (* x eps)) (exp (- (* x eps)))) 0.5)))

C

double code(double x, double eps) {
	double tmp;
	if (eps <= 0.106) {
		tmp = exp(-x);
	} else {
		tmp = (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 (eps <= 0.106d0) then
        tmp = exp(-x)
    else
        tmp = (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 (eps <= 0.106) {
		tmp = Math.exp(-x);
	} else {
		tmp = (Math.exp((x * eps)) + Math.exp(-(x * eps))) * 0.5;
	}
	return tmp;
}

Python

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

Julia

function code(x, eps)
	tmp = 0.0
	if (eps <= 0.106)
		tmp = exp(Float64(-x));
	else
		tmp = Float64(Float64(exp(Float64(x * eps)) + exp(Float64(-Float64(x * eps)))) * 0.5);
	end
	return tmp
end

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if eps < 0.105999999999999997

   1. Initial program 65.4%

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

   3. 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)} \]
   4. 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}} \]

   5. Applied rewrites 99.2%

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

   6. 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} \]
   7. Step-by-step derivation

      1. *-commutative N/A

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

      2. distribute-rgt-neg-in N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 85.0

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

   8. Applied rewrites 85.0%

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

   9. Taylor expanded in eps around 0

      \[\leadsto e^{\mathsf{neg}\left(x\right)} \]
   10. Step-by-step derivation

       1. lift-exp.f64 N/A

          \[\leadsto e^{\mathsf{neg}\left(x\right)} \]

       2. lift-neg.f64 78.3

          \[\leadsto e^{-x} \]

   11. Applied rewrites 78.3%

       \[\leadsto e^{-x} \]

   if 0.105999999999999997 < eps

   1. Initial program 100.0%

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

   3. 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)} \]
   4. 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}} \]

   5. Applied rewrites 100.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} \]

   6. 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} \]
   7. Step-by-step derivation

      1. *-commutative N/A

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

      2. distribute-rgt-neg-in N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 100.0

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

   8. Applied rewrites 100.0%

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

   9. Taylor expanded in eps around inf

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

       1. *-commutative N/A

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

       2. lift-*.f64 100.0

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

   11. Applied rewrites 100.0%

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

4. Final simplification 84.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\varepsilon \leq 0.106:\\ \;\;\;\;e^{-x}\\ \mathbf{else}:\\ \;\;\;\;\left(e^{x \cdot \varepsilon} + e^{-x \cdot \varepsilon}\right) \cdot 0.5\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 71.1% accurate, 2.1× speedup

Math

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

FPCore

(FPCore (x eps)
 :precision binary64
 (let* ((t_0 (exp (- x))))
   (if (<= x -2200.0)
     t_0
     (if (<= x -2.7e-247)
       (*
        (fma (fma -1.0 (/ (- (* eps eps) 1.0) (- eps 1.0)) (+ -1.0 eps)) x 2.0)
        0.5)
       (if (<= x 4.5e+228) (* (- (exp (* x eps)) -1.0) 0.5) t_0)))))

C

double code(double x, double eps) {
	double t_0 = exp(-x);
	double tmp;
	if (x <= -2200.0) {
		tmp = t_0;
	} else if (x <= -2.7e-247) {
		tmp = fma(fma(-1.0, (((eps * eps) - 1.0) / (eps - 1.0)), (-1.0 + eps)), x, 2.0) * 0.5;
	} else if (x <= 4.5e+228) {
		tmp = (exp((x * eps)) - -1.0) * 0.5;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, eps)
	t_0 = exp(Float64(-x))
	tmp = 0.0
	if (x <= -2200.0)
		tmp = t_0;
	elseif (x <= -2.7e-247)
		tmp = Float64(fma(fma(-1.0, Float64(Float64(Float64(eps * eps) - 1.0) / Float64(eps - 1.0)), Float64(-1.0 + eps)), x, 2.0) * 0.5);
	elseif (x <= 4.5e+228)
		tmp = Float64(Float64(exp(Float64(x * eps)) - -1.0) * 0.5);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, eps_] := Block[{t$95$0 = N[Exp[(-x)], $MachinePrecision]}, If[LessEqual[x, -2200.0], t$95$0, If[LessEqual[x, -2.7e-247], N[(N[(N[(-1.0 * N[(N[(N[(eps * eps), $MachinePrecision] - 1.0), $MachinePrecision] / N[(eps - 1.0), $MachinePrecision]), $MachinePrecision] + N[(-1.0 + eps), $MachinePrecision]), $MachinePrecision] * x + 2.0), $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[x, 4.5e+228], N[(N[(N[Exp[N[(x * eps), $MachinePrecision]], $MachinePrecision] - -1.0), $MachinePrecision] * 0.5), $MachinePrecision], t$95$0]]]]

Derivation

1. Split input into 3 regimes

2. if x < -2200 or 4.49999999999999983e228 < x

   1. Initial program 100.0%

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

   3. 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)} \]
   4. 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}} \]

   5. Applied rewrites 100.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} \]

   6. 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} \]
   7. Step-by-step derivation

      1. *-commutative N/A

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

      2. distribute-rgt-neg-in N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 89.1

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

   8. Applied rewrites 89.1%

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

   9. Taylor expanded in eps around 0

      \[\leadsto e^{\mathsf{neg}\left(x\right)} \]
   10. Step-by-step derivation

       1. lift-exp.f64 N/A

          \[\leadsto e^{\mathsf{neg}\left(x\right)} \]

       2. lift-neg.f64 87.5

          \[\leadsto e^{-x} \]

   11. Applied rewrites 87.5%

       \[\leadsto e^{-x} \]

   if -2200 < x < -2.70000000000000008e-247

   1. Initial program 60.5%

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

   3. 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)} \]
   4. 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}} \]

   5. Applied rewrites 98.3%

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

   6. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower-neg.f64 N/A

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

      9. lift--.f64 66.9

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

   8. Applied rewrites 66.9%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(-1, \varepsilon + 1, -\left(1 - \varepsilon\right)\right), x, 2\right) \cdot 0.5 \]
   9. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. flip-+ N/A

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

      3. lower-/.f64 N/A

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

      4. unpow2 N/A

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

      5. metadata-eval N/A

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

      6. lower--.f64 N/A

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

      7. unpow2 N/A

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

      8. lower-*.f64 N/A

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

      9. lower--.f64 76.3

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

   10. Applied rewrites 76.3%

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

   if -2.70000000000000008e-247 < x < 4.49999999999999983e228

   1. Initial program 69.3%

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

   3. 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)} \]
   4. 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}} \]

   5. Applied rewrites 99.6%

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

   6. 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} \]
   7. Step-by-step derivation

      1. *-commutative N/A

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

      2. distribute-rgt-neg-in N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 85.6

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

   8. Applied rewrites 85.6%

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

   9. Taylor expanded in x around 0

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

   11. Applied rewrites 66.3%

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

4. Final simplification 73.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2200:\\ \;\;\;\;e^{-x}\\ \mathbf{elif}\;x \leq -2.7 \cdot 10^{-247}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(-1, \frac{\varepsilon \cdot \varepsilon - 1}{\varepsilon - 1}, -1 + \varepsilon\right), x, 2\right) \cdot 0.5\\ \mathbf{elif}\;x \leq 4.5 \cdot 10^{+228}:\\ \;\;\;\;\left(e^{x \cdot \varepsilon} - -1\right) \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;e^{-x}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 65.8% accurate, 2.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.6 \cdot 10^{-247}:\\ \;\;\;\;\left(1 + e^{-x \cdot \varepsilon}\right) \cdot 0.5\\ \mathbf{elif}\;x \leq 4.5 \cdot 10^{+228}:\\ \;\;\;\;\left(e^{x \cdot \varepsilon} - -1\right) \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;e^{-x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (if (<= x -2.6e-247)
   (* (+ 1.0 (exp (- (* x eps)))) 0.5)
   (if (<= x 4.5e+228) (* (- (exp (* x eps)) -1.0) 0.5) (exp (- x)))))

C

double code(double x, double eps) {
	double tmp;
	if (x <= -2.6e-247) {
		tmp = (1.0 + exp(-(x * eps))) * 0.5;
	} else if (x <= 4.5e+228) {
		tmp = (exp((x * eps)) - -1.0) * 0.5;
	} else {
		tmp = exp(-x);
	}
	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 (x <= (-2.6d-247)) then
        tmp = (1.0d0 + exp(-(x * eps))) * 0.5d0
    else if (x <= 4.5d+228) then
        tmp = (exp((x * eps)) - (-1.0d0)) * 0.5d0
    else
        tmp = exp(-x)
    end if
    code = tmp
end function

Java

public static double code(double x, double eps) {
	double tmp;
	if (x <= -2.6e-247) {
		tmp = (1.0 + Math.exp(-(x * eps))) * 0.5;
	} else if (x <= 4.5e+228) {
		tmp = (Math.exp((x * eps)) - -1.0) * 0.5;
	} else {
		tmp = Math.exp(-x);
	}
	return tmp;
}

Python

def code(x, eps):
	tmp = 0
	if x <= -2.6e-247:
		tmp = (1.0 + math.exp(-(x * eps))) * 0.5
	elif x <= 4.5e+228:
		tmp = (math.exp((x * eps)) - -1.0) * 0.5
	else:
		tmp = math.exp(-x)
	return tmp

Julia

function code(x, eps)
	tmp = 0.0
	if (x <= -2.6e-247)
		tmp = Float64(Float64(1.0 + exp(Float64(-Float64(x * eps)))) * 0.5);
	elseif (x <= 4.5e+228)
		tmp = Float64(Float64(exp(Float64(x * eps)) - -1.0) * 0.5);
	else
		tmp = exp(Float64(-x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, eps)
	tmp = 0.0;
	if (x <= -2.6e-247)
		tmp = (1.0 + exp(-(x * eps))) * 0.5;
	elseif (x <= 4.5e+228)
		tmp = (exp((x * eps)) - -1.0) * 0.5;
	else
		tmp = exp(-x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, eps_] := If[LessEqual[x, -2.6e-247], N[(N[(1.0 + N[Exp[(-N[(x * eps), $MachinePrecision])], $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[x, 4.5e+228], N[(N[(N[Exp[N[(x * eps), $MachinePrecision]], $MachinePrecision] - -1.0), $MachinePrecision] * 0.5), $MachinePrecision], N[Exp[(-x)], $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -2.6e-247

   1. Initial program 77.3%

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

   3. 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)} \]
   4. 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}} \]

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

   6. 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} \]
   7. Step-by-step derivation

      1. *-commutative N/A

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

      2. distribute-rgt-neg-in N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 99.0

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

   8. Applied rewrites 99.0%

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

   9. Taylor expanded in eps around inf

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

       1. *-commutative N/A

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

       2. lift-*.f64 99.5

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

   11. Applied rewrites 99.5%

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

   12. Taylor expanded in x around 0

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

   14. Applied rewrites 69.8%

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

   if -2.6e-247 < x < 4.49999999999999983e228

   1. Initial program 69.3%

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

   3. 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)} \]
   4. 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}} \]

   5. Applied rewrites 99.6%

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

   6. 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} \]
   7. Step-by-step derivation

      1. *-commutative N/A

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

      2. distribute-rgt-neg-in N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 85.6

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

   8. Applied rewrites 85.6%

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

   9. Taylor expanded in x around 0

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

   11. Applied rewrites 66.3%

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

   if 4.49999999999999983e228 < x

   1. Initial program 100.0%

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

   3. 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)} \]
   4. 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}} \]

   5. Applied rewrites 100.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} \]

   6. 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} \]
   7. Step-by-step derivation

      1. *-commutative N/A

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

      2. distribute-rgt-neg-in N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 70.1

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

   8. Applied rewrites 70.1%

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

   9. Taylor expanded in eps around 0

      \[\leadsto e^{\mathsf{neg}\left(x\right)} \]
   10. Step-by-step derivation

       1. lift-exp.f64 N/A

          \[\leadsto e^{\mathsf{neg}\left(x\right)} \]

       2. lift-neg.f64 65.8

          \[\leadsto e^{-x} \]

   11. Applied rewrites 65.8%

       \[\leadsto e^{-x} \]
3. Recombined 3 regimes into one program.

4. Final simplification 67.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2.6 \cdot 10^{-247}:\\ \;\;\;\;\left(1 + e^{-x \cdot \varepsilon}\right) \cdot 0.5\\ \mathbf{elif}\;x \leq 4.5 \cdot 10^{+228}:\\ \;\;\;\;\left(e^{x \cdot \varepsilon} - -1\right) \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;e^{-x}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 70.9% accurate, 2.5× speedup

Math

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

FPCore

(FPCore (x eps)
 :precision binary64
 (if (<= eps 8.2e+175)
   (exp (- x))
   (* (fma (fma -1.0 (- eps -1.0) (/ (+ -1.0 (* eps eps)) 1.0)) x 2.0) 0.5)))

C

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

Julia

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

Wolfram

code[x_, eps_] := If[LessEqual[eps, 8.2e+175], N[Exp[(-x)], $MachinePrecision], N[(N[(N[(-1.0 * N[(eps - -1.0), $MachinePrecision] + N[(N[(-1.0 + N[(eps * eps), $MachinePrecision]), $MachinePrecision] / 1.0), $MachinePrecision]), $MachinePrecision] * x + 2.0), $MachinePrecision] * 0.5), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if eps < 8.19999999999999955e175

   1. Initial program 71.9%

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

   3. 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)} \]
   4. 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}} \]

   5. Applied rewrites 99.3%

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

   6. 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} \]
   7. Step-by-step derivation

      1. *-commutative N/A

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

      2. distribute-rgt-neg-in N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 87.8

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

   8. Applied rewrites 87.8%

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

   9. Taylor expanded in eps around 0

      \[\leadsto e^{\mathsf{neg}\left(x\right)} \]
   10. Step-by-step derivation

       1. lift-exp.f64 N/A

          \[\leadsto e^{\mathsf{neg}\left(x\right)} \]

       2. lift-neg.f64 78.6

          \[\leadsto e^{-x} \]

   11. Applied rewrites 78.6%

       \[\leadsto e^{-x} \]

   if 8.19999999999999955e175 < eps

   1. Initial program 100.0%

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

   3. 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)} \]
   4. 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}} \]

   5. Applied rewrites 100.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} \]

   6. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower-neg.f64 N/A

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

      9. lift--.f64 3.1

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

   8. Applied rewrites 3.1%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(-1, \varepsilon + 1, -\left(1 - \varepsilon\right)\right), x, 2\right) \cdot 0.5 \]
   9. Step-by-step derivation

      1. lift--.f64 N/A

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

      2. flip-- N/A

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

      3. lower-/.f64 N/A

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

      4. metadata-eval N/A

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

      5. unpow2 N/A

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

      6. lower--.f64 N/A

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

      7. unpow2 N/A

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

      8. lower-*.f64 N/A

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

      9. +-commutative N/A

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

      10. lift-+.f64 57.1

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

   10. Applied rewrites 57.1%

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

   11. Taylor expanded in eps around 0

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

   13. Applied rewrites 57.1%

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

4. Final simplification 76.2%

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

Alternative 6: 67.6% accurate, 3.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -6.8 \cdot 10^{+153}:\\ \;\;\;\;\frac{\left(x \cdot x\right) \cdot 4 - 4}{-2 \cdot x - 2} \cdot 0.5\\ \mathbf{elif}\;x \leq -2.6 \cdot 10^{-247}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(-1, \frac{\varepsilon \cdot \varepsilon - 1}{\varepsilon - 1}, -1\right), x, 2\right) \cdot 0.5\\ \mathbf{elif}\;x \leq 135000:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(-1, \varepsilon - -1, \frac{-1 + \varepsilon \cdot \varepsilon}{\varepsilon - -1}\right), x, 2\right) \cdot 0.5\\ \mathbf{elif}\;x \leq 9.2 \cdot 10^{+117} \lor \neg \left(x \leq 7.1 \cdot 10^{+224}\right):\\ \;\;\;\;\frac{\left(1 + \frac{1}{\varepsilon}\right) \cdot 1 - \frac{\mathsf{fma}\left(-1, \varepsilon, 1\right)}{\varepsilon}}{2}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(0.3333333333333333 \cdot x - 0.5, x \cdot x, 1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (if (<= x -6.8e+153)
   (* (/ (- (* (* x x) 4.0) 4.0) (- (* -2.0 x) 2.0)) 0.5)
   (if (<= x -2.6e-247)
     (* (fma (fma -1.0 (/ (- (* eps eps) 1.0) (- eps 1.0)) -1.0) x 2.0) 0.5)
     (if (<= x 135000.0)
       (*
        (fma
         (fma -1.0 (- eps -1.0) (/ (+ -1.0 (* eps eps)) (- eps -1.0)))
         x
         2.0)
        0.5)
       (if (or (<= x 9.2e+117) (not (<= x 7.1e+224)))
         (/ (- (* (+ 1.0 (/ 1.0 eps)) 1.0) (/ (fma -1.0 eps 1.0) eps)) 2.0)
         (fma (- (* 0.3333333333333333 x) 0.5) (* x x) 1.0))))))

C

double code(double x, double eps) {
	double tmp;
	if (x <= -6.8e+153) {
		tmp = ((((x * x) * 4.0) - 4.0) / ((-2.0 * x) - 2.0)) * 0.5;
	} else if (x <= -2.6e-247) {
		tmp = fma(fma(-1.0, (((eps * eps) - 1.0) / (eps - 1.0)), -1.0), x, 2.0) * 0.5;
	} else if (x <= 135000.0) {
		tmp = fma(fma(-1.0, (eps - -1.0), ((-1.0 + (eps * eps)) / (eps - -1.0))), x, 2.0) * 0.5;
	} else if ((x <= 9.2e+117) || !(x <= 7.1e+224)) {
		tmp = (((1.0 + (1.0 / eps)) * 1.0) - (fma(-1.0, eps, 1.0) / eps)) / 2.0;
	} else {
		tmp = fma(((0.3333333333333333 * x) - 0.5), (x * x), 1.0);
	}
	return tmp;
}

Julia

function code(x, eps)
	tmp = 0.0
	if (x <= -6.8e+153)
		tmp = Float64(Float64(Float64(Float64(Float64(x * x) * 4.0) - 4.0) / Float64(Float64(-2.0 * x) - 2.0)) * 0.5);
	elseif (x <= -2.6e-247)
		tmp = Float64(fma(fma(-1.0, Float64(Float64(Float64(eps * eps) - 1.0) / Float64(eps - 1.0)), -1.0), x, 2.0) * 0.5);
	elseif (x <= 135000.0)
		tmp = Float64(fma(fma(-1.0, Float64(eps - -1.0), Float64(Float64(-1.0 + Float64(eps * eps)) / Float64(eps - -1.0))), x, 2.0) * 0.5);
	elseif ((x <= 9.2e+117) || !(x <= 7.1e+224))
		tmp = Float64(Float64(Float64(Float64(1.0 + Float64(1.0 / eps)) * 1.0) - Float64(fma(-1.0, eps, 1.0) / eps)) / 2.0);
	else
		tmp = fma(Float64(Float64(0.3333333333333333 * x) - 0.5), Float64(x * x), 1.0);
	end
	return tmp
end

Wolfram

code[x_, eps_] := If[LessEqual[x, -6.8e+153], N[(N[(N[(N[(N[(x * x), $MachinePrecision] * 4.0), $MachinePrecision] - 4.0), $MachinePrecision] / N[(N[(-2.0 * x), $MachinePrecision] - 2.0), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[x, -2.6e-247], N[(N[(N[(-1.0 * N[(N[(N[(eps * eps), $MachinePrecision] - 1.0), $MachinePrecision] / N[(eps - 1.0), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision] * x + 2.0), $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[x, 135000.0], N[(N[(N[(-1.0 * N[(eps - -1.0), $MachinePrecision] + N[(N[(-1.0 + N[(eps * eps), $MachinePrecision]), $MachinePrecision] / N[(eps - -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * x + 2.0), $MachinePrecision] * 0.5), $MachinePrecision], If[Or[LessEqual[x, 9.2e+117], N[Not[LessEqual[x, 7.1e+224]], $MachinePrecision]], N[(N[(N[(N[(1.0 + N[(1.0 / eps), $MachinePrecision]), $MachinePrecision] * 1.0), $MachinePrecision] - N[(N[(-1.0 * eps + 1.0), $MachinePrecision] / eps), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[(N[(0.3333333333333333 * x), $MachinePrecision] - 0.5), $MachinePrecision] * N[(x * x), $MachinePrecision] + 1.0), $MachinePrecision]]]]]

Derivation

1. Split input into 5 regimes

2. if x < -6.7999999999999995e153

   1. Initial program 100.0%

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

   3. 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)} \]
   4. 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}} \]

   5. Applied rewrites 100.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} \]

   6. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower-neg.f64 N/A

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

      9. lift--.f64 3.4

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

   8. Applied rewrites 3.4%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(-1, \varepsilon + 1, -\left(1 - \varepsilon\right)\right), x, 2\right) \cdot 0.5 \]
   9. Step-by-step derivation

      1. lift-fma.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-fma.f64 N/A

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

      4. lift-neg.f64 N/A

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

      5. lift--.f64 N/A

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

      6. flip-+ N/A

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

      7. lower-/.f64 N/A

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

   10. Applied rewrites 7.0%

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

   11. Taylor expanded in eps around 0

       \[\leadsto \frac{4 \cdot {x}^{2} - 4}{-2 \cdot x - 2} \cdot \frac{1}{2} \]
   12. Step-by-step derivation

   13. Applied rewrites 100.0%

       \[\leadsto \frac{\left(x \cdot x\right) \cdot 4 - 4}{-2 \cdot x - 2} \cdot 0.5 \]

   if -6.7999999999999995e153 < x < -2.6e-247

   1. Initial program 69.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. Add Preprocessing

   3. 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)} \]
   4. 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}} \]

   5. Applied rewrites 98.6%

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

   6. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower-neg.f64 N/A

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

      9. lift--.f64 53.0

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

   8. Applied rewrites 53.0%

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

   9. Taylor expanded in eps around 0

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

   11. Applied rewrites 56.5%

       \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(-1, \varepsilon + 1, -1\right), x, 2\right) \cdot 0.5 \]
   12. Step-by-step derivation

       1. lift-+.f64 N/A

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

       2. flip-+ N/A

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

       3. lower-/.f64 N/A

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

       4. pow2 N/A

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

       5. metadata-eval N/A

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

       6. lower--.f64 N/A

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

       7. pow2 N/A

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

       8. lift-*.f64 N/A

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

       9. lower--.f64 67.0

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

   13. Applied rewrites 67.0%

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

   if -2.6e-247 < x < 135000

   1. Initial program 52.6%

      \[\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. Add Preprocessing

   3. 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)} \]
   4. 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}} \]

   5. Applied rewrites 99.3%

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

   6. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower-neg.f64 N/A

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

      9. lift--.f64 80.0

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

   8. Applied rewrites 80.0%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(-1, \varepsilon + 1, -\left(1 - \varepsilon\right)\right), x, 2\right) \cdot 0.5 \]
   9. Step-by-step derivation

      1. lift--.f64 N/A

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

      2. flip-- N/A

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

      3. lower-/.f64 N/A

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

      4. metadata-eval N/A

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

      5. unpow2 N/A

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

      6. lower--.f64 N/A

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

      7. unpow2 N/A

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

      8. lower-*.f64 N/A

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

      9. +-commutative N/A

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

      10. lift-+.f64 79.5

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

   10. Applied rewrites 79.5%

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

   if 135000 < x < 9.19999999999999951e117 or 7.0999999999999998e224 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 21.6%

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

   6. Taylor expanded in x around 0

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

      1. lower--.f64 N/A

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

      2. inv-pow N/A

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

      3. lower-pow.f64 60.1

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

   8. Applied rewrites 60.1%

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

   9. Taylor expanded in eps around 0

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

       1. lower-/.f64 N/A

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

       2. mul-1-neg N/A

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

       3. +-commutative N/A

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

       4. mul-1-neg N/A

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

       5. lower-fma.f64 60.1

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

   11. Applied rewrites 60.1%

       \[\leadsto \frac{\left(1 + \frac{1}{\varepsilon}\right) \cdot 1 - \frac{\mathsf{fma}\left(-1, \varepsilon, 1\right)}{\color{blue}{\varepsilon}}}{2} \]

   if 9.19999999999999951e117 < x < 7.0999999999999998e224

   1. Initial program 100.0%

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

   3. Taylor expanded in eps around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   5. Applied rewrites 25.0%

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

   6. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 76.6

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

   8. Applied rewrites 76.6%

      \[\leadsto \mathsf{fma}\left(0.3333333333333333 \cdot x - 0.5, \color{blue}{x \cdot x}, 1\right) \]
3. Recombined 5 regimes into one program.

4. Final simplification 74.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -6.8 \cdot 10^{+153}:\\ \;\;\;\;\frac{\left(x \cdot x\right) \cdot 4 - 4}{-2 \cdot x - 2} \cdot 0.5\\ \mathbf{elif}\;x \leq -2.6 \cdot 10^{-247}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(-1, \frac{\varepsilon \cdot \varepsilon - 1}{\varepsilon - 1}, -1\right), x, 2\right) \cdot 0.5\\ \mathbf{elif}\;x \leq 135000:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(-1, \varepsilon - -1, \frac{-1 + \varepsilon \cdot \varepsilon}{\varepsilon - -1}\right), x, 2\right) \cdot 0.5\\ \mathbf{elif}\;x \leq 9.2 \cdot 10^{+117} \lor \neg \left(x \leq 7.1 \cdot 10^{+224}\right):\\ \;\;\;\;\frac{\left(1 + \frac{1}{\varepsilon}\right) \cdot 1 - \frac{\mathsf{fma}\left(-1, \varepsilon, 1\right)}{\varepsilon}}{2}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(0.3333333333333333 \cdot x - 0.5, x \cdot x, 1\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 67.5% accurate, 4.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -6.8 \cdot 10^{+153}:\\ \;\;\;\;\frac{\left(x \cdot x\right) \cdot 4 - 4}{-2 \cdot x - 2} \cdot 0.5\\ \mathbf{elif}\;x \leq -2.7 \cdot 10^{-247}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(-1, \frac{\varepsilon \cdot \varepsilon - 1}{\varepsilon - 1}, -1\right), x, 2\right) \cdot 0.5\\ \mathbf{elif}\;x \leq 9.5 \cdot 10^{-239}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(-1, \varepsilon - -1, \frac{-1 + \varepsilon \cdot \varepsilon}{1}\right), x, 2\right) \cdot 0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (if (<= x -6.8e+153)
   (* (/ (- (* (* x x) 4.0) 4.0) (- (* -2.0 x) 2.0)) 0.5)
   (if (<= x -2.7e-247)
     (* (fma (fma -1.0 (/ (- (* eps eps) 1.0) (- eps 1.0)) -1.0) x 2.0) 0.5)
     (if (<= x 9.5e-239)
       1.0
       (*
        (fma (fma -1.0 (- eps -1.0) (/ (+ -1.0 (* eps eps)) 1.0)) x 2.0)
        0.5)))))

C

double code(double x, double eps) {
	double tmp;
	if (x <= -6.8e+153) {
		tmp = ((((x * x) * 4.0) - 4.0) / ((-2.0 * x) - 2.0)) * 0.5;
	} else if (x <= -2.7e-247) {
		tmp = fma(fma(-1.0, (((eps * eps) - 1.0) / (eps - 1.0)), -1.0), x, 2.0) * 0.5;
	} else if (x <= 9.5e-239) {
		tmp = 1.0;
	} else {
		tmp = fma(fma(-1.0, (eps - -1.0), ((-1.0 + (eps * eps)) / 1.0)), x, 2.0) * 0.5;
	}
	return tmp;
}

Julia

function code(x, eps)
	tmp = 0.0
	if (x <= -6.8e+153)
		tmp = Float64(Float64(Float64(Float64(Float64(x * x) * 4.0) - 4.0) / Float64(Float64(-2.0 * x) - 2.0)) * 0.5);
	elseif (x <= -2.7e-247)
		tmp = Float64(fma(fma(-1.0, Float64(Float64(Float64(eps * eps) - 1.0) / Float64(eps - 1.0)), -1.0), x, 2.0) * 0.5);
	elseif (x <= 9.5e-239)
		tmp = 1.0;
	else
		tmp = Float64(fma(fma(-1.0, Float64(eps - -1.0), Float64(Float64(-1.0 + Float64(eps * eps)) / 1.0)), x, 2.0) * 0.5);
	end
	return tmp
end

Wolfram

code[x_, eps_] := If[LessEqual[x, -6.8e+153], N[(N[(N[(N[(N[(x * x), $MachinePrecision] * 4.0), $MachinePrecision] - 4.0), $MachinePrecision] / N[(N[(-2.0 * x), $MachinePrecision] - 2.0), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[x, -2.7e-247], N[(N[(N[(-1.0 * N[(N[(N[(eps * eps), $MachinePrecision] - 1.0), $MachinePrecision] / N[(eps - 1.0), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision] * x + 2.0), $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[x, 9.5e-239], 1.0, N[(N[(N[(-1.0 * N[(eps - -1.0), $MachinePrecision] + N[(N[(-1.0 + N[(eps * eps), $MachinePrecision]), $MachinePrecision] / 1.0), $MachinePrecision]), $MachinePrecision] * x + 2.0), $MachinePrecision] * 0.5), $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if x < -6.7999999999999995e153

   1. Initial program 100.0%

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

   3. 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)} \]
   4. 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}} \]

   5. Applied rewrites 100.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} \]

   6. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower-neg.f64 N/A

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

      9. lift--.f64 3.4

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

   8. Applied rewrites 3.4%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(-1, \varepsilon + 1, -\left(1 - \varepsilon\right)\right), x, 2\right) \cdot 0.5 \]
   9. Step-by-step derivation

      1. lift-fma.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-fma.f64 N/A

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

      4. lift-neg.f64 N/A

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

      5. lift--.f64 N/A

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

      6. flip-+ N/A

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

      7. lower-/.f64 N/A

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

   10. Applied rewrites 7.0%

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

   11. Taylor expanded in eps around 0

       \[\leadsto \frac{4 \cdot {x}^{2} - 4}{-2 \cdot x - 2} \cdot \frac{1}{2} \]
   12. Step-by-step derivation

   13. Applied rewrites 100.0%

       \[\leadsto \frac{\left(x \cdot x\right) \cdot 4 - 4}{-2 \cdot x - 2} \cdot 0.5 \]

   if -6.7999999999999995e153 < x < -2.70000000000000008e-247

   1. Initial program 69.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. Add Preprocessing

   3. 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)} \]
   4. 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}} \]

   5. Applied rewrites 98.6%

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

   6. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower-neg.f64 N/A

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

      9. lift--.f64 53.0

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

   8. Applied rewrites 53.0%

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

   9. Taylor expanded in eps around 0

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

   11. Applied rewrites 56.5%

       \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(-1, \varepsilon + 1, -1\right), x, 2\right) \cdot 0.5 \]
   12. Step-by-step derivation

       1. lift-+.f64 N/A

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

       2. flip-+ N/A

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

       3. lower-/.f64 N/A

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

       4. pow2 N/A

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

       5. metadata-eval N/A

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

       6. lower--.f64 N/A

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

       7. pow2 N/A

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

       8. lift-*.f64 N/A

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

       9. lower--.f64 67.0

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

   13. Applied rewrites 67.0%

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

   if -2.70000000000000008e-247 < x < 9.4999999999999992e-239

   1. Initial program 48.9%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 97.3%

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

   if 9.4999999999999992e-239 < x

   1. Initial program 80.8%

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

   3. 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)} \]
   4. 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}} \]

   5. Applied rewrites 99.5%

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

   6. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower-neg.f64 N/A

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

      9. lift--.f64 30.9

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

   8. Applied rewrites 30.9%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(-1, \varepsilon + 1, -\left(1 - \varepsilon\right)\right), x, 2\right) \cdot 0.5 \]
   9. Step-by-step derivation

      1. lift--.f64 N/A

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

      2. flip-- N/A

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

      3. lower-/.f64 N/A

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

      4. metadata-eval N/A

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

      5. unpow2 N/A

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

      6. lower--.f64 N/A

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

      7. unpow2 N/A

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

      8. lower-*.f64 N/A

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

      9. +-commutative N/A

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

      10. lift-+.f64 41.8

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

   10. Applied rewrites 41.8%

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

   11. Taylor expanded in eps around 0

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

   13. Applied rewrites 62.5%

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

4. Final simplification 72.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -6.8 \cdot 10^{+153}:\\ \;\;\;\;\frac{\left(x \cdot x\right) \cdot 4 - 4}{-2 \cdot x - 2} \cdot 0.5\\ \mathbf{elif}\;x \leq -2.7 \cdot 10^{-247}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(-1, \frac{\varepsilon \cdot \varepsilon - 1}{\varepsilon - 1}, -1\right), x, 2\right) \cdot 0.5\\ \mathbf{elif}\;x \leq 9.5 \cdot 10^{-239}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(-1, \varepsilon - -1, \frac{-1 + \varepsilon \cdot \varepsilon}{1}\right), x, 2\right) \cdot 0.5\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 63.6% accurate, 5.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -6.8 \cdot 10^{+153}:\\ \;\;\;\;\frac{\left(x \cdot x\right) \cdot 4 - 4}{-2 \cdot x - 2} \cdot 0.5\\ \mathbf{elif}\;x \leq -2.7 \cdot 10^{-247}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(-1, \frac{\varepsilon \cdot \varepsilon - 1}{\varepsilon - 1}, -1\right), x, 2\right) \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(0.3333333333333333 \cdot x - 0.5, x \cdot x, 1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (if (<= x -6.8e+153)
   (* (/ (- (* (* x x) 4.0) 4.0) (- (* -2.0 x) 2.0)) 0.5)
   (if (<= x -2.7e-247)
     (* (fma (fma -1.0 (/ (- (* eps eps) 1.0) (- eps 1.0)) -1.0) x 2.0) 0.5)
     (fma (- (* 0.3333333333333333 x) 0.5) (* x x) 1.0))))

C

double code(double x, double eps) {
	double tmp;
	if (x <= -6.8e+153) {
		tmp = ((((x * x) * 4.0) - 4.0) / ((-2.0 * x) - 2.0)) * 0.5;
	} else if (x <= -2.7e-247) {
		tmp = fma(fma(-1.0, (((eps * eps) - 1.0) / (eps - 1.0)), -1.0), x, 2.0) * 0.5;
	} else {
		tmp = fma(((0.3333333333333333 * x) - 0.5), (x * x), 1.0);
	}
	return tmp;
}

Julia

function code(x, eps)
	tmp = 0.0
	if (x <= -6.8e+153)
		tmp = Float64(Float64(Float64(Float64(Float64(x * x) * 4.0) - 4.0) / Float64(Float64(-2.0 * x) - 2.0)) * 0.5);
	elseif (x <= -2.7e-247)
		tmp = Float64(fma(fma(-1.0, Float64(Float64(Float64(eps * eps) - 1.0) / Float64(eps - 1.0)), -1.0), x, 2.0) * 0.5);
	else
		tmp = fma(Float64(Float64(0.3333333333333333 * x) - 0.5), Float64(x * x), 1.0);
	end
	return tmp
end

Wolfram

code[x_, eps_] := If[LessEqual[x, -6.8e+153], N[(N[(N[(N[(N[(x * x), $MachinePrecision] * 4.0), $MachinePrecision] - 4.0), $MachinePrecision] / N[(N[(-2.0 * x), $MachinePrecision] - 2.0), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[x, -2.7e-247], N[(N[(N[(-1.0 * N[(N[(N[(eps * eps), $MachinePrecision] - 1.0), $MachinePrecision] / N[(eps - 1.0), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision] * x + 2.0), $MachinePrecision] * 0.5), $MachinePrecision], N[(N[(N[(0.3333333333333333 * x), $MachinePrecision] - 0.5), $MachinePrecision] * N[(x * x), $MachinePrecision] + 1.0), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -6.7999999999999995e153

   1. Initial program 100.0%

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

   3. 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)} \]
   4. 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}} \]

   5. Applied rewrites 100.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} \]

   6. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower-neg.f64 N/A

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

      9. lift--.f64 3.4

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

   8. Applied rewrites 3.4%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(-1, \varepsilon + 1, -\left(1 - \varepsilon\right)\right), x, 2\right) \cdot 0.5 \]
   9. Step-by-step derivation

      1. lift-fma.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-fma.f64 N/A

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

      4. lift-neg.f64 N/A

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

      5. lift--.f64 N/A

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

      6. flip-+ N/A

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

      7. lower-/.f64 N/A

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

   10. Applied rewrites 7.0%

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

   11. Taylor expanded in eps around 0

       \[\leadsto \frac{4 \cdot {x}^{2} - 4}{-2 \cdot x - 2} \cdot \frac{1}{2} \]
   12. Step-by-step derivation

   13. Applied rewrites 100.0%

       \[\leadsto \frac{\left(x \cdot x\right) \cdot 4 - 4}{-2 \cdot x - 2} \cdot 0.5 \]

   if -6.7999999999999995e153 < x < -2.70000000000000008e-247

   1. Initial program 69.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. Add Preprocessing

   3. 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)} \]
   4. 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}} \]

   5. Applied rewrites 98.6%

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

   6. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower-neg.f64 N/A

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

      9. lift--.f64 53.0

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

   8. Applied rewrites 53.0%

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

   9. Taylor expanded in eps around 0

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

   11. Applied rewrites 56.5%

       \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(-1, \varepsilon + 1, -1\right), x, 2\right) \cdot 0.5 \]
   12. Step-by-step derivation

       1. lift-+.f64 N/A

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

       2. flip-+ N/A

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

       3. lower-/.f64 N/A

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

       4. pow2 N/A

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

       5. metadata-eval N/A

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

       6. lower--.f64 N/A

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

       7. pow2 N/A

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

       8. lift-*.f64 N/A

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

       9. lower--.f64 67.0

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

   13. Applied rewrites 67.0%

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

   if -2.70000000000000008e-247 < x

   1. Initial program 73.7%

      \[\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. Add Preprocessing

   3. Taylor expanded in eps around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   5. Applied rewrites 67.4%

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

   6. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 61.0

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

   8. Applied rewrites 61.0%

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

Alternative 9: 60.2% accurate, 6.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -270:\\ \;\;\;\;\frac{\left(x \cdot x\right) \cdot 4 - 4}{-2 \cdot x - 2} \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(0.3333333333333333 \cdot x - 0.5, x \cdot x, 1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (if (<= x -270.0)
   (* (/ (- (* (* x x) 4.0) 4.0) (- (* -2.0 x) 2.0)) 0.5)
   (fma (- (* 0.3333333333333333 x) 0.5) (* x x) 1.0)))

C

double code(double x, double eps) {
	double tmp;
	if (x <= -270.0) {
		tmp = ((((x * x) * 4.0) - 4.0) / ((-2.0 * x) - 2.0)) * 0.5;
	} else {
		tmp = fma(((0.3333333333333333 * x) - 0.5), (x * x), 1.0);
	}
	return tmp;
}

Julia

function code(x, eps)
	tmp = 0.0
	if (x <= -270.0)
		tmp = Float64(Float64(Float64(Float64(Float64(x * x) * 4.0) - 4.0) / Float64(Float64(-2.0 * x) - 2.0)) * 0.5);
	else
		tmp = fma(Float64(Float64(0.3333333333333333 * x) - 0.5), Float64(x * x), 1.0);
	end
	return tmp
end

Wolfram

code[x_, eps_] := If[LessEqual[x, -270.0], N[(N[(N[(N[(N[(x * x), $MachinePrecision] * 4.0), $MachinePrecision] - 4.0), $MachinePrecision] / N[(N[(-2.0 * x), $MachinePrecision] - 2.0), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision], N[(N[(N[(0.3333333333333333 * x), $MachinePrecision] - 0.5), $MachinePrecision] * N[(x * x), $MachinePrecision] + 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -270

   1. Initial program 100.0%

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

   3. 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)} \]
   4. 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}} \]

   5. Applied rewrites 100.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} \]

   6. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower-neg.f64 N/A

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

      9. lift--.f64 3.3

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

   8. Applied rewrites 3.3%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(-1, \varepsilon + 1, -\left(1 - \varepsilon\right)\right), x, 2\right) \cdot 0.5 \]
   9. Step-by-step derivation

      1. lift-fma.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-fma.f64 N/A

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

      4. lift-neg.f64 N/A

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

      5. lift--.f64 N/A

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

      6. flip-+ N/A

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

      7. lower-/.f64 N/A

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

   10. Applied rewrites 5.5%

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

   11. Taylor expanded in eps around 0

       \[\leadsto \frac{4 \cdot {x}^{2} - 4}{-2 \cdot x - 2} \cdot \frac{1}{2} \]
   12. Step-by-step derivation

   13. Applied rewrites 62.4%

       \[\leadsto \frac{\left(x \cdot x\right) \cdot 4 - 4}{-2 \cdot x - 2} \cdot 0.5 \]

   if -270 < x

   1. Initial program 70.3%

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

   3. Taylor expanded in eps around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   5. Applied rewrites 68.0%

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

   6. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 63.2

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

   8. Applied rewrites 63.2%

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

Alternative 10: 56.4% accurate, 10.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -230:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(-1, \varepsilon - -1, -1\right), x, 2\right) \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(0.3333333333333333 \cdot x - 0.5, x \cdot x, 1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (if (<= x -230.0)
   (* (fma (fma -1.0 (- eps -1.0) -1.0) x 2.0) 0.5)
   (fma (- (* 0.3333333333333333 x) 0.5) (* x x) 1.0)))

C

double code(double x, double eps) {
	double tmp;
	if (x <= -230.0) {
		tmp = fma(fma(-1.0, (eps - -1.0), -1.0), x, 2.0) * 0.5;
	} else {
		tmp = fma(((0.3333333333333333 * x) - 0.5), (x * x), 1.0);
	}
	return tmp;
}

Julia

function code(x, eps)
	tmp = 0.0
	if (x <= -230.0)
		tmp = Float64(fma(fma(-1.0, Float64(eps - -1.0), -1.0), x, 2.0) * 0.5);
	else
		tmp = fma(Float64(Float64(0.3333333333333333 * x) - 0.5), Float64(x * x), 1.0);
	end
	return tmp
end

Wolfram

code[x_, eps_] := If[LessEqual[x, -230.0], N[(N[(N[(-1.0 * N[(eps - -1.0), $MachinePrecision] + -1.0), $MachinePrecision] * x + 2.0), $MachinePrecision] * 0.5), $MachinePrecision], N[(N[(N[(0.3333333333333333 * x), $MachinePrecision] - 0.5), $MachinePrecision] * N[(x * x), $MachinePrecision] + 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -230

   1. Initial program 100.0%

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

   3. 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)} \]
   4. 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}} \]

   5. Applied rewrites 100.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} \]

   6. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower-neg.f64 N/A

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

      9. lift--.f64 3.3

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

   8. Applied rewrites 3.3%

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

   9. Taylor expanded in eps around 0

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

   11. Applied rewrites 26.0%

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

   if -230 < x

   1. Initial program 70.3%

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

   3. Taylor expanded in eps around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   5. Applied rewrites 68.0%

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

   6. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 63.2

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

   8. Applied rewrites 63.2%

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

4. Final simplification 57.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -230:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(-1, \varepsilon - -1, -1\right), x, 2\right) \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(0.3333333333333333 \cdot x - 0.5, x \cdot x, 1\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 56.4% accurate, 10.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -230:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(-1, \varepsilon, -1\right), x, 2\right) \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(0.3333333333333333 \cdot x - 0.5, x \cdot x, 1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (if (<= x -230.0)
   (* (fma (fma -1.0 eps -1.0) x 2.0) 0.5)
   (fma (- (* 0.3333333333333333 x) 0.5) (* x x) 1.0)))

C

double code(double x, double eps) {
	double tmp;
	if (x <= -230.0) {
		tmp = fma(fma(-1.0, eps, -1.0), x, 2.0) * 0.5;
	} else {
		tmp = fma(((0.3333333333333333 * x) - 0.5), (x * x), 1.0);
	}
	return tmp;
}

Julia

function code(x, eps)
	tmp = 0.0
	if (x <= -230.0)
		tmp = Float64(fma(fma(-1.0, eps, -1.0), x, 2.0) * 0.5);
	else
		tmp = fma(Float64(Float64(0.3333333333333333 * x) - 0.5), Float64(x * x), 1.0);
	end
	return tmp
end

Wolfram

code[x_, eps_] := If[LessEqual[x, -230.0], N[(N[(N[(-1.0 * eps + -1.0), $MachinePrecision] * x + 2.0), $MachinePrecision] * 0.5), $MachinePrecision], N[(N[(N[(0.3333333333333333 * x), $MachinePrecision] - 0.5), $MachinePrecision] * N[(x * x), $MachinePrecision] + 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -230

   1. Initial program 100.0%

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

   3. 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)} \]
   4. 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}} \]

   5. Applied rewrites 100.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} \]

   6. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower-neg.f64 N/A

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

      9. lift--.f64 3.3

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

   8. Applied rewrites 3.3%

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

   9. Taylor expanded in eps around 0

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

   11. Applied rewrites 26.0%

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

   12. Taylor expanded in eps around inf

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

   14. Applied rewrites 26.0%

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

   if -230 < x

   1. Initial program 70.3%

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

   3. Taylor expanded in eps around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   5. Applied rewrites 68.0%

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

   6. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 63.2

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

   8. Applied rewrites 63.2%

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

Alternative 12: 49.7% accurate, 15.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 75.0%

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

3. 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)} \]
4. 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}} \]

5. Applied rewrites 99.4%

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

6. Taylor expanded in x around 0

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

   1. +-commutative N/A

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

   2. *-commutative N/A

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

   3. lower-fma.f64 N/A

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

   4. lower-fma.f64 N/A

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

   5. +-commutative N/A

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

   6. lower-+.f64 N/A

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

   7. mul-1-neg N/A

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

   8. lower-neg.f64 N/A

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

   9. lift--.f64 43.5

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

8. Applied rewrites 43.5%

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

9. Taylor expanded in eps around 0

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

11. Applied rewrites 50.9%

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

12. Taylor expanded in eps around inf

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

14. Applied rewrites 50.9%

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

Alternative 13: 43.4% accurate, 273.0× 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 75.0%

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

3. Taylor expanded in x around 0

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

5. Applied rewrites 44.0%

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

Reproduce

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