Logistic function

Percentage Accurate: 99.8% → 99.8%

Time: 9.6s

Alternatives: 12

Speedup: 1.0×

Specification

\[0 \leq s \land s \leq 1.0651631\]

Math

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

FPCore

(FPCore (x s) :precision binary32 (/ 1.0 (+ 1.0 (exp (/ (- x) s)))))

C

float code(float x, float s) {
	return 1.0f / (1.0f + expf((-x / s)));
}

Fortran

real(4) function code(x, s)
    real(4), intent (in) :: x
    real(4), intent (in) :: s
    code = 1.0e0 / (1.0e0 + exp((-x / s)))
end function

Julia

function code(x, s)
	return Float32(Float32(1.0) / Float32(Float32(1.0) + exp(Float32(Float32(-x) / s))))
end

MATLAB

function tmp = code(x, s)
	tmp = single(1.0) / (single(1.0) + exp((-x / s)));
end

Initial Program: 99.8% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x s) :precision binary32 (/ 1.0 (+ 1.0 (exp (/ (- x) s)))))

C

float code(float x, float s) {
	return 1.0f / (1.0f + expf((-x / s)));
}

Fortran

real(4) function code(x, s)
    real(4), intent (in) :: x
    real(4), intent (in) :: s
    code = 1.0e0 / (1.0e0 + exp((-x / s)))
end function

Julia

function code(x, s)
	return Float32(Float32(1.0) / Float32(Float32(1.0) + exp(Float32(Float32(-x) / s))))
end

MATLAB

function tmp = code(x, s)
	tmp = single(1.0) / (single(1.0) + exp((-x / s)));
end

Alternative 1: 99.8% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x s) :precision binary32 (/ 1.0 (+ 1.0 (exp (/ x (- s))))))

C

float code(float x, float s) {
	return 1.0f / (1.0f + expf((x / -s)));
}

Fortran

real(4) function code(x, s)
    real(4), intent (in) :: x
    real(4), intent (in) :: s
    code = 1.0e0 / (1.0e0 + exp((x / -s)))
end function

Julia

function code(x, s)
	return Float32(Float32(1.0) / Float32(Float32(1.0) + exp(Float32(x / Float32(-s)))))
end

MATLAB

function tmp = code(x, s)
	tmp = single(1.0) / (single(1.0) + exp((x / -s)));
end

Derivation

1. Initial program 99.8%

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

3. Final simplification 99.8%

   \[\leadsto \frac{1}{1 + e^{\frac{x}{-s}}} \]
4. Add Preprocessing

Alternative 2: 67.5% accurate, 1.4× speedup

Math

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

FPCore

(FPCore (x s)
 :precision binary32
 (if (<= (/ x (- s)) -5.0)
   0.5
   (/
    1.0
    (fma
     x
     (fma (/ (/ x s) s) (fma -0.16666666666666666 (/ x s) 0.5) (/ -1.0 s))
     2.0))))

C

float code(float x, float s) {
	float tmp;
	if ((x / -s) <= -5.0f) {
		tmp = 0.5f;
	} else {
		tmp = 1.0f / fmaf(x, fmaf(((x / s) / s), fmaf(-0.16666666666666666f, (x / s), 0.5f), (-1.0f / s)), 2.0f);
	}
	return tmp;
}

Julia

function code(x, s)
	tmp = Float32(0.0)
	if (Float32(x / Float32(-s)) <= Float32(-5.0))
		tmp = Float32(0.5);
	else
		tmp = Float32(Float32(1.0) / fma(x, fma(Float32(Float32(x / s) / s), fma(Float32(-0.16666666666666666), Float32(x / s), Float32(0.5)), Float32(Float32(-1.0) / s)), Float32(2.0)));
	end
	return tmp
end

Derivation

1. Split input into 2 regimes

2. if (/.f32 (neg.f32 x) s) < -5

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 28.1%

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

   if -5 < (/.f32 (neg.f32 x) s)

   1. Initial program 99.7%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. lower-fma.f32 N/A

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

   5. Applied rewrites 87.9%

      \[\leadsto \frac{1}{\color{blue}{\mathsf{fma}\left(x, \mathsf{fma}\left(\frac{x}{s \cdot s}, \mathsf{fma}\left(-0.16666666666666666, \frac{x}{s}, 0.5\right), \frac{-1}{s}\right), 2\right)}} \]
   6. Step-by-step derivation

   7. Applied rewrites 93.8%

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

4. Final simplification 69.5%

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

