Harley's example

Percentage Accurate: 90.7% → 96.5%

Time: 52.5s

Alternatives: 8

Speedup: 896.0×

• could not determine a ground truth

  1. c_p = 5.4518722153824375e-167
  2. c_n = 4.3241417121178854e-231
  3. t = 3.07426613308016e+132
  4. s = -2.730732274317406e-136

Specification

\[0 < c\_p \land 0 < c\_n\]

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{1}{1 + e^{-t}}\\ t_2 := \frac{1}{1 + e^{-s}}\\ \frac{{t\_2}^{c\_p} \cdot {\left(1 - t\_2\right)}^{c\_n}}{{t\_1}^{c\_p} \cdot {\left(1 - t\_1\right)}^{c\_n}} \end{array} \end{array} \]

FPCore

(FPCore (c_p c_n t s)
 :precision binary64
 (let* ((t_1 (/ 1.0 (+ 1.0 (exp (- t))))) (t_2 (/ 1.0 (+ 1.0 (exp (- s))))))
   (/
    (* (pow t_2 c_p) (pow (- 1.0 t_2) c_n))
    (* (pow t_1 c_p) (pow (- 1.0 t_1) c_n)))))

C

double code(double c_p, double c_n, double t, double s) {
	double t_1 = 1.0 / (1.0 + exp(-t));
	double t_2 = 1.0 / (1.0 + exp(-s));
	return (pow(t_2, c_p) * pow((1.0 - t_2), c_n)) / (pow(t_1, c_p) * pow((1.0 - t_1), c_n));
}

Fortran

real(8) function code(c_p, c_n, t, s)
    real(8), intent (in) :: c_p
    real(8), intent (in) :: c_n
    real(8), intent (in) :: t
    real(8), intent (in) :: s
    real(8) :: t_1
    real(8) :: t_2
    t_1 = 1.0d0 / (1.0d0 + exp(-t))
    t_2 = 1.0d0 / (1.0d0 + exp(-s))
    code = ((t_2 ** c_p) * ((1.0d0 - t_2) ** c_n)) / ((t_1 ** c_p) * ((1.0d0 - t_1) ** c_n))
end function

Java

public static double code(double c_p, double c_n, double t, double s) {
	double t_1 = 1.0 / (1.0 + Math.exp(-t));
	double t_2 = 1.0 / (1.0 + Math.exp(-s));
	return (Math.pow(t_2, c_p) * Math.pow((1.0 - t_2), c_n)) / (Math.pow(t_1, c_p) * Math.pow((1.0 - t_1), c_n));
}

Python

def code(c_p, c_n, t, s):
	t_1 = 1.0 / (1.0 + math.exp(-t))
	t_2 = 1.0 / (1.0 + math.exp(-s))
	return (math.pow(t_2, c_p) * math.pow((1.0 - t_2), c_n)) / (math.pow(t_1, c_p) * math.pow((1.0 - t_1), c_n))

Julia

function code(c_p, c_n, t, s)
	t_1 = Float64(1.0 / Float64(1.0 + exp(Float64(-t))))
	t_2 = Float64(1.0 / Float64(1.0 + exp(Float64(-s))))
	return Float64(Float64((t_2 ^ c_p) * (Float64(1.0 - t_2) ^ c_n)) / Float64((t_1 ^ c_p) * (Float64(1.0 - t_1) ^ c_n)))
end

MATLAB

function tmp = code(c_p, c_n, t, s)
	t_1 = 1.0 / (1.0 + exp(-t));
	t_2 = 1.0 / (1.0 + exp(-s));
	tmp = ((t_2 ^ c_p) * ((1.0 - t_2) ^ c_n)) / ((t_1 ^ c_p) * ((1.0 - t_1) ^ c_n));
end

Wolfram

