Logistic function

Percentage Accurate: 99.8% → 99.8%

Time: 8.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.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. 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 82.5%

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

   3. neg-mul-1 82.5%

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

   4. exp-prod 82.5%

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

3. Applied egg-rr 99.8%

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

4. Final simplification 99.8%

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

Alternative 2: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Julia

function code(x, s)
	return Float32(Float32(1.0) / Float32(Float32(1.0) + exp(Float32(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.8%

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

2. Final simplification 99.8%

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

Alternative 3: 63.4% accurate, 4.5× speedup

Math

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

FPCore

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 99.9%

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

   2. Taylor expanded in x around 0 28.1%

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

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

   1. Initial program 99.7%

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

   2. Taylor expanded in x around 0 75.7%

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

      1. mul-1-neg 75.7%

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

      2. unsub-neg 75.7%

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

      3. unpow2 75.7%

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

      4. unpow2 75.7%

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

      5. times-frac 78.0%

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

   4. Simplified 78.0%

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

      1. associate-*r/ 78.0%

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

      2. clear-num 78.0%

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

   6. Applied egg-rr 78.0%

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

      1. associate-/r/ 78.0%

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

      2. associate-*r* 83.8%

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

   8. Applied egg-rr 83.8%

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

4. Final simplification 61.4%

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

Alternative 4: 61.9% accurate, 4.9× speedup

Math

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

FPCore

(FPCore (x s)
 :precision binary32
 (if (<= (/ (- x) s) -2.0)
   0.5
   (/ 1.0 (+ 2.0 (- (* 0.5 (/ x (* s (/ s x)))) (/ 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 + ((0.5f * (x / (s * (s / x)))) - (x / s)));
	}
	return tmp;
}

Fortran

real(4) function code(x, s)
    real(4), intent (in) :: x
    real(4), intent (in) :: s
    real(4) :: tmp
    if ((-x / s) <= (-2.0e0)) then
        tmp = 0.5e0
    else
        tmp = 1.0e0 / (2.0e0 + ((0.5e0 * (x / (s * (s / x)))) - (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(Float32(Float32(0.5) * Float32(x / Float32(s * Float32(s / x)))) - 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) + ((single(0.5) * (x / (s * (s / x)))) - (x / s)));
	end
	tmp_2 = tmp;
end

Derivation

1. Split input into 2 regimes

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

   1. Initial program 99.9%

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

   2. Taylor expanded in x around 0 28.1%

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

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

   1. Initial program 99.7%

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

   2. Taylor expanded in x around 0 75.7%

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

      1. mul-1-neg 75.7%

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

      2. unsub-neg 75.7%

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

      3. unpow2 75.7%

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

      4. unpow2 75.7%

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

      5. times-frac 78.0%

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

   4. Simplified 78.0%

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

      1. clear-num 78.0%

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

      2. frac-times 80.9%

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

      3. *-un-lft-identity 80.9%

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

   6. Applied egg-rr 80.9%

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

4. Final simplification 59.7%

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

Alternative 5: 62.8% accurate, 4.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 99.9%

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

   2. Taylor expanded in x around 0 49.0%

      \[\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. Taylor expanded in x around 0 74.8%

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

      1. mul-1-neg 74.8%

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

      2. unsub-neg 74.8%

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

      3. unpow2 74.8%

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

      4. unpow2 74.8%

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

      5. times-frac 68.0%

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

   4. Simplified 68.0%

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

      1. clear-num 68.0%

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

      2. frac-times 72.7%

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

      3. *-un-lft-identity 72.7%

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

   6. Applied egg-rr 72.7%

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

      1. associate-*l/ 82.2%

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

   8. Applied egg-rr 82.2%

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

4. Final simplification 61.3%

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

Alternative 6: 61.4% accurate, 6.7× speedup

Math

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

FPCore

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

C

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

Fortran

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

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if (neg.f32 x) < 1e-23

   1. Initial program 99.9%

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

   2. Taylor expanded in x around 0 46.0%

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

   if 1e-23 < (neg.f32 x)

   1. Initial program 99.6%

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

   2. Taylor expanded in x around 0 81.5%

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

      1. mul-1-neg 81.5%

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

      2. unsub-neg 81.5%

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

      3. unpow2 81.5%

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

      4. unpow2 81.5%

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

      5. times-frac 74.1%

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

   4. Simplified 74.1%

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

      1. associate-*r/ 74.1%

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

      2. clear-num 74.1%

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

   6. Applied egg-rr 74.1%

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

   7. Taylor expanded in s around 0 80.4%

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

      1. *-commutative 80.4%

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

      2. unpow2 80.4%

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

      3. unpow2 80.4%

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

   9. Simplified 80.4%

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

4. Final simplification 58.7%

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

Alternative 7: 59.5% accurate, 7.6× speedup

Math

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

FPCore

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

C

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

Fortran

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

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 99.9%

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

   2. Taylor expanded in x around 0 49.0%

      \[\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. Taylor expanded in x around 0 74.8%

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

      1. mul-1-neg 74.8%

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

      2. unsub-neg 74.8%

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

      3. unpow2 74.8%

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

      4. unpow2 74.8%

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

      5. times-frac 68.0%

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

   4. Simplified 68.0%

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

   5. Taylor expanded in x around inf 73.8%

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

      1. unpow2 73.8%

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

      2. associate-/l* 65.3%

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

      3. unpow2 65.3%

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

      4. associate-*l/ 65.7%

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

      5. associate-/r* 71.1%

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

   7. Simplified 71.1%

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

4. Final simplification 57.2%

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

Alternative 8: 60.6% accurate, 7.6× speedup

Math

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

FPCore

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

C

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

Fortran

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

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 99.7%

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

   2. Taylor expanded in x around 0 46.0%

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

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

   1. Initial program 100.0%

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

   2. Taylor expanded in x around 0 85.5%

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

      1. mul-1-neg 85.5%

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

      2. unsub-neg 85.5%

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

      3. unpow2 85.5%

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

      4. unpow2 85.5%

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

      5. times-frac 77.2%

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

   4. Simplified 77.2%

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

   5. Taylor expanded in x around inf 84.3%

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

      1. unpow2 84.3%

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

      2. unpow2 84.3%

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

      3. times-frac 74.5%

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

      4. associate-*r* 74.5%

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

   7. Simplified 74.5%

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

      1. associate-*r/ 74.5%

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

      2. frac-times 84.3%

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

   9. Applied egg-rr 84.3%

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

4. Final simplification 58.3%

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

Alternative 9: 49.6% accurate, 8.9× 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 99.9%

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

   2. Taylor expanded in x around 0 28.1%

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

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

   1. Initial program 99.7%

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

   2. Taylor expanded in x around 0 57.3%

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

      1. mul-1-neg 57.3%

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

      2. unsub-neg 57.3%

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

   4. Simplified 57.3%

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

4. Final simplification 45.5%

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

Alternative 10: 48.1% accurate, 9.7× speedup

Math

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

C

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

Fortran

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

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 99.9%

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

   2. Taylor expanded in x around 0 49.0%

      \[\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. Taylor expanded in x around 0 36.4%

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

      1. mul-1-neg 36.4%

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

      2. unsub-neg 36.4%

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

   4. Simplified 36.4%

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

   5. Taylor expanded in x around inf 36.4%

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

      1. neg-mul-1 36.4%

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

      2. distribute-neg-frac 36.4%

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

   7. Simplified 36.4%

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

4. Final simplification 44.3%

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

Alternative 11: 45.7% accurate, 17.6× speedup

Math

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

FPCore

(FPCore (x s)
 :precision binary32
 (if (<= x -5.000000018137469e-16) (/ (- s) x) 0.5))

C

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if x < -5.00000002e-16

   1. Initial program 99.8%

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

   2. Taylor expanded in x around 0 41.3%

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

      1. mul-1-neg 41.3%

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

      2. unsub-neg 41.3%

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

   4. Simplified 41.3%

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

   5. Taylor expanded in x around inf 40.1%

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

      1. associate-*r/ 40.1%

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

      2. neg-mul-1 40.1%

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

   7. Simplified 40.1%

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

   if -5.00000002e-16 < x

   1. Initial program 99.8%

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

   2. Taylor expanded in x around 0 45.6%

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

4. Final simplification 43.9%

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

Alternative 12: 35.2% 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. Taylor expanded in x around 0 33.3%

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

3. Final simplification 33.3%

   \[\leadsto 0.5 \]

Reproduce

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