Harley's example

Percentage Accurate: 91.4% → 97.8%

Time: 1.3min

Alternatives: 8

Speedup: 896.0×

• could not determine a ground truth

  1. c_p = 1.9784282661360075e-67
  2. c_n = 8.8459753228469e-46
  3. t = -2.906781800712899e+62
  4. s = 5.373626440752983e+45

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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(c_p, c_n, t, s)
use fmin_fmax_functions
    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: 91.4% 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(c_p, c_n, t, s)
use fmin_fmax_functions
    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: 97.8% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := e^{-s}\\ t_2 := t\_1 + 1\\ \mathbf{if}\;s \leq -750000000:\\ \;\;\;\;\frac{{t\_2}^{\left(-c\_p\right)}}{1}\\ \mathbf{elif}\;s \leq 3.4 \cdot 10^{-5}:\\ \;\;\;\;1 + c\_n \cdot \log \left(\frac{1 - {\left(1 + t\_1\right)}^{-1}}{1 - {\left(1 + e^{-t}\right)}^{-1}}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{{\left(1 - \frac{1}{t\_2}\right)}^{c\_n}}{1}\\ \end{array} \end{array} \]

FPCore

(FPCore (c_p c_n t s)
 :precision binary64
 (let* ((t_1 (exp (- s))) (t_2 (+ t_1 1.0)))
   (if (<= s -750000000.0)
     (/ (pow t_2 (- c_p)) 1.0)
     (if (<= s 3.4e-5)
       (+
        1.0
        (*
         c_n
         (log
          (/
           (- 1.0 (pow (+ 1.0 t_1) -1.0))
           (- 1.0 (pow (+ 1.0 (exp (- t))) -1.0))))))
       (/ (pow (- 1.0 (/ 1.0 t_2)) c_n) 1.0)))))

C

