Logistic function

Percentage Accurate: 99.8% → 99.9%

Time: 8.4s

Alternatives: 14

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.9% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ e^{-\mathsf{log1p}\left(e^{\frac{x}{-s}}\right)} \end{array} \]

FPCore

(FPCore (x s) :precision binary32 (exp (- (log1p (exp (/ x (- s)))))))

C

float code(float x, float s) {
	return expf(-log1pf(expf((x / -s))));
}

Julia

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

Derivation

1. Initial program 99.8%

   \[\frac{1}{1 + e^{\frac{-x}{s}}} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. div-inv 99.8%

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

   2. exp-prod 83.8%

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

   3. neg-mul-1 83.8%

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

   4. exp-prod 83.8%

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

   5. pow-pow 99.8%

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

   6. div-inv 99.8%

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

4. Applied egg-rr 99.8%

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

   1. add-exp-log 99.8%

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

   2. log-rec 99.8%

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

   3. log1p-define 99.8%

      \[\leadsto e^{-\color{blue}{\mathsf{log1p}\left({\left(e^{-1}\right)}^{\left(\frac{x}{s}\right)}\right)}} \]

   4. add-exp-log 99.8%

      \[\leadsto e^{-\mathsf{log1p}\left(\color{blue}{e^{\log \left({\left(e^{-1}\right)}^{\left(\frac{x}{s}\right)}\right)}}\right)} \]

   5. add-exp-log 99.8%

      \[\leadsto e^{-\mathsf{log1p}\left(\color{blue}{{\left(e^{-1}\right)}^{\left(\frac{x}{s}\right)}}\right)} \]

   6. pow-exp 99.8%

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

   7. *-commutative 99.8%

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

   8. pow-exp 99.8%

      \[\leadsto e^{-\mathsf{log1p}\left(\color{blue}{{\left(e^{\frac{x}{s}}\right)}^{-1}}\right)} \]

   9. inv-pow 99.8%

      \[\leadsto e^{-\mathsf{log1p}\left(\color{blue}{\frac{1}{e^{\frac{x}{s}}}}\right)} \]

   10. add-exp-log 99.8%

       \[\leadsto e^{-\mathsf{log1p}\left(\color{blue}{e^{\log \left(\frac{1}{e^{\frac{x}{s}}}\right)}}\right)} \]

   11. neg-log 99.8%

       \[\leadsto e^{-\mathsf{log1p}\left(e^{\color{blue}{-\log \left(e^{\frac{x}{s}}\right)}}\right)} \]

   12. add-log-exp 99.8%

       \[\leadsto e^{-\mathsf{log1p}\left(e^{-\color{blue}{\frac{x}{s}}}\right)} \]

   13. distribute-neg-frac2 99.8%

       \[\leadsto e^{-\mathsf{log1p}\left(e^{\color{blue}{\frac{x}{-s}}}\right)} \]

6. Applied egg-rr 99.8%

   \[\leadsto \color{blue}{e^{-\mathsf{log1p}\left(e^{\frac{x}{-s}}\right)}} \]
7. Add Preprocessing

Alternative 2: 99.8% accurate, 0.5× speedup

Math

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

FPCore

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

C

float code(float x, float s) {
	return 1.0f / (1.0f + powf(expf(-1.0f), (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((-1.0e0)) ** (x / s)))
end function

Julia

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

MATLAB

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

Derivation

1. Initial program 99.8%

   \[\frac{1}{1 + e^{\frac{-x}{s}}} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. div-inv 99.8%

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

   2. exp-prod 83.8%

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

   3. neg-mul-1 83.8%

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

   4. exp-prod 83.8%

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

   5. pow-pow 99.8%

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

   6. div-inv 99.8%

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

4. Applied egg-rr 99.8%

   \[\leadsto \frac{1}{1 + \color{blue}{{\left(e^{-1}\right)}^{\left(\frac{x}{s}\right)}}} \]
5. Add Preprocessing

Alternative 3: 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 4: 76.5% accurate, 2.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{x}{-s}\\ \mathbf{if}\;t\_0 \leq 0.5:\\ \;\;\;\;\frac{1}{1 + \frac{1}{1 + \frac{x}{s}}}\\ \mathbf{elif}\;t\_0 \leq 9999999980506448000:\\ \;\;\;\;\frac{1}{x \cdot \left(\left(s \cdot 2 - x\right) \cdot \frac{1}{x \cdot s}\right)}\\ \mathbf{elif}\;t\_0 \leq \infty:\\ \;\;\;\;\frac{1}{\frac{4 - \frac{x}{s} \cdot \frac{x}{s}}{\frac{x}{s} + 2}}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\frac{x}{s}}\\ \end{array} \end{array} \]

FPCore

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

C

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

Julia

function code(x, s)
	t_0 = Float32(x / Float32(-s))
	tmp = Float32(0.0)
	if (t_0 <= Float32(0.5))
		tmp = Float32(Float32(1.0) / Float32(Float32(1.0) + Float32(Float32(1.0) / Float32(Float32(1.0) + Float32(x / s)))));
	elseif (t_0 <= Float32(9999999980506448000.0))
		tmp = Float32(Float32(1.0) / Float32(x * Float32(Float32(Float32(s * Float32(2.0)) - x) * Float32(Float32(1.0) / Float32(x * s)))));
	elseif (t_0 <= Float32(Inf))
		tmp = Float32(Float32(1.0) / Float32(Float32(Float32(4.0) - Float32(Float32(x / s) * Float32(x / s))) / Float32(Float32(x / s) + Float32(2.0))));
	else
		tmp = Float32(Float32(1.0) / Float32(x / s));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, s)
	t_0 = x / -s;
	tmp = single(0.0);
	if (t_0 <= single(0.5))
		tmp = single(1.0) / (single(1.0) + (single(1.0) / (single(1.0) + (x / s))));
	elseif (t_0 <= single(9999999980506448000.0))
		tmp = single(1.0) / (x * (((s * single(2.0)) - x) * (single(1.0) / (x * s))));
	elseif (t_0 <= single(Inf))
		tmp = single(1.0) / ((single(4.0) - ((x / s) * (x / s))) / ((x / s) + single(2.0)));
	else
		tmp = single(1.0) / (x / s);
	end
	tmp_2 = tmp;
end

Derivation

1. Split input into 4 regimes

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

   1. Initial program 99.9%

      \[\frac{1}{1 + e^{\frac{-x}{s}}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. distribute-frac-neg 99.9%

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

      2. exp-neg 99.8%

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

   4. Applied egg-rr 99.8%

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

   5. Taylor expanded in x around 0 93.4%

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

      1. +-commutative 93.4%

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

   7. Simplified 93.4%

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

   if 0.5 < (/.f32 (neg.f32 x) s) < 9.99999998e18

   1. Initial program 99.1%

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

   3. Taylor expanded in x around 0 9.1%

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

      1. neg-mul-1 9.1%

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

      2. unsub-neg 9.1%

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

   5. Simplified 9.1%

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

   6. Taylor expanded in x around inf 9.1%

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

      1. associate-*r/ 9.1%

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

      2. metadata-eval 9.1%

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

   8. Simplified 9.1%

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

      1. frac-sub 38.6%

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

      2. div-inv 44.5%

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

      3. *-rgt-identity 44.5%

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

   10. Applied egg-rr 44.5%

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

   if 9.99999998e18 < (/.f32 (neg.f32 x) s) < +inf.0

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 65.7%

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

      1. neg-mul-1 65.7%

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

      2. unsub-neg 65.7%

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

   5. Simplified 65.7%

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

      1. *-un-lft-identity 65.7%

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

      2. cancel-sign-sub-inv 65.7%

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

      3. metadata-eval 65.7%

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

      4. add-log-exp 100.0%

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

      5. pow-exp 100.0%

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

      6. flip-+ -0.0%

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

      7. metadata-eval -0.0%

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

      8. pow-exp -0.0%

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

      9. add-log-exp -0.0%

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

      10. neg-mul-1 -0.0%

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

      11. pow-exp -0.0%

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

      12. add-log-exp -0.0%

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

      13. neg-mul-1 -0.0%

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

      14. distribute-neg-frac2 -0.0%

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

      15. distribute-neg-frac2 -0.0%

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

      16. pow-exp -0.0%

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

   7. Applied egg-rr 40.0%

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

   if +inf.0 < (/.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 42.3%

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

      1. neg-mul-1 42.3%

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

      2. unsub-neg 42.3%

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

   5. Simplified 42.3%

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

   6. Taylor expanded in x around inf 21.4%

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

      1. associate-*r/ 21.4%

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

      2. neg-mul-1 21.4%

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

   8. Simplified 21.4%

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

      1. clear-num 22.7%

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

      2. inv-pow 22.7%

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

      3. add-sqr-sqrt -0.0%

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

      4. sqrt-unprod 31.4%

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

      5. sqr-neg 31.4%

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

      6. sqrt-unprod 24.3%

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

      7. add-sqr-sqrt 24.3%

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

   10. Applied egg-rr 24.3%

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

       1. unpow-1 24.3%

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

   12. Simplified 24.3%

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

4. Final simplification 72.9%

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

Alternative 5: 80.1% accurate, 4.7× speedup

Math

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

FPCore

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

C

float code(float x, float s) {
	float tmp;
	if ((x / -s) <= 0.5f) {
		tmp = 1.0f / (1.0f + (1.0f / (1.0f + (x / s))));
	} else {
		tmp = 1.0f / (x * (((s * 2.0f) - x) * (1.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) <= 0.5e0) then
        tmp = 1.0e0 / (1.0e0 + (1.0e0 / (1.0e0 + (x / s))))
    else
        tmp = 1.0e0 / (x * (((s * 2.0e0) - x) * (1.0e0 / (x * s))))
    end if
    code = tmp
end function

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 99.9%

      \[\frac{1}{1 + e^{\frac{-x}{s}}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. distribute-frac-neg 99.9%

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

      2. exp-neg 99.8%

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

   4. Applied egg-rr 99.8%

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

   5. Taylor expanded in x around 0 93.4%

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

      1. +-commutative 93.4%

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

   7. Simplified 93.4%

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

   if 0.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 48.3%

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

      1. neg-mul-1 48.3%

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

      2. unsub-neg 48.3%

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

   5. Simplified 48.3%

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

   6. Taylor expanded in x around inf 48.3%

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

      1. associate-*r/ 48.3%

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

      2. metadata-eval 48.3%

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

   8. Simplified 48.3%

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

      1. frac-sub 59.1%

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

      2. div-inv 64.4%

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

      3. *-rgt-identity 64.4%

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

   10. Applied egg-rr 64.4%

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

4. Final simplification 81.9%

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

Alternative 6: 78.4% accurate, 5.1× speedup

Math

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

FPCore

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

C

float code(float x, float s) {
	float tmp;
	if ((x / -s) <= 0.5f) {
		tmp = 1.0f / (1.0f + (1.0f / (1.0f + (x / s))));
	} else {
		tmp = 1.0f / (x * (((s * 2.0f) - x) / (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) <= 0.5e0) then
        tmp = 1.0e0 / (1.0e0 + (1.0e0 / (1.0e0 + (x / s))))
    else
        tmp = 1.0e0 / (x * (((s * 2.0e0) - x) / (x * s)))
    end if
    code = tmp
end function

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 99.9%

      \[\frac{1}{1 + e^{\frac{-x}{s}}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. distribute-frac-neg 99.9%

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

      2. exp-neg 99.8%

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

   4. Applied egg-rr 99.8%

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

   5. Taylor expanded in x around 0 93.4%

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

      1. +-commutative 93.4%

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

   7. Simplified 93.4%

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

   if 0.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 48.3%

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

      1. neg-mul-1 48.3%

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

      2. unsub-neg 48.3%

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

   5. Simplified 48.3%

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

   6. Taylor expanded in x around inf 48.3%

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

      1. associate-*r/ 48.3%

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

      2. metadata-eval 48.3%

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

   8. Simplified 48.3%

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

      1. frac-sub 59.1%

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

      2. div-inv 64.4%

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

      3. *-rgt-identity 64.4%

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

   10. Applied egg-rr 64.4%

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

       1. associate-*r/ 59.1%

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

       2. *-rgt-identity 59.1%

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

   12. Simplified 59.1%

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

4. Final simplification 79.8%

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

Alternative 7: 75.2% accurate, 5.7× speedup

Math

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

FPCore

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

C

float code(float x, float s) {
	float tmp;
	if ((x / -s) <= -0.0005000000237487257f) {
		tmp = 1.0f / (1.0f + (1.0f / (1.0f + (x / s))));
	} else {
		tmp = 1.0f / (2.0f + (x * (-1.0f / 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) <= (-0.0005000000237487257e0)) then
        tmp = 1.0e0 / (1.0e0 + (1.0e0 / (1.0e0 + (x / s))))
    else
        tmp = 1.0e0 / (2.0e0 + (x * ((-1.0e0) / s)))
    end if
    code = tmp
end function

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if (/.f32 (neg.f32 x) s) < -5.00000024e-4

   1. Initial program 100.0%

      \[\frac{1}{1 + e^{\frac{-x}{s}}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. distribute-frac-neg 100.0%

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

      2. exp-neg 99.9%

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

   4. Applied egg-rr 99.9%

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

   5. Taylor expanded in x around 0 92.8%

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

      1. +-commutative 92.8%

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

   7. Simplified 92.8%

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

   if -5.00000024e-4 < (/.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 64.2%

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

      1. neg-mul-1 64.2%

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

      2. unsub-neg 64.2%

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

   5. Simplified 64.2%

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

      1. clear-num 64.2%

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

      2. associate-/r/ 64.2%

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

   7. Applied egg-rr 64.2%

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

4. Final simplification 75.6%

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

Alternative 8: 49.7% accurate, 6.3× speedup

Math

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

FPCore

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

C

float code(float x, float s) {
	float tmp;
	if ((x / -s) <= -2.0f) {
		tmp = 1.0f / (x * (2.0f / x));
	} else {
		tmp = 1.0f / (2.0f + (x * (-1.0f / 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 = 1.0e0 / (x * (2.0e0 / x))
    else
        tmp = 1.0e0 / (2.0e0 + (x * ((-1.0e0) / 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(Float32(1.0) / Float32(x * Float32(Float32(2.0) / x)));
	else
		tmp = Float32(Float32(1.0) / Float32(Float32(2.0) + Float32(x * Float32(Float32(-1.0) / s))));
	end
	return tmp
end

MATLAB

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 5.2%

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

      1. neg-mul-1 5.2%

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

      2. unsub-neg 5.2%

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

   5. Simplified 5.2%

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

   6. Taylor expanded in x around inf 5.2%

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

      1. associate-*r/ 5.2%

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

      2. metadata-eval 5.2%

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

   8. Simplified 5.2%

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

   9. Taylor expanded in x around 0 28.1%

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

   if -2 < (/.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 64.6%

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

      1. neg-mul-1 64.6%

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

      2. unsub-neg 64.6%

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

   5. Simplified 64.6%

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

      1. clear-num 64.6%

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

      2. associate-/r/ 64.6%

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

   7. Applied egg-rr 64.6%

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

4. Final simplification 50.9%

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

Alternative 9: 49.7% accurate, 7.2× speedup

Math

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

FPCore

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

C

float code(float x, float s) {
	float tmp;
	if ((x / -s) <= -2.0f) {
		tmp = 1.0f / (x * (2.0f / x));
	} 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) <= (-2.0e0)) then
        tmp = 1.0e0 / (x * (2.0e0 / x))
    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(-2.0))
		tmp = Float32(Float32(1.0) / Float32(x * Float32(Float32(2.0) / x)));
	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(-2.0))
		tmp = single(1.0) / (x * (single(2.0) / x));
	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) < -2

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 5.2%

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

      1. neg-mul-1 5.2%

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

      2. unsub-neg 5.2%

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

   5. Simplified 5.2%

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

   6. Taylor expanded in x around inf 5.2%

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

      1. associate-*r/ 5.2%

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

      2. metadata-eval 5.2%

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

   8. Simplified 5.2%

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

   9. Taylor expanded in x around 0 28.1%

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

   if -2 < (/.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 64.6%

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

      1. neg-mul-1 64.6%

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

      2. unsub-neg 64.6%

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

   5. Simplified 64.6%

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

4. Final simplification 50.9%

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

Alternative 10: 48.2% accurate, 8.3× speedup

Math

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

FPCore

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

C

float code(float x, float s) {
	float tmp;
	if ((x / -s) <= 2.0f) {
		tmp = 0.5f;
	} else {
		tmp = -1.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) <= 2.0e0) then
        tmp = 0.5e0
    else
        tmp = (-1.0e0) / (x / 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(x / 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) / (x / 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.9%

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

   3. Taylor expanded in x around 0 49.8%

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

   if 2 < (/.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 48.5%

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

      1. neg-mul-1 48.5%

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

      2. unsub-neg 48.5%

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

   5. Simplified 48.5%

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

   6. Taylor expanded in x around inf 48.5%

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

      1. mul-1-neg 48.5%

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

      2. distribute-frac-neg2 48.5%

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

   8. Simplified 48.5%

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

4. Final simplification 49.3%

   \[\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 11: 48.0% accurate, 10.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if x < -0.00115000003

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 64.5%

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

      1. neg-mul-1 64.5%

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

      2. unsub-neg 64.5%

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

   5. Simplified 64.5%

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

   6. Taylor expanded in x around inf 59.8%

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

      1. associate-*r/ 59.8%

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

      2. neg-mul-1 59.8%

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

   8. Simplified 59.8%

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

      1. clear-num 64.5%

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

      2. inv-pow 64.5%

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

      3. add-sqr-sqrt -0.0%

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

      4. sqrt-unprod 68.2%

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

      5. sqr-neg 68.2%

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

      6. sqrt-unprod 64.5%

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

      7. add-sqr-sqrt 64.5%

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

   10. Applied egg-rr 64.5%

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

       1. unpow-1 64.5%

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

   12. Simplified 64.5%

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

   if -0.00115000003 < x

   1. Initial program 99.7%

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

   3. Taylor expanded in x around 0 43.1%

      \[\leadsto \color{blue}{0.5} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 12: 46.7% accurate, 10.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if x < -0.00115000003

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 64.5%

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

      1. neg-mul-1 64.5%

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

      2. unsub-neg 64.5%

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

   5. Simplified 64.5%

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

   6. Taylor expanded in x around inf 59.8%

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

      1. associate-*r/ 59.8%

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

      2. neg-mul-1 59.8%

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

   8. Simplified 59.8%

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

      1. add-sqr-sqrt -0.0%

         \[\leadsto \frac{\color{blue}{\sqrt{-s} \cdot \sqrt{-s}}}{x} \]

      2. sqrt-unprod 64.3%

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

      3. sqr-neg 64.3%

         \[\leadsto \frac{\sqrt{\color{blue}{s \cdot s}}}{x} \]

      4. sqrt-unprod 59.8%

         \[\leadsto \frac{\color{blue}{\sqrt{s} \cdot \sqrt{s}}}{x} \]

      5. add-sqr-sqrt 59.8%

         \[\leadsto \frac{\color{blue}{s}}{x} \]

      6. div-inv 59.8%

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

   10. Applied egg-rr 59.8%

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

   if -0.00115000003 < x

   1. Initial program 99.7%

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

   3. Taylor expanded in x around 0 43.1%

      \[\leadsto \color{blue}{0.5} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 13: 46.7% accurate, 13.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if x < -0.00115000003

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 64.5%

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

      1. neg-mul-1 64.5%

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

      2. unsub-neg 64.5%

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

   5. Simplified 64.5%

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

   6. Taylor expanded in x around inf 59.8%

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

      1. associate-*r/ 59.8%

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

      2. neg-mul-1 59.8%

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

   8. Simplified 59.8%

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

      1. add-sqr-sqrt -0.0%

         \[\leadsto \frac{\color{blue}{\sqrt{-s} \cdot \sqrt{-s}}}{x} \]

      2. sqrt-unprod 64.3%

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

      3. sqr-neg 64.3%

         \[\leadsto \frac{\sqrt{\color{blue}{s \cdot s}}}{x} \]

      4. sqrt-unprod 59.8%

         \[\leadsto \frac{\color{blue}{\sqrt{s} \cdot \sqrt{s}}}{x} \]

      5. add-sqr-sqrt 59.8%

         \[\leadsto \frac{\color{blue}{s}}{x} \]

      6. div-inv 59.8%

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

   10. Applied egg-rr 59.8%

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

       1. associate-*r/ 59.8%

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

       2. *-rgt-identity 59.8%

          \[\leadsto \frac{\color{blue}{s}}{x} \]

   12. Simplified 59.8%

       \[\leadsto \color{blue}{\frac{s}{x}} \]

   if -0.00115000003 < x

   1. Initial program 99.7%

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

   3. Taylor expanded in x around 0 43.1%

      \[\leadsto \color{blue}{0.5} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 14: 35.1% accurate, 108.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 32.9%

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

Reproduce

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