Logistic function

Percentage Accurate: 99.8% → 99.8%

Time: 9.5s

Alternatives: 11

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, 0.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Julia

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

MATLAB

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

Derivation

1. Initial program 99.9%

   \[\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 85.3%

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

   3. neg-mul-1 85.3%

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

   4. exp-prod 85.3%

      \[\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-sqr-sqrt 99.8%

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

   2. sqrt-unprod 99.6%

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

   3. pow-prod-down 99.5%

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

   4. prod-exp 99.6%

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

   5. metadata-eval 99.6%

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

6. Applied egg-rr 99.6%

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

   1. pow1/2 99.6%

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

   2. pow-pow 99.9%

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

8. Applied egg-rr 99.9%

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

Alternative 2: 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.9%

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

3. Final simplification 99.9%

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

Alternative 3: 60.9% accurate, 3.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{x}{-s}\\ \mathbf{if}\;t\_0 \leq -1:\\ \;\;\;\;0.5\\ \mathbf{elif}\;t\_0 \leq 9.999999933815813 \cdot 10^{+36}:\\ \;\;\;\;\frac{1}{\frac{4 - \frac{x}{s \cdot \frac{s}{x}}}{\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 -1.0)
     0.5
     (if (<= t_0 9.999999933815813e+36)
       (/ 1.0 (/ (- 4.0 (/ x (* s (/ s x)))) (+ (/ 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 <= -1.0f) {
		tmp = 0.5f;
	} else if (t_0 <= 9.999999933815813e+36f) {
		tmp = 1.0f / ((4.0f - (x / (s * (s / x)))) / ((x / s) + 2.0f));
	} 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) :: t_0
    real(4) :: tmp
    t_0 = x / -s
    if (t_0 <= (-1.0e0)) then
        tmp = 0.5e0
    else if (t_0 <= 9.999999933815813e+36) then
        tmp = 1.0e0 / ((4.0e0 - (x / (s * (s / x)))) / ((x / s) + 2.0e0))
    else
        tmp = 1.0e0 / (x / s)
    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(-1.0))
		tmp = Float32(0.5);
	elseif (t_0 <= Float32(9.999999933815813e+36))
		tmp = Float32(Float32(1.0) / Float32(Float32(Float32(4.0) - Float32(x / Float32(s * Float32(s / x)))) / 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(-1.0))
		tmp = single(0.5);
	elseif (t_0 <= single(9.999999933815813e+36))
		tmp = single(1.0) / ((single(4.0) - (x / (s * (s / x)))) / ((x / s) + single(2.0)));
	else
		tmp = single(1.0) / (x / s);
	end
	tmp_2 = tmp;
end

Derivation

1. Split input into 3 regimes

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

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 28.2%

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

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

   1. Initial program 99.7%

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

   3. Taylor expanded in x around 0 55.1%

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

      1. neg-mul-1 55.1%

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

      2. unsub-neg 55.1%

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

   5. Simplified 55.1%

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

      1. sub-neg 55.1%

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

      2. neg-mul-1 55.1%

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

      3. rem-log-exp 93.9%

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

      4. pow-exp 93.9%

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

      5. flip-+ 50.5%

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

      6. metadata-eval 50.5%

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

      7. pow-exp 50.5%

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

      8. rem-log-exp 50.5%

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

      9. neg-mul-1 50.5%

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

      10. pow-exp 50.5%

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

      11. rem-log-exp 51.2%

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

      12. neg-mul-1 51.2%

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

      13. distribute-neg-frac2 51.2%

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

      14. distribute-neg-frac2 51.2%

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

      15. pow-exp 51.2%

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

      16. rem-log-exp 73.3%

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

      17. neg-mul-1 73.3%

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

      18. distribute-neg-frac2 73.3%

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

   7. Applied egg-rr 73.3%

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

      1. frac-times 71.6%

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

      2. sqr-neg 71.6%

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

      3. frac-times 73.3%

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

      4. clear-num 73.3%

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

      5. frac-times 75.4%

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

      6. *-un-lft-identity 75.4%

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

   9. Applied egg-rr 75.4%

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

   if 9.99999993e36 < (/.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 100.0%

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

      1. neg-mul-1 100.0%

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

      2. unsub-neg 100.0%

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

   5. Simplified 100.0%

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

   6. Taylor expanded in x around inf 91.3%

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

      1. associate-*r/ 91.3%

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

      2. neg-mul-1 91.3%

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

   8. Simplified 91.3%

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

      1. clear-num 100.0%

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

      2. inv-pow 100.0%

         \[\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 100.0%

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

      5. sqr-neg 100.0%

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

      6. sqrt-unprod 100.0%

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

      7. add-sqr-sqrt 100.0%

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

   10. Applied egg-rr 100.0%

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

       1. unpow-1 100.0%

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

   12. Simplified 100.0%

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

4. Final simplification 60.1%

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

Alternative 4: 49.5% accurate, 5.7× speedup

Math

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

FPCore

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

C

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 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 63.4%

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

      1. neg-mul-1 63.4%

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

      2. unsub-neg 63.4%

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

   5. Simplified 63.4%

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

   6. Taylor expanded in s around 0 63.4%

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

      1. *-commutative 63.4%

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

   8. Simplified 63.4%

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

      1. clear-num 63.4%

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

      2. inv-pow 63.4%

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

   10. Applied egg-rr 63.4%

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

       1. unpow-1 63.4%

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

   12. Simplified 63.4%

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

4. Final simplification 49.9%

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

Alternative 5: 49.5% accurate, 6.3× speedup

Math

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

FPCore

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

C

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 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 63.4%

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

      1. neg-mul-1 63.4%

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

      2. unsub-neg 63.4%

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

   5. Simplified 63.4%

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

   6. Taylor expanded in s around 0 63.4%

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

      1. *-commutative 63.4%

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

   8. Simplified 63.4%

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

4. Final simplification 49.9%

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

Alternative 6: 49.5% accurate, 6.3× speedup

Math

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

FPCore

(FPCore (x s)
 :precision binary32
 (if (<= (/ x (- s)) -1.0) 0.5 (/ 1.0 (+ 2.0 (* x (/ -1.0 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 * (-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) <= (-1.0e0)) then
        tmp = 0.5e0
    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(-1.0))
		tmp = Float32(0.5);
	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(-1.0))
		tmp = single(0.5);
	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) < -1

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 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 63.4%

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

      1. neg-mul-1 63.4%

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

      2. unsub-neg 63.4%

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

   5. Simplified 63.4%

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

      1. clear-num 63.4%

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

      2. associate-/r/ 63.4%

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

   7. Applied egg-rr 63.4%

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

4. Final simplification 49.9%

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

Alternative 7: 49.5% accurate, 7.2× 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 100.0%

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

   3. Taylor expanded in x around 0 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 63.4%

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

      1. neg-mul-1 63.4%

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

      2. unsub-neg 63.4%

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

   5. Simplified 63.4%

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

4. Final simplification 49.9%

   \[\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 8: 47.9% 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 52.6%

      \[\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 40.0%

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

      1. neg-mul-1 40.0%

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

      2. unsub-neg 40.0%

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

   5. Simplified 40.0%

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

   6. Taylor expanded in x around inf 40.0%

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

      1. associate-*r/ 40.0%

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

      2. neg-mul-1 40.0%

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

   8. Simplified 40.0%

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

4. Final simplification 48.2%

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

Math

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

FPCore

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

C

float code(float x, float s) {
	float tmp;
	if (x <= -0.019999999552965164f) {
		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.019999999552965164e0)) 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.019999999552965164))
		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.019999999552965164))
		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.0199999996

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 50.5%

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

      1. neg-mul-1 50.5%

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

      2. unsub-neg 50.5%

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

   5. Simplified 50.5%

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

   6. Taylor expanded in x around inf 46.7%

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

      1. associate-*r/ 46.7%

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

      2. neg-mul-1 46.7%

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

   8. Simplified 46.7%

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

      1. clear-num 50.5%

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

      2. inv-pow 50.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 58.4%

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

      5. sqr-neg 58.4%

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

      6. sqrt-unprod 50.5%

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

      7. add-sqr-sqrt 50.5%

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

   10. Applied egg-rr 50.5%

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

       1. unpow-1 50.5%

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

   12. Simplified 50.5%

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

   if -0.0199999996 < x

   1. Initial program 99.8%

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

   3. Taylor expanded in x around 0 47.2%

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

Alternative 10: 46.5% accurate, 13.4× speedup

Math

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

FPCore

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

C

float code(float x, float s) {
	float tmp;
	if (x <= -0.019999999552965164f) {
		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.019999999552965164e0)) 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.019999999552965164))
		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.019999999552965164))
		tmp = s / x;
	else
		tmp = single(0.5);
	end
	tmp_2 = tmp;
end

Derivation

1. Split input into 2 regimes

2. if x < -0.0199999996

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 50.5%

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

      1. neg-mul-1 50.5%

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

      2. unsub-neg 50.5%

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

   5. Simplified 50.5%

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

   6. Taylor expanded in x around inf 46.7%

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

      1. associate-*r/ 46.7%

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

      2. neg-mul-1 46.7%

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

   8. Simplified 46.7%

      \[\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 55.7%

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

      3. sqr-neg 55.7%

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

      4. sqrt-unprod 46.7%

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

      5. add-sqr-sqrt 46.7%

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

      6. *-un-lft-identity 46.7%

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

   10. Applied egg-rr 46.7%

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

       1. *-lft-identity 46.7%

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

   12. Simplified 46.7%

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

   if -0.0199999996 < x

   1. Initial program 99.8%

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

   3. Taylor expanded in x around 0 47.2%

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

Alternative 11: 35.6% 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.9%

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

3. Taylor expanded in x around 0 36.6%

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

Reproduce

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