double code(double c_p, double c_n, double t, double s) {
	double t_1 = exp(-s);
	double t_2 = t_1 + 1.0;
	double tmp;
	if (s <= -750000000.0) {
		tmp = pow(t_2, -c_p) / 1.0;
	} else if (s <= 3.4e-5) {
		tmp = 1.0 + (c_n * log(((1.0 - pow((1.0 + t_1), -1.0)) / (1.0 - pow((1.0 + exp(-t)), -1.0)))));
	} else {
		tmp = pow((1.0 - (1.0 / t_2)), c_n) / 1.0;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(c_p, c_n, t, s)
use fmin_fmax_functions
    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
    real(8) :: tmp
    t_1 = exp(-s)
    t_2 = t_1 + 1.0d0
    if (s <= (-750000000.0d0)) then
        tmp = (t_2 ** -c_p) / 1.0d0
    else if (s <= 3.4d-5) then
        tmp = 1.0d0 + (c_n * log(((1.0d0 - ((1.0d0 + t_1) ** (-1.0d0))) / (1.0d0 - ((1.0d0 + exp(-t)) ** (-1.0d0))))))
    else
        tmp = ((1.0d0 - (1.0d0 / t_2)) ** 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 t_1 = Math.exp(-s);
	double t_2 = t_1 + 1.0;
	double tmp;
	if (s <= -750000000.0) {
		tmp = Math.pow(t_2, -c_p) / 1.0;
	} else if (s <= 3.4e-5) {
		tmp = 1.0 + (c_n * Math.log(((1.0 - Math.pow((1.0 + t_1), -1.0)) / (1.0 - Math.pow((1.0 + Math.exp(-t)), -1.0)))));
	} else {
		tmp = Math.pow((1.0 - (1.0 / t_2)), c_n) / 1.0;
	}
	return tmp;
}

Python

def code(c_p, c_n, t, s):
	t_1 = math.exp(-s)
	t_2 = t_1 + 1.0
	tmp = 0
	if s <= -750000000.0:
		tmp = math.pow(t_2, -c_p) / 1.0
	elif s <= 3.4e-5:
		tmp = 1.0 + (c_n * math.log(((1.0 - math.pow((1.0 + t_1), -1.0)) / (1.0 - math.pow((1.0 + math.exp(-t)), -1.0)))))
	else:
		tmp = math.pow((1.0 - (1.0 / t_2)), c_n) / 1.0
	return tmp

Julia

function code(c_p, c_n, t, s)
	t_1 = exp(Float64(-s))
	t_2 = Float64(t_1 + 1.0)
	tmp = 0.0
	if (s <= -750000000.0)
		tmp = Float64((t_2 ^ Float64(-c_p)) / 1.0);
	elseif (s <= 3.4e-5)
		tmp = Float64(1.0 + Float64(c_n * log(Float64(Float64(1.0 - (Float64(1.0 + t_1) ^ -1.0)) / Float64(1.0 - (Float64(1.0 + exp(Float64(-t))) ^ -1.0))))));
	else
		tmp = Float64((Float64(1.0 - Float64(1.0 / t_2)) ^ c_n) / 1.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(c_p, c_n, t, s)
	t_1 = exp(-s);
	t_2 = t_1 + 1.0;
	tmp = 0.0;
	if (s <= -750000000.0)
		tmp = (t_2 ^ -c_p) / 1.0;
	elseif (s <= 3.4e-5)
		tmp = 1.0 + (c_n * log(((1.0 - ((1.0 + t_1) ^ -1.0)) / (1.0 - ((1.0 + exp(-t)) ^ -1.0)))));
	else
		tmp = ((1.0 - (1.0 / t_2)) ^ c_n) / 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if s < -7.5e8

   1. Initial program 50.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_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 \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}}} \]

      2. inv-pow N/A

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

      3. pow-pow N/A

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

      4. lower-pow.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. lift-exp.f64 N/A

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

      8. lift-neg.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. inv-pow N/A

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

      11. pow-pow N/A

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

      12. lower-pow.f64 N/A

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

   5. Applied rewrites 50.0%

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

   6. Taylor expanded in c_p around 0

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

   8. Applied rewrites 100.0%

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

      1. lift-*.f64 N/A

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

      2. mul-1-neg N/A

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

      3. lower-neg.f64 100.0

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

   10. Applied rewrites 100.0%

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

   if -7.5e8 < s < 3.4e-5

   1. Initial program 93.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}}} \]

   5. Applied rewrites 97.9%

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

   6. Taylor expanded in c_n around 0

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

      1. lower-+.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. diff-log N/A

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

      4. lower-log.f64 N/A

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

      5. lower-/.f64 N/A

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

   8. Applied rewrites 98.7%

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

   if 3.4e-5 < s

   1. Initial program 60.3%

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

   5. Applied rewrites 80.3%

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

   6. Taylor expanded in c_n around 0

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

   8. Applied rewrites 90.3%

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

      1. lift-pow.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-neg.f64 N/A

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

      4. lift-exp.f64 N/A

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

      5. unpow-1 N/A

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

      6. lower-/.f64 N/A

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

      7. lift-exp.f64 N/A

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

      8. lift-neg.f64 N/A

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

      9. lift-+.f64 90.3

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

   10. Applied rewrites 90.3%

       \[\leadsto \frac{{\left(1 - \frac{1}{e^{-s} + 1}\right)}^{c\_n}}{1} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 2: 96.2% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := e^{-s} + 1\\ \mathbf{if}\;-s \leq 10000000:\\ \;\;\;\;\frac{{\left(1 - {t\_1}^{-1}\right)}^{c\_n}}{{\left(1 - {\left(e^{-t} + 1\right)}^{-1}\right)}^{c\_n}}\\ \mathbf{else}:\\ \;\;\;\;\frac{{t\_1}^{\left(-c\_p\right)}}{1}\\ \end{array} \end{array} \]

FPCore

(FPCore (c_p c_n t s)
 :precision binary64
 (let* ((t_1 (+ (exp (- s)) 1.0)))
   (if (<= (- s) 10000000.0)
     (/
      (pow (- 1.0 (pow t_1 -1.0)) c_n)
      (pow (- 1.0 (pow (+ (exp (- t)) 1.0) -1.0)) c_n))
     (/ (pow t_1 (- c_p)) 1.0))))