Alternative 3: 65.8% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{x}{-s} \leq 1.9999999494757503 \cdot 10^{-5}:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\mathsf{fma}\left(x, \mathsf{fma}\left(\frac{x}{s \cdot s}, \mathsf{fma}\left(-0.16666666666666666, \frac{x}{s}, 0.5\right), \frac{-1}{s}\right), 2\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (x s)
 :precision binary32
 (if (<= (/ x (- s)) 1.9999999494757503e-5)
   0.5
   (/
    1.0
    (fma
     x
     (fma (/ x (* s s)) (fma -0.16666666666666666 (/ x s) 0.5) (/ -1.0 s))
     2.0))))

C

float code(float x, float s) {
	float tmp;
	if ((x / -s) <= 1.9999999494757503e-5f) {
		tmp = 0.5f;
	} else {
		tmp = 1.0f / fmaf(x, fmaf((x / (s * s)), fmaf(-0.16666666666666666f, (x / s), 0.5f), (-1.0f / s)), 2.0f);
	}
	return tmp;
}

Julia

function code(x, s)
	tmp = Float32(0.0)
	if (Float32(x / Float32(-s)) <= Float32(1.9999999494757503e-5))
		tmp = Float32(0.5);
	else
		tmp = Float32(Float32(1.0) / fma(x, fma(Float32(x / Float32(s * s)), fma(Float32(-0.16666666666666666), Float32(x / s), Float32(0.5)), Float32(Float32(-1.0) / s)), Float32(2.0)));
	end
	return tmp
end

Derivation

1. Split input into 2 regimes

2. if (/.f32 (neg.f32 x) s) < 1.99999995e-5

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 52.0%

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

   if 1.99999995e-5 < (/.f32 (neg.f32 x) s)

   1. Initial program 99.8%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. lower-fma.f32 N/A

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

   5. Applied rewrites 92.4%

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

4. Final simplification 68.3%

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

Alternative 4: 65.5% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{x}{-s} \leq 1.9999999494757503 \cdot 10^{-5}:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\mathsf{fma}\left(x, \mathsf{fma}\left(\frac{x}{s \cdot s}, x \cdot \frac{-0.16666666666666666}{s}, \frac{-1}{s}\right), 2\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (x s)
 :precision binary32
 (if (<= (/ x (- s)) 1.9999999494757503e-5)
   0.5
   (/
    1.0
    (fma
     x
     (fma (/ x (* s s)) (* x (/ -0.16666666666666666 s)) (/ -1.0 s))
     2.0))))

C

float code(float x, float s) {
	float tmp;
	if ((x / -s) <= 1.9999999494757503e-5f) {
		tmp = 0.5f;
	} else {
		tmp = 1.0f / fmaf(x, fmaf((x / (s * s)), (x * (-0.16666666666666666f / s)), (-1.0f / s)), 2.0f);
	}
	return tmp;
}

Julia

function code(x, s)
	tmp = Float32(0.0)
	if (Float32(x / Float32(-s)) <= Float32(1.9999999494757503e-5))
		tmp = Float32(0.5);
	else
		tmp = Float32(Float32(1.0) / fma(x, fma(Float32(x / Float32(s * s)), Float32(x * Float32(Float32(-0.16666666666666666) / s)), Float32(Float32(-1.0) / s)), Float32(2.0)));
	end
	return tmp
end

Derivation

1. Split input into 2 regimes

2. if (/.f32 (neg.f32 x) s) < 1.99999995e-5

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 52.0%

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

   if 1.99999995e-5 < (/.f32 (neg.f32 x) s)

   1. Initial program 99.8%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. lower-fma.f32 N/A

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

   5. Applied rewrites 92.4%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 91.7%

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

4. Final simplification 68.0%

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

Alternative 5: 64.4% accurate, 1.6× speedup

Math

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

FPCore

(FPCore (x s)
 :precision binary32
 (if (<= (/ x (- s)) 500000.0)
   0.5
   (/
    1.0
    (fma
     x
     (/
      (fma x (fma x -0.16666666666666666 (* s 0.5)) (* s (- s)))
      (* s (* s s)))
     2.0))))

C

float code(float x, float s) {
	float tmp;
	if ((x / -s) <= 500000.0f) {
		tmp = 0.5f;
	} else {
		tmp = 1.0f / fmaf(x, (fmaf(x, fmaf(x, -0.16666666666666666f, (s * 0.5f)), (s * -s)) / (s * (s * s))), 2.0f);
	}
	return tmp;
}

