Logistic function

Percentage Accurate: 99.8% → 99.9%

Time: 9.8s

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.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 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-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.9%

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

   4. pow-exp 99.9%

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

   5. add-log-exp 99.9%

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

   6. log-pow 99.9%

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

   7. inv-pow 99.9%

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

   8. neg-log 99.9%

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

   9. add-log-exp 99.9%

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

   10. distribute-neg-frac2 99.9%

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

6. Applied egg-rr 99.9%

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

7. Final simplification 99.9%

   \[\leadsto e^{-\mathsf{log1p}\left(e^{\frac{x}{-s}}\right)} \]
8. 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 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. Final simplification 99.8%

   \[\leadsto \frac{1}{1 + {\left(e^{-1}\right)}^{\left(\frac{x}{s}\right)}} \]
6. 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: 85.3% accurate, 3.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{x}{-s}\\ \mathbf{if}\;t\_0 \leq -0.004999999888241291:\\ \;\;\;\;\frac{1}{1 + \frac{1}{1 + \frac{x}{s}}}\\ \mathbf{elif}\;t\_0 \leq 1.9999999360571385 \cdot 10^{+38}:\\ \;\;\;\;\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.004999999888241291)
     (/ 1.0 (+ 1.0 (/ 1.0 (+ 1.0 (/ x s)))))
     (if (<= t_0 1.9999999360571385e+38)
       (/ 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.004999999888241291f) {
		tmp = 1.0f / (1.0f + (1.0f / (1.0f + (x / s))));
	} else if (t_0 <= 1.9999999360571385e+38f) {
		tmp = 1.0f / ((4.0f - ((x / s) * (x / s))) / ((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 <= (-0.004999999888241291e0)) then
        tmp = 1.0e0 / (1.0e0 + (1.0e0 / (1.0e0 + (x / s))))
    else if (t_0 <= 1.9999999360571385e+38) then
        tmp = 1.0e0 / ((4.0e0 - ((x / s) * (x / s))) / ((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(-0.004999999888241291))
		tmp = Float32(Float32(1.0) / Float32(Float32(1.0) + Float32(Float32(1.0) / Float32(Float32(1.0) + Float32(x / s)))));
	elseif (t_0 <= Float32(1.9999999360571385e+38))
		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.004999999888241291))
		tmp = single(1.0) / (single(1.0) + (single(1.0) / (single(1.0) + (x / s))));
	elseif (t_0 <= single(1.9999999360571385e+38))
		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 3 regimes

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

   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.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.9%

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

   if -0.00499999989 < (/.f32 (neg.f32 x) s) < 1.99999994e38

   1. Initial program 99.6%

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

   3. Taylor expanded in x around 0 50.7%

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

      1. mul-1-neg 50.7%

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

      2. unsub-neg 50.7%

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

   5. Simplified 50.7%

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

      1. *-un-lft-identity 50.7%

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

      2. cancel-sign-sub-inv 50.7%

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

      3. metadata-eval 50.7%

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

      4. add-log-exp 95.1%

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

      5. pow-exp 95.1%

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

      6. flip-+ 44.7%

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

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

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

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

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

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

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

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

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

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

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

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

   if 1.99999994e38 < (/.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. mul-1-neg 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 100.0%

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

      1. associate-*r/ 100.0%

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

      2. mul-1-neg 100.0%

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

   8. Simplified 100.0%

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

4. Final simplification 85.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{x}{-s} \leq -0.004999999888241291:\\ \;\;\;\;\frac{1}{1 + \frac{1}{1 + \frac{x}{s}}}\\ \mathbf{elif}\;\frac{x}{-s} \leq 1.9999999360571385 \cdot 10^{+38}:\\ \;\;\;\;\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: 77.8% accurate, 5.1× speedup

Math

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

FPCore

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

C

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

Julia

function code(x, s)
	tmp = Float32(0.0)
	if (Float32(x / Float32(-s)) <= Float32(20.0))
		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(x / Float32(x * s)) * Float32(x - Float32(s * Float32(2.0)))));
	end
	return tmp
end

MATLAB

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 99.8%

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

      1. distribute-frac-neg 99.8%

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

      2. exp-neg 99.7%

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

   4. Applied egg-rr 99.7%

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

   5. Taylor expanded in x around 0 92.3%

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

   if 20 < (/.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 41.2%

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

      1. mul-1-neg 41.2%

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

      2. unsub-neg 41.2%

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

   5. Simplified 41.2%

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

   6. Taylor expanded in x around inf 41.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/ 41.2%

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

      2. metadata-eval 41.2%

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

   8. Simplified 41.2%

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

      1. frac-sub 51.0%

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

      2. associate-*r/ 52.0%

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

      3. *-rgt-identity 52.0%

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

   10. Applied egg-rr 52.0%

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

       1. *-commutative 52.0%

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

       2. associate-/l* 51.0%

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

   12. Simplified 51.0%

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

4. Final simplification 77.3%

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

Alternative 6: 78.9% accurate, 5.7× speedup

Math

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

FPCore

(FPCore (x s)
 :precision binary32
 (if (<= (- x) 1.0000000195414814e-24)
   (/ 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 <= 1.0000000195414814e-24f) {
		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 <= 1.0000000195414814e-24) 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(1.0000000195414814e-24))
		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(x * 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 <= single(1.0000000195414814e-24))
		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 (neg.f32 x) < 1.00000002e-24

   1. Initial program 99.8%

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

      1. distribute-frac-neg 99.8%

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

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

   if 1.00000002e-24 < (neg.f32 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 \frac{1}{\color{blue}{2 + -1 \cdot \frac{x}{s}}} \]
   4. Step-by-step derivation

      1. mul-1-neg 47.2%

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

      2. unsub-neg 47.2%

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

   5. Simplified 47.2%

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

   6. Taylor expanded in x around inf 47.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/ 47.2%

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

      2. metadata-eval 47.2%

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

   8. Simplified 47.2%

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

      1. *-commutative 47.2%

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

      2. frac-sub 52.6%

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

      3. associate-*l/ 57.6%

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

      4. *-rgt-identity 57.6%

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

   10. Applied egg-rr 57.6%

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

4. Final simplification 77.8%

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

Alternative 7: 74.7% accurate, 6.7× speedup

Math

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

FPCore

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

C

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

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if x < -1.99999998e-37

   1. Initial program 99.6%

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

   3. Taylor expanded in x around 0 53.7%

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

      1. mul-1-neg 53.7%

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

      2. unsub-neg 53.7%

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

   5. Simplified 53.7%

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

   6. Taylor expanded in s around 0 53.7%

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

      1. *-commutative 53.7%

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

   8. Simplified 53.7%

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

   if -1.99999998e-37 < x

   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 94.2%

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

4. Final simplification 73.8%

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

Alternative 8: 48.1% accurate, 7.2× speedup

Math

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

FPCore

(FPCore (x s)
 :precision binary32
 (if (<= (/ x (- s)) 1.0) 0.5 (/ 1.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 / (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 / (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(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) / (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 99.8%

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

   3. Taylor expanded in x around 0 50.9%

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

   if 1 < (/.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.6%

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

      1. mul-1-neg 40.6%

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

      2. unsub-neg 40.6%

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

   5. Simplified 40.6%

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

   6. Taylor expanded in x around inf 40.6%

      \[\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/ 40.6%

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

      2. metadata-eval 40.6%

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

   8. Simplified 40.6%

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

   9. Taylor expanded in x around inf 40.5%

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

4. Final simplification 47.0%

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

Alternative 9: 49.6% accurate, 7.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{x}{-s} \leq -1:\\ \;\;\;\;\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)) -1.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) <= -1.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) <= (-1.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(-1.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(-1.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) < -1

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 5.6%

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

      1. mul-1-neg 5.6%

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

      2. unsub-neg 5.6%

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

   5. Simplified 5.6%

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

   6. Taylor expanded in x around inf 5.6%

      \[\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.6%

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

      2. metadata-eval 5.6%

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

   8. Simplified 5.6%

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

   9. Taylor expanded in x around 0 28.2%

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

   if -1 < (/.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 60.6%

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

      1. mul-1-neg 60.6%

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

      2. unsub-neg 60.6%

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

   5. Simplified 60.6%

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

4. Final simplification 48.4%

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

Alternative 10: 48.0% accurate, 8.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}}\\ \end{array} \end{array} \]

FPCore

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

C

float code(float x, float s) {
	float tmp;
	if ((x / -s) <= 1.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) <= 1.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(1.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(1.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) < 1

   1. Initial program 99.8%

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

   3. Taylor expanded in x around 0 50.9%

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

   if 1 < (/.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.6%

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

      1. mul-1-neg 40.6%

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

      2. unsub-neg 40.6%

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

   5. Simplified 40.6%

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

   6. Taylor expanded in x around inf 40.5%

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

      1. associate-*r/ 40.5%

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

      2. mul-1-neg 40.5%

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

   8. Simplified 40.5%

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

4. Final simplification 47.0%

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

Alternative 11: 46.5% accurate, 12.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -9.999999974752427 \cdot 10^{-7}:\\ \;\;\;\;\frac{s}{-x}\\ \mathbf{else}:\\ \;\;\;\;0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (x s)
 :precision binary32
 (if (<= x -9.999999974752427e-7) (/ s (- x)) 0.5))

C

float code(float x, float s) {
	float tmp;
	if (x <= -9.999999974752427e-7f) {
		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 <= (-9.999999974752427e-7)) 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(-9.999999974752427e-7))
		tmp = Float32(s / Float32(-x));
	else
		tmp = Float32(0.5);
	end
	return tmp
end

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if x < -9.99999997e-7

   1. Initial program 99.8%

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

   3. Taylor expanded in x around 0 49.1%

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

      1. mul-1-neg 49.1%

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

      2. unsub-neg 49.1%

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

   5. Simplified 49.1%

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

   6. Taylor expanded in x around inf 46.5%

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

      1. associate-*r/ 46.5%

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

      2. neg-mul-1 46.5%

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

   8. Simplified 46.5%

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

   if -9.99999997e-7 < x

   1. Initial program 99.8%

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

   3. Taylor expanded in x around 0 45.9%

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

4. Final simplification 46.1%

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

Alternative 12: 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 34.3%

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

4. Final simplification 34.3%

   \[\leadsto 0.5 \]
5. Add Preprocessing

Reproduce

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