C

double code(double c_p, double c_n, double t, double s) {
	double t_1 = exp(-s) + 1.0;
	double tmp;
	if (-s <= 10000000.0) {
		tmp = pow((1.0 - pow(t_1, -1.0)), c_n) / pow((1.0 - pow((exp(-t) + 1.0), -1.0)), c_n);
	} else {
		tmp = pow(t_1, -c_p) / 1.0;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(c_p, c_n, t, s)
use fmin_fmax_functions
    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) :: tmp
    t_1 = exp(-s) + 1.0d0
    if (-s <= 10000000.0d0) then
        tmp = ((1.0d0 - (t_1 ** (-1.0d0))) ** c_n) / ((1.0d0 - ((exp(-t) + 1.0d0) ** (-1.0d0))) ** c_n)
    else
        tmp = (t_1 ** -c_p) / 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double c_p, double c_n, double t, double s) {
	double t_1 = Math.exp(-s) + 1.0;
	double tmp;
	if (-s <= 10000000.0) {
		tmp = Math.pow((1.0 - Math.pow(t_1, -1.0)), c_n) / Math.pow((1.0 - Math.pow((Math.exp(-t) + 1.0), -1.0)), c_n);
	} else {
		tmp = Math.pow(t_1, -c_p) / 1.0;
	}
	return tmp;
}

Python

def code(c_p, c_n, t, s):
	t_1 = math.exp(-s) + 1.0
	tmp = 0
	if -s <= 10000000.0:
		tmp = math.pow((1.0 - math.pow(t_1, -1.0)), c_n) / math.pow((1.0 - math.pow((math.exp(-t) + 1.0), -1.0)), c_n)
	else:
		tmp = math.pow(t_1, -c_p) / 1.0
	return tmp

Julia

