Logistic function from Lakshay Garg

Percentage Accurate: 54.4% → 99.9%

Time: 8.7s

Alternatives: 16

Speedup: 5.1×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 54.4% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 1 + {\left(e^{x}\right)}^{-2}\\ t_1 := \frac{2}{t\_0} - -1\\ t_2 := {\left(0.5 \cdot t\_0\right)}^{-1.5}\\ t_3 := {t\_0}^{-2}\\ t_4 := \mathsf{fma}\left(t\_3, 4, t\_1\right)\\ \mathbf{if}\;x \cdot -2 \leq -0.4:\\ \;\;\;\;\frac{{\left(\frac{4 \cdot t\_3}{t\_1}\right)}^{2} - {\left({t\_1}^{2}\right)}^{-1}}{\mathsf{fma}\left(4, \frac{t\_3}{t\_1}, {t\_1}^{-1}\right)}\\ \mathbf{elif}\;x \cdot -2 \leq 5 \cdot 10^{-6}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(x \cdot x, 0.13333333333333333, -0.3333333333333333\right) \cdot \left(x \cdot x\right), x, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(t\_2, \frac{t\_2}{t\_4}, -{t\_4}^{-1}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (+ 1.0 (pow (exp x) -2.0)))
        (t_1 (- (/ 2.0 t_0) -1.0))
        (t_2 (pow (* 0.5 t_0) -1.5))
        (t_3 (pow t_0 -2.0))
        (t_4 (fma t_3 4.0 t_1)))
   (if (<= (* x -2.0) -0.4)
     (/
      (- (pow (/ (* 4.0 t_3) t_1) 2.0) (pow (pow t_1 2.0) -1.0))
      (fma 4.0 (/ t_3 t_1) (pow t_1 -1.0)))
     (if (<= (* x -2.0) 5e-6)
       (fma
        (* (fma (* x x) 0.13333333333333333 -0.3333333333333333) (* x x))
        x
        x)
       (fma t_2 (/ t_2 t_4) (- (pow t_4 -1.0)))))))

C

double code(double x, double y) {
	double t_0 = 1.0 + pow(exp(x), -2.0);
	double t_1 = (2.0 / t_0) - -1.0;
	double t_2 = pow((0.5 * t_0), -1.5);
	double t_3 = pow(t_0, -2.0);
	double t_4 = fma(t_3, 4.0, t_1);
	double tmp;
	if ((x * -2.0) <= -0.4) {
		tmp = (pow(((4.0 * t_3) / t_1), 2.0) - pow(pow(t_1, 2.0), -1.0)) / fma(4.0, (t_3 / t_1), pow(t_1, -1.0));
	} else if ((x * -2.0) <= 5e-6) {
		tmp = fma((fma((x * x), 0.13333333333333333, -0.3333333333333333) * (x * x)), x, x);
	} else {
		tmp = fma(t_2, (t_2 / t_4), -pow(t_4, -1.0));
	}
	return tmp;
}

Julia