code[c$95$p_, c$95$n_, t_, s_] := Block[{t$95$1 = N[(1.0 / N[(1.0 + N[Exp[(-t)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(1.0 / N[(1.0 + N[Exp[(-s)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[Power[t$95$2, c$95$p], $MachinePrecision] * N[Power[N[(1.0 - t$95$2), $MachinePrecision], c$95$n], $MachinePrecision]), $MachinePrecision] / N[(N[Power[t$95$1, c$95$p], $MachinePrecision] * N[Power[N[(1.0 - t$95$1), $MachinePrecision], c$95$n], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Initial Program: 90.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{1}{1 + e^{-t}}\\ t_2 := \frac{1}{1 + e^{-s}}\\ \frac{{t\_2}^{c\_p} \cdot {\left(1 - t\_2\right)}^{c\_n}}{{t\_1}^{c\_p} \cdot {\left(1 - t\_1\right)}^{c\_n}} \end{array} \end{array} \]

FPCore

(FPCore (c_p c_n t s)
 :precision binary64
 (let* ((t_1 (/ 1.0 (+ 1.0 (exp (- t))))) (t_2 (/ 1.0 (+ 1.0 (exp (- s))))))
   (/
    (* (pow t_2 c_p) (pow (- 1.0 t_2) c_n))
    (* (pow t_1 c_p) (pow (- 1.0 t_1) c_n)))))

C

double code(double c_p, double c_n, double t, double s) {
	double t_1 = 1.0 / (1.0 + exp(-t));
	double t_2 = 1.0 / (1.0 + exp(-s));
	return (pow(t_2, c_p) * pow((1.0 - t_2), c_n)) / (pow(t_1, c_p) * pow((1.0 - t_1), c_n));
}

Fortran

real(8) function code(c_p, c_n, t, s)
    real(8), intent (in) :: c_p
    real(8), intent (in) :: c_n
    real(8), intent (in) :: t
    real(8), intent (in) :: s
    real(8) :: t_1
    real(8) :: t_2
    t_1 = 1.0d0 / (1.0d0 + exp(-t))
    t_2 = 1.0d0 / (1.0d0 + exp(-s))
    code = ((t_2 ** c_p) * ((1.0d0 - t_2) ** c_n)) / ((t_1 ** c_p) * ((1.0d0 - t_1) ** c_n))
end function

Java

public static double code(double c_p, double c_n, double t, double s) {
	double t_1 = 1.0 / (1.0 + Math.exp(-t));
	double t_2 = 1.0 / (1.0 + Math.exp(-s));
	return (Math.pow(t_2, c_p) * Math.pow((1.0 - t_2), c_n)) / (Math.pow(t_1, c_p) * Math.pow((1.0 - t_1), c_n));
}

Python

def code(c_p, c_n, t, s):
	t_1 = 1.0 / (1.0 + math.exp(-t))
	t_2 = 1.0 / (1.0 + math.exp(-s))
	return (math.pow(t_2, c_p) * math.pow((1.0 - t_2), c_n)) / (math.pow(t_1, c_p) * math.pow((1.0 - t_1), c_n))

Julia

function code(c_p, c_n, t, s)
	t_1 = Float64(1.0 / Float64(1.0 + exp(Float64(-t))))
	t_2 = Float64(1.0 / Float64(1.0 + exp(Float64(-s))))
	return Float64(Float64((t_2 ^ c_p) * (Float64(1.0 - t_2) ^ c_n)) / Float64((t_1 ^ c_p) * (Float64(1.0 - t_1) ^ c_n)))
end

MATLAB

function tmp = code(c_p, c_n, t, s)
	t_1 = 1.0 / (1.0 + exp(-t));
	t_2 = 1.0 / (1.0 + exp(-s));
	tmp = ((t_2 ^ c_p) * ((1.0 - t_2) ^ c_n)) / ((t_1 ^ c_p) * ((1.0 - t_1) ^ c_n));
end

Wolfram

code[c$95$p_, c$95$n_, t_, s_] := Block[{t$95$1 = N[(1.0 / N[(1.0 + N[Exp[(-t)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(1.0 / N[(1.0 + N[Exp[(-s)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[Power[t$95$2, c$95$p], $MachinePrecision] * N[Power[N[(1.0 - t$95$2), $MachinePrecision], c$95$n], $MachinePrecision]), $MachinePrecision] / N[(N[Power[t$95$1, c$95$p], $MachinePrecision] * N[Power[N[(1.0 - t$95$1), $MachinePrecision], c$95$n], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Alternative 1: 96.5% accurate, 2.5× speedup

Math

\[\begin{array}{l} \\ {\left(\frac{1}{1 + \frac{-1}{1 + e^{-t}}} \cdot \left(1 + \frac{-1}{1 + e^{-s}}\right)\right)}^{c\_n} \end{array} \]

FPCore

(FPCore (c_p c_n t s)
 :precision binary64
 (pow
  (*
   (/ 1.0 (+ 1.0 (/ -1.0 (+ 1.0 (exp (- t))))))
   (+ 1.0 (/ -1.0 (+ 1.0 (exp (- s))))))
  c_n))

C

double code(double c_p, double c_n, double t, double s) {
	return pow(((1.0 / (1.0 + (-1.0 / (1.0 + exp(-t))))) * (1.0 + (-1.0 / (1.0 + exp(-s))))), c_n);
}

Fortran

real(8) function code(c_p, c_n, t, s)
    real(8), intent (in) :: c_p
    real(8), intent (in) :: c_n
    real(8), intent (in) :: t
    real(8), intent (in) :: s
    code = ((1.0d0 / (1.0d0 + ((-1.0d0) / (1.0d0 + exp(-t))))) * (1.0d0 + ((-1.0d0) / (1.0d0 + exp(-s))))) ** c_n
end function

Java

public static double code(double c_p, double c_n, double t, double s) {
	return Math.pow(((1.0 / (1.0 + (-1.0 / (1.0 + Math.exp(-t))))) * (1.0 + (-1.0 / (1.0 + Math.exp(-s))))), c_n);
}

Python

def code(c_p, c_n, t, s):
	return math.pow(((1.0 / (1.0 + (-1.0 / (1.0 + math.exp(-t))))) * (1.0 + (-1.0 / (1.0 + math.exp(-s))))), c_n)

Julia

function code(c_p, c_n, t, s)
	return Float64(Float64(1.0 / Float64(1.0 + Float64(-1.0 / Float64(1.0 + exp(Float64(-t)))))) * Float64(1.0 + Float64(-1.0 / Float64(1.0 + exp(Float64(-s)))))) ^ c_n
end

MATLAB

function tmp = code(c_p, c_n, t, s)
	tmp = ((1.0 / (1.0 + (-1.0 / (1.0 + exp(-t))))) * (1.0 + (-1.0 / (1.0 + exp(-s))))) ^ c_n;
end

Wolfram

code[c$95$p_, c$95$n_, t_, s_] := N[Power[N[(N[(1.0 / N[(1.0 + N[(-1.0 / N[(1.0 + N[Exp[(-t)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(-1.0 / N[(1.0 + N[Exp[(-s)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], c$95$n], $MachinePrecision]

Derivation

1. Initial program 92.6%

   \[\frac{{\left(\frac{1}{1 + e^{-s}}\right)}^{c\_p} \cdot {\left(1 - \frac{1}{1 + e^{-s}}\right)}^{c\_n}}{{\left(\frac{1}{1 + e^{-t}}\right)}^{c\_p} \cdot {\left(1 - \frac{1}{1 + e^{-t}}\right)}^{c\_n}} \]
2. Add Preprocessing

3. Taylor expanded in c_p around 0

   \[\leadsto \color{blue}{\frac{{\left(1 - \frac{1}{1 + e^{\mathsf{neg}\left(s\right)}}\right)}^{c\_n}}{{\left(1 - \frac{1}{1 + e^{\mathsf{neg}\left(t\right)}}\right)}^{c\_n}}} \]
4. Step-by-step derivation

   1. lower-/.f64 N/A

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

   2. lower-pow.f64 N/A

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

   3. sub-neg N/A

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

   4. lower-+.f64 N/A

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

   5. distribute-neg-frac N/A

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

   6. metadata-eval N/A

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

   7. lower-/.f64 N/A

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

   8. lower-+.f64 N/A

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

   9. lower-exp.f64 N/A

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

   10. lower-neg.f64 N/A

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

   11. lower-pow.f64 N/A

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

5. Applied rewrites 97.5%

   \[\leadsto \color{blue}{\frac{{\left(1 + \frac{-1}{1 + e^{-s}}\right)}^{c\_n}}{{\left(1 + \frac{-1}{1 + e^{-t}}\right)}^{c\_n}}} \]
6. Step-by-step derivation

7. Applied rewrites 98.6%

   \[\leadsto {\left(\frac{1}{1 + \frac{-1}{1 + e^{-t}}} \cdot \left(1 + \frac{-1}{1 + e^{-s}}\right)\right)}^{\color{blue}{c\_n}} \]
8. Add Preprocessing

Alternative 2: 96.3% accurate, 3.8× speedup

Math

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

FPCore

(FPCore (c_p c_n t s)
 :precision binary64
 (if (<= (- t) 2e-66)
   (pow (* (+ 1.0 (/ -1.0 (+ 1.0 (exp (- s))))) (+ t 2.0)) c_n)
   (/ (pow 0.5 c_n) 1.0)))

C

double code(double c_p, double c_n, double t, double s) {
	double tmp;
	if (-t <= 2e-66) {
		tmp = pow(((1.0 + (-1.0 / (1.0 + exp(-s)))) * (t + 2.0)), c_n);
	} else {
		tmp = pow(0.5, c_n) / 1.0;
	}
	return tmp;
}

Fortran

real(8) function code(c_p, c_n, t, s)
    real(8), intent (in) :: c_p
    real(8), intent (in) :: c_n
    real(8), intent (in) :: t
    real(8), intent (in) :: s
    real(8) :: tmp
    if (-t <= 2d-66) then
        tmp = ((1.0d0 + ((-1.0d0) / (1.0d0 + exp(-s)))) * (t + 2.0d0)) ** c_n
    else
        tmp = (0.5d0 ** c_n) / 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double c_p, double c_n, double t, double s) {
	double tmp;
	if (-t <= 2e-66) {
		tmp = Math.pow(((1.0 + (-1.0 / (1.0 + Math.exp(-s)))) * (t + 2.0)), c_n);
	} else {
		tmp = Math.pow(0.5, c_n) / 1.0;
	}
	return tmp;
}

Python

def code(c_p, c_n, t, s):
	tmp = 0
	if -t <= 2e-66:
		tmp = math.pow(((1.0 + (-1.0 / (1.0 + math.exp(-s)))) * (t + 2.0)), c_n)
	else:
		tmp = math.pow(0.5, c_n) / 1.0
	return tmp

Julia

function code(c_p, c_n, t, s)
	tmp = 0.0
	if (Float64(-t) <= 2e-66)
		tmp = Float64(Float64(1.0 + Float64(-1.0 / Float64(1.0 + exp(Float64(-s))))) * Float64(t + 2.0)) ^ c_n;
	else
		tmp = Float64((0.5 ^ c_n) / 1.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(c_p, c_n, t, s)
	tmp = 0.0;
	if (-t <= 2e-66)
		tmp = ((1.0 + (-1.0 / (1.0 + exp(-s)))) * (t + 2.0)) ^ c_n;
	else
		tmp = (0.5 ^ c_n) / 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[c$95$p_, c$95$n_, t_, s_] := If[LessEqual[(-t), 2e-66], N[Power[N[(N[(1.0 + N[(-1.0 / N[(1.0 + N[Exp[(-s)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(t + 2.0), $MachinePrecision]), $MachinePrecision], c$95$n], $MachinePrecision], N[(N[Power[0.5, c$95$n], $MachinePrecision] / 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (neg.f64 t) < 2e-66

   1. Initial program 96.4%

      \[\frac{{\left(\frac{1}{1 + e^{-s}}\right)}^{c\_p} \cdot {\left(1 - \frac{1}{1 + e^{-s}}\right)}^{c\_n}}{{\left(\frac{1}{1 + e^{-t}}\right)}^{c\_p} \cdot {\left(1 - \frac{1}{1 + e^{-t}}\right)}^{c\_n}} \]
   2. Add Preprocessing

   3. Taylor expanded in c_p around 0

      \[\leadsto \color{blue}{\frac{{\left(1 - \frac{1}{1 + e^{\mathsf{neg}\left(s\right)}}\right)}^{c\_n}}{{\left(1 - \frac{1}{1 + e^{\mathsf{neg}\left(t\right)}}\right)}^{c\_n}}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. lower-pow.f64 N/A

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

      3. sub-neg N/A

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

      4. lower-+.f64 N/A

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

      5. distribute-neg-frac N/A

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

      6. metadata-eval N/A

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

      7. lower-/.f64 N/A

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

      8. lower-+.f64 N/A

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

      9. lower-exp.f64 N/A

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

      10. lower-neg.f64 N/A

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

      11. lower-pow.f64 N/A

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

   5. Applied rewrites 97.8%

      \[\leadsto \color{blue}{\frac{{\left(1 + \frac{-1}{1 + e^{-s}}\right)}^{c\_n}}{{\left(1 + \frac{-1}{1 + e^{-t}}\right)}^{c\_n}}} \]
   6. Step-by-step derivation

   7. Applied rewrites 99.0%

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

   8. Taylor expanded in t around 0

      \[\leadsto {\left(\left(2 + t\right) \cdot \left(1 + \frac{-1}{1 + e^{\mathsf{neg}\left(s\right)}}\right)\right)}^{c\_n} \]
   9. Step-by-step derivation

   10. Applied rewrites 99.0%

       \[\leadsto {\left(\left(2 + t\right) \cdot \left(1 + \frac{-1}{1 + e^{-s}}\right)\right)}^{c\_n} \]

   if 2e-66 < (neg.f64 t)

   1. Initial program 67.0%

      \[\frac{{\left(\frac{1}{1 + e^{-s}}\right)}^{c\_p} \cdot {\left(1 - \frac{1}{1 + e^{-s}}\right)}^{c\_n}}{{\left(\frac{1}{1 + e^{-t}}\right)}^{c\_p} \cdot {\left(1 - \frac{1}{1 + e^{-t}}\right)}^{c\_n}} \]
   2. Add Preprocessing

   3. Taylor expanded in c_p around 0

      \[\leadsto \color{blue}{\frac{{\left(1 - \frac{1}{1 + e^{\mathsf{neg}\left(s\right)}}\right)}^{c\_n}}{{\left(1 - \frac{1}{1 + e^{\mathsf{neg}\left(t\right)}}\right)}^{c\_n}}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. lower-pow.f64 N/A

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

      3. sub-neg N/A

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

      4. lower-+.f64 N/A

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

      5. distribute-neg-frac N/A

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

      6. metadata-eval N/A

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

      7. lower-/.f64 N/A

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

      8. lower-+.f64 N/A

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

      9. lower-exp.f64 N/A

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

      10. lower-neg.f64 N/A

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

      11. lower-pow.f64 N/A

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

   5. Applied rewrites 95.4%

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

   6. Taylor expanded in c_n around 0

      \[\leadsto \frac{{\left(1 + \frac{-1}{1 + e^{\mathsf{neg}\left(s\right)}}\right)}^{c\_n}}{1} \]
   7. Step-by-step derivation

   8. Applied rewrites 95.4%

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

   9. Taylor expanded in s around 0

      \[\leadsto \frac{{\frac{1}{2}}^{c\_n}}{1} \]
   10. Step-by-step derivation

   11. Applied rewrites 95.4%

       \[\leadsto \frac{{0.5}^{c\_n}}{1} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.5%

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

Alternative 3: 95.1% accurate, 3.9× speedup

Math

\[\begin{array}{l} \\ {\left(\frac{0.5}{1 + \frac{-1}{1 + e^{-t}}}\right)}^{c\_n} \end{array} \]

FPCore

(FPCore (c_p c_n t s)
 :precision binary64
 (pow (/ 0.5 (+ 1.0 (/ -1.0 (+ 1.0 (exp (- t)))))) c_n))

C

double code(double c_p, double c_n, double t, double s) {
	return pow((0.5 / (1.0 + (-1.0 / (1.0 + exp(-t))))), c_n);
}

Fortran

real(8) function code(c_p, c_n, t, s)
    real(8), intent (in) :: c_p
    real(8), intent (in) :: c_n
    real(8), intent (in) :: t
    real(8), intent (in) :: s
    code = (0.5d0 / (1.0d0 + ((-1.0d0) / (1.0d0 + exp(-t))))) ** c_n
end function

Java

public static double code(double c_p, double c_n, double t, double s) {
	return Math.pow((0.5 / (1.0 + (-1.0 / (1.0 + Math.exp(-t))))), c_n);
}

Python

def code(c_p, c_n, t, s):
	return math.pow((0.5 / (1.0 + (-1.0 / (1.0 + math.exp(-t))))), c_n)

Julia

function code(c_p, c_n, t, s)
	return Float64(0.5 / Float64(1.0 + Float64(-1.0 / Float64(1.0 + exp(Float64(-t)))))) ^ c_n
end

MATLAB

function tmp = code(c_p, c_n, t, s)
	tmp = (0.5 / (1.0 + (-1.0 / (1.0 + exp(-t))))) ^ c_n;
end

Wolfram

code[c$95$p_, c$95$n_, t_, s_] := N[Power[N[(0.5 / N[(1.0 + N[(-1.0 / N[(1.0 + N[Exp[(-t)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], c$95$n], $MachinePrecision]

Derivation

1. Initial program 92.6%

   \[\frac{{\left(\frac{1}{1 + e^{-s}}\right)}^{c\_p} \cdot {\left(1 - \frac{1}{1 + e^{-s}}\right)}^{c\_n}}{{\left(\frac{1}{1 + e^{-t}}\right)}^{c\_p} \cdot {\left(1 - \frac{1}{1 + e^{-t}}\right)}^{c\_n}} \]
2. Add Preprocessing

3. Taylor expanded in c_p around 0

   \[\leadsto \color{blue}{\frac{{\left(1 - \frac{1}{1 + e^{\mathsf{neg}\left(s\right)}}\right)}^{c\_n}}{{\left(1 - \frac{1}{1 + e^{\mathsf{neg}\left(t\right)}}\right)}^{c\_n}}} \]
4. Step-by-step derivation

   1. lower-/.f64 N/A

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

   2. lower-pow.f64 N/A

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

   3. sub-neg N/A

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

   4. lower-+.f64 N/A

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

   5. distribute-neg-frac N/A

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

   6. metadata-eval N/A

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

   7. lower-/.f64 N/A

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

   8. lower-+.f64 N/A

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

   9. lower-exp.f64 N/A

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

   10. lower-neg.f64 N/A

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

   11. lower-pow.f64 N/A

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

5. Applied rewrites 97.5%

   \[\leadsto \color{blue}{\frac{{\left(1 + \frac{-1}{1 + e^{-s}}\right)}^{c\_n}}{{\left(1 + \frac{-1}{1 + e^{-t}}\right)}^{c\_n}}} \]
6. Step-by-step derivation

7. Applied rewrites 98.6%

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

8. Taylor expanded in s around 0

   \[\leadsto {\left(\frac{\frac{1}{2}}{1 - \frac{1}{1 + e^{\mathsf{neg}\left(t\right)}}}\right)}^{c\_n} \]
9. Step-by-step derivation

10. Applied rewrites 97.7%

    \[\leadsto {\left(\frac{0.5}{1 + \frac{-1}{1 + e^{-t}}}\right)}^{c\_n} \]
11. Add Preprocessing

Alternative 4: 95.7% accurate, 4.0× speedup

Math

\[\begin{array}{l} \\ {\left(\left(1 + \frac{-1}{1 + e^{-s}}\right) \cdot 2\right)}^{c\_n} \end{array} \]

FPCore

(FPCore (c_p c_n t s)
 :precision binary64
 (pow (* (+ 1.0 (/ -1.0 (+ 1.0 (exp (- s))))) 2.0) c_n))

C

double code(double c_p, double c_n, double t, double s) {
	return pow(((1.0 + (-1.0 / (1.0 + exp(-s)))) * 2.0), c_n);
}

Fortran

real(8) function code(c_p, c_n, t, s)
    real(8), intent (in) :: c_p
    real(8), intent (in) :: c_n
    real(8), intent (in) :: t
    real(8), intent (in) :: s
    code = ((1.0d0 + ((-1.0d0) / (1.0d0 + exp(-s)))) * 2.0d0) ** c_n
end function

Java

public static double code(double c_p, double c_n, double t, double s) {
	return Math.pow(((1.0 + (-1.0 / (1.0 + Math.exp(-s)))) * 2.0), c_n);
}

Python

def code(c_p, c_n, t, s):
	return math.pow(((1.0 + (-1.0 / (1.0 + math.exp(-s)))) * 2.0), c_n)

Julia

function code(c_p, c_n, t, s)
	return Float64(Float64(1.0 + Float64(-1.0 / Float64(1.0 + exp(Float64(-s))))) * 2.0) ^ c_n
end

MATLAB

function tmp = code(c_p, c_n, t, s)
	tmp = ((1.0 + (-1.0 / (1.0 + exp(-s)))) * 2.0) ^ c_n;
end

Wolfram

code[c$95$p_, c$95$n_, t_, s_] := N[Power[N[(N[(1.0 + N[(-1.0 / N[(1.0 + N[Exp[(-s)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision], c$95$n], $MachinePrecision]

Derivation

1. Initial program 92.6%

   \[\frac{{\left(\frac{1}{1 + e^{-s}}\right)}^{c\_p} \cdot {\left(1 - \frac{1}{1 + e^{-s}}\right)}^{c\_n}}{{\left(\frac{1}{1 + e^{-t}}\right)}^{c\_p} \cdot {\left(1 - \frac{1}{1 + e^{-t}}\right)}^{c\_n}} \]
2. Add Preprocessing

3. Taylor expanded in c_p around 0

   \[\leadsto \color{blue}{\frac{{\left(1 - \frac{1}{1 + e^{\mathsf{neg}\left(s\right)}}\right)}^{c\_n}}{{\left(1 - \frac{1}{1 + e^{\mathsf{neg}\left(t\right)}}\right)}^{c\_n}}} \]
4. Step-by-step derivation

   1. lower-/.f64 N/A

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

   2. lower-pow.f64 N/A

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

   3. sub-neg N/A

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

   4. lower-+.f64 N/A

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

   5. distribute-neg-frac N/A

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

   6. metadata-eval N/A

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

   7. lower-/.f64 N/A

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

   8. lower-+.f64 N/A

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

   9. lower-exp.f64 N/A

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

   10. lower-neg.f64 N/A

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

   11. lower-pow.f64 N/A

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

5. Applied rewrites 97.5%

   \[\leadsto \color{blue}{\frac{{\left(1 + \frac{-1}{1 + e^{-s}}\right)}^{c\_n}}{{\left(1 + \frac{-1}{1 + e^{-t}}\right)}^{c\_n}}} \]
6. Step-by-step derivation

7. Applied rewrites 98.6%

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

8. Taylor expanded in t around 0

   \[\leadsto {\left(2 \cdot \left(1 + \frac{-1}{1 + e^{\mathsf{neg}\left(s\right)}}\right)\right)}^{c\_n} \]
9. Step-by-step derivation

10. Applied rewrites 96.9%

    \[\leadsto {\left(2 \cdot \left(1 + \frac{-1}{1 + e^{-s}}\right)\right)}^{c\_n} \]

11. Final simplification 96.9%

    \[\leadsto {\left(\left(1 + \frac{-1}{1 + e^{-s}}\right) \cdot 2\right)}^{c\_n} \]
12. Add Preprocessing

Alternative 5: 94.6% accurate, 6.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;c\_n \leq 34000000:\\ \;\;\;\;{\left(\mathsf{fma}\left(t, \mathsf{fma}\left(t, 0.5, 1\right), 2\right) \cdot \left(1 + \mathsf{fma}\left(s, -0.25, -0.5\right)\right)\right)}^{c\_n}\\ \mathbf{else}:\\ \;\;\;\;\frac{{0.5}^{c\_n}}{1}\\ \end{array} \end{array} \]

FPCore

(FPCore (c_p c_n t s)
 :precision binary64
 (if (<= c_n 34000000.0)
   (pow (* (fma t (fma t 0.5 1.0) 2.0) (+ 1.0 (fma s -0.25 -0.5))) c_n)
   (/ (pow 0.5 c_n) 1.0)))

C

double code(double c_p, double c_n, double t, double s) {
	double tmp;
	if (c_n <= 34000000.0) {
		tmp = pow((fma(t, fma(t, 0.5, 1.0), 2.0) * (1.0 + fma(s, -0.25, -0.5))), c_n);
	} else {
		tmp = pow(0.5, c_n) / 1.0;
	}
	return tmp;
}

Julia

function code(c_p, c_n, t, s)
	tmp = 0.0
	if (c_n <= 34000000.0)
		tmp = Float64(fma(t, fma(t, 0.5, 1.0), 2.0) * Float64(1.0 + fma(s, -0.25, -0.5))) ^ c_n;
	else
		tmp = Float64((0.5 ^ c_n) / 1.0);
	end
	return tmp
end

Wolfram

code[c$95$p_, c$95$n_, t_, s_] := If[LessEqual[c$95$n, 34000000.0], N[Power[N[(N[(t * N[(t * 0.5 + 1.0), $MachinePrecision] + 2.0), $MachinePrecision] * N[(1.0 + N[(s * -0.25 + -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], c$95$n], $MachinePrecision], N[(N[Power[0.5, c$95$n], $MachinePrecision] / 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if c_n < 3.4e7

   1. Initial program 95.6%

      \[\frac{{\left(\frac{1}{1 + e^{-s}}\right)}^{c\_p} \cdot {\left(1 - \frac{1}{1 + e^{-s}}\right)}^{c\_n}}{{\left(\frac{1}{1 + e^{-t}}\right)}^{c\_p} \cdot {\left(1 - \frac{1}{1 + e^{-t}}\right)}^{c\_n}} \]
   2. Add Preprocessing

   3. Taylor expanded in c_p around 0

      \[\leadsto \color{blue}{\frac{{\left(1 - \frac{1}{1 + e^{\mathsf{neg}\left(s\right)}}\right)}^{c\_n}}{{\left(1 - \frac{1}{1 + e^{\mathsf{neg}\left(t\right)}}\right)}^{c\_n}}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. lower-pow.f64 N/A

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

      3. sub-neg N/A

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

      4. lower-+.f64 N/A

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

      5. distribute-neg-frac N/A

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

      6. metadata-eval N/A

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

      7. lower-/.f64 N/A

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

      8. lower-+.f64 N/A

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

      9. lower-exp.f64 N/A

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

      10. lower-neg.f64 N/A

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

      11. lower-pow.f64 N/A

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

   5. Applied rewrites 97.8%

      \[\leadsto \color{blue}{\frac{{\left(1 + \frac{-1}{1 + e^{-s}}\right)}^{c\_n}}{{\left(1 + \frac{-1}{1 + e^{-t}}\right)}^{c\_n}}} \]
   6. Step-by-step derivation

   7. Applied rewrites 98.5%

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

   8. Taylor expanded in t around 0

      \[\leadsto {\left(\left(2 + t \cdot \left(1 + \frac{1}{2} \cdot t\right)\right) \cdot \left(1 + \frac{-1}{1 + e^{\mathsf{neg}\left(s\right)}}\right)\right)}^{c\_n} \]
   9. Step-by-step derivation

   10. Applied rewrites 98.5%

       \[\leadsto {\left(\mathsf{fma}\left(t, \mathsf{fma}\left(t, 0.5, 1\right), 2\right) \cdot \left(1 + \frac{-1}{1 + e^{-s}}\right)\right)}^{c\_n} \]

   11. Taylor expanded in s around 0

       \[\leadsto {\left(\mathsf{fma}\left(t, \mathsf{fma}\left(t, \frac{1}{2}, 1\right), 2\right) \cdot \left(1 + \left(\frac{-1}{4} \cdot s - \frac{1}{2}\right)\right)\right)}^{c\_n} \]
   12. Step-by-step derivation

   13. Applied rewrites 98.1%

       \[\leadsto {\left(\mathsf{fma}\left(t, \mathsf{fma}\left(t, 0.5, 1\right), 2\right) \cdot \left(1 + \mathsf{fma}\left(s, -0.25, -0.5\right)\right)\right)}^{c\_n} \]

   if 3.4e7 < c_n

   1. Initial program 11.1%

      \[\frac{{\left(\frac{1}{1 + e^{-s}}\right)}^{c\_p} \cdot {\left(1 - \frac{1}{1 + e^{-s}}\right)}^{c\_n}}{{\left(\frac{1}{1 + e^{-t}}\right)}^{c\_p} \cdot {\left(1 - \frac{1}{1 + e^{-t}}\right)}^{c\_n}} \]
   2. Add Preprocessing

   3. Taylor expanded in c_p around 0

      \[\leadsto \color{blue}{\frac{{\left(1 - \frac{1}{1 + e^{\mathsf{neg}\left(s\right)}}\right)}^{c\_n}}{{\left(1 - \frac{1}{1 + e^{\mathsf{neg}\left(t\right)}}\right)}^{c\_n}}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. lower-pow.f64 N/A

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

      3. sub-neg N/A

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

      4. lower-+.f64 N/A

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

      5. distribute-neg-frac N/A

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

      6. metadata-eval N/A

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

      7. lower-/.f64 N/A

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

      8. lower-+.f64 N/A

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

      9. lower-exp.f64 N/A

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

      10. lower-neg.f64 N/A

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

      11. lower-pow.f64 N/A

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

   5. Applied rewrites 88.9%

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

   6. Taylor expanded in c_n around 0

      \[\leadsto \frac{{\left(1 + \frac{-1}{1 + e^{\mathsf{neg}\left(s\right)}}\right)}^{c\_n}}{1} \]
   7. Step-by-step derivation

   8. Applied rewrites 100.0%

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

   9. Taylor expanded in s around 0

      \[\leadsto \frac{{\frac{1}{2}}^{c\_n}}{1} \]
   10. Step-by-step derivation

   11. Applied rewrites 100.0%

       \[\leadsto \frac{{0.5}^{c\_n}}{1} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 95.1% accurate, 7.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;c\_n \leq 34000000:\\ \;\;\;\;{\left(\mathsf{fma}\left(t, \mathsf{fma}\left(t, 0.5, 1\right), 2\right) \cdot \left(1 + -0.5\right)\right)}^{c\_n}\\ \mathbf{else}:\\ \;\;\;\;\frac{{0.5}^{c\_n}}{1}\\ \end{array} \end{array} \]

FPCore

(FPCore (c_p c_n t s)
 :precision binary64
 (if (<= c_n 34000000.0)
   (pow (* (fma t (fma t 0.5 1.0) 2.0) (+ 1.0 -0.5)) c_n)
   (/ (pow 0.5 c_n) 1.0)))

C

double code(double c_p, double c_n, double t, double s) {
	double tmp;
	if (c_n <= 34000000.0) {
		tmp = pow((fma(t, fma(t, 0.5, 1.0), 2.0) * (1.0 + -0.5)), c_n);
	} else {
		tmp = pow(0.5, c_n) / 1.0;
	}
	return tmp;
}

Julia

function code(c_p, c_n, t, s)
	tmp = 0.0
	if (c_n <= 34000000.0)
		tmp = Float64(fma(t, fma(t, 0.5, 1.0), 2.0) * Float64(1.0 + -0.5)) ^ c_n;
	else
		tmp = Float64((0.5 ^ c_n) / 1.0);
	end
	return tmp
end

Wolfram

code[c$95$p_, c$95$n_, t_, s_] := If[LessEqual[c$95$n, 34000000.0], N[Power[N[(N[(t * N[(t * 0.5 + 1.0), $MachinePrecision] + 2.0), $MachinePrecision] * N[(1.0 + -0.5), $MachinePrecision]), $MachinePrecision], c$95$n], $MachinePrecision], N[(N[Power[0.5, c$95$n], $MachinePrecision] / 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if c_n < 3.4e7

   1. Initial program 95.6%

      \[\frac{{\left(\frac{1}{1 + e^{-s}}\right)}^{c\_p} \cdot {\left(1 - \frac{1}{1 + e^{-s}}\right)}^{c\_n}}{{\left(\frac{1}{1 + e^{-t}}\right)}^{c\_p} \cdot {\left(1 - \frac{1}{1 + e^{-t}}\right)}^{c\_n}} \]
   2. Add Preprocessing

   3. Taylor expanded in c_p around 0

      \[\leadsto \color{blue}{\frac{{\left(1 - \frac{1}{1 + e^{\mathsf{neg}\left(s\right)}}\right)}^{c\_n}}{{\left(1 - \frac{1}{1 + e^{\mathsf{neg}\left(t\right)}}\right)}^{c\_n}}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. lower-pow.f64 N/A

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

      3. sub-neg N/A

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

      4. lower-+.f64 N/A

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

      5. distribute-neg-frac N/A

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

      6. metadata-eval N/A

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

      7. lower-/.f64 N/A

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

      8. lower-+.f64 N/A

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

      9. lower-exp.f64 N/A

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

      10. lower-neg.f64 N/A

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

      11. lower-pow.f64 N/A

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

   5. Applied rewrites 97.8%

      \[\leadsto \color{blue}{\frac{{\left(1 + \frac{-1}{1 + e^{-s}}\right)}^{c\_n}}{{\left(1 + \frac{-1}{1 + e^{-t}}\right)}^{c\_n}}} \]
   6. Step-by-step derivation

   7. Applied rewrites 98.5%

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

   8. Taylor expanded in t around 0

      \[\leadsto {\left(\left(2 + t \cdot \left(1 + \frac{1}{2} \cdot t\right)\right) \cdot \left(1 + \frac{-1}{1 + e^{\mathsf{neg}\left(s\right)}}\right)\right)}^{c\_n} \]
   9. Step-by-step derivation

   10. Applied rewrites 98.5%

       \[\leadsto {\left(\mathsf{fma}\left(t, \mathsf{fma}\left(t, 0.5, 1\right), 2\right) \cdot \left(1 + \frac{-1}{1 + e^{-s}}\right)\right)}^{c\_n} \]

   11. Taylor expanded in s around 0

       \[\leadsto {\left(\mathsf{fma}\left(t, \mathsf{fma}\left(t, \frac{1}{2}, 1\right), 2\right) \cdot \left(1 + \frac{-1}{2}\right)\right)}^{c\_n} \]
   12. Step-by-step derivation

   13. Applied rewrites 98.0%

       \[\leadsto {\left(\mathsf{fma}\left(t, \mathsf{fma}\left(t, 0.5, 1\right), 2\right) \cdot \left(1 + -0.5\right)\right)}^{c\_n} \]

   if 3.4e7 < c_n

   1. Initial program 11.1%

      \[\frac{{\left(\frac{1}{1 + e^{-s}}\right)}^{c\_p} \cdot {\left(1 - \frac{1}{1 + e^{-s}}\right)}^{c\_n}}{{\left(\frac{1}{1 + e^{-t}}\right)}^{c\_p} \cdot {\left(1 - \frac{1}{1 + e^{-t}}\right)}^{c\_n}} \]
   2. Add Preprocessing

   3. Taylor expanded in c_p around 0

      \[\leadsto \color{blue}{\frac{{\left(1 - \frac{1}{1 + e^{\mathsf{neg}\left(s\right)}}\right)}^{c\_n}}{{\left(1 - \frac{1}{1 + e^{\mathsf{neg}\left(t\right)}}\right)}^{c\_n}}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. lower-pow.f64 N/A

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

      3. sub-neg N/A

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

      4. lower-+.f64 N/A

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

      5. distribute-neg-frac N/A

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

      6. metadata-eval N/A

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

      7. lower-/.f64 N/A

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

      8. lower-+.f64 N/A

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

      9. lower-exp.f64 N/A

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

      10. lower-neg.f64 N/A

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

      11. lower-pow.f64 N/A

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

   5. Applied rewrites 88.9%

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

   6. Taylor expanded in c_n around 0

      \[\leadsto \frac{{\left(1 + \frac{-1}{1 + e^{\mathsf{neg}\left(s\right)}}\right)}^{c\_n}}{1} \]
   7. Step-by-step derivation

   8. Applied rewrites 100.0%

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

   9. Taylor expanded in s around 0

      \[\leadsto \frac{{\frac{1}{2}}^{c\_n}}{1} \]
   10. Step-by-step derivation

   11. Applied rewrites 100.0%

       \[\leadsto \frac{{0.5}^{c\_n}}{1} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 7: 95.0% accurate, 7.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;c\_n \leq 34000000:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;\frac{{0.5}^{c\_n}}{1}\\ \end{array} \end{array} \]

FPCore

(FPCore (c_p c_n t s)
 :precision binary64
 (if (<= c_n 34000000.0) 1.0 (/ (pow 0.5 c_n) 1.0)))

C

double code(double c_p, double c_n, double t, double s) {
	double tmp;
	if (c_n <= 34000000.0) {
		tmp = 1.0;
	} else {
		tmp = pow(0.5, c_n) / 1.0;
	}
	return tmp;
}

Fortran

real(8) function code(c_p, c_n, t, s)
    real(8), intent (in) :: c_p
    real(8), intent (in) :: c_n
    real(8), intent (in) :: t
    real(8), intent (in) :: s
    real(8) :: tmp
    if (c_n <= 34000000.0d0) then
        tmp = 1.0d0
    else
        tmp = (0.5d0 ** c_n) / 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double c_p, double c_n, double t, double s) {
	double tmp;
	if (c_n <= 34000000.0) {
		tmp = 1.0;
	} else {
		tmp = Math.pow(0.5, c_n) / 1.0;
	}
	return tmp;
}

Python

def code(c_p, c_n, t, s):
	tmp = 0
	if c_n <= 34000000.0:
		tmp = 1.0
	else:
		tmp = math.pow(0.5, c_n) / 1.0
	return tmp

Julia

function code(c_p, c_n, t, s)
	tmp = 0.0
	if (c_n <= 34000000.0)
		tmp = 1.0;
	else
		tmp = Float64((0.5 ^ c_n) / 1.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(c_p, c_n, t, s)
	tmp = 0.0;
	if (c_n <= 34000000.0)
		tmp = 1.0;
	else
		tmp = (0.5 ^ c_n) / 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[c$95$p_, c$95$n_, t_, s_] := If[LessEqual[c$95$n, 34000000.0], 1.0, N[(N[Power[0.5, c$95$n], $MachinePrecision] / 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if c_n < 3.4e7

   1. Initial program 95.6%

      \[\frac{{\left(\frac{1}{1 + e^{-s}}\right)}^{c\_p} \cdot {\left(1 - \frac{1}{1 + e^{-s}}\right)}^{c\_n}}{{\left(\frac{1}{1 + e^{-t}}\right)}^{c\_p} \cdot {\left(1 - \frac{1}{1 + e^{-t}}\right)}^{c\_n}} \]
   2. Add Preprocessing

   3. Taylor expanded in c_n around 0

      \[\leadsto \color{blue}{\frac{{\left(\frac{1}{1 + e^{\mathsf{neg}\left(s\right)}}\right)}^{c\_p}}{{\left(\frac{1}{1 + e^{\mathsf{neg}\left(t\right)}}\right)}^{c\_p}}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. lower-pow.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-neg.f64 N/A

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

      7. lower-pow.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower-+.f64 N/A

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

      10. lower-exp.f64 N/A

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

      11. lower-neg.f64 95.7

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

   5. Applied rewrites 95.7%

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

   6. Taylor expanded in c_p around 0

      \[\leadsto 1 \]
   7. Step-by-step derivation

   8. Applied rewrites 97.8%

      \[\leadsto 1 \]

   if 3.4e7 < c_n

   1. Initial program 11.1%

      \[\frac{{\left(\frac{1}{1 + e^{-s}}\right)}^{c\_p} \cdot {\left(1 - \frac{1}{1 + e^{-s}}\right)}^{c\_n}}{{\left(\frac{1}{1 + e^{-t}}\right)}^{c\_p} \cdot {\left(1 - \frac{1}{1 + e^{-t}}\right)}^{c\_n}} \]
   2. Add Preprocessing

   3. Taylor expanded in c_p around 0

      \[\leadsto \color{blue}{\frac{{\left(1 - \frac{1}{1 + e^{\mathsf{neg}\left(s\right)}}\right)}^{c\_n}}{{\left(1 - \frac{1}{1 + e^{\mathsf{neg}\left(t\right)}}\right)}^{c\_n}}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. lower-pow.f64 N/A

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

      3. sub-neg N/A

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

      4. lower-+.f64 N/A

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

      5. distribute-neg-frac N/A

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

      6. metadata-eval N/A

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

      7. lower-/.f64 N/A

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

      8. lower-+.f64 N/A

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

      9. lower-exp.f64 N/A

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

      10. lower-neg.f64 N/A

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

      11. lower-pow.f64 N/A

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

   5. Applied rewrites 88.9%

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

   6. Taylor expanded in c_n around 0

      \[\leadsto \frac{{\left(1 + \frac{-1}{1 + e^{\mathsf{neg}\left(s\right)}}\right)}^{c\_n}}{1} \]
   7. Step-by-step derivation

   8. Applied rewrites 100.0%

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

   9. Taylor expanded in s around 0

      \[\leadsto \frac{{\frac{1}{2}}^{c\_n}}{1} \]
   10. Step-by-step derivation

   11. Applied rewrites 100.0%

       \[\leadsto \frac{{0.5}^{c\_n}}{1} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 8: 93.8% accurate, 896.0× speedup

Math

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

FPCore

(FPCore (c_p c_n t s) :precision binary64 1.0)

C

double code(double c_p, double c_n, double t, double s) {
	return 1.0;
}

Fortran

real(8) function code(c_p, c_n, t, s)
    real(8), intent (in) :: c_p
    real(8), intent (in) :: c_n
    real(8), intent (in) :: t
    real(8), intent (in) :: s
    code = 1.0d0
end function

Java

public static double code(double c_p, double c_n, double t, double s) {
	return 1.0;
}

Python

def code(c_p, c_n, t, s):
	return 1.0

Julia

function code(c_p, c_n, t, s)
	return 1.0
end

MATLAB

function tmp = code(c_p, c_n, t, s)
	tmp = 1.0;
end

Wolfram

code[c$95$p_, c$95$n_, t_, s_] := 1.0

Derivation

1. Initial program 92.6%

   \[\frac{{\left(\frac{1}{1 + e^{-s}}\right)}^{c\_p} \cdot {\left(1 - \frac{1}{1 + e^{-s}}\right)}^{c\_n}}{{\left(\frac{1}{1 + e^{-t}}\right)}^{c\_p} \cdot {\left(1 - \frac{1}{1 + e^{-t}}\right)}^{c\_n}} \]
2. Add Preprocessing

3. Taylor expanded in c_n around 0

   \[\leadsto \color{blue}{\frac{{\left(\frac{1}{1 + e^{\mathsf{neg}\left(s\right)}}\right)}^{c\_p}}{{\left(\frac{1}{1 + e^{\mathsf{neg}\left(t\right)}}\right)}^{c\_p}}} \]
4. Step-by-step derivation

   1. lower-/.f64 N/A

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

   2. lower-pow.f64 N/A

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

   3. lower-/.f64 N/A

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

   4. lower-+.f64 N/A

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

   5. lower-exp.f64 N/A

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

   6. lower-neg.f64 N/A

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

   7. lower-pow.f64 N/A

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

   8. lower-/.f64 N/A

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

   9. lower-+.f64 N/A

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

   10. lower-exp.f64 N/A

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

   11. lower-neg.f64 92.4

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

5. Applied rewrites 92.4%

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

6. Taylor expanded in c_p around 0

   \[\leadsto 1 \]
7. Step-by-step derivation

8. Applied rewrites 94.5%

   \[\leadsto 1 \]
9. Add Preprocessing

Developer Target 1: 96.4% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ {\left(\frac{1 + e^{-t}}{1 + e^{-s}}\right)}^{c\_p} \cdot {\left(\frac{1 + e^{t}}{1 + e^{s}}\right)}^{c\_n} \end{array} \]

FPCore

(FPCore (c_p c_n t s)
 :precision binary64
 (*
  (pow (/ (+ 1.0 (exp (- t))) (+ 1.0 (exp (- s)))) c_p)
  (pow (/ (+ 1.0 (exp t)) (+ 1.0 (exp s))) c_n)))

C

double code(double c_p, double c_n, double t, double s) {
	return pow(((1.0 + exp(-t)) / (1.0 + exp(-s))), c_p) * pow(((1.0 + exp(t)) / (1.0 + exp(s))), c_n);
}

Fortran

real(8) function code(c_p, c_n, t, s)
    real(8), intent (in) :: c_p
    real(8), intent (in) :: c_n
    real(8), intent (in) :: t
    real(8), intent (in) :: s
    code = (((1.0d0 + exp(-t)) / (1.0d0 + exp(-s))) ** c_p) * (((1.0d0 + exp(t)) / (1.0d0 + exp(s))) ** c_n)
end function

Java

public static double code(double c_p, double c_n, double t, double s) {
	return Math.pow(((1.0 + Math.exp(-t)) / (1.0 + Math.exp(-s))), c_p) * Math.pow(((1.0 + Math.exp(t)) / (1.0 + Math.exp(s))), c_n);
}

Python

def code(c_p, c_n, t, s):
	return math.pow(((1.0 + math.exp(-t)) / (1.0 + math.exp(-s))), c_p) * math.pow(((1.0 + math.exp(t)) / (1.0 + math.exp(s))), c_n)

Julia

function code(c_p, c_n, t, s)
	return Float64((Float64(Float64(1.0 + exp(Float64(-t))) / Float64(1.0 + exp(Float64(-s)))) ^ c_p) * (Float64(Float64(1.0 + exp(t)) / Float64(1.0 + exp(s))) ^ c_n))
end

MATLAB

function tmp = code(c_p, c_n, t, s)
	tmp = (((1.0 + exp(-t)) / (1.0 + exp(-s))) ^ c_p) * (((1.0 + exp(t)) / (1.0 + exp(s))) ^ c_n);
end

Wolfram

code[c$95$p_, c$95$n_, t_, s_] := N[(N[Power[N[(N[(1.0 + N[Exp[(-t)], $MachinePrecision]), $MachinePrecision] / N[(1.0 + N[Exp[(-s)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], c$95$p], $MachinePrecision] * N[Power[N[(N[(1.0 + N[Exp[t], $MachinePrecision]), $MachinePrecision] / N[(1.0 + N[Exp[s], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], c$95$n], $MachinePrecision]), $MachinePrecision]

Reproduce

herbie shell --seed 2024221 
(FPCore (c_p c_n t s)
  :name "Harley's example"
  :precision binary64
  :pre (and (< 0.0 c_p) (< 0.0 c_n))

  :alt
  (! :herbie-platform default (* (pow (/ (+ 1 (exp (- t))) (+ 1 (exp (- s)))) c_p) (pow (/ (+ 1 (exp t)) (+ 1 (exp s))) c_n)))

  (/ (* (pow (/ 1.0 (+ 1.0 (exp (- s)))) c_p) (pow (- 1.0 (/ 1.0 (+ 1.0 (exp (- s))))) c_n)) (* (pow (/ 1.0 (+ 1.0 (exp (- t)))) c_p) (pow (- 1.0 (/ 1.0 (+ 1.0 (exp (- t))))) c_n))))