function code(c_p, c_n, t, s)
	t_1 = Float64(exp(Float64(-s)) + 1.0)
	tmp = 0.0
	if (Float64(-s) <= 10000000.0)
		tmp = Float64((Float64(1.0 - (t_1 ^ -1.0)) ^ c_n) / (Float64(1.0 - (Float64(exp(Float64(-t)) + 1.0) ^ -1.0)) ^ c_n));
	else
		tmp = Float64((t_1 ^ Float64(-c_p)) / 1.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(c_p, c_n, t, s)
	t_1 = exp(-s) + 1.0;
	tmp = 0.0;
	if (-s <= 10000000.0)
		tmp = ((1.0 - (t_1 ^ -1.0)) ^ c_n) / ((1.0 - ((exp(-t) + 1.0) ^ -1.0)) ^ c_n);
	else
		tmp = (t_1 ^ -c_p) / 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (neg.f64 s) < 1e7

   1. Initial program 92.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}}} \]

   5. Applied rewrites 97.2%

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

   if 1e7 < (neg.f64 s)

   1. Initial program 50.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_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 \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}}} \]

      2. inv-pow N/A

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

      3. pow-pow N/A

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

      4. lower-pow.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. lift-exp.f64 N/A

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

      8. lift-neg.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. inv-pow N/A

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

      11. pow-pow N/A

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

      12. lower-pow.f64 N/A

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

   5. Applied rewrites 50.0%

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

   6. Taylor expanded in c_p around 0

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

   8. Applied rewrites 100.0%

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

      1. lift-*.f64 N/A

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

      2. mul-1-neg N/A

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

      3. lower-neg.f64 100.0

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

   10. Applied rewrites 100.0%

       \[\leadsto \color{blue}{\frac{{\left(e^{-s} + 1\right)}^{\left(-c\_p\right)}}{1}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 98.1% accurate, 3.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := e^{-s} + 1\\ \mathbf{if}\;s \leq -750000000:\\ \;\;\;\;\frac{{t\_1}^{\left(-c\_p\right)}}{1}\\ \mathbf{elif}\;s \leq 3.4 \cdot 10^{-5}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;\frac{{\left(1 - \frac{1}{t\_1}\right)}^{c\_n}}{1}\\ \end{array} \end{array} \]

FPCore

(FPCore (c_p c_n t s)
 :precision binary64
 (let* ((t_1 (+ (exp (- s)) 1.0)))
   (if (<= s -750000000.0)
     (/ (pow t_1 (- c_p)) 1.0)
     (if (<= s 3.4e-5) 1.0 (/ (pow (- 1.0 (/ 1.0 t_1)) c_n) 1.0)))))

C

double code(double c_p, double c_n, double t, double s) {
	double t_1 = exp(-s) + 1.0;
	double tmp;
	if (s <= -750000000.0) {
		tmp = pow(t_1, -c_p) / 1.0;
	} else if (s <= 3.4e-5) {
		tmp = 1.0;
	} else {
		tmp = pow((1.0 - (1.0 / t_1)), c_n) / 1.0;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(c_p, c_n, t, s)
use fmin_fmax_functions
    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) :: tmp
    t_1 = exp(-s) + 1.0d0
    if (s <= (-750000000.0d0)) then
        tmp = (t_1 ** -c_p) / 1.0d0
    else if (s <= 3.4d-5) then
        tmp = 1.0d0
    else
        tmp = ((1.0d0 - (1.0d0 / t_1)) ** 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 t_1 = Math.exp(-s) + 1.0;
	double tmp;
	if (s <= -750000000.0) {
		tmp = Math.pow(t_1, -c_p) / 1.0;
	} else if (s <= 3.4e-5) {
		tmp = 1.0;
	} else {
		tmp = Math.pow((1.0 - (1.0 / t_1)), c_n) / 1.0;
	}
	return tmp;
}

Python

def code(c_p, c_n, t, s):
	t_1 = math.exp(-s) + 1.0
	tmp = 0
	if s <= -750000000.0:
		tmp = math.pow(t_1, -c_p) / 1.0
	elif s <= 3.4e-5:
		tmp = 1.0
	else:
		tmp = math.pow((1.0 - (1.0 / t_1)), c_n) / 1.0
	return tmp

Julia

function code(c_p, c_n, t, s)
	t_1 = Float64(exp(Float64(-s)) + 1.0)
	tmp = 0.0
	if (s <= -750000000.0)
		tmp = Float64((t_1 ^ Float64(-c_p)) / 1.0);
	elseif (s <= 3.4e-5)
		tmp = 1.0;
	else
		tmp = Float64((Float64(1.0 - Float64(1.0 / t_1)) ^ c_n) / 1.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(c_p, c_n, t, s)
	t_1 = exp(-s) + 1.0;
	tmp = 0.0;
	if (s <= -750000000.0)
		tmp = (t_1 ^ -c_p) / 1.0;
	elseif (s <= 3.4e-5)
		tmp = 1.0;
	else
		tmp = ((1.0 - (1.0 / t_1)) ^ c_n) / 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[c$95$p_, c$95$n_, t_, s_] := Block[{t$95$1 = N[(N[Exp[(-s)], $MachinePrecision] + 1.0), $MachinePrecision]}, If[LessEqual[s, -750000000.0], N[(N[Power[t$95$1, (-c$95$p)], $MachinePrecision] / 1.0), $MachinePrecision], If[LessEqual[s, 3.4e-5], 1.0, N[(N[Power[N[(1.0 - N[(1.0 / t$95$1), $MachinePrecision]), $MachinePrecision], c$95$n], $MachinePrecision] / 1.0), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if s < -7.5e8

   1. Initial program 50.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_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 \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}}} \]

      2. inv-pow N/A

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

      3. pow-pow N/A

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

      4. lower-pow.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. lift-exp.f64 N/A

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

      8. lift-neg.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. inv-pow N/A

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

      11. pow-pow N/A

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

      12. lower-pow.f64 N/A

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

   5. Applied rewrites 50.0%

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

   6. Taylor expanded in c_p around 0

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

   8. Applied rewrites 100.0%

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

      1. lift-*.f64 N/A

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

      2. mul-1-neg N/A

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

      3. lower-neg.f64 100.0

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

   10. Applied rewrites 100.0%

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

   if -7.5e8 < s < 3.4e-5

   1. Initial program 93.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}}} \]

   5. Applied rewrites 97.9%

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

   6. Taylor expanded in c_n around 0

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

   8. Applied rewrites 98.5%

      \[\leadsto 1 \]

   if 3.4e-5 < s

   1. Initial program 60.3%

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

   5. Applied rewrites 80.3%

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

   6. Taylor expanded in c_n around 0

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

   8. Applied rewrites 90.3%

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

      1. lift-pow.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-neg.f64 N/A

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

      4. lift-exp.f64 N/A

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

      5. unpow-1 N/A

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

      6. lower-/.f64 N/A

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

      7. lift-exp.f64 N/A

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

      8. lift-neg.f64 N/A

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

      9. lift-+.f64 90.3

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

   10. Applied rewrites 90.3%

       \[\leadsto \frac{{\left(1 - \frac{1}{e^{-s} + 1}\right)}^{c\_n}}{1} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 4: 97.3% accurate, 4.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;s \leq -750000000:\\ \;\;\;\;\frac{{\left(e^{-s} + 1\right)}^{\left(-c\_p\right)}}{1}\\ \mathbf{elif}\;s \leq 10^{-19}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;\frac{{\left(\left(s \cdot s\right) \cdot 0.5\right)}^{\left(-c\_p\right)}}{1}\\ \end{array} \end{array} \]

