Hyperbolic secant

Percentage Accurate: 100.0% → 100.0%

Time: 3.5s

Alternatives: 8

Speedup: 1.0×

Specification

Math

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

FPCore

(FPCore (x) :precision binary64 (/ 2.0 (+ (exp x) (exp (- x)))))

C

double code(double x) {
	return 2.0 / (exp(x) + exp(-x));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = 2.0d0 / (exp(x) + exp(-x))
end function

Java

public static double code(double x) {
	return 2.0 / (Math.exp(x) + Math.exp(-x));
}

Python

def code(x):
	return 2.0 / (math.exp(x) + math.exp(-x))

Julia

function code(x)
	return Float64(2.0 / Float64(exp(x) + exp(Float64(-x))))
end

MATLAB

function tmp = code(x)
	tmp = 2.0 / (exp(x) + exp(-x));
end

Wolfram

code[x_] := N[(2.0 / N[(N[Exp[x], $MachinePrecision] + N[Exp[(-x)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x) :precision binary64 (/ 2.0 (+ (exp x) (exp (- x)))))

C

double code(double x) {
	return 2.0 / (exp(x) + exp(-x));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = 2.0d0 / (exp(x) + exp(-x))
end function

Java

public static double code(double x) {
	return 2.0 / (Math.exp(x) + Math.exp(-x));
}

Python

def code(x):
	return 2.0 / (math.exp(x) + math.exp(-x))

Julia

function code(x)
	return Float64(2.0 / Float64(exp(x) + exp(Float64(-x))))
end

MATLAB

function tmp = code(x)
	tmp = 2.0 / (exp(x) + exp(-x));
end

Wolfram

code[x_] := N[(2.0 / N[(N[Exp[x], $MachinePrecision] + N[Exp[(-x)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 100.0% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x) :precision binary64 (/ 2.0 (+ (exp x) (exp (- x)))))

C

double code(double x) {
	return 2.0 / (exp(x) + exp(-x));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = 2.0d0 / (exp(x) + exp(-x))
end function

Java

public static double code(double x) {
	return 2.0 / (Math.exp(x) + Math.exp(-x));
}

Python

def code(x):
	return 2.0 / (math.exp(x) + math.exp(-x))

Julia

function code(x)
	return Float64(2.0 / Float64(exp(x) + exp(Float64(-x))))
end

MATLAB

function tmp = code(x)
	tmp = 2.0 / (exp(x) + exp(-x));
end

Wolfram

code[x_] := N[(2.0 / N[(N[Exp[x], $MachinePrecision] + N[Exp[(-x)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[\frac{2}{e^{x} + e^{-x}} \]

2. Final simplification 100.0%

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

Alternative 2: 93.4% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 370:\\ \;\;\;\;\frac{2}{2 + \left(x \cdot x + {x}^{4} \cdot 0.08333333333333333\right)}\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x 370.0)
   (/ 2.0 (+ 2.0 (+ (* x x) (* (pow x 4.0) 0.08333333333333333))))
   0.0))

C

double code(double x) {
	double tmp;
	if (x <= 370.0) {
		tmp = 2.0 / (2.0 + ((x * x) + (pow(x, 4.0) * 0.08333333333333333)));
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= 370.0d0) then
        tmp = 2.0d0 / (2.0d0 + ((x * x) + ((x ** 4.0d0) * 0.08333333333333333d0)))
    else
        tmp = 0.0d0
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= 370.0) {
		tmp = 2.0 / (2.0 + ((x * x) + (Math.pow(x, 4.0) * 0.08333333333333333)));
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= 370.0:
		tmp = 2.0 / (2.0 + ((x * x) + (math.pow(x, 4.0) * 0.08333333333333333)))
	else:
		tmp = 0.0
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= 370.0)
		tmp = Float64(2.0 / Float64(2.0 + Float64(Float64(x * x) + Float64((x ^ 4.0) * 0.08333333333333333))));
	else
		tmp = 0.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= 370.0)
		tmp = 2.0 / (2.0 + ((x * x) + ((x ^ 4.0) * 0.08333333333333333)));
	else
		tmp = 0.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, 370.0], N[(2.0 / N[(2.0 + N[(N[(x * x), $MachinePrecision] + N[(N[Power[x, 4.0], $MachinePrecision] * 0.08333333333333333), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.0]

Derivation

1. Split input into 2 regimes

2. if x < 370

   1. Initial program 99.9%

      \[\frac{2}{e^{x} + e^{-x}} \]

   2. Taylor expanded in x around 0 92.7%

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

      1. unpow2 92.7%

         \[\leadsto \frac{2}{2 + \left(\color{blue}{x \cdot x} + 0.08333333333333333 \cdot {x}^{4}\right)} \]

      2. *-commutative 92.7%

         \[\leadsto \frac{2}{2 + \left(x \cdot x + \color{blue}{{x}^{4} \cdot 0.08333333333333333}\right)} \]

   4. Simplified 92.7%

      \[\leadsto \frac{2}{\color{blue}{2 + \left(x \cdot x + {x}^{4} \cdot 0.08333333333333333\right)}} \]

   if 370 < x

   1. Initial program 100.0%

      \[\frac{2}{e^{x} + e^{-x}} \]

   3. Applied egg-rr 100.0%

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

4. Final simplification 94.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 370:\\ \;\;\;\;\frac{2}{2 + \left(x \cdot x + {x}^{4} \cdot 0.08333333333333333\right)}\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \]

Alternative 3: 73.5% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 340:\\ \;\;\;\;\mathsf{fma}\left(x \cdot x, x \cdot \left(x \cdot 0.20833333333333334\right) + -0.5, 1\right)\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x 340.0)
   (fma (* x x) (+ (* x (* x 0.20833333333333334)) -0.5) 1.0)
   0.0))

C

double code(double x) {
	double tmp;
	if (x <= 340.0) {
		tmp = fma((x * x), ((x * (x * 0.20833333333333334)) + -0.5), 1.0);
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Julia

function code(x)
	tmp = 0.0
	if (x <= 340.0)
		tmp = fma(Float64(x * x), Float64(Float64(x * Float64(x * 0.20833333333333334)) + -0.5), 1.0);
	else
		tmp = 0.0;
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[x, 340.0], N[(N[(x * x), $MachinePrecision] * N[(N[(x * N[(x * 0.20833333333333334), $MachinePrecision]), $MachinePrecision] + -0.5), $MachinePrecision] + 1.0), $MachinePrecision], 0.0]

Derivation

1. Split input into 2 regimes

2. if x < 340

   1. Initial program 99.9%

      \[\frac{2}{e^{x} + e^{-x}} \]

   2. Taylor expanded in x around 0 63.8%

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

      1. +-commutative 63.8%

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

      2. metadata-eval 63.8%

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

      3. pow-sqr 63.8%

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

      4. associate-*r* 63.8%

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

      5. distribute-rgt-out 64.0%

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

      6. *-commutative 64.0%

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

      7. fma-def 64.0%

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

      8. unpow2 64.0%

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

      9. +-commutative 64.0%

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

      10. unpow2 64.0%

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

      11. associate-*l* 64.0%

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

      12. fma-def 64.0%

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

   4. Simplified 64.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x \cdot x, \mathsf{fma}\left(x, x \cdot 0.20833333333333334, -0.5\right), 1\right)} \]
   5. Step-by-step derivation

      1. fma-udef 64.0%

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

   6. Applied egg-rr 64.0%

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

   if 340 < x

   1. Initial program 100.0%

      \[\frac{2}{e^{x} + e^{-x}} \]

   3. Applied egg-rr 100.0%

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

4. Final simplification 72.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 340:\\ \;\;\;\;\mathsf{fma}\left(x \cdot x, x \cdot \left(x \cdot 0.20833333333333334\right) + -0.5, 1\right)\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \]

Alternative 4: 73.5% accurate, 22.7× speedup

Math

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

FPCore

(FPCore (x) :precision binary64 (if (<= x 1.4) (+ 1.0 (* (* x x) -0.5)) 0.0))

C

double code(double x) {
	double tmp;
	if (x <= 1.4) {
		tmp = 1.0 + ((x * x) * -0.5);
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= 1.4d0) then
        tmp = 1.0d0 + ((x * x) * (-0.5d0))
    else
        tmp = 0.0d0
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= 1.4) {
		tmp = 1.0 + ((x * x) * -0.5);
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= 1.4:
		tmp = 1.0 + ((x * x) * -0.5)
	else:
		tmp = 0.0
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= 1.4)
		tmp = Float64(1.0 + Float64(Float64(x * x) * -0.5));
	else
		tmp = 0.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= 1.4)
		tmp = 1.0 + ((x * x) * -0.5);
	else
		tmp = 0.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, 1.4], N[(1.0 + N[(N[(x * x), $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision], 0.0]

Derivation

1. Split input into 2 regimes

2. if x < 1.3999999999999999

   1. Initial program 100.0%

      \[\frac{2}{e^{x} + e^{-x}} \]

   2. Taylor expanded in x around 0 63.8%

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

      1. unpow2 63.8%

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

   4. Simplified 63.8%

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

   if 1.3999999999999999 < x

   1. Initial program 100.0%

      \[\frac{2}{e^{x} + e^{-x}} \]

   3. Applied egg-rr 98.4%

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

4. Final simplification 71.8%

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

Alternative 5: 86.7% accurate, 22.7× speedup

Math

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

FPCore

(FPCore (x) :precision binary64 (if (<= x 350.0) (/ 2.0 (+ 2.0 (* x x))) 0.0))

C

double code(double x) {
	double tmp;
	if (x <= 350.0) {
		tmp = 2.0 / (2.0 + (x * x));
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= 350.0d0) then
        tmp = 2.0d0 / (2.0d0 + (x * x))
    else
        tmp = 0.0d0
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= 350.0) {
		tmp = 2.0 / (2.0 + (x * x));
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= 350.0:
		tmp = 2.0 / (2.0 + (x * x))
	else:
		tmp = 0.0
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= 350.0)
		tmp = Float64(2.0 / Float64(2.0 + Float64(x * x)));
	else
		tmp = 0.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= 350.0)
		tmp = 2.0 / (2.0 + (x * x));
	else
		tmp = 0.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, 350.0], N[(2.0 / N[(2.0 + N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.0]

Derivation

1. Split input into 2 regimes

2. if x < 350

   1. Initial program 99.9%

      \[\frac{2}{e^{x} + e^{-x}} \]

   2. Taylor expanded in x around 0 81.2%

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

      1. unpow2 81.2%

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

   4. Simplified 81.2%

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

   if 350 < x

   1. Initial program 100.0%

      \[\frac{2}{e^{x} + e^{-x}} \]

   3. Applied egg-rr 100.0%

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

4. Final simplification 85.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 350:\\ \;\;\;\;\frac{2}{2 + x \cdot x}\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \]

Alternative 6: 34.2% accurate, 67.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 350:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (if (<= x 350.0) 0.5 0.0))

C

double code(double x) {
	double tmp;
	if (x <= 350.0) {
		tmp = 0.5;
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= 350.0d0) then
        tmp = 0.5d0
    else
        tmp = 0.0d0
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= 350.0) {
		tmp = 0.5;
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= 350.0:
		tmp = 0.5
	else:
		tmp = 0.0
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= 350.0)
		tmp = 0.5;
	else
		tmp = 0.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= 350.0)
		tmp = 0.5;
	else
		tmp = 0.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, 350.0], 0.5, 0.0]

Derivation

1. Split input into 2 regimes

2. if x < 350

   1. Initial program 99.9%

      \[\frac{2}{e^{x} + e^{-x}} \]

   3. Applied egg-rr 13.2%

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

   if 350 < x

   1. Initial program 100.0%

      \[\frac{2}{e^{x} + e^{-x}} \]

   3. Applied egg-rr 100.0%

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

4. Final simplification 32.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 350:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \]

Alternative 7: 73.5% accurate, 67.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 350:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (if (<= x 350.0) 1.0 0.0))

C

double code(double x) {
	double tmp;
	if (x <= 350.0) {
		tmp = 1.0;
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= 350.0d0) then
        tmp = 1.0d0
    else
        tmp = 0.0d0
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= 350.0) {
		tmp = 1.0;
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= 350.0:
		tmp = 1.0
	else:
		tmp = 0.0
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= 350.0)
		tmp = 1.0;
	else
		tmp = 0.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= 350.0)
		tmp = 1.0;
	else
		tmp = 0.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, 350.0], 1.0, 0.0]

Derivation

1. Split input into 2 regimes

2. if x < 350

   1. Initial program 99.9%

      \[\frac{2}{e^{x} + e^{-x}} \]

   2. Taylor expanded in x around 0 63.0%

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

   if 350 < x

   1. Initial program 100.0%

      \[\frac{2}{e^{x} + e^{-x}} \]

   3. Applied egg-rr 100.0%

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

4. Final simplification 71.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 350:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \]

Alternative 8: 52.1% accurate, 206.0× speedup

Math

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

FPCore

(FPCore (x) :precision binary64 0.0)

C

double code(double x) {
	return 0.0;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = 0.0d0
end function

Java

public static double code(double x) {
	return 0.0;
}

Python

def code(x):
	return 0.0

Julia

function code(x)
	return 0.0
end

MATLAB

function tmp = code(x)
	tmp = 0.0;
end

Wolfram

code[x_] := 0.0

Derivation

1. Initial program 100.0%

   \[\frac{2}{e^{x} + e^{-x}} \]

3. Applied egg-rr 51.2%

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

4. Final simplification 51.2%

   \[\leadsto 0 \]

Reproduce

herbie shell --seed 2023258 
(FPCore (x)
  :name "Hyperbolic secant"
  :precision binary64
  (/ 2.0 (+ (exp x) (exp (- x)))))