Julia

function code(x, s)
	tmp = Float32(0.0)
	if (Float32(x / Float32(-s)) <= Float32(500000.0))
		tmp = Float32(0.5);
	else
		tmp = Float32(Float32(1.0) / fma(x, Float32(fma(x, fma(x, Float32(-0.16666666666666666), Float32(s * Float32(0.5))), Float32(s * Float32(-s))) / Float32(s * Float32(s * s))), Float32(2.0)));
	end
	return tmp
end

Derivation

1. Split input into 2 regimes

2. if (/.f32 (neg.f32 x) s) < 5e5

   1. Initial program 99.7%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 50.4%

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

   if 5e5 < (/.f32 (neg.f32 x) s)

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. lower-fma.f32 N/A

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

   5. Applied rewrites 97.2%

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

   6. Taylor expanded in s around 0

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

   8. Applied rewrites 93.8%

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

4. Final simplification 65.7%

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

Alternative 6: 64.4% accurate, 1.7× speedup

Math

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

FPCore

(FPCore (x s)
 :precision binary32
 (if (<= (/ x (- s)) 500000.0)
   0.5
   (/
    1.0
    (fma
     x
     (/ (* x (fma x -0.16666666666666666 (* s 0.5))) (* s (* s s)))
     2.0))))

C

float code(float x, float s) {
	float tmp;
	if ((x / -s) <= 500000.0f) {
		tmp = 0.5f;
	} else {
		tmp = 1.0f / fmaf(x, ((x * fmaf(x, -0.16666666666666666f, (s * 0.5f))) / (s * (s * s))), 2.0f);
	}
	return tmp;
}

Julia

function code(x, s)
	tmp = Float32(0.0)
	if (Float32(x / Float32(-s)) <= Float32(500000.0))
		tmp = Float32(0.5);
	else
		tmp = Float32(Float32(1.0) / fma(x, Float32(Float32(x * fma(x, Float32(-0.16666666666666666), Float32(s * Float32(0.5)))) / Float32(s * Float32(s * s))), Float32(2.0)));
	end
	return tmp
end

Derivation

1. Split input into 2 regimes

2. if (/.f32 (neg.f32 x) s) < 5e5

   1. Initial program 99.7%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 50.4%

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

   if 5e5 < (/.f32 (neg.f32 x) s)

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. lower-fma.f32 N/A

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

   5. Applied rewrites 97.2%

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

   6. Taylor expanded in s around 0

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

   8. Applied rewrites 93.8%

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

4. Final simplification 65.7%

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

Alternative 7: 64.4% accurate, 1.9× speedup

Math

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

FPCore

(FPCore (x s)
 :precision binary32
 (if (<= (/ x (- s)) 500000.0)
   0.5
   (/ 1.0 (fma x (/ (* x (* x -0.16666666666666666)) (* s (* s s))) 2.0))))

C

float code(float x, float s) {
	float tmp;
	if ((x / -s) <= 500000.0f) {
		tmp = 0.5f;
	} else {
		tmp = 1.0f / fmaf(x, ((x * (x * -0.16666666666666666f)) / (s * (s * s))), 2.0f);
	}
	return tmp;
}

Julia

function code(x, s)
	tmp = Float32(0.0)
	if (Float32(x / Float32(-s)) <= Float32(500000.0))
		tmp = Float32(0.5);
	else
		tmp = Float32(Float32(1.0) / fma(x, Float32(Float32(x * Float32(x * Float32(-0.16666666666666666))) / Float32(s * Float32(s * s))), Float32(2.0)));
	end
	return tmp
end

Derivation

1. Split input into 2 regimes

2. if (/.f32 (neg.f32 x) s) < 5e5

   1. Initial program 99.7%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 50.4%

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

   if 5e5 < (/.f32 (neg.f32 x) s)

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. lower-fma.f32 N/A

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

   5. Applied rewrites 97.2%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 93.8%

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

4. Final simplification 65.7%

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

Alternative 8: 63.3% accurate, 2.2× speedup

Math

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

FPCore

(FPCore (x s)
 :precision binary32
 (if (<= (/ x (- s)) 2.0) 0.5 (/ 1.0 (* 0.5 (* x (/ x (* s s)))))))

C

float code(float x, float s) {
	float tmp;
	if ((x / -s) <= 2.0f) {
		tmp = 0.5f;
	} else {
		tmp = 1.0f / (0.5f * (x * (x / (s * s))));
	}
	return tmp;
}

Fortran