FPCore

(FPCore (c_p c_n t s)
 :precision binary64
 (if (<= s -750000000.0)
   (/ (pow (+ (exp (- s)) 1.0) (- c_p)) 1.0)
   (if (<= s 1e-19) 1.0 (/ (pow (* (* s s) 0.5) (- c_p)) 1.0))))

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(c_p, c_n, t, s)
use fmin_fmax_functions
    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 (s <= (-750000000.0d0)) then
        tmp = ((exp(-s) + 1.0d0) ** -c_p) / 1.0d0
    else if (s <= 1d-19) then
        tmp = 1.0d0
    else
        tmp = (((s * s) * 0.5d0) ** -c_p) / 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 (s <= -750000000.0) {
		tmp = Math.pow((Math.exp(-s) + 1.0), -c_p) / 1.0;
	} else if (s <= 1e-19) {
		tmp = 1.0;
	} else {
		tmp = Math.pow(((s * s) * 0.5), -c_p) / 1.0;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

function tmp_2 = code(c_p, c_n, t, s)
	tmp = 0.0;
	if (s <= -750000000.0)
		tmp = ((exp(-s) + 1.0) ^ -c_p) / 1.0;
	elseif (s <= 1e-19)
		tmp = 1.0;
	else
		tmp = (((s * s) * 0.5) ^ -c_p) / 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[c$95$p_, c$95$n_, t_, s_] := If[LessEqual[s, -750000000.0], N[(N[Power[N[(N[Exp[(-s)], $MachinePrecision] + 1.0), $MachinePrecision], (-c$95$p)], $MachinePrecision] / 1.0), $MachinePrecision], If[LessEqual[s, 1e-19], 1.0, N[(N[Power[N[(N[(s * s), $MachinePrecision] * 0.5), $MachinePrecision], (-c$95$p)], $MachinePrecision] / 1.0), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if s < -7.5e8

   1. Initial program 50.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_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 \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}}} \]

      2. inv-pow N/A

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

      3. pow-pow N/A

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

      4. lower-pow.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. lift-exp.f64 N/A

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

      8. lift-neg.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. inv-pow N/A

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

      11. pow-pow N/A

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

      12. lower-pow.f64 N/A

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

   5. Applied rewrites 50.0%

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

   6. Taylor expanded in c_p around 0

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

   8. Applied rewrites 100.0%

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

      1. lift-*.f64 N/A

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

      2. mul-1-neg N/A

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

      3. lower-neg.f64 100.0

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

   10. Applied rewrites 100.0%

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

   if -7.5e8 < s < 9.9999999999999998e-20

   1. Initial program 93.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}}} \]

   5. Applied rewrites 98.2%

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

   6. Taylor expanded in c_n around 0

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

   8. Applied rewrites 99.0%

      \[\leadsto 1 \]

   if 9.9999999999999998e-20 < s

   1. Initial program 70.8%

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

      2. inv-pow N/A

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

      3. pow-pow N/A

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

      4. lower-pow.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. lift-exp.f64 N/A

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

      8. lift-neg.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. inv-pow N/A

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

      11. pow-pow N/A

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

      12. lower-pow.f64 N/A

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

   5. Applied rewrites 46.8%

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

   6. Taylor expanded in c_p around 0

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

   8. Applied rewrites 47.1%

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

   9. Taylor expanded in s around 0

      \[\leadsto \frac{{\left(2 + s \cdot \left(\frac{1}{2} \cdot s - 1\right)\right)}^{\left(-1 \cdot c\_p\right)}}{1} \]
   10. Step-by-step derivation

       1. lower-+.f64 N/A

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

       2. lower-*.f64 N/A

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

       3. lower--.f64 N/A

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

       4. lower-*.f64 75.6

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

   11. Applied rewrites 75.6%

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

   12. Taylor expanded in s around inf

       \[\leadsto \frac{{\left(\frac{1}{2} \cdot {s}^{2}\right)}^{\left(-1 \cdot c\_p\right)}}{1} \]
   13. Step-by-step derivation

       1. *-commutative N/A

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

       2. lower-*.f64 N/A

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

       3. unpow2 N/A

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

       4. lower-*.f64 81.3

          \[\leadsto \frac{{\left(\left(s \cdot s\right) \cdot 0.5\right)}^{\left(-1 \cdot c\_p\right)}}{1} \]

   14. Applied rewrites 81.3%

       \[\leadsto \frac{{\left(\left(s \cdot s\right) \cdot 0.5\right)}^{\left(-1 \cdot c\_p\right)}}{1} \]