function code(x, y)
	t_0 = Float64(1.0 + (exp(x) ^ -2.0))
	t_1 = Float64(Float64(2.0 / t_0) - -1.0)
	t_2 = Float64(0.5 * t_0) ^ -1.5
	t_3 = t_0 ^ -2.0
	t_4 = fma(t_3, 4.0, t_1)
	tmp = 0.0
	if (Float64(x * -2.0) <= -0.4)
		tmp = Float64(Float64((Float64(Float64(4.0 * t_3) / t_1) ^ 2.0) - ((t_1 ^ 2.0) ^ -1.0)) / fma(4.0, Float64(t_3 / t_1), (t_1 ^ -1.0)));
	elseif (Float64(x * -2.0) <= 5e-6)
		tmp = fma(Float64(fma(Float64(x * x), 0.13333333333333333, -0.3333333333333333) * Float64(x * x)), x, x);
	else
		tmp = fma(t_2, Float64(t_2 / t_4), Float64(-(t_4 ^ -1.0)));
	end
	return tmp
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(1.0 + N[Power[N[Exp[x], $MachinePrecision], -2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(2.0 / t$95$0), $MachinePrecision] - -1.0), $MachinePrecision]}, Block[{t$95$2 = N[Power[N[(0.5 * t$95$0), $MachinePrecision], -1.5], $MachinePrecision]}, Block[{t$95$3 = N[Power[t$95$0, -2.0], $MachinePrecision]}, Block[{t$95$4 = N[(t$95$3 * 4.0 + t$95$1), $MachinePrecision]}, If[LessEqual[N[(x * -2.0), $MachinePrecision], -0.4], N[(N[(N[Power[N[(N[(4.0 * t$95$3), $MachinePrecision] / t$95$1), $MachinePrecision], 2.0], $MachinePrecision] - N[Power[N[Power[t$95$1, 2.0], $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision] / N[(4.0 * N[(t$95$3 / t$95$1), $MachinePrecision] + N[Power[t$95$1, -1.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * -2.0), $MachinePrecision], 5e-6], N[(N[(N[(N[(x * x), $MachinePrecision] * 0.13333333333333333 + -0.3333333333333333), $MachinePrecision] * N[(x * x), $MachinePrecision]), $MachinePrecision] * x + x), $MachinePrecision], N[(t$95$2 * N[(t$95$2 / t$95$4), $MachinePrecision] + (-N[Power[t$95$4, -1.0], $MachinePrecision])), $MachinePrecision]]]]]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 #s(literal -2 binary64) x) < -0.40000000000000002

   1. Initial program 100.0%

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

   4. Applied rewrites 100.0%

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

   if -0.40000000000000002 < (*.f64 #s(literal -2 binary64) x) < 5.00000000000000041e-6

   1. Initial program 8.2%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. sub-neg N/A

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

      3. metadata-eval N/A

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

      4. distribute-lft-in N/A

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

      5. *-commutative N/A

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

      6. associate-+l+ N/A

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

      7. +-commutative N/A

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

      8. distribute-lft-in N/A

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

      9. associate-*r* N/A

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

      10. *-commutative N/A

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

      11. associate-*r* N/A

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

      12. lower-fma.f64 N/A

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

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{5}, 0.13333333333333333, \mathsf{fma}\left({x}^{3}, -0.3333333333333333, x\right)\right)} \]

   6. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. associate-*r* N/A

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

      4. unpow2 N/A

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

      5. cube-mult N/A

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

      6. *-rgt-identity N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-pow.f64 N/A

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

      9. sub-neg N/A

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

      10. metadata-eval N/A

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

      11. lower-fma.f64 N/A

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

      12. unpow2 N/A

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

      13. lower-*.f64 100.0

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

   8. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{3}, \mathsf{fma}\left(0.13333333333333333, x \cdot x, -0.3333333333333333\right), x\right)} \]
   9. Step-by-step derivation

   10. Applied rewrites 100.0%

       \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(x \cdot x, 0.13333333333333333, -0.3333333333333333\right) \cdot \left(x \cdot x\right), \color{blue}{x}, x\right) \]

   if 5.00000000000000041e-6 < (*.f64 #s(literal -2 binary64) x)

   1. Initial program 99.9%

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

   4. Applied rewrites 100.0%

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

4. Final simplification 100.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \cdot -2 \leq -0.4:\\ \;\;\;\;\frac{{\left(\frac{4 \cdot {\left(1 + {\left(e^{x}\right)}^{-2}\right)}^{-2}}{\frac{2}{1 + {\left(e^{x}\right)}^{-2}} - -1}\right)}^{2} - {\left({\left(\frac{2}{1 + {\left(e^{x}\right)}^{-2}} - -1\right)}^{2}\right)}^{-1}}{\mathsf{fma}\left(4, \frac{{\left(1 + {\left(e^{x}\right)}^{-2}\right)}^{-2}}{\frac{2}{1 + {\left(e^{x}\right)}^{-2}} - -1}, {\left(\frac{2}{1 + {\left(e^{x}\right)}^{-2}} - -1\right)}^{-1}\right)}\\ \mathbf{elif}\;x \cdot -2 \leq 5 \cdot 10^{-6}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(x \cdot x, 0.13333333333333333, -0.3333333333333333\right) \cdot \left(x \cdot x\right), x, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left({\left(0.5 \cdot \left(1 + {\left(e^{x}\right)}^{-2}\right)\right)}^{-1.5}, \frac{{\left(0.5 \cdot \left(1 + {\left(e^{x}\right)}^{-2}\right)\right)}^{-1.5}}{\mathsf{fma}\left({\left(1 + {\left(e^{x}\right)}^{-2}\right)}^{-2}, 4, \frac{2}{1 + {\left(e^{x}\right)}^{-2}} - -1\right)}, -{\left(\mathsf{fma}\left({\left(1 + {\left(e^{x}\right)}^{-2}\right)}^{-2}, 4, \frac{2}{1 + {\left(e^{x}\right)}^{-2}} - -1\right)\right)}^{-1}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 99.9% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 1 + {\left(e^{x}\right)}^{-2}\\ t_1 := \mathsf{fma}\left({t\_0}^{-2}, 4, \frac{2}{t\_0} - -1\right)\\ t_2 := {\left(0.5 \cdot t\_0\right)}^{-1.5}\\ \mathbf{if}\;x \cdot -2 \leq -0.4:\\ \;\;\;\;\frac{2}{e^{x \cdot -2} + 1} - 1\\ \mathbf{elif}\;x \cdot -2 \leq 5 \cdot 10^{-6}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(x \cdot x, 0.13333333333333333, -0.3333333333333333\right) \cdot \left(x \cdot x\right), x, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(t\_2, \frac{t\_2}{t\_1}, -{t\_1}^{-1}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (+ 1.0 (pow (exp x) -2.0)))
        (t_1 (fma (pow t_0 -2.0) 4.0 (- (/ 2.0 t_0) -1.0)))
        (t_2 (pow (* 0.5 t_0) -1.5)))
   (if (<= (* x -2.0) -0.4)
     (- (/ 2.0 (+ (exp (* x -2.0)) 1.0)) 1.0)
     (if (<= (* x -2.0) 5e-6)
       (fma
        (* (fma (* x x) 0.13333333333333333 -0.3333333333333333) (* x x))
        x
        x)
       (fma t_2 (/ t_2 t_1) (- (pow t_1 -1.0)))))))

C

double code(double x, double y) {
	double t_0 = 1.0 + pow(exp(x), -2.0);
	double t_1 = fma(pow(t_0, -2.0), 4.0, ((2.0 / t_0) - -1.0));
	double t_2 = pow((0.5 * t_0), -1.5);
	double tmp;
	if ((x * -2.0) <= -0.4) {
		tmp = (2.0 / (exp((x * -2.0)) + 1.0)) - 1.0;
	} else if ((x * -2.0) <= 5e-6) {
		tmp = fma((fma((x * x), 0.13333333333333333, -0.3333333333333333) * (x * x)), x, x);
	} else {
		tmp = fma(t_2, (t_2 / t_1), -pow(t_1, -1.0));
	}
	return tmp;
}

Julia