real(4) function code(x, s)
    real(4), intent (in) :: x
    real(4), intent (in) :: s
    real(4) :: tmp
    if ((x / -s) <= 2.0e0) then
        tmp = 0.5e0
    else
        tmp = 1.0e0 / (0.5e0 * (x * (x / (s * s))))
    end if
    code = tmp
end function

Julia

function code(x, s)
	tmp = Float32(0.0)
	if (Float32(x / Float32(-s)) <= Float32(2.0))
		tmp = Float32(0.5);
	else
		tmp = Float32(Float32(1.0) / Float32(Float32(0.5) * Float32(x * Float32(x / Float32(s * s)))));
	end
	return tmp
end

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if (/.f32 (neg.f32 x) s) < 2

   1. Initial program 99.8%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 51.9%

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

   if 2 < (/.f32 (neg.f32 x) s)

   1. Initial program 99.8%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. sub-neg N/A

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

      3. distribute-lft-in N/A

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

      4. associate-*r* N/A

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

      5. *-commutative N/A

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

      6. associate-/l* N/A

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

      7. unpow2 N/A

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

      8. times-frac N/A

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

      9. distribute-neg-frac N/A

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

      10. metadata-eval N/A

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

      11. associate-/l* N/A

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

      12. *-commutative N/A

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

      13. associate-*r/ N/A

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

      14. distribute-rgt-out N/A

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

      15. lower-fma.f32 N/A

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

   5. Applied rewrites 73.5%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 87.6%

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

4. Final simplification 65.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{x}{-s} \leq 2:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{0.5 \cdot \left(x \cdot \frac{x}{s \cdot s}\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 53.0% accurate, 2.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{x}{-s} \leq 500000:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\frac{-x \cdot s}{s \cdot s}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x s)
 :precision binary32
 (if (<= (/ x (- s)) 500000.0) 0.5 (/ 1.0 (/ (- (* x s)) (* s s)))))

C

float code(float x, float s) {
	float tmp;
	if ((x / -s) <= 500000.0f) {
		tmp = 0.5f;
	} else {
		tmp = 1.0f / (-(x * s) / (s * s));
	}
	return tmp;
}

Fortran

real(4) function code(x, s)
    real(4), intent (in) :: x
    real(4), intent (in) :: s
    real(4) :: tmp
    if ((x / -s) <= 500000.0e0) then
        tmp = 0.5e0
    else
        tmp = 1.0e0 / (-(x * s) / (s * s))
    end if
    code = tmp
end function

Julia

function code(x, s)
	tmp = Float32(0.0)
	if (Float32(x / Float32(-s)) <= Float32(500000.0))
		tmp = Float32(0.5);
	else
		tmp = Float32(Float32(1.0) / Float32(Float32(-Float32(x * s)) / Float32(s * s)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, s)
	tmp = single(0.0);
	if ((x / -s) <= single(500000.0))
		tmp = single(0.5);
	else
		tmp = single(1.0) / (-(x * s) / (s * s));
	end
	tmp_2 = tmp;
end

Derivation

1. Split input into 2 regimes

2. if (/.f32 (neg.f32 x) s) < 5e5

   1. Initial program 99.7%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 50.4%

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

   if 5e5 < (/.f32 (neg.f32 x) s)

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. sub-neg N/A

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

      3. distribute-lft-in N/A

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

      4. associate-*r* N/A

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

      5. *-commutative N/A

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

      6. associate-/l* N/A

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

      7. unpow2 N/A

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

      8. times-frac N/A

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

      9. distribute-neg-frac N/A

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

      10. metadata-eval N/A

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

      11. associate-/l* N/A

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

      12. *-commutative N/A

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

      13. associate-*r/ N/A

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

      14. distribute-rgt-out N/A

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

      15. lower-fma.f32 N/A

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

   5. Applied rewrites 77.6%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 87.2%

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

   9. Taylor expanded in x around 0

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

   11. Applied rewrites 58.6%

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

4. Final simplification 53.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{x}{-s} \leq 500000:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\frac{-x \cdot s}{s \cdot s}}\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 49.6% accurate, 2.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{x}{-s} \leq -1:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{2 - \frac{x}{s}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x s)
 :precision binary32
 (if (<= (/ x (- s)) -1.0) 0.5 (/ 1.0 (- 2.0 (/ x s)))))

C

float code(float x, float s) {
	float tmp;
	if ((x / -s) <= -1.0f) {
		tmp = 0.5f;
	} else {
		tmp = 1.0f / (2.0f - (x / s));
	}
	return tmp;
}

Fortran

real(4) function code(x, s)
    real(4), intent (in) :: x
    real(4), intent (in) :: s
    real(4) :: tmp
    if ((x / -s) <= (-1.0e0)) then
        tmp = 0.5e0
    else
        tmp = 1.0e0 / (2.0e0 - (x / s))
    end if
    code = tmp
end function

Julia

function code(x, s)
	tmp = Float32(0.0)
	if (Float32(x / Float32(-s)) <= Float32(-1.0))
		tmp = Float32(0.5);
	else
		tmp = Float32(Float32(1.0) / Float32(Float32(2.0) - Float32(x / s)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, s)
	tmp = single(0.0);
	if ((x / -s) <= single(-1.0))
		tmp = single(0.5);
	else
		tmp = single(1.0) / (single(2.0) - (x / s));
	end
	tmp_2 = tmp;
end

Derivation

1. Split input into 2 regimes

2. if (/.f32 (neg.f32 x) s) < -1

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 28.2%

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

   if -1 < (/.f32 (neg.f32 x) s)

   1. Initial program 99.8%

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

   3. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

         \[\leadsto \frac{1}{2 + \color{blue}{\left(\mathsf{neg}\left(\frac{x}{s}\right)\right)}} \]

      2. unsub-neg N/A

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

      3. lower--.f32 N/A

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

      4. lower-/.f32 63.5

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

   5. Applied rewrites 63.5%

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

4. Final simplification 50.0%

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

Alternative 11: 47.9% accurate, 2.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{x}{-s}\\ \mathbf{if}\;t\_0 \leq 2:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{t\_0}\\ \end{array} \end{array} \]

FPCore

(FPCore (x s)
 :precision binary32
 (let* ((t_0 (/ x (- s)))) (if (<= t_0 2.0) 0.5 (/ 1.0 t_0))))

C

float code(float x, float s) {
	float t_0 = x / -s;
	float tmp;
	if (t_0 <= 2.0f) {
		tmp = 0.5f;
	} else {
		tmp = 1.0f / t_0;
	}
	return tmp;
}

Fortran

real(4) function code(x, s)
    real(4), intent (in) :: x
    real(4), intent (in) :: s
    real(4) :: t_0
    real(4) :: tmp
    t_0 = x / -s
    if (t_0 <= 2.0e0) then
        tmp = 0.5e0
    else
        tmp = 1.0e0 / t_0
    end if
    code = tmp
end function

Julia

function code(x, s)
	t_0 = Float32(x / Float32(-s))
	tmp = Float32(0.0)
	if (t_0 <= Float32(2.0))
		tmp = Float32(0.5);
	else
		tmp = Float32(Float32(1.0) / t_0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, s)
	t_0 = x / -s;
	tmp = single(0.0);
	if (t_0 <= single(2.0))
		tmp = single(0.5);
	else
		tmp = single(1.0) / t_0;
	end
	tmp_2 = tmp;
end

Derivation

1. Split input into 2 regimes

2. if (/.f32 (neg.f32 x) s) < 2

   1. Initial program 99.8%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 51.9%

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

   if 2 < (/.f32 (neg.f32 x) s)

   1. Initial program 99.8%

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

   3. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

         \[\leadsto \frac{1}{2 + \color{blue}{\left(\mathsf{neg}\left(\frac{x}{s}\right)\right)}} \]

      2. unsub-neg N/A

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

      3. lower--.f32 N/A

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

      4. lower-/.f32 42.9

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

   5. Applied rewrites 42.9%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 42.9%

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

4. Final simplification 48.5%

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

Alternative 12: 34.7% accurate, 128.0× speedup

Math

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

FPCore

(FPCore (x s) :precision binary32 0.5)

C

float code(float x, float s) {
	return 0.5f;
}

Fortran

real(4) function code(x, s)
    real(4), intent (in) :: x
    real(4), intent (in) :: s
    code = 0.5e0
end function

Julia

function code(x, s)
	return Float32(0.5)
end

MATLAB

function tmp = code(x, s)
	tmp = single(0.5);
end

Derivation

1. Initial program 99.8%

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

3. Taylor expanded in x around 0

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

5. Applied rewrites 34.9%

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

Reproduce

herbie shell --seed 2024226 
(FPCore (x s)
  :name "Logistic function"
  :precision binary32
  :pre (and (<= 0.0 s) (<= s 1.0651631))
  (/ 1.0 (+ 1.0 (exp (/ (- x) s)))))