3. Recombined 3 regimes into one program.

4. Final simplification 97.8%

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

Alternative 5: 95.2% accurate, 6.2× speedup

Math

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

FPCore

(FPCore (c_p c_n t s)
 :precision binary64
 (if (<= c_n 5e-13)
   1.0
   (/
    (pow
     (+ 2.0 (* s (- (* s (+ 0.5 (* -0.16666666666666666 s))) 1.0)))
     (- c_p))
    1.0)))

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(c_p, c_n, t, s)
use fmin_fmax_functions
    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 <= 5d-13) then
        tmp = 1.0d0
    else
        tmp = ((2.0d0 + (s * ((s * (0.5d0 + ((-0.16666666666666666d0) * s))) - 1.0d0))) ** -c_p) / 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 <= 5e-13) {
		tmp = 1.0;
	} else {
		tmp = Math.pow((2.0 + (s * ((s * (0.5 + (-0.16666666666666666 * s))) - 1.0))), -c_p) / 1.0;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

code[c$95$p_, c$95$n_, t_, s_] := If[LessEqual[c$95$n, 5e-13], 1.0, N[(N[Power[N[(2.0 + N[(s * N[(N[(s * N[(0.5 + N[(-0.16666666666666666 * s), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], (-c$95$p)], $MachinePrecision] / 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if c_n < 4.9999999999999999e-13

   1. Initial program 94.8%

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

   5. Applied rewrites 97.0%

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

   6. Taylor expanded in c_n around 0

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

   8. Applied rewrites 97.4%

      \[\leadsto 1 \]

   if 4.9999999999999999e-13 < c_n

   1. Initial program 62.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_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 \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}}} \]

      2. inv-pow N/A

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

      3. pow-pow N/A

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

      4. lower-pow.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. lift-exp.f64 N/A

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

      8. lift-neg.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. inv-pow N/A

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

      11. pow-pow N/A

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

      12. lower-pow.f64 N/A

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

   5. Applied rewrites 58.2%

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

   6. Taylor expanded in c_p around 0

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

   8. Applied rewrites 61.8%

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

   9. Taylor expanded in s around 0

      \[\leadsto \frac{{\left(2 + s \cdot \left(s \cdot \left(\frac{1}{2} + \frac{-1}{6} \cdot s\right) - 1\right)\right)}^{\left(-1 \cdot c\_p\right)}}{1} \]
   10. Step-by-step derivation

       1. lower-+.f64 N/A

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

       2. lower-*.f64 N/A

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

       3. lower--.f64 N/A

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

       4. lower-*.f64 N/A

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

       5. lower-+.f64 N/A

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

       6. lower-*.f64 84.3

          \[\leadsto \frac{{\left(2 + s \cdot \left(s \cdot \left(0.5 + -0.16666666666666666 \cdot s\right) - 1\right)\right)}^{\left(-1 \cdot c\_p\right)}}{1} \]

   11. Applied rewrites 84.3%

       \[\leadsto \frac{{\left(2 + s \cdot \left(s \cdot \left(0.5 + -0.16666666666666666 \cdot s\right) - 1\right)\right)}^{\left(-1 \cdot c\_p\right)}}{1} \]
3. Recombined 2 regimes into one program.

4. Final simplification 95.9%

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

Alternative 6: 96.9% accurate, 6.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;s \leq -20000000 \lor \neg \left(s \leq 10^{-19}\right):\\ \;\;\;\;\frac{{\left(\left(s \cdot s\right) \cdot 0.5\right)}^{\left(-c\_p\right)}}{1}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (c_p c_n t s)
 :precision binary64
 (if (or (<= s -20000000.0) (not (<= s 1e-19)))
   (/ (pow (* (* s s) 0.5) (- c_p)) 1.0)
   1.0))

C

double code(double c_p, double c_n, double t, double s) {
	double tmp;
	if ((s <= -20000000.0) || !(s <= 1e-19)) {
		tmp = pow(((s * s) * 0.5), -c_p) / 1.0;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(c_p, c_n, t, s)
use fmin_fmax_functions
    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 ((s <= (-20000000.0d0)) .or. (.not. (s <= 1d-19))) then
        tmp = (((s * s) * 0.5d0) ** -c_p) / 1.0d0
    else
        tmp = 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 ((s <= -20000000.0) || !(s <= 1e-19)) {
		tmp = Math.pow(((s * s) * 0.5), -c_p) / 1.0;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(c_p, c_n, t, s):
	tmp = 0
	if (s <= -20000000.0) or not (s <= 1e-19):
		tmp = math.pow(((s * s) * 0.5), -c_p) / 1.0
	else:
		tmp = 1.0
	return tmp

Julia

function code(c_p, c_n, t, s)
	tmp = 0.0
	if ((s <= -20000000.0) || !(s <= 1e-19))
		tmp = Float64((Float64(Float64(s * s) * 0.5) ^ Float64(-c_p)) / 1.0);
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(c_p, c_n, t, s)
	tmp = 0.0;
	if ((s <= -20000000.0) || ~((s <= 1e-19)))
		tmp = (((s * s) * 0.5) ^ -c_p) / 1.0;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[c$95$p_, c$95$n_, t_, s_] := If[Or[LessEqual[s, -20000000.0], N[Not[LessEqual[s, 1e-19]], $MachinePrecision]], N[(N[Power[N[(N[(s * s), $MachinePrecision] * 0.5), $MachinePrecision], (-c$95$p)], $MachinePrecision] / 1.0), $MachinePrecision], 1.0]

Derivation

1. Split input into 2 regimes

2. if s < -2e7 or 9.9999999999999998e-20 < s

   1. Initial program 65.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_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 \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}}} \]

      2. inv-pow N/A

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

      3. pow-pow N/A

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

      4. lower-pow.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. lift-exp.f64 N/A

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

      8. lift-neg.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. inv-pow N/A

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

      11. pow-pow N/A

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

      12. lower-pow.f64 N/A

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

   5. Applied rewrites 47.6%

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

   6. Taylor expanded in c_p around 0

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

   8. Applied rewrites 60.9%

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

   9. Taylor expanded in s around 0

      \[\leadsto \frac{{\left(2 + s \cdot \left(\frac{1}{2} \cdot s - 1\right)\right)}^{\left(-1 \cdot c\_p\right)}}{1} \]
   10. Step-by-step derivation

       1. lower-+.f64 N/A

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

       2. lower-*.f64 N/A

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

       3. lower--.f64 N/A

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

       4. lower-*.f64 77.7

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

   11. Applied rewrites 77.7%

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

   12. Taylor expanded in s around inf

       \[\leadsto \frac{{\left(\frac{1}{2} \cdot {s}^{2}\right)}^{\left(-1 \cdot c\_p\right)}}{1} \]
   13. Step-by-step derivation

       1. *-commutative N/A

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

       2. lower-*.f64 N/A

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

       3. unpow2 N/A

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

       4. lower-*.f64 82.0

          \[\leadsto \frac{{\left(\left(s \cdot s\right) \cdot 0.5\right)}^{\left(-1 \cdot c\_p\right)}}{1} \]

   14. Applied rewrites 82.0%

       \[\leadsto \frac{{\left(\left(s \cdot s\right) \cdot 0.5\right)}^{\left(-1 \cdot c\_p\right)}}{1} \]

   if -2e7 < s < 9.9999999999999998e-20

   1. Initial program 93.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}}} \]

   5. Applied rewrites 98.2%

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

   6. Taylor expanded in c_n around 0

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

   8. Applied rewrites 99.0%

      \[\leadsto 1 \]
3. Recombined 2 regimes into one program.

4. Final simplification 97.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;s \leq -20000000 \lor \neg \left(s \leq 10^{-19}\right):\\ \;\;\;\;\frac{{\left(\left(s \cdot s\right) \cdot 0.5\right)}^{\left(-c\_p\right)}}{1}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 95.5% accurate, 7.5× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(c_p, c_n, t, s)
use fmin_fmax_functions
    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 <= (-0.005d0)) then
        tmp = (0.5d0 ** c_n) / 1.0d0
    else
        tmp = 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 <= -0.005) {
		tmp = Math.pow(0.5, c_n) / 1.0;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -0.0050000000000000001

   1. Initial program 11.8%

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

   5. Applied rewrites 78.5%

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

   6. Taylor expanded in s around 0

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

   8. Applied rewrites 78.5%

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

   9. Taylor expanded in t around 0

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

       1. lower-+.f64 N/A

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

       2. lower-*.f64 N/A

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

       3. lower-*.f64 N/A

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

       4. lower-*.f64 N/A

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

       5. lower-pow.f64 N/A

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

       6. lower-pow.f64 22.9

          \[\leadsto \frac{{0.5}^{c\_n}}{-0.5 \cdot \left(c\_n \cdot \left(t \cdot {0.5}^{c\_n}\right)\right) + {0.5}^{c\_n}} \]

   11. Applied rewrites 22.9%

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

   12. Taylor expanded in c_n around 0

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

   14. Applied rewrites 78.5%

       \[\leadsto \frac{{0.5}^{c\_n}}{1} \]

   if -0.0050000000000000001 < t

   1. Initial program 93.9%

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

   5. Applied rewrites 95.6%

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

   6. Taylor expanded in c_n around 0

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

   8. Applied rewrites 95.8%

      \[\leadsto 1 \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(c_p, c_n, t, s)
use fmin_fmax_functions
    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 91.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}}} \]

5. Applied rewrites 95.0%

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

6. Taylor expanded in c_n around 0

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

8. Applied rewrites 93.3%

   \[\leadsto 1 \]
9. Add Preprocessing

Reproduce

herbie shell --seed 2025065 
(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))))