function code(x, y)
	t_0 = Float64(1.0 + (exp(x) ^ -2.0))
	t_1 = fma((t_0 ^ -2.0), 4.0, Float64(Float64(2.0 / t_0) - -1.0))
	t_2 = Float64(0.5 * t_0) ^ -1.5
	tmp = 0.0
	if (Float64(x * -2.0) <= -0.4)
		tmp = Float64(Float64(2.0 / Float64(exp(Float64(x * -2.0)) + 1.0)) - 1.0);
	elseif (Float64(x * -2.0) <= 5e-6)
		tmp = fma(Float64(fma(Float64(x * x), 0.13333333333333333, -0.3333333333333333) * Float64(x * x)), x, x);
	else
		tmp = fma(t_2, Float64(t_2 / t_1), Float64(-(t_1 ^ -1.0)));
	end
	return tmp
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(1.0 + N[Power[N[Exp[x], $MachinePrecision], -2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Power[t$95$0, -2.0], $MachinePrecision] * 4.0 + N[(N[(2.0 / t$95$0), $MachinePrecision] - -1.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[Power[N[(0.5 * t$95$0), $MachinePrecision], -1.5], $MachinePrecision]}, If[LessEqual[N[(x * -2.0), $MachinePrecision], -0.4], N[(N[(2.0 / N[(N[Exp[N[(x * -2.0), $MachinePrecision]], $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision], If[LessEqual[N[(x * -2.0), $MachinePrecision], 5e-6], N[(N[(N[(N[(x * x), $MachinePrecision] * 0.13333333333333333 + -0.3333333333333333), $MachinePrecision] * N[(x * x), $MachinePrecision]), $MachinePrecision] * x + x), $MachinePrecision], N[(t$95$2 * N[(t$95$2 / t$95$1), $MachinePrecision] + (-N[Power[t$95$1, -1.0], $MachinePrecision])), $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 #s(literal -2 binary64) x) < -0.40000000000000002

   1. Initial program 100.0%

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

   if -0.40000000000000002 < (*.f64 #s(literal -2 binary64) x) < 5.00000000000000041e-6

   1. Initial program 8.2%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. sub-neg N/A

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

      3. metadata-eval N/A

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

      4. distribute-lft-in N/A

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

      5. *-commutative N/A

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

      6. associate-+l+ N/A

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

      7. +-commutative N/A

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

      8. distribute-lft-in N/A

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

      9. associate-*r* N/A

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

      10. *-commutative N/A

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

      11. associate-*r* N/A

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

      12. lower-fma.f64 N/A

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

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{5}, 0.13333333333333333, \mathsf{fma}\left({x}^{3}, -0.3333333333333333, x\right)\right)} \]

   6. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. associate-*r* N/A

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

      4. unpow2 N/A

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

      5. cube-mult N/A

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

      6. *-rgt-identity N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-pow.f64 N/A

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

      9. sub-neg N/A

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

      10. metadata-eval N/A

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

      11. lower-fma.f64 N/A

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

      12. unpow2 N/A

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

      13. lower-*.f64 100.0

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

   8. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{3}, \mathsf{fma}\left(0.13333333333333333, x \cdot x, -0.3333333333333333\right), x\right)} \]
   9. Step-by-step derivation

   10. Applied rewrites 100.0%

       \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(x \cdot x, 0.13333333333333333, -0.3333333333333333\right) \cdot \left(x \cdot x\right), \color{blue}{x}, x\right) \]

   if 5.00000000000000041e-6 < (*.f64 #s(literal -2 binary64) x)

   1. Initial program 99.9%

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

   4. Applied rewrites 100.0%

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

4. Final simplification 100.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \cdot -2 \leq -0.4:\\ \;\;\;\;\frac{2}{e^{x \cdot -2} + 1} - 1\\ \mathbf{elif}\;x \cdot -2 \leq 5 \cdot 10^{-6}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(x \cdot x, 0.13333333333333333, -0.3333333333333333\right) \cdot \left(x \cdot x\right), x, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left({\left(0.5 \cdot \left(1 + {\left(e^{x}\right)}^{-2}\right)\right)}^{-1.5}, \frac{{\left(0.5 \cdot \left(1 + {\left(e^{x}\right)}^{-2}\right)\right)}^{-1.5}}{\mathsf{fma}\left({\left(1 + {\left(e^{x}\right)}^{-2}\right)}^{-2}, 4, \frac{2}{1 + {\left(e^{x}\right)}^{-2}} - -1\right)}, -{\left(\mathsf{fma}\left({\left(1 + {\left(e^{x}\right)}^{-2}\right)}^{-2}, 4, \frac{2}{1 + {\left(e^{x}\right)}^{-2}} - -1\right)\right)}^{-1}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 99.9% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{2}{e^{x \cdot -2} + 1} - 1\\ \mathbf{if}\;x \cdot -2 \leq -0.4:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \cdot -2 \leq 5 \cdot 10^{-6}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(x \cdot x, 0.13333333333333333, -0.3333333333333333\right) \cdot \left(x \cdot x\right), x, x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (- (/ 2.0 (+ (exp (* x -2.0)) 1.0)) 1.0)))
   (if (<= (* x -2.0) -0.4)
     t_0
     (if (<= (* x -2.0) 5e-6)
       (fma
        (* (fma (* x x) 0.13333333333333333 -0.3333333333333333) (* x x))
        x
        x)
       t_0))))

C

double code(double x, double y) {
	double t_0 = (2.0 / (exp((x * -2.0)) + 1.0)) - 1.0;
	double tmp;
	if ((x * -2.0) <= -0.4) {
		tmp = t_0;
	} else if ((x * -2.0) <= 5e-6) {
		tmp = fma((fma((x * x), 0.13333333333333333, -0.3333333333333333) * (x * x)), x, x);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y)
	t_0 = Float64(Float64(2.0 / Float64(exp(Float64(x * -2.0)) + 1.0)) - 1.0)
	tmp = 0.0
	if (Float64(x * -2.0) <= -0.4)
		tmp = t_0;
	elseif (Float64(x * -2.0) <= 5e-6)
		tmp = fma(Float64(fma(Float64(x * x), 0.13333333333333333, -0.3333333333333333) * Float64(x * x)), x, x);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(2.0 / N[(N[Exp[N[(x * -2.0), $MachinePrecision]], $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]}, If[LessEqual[N[(x * -2.0), $MachinePrecision], -0.4], t$95$0, If[LessEqual[N[(x * -2.0), $MachinePrecision], 5e-6], N[(N[(N[(N[(x * x), $MachinePrecision] * 0.13333333333333333 + -0.3333333333333333), $MachinePrecision] * N[(x * x), $MachinePrecision]), $MachinePrecision] * x + x), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 #s(literal -2 binary64) x) < -0.40000000000000002 or 5.00000000000000041e-6 < (*.f64 #s(literal -2 binary64) x)

   1. Initial program 99.9%

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

   if -0.40000000000000002 < (*.f64 #s(literal -2 binary64) x) < 5.00000000000000041e-6

   1. Initial program 8.2%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. sub-neg N/A

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

      3. metadata-eval N/A

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

      4. distribute-lft-in N/A

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

      5. *-commutative N/A

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

      6. associate-+l+ N/A

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

      7. +-commutative N/A

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

      8. distribute-lft-in N/A

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

      9. associate-*r* N/A

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

      10. *-commutative N/A

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

      11. associate-*r* N/A

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

      12. lower-fma.f64 N/A

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

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{5}, 0.13333333333333333, \mathsf{fma}\left({x}^{3}, -0.3333333333333333, x\right)\right)} \]

   6. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. associate-*r* N/A

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

      4. unpow2 N/A

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

      5. cube-mult N/A

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

      6. *-rgt-identity N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-pow.f64 N/A

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

      9. sub-neg N/A

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

      10. metadata-eval N/A

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

      11. lower-fma.f64 N/A

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

      12. unpow2 N/A

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

      13. lower-*.f64 100.0

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

   8. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{3}, \mathsf{fma}\left(0.13333333333333333, x \cdot x, -0.3333333333333333\right), x\right)} \]
   9. Step-by-step derivation

   10. Applied rewrites 100.0%

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

4. Final simplification 100.0%

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

Alternative 4: 75.8% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (exp (* x -2.0)) 2.0)
   (fma (* (fma (* x x) 0.13333333333333333 -0.3333333333333333) (* x x)) x x)
   (- (/ 2.0 (* (* (fma -1.3333333333333333 x 2.0) x) x)) 1.0)))

C

double code(double x, double y) {
	double tmp;
	if (exp((x * -2.0)) <= 2.0) {
		tmp = fma((fma((x * x), 0.13333333333333333, -0.3333333333333333) * (x * x)), x, x);
	} else {
		tmp = (2.0 / ((fma(-1.3333333333333333, x, 2.0) * x) * x)) - 1.0;
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (exp(Float64(x * -2.0)) <= 2.0)
		tmp = fma(Float64(fma(Float64(x * x), 0.13333333333333333, -0.3333333333333333) * Float64(x * x)), x, x);
	else
		tmp = Float64(Float64(2.0 / Float64(Float64(fma(-1.3333333333333333, x, 2.0) * x) * x)) - 1.0);
	end
	return tmp
end

Wolfram

code[x_, y_] := If[LessEqual[N[Exp[N[(x * -2.0), $MachinePrecision]], $MachinePrecision], 2.0], N[(N[(N[(N[(x * x), $MachinePrecision] * 0.13333333333333333 + -0.3333333333333333), $MachinePrecision] * N[(x * x), $MachinePrecision]), $MachinePrecision] * x + x), $MachinePrecision], N[(N[(2.0 / N[(N[(N[(-1.3333333333333333 * x + 2.0), $MachinePrecision] * x), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (exp.f64 (*.f64 #s(literal -2 binary64) x)) < 2

   1. Initial program 33.3%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. sub-neg N/A

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

      3. metadata-eval N/A

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

      4. distribute-lft-in N/A

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

      5. *-commutative N/A

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

      6. associate-+l+ N/A

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

      7. +-commutative N/A

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

      8. distribute-lft-in N/A

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

      9. associate-*r* N/A

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

      10. *-commutative N/A

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

      11. associate-*r* N/A

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

      12. lower-fma.f64 N/A

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

   5. Applied rewrites 73.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{5}, 0.13333333333333333, \mathsf{fma}\left({x}^{3}, -0.3333333333333333, x\right)\right)} \]

   6. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. associate-*r* N/A

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

      4. unpow2 N/A

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

      5. cube-mult N/A

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

      6. *-rgt-identity N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-pow.f64 N/A

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

      9. sub-neg N/A

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

      10. metadata-eval N/A

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

      11. lower-fma.f64 N/A

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

      12. unpow2 N/A

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

      13. lower-*.f64 74.0

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

   8. Applied rewrites 74.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{3}, \mathsf{fma}\left(0.13333333333333333, x \cdot x, -0.3333333333333333\right), x\right)} \]
   9. Step-by-step derivation

   10. Applied rewrites 74.0%

       \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(x \cdot x, 0.13333333333333333, -0.3333333333333333\right) \cdot \left(x \cdot x\right), \color{blue}{x}, x\right) \]

   if 2 < (exp.f64 (*.f64 #s(literal -2 binary64) x))

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. sub-neg N/A

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

      5. *-commutative N/A

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

      6. metadata-eval N/A

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

      7. lower-fma.f64 N/A

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

      8. +-commutative N/A

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

      9. lower-fma.f64 98.6

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

   5. Applied rewrites 98.6%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 98.6%

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

4. Final simplification 79.6%

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

Alternative 5: 75.8% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (exp (* x -2.0)) 2.0)
   (fma (* (fma (* x x) 0.13333333333333333 -0.3333333333333333) (* x x)) x x)
   (- (/ 2.0 (* (* (* -1.3333333333333333 x) x) x)) 1.0)))

C

double code(double x, double y) {
	double tmp;
	if (exp((x * -2.0)) <= 2.0) {
		tmp = fma((fma((x * x), 0.13333333333333333, -0.3333333333333333) * (x * x)), x, x);
	} else {
		tmp = (2.0 / (((-1.3333333333333333 * x) * x) * x)) - 1.0;
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (exp(Float64(x * -2.0)) <= 2.0)
		tmp = fma(Float64(fma(Float64(x * x), 0.13333333333333333, -0.3333333333333333) * Float64(x * x)), x, x);
	else
		tmp = Float64(Float64(2.0 / Float64(Float64(Float64(-1.3333333333333333 * x) * x) * x)) - 1.0);
	end
	return tmp
end

Wolfram

code[x_, y_] := If[LessEqual[N[Exp[N[(x * -2.0), $MachinePrecision]], $MachinePrecision], 2.0], N[(N[(N[(N[(x * x), $MachinePrecision] * 0.13333333333333333 + -0.3333333333333333), $MachinePrecision] * N[(x * x), $MachinePrecision]), $MachinePrecision] * x + x), $MachinePrecision], N[(N[(2.0 / N[(N[(N[(-1.3333333333333333 * x), $MachinePrecision] * x), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (exp.f64 (*.f64 #s(literal -2 binary64) x)) < 2

   1. Initial program 33.3%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. sub-neg N/A

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

      3. metadata-eval N/A

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

      4. distribute-lft-in N/A

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

      5. *-commutative N/A

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

      6. associate-+l+ N/A

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

      7. +-commutative N/A

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

      8. distribute-lft-in N/A

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

      9. associate-*r* N/A

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

      10. *-commutative N/A

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

      11. associate-*r* N/A

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

      12. lower-fma.f64 N/A

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

   5. Applied rewrites 73.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{5}, 0.13333333333333333, \mathsf{fma}\left({x}^{3}, -0.3333333333333333, x\right)\right)} \]

   6. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. associate-*r* N/A

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

      4. unpow2 N/A

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

      5. cube-mult N/A

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

      6. *-rgt-identity N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-pow.f64 N/A

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

      9. sub-neg N/A

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

      10. metadata-eval N/A

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

      11. lower-fma.f64 N/A

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

      12. unpow2 N/A

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

      13. lower-*.f64 74.0

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

   8. Applied rewrites 74.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{3}, \mathsf{fma}\left(0.13333333333333333, x \cdot x, -0.3333333333333333\right), x\right)} \]
   9. Step-by-step derivation

   10. Applied rewrites 74.0%

       \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(x \cdot x, 0.13333333333333333, -0.3333333333333333\right) \cdot \left(x \cdot x\right), \color{blue}{x}, x\right) \]

   if 2 < (exp.f64 (*.f64 #s(literal -2 binary64) x))

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. sub-neg N/A

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

      5. *-commutative N/A

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

      6. metadata-eval N/A

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

      7. lower-fma.f64 N/A

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

      8. +-commutative N/A

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

      9. lower-fma.f64 98.6

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

   5. Applied rewrites 98.6%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 98.6%

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

   9. Taylor expanded in x around inf

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

   11. Applied rewrites 98.6%

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

4. Final simplification 79.6%

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

Alternative 6: 75.9% accurate, 3.2× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -0.98)
   (- (/ 2.0 (fma (fma (fma -1.3333333333333333 x 2.0) x -2.0) x 2.0)) 1.0)
   (fma
    (* (fma (* x x) 0.13333333333333333 -0.3333333333333333) (* x x))
    x
    x)))

C

double code(double x, double y) {
	double tmp;
	if (x <= -0.98) {
		tmp = (2.0 / fma(fma(fma(-1.3333333333333333, x, 2.0), x, -2.0), x, 2.0)) - 1.0;
	} else {
		tmp = fma((fma((x * x), 0.13333333333333333, -0.3333333333333333) * (x * x)), x, x);
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -0.98)
		tmp = Float64(Float64(2.0 / fma(fma(fma(-1.3333333333333333, x, 2.0), x, -2.0), x, 2.0)) - 1.0);
	else
		tmp = fma(Float64(fma(Float64(x * x), 0.13333333333333333, -0.3333333333333333) * Float64(x * x)), x, x);
	end
	return tmp
end

Wolfram

code[x_, y_] := If[LessEqual[x, -0.98], N[(N[(2.0 / N[(N[(N[(-1.3333333333333333 * x + 2.0), $MachinePrecision] * x + -2.0), $MachinePrecision] * x + 2.0), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision], N[(N[(N[(N[(x * x), $MachinePrecision] * 0.13333333333333333 + -0.3333333333333333), $MachinePrecision] * N[(x * x), $MachinePrecision]), $MachinePrecision] * x + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -0.97999999999999998

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. sub-neg N/A

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

      5. *-commutative N/A

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

      6. metadata-eval N/A

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

      7. lower-fma.f64 N/A

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

      8. +-commutative N/A

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

      9. lower-fma.f64 98.6

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

   5. Applied rewrites 98.6%

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

   if -0.97999999999999998 < x

   1. Initial program 33.3%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. sub-neg N/A

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

      3. metadata-eval N/A

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

      4. distribute-lft-in N/A

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

      5. *-commutative N/A

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

      6. associate-+l+ N/A

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

      7. +-commutative N/A

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

      8. distribute-lft-in N/A

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

      9. associate-*r* N/A

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

      10. *-commutative N/A

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

      11. associate-*r* N/A

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

      12. lower-fma.f64 N/A

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

   5. Applied rewrites 73.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{5}, 0.13333333333333333, \mathsf{fma}\left({x}^{3}, -0.3333333333333333, x\right)\right)} \]

   6. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. associate-*r* N/A

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

      4. unpow2 N/A

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

      5. cube-mult N/A

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

      6. *-rgt-identity N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-pow.f64 N/A

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

      9. sub-neg N/A

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

      10. metadata-eval N/A

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

      11. lower-fma.f64 N/A

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

      12. unpow2 N/A

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

      13. lower-*.f64 74.0

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

   8. Applied rewrites 74.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{3}, \mathsf{fma}\left(0.13333333333333333, x \cdot x, -0.3333333333333333\right), x\right)} \]
   9. Step-by-step derivation

   10. Applied rewrites 74.0%

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

Alternative 7: 75.9% accurate, 3.2× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -1.2)
   (- (/ 2.0 (* (fma (fma -1.3333333333333333 x 2.0) x -2.0) x)) 1.0)
   (fma
    (* (fma (* x x) 0.13333333333333333 -0.3333333333333333) (* x x))
    x
    x)))

C

double code(double x, double y) {
	double tmp;
	if (x <= -1.2) {
		tmp = (2.0 / (fma(fma(-1.3333333333333333, x, 2.0), x, -2.0) * x)) - 1.0;
	} else {
		tmp = fma((fma((x * x), 0.13333333333333333, -0.3333333333333333) * (x * x)), x, x);
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -1.2)
		tmp = Float64(Float64(2.0 / Float64(fma(fma(-1.3333333333333333, x, 2.0), x, -2.0) * x)) - 1.0);
	else
		tmp = fma(Float64(fma(Float64(x * x), 0.13333333333333333, -0.3333333333333333) * Float64(x * x)), x, x);
	end
	return tmp
end

Wolfram

code[x_, y_] := If[LessEqual[x, -1.2], N[(N[(2.0 / N[(N[(N[(-1.3333333333333333 * x + 2.0), $MachinePrecision] * x + -2.0), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision], N[(N[(N[(N[(x * x), $MachinePrecision] * 0.13333333333333333 + -0.3333333333333333), $MachinePrecision] * N[(x * x), $MachinePrecision]), $MachinePrecision] * x + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.19999999999999996

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. sub-neg N/A

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

      5. *-commutative N/A

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

      6. metadata-eval N/A

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

      7. lower-fma.f64 N/A

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

      8. +-commutative N/A

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

      9. lower-fma.f64 98.6

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

   5. Applied rewrites 98.6%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 98.6%

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

   if -1.19999999999999996 < x

   1. Initial program 33.3%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. sub-neg N/A

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

      3. metadata-eval N/A

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

      4. distribute-lft-in N/A

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

      5. *-commutative N/A

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

      6. associate-+l+ N/A

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

      7. +-commutative N/A

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

      8. distribute-lft-in N/A

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

      9. associate-*r* N/A

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

      10. *-commutative N/A

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

      11. associate-*r* N/A

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

      12. lower-fma.f64 N/A

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

   5. Applied rewrites 73.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{5}, 0.13333333333333333, \mathsf{fma}\left({x}^{3}, -0.3333333333333333, x\right)\right)} \]

   6. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. associate-*r* N/A

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

      4. unpow2 N/A

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

      5. cube-mult N/A

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

      6. *-rgt-identity N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-pow.f64 N/A

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

      9. sub-neg N/A

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

      10. metadata-eval N/A

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

      11. lower-fma.f64 N/A

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

      12. unpow2 N/A

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

      13. lower-*.f64 74.0

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

   8. Applied rewrites 74.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{3}, \mathsf{fma}\left(0.13333333333333333, x \cdot x, -0.3333333333333333\right), x\right)} \]
   9. Step-by-step derivation

   10. Applied rewrites 74.0%

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

Alternative 8: 75.8% accurate, 3.6× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -1.2)
   (- (/ 2.0 (fma (fma 2.0 x -2.0) x 2.0)) 1.0)
   (fma
    (* (fma (* x x) 0.13333333333333333 -0.3333333333333333) (* x x))
    x
    x)))

C

double code(double x, double y) {
	double tmp;
	if (x <= -1.2) {
		tmp = (2.0 / fma(fma(2.0, x, -2.0), x, 2.0)) - 1.0;
	} else {
		tmp = fma((fma((x * x), 0.13333333333333333, -0.3333333333333333) * (x * x)), x, x);
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -1.2)
		tmp = Float64(Float64(2.0 / fma(fma(2.0, x, -2.0), x, 2.0)) - 1.0);
	else
		tmp = fma(Float64(fma(Float64(x * x), 0.13333333333333333, -0.3333333333333333) * Float64(x * x)), x, x);
	end
	return tmp
end

Wolfram

code[x_, y_] := If[LessEqual[x, -1.2], N[(N[(2.0 / N[(N[(2.0 * x + -2.0), $MachinePrecision] * x + 2.0), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision], N[(N[(N[(N[(x * x), $MachinePrecision] * 0.13333333333333333 + -0.3333333333333333), $MachinePrecision] * N[(x * x), $MachinePrecision]), $MachinePrecision] * x + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.19999999999999996

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. sub-neg N/A

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

      5. metadata-eval N/A

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

      6. lower-fma.f64 98.2

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

   5. Applied rewrites 98.2%

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

   if -1.19999999999999996 < x

   1. Initial program 33.3%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. sub-neg N/A

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

      3. metadata-eval N/A

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

      4. distribute-lft-in N/A

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

      5. *-commutative N/A

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

      6. associate-+l+ N/A

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

      7. +-commutative N/A

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

      8. distribute-lft-in N/A

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

      9. associate-*r* N/A

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

      10. *-commutative N/A

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

      11. associate-*r* N/A

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

      12. lower-fma.f64 N/A

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

   5. Applied rewrites 73.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{5}, 0.13333333333333333, \mathsf{fma}\left({x}^{3}, -0.3333333333333333, x\right)\right)} \]

   6. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. associate-*r* N/A

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

      4. unpow2 N/A

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

      5. cube-mult N/A

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

      6. *-rgt-identity N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-pow.f64 N/A

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

      9. sub-neg N/A

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

      10. metadata-eval N/A

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

      11. lower-fma.f64 N/A

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

      12. unpow2 N/A

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

      13. lower-*.f64 74.0

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

   8. Applied rewrites 74.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{3}, \mathsf{fma}\left(0.13333333333333333, x \cdot x, -0.3333333333333333\right), x\right)} \]
   9. Step-by-step derivation

   10. Applied rewrites 74.0%

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

Alternative 9: 75.8% accurate, 3.6× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -1.2)
   (- (/ 2.0 (fma (fma 2.0 x -2.0) x 2.0)) 1.0)
   (*
    (fma (fma 0.13333333333333333 (* x x) -0.3333333333333333) (* x x) 1.0)
    x)))

C

double code(double x, double y) {
	double tmp;
	if (x <= -1.2) {
		tmp = (2.0 / fma(fma(2.0, x, -2.0), x, 2.0)) - 1.0;
	} else {
		tmp = fma(fma(0.13333333333333333, (x * x), -0.3333333333333333), (x * x), 1.0) * x;
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -1.2)
		tmp = Float64(Float64(2.0 / fma(fma(2.0, x, -2.0), x, 2.0)) - 1.0);
	else
		tmp = Float64(fma(fma(0.13333333333333333, Float64(x * x), -0.3333333333333333), Float64(x * x), 1.0) * x);
	end
	return tmp
end

Wolfram

code[x_, y_] := If[LessEqual[x, -1.2], N[(N[(2.0 / N[(N[(2.0 * x + -2.0), $MachinePrecision] * x + 2.0), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision], N[(N[(N[(0.13333333333333333 * N[(x * x), $MachinePrecision] + -0.3333333333333333), $MachinePrecision] * N[(x * x), $MachinePrecision] + 1.0), $MachinePrecision] * x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.19999999999999996

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. sub-neg N/A

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

      5. metadata-eval N/A

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

      6. lower-fma.f64 98.2

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

   5. Applied rewrites 98.2%

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

   if -1.19999999999999996 < x

   1. Initial program 33.3%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. sub-neg N/A

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

      3. metadata-eval N/A

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

      4. distribute-lft-in N/A

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

      5. *-commutative N/A

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

      6. associate-+l+ N/A

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

      7. +-commutative N/A

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

      8. distribute-lft-in N/A

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

      9. associate-*r* N/A

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

      10. *-commutative N/A

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

      11. associate-*r* N/A

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

      12. lower-fma.f64 N/A

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

   5. Applied rewrites 73.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{5}, 0.13333333333333333, \mathsf{fma}\left({x}^{3}, -0.3333333333333333, x\right)\right)} \]

   6. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. associate-*r* N/A

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

      4. unpow2 N/A

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

      5. cube-mult N/A

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

      6. *-rgt-identity N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-pow.f64 N/A

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

      9. sub-neg N/A

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

      10. metadata-eval N/A

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

      11. lower-fma.f64 N/A

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

      12. unpow2 N/A

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

      13. lower-*.f64 74.0

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

   8. Applied rewrites 74.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{3}, \mathsf{fma}\left(0.13333333333333333, x \cdot x, -0.3333333333333333\right), x\right)} \]
   9. Step-by-step derivation

   10. Applied rewrites 74.0%

       \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(x \cdot x, 0.13333333333333333, -0.3333333333333333\right) \cdot \left(x \cdot x\right), \color{blue}{x}, x\right) \]
   11. Step-by-step derivation

   12. Applied rewrites 74.0%

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

Alternative 10: 75.0% accurate, 3.7× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -1.0)
   (- (/ 2.0 (fma (fma 2.0 x -2.0) x 2.0)) 1.0)
   (fma (* (* x x) x) -0.3333333333333333 x)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. sub-neg N/A

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

      5. metadata-eval N/A

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

      6. lower-fma.f64 98.2

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

   5. Applied rewrites 98.2%

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

   if -1 < x

   1. Initial program 33.3%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. *-rgt-identity N/A

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

      6. lower-fma.f64 N/A

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

      7. *-commutative N/A

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

      8. pow-plus N/A

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

      9. lower-pow.f64 N/A

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

      10. metadata-eval 73.1

          \[\leadsto \mathsf{fma}\left({x}^{\color{blue}{3}}, -0.3333333333333333, x\right) \]

   5. Applied rewrites 73.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{3}, -0.3333333333333333, x\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 73.1%

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

Alternative 11: 75.0% accurate, 3.8× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -1.2)
   (- (/ 2.0 (* (fma 2.0 x -2.0) x)) 1.0)
   (fma (* (* x x) x) -0.3333333333333333 x)))

C

double code(double x, double y) {
	double tmp;
	if (x <= -1.2) {
		tmp = (2.0 / (fma(2.0, x, -2.0) * x)) - 1.0;
	} else {
		tmp = fma(((x * x) * x), -0.3333333333333333, x);
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -1.2)
		tmp = Float64(Float64(2.0 / Float64(fma(2.0, x, -2.0) * x)) - 1.0);
	else
		tmp = fma(Float64(Float64(x * x) * x), -0.3333333333333333, x);
	end
	return tmp
end

Wolfram

code[x_, y_] := If[LessEqual[x, -1.2], N[(N[(2.0 / N[(N[(2.0 * x + -2.0), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision], N[(N[(N[(x * x), $MachinePrecision] * x), $MachinePrecision] * -0.3333333333333333 + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.19999999999999996

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. sub-neg N/A

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

      5. *-commutative N/A

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

      6. metadata-eval N/A

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

      7. lower-fma.f64 N/A

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

      8. +-commutative N/A

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

      9. lower-fma.f64 98.6

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

   5. Applied rewrites 98.6%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 98.6%

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

   9. Taylor expanded in x around 0

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

   11. Applied rewrites 98.2%

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

   if -1.19999999999999996 < x

   1. Initial program 33.3%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. *-rgt-identity N/A

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

      6. lower-fma.f64 N/A

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

      7. *-commutative N/A

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

      8. pow-plus N/A

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

      9. lower-pow.f64 N/A

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

      10. metadata-eval 73.1

          \[\leadsto \mathsf{fma}\left({x}^{\color{blue}{3}}, -0.3333333333333333, x\right) \]

   5. Applied rewrites 73.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{3}, -0.3333333333333333, x\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 73.1%

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

Alternative 12: 75.0% accurate, 4.0× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -1.4)
   (- (/ 2.0 (* (* 2.0 x) x)) 1.0)
   (fma (* (* x x) x) -0.3333333333333333 x)))

C

double code(double x, double y) {
	double tmp;
	if (x <= -1.4) {
		tmp = (2.0 / ((2.0 * x) * x)) - 1.0;
	} else {
		tmp = fma(((x * x) * x), -0.3333333333333333, x);
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -1.4)
		tmp = Float64(Float64(2.0 / Float64(Float64(2.0 * x) * x)) - 1.0);
	else
		tmp = fma(Float64(Float64(x * x) * x), -0.3333333333333333, x);
	end
	return tmp
end

Wolfram

code[x_, y_] := If[LessEqual[x, -1.4], N[(N[(2.0 / N[(N[(2.0 * x), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision], N[(N[(N[(x * x), $MachinePrecision] * x), $MachinePrecision] * -0.3333333333333333 + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.3999999999999999

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. sub-neg N/A

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

      5. *-commutative N/A

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

      6. metadata-eval N/A

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

      7. lower-fma.f64 N/A

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

      8. +-commutative N/A

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

      9. lower-fma.f64 98.6

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

   5. Applied rewrites 98.6%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 98.6%

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

   9. Taylor expanded in x around 0

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

   11. Applied rewrites 98.2%

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

   if -1.3999999999999999 < x

   1. Initial program 33.3%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. *-rgt-identity N/A

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

      6. lower-fma.f64 N/A

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

      7. *-commutative N/A

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

      8. pow-plus N/A

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

      9. lower-pow.f64 N/A

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

      10. metadata-eval 73.1

          \[\leadsto \mathsf{fma}\left({x}^{\color{blue}{3}}, -0.3333333333333333, x\right) \]

   5. Applied rewrites 73.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{3}, -0.3333333333333333, x\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 73.1%

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

Alternative 13: 74.7% accurate, 5.1× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -1.3)
   (- (/ -1.0 (- x 1.0)) 1.0)
   (fma (* (* x x) x) -0.3333333333333333 x)))

C

double code(double x, double y) {
	double tmp;
	if (x <= -1.3) {
		tmp = (-1.0 / (x - 1.0)) - 1.0;
	} else {
		tmp = fma(((x * x) * x), -0.3333333333333333, x);
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -1.3)
		tmp = Float64(Float64(-1.0 / Float64(x - 1.0)) - 1.0);
	else
		tmp = fma(Float64(Float64(x * x) * x), -0.3333333333333333, x);
	end
	return tmp
end

Wolfram

code[x_, y_] := If[LessEqual[x, -1.3], N[(N[(-1.0 / N[(x - 1.0), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision], N[(N[(N[(x * x), $MachinePrecision] * x), $MachinePrecision] * -0.3333333333333333 + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.30000000000000004

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 3.1%

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

   6. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 5.4

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

   8. Applied rewrites 5.4%

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

   10. Applied rewrites 5.1%

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

   11. Taylor expanded in x around 0

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

   13. Applied rewrites 96.7%

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

   if -1.30000000000000004 < x

   1. Initial program 33.3%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. *-rgt-identity N/A

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

      6. lower-fma.f64 N/A

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

      7. *-commutative N/A

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

      8. pow-plus N/A

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

      9. lower-pow.f64 N/A

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

      10. metadata-eval 73.1

          \[\leadsto \mathsf{fma}\left({x}^{\color{blue}{3}}, -0.3333333333333333, x\right) \]

   5. Applied rewrites 73.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{3}, -0.3333333333333333, x\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 73.1%

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

Alternative 14: 50.1% accurate, 7.2× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (fma (* (* x x) x) -0.3333333333333333 x))

C

double code(double x, double y) {
	return fma(((x * x) * x), -0.3333333333333333, x);
}

Julia

function code(x, y)
	return fma(Float64(Float64(x * x) * x), -0.3333333333333333, x)
end

Wolfram

code[x_, y_] := N[(N[(N[(x * x), $MachinePrecision] * x), $MachinePrecision] * -0.3333333333333333 + x), $MachinePrecision]

Derivation

1. Initial program 48.7%

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

3. Taylor expanded in x around 0

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

   1. +-commutative N/A

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

   2. distribute-lft-in N/A

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

   3. *-commutative N/A

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

   4. associate-*r* N/A

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

   5. *-rgt-identity N/A

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

   6. lower-fma.f64 N/A

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

   7. *-commutative N/A

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

   8. pow-plus N/A

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

   9. lower-pow.f64 N/A

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

   10. metadata-eval 56.5

       \[\leadsto \mathsf{fma}\left({x}^{\color{blue}{3}}, -0.3333333333333333, x\right) \]

5. Applied rewrites 56.5%

   \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{3}, -0.3333333333333333, x\right)} \]
6. Step-by-step derivation

7. Applied rewrites 56.5%

   \[\leadsto \mathsf{fma}\left(\left(x \cdot x\right) \cdot x, -0.3333333333333333, x\right) \]
8. Add Preprocessing

Alternative 15: 6.6% accurate, 17.6× speedup

Math

\[\begin{array}{l} \\ \left(1 + x\right) - 1 \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (- (+ 1.0 x) 1.0))

C

double code(double x, double y) {
	return (1.0 + x) - 1.0;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (1.0d0 + x) - 1.0d0
end function

Java

public static double code(double x, double y) {
	return (1.0 + x) - 1.0;
}

Python

def code(x, y):
	return (1.0 + x) - 1.0

Julia

function code(x, y)
	return Float64(Float64(1.0 + x) - 1.0)
end

MATLAB

function tmp = code(x, y)
	tmp = (1.0 + x) - 1.0;
end

Wolfram

code[x_, y_] := N[(N[(1.0 + x), $MachinePrecision] - 1.0), $MachinePrecision]

Derivation

1. Initial program 48.7%

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

3. Taylor expanded in x around 0

   \[\leadsto \color{blue}{\left(1 + x\right)} - 1 \]
4. Step-by-step derivation

   1. lower-+.f64 6.8

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

5. Applied rewrites 6.8%

   \[\leadsto \color{blue}{\left(1 + x\right)} - 1 \]
6. Add Preprocessing

Alternative 16: 4.3% accurate, 30.8× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (- 1.0 1.0))

C

double code(double x, double y) {
	return 1.0 - 1.0;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = 1.0d0 - 1.0d0
end function

Java

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

Python

def code(x, y):
	return 1.0 - 1.0

Julia

function code(x, y)
	return Float64(1.0 - 1.0)
end

MATLAB

function tmp = code(x, y)
	tmp = 1.0 - 1.0;
end

Wolfram

code[x_, y_] := N[(1.0 - 1.0), $MachinePrecision]

Derivation

1. Initial program 48.7%

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

3. Taylor expanded in x around 0

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

5. Applied rewrites 4.2%

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

Reproduce

herbie shell --seed 2024283 
(FPCore (x y)
  :name "Logistic function from Lakshay Garg"
  :precision binary64
  (- (/ 2.0 (+ 1.0 (exp (* -2.0 x)))) 1.0))