Hyperbolic secant

Percentage Accurate: 100.0% → 100.0%

Time: 3.1s

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

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

   2. Taylor expanded in x around 0 91.1%

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

      1. unpow2 91.1%

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

      2. *-commutative 91.1%

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

   4. Simplified 91.1%

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

   \[\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: 87.2% accurate, 1.9× speedup

Math

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

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x 3.7)
   (/ 2.0 (+ 2.0 (* x x)))
   (+ (+ 1.0 (* 24.0 (pow x -4.0))) -1.0)))

C

double code(double x) {
	double tmp;
	if (x <= 3.7) {
		tmp = 2.0 / (2.0 + (x * x));
	} else {
		tmp = (1.0 + (24.0 * pow(x, -4.0))) + -1.0;
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= 3.7d0) then
        tmp = 2.0d0 / (2.0d0 + (x * x))
    else
        tmp = (1.0d0 + (24.0d0 * (x ** (-4.0d0)))) + (-1.0d0)
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= 3.7) {
		tmp = 2.0 / (2.0 + (x * x));
	} else {
		tmp = (1.0 + (24.0 * Math.pow(x, -4.0))) + -1.0;
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= 3.7:
		tmp = 2.0 / (2.0 + (x * x))
	else:
		tmp = (1.0 + (24.0 * math.pow(x, -4.0))) + -1.0
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= 3.7)
		tmp = Float64(2.0 / Float64(2.0 + Float64(x * x)));
	else
		tmp = Float64(Float64(1.0 + Float64(24.0 * (x ^ -4.0))) + -1.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= 3.7)
		tmp = 2.0 / (2.0 + (x * x));
	else
		tmp = (1.0 + (24.0 * (x ^ -4.0))) + -1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, 3.7], N[(2.0 / N[(2.0 + N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + N[(24.0 * N[Power[x, -4.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 3.7000000000000002

   1. Initial program 100.0%

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

   2. Taylor expanded in x around 0 82.3%

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

      1. unpow2 82.3%

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

   4. Simplified 82.3%

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

   if 3.7000000000000002 < x

   1. Initial program 100.0%

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

   2. Taylor expanded in x around 0 70.3%

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

      1. unpow2 70.3%

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

      2. *-commutative 70.3%

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

   4. Simplified 70.3%

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

   5. Taylor expanded in x around inf 70.3%

      \[\leadsto \color{blue}{\frac{24}{{x}^{4}}} \]
   6. Step-by-step derivation

      1. expm1-log1p-u 70.3%

         \[\leadsto \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(\frac{24}{{x}^{4}}\right)\right)} \]

      2. expm1-udef 98.5%

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

      3. log1p-udef 98.5%

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

      4. add-exp-log 98.5%

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

      5. div-inv 98.5%

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

      6. pow-flip 98.5%

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

      7. metadata-eval 98.5%

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

   7. Applied egg-rr 98.5%

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

4. Final simplification 86.1%

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

Alternative 4: 75.1% 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 60.6%

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

      1. unpow2 60.6%

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

   4. Simplified 60.6%

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

   \[\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: 87.3% accurate, 22.7× speedup

Math

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

FPCore

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

C

double code(double x) {
	double tmp;
	if (x <= 360.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 <= 360.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 <= 360.0) {
		tmp = 2.0 / (2.0 + (x * x));
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

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

Julia

function code(x)
	tmp = 0.0
	if (x <= 360.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 <= 360.0)
		tmp = 2.0 / (2.0 + (x * x));
	else
		tmp = 0.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, 360.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 < 360

   1. Initial program 100.0%

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

   2. Taylor expanded in x around 0 82.0%

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

      1. unpow2 82.0%

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

   4. Simplified 82.0%

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

   if 360 < 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 86.1%

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

Alternative 6: 35.4% accurate, 67.3× speedup

Math

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

FPCore

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

C

double code(double x) {
	double tmp;
	if (x <= 360.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 <= 360.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 <= 360.0) {
		tmp = 0.5;
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < 360

   1. Initial program 100.0%

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

   3. Applied egg-rr 12.5%

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

   if 360 < 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.7%

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

Alternative 7: 75.2% accurate, 67.3× speedup

Math

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

FPCore

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

C

double code(double x) {
	double tmp;
	if (x <= 360.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 <= 360.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 <= 360.0) {
		tmp = 1.0;
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < 360

   1. Initial program 100.0%

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

   2. Taylor expanded in x around 0 60.6%

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

   if 360 < 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 69.7%

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

Alternative 8: 51.5% 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 54.6%

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

4. Final simplification 54.6%

   \[\leadsto 0 \]

Reproduce

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