Logistic function

Percentage Accurate: 99.8% → 99.8%

Time: 8.9s

Alternatives: 12

Speedup: 1.0×

Specification

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

Math

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

FPCore

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

C

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

Fortran

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

Julia

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

MATLAB

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

Initial Program: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Julia

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

MATLAB

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

Alternative 1: 99.8% accurate, 0.9× speedup

Math

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

FPCore

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

Derivation

1. Initial program 99.7%

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

   1. lift-exp.f32 N/A

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

   2. lift-/.f32 N/A

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

   3. lift-neg.f32 N/A

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

   4. distribute-frac-neg N/A

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

   5. exp-neg N/A

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

   6. lower-/.f32 N/A

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

   7. lower-exp.f32 N/A

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

   8. lower-/.f32 99.7

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

4. Applied rewrites 99.7%

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

   1. lift-exp.f32 N/A

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

   2. remove-double-neg N/A

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

   3. mul-1-neg N/A

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

   4. distribute-lft-neg-in N/A

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

   5. metadata-eval N/A

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

   6. log-E N/A

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

   7. pow-to-exp N/A

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

   8. lower-pow.f32 N/A

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

   9. lower-E.f32 99.8

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

6. Applied rewrites 99.8%

   \[\leadsto \frac{1}{1 + \frac{1}{\color{blue}{{\mathsf{E}\left(\right)}^{\left(\frac{x}{s}\right)}}}} \]
7. Add Preprocessing

Alternative 2: 91.0% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Fortran

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

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if (/.f32 #s(literal 1 binary32) (+.f32 #s(literal 1 binary32) (exp.f32 (/.f32 (neg.f32 x) s)))) < 0.499599993

   1. Initial program 99.5%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. sub-neg N/A

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

      3. distribute-lft-in N/A

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

      4. *-commutative N/A

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

      5. associate-*r/ N/A

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

      6. unpow2 N/A

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

      7. times-frac N/A

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

      8. associate-*l* N/A

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

      9. *-commutative N/A

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

      10. associate-*r* N/A

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

      11. distribute-neg-frac N/A

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

      12. metadata-eval N/A

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

      13. associate-/l* N/A

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

      14. *-commutative N/A

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

      15. associate-*r/ N/A

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

      16. distribute-rgt-out N/A

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

      17. lower-fma.f32 N/A

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

   5. Applied rewrites 9.1%

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

   6. Taylor expanded in x around -inf

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

   8. Applied rewrites 80.9%

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

   if 0.499599993 < (/.f32 #s(literal 1 binary32) (+.f32 #s(literal 1 binary32) (exp.f32 (/.f32 (neg.f32 x) s))))

   1. Initial program 99.9%

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

      1. lift-exp.f32 N/A

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

      2. lift-/.f32 N/A

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

      3. lift-neg.f32 N/A

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

      4. distribute-frac-neg N/A

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

      5. exp-neg N/A

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

      6. lower-/.f32 N/A

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

      7. lower-exp.f32 N/A

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

      8. lower-/.f32 99.9

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

   4. Applied rewrites 99.9%

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

   5. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. lower-+.f32 N/A

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

      3. lower-/.f32 96.6

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

   7. Applied rewrites 96.6%

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

4. Final simplification 91.2%

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

Alternative 3: 88.8% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Fortran

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

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if (/.f32 #s(literal 1 binary32) (+.f32 #s(literal 1 binary32) (exp.f32 (/.f32 (neg.f32 x) s)))) < 0.00200000009

   1. Initial program 99.6%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. sub-neg N/A

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

      3. distribute-lft-in N/A

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

      4. *-commutative N/A

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

      5. associate-*r/ N/A

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

      6. unpow2 N/A

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

      7. times-frac N/A

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

      8. associate-*l* N/A

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

      9. *-commutative N/A

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

      10. associate-*r* N/A

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

      11. distribute-neg-frac N/A

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

      12. metadata-eval N/A

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

      13. associate-/l* N/A

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

      14. *-commutative N/A

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

      15. associate-*r/ N/A

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

      16. distribute-rgt-out N/A

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

      17. lower-fma.f32 N/A

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

   5. Applied rewrites 6.7%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 75.7%

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

   if 0.00200000009 < (/.f32 #s(literal 1 binary32) (+.f32 #s(literal 1 binary32) (exp.f32 (/.f32 (neg.f32 x) s))))

   1. Initial program 99.8%

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

      1. lift-exp.f32 N/A

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

      2. lift-/.f32 N/A

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

      3. lift-neg.f32 N/A

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

      4. distribute-frac-neg N/A

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

      5. exp-neg N/A

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

      6. lower-/.f32 N/A

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

      7. lower-exp.f32 N/A

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

      8. lower-/.f32 99.8

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

   4. Applied rewrites 99.8%

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

   5. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. lower-+.f32 N/A

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

      3. lower-/.f32 96.0

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

   7. Applied rewrites 96.0%

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

4. Final simplification 89.3%

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

Alternative 4: 75.2% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Fortran

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

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if (/.f32 #s(literal 1 binary32) (+.f32 #s(literal 1 binary32) (exp.f32 (/.f32 (neg.f32 x) s)))) < 0.500002027

   1. Initial program 99.5%

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

      1. lift-exp.f32 N/A

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

      2. *-lft-identity N/A

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

      3. exp-prod N/A

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

      4. lower-pow.f32 N/A

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

      5. exp-1-e N/A

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

      6. lower-E.f32 99.5

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

   4. Applied rewrites 99.5%

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

   5. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

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

      2. unsub-neg N/A

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

      3. log-E N/A

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

      4. *-rgt-identity N/A

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

      5. lower--.f32 N/A

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

      6. lower-/.f32 65.1

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

   7. Applied rewrites 65.1%

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

   9. Applied rewrites 38.8%

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

   10. Taylor expanded in s around 0

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

   12. Applied rewrites 65.1%

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

   if 0.500002027 < (/.f32 #s(literal 1 binary32) (+.f32 #s(literal 1 binary32) (exp.f32 (/.f32 (neg.f32 x) s))))

   1. Initial program 100.0%

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

      1. lift-exp.f32 N/A

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

      2. lift-/.f32 N/A

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

      3. lift-neg.f32 N/A

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

      4. distribute-frac-neg N/A

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

      5. exp-neg N/A

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

      6. lower-/.f32 N/A

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

      7. lower-exp.f32 N/A

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

      8. lower-/.f32 100.0

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

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. lower-+.f32 N/A

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

      3. lower-/.f32 95.6

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

   7. Applied rewrites 95.6%

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

Alternative 5: 89.1% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 99.7%

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

      1. lift-exp.f32 N/A

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

      2. lift-/.f32 N/A

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

      3. lift-neg.f32 N/A

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

      4. distribute-frac-neg N/A

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

      5. exp-neg N/A

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

      6. lower-/.f32 N/A

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

      7. lower-exp.f32 N/A

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

      8. lower-/.f32 99.7

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

   4. Applied rewrites 99.7%

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

   5. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. lower-+.f32 N/A

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

      3. lower-/.f32 95.0

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

   7. Applied rewrites 95.0%

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

   if 5e8 < (exp.f32 (/.f32 (neg.f32 x) s))

   1. Initial program 99.7%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. sub-neg N/A

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

      3. distribute-lft-in N/A

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

      4. *-commutative N/A

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

      5. associate-*r/ N/A

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

      6. unpow2 N/A

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

      7. times-frac N/A

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

      8. associate-*l* N/A

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

      9. *-commutative N/A

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

      10. associate-*r* N/A

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

      11. distribute-neg-frac N/A

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

      12. metadata-eval N/A

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

      13. associate-/l* N/A

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

      14. *-commutative N/A

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

      15. associate-*r/ N/A

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

      16. distribute-rgt-out N/A

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

      17. lower-fma.f32 N/A

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

   5. Applied rewrites 6.5%

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

   6. Taylor expanded in s around 0

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

   8. Applied rewrites 81.6%

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

4. Final simplification 90.7%

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

Alternative 6: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

Derivation

1. Initial program 99.7%

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

   1. lift-exp.f32 N/A

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

   2. *-lft-identity N/A

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

   3. exp-prod N/A

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

   4. lower-pow.f32 N/A

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

   5. exp-1-e N/A

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

   6. lower-E.f32 99.8

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

4. Applied rewrites 99.8%

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

Alternative 7: 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

Derivation

1. Initial program 99.7%

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

Alternative 8: 51.2% accurate, 2.5× speedup

Math

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

FPCore

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

C

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

Julia

function code(x, s)
	tmp = Float32(0.0)
	if (Float32(Float32(-x) / s) <= Float32(-2.0))
		tmp = Float32(Float32(1.0) / Float32(Float32(1.0) + fma(Float32(Float32(-1.0) / s), x, Float32(1.0))));
	else
		tmp = Float32(Float32(1.0) / Float32(Float32(1.0) + Float32(Float32(1.0) - Float32(x / s))));
	end
	return 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. Step-by-step derivation

      1. lift-exp.f32 N/A

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

      2. *-lft-identity N/A

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

      3. exp-prod N/A

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

      4. lower-pow.f32 N/A

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

      5. exp-1-e N/A

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

      6. lower-E.f32 100.0

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

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. +-commutative N/A

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

      4. associate-/l* N/A

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

      5. log-E N/A

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

      6. metadata-eval N/A

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

      7. associate-*r* N/A

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

      8. *-commutative N/A

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

      9. associate-*r* N/A

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

   7. Applied rewrites 28.1%

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

   8. Taylor expanded in x around 0

      \[\leadsto \frac{1}{1 + \mathsf{fma}\left(\frac{-1}{s}, x, 1\right)} \]
   9. Step-by-step derivation

   10. Applied rewrites 27.9%

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

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

   1. Initial program 99.5%

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

   3. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

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

      2. unsub-neg N/A

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

      3. lower--.f32 N/A

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

      4. lower-/.f32 66.3

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

   5. Applied rewrites 66.3%

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

4. Final simplification 49.9%

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

Alternative 9: 49.4% accurate, 2.7× speedup

Math

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

FPCore

(FPCore (x s)
 :precision binary32
 (if (<= (/ (- x) s) -2.0) 0.5 (/ 1.0 (+ 1.0 (- 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 / (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 / s) <= (-2.0e0)) then
        tmp = 0.5e0
    else
        tmp = 1.0e0 / (1.0e0 + (1.0e0 - (x / s)))
    end if
    code = tmp
end function

Julia

function code(x, s)
	tmp = Float32(0.0)
	if (Float32(Float32(-x) / s) <= Float32(-2.0))
		tmp = Float32(0.5);
	else
		tmp = 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 / s) <= single(-2.0))
		tmp = single(0.5);
	else
		tmp = 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 (/.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

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

   5. Applied rewrites 28.1%

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

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

   1. Initial program 99.5%

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

   3. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

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

      2. unsub-neg N/A

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

      3. lower--.f32 N/A

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

      4. lower-/.f32 66.3

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

   5. Applied rewrites 66.3%

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

4. Final simplification 49.9%

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

Alternative 10: 49.4% accurate, 2.8× speedup

Math

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

FPCore

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

C

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

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 28.1%

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

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

   1. Initial program 99.5%

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

   3. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

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

      2. unsub-neg N/A

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

      3. lower--.f32 N/A

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

      4. lower-/.f32 66.3

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

   5. Applied rewrites 66.3%

      \[\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 -2:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{2 - \frac{x}{s}}\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 47.8% accurate, 2.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 99.8%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 49.3%

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

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

   1. Initial program 99.6%

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

      1. lift-exp.f32 N/A

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

      2. *-lft-identity N/A

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

      3. exp-prod N/A

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

      4. lower-pow.f32 N/A

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

      5. exp-1-e N/A

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

      6. lower-E.f32 99.7

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

   4. Applied rewrites 99.7%

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

   5. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

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

      2. unsub-neg N/A

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

      3. log-E N/A

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

      4. *-rgt-identity N/A

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

      5. lower--.f32 N/A

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

      6. lower-/.f32 44.9

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

   7. Applied rewrites 44.9%

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

   8. Taylor expanded in x around inf

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

   10. Applied rewrites 44.9%

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

4. Final simplification 47.9%

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

Alternative 12: 34.9% accurate, 128.0× speedup

Math

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

FPCore

(FPCore (x s) :precision binary32 0.5)

C

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

Fortran

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

Julia

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

MATLAB

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

Derivation

1. Initial program 99.7%

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

3. Taylor expanded in x around 0

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

5. Applied rewrites 35.3%

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

Reproduce

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