Maksimov and Kolovsky, Equation (32)

Percentage Accurate: 75.5% → 96.6%

Time: 9.0s

Alternatives: 8

Speedup: 1.1×

Specification

Math

\[\begin{array}{l} \\ \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \end{array} \]

FPCore

(FPCore (K m n M l)
 :precision binary64
 (*
  (cos (- (/ (* K (+ m n)) 2.0) M))
  (exp (- (- (pow (- (/ (+ m n) 2.0) M) 2.0)) (- l (fabs (- m n)))))))

C

double code(double K, double m, double n, double M, double l) {
	return cos((((K * (m + n)) / 2.0) - M)) * exp((-pow((((m + n) / 2.0) - M), 2.0) - (l - fabs((m - 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(k, m, n, m_1, l)
use fmin_fmax_functions
    real(8), intent (in) :: k
    real(8), intent (in) :: m
    real(8), intent (in) :: n
    real(8), intent (in) :: m_1
    real(8), intent (in) :: l
    code = cos((((k * (m + n)) / 2.0d0) - m_1)) * exp((-((((m + n) / 2.0d0) - m_1) ** 2.0d0) - (l - abs((m - n)))))
end function

Java

public static double code(double K, double m, double n, double M, double l) {
	return Math.cos((((K * (m + n)) / 2.0) - M)) * Math.exp((-Math.pow((((m + n) / 2.0) - M), 2.0) - (l - Math.abs((m - n)))));
}

Python

def code(K, m, n, M, l):
	return math.cos((((K * (m + n)) / 2.0) - M)) * math.exp((-math.pow((((m + n) / 2.0) - M), 2.0) - (l - math.fabs((m - n)))))

Julia

function code(K, m, n, M, l)
	return Float64(cos(Float64(Float64(Float64(K * Float64(m + n)) / 2.0) - M)) * exp(Float64(Float64(-(Float64(Float64(Float64(m + n) / 2.0) - M) ^ 2.0)) - Float64(l - abs(Float64(m - n))))))
end

MATLAB

function tmp = code(K, m, n, M, l)
	tmp = cos((((K * (m + n)) / 2.0) - M)) * exp((-((((m + n) / 2.0) - M) ^ 2.0) - (l - abs((m - n)))));
end

Wolfram

code[K_, m_, n_, M_, l_] := N[(N[Cos[N[(N[(N[(K * N[(m + n), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision] - M), $MachinePrecision]], $MachinePrecision] * N[Exp[N[((-N[Power[N[(N[(N[(m + n), $MachinePrecision] / 2.0), $MachinePrecision] - M), $MachinePrecision], 2.0], $MachinePrecision]) - N[(l - N[Abs[N[(m - n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Initial Program: 75.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \end{array} \]

FPCore

(FPCore (K m n M l)
 :precision binary64
 (*
  (cos (- (/ (* K (+ m n)) 2.0) M))
  (exp (- (- (pow (- (/ (+ m n) 2.0) M) 2.0)) (- l (fabs (- m n)))))))

C

double code(double K, double m, double n, double M, double l) {
	return cos((((K * (m + n)) / 2.0) - M)) * exp((-pow((((m + n) / 2.0) - M), 2.0) - (l - fabs((m - 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(k, m, n, m_1, l)
use fmin_fmax_functions
    real(8), intent (in) :: k
    real(8), intent (in) :: m
    real(8), intent (in) :: n
    real(8), intent (in) :: m_1
    real(8), intent (in) :: l
    code = cos((((k * (m + n)) / 2.0d0) - m_1)) * exp((-((((m + n) / 2.0d0) - m_1) ** 2.0d0) - (l - abs((m - n)))))
end function

Java

public static double code(double K, double m, double n, double M, double l) {
	return Math.cos((((K * (m + n)) / 2.0) - M)) * Math.exp((-Math.pow((((m + n) / 2.0) - M), 2.0) - (l - Math.abs((m - n)))));
}

Python

def code(K, m, n, M, l):
	return math.cos((((K * (m + n)) / 2.0) - M)) * math.exp((-math.pow((((m + n) / 2.0) - M), 2.0) - (l - math.fabs((m - n)))))

Julia

function code(K, m, n, M, l)
	return Float64(cos(Float64(Float64(Float64(K * Float64(m + n)) / 2.0) - M)) * exp(Float64(Float64(-(Float64(Float64(Float64(m + n) / 2.0) - M) ^ 2.0)) - Float64(l - abs(Float64(m - n))))))
end

MATLAB

function tmp = code(K, m, n, M, l)
	tmp = cos((((K * (m + n)) / 2.0) - M)) * exp((-((((m + n) / 2.0) - M) ^ 2.0) - (l - abs((m - n)))));
end

Wolfram

code[K_, m_, n_, M_, l_] := N[(N[Cos[N[(N[(N[(K * N[(m + n), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision] - M), $MachinePrecision]], $MachinePrecision] * N[Exp[N[((-N[Power[N[(N[(N[(m + n), $MachinePrecision] / 2.0), $MachinePrecision] - M), $MachinePrecision], 2.0], $MachinePrecision]) - N[(l - N[Abs[N[(m - n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Alternative 1: 96.6% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ e^{\left|n - m\right| - \left({\left(\mathsf{fma}\left(n + m, 0.5, -M\right)\right)}^{2} + \ell\right)} \cdot \cos M \end{array} \]

FPCore

(FPCore (K m n M l)
 :precision binary64
 (* (exp (- (fabs (- n m)) (+ (pow (fma (+ n m) 0.5 (- M)) 2.0) l))) (cos M)))

C

double code(double K, double m, double n, double M, double l) {
	return exp((fabs((n - m)) - (pow(fma((n + m), 0.5, -M), 2.0) + l))) * cos(M);
}

Julia

function code(K, m, n, M, l)
	return Float64(exp(Float64(abs(Float64(n - m)) - Float64((fma(Float64(n + m), 0.5, Float64(-M)) ^ 2.0) + l))) * cos(M))
end

Wolfram

code[K_, m_, n_, M_, l_] := N[(N[Exp[N[(N[Abs[N[(n - m), $MachinePrecision]], $MachinePrecision] - N[(N[Power[N[(N[(n + m), $MachinePrecision] * 0.5 + (-M)), $MachinePrecision], 2.0], $MachinePrecision] + l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Cos[M], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 79.4%

   \[\cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]
2. Add Preprocessing

3. Taylor expanded in K around 0

   \[\leadsto \color{blue}{\cos \left(\mathsf{neg}\left(M\right)\right) \cdot e^{\left|m - n\right| - \left(\ell + {\left(\frac{1}{2} \cdot \left(m + n\right) - M\right)}^{2}\right)}} \]
4. Step-by-step derivation

   1. *-commutative N/A

      \[\leadsto \color{blue}{e^{\left|m - n\right| - \left(\ell + {\left(\frac{1}{2} \cdot \left(m + n\right) - M\right)}^{2}\right)} \cdot \cos \left(\mathsf{neg}\left(M\right)\right)} \]

   2. lower-*.f64 N/A

      \[\leadsto \color{blue}{e^{\left|m - n\right| - \left(\ell + {\left(\frac{1}{2} \cdot \left(m + n\right) - M\right)}^{2}\right)} \cdot \cos \left(\mathsf{neg}\left(M\right)\right)} \]

5. Applied rewrites 97.4%

   \[\leadsto \color{blue}{e^{\left|m - n\right| - \left({\left(\mathsf{fma}\left(n + m, 0.5, -M\right)\right)}^{2} + \ell\right)} \cdot \cos M} \]

6. Final simplification 97.4%

   \[\leadsto e^{\left|n - m\right| - \left({\left(\mathsf{fma}\left(n + m, 0.5, -M\right)\right)}^{2} + \ell\right)} \cdot \cos M \]
7. Add Preprocessing

Alternative 2: 69.1% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;m \leq -55:\\ \;\;\;\;1 \cdot e^{\left(m \cdot m\right) \cdot -0.25}\\ \mathbf{elif}\;m \leq 6.5 \cdot 10^{-124}:\\ \;\;\;\;\cos \left(\left(m \cdot K\right) \cdot 0.5\right) \cdot e^{-\left(M \cdot M + \left(\ell - \left|n - m\right|\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;e^{\left(n \cdot n\right) \cdot -0.25} \cdot 1\\ \end{array} \end{array} \]

FPCore

(FPCore (K m n M l)
 :precision binary64
 (if (<= m -55.0)
   (* 1.0 (exp (* (* m m) -0.25)))
   (if (<= m 6.5e-124)
     (* (cos (* (* m K) 0.5)) (exp (- (+ (* M M) (- l (fabs (- n m)))))))
     (* (exp (* (* n n) -0.25)) 1.0))))

C

double code(double K, double m, double n, double M, double l) {
	double tmp;
	if (m <= -55.0) {
		tmp = 1.0 * exp(((m * m) * -0.25));
	} else if (m <= 6.5e-124) {
		tmp = cos(((m * K) * 0.5)) * exp(-((M * M) + (l - fabs((n - m)))));
	} else {
		tmp = exp(((n * n) * -0.25)) * 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(k, m, n, m_1, l)
use fmin_fmax_functions
    real(8), intent (in) :: k
    real(8), intent (in) :: m
    real(8), intent (in) :: n
    real(8), intent (in) :: m_1
    real(8), intent (in) :: l
    real(8) :: tmp
    if (m <= (-55.0d0)) then
        tmp = 1.0d0 * exp(((m * m) * (-0.25d0)))
    else if (m <= 6.5d-124) then
        tmp = cos(((m * k) * 0.5d0)) * exp(-((m_1 * m_1) + (l - abs((n - m)))))
    else
        tmp = exp(((n * n) * (-0.25d0))) * 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double K, double m, double n, double M, double l) {
	double tmp;
	if (m <= -55.0) {
		tmp = 1.0 * Math.exp(((m * m) * -0.25));
	} else if (m <= 6.5e-124) {
		tmp = Math.cos(((m * K) * 0.5)) * Math.exp(-((M * M) + (l - Math.abs((n - m)))));
	} else {
		tmp = Math.exp(((n * n) * -0.25)) * 1.0;
	}
	return tmp;
}

Python

def code(K, m, n, M, l):
	tmp = 0
	if m <= -55.0:
		tmp = 1.0 * math.exp(((m * m) * -0.25))
	elif m <= 6.5e-124:
		tmp = math.cos(((m * K) * 0.5)) * math.exp(-((M * M) + (l - math.fabs((n - m)))))
	else:
		tmp = math.exp(((n * n) * -0.25)) * 1.0
	return tmp

Julia

function code(K, m, n, M, l)
	tmp = 0.0
	if (m <= -55.0)
		tmp = Float64(1.0 * exp(Float64(Float64(m * m) * -0.25)));
	elseif (m <= 6.5e-124)
		tmp = Float64(cos(Float64(Float64(m * K) * 0.5)) * exp(Float64(-Float64(Float64(M * M) + Float64(l - abs(Float64(n - m)))))));
	else
		tmp = Float64(exp(Float64(Float64(n * n) * -0.25)) * 1.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(K, m, n, M, l)
	tmp = 0.0;
	if (m <= -55.0)
		tmp = 1.0 * exp(((m * m) * -0.25));
	elseif (m <= 6.5e-124)
		tmp = cos(((m * K) * 0.5)) * exp(-((M * M) + (l - abs((n - m)))));
	else
		tmp = exp(((n * n) * -0.25)) * 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[K_, m_, n_, M_, l_] := If[LessEqual[m, -55.0], N[(1.0 * N[Exp[N[(N[(m * m), $MachinePrecision] * -0.25), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[m, 6.5e-124], N[(N[Cos[N[(N[(m * K), $MachinePrecision] * 0.5), $MachinePrecision]], $MachinePrecision] * N[Exp[(-N[(N[(M * M), $MachinePrecision] + N[(l - N[Abs[N[(n - m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision])], $MachinePrecision]), $MachinePrecision], N[(N[Exp[N[(N[(n * n), $MachinePrecision] * -0.25), $MachinePrecision]], $MachinePrecision] * 1.0), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if m < -55

   1. Initial program 73.0%

      \[\cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in m around inf

      \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{\frac{-1}{4} \cdot {m}^{2}}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{{m}^{2} \cdot \frac{-1}{4}}} \]

      2. lower-*.f64 N/A

         \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{{m}^{2} \cdot \frac{-1}{4}}} \]

      3. unpow2 N/A

         \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{\left(m \cdot m\right)} \cdot \frac{-1}{4}} \]

      4. lower-*.f64 70.3

         \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{\left(m \cdot m\right)} \cdot -0.25} \]

   5. Applied rewrites 70.3%

      \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{\left(m \cdot m\right) \cdot -0.25}} \]

   6. Taylor expanded in K around 0

      \[\leadsto \color{blue}{\cos \left(\mathsf{neg}\left(M\right)\right)} \cdot e^{\left(m \cdot m\right) \cdot \frac{-1}{4}} \]
   7. Step-by-step derivation

      1. cos-neg-rev N/A

         \[\leadsto \color{blue}{\cos M} \cdot e^{\left(m \cdot m\right) \cdot \frac{-1}{4}} \]

      2. lower-cos.f64 97.3

         \[\leadsto \color{blue}{\cos M} \cdot e^{\left(m \cdot m\right) \cdot -0.25} \]

   8. Applied rewrites 97.3%

      \[\leadsto \color{blue}{\cos M} \cdot e^{\left(m \cdot m\right) \cdot -0.25} \]

   9. Taylor expanded in M around 0

      \[\leadsto 1 \cdot e^{\left(m \cdot m\right) \cdot \frac{-1}{4}} \]
   10. Step-by-step derivation

   11. Applied rewrites 97.3%

       \[\leadsto 1 \cdot e^{\left(m \cdot m\right) \cdot -0.25} \]

   if -55 < m < 6.49999999999999988e-124

   1. Initial program 86.6%

      \[\cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in M around inf

      \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\left(-\color{blue}{{M}^{2}}\right) - \left(\ell - \left|m - n\right|\right)} \]
   4. Step-by-step derivation

      1. unpow2 N/A

         \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\left(-\color{blue}{M \cdot M}\right) - \left(\ell - \left|m - n\right|\right)} \]

      2. lower-*.f64 71.3

         \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\left(-\color{blue}{M \cdot M}\right) - \left(\ell - \left|m - n\right|\right)} \]

   5. Applied rewrites 71.3%

      \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\left(-\color{blue}{M \cdot M}\right) - \left(\ell - \left|m - n\right|\right)} \]

   6. Taylor expanded in m around inf

      \[\leadsto \cos \color{blue}{\left(\frac{1}{2} \cdot \left(K \cdot m\right)\right)} \cdot e^{\left(-M \cdot M\right) - \left(\ell - \left|m - n\right|\right)} \]
   7. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \cos \color{blue}{\left(\left(K \cdot m\right) \cdot \frac{1}{2}\right)} \cdot e^{\left(-M \cdot M\right) - \left(\ell - \left|m - n\right|\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto \cos \color{blue}{\left(\left(K \cdot m\right) \cdot \frac{1}{2}\right)} \cdot e^{\left(-M \cdot M\right) - \left(\ell - \left|m - n\right|\right)} \]

      3. *-commutative N/A

         \[\leadsto \cos \left(\color{blue}{\left(m \cdot K\right)} \cdot \frac{1}{2}\right) \cdot e^{\left(-M \cdot M\right) - \left(\ell - \left|m - n\right|\right)} \]

      4. lower-*.f64 69.4

         \[\leadsto \cos \left(\color{blue}{\left(m \cdot K\right)} \cdot 0.5\right) \cdot e^{\left(-M \cdot M\right) - \left(\ell - \left|m - n\right|\right)} \]

   8. Applied rewrites 69.4%

      \[\leadsto \cos \color{blue}{\left(\left(m \cdot K\right) \cdot 0.5\right)} \cdot e^{\left(-M \cdot M\right) - \left(\ell - \left|m - n\right|\right)} \]

   if 6.49999999999999988e-124 < m

   1. Initial program 76.7%

      \[\cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in K around 0

      \[\leadsto \color{blue}{\cos \left(\mathsf{neg}\left(M\right)\right) \cdot e^{\left|m - n\right| - \left(\ell + {\left(\frac{1}{2} \cdot \left(m + n\right) - M\right)}^{2}\right)}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{\left|m - n\right| - \left(\ell + {\left(\frac{1}{2} \cdot \left(m + n\right) - M\right)}^{2}\right)} \cdot \cos \left(\mathsf{neg}\left(M\right)\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{\left|m - n\right| - \left(\ell + {\left(\frac{1}{2} \cdot \left(m + n\right) - M\right)}^{2}\right)} \cdot \cos \left(\mathsf{neg}\left(M\right)\right)} \]

   5. Applied rewrites 96.5%

      \[\leadsto \color{blue}{e^{\left|m - n\right| - \left({\left(\mathsf{fma}\left(n + m, 0.5, -M\right)\right)}^{2} + \ell\right)} \cdot \cos M} \]

   6. Taylor expanded in n around inf

      \[\leadsto e^{\frac{-1}{4} \cdot {n}^{2}} \cdot \cos M \]
   7. Step-by-step derivation

   8. Applied rewrites 44.7%

      \[\leadsto e^{\left(n \cdot n\right) \cdot -0.25} \cdot \cos M \]

   9. Taylor expanded in M around 0

      \[\leadsto e^{\left(n \cdot n\right) \cdot \frac{-1}{4}} \cdot 1 \]
   10. Step-by-step derivation

   11. Applied rewrites 44.7%

       \[\leadsto e^{\left(n \cdot n\right) \cdot -0.25} \cdot 1 \]
3. Recombined 3 regimes into one program.

4. Final simplification 69.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;m \leq -55:\\ \;\;\;\;1 \cdot e^{\left(m \cdot m\right) \cdot -0.25}\\ \mathbf{elif}\;m \leq 6.5 \cdot 10^{-124}:\\ \;\;\;\;\cos \left(\left(m \cdot K\right) \cdot 0.5\right) \cdot e^{-\left(M \cdot M + \left(\ell - \left|n - m\right|\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;e^{\left(n \cdot n\right) \cdot -0.25} \cdot 1\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 65.3% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;n \leq -3 \cdot 10^{-264}:\\ \;\;\;\;\cos M \cdot e^{\left(m \cdot m\right) \cdot -0.25}\\ \mathbf{elif}\;n \leq 54:\\ \;\;\;\;e^{\left(-M\right) \cdot M} \cdot \cos M\\ \mathbf{else}:\\ \;\;\;\;e^{\left(n \cdot n\right) \cdot -0.25} \cdot 1\\ \end{array} \end{array} \]

FPCore

(FPCore (K m n M l)
 :precision binary64
 (if (<= n -3e-264)
   (* (cos M) (exp (* (* m m) -0.25)))
   (if (<= n 54.0)
     (* (exp (* (- M) M)) (cos M))
     (* (exp (* (* n n) -0.25)) 1.0))))

C

double code(double K, double m, double n, double M, double l) {
	double tmp;
	if (n <= -3e-264) {
		tmp = cos(M) * exp(((m * m) * -0.25));
	} else if (n <= 54.0) {
		tmp = exp((-M * M)) * cos(M);
	} else {
		tmp = exp(((n * n) * -0.25)) * 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(k, m, n, m_1, l)
use fmin_fmax_functions
    real(8), intent (in) :: k
    real(8), intent (in) :: m
    real(8), intent (in) :: n
    real(8), intent (in) :: m_1
    real(8), intent (in) :: l
    real(8) :: tmp
    if (n <= (-3d-264)) then
        tmp = cos(m_1) * exp(((m * m) * (-0.25d0)))
    else if (n <= 54.0d0) then
        tmp = exp((-m_1 * m_1)) * cos(m_1)
    else
        tmp = exp(((n * n) * (-0.25d0))) * 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double K, double m, double n, double M, double l) {
	double tmp;
	if (n <= -3e-264) {
		tmp = Math.cos(M) * Math.exp(((m * m) * -0.25));
	} else if (n <= 54.0) {
		tmp = Math.exp((-M * M)) * Math.cos(M);
	} else {
		tmp = Math.exp(((n * n) * -0.25)) * 1.0;
	}
	return tmp;
}

Python

def code(K, m, n, M, l):
	tmp = 0
	if n <= -3e-264:
		tmp = math.cos(M) * math.exp(((m * m) * -0.25))
	elif n <= 54.0:
		tmp = math.exp((-M * M)) * math.cos(M)
	else:
		tmp = math.exp(((n * n) * -0.25)) * 1.0
	return tmp

Julia

function code(K, m, n, M, l)
	tmp = 0.0
	if (n <= -3e-264)
		tmp = Float64(cos(M) * exp(Float64(Float64(m * m) * -0.25)));
	elseif (n <= 54.0)
		tmp = Float64(exp(Float64(Float64(-M) * M)) * cos(M));
	else
		tmp = Float64(exp(Float64(Float64(n * n) * -0.25)) * 1.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(K, m, n, M, l)
	tmp = 0.0;
	if (n <= -3e-264)
		tmp = cos(M) * exp(((m * m) * -0.25));
	elseif (n <= 54.0)
		tmp = exp((-M * M)) * cos(M);
	else
		tmp = exp(((n * n) * -0.25)) * 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[K_, m_, n_, M_, l_] := If[LessEqual[n, -3e-264], N[(N[Cos[M], $MachinePrecision] * N[Exp[N[(N[(m * m), $MachinePrecision] * -0.25), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[n, 54.0], N[(N[Exp[N[((-M) * M), $MachinePrecision]], $MachinePrecision] * N[Cos[M], $MachinePrecision]), $MachinePrecision], N[(N[Exp[N[(N[(n * n), $MachinePrecision] * -0.25), $MachinePrecision]], $MachinePrecision] * 1.0), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if n < -3e-264

   1. Initial program 75.1%

      \[\cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in m around inf

      \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{\frac{-1}{4} \cdot {m}^{2}}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{{m}^{2} \cdot \frac{-1}{4}}} \]

      2. lower-*.f64 N/A

         \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{{m}^{2} \cdot \frac{-1}{4}}} \]

      3. unpow2 N/A

         \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{\left(m \cdot m\right)} \cdot \frac{-1}{4}} \]

      4. lower-*.f64 36.1

         \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{\left(m \cdot m\right)} \cdot -0.25} \]

   5. Applied rewrites 36.1%

      \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{\left(m \cdot m\right) \cdot -0.25}} \]

   6. Taylor expanded in K around 0

      \[\leadsto \color{blue}{\cos \left(\mathsf{neg}\left(M\right)\right)} \cdot e^{\left(m \cdot m\right) \cdot \frac{-1}{4}} \]
   7. Step-by-step derivation

      1. cos-neg-rev N/A

         \[\leadsto \color{blue}{\cos M} \cdot e^{\left(m \cdot m\right) \cdot \frac{-1}{4}} \]

      2. lower-cos.f64 53.8

         \[\leadsto \color{blue}{\cos M} \cdot e^{\left(m \cdot m\right) \cdot -0.25} \]

   8. Applied rewrites 53.8%

      \[\leadsto \color{blue}{\cos M} \cdot e^{\left(m \cdot m\right) \cdot -0.25} \]

   if -3e-264 < n < 54

   1. Initial program 93.5%

      \[\cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in K around 0

      \[\leadsto \color{blue}{\cos \left(\mathsf{neg}\left(M\right)\right) \cdot e^{\left|m - n\right| - \left(\ell + {\left(\frac{1}{2} \cdot \left(m + n\right) - M\right)}^{2}\right)}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{\left|m - n\right| - \left(\ell + {\left(\frac{1}{2} \cdot \left(m + n\right) - M\right)}^{2}\right)} \cdot \cos \left(\mathsf{neg}\left(M\right)\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{\left|m - n\right| - \left(\ell + {\left(\frac{1}{2} \cdot \left(m + n\right) - M\right)}^{2}\right)} \cdot \cos \left(\mathsf{neg}\left(M\right)\right)} \]

   5. Applied rewrites 99.0%

      \[\leadsto \color{blue}{e^{\left|m - n\right| - \left({\left(\mathsf{fma}\left(n + m, 0.5, -M\right)\right)}^{2} + \ell\right)} \cdot \cos M} \]

   6. Taylor expanded in M around inf

      \[\leadsto e^{-1 \cdot {M}^{2}} \cdot \cos M \]
   7. Step-by-step derivation

   8. Applied rewrites 61.4%

      \[\leadsto e^{\left(-M\right) \cdot M} \cdot \cos M \]

   if 54 < n

   1. Initial program 69.1%

      \[\cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in K around 0

      \[\leadsto \color{blue}{\cos \left(\mathsf{neg}\left(M\right)\right) \cdot e^{\left|m - n\right| - \left(\ell + {\left(\frac{1}{2} \cdot \left(m + n\right) - M\right)}^{2}\right)}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{\left|m - n\right| - \left(\ell + {\left(\frac{1}{2} \cdot \left(m + n\right) - M\right)}^{2}\right)} \cdot \cos \left(\mathsf{neg}\left(M\right)\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{\left|m - n\right| - \left(\ell + {\left(\frac{1}{2} \cdot \left(m + n\right) - M\right)}^{2}\right)} \cdot \cos \left(\mathsf{neg}\left(M\right)\right)} \]

   5. Applied rewrites 96.4%

      \[\leadsto \color{blue}{e^{\left|m - n\right| - \left({\left(\mathsf{fma}\left(n + m, 0.5, -M\right)\right)}^{2} + \ell\right)} \cdot \cos M} \]

   6. Taylor expanded in n around inf

      \[\leadsto e^{\frac{-1}{4} \cdot {n}^{2}} \cdot \cos M \]
   7. Step-by-step derivation

   8. Applied rewrites 94.6%

      \[\leadsto e^{\left(n \cdot n\right) \cdot -0.25} \cdot \cos M \]

   9. Taylor expanded in M around 0

      \[\leadsto e^{\left(n \cdot n\right) \cdot \frac{-1}{4}} \cdot 1 \]
   10. Step-by-step derivation

   11. Applied rewrites 94.6%

       \[\leadsto e^{\left(n \cdot n\right) \cdot -0.25} \cdot 1 \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 4: 65.3% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;n \leq -3 \cdot 10^{-264}:\\ \;\;\;\;1 \cdot e^{\left(m \cdot m\right) \cdot -0.25}\\ \mathbf{elif}\;n \leq 54:\\ \;\;\;\;e^{\left(-M\right) \cdot M} \cdot \cos M\\ \mathbf{else}:\\ \;\;\;\;e^{\left(n \cdot n\right) \cdot -0.25} \cdot 1\\ \end{array} \end{array} \]

FPCore

(FPCore (K m n M l)
 :precision binary64
 (if (<= n -3e-264)
   (* 1.0 (exp (* (* m m) -0.25)))
   (if (<= n 54.0)
     (* (exp (* (- M) M)) (cos M))
     (* (exp (* (* n n) -0.25)) 1.0))))

C

double code(double K, double m, double n, double M, double l) {
	double tmp;
	if (n <= -3e-264) {
		tmp = 1.0 * exp(((m * m) * -0.25));
	} else if (n <= 54.0) {
		tmp = exp((-M * M)) * cos(M);
	} else {
		tmp = exp(((n * n) * -0.25)) * 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(k, m, n, m_1, l)
use fmin_fmax_functions
    real(8), intent (in) :: k
    real(8), intent (in) :: m
    real(8), intent (in) :: n
    real(8), intent (in) :: m_1
    real(8), intent (in) :: l
    real(8) :: tmp
    if (n <= (-3d-264)) then
        tmp = 1.0d0 * exp(((m * m) * (-0.25d0)))
    else if (n <= 54.0d0) then
        tmp = exp((-m_1 * m_1)) * cos(m_1)
    else
        tmp = exp(((n * n) * (-0.25d0))) * 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double K, double m, double n, double M, double l) {
	double tmp;
	if (n <= -3e-264) {
		tmp = 1.0 * Math.exp(((m * m) * -0.25));
	} else if (n <= 54.0) {
		tmp = Math.exp((-M * M)) * Math.cos(M);
	} else {
		tmp = Math.exp(((n * n) * -0.25)) * 1.0;
	}
	return tmp;
}

Python

def code(K, m, n, M, l):
	tmp = 0
	if n <= -3e-264:
		tmp = 1.0 * math.exp(((m * m) * -0.25))
	elif n <= 54.0:
		tmp = math.exp((-M * M)) * math.cos(M)
	else:
		tmp = math.exp(((n * n) * -0.25)) * 1.0
	return tmp

Julia

function code(K, m, n, M, l)
	tmp = 0.0
	if (n <= -3e-264)
		tmp = Float64(1.0 * exp(Float64(Float64(m * m) * -0.25)));
	elseif (n <= 54.0)
		tmp = Float64(exp(Float64(Float64(-M) * M)) * cos(M));
	else
		tmp = Float64(exp(Float64(Float64(n * n) * -0.25)) * 1.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(K, m, n, M, l)
	tmp = 0.0;
	if (n <= -3e-264)
		tmp = 1.0 * exp(((m * m) * -0.25));
	elseif (n <= 54.0)
		tmp = exp((-M * M)) * cos(M);
	else
		tmp = exp(((n * n) * -0.25)) * 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[K_, m_, n_, M_, l_] := If[LessEqual[n, -3e-264], N[(1.0 * N[Exp[N[(N[(m * m), $MachinePrecision] * -0.25), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[n, 54.0], N[(N[Exp[N[((-M) * M), $MachinePrecision]], $MachinePrecision] * N[Cos[M], $MachinePrecision]), $MachinePrecision], N[(N[Exp[N[(N[(n * n), $MachinePrecision] * -0.25), $MachinePrecision]], $MachinePrecision] * 1.0), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if n < -3e-264

   1. Initial program 75.1%

      \[\cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in m around inf

      \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{\frac{-1}{4} \cdot {m}^{2}}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{{m}^{2} \cdot \frac{-1}{4}}} \]

      2. lower-*.f64 N/A

         \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{{m}^{2} \cdot \frac{-1}{4}}} \]

      3. unpow2 N/A

         \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{\left(m \cdot m\right)} \cdot \frac{-1}{4}} \]

      4. lower-*.f64 36.1

         \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{\left(m \cdot m\right)} \cdot -0.25} \]

   5. Applied rewrites 36.1%

      \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{\left(m \cdot m\right) \cdot -0.25}} \]

   6. Taylor expanded in K around 0

      \[\leadsto \color{blue}{\cos \left(\mathsf{neg}\left(M\right)\right)} \cdot e^{\left(m \cdot m\right) \cdot \frac{-1}{4}} \]
   7. Step-by-step derivation

      1. cos-neg-rev N/A

         \[\leadsto \color{blue}{\cos M} \cdot e^{\left(m \cdot m\right) \cdot \frac{-1}{4}} \]

      2. lower-cos.f64 53.8

         \[\leadsto \color{blue}{\cos M} \cdot e^{\left(m \cdot m\right) \cdot -0.25} \]

   8. Applied rewrites 53.8%

      \[\leadsto \color{blue}{\cos M} \cdot e^{\left(m \cdot m\right) \cdot -0.25} \]

   9. Taylor expanded in M around 0

      \[\leadsto 1 \cdot e^{\left(m \cdot m\right) \cdot \frac{-1}{4}} \]
   10. Step-by-step derivation

   11. Applied rewrites 53.8%

       \[\leadsto 1 \cdot e^{\left(m \cdot m\right) \cdot -0.25} \]

   if -3e-264 < n < 54

   1. Initial program 93.5%

      \[\cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in K around 0

      \[\leadsto \color{blue}{\cos \left(\mathsf{neg}\left(M\right)\right) \cdot e^{\left|m - n\right| - \left(\ell + {\left(\frac{1}{2} \cdot \left(m + n\right) - M\right)}^{2}\right)}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{\left|m - n\right| - \left(\ell + {\left(\frac{1}{2} \cdot \left(m + n\right) - M\right)}^{2}\right)} \cdot \cos \left(\mathsf{neg}\left(M\right)\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{\left|m - n\right| - \left(\ell + {\left(\frac{1}{2} \cdot \left(m + n\right) - M\right)}^{2}\right)} \cdot \cos \left(\mathsf{neg}\left(M\right)\right)} \]

   5. Applied rewrites 99.0%

      \[\leadsto \color{blue}{e^{\left|m - n\right| - \left({\left(\mathsf{fma}\left(n + m, 0.5, -M\right)\right)}^{2} + \ell\right)} \cdot \cos M} \]

   6. Taylor expanded in M around inf

      \[\leadsto e^{-1 \cdot {M}^{2}} \cdot \cos M \]
   7. Step-by-step derivation

   8. Applied rewrites 61.4%

      \[\leadsto e^{\left(-M\right) \cdot M} \cdot \cos M \]

   if 54 < n

   1. Initial program 69.1%

      \[\cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in K around 0

      \[\leadsto \color{blue}{\cos \left(\mathsf{neg}\left(M\right)\right) \cdot e^{\left|m - n\right| - \left(\ell + {\left(\frac{1}{2} \cdot \left(m + n\right) - M\right)}^{2}\right)}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{\left|m - n\right| - \left(\ell + {\left(\frac{1}{2} \cdot \left(m + n\right) - M\right)}^{2}\right)} \cdot \cos \left(\mathsf{neg}\left(M\right)\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{\left|m - n\right| - \left(\ell + {\left(\frac{1}{2} \cdot \left(m + n\right) - M\right)}^{2}\right)} \cdot \cos \left(\mathsf{neg}\left(M\right)\right)} \]

   5. Applied rewrites 96.4%

      \[\leadsto \color{blue}{e^{\left|m - n\right| - \left({\left(\mathsf{fma}\left(n + m, 0.5, -M\right)\right)}^{2} + \ell\right)} \cdot \cos M} \]

   6. Taylor expanded in n around inf

      \[\leadsto e^{\frac{-1}{4} \cdot {n}^{2}} \cdot \cos M \]
   7. Step-by-step derivation

   8. Applied rewrites 94.6%

      \[\leadsto e^{\left(n \cdot n\right) \cdot -0.25} \cdot \cos M \]

   9. Taylor expanded in M around 0

      \[\leadsto e^{\left(n \cdot n\right) \cdot \frac{-1}{4}} \cdot 1 \]
   10. Step-by-step derivation

   11. Applied rewrites 94.6%

       \[\leadsto e^{\left(n \cdot n\right) \cdot -0.25} \cdot 1 \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 5: 61.8% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;m \leq -55:\\ \;\;\;\;1 \cdot e^{\left(m \cdot m\right) \cdot -0.25}\\ \mathbf{elif}\;m \leq -2 \cdot 10^{-295}:\\ \;\;\;\;\cos M \cdot e^{-\ell}\\ \mathbf{else}:\\ \;\;\;\;e^{\left(n \cdot n\right) \cdot -0.25} \cdot 1\\ \end{array} \end{array} \]

FPCore

(FPCore (K m n M l)
 :precision binary64
 (if (<= m -55.0)
   (* 1.0 (exp (* (* m m) -0.25)))
   (if (<= m -2e-295)
     (* (cos M) (exp (- l)))
     (* (exp (* (* n n) -0.25)) 1.0))))

C

double code(double K, double m, double n, double M, double l) {
	double tmp;
	if (m <= -55.0) {
		tmp = 1.0 * exp(((m * m) * -0.25));
	} else if (m <= -2e-295) {
		tmp = cos(M) * exp(-l);
	} else {
		tmp = exp(((n * n) * -0.25)) * 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(k, m, n, m_1, l)
use fmin_fmax_functions
    real(8), intent (in) :: k
    real(8), intent (in) :: m
    real(8), intent (in) :: n
    real(8), intent (in) :: m_1
    real(8), intent (in) :: l
    real(8) :: tmp
    if (m <= (-55.0d0)) then
        tmp = 1.0d0 * exp(((m * m) * (-0.25d0)))
    else if (m <= (-2d-295)) then
        tmp = cos(m_1) * exp(-l)
    else
        tmp = exp(((n * n) * (-0.25d0))) * 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double K, double m, double n, double M, double l) {
	double tmp;
	if (m <= -55.0) {
		tmp = 1.0 * Math.exp(((m * m) * -0.25));
	} else if (m <= -2e-295) {
		tmp = Math.cos(M) * Math.exp(-l);
	} else {
		tmp = Math.exp(((n * n) * -0.25)) * 1.0;
	}
	return tmp;
}

Python

def code(K, m, n, M, l):
	tmp = 0
	if m <= -55.0:
		tmp = 1.0 * math.exp(((m * m) * -0.25))
	elif m <= -2e-295:
		tmp = math.cos(M) * math.exp(-l)
	else:
		tmp = math.exp(((n * n) * -0.25)) * 1.0
	return tmp

Julia

function code(K, m, n, M, l)
	tmp = 0.0
	if (m <= -55.0)
		tmp = Float64(1.0 * exp(Float64(Float64(m * m) * -0.25)));
	elseif (m <= -2e-295)
		tmp = Float64(cos(M) * exp(Float64(-l)));
	else
		tmp = Float64(exp(Float64(Float64(n * n) * -0.25)) * 1.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(K, m, n, M, l)
	tmp = 0.0;
	if (m <= -55.0)
		tmp = 1.0 * exp(((m * m) * -0.25));
	elseif (m <= -2e-295)
		tmp = cos(M) * exp(-l);
	else
		tmp = exp(((n * n) * -0.25)) * 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[K_, m_, n_, M_, l_] := If[LessEqual[m, -55.0], N[(1.0 * N[Exp[N[(N[(m * m), $MachinePrecision] * -0.25), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[m, -2e-295], N[(N[Cos[M], $MachinePrecision] * N[Exp[(-l)], $MachinePrecision]), $MachinePrecision], N[(N[Exp[N[(N[(n * n), $MachinePrecision] * -0.25), $MachinePrecision]], $MachinePrecision] * 1.0), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if m < -55

   1. Initial program 73.0%

      \[\cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in m around inf

      \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{\frac{-1}{4} \cdot {m}^{2}}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{{m}^{2} \cdot \frac{-1}{4}}} \]

      2. lower-*.f64 N/A

         \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{{m}^{2} \cdot \frac{-1}{4}}} \]

      3. unpow2 N/A

         \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{\left(m \cdot m\right)} \cdot \frac{-1}{4}} \]

      4. lower-*.f64 70.3

         \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{\left(m \cdot m\right)} \cdot -0.25} \]

   5. Applied rewrites 70.3%

      \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{\left(m \cdot m\right) \cdot -0.25}} \]

   6. Taylor expanded in K around 0

      \[\leadsto \color{blue}{\cos \left(\mathsf{neg}\left(M\right)\right)} \cdot e^{\left(m \cdot m\right) \cdot \frac{-1}{4}} \]
   7. Step-by-step derivation

      1. cos-neg-rev N/A

         \[\leadsto \color{blue}{\cos M} \cdot e^{\left(m \cdot m\right) \cdot \frac{-1}{4}} \]

      2. lower-cos.f64 97.3

         \[\leadsto \color{blue}{\cos M} \cdot e^{\left(m \cdot m\right) \cdot -0.25} \]

   8. Applied rewrites 97.3%

      \[\leadsto \color{blue}{\cos M} \cdot e^{\left(m \cdot m\right) \cdot -0.25} \]

   9. Taylor expanded in M around 0

      \[\leadsto 1 \cdot e^{\left(m \cdot m\right) \cdot \frac{-1}{4}} \]
   10. Step-by-step derivation

   11. Applied rewrites 97.3%

       \[\leadsto 1 \cdot e^{\left(m \cdot m\right) \cdot -0.25} \]

   if -55 < m < -2.00000000000000012e-295

   1. Initial program 85.8%

      \[\cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in l around inf

      \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{-1 \cdot \ell}} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{\mathsf{neg}\left(\ell\right)}} \]

      2. lower-neg.f64 46.9

         \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{-\ell}} \]

   5. Applied rewrites 46.9%

      \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{-\ell}} \]

   6. Taylor expanded in K around 0

      \[\leadsto \color{blue}{\cos \left(\mathsf{neg}\left(M\right)\right)} \cdot e^{-\ell} \]
   7. Step-by-step derivation

      1. cos-neg-rev N/A

         \[\leadsto \color{blue}{\cos M} \cdot e^{-\ell} \]

      2. lower-cos.f64 50.9

         \[\leadsto \color{blue}{\cos M} \cdot e^{-\ell} \]

   8. Applied rewrites 50.9%

      \[\leadsto \color{blue}{\cos M} \cdot e^{-\ell} \]

   if -2.00000000000000012e-295 < m

   1. Initial program 80.3%

      \[\cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in K around 0

      \[\leadsto \color{blue}{\cos \left(\mathsf{neg}\left(M\right)\right) \cdot e^{\left|m - n\right| - \left(\ell + {\left(\frac{1}{2} \cdot \left(m + n\right) - M\right)}^{2}\right)}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{\left|m - n\right| - \left(\ell + {\left(\frac{1}{2} \cdot \left(m + n\right) - M\right)}^{2}\right)} \cdot \cos \left(\mathsf{neg}\left(M\right)\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{\left|m - n\right| - \left(\ell + {\left(\frac{1}{2} \cdot \left(m + n\right) - M\right)}^{2}\right)} \cdot \cos \left(\mathsf{neg}\left(M\right)\right)} \]

   5. Applied rewrites 96.0%

      \[\leadsto \color{blue}{e^{\left|m - n\right| - \left({\left(\mathsf{fma}\left(n + m, 0.5, -M\right)\right)}^{2} + \ell\right)} \cdot \cos M} \]

   6. Taylor expanded in n around inf

      \[\leadsto e^{\frac{-1}{4} \cdot {n}^{2}} \cdot \cos M \]
   7. Step-by-step derivation

   8. Applied rewrites 51.2%

      \[\leadsto e^{\left(n \cdot n\right) \cdot -0.25} \cdot \cos M \]

   9. Taylor expanded in M around 0

      \[\leadsto e^{\left(n \cdot n\right) \cdot \frac{-1}{4}} \cdot 1 \]
   10. Step-by-step derivation

   11. Applied rewrites 51.1%

       \[\leadsto e^{\left(n \cdot n\right) \cdot -0.25} \cdot 1 \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 6: 68.1% accurate, 2.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;n \leq -7.2 \cdot 10^{-12} \lor \neg \left(n \leq 54\right):\\ \;\;\;\;e^{\left(n \cdot n\right) \cdot -0.25} \cdot 1\\ \mathbf{else}:\\ \;\;\;\;1 \cdot e^{-\ell}\\ \end{array} \end{array} \]

FPCore

(FPCore (K m n M l)
 :precision binary64
 (if (or (<= n -7.2e-12) (not (<= n 54.0)))
   (* (exp (* (* n n) -0.25)) 1.0)
   (* 1.0 (exp (- l)))))

C

double code(double K, double m, double n, double M, double l) {
	double tmp;
	if ((n <= -7.2e-12) || !(n <= 54.0)) {
		tmp = exp(((n * n) * -0.25)) * 1.0;
	} else {
		tmp = 1.0 * exp(-l);
	}
	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(k, m, n, m_1, l)
use fmin_fmax_functions
    real(8), intent (in) :: k
    real(8), intent (in) :: m
    real(8), intent (in) :: n
    real(8), intent (in) :: m_1
    real(8), intent (in) :: l
    real(8) :: tmp
    if ((n <= (-7.2d-12)) .or. (.not. (n <= 54.0d0))) then
        tmp = exp(((n * n) * (-0.25d0))) * 1.0d0
    else
        tmp = 1.0d0 * exp(-l)
    end if
    code = tmp
end function

Java

public static double code(double K, double m, double n, double M, double l) {
	double tmp;
	if ((n <= -7.2e-12) || !(n <= 54.0)) {
		tmp = Math.exp(((n * n) * -0.25)) * 1.0;
	} else {
		tmp = 1.0 * Math.exp(-l);
	}
	return tmp;
}

Python

def code(K, m, n, M, l):
	tmp = 0
	if (n <= -7.2e-12) or not (n <= 54.0):
		tmp = math.exp(((n * n) * -0.25)) * 1.0
	else:
		tmp = 1.0 * math.exp(-l)
	return tmp

Julia

function code(K, m, n, M, l)
	tmp = 0.0
	if ((n <= -7.2e-12) || !(n <= 54.0))
		tmp = Float64(exp(Float64(Float64(n * n) * -0.25)) * 1.0);
	else
		tmp = Float64(1.0 * exp(Float64(-l)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(K, m, n, M, l)
	tmp = 0.0;
	if ((n <= -7.2e-12) || ~((n <= 54.0)))
		tmp = exp(((n * n) * -0.25)) * 1.0;
	else
		tmp = 1.0 * exp(-l);
	end
	tmp_2 = tmp;
end

Wolfram

code[K_, m_, n_, M_, l_] := If[Or[LessEqual[n, -7.2e-12], N[Not[LessEqual[n, 54.0]], $MachinePrecision]], N[(N[Exp[N[(N[(n * n), $MachinePrecision] * -0.25), $MachinePrecision]], $MachinePrecision] * 1.0), $MachinePrecision], N[(1.0 * N[Exp[(-l)], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if n < -7.2e-12 or 54 < n

   1. Initial program 67.4%

      \[\cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in K around 0

      \[\leadsto \color{blue}{\cos \left(\mathsf{neg}\left(M\right)\right) \cdot e^{\left|m - n\right| - \left(\ell + {\left(\frac{1}{2} \cdot \left(m + n\right) - M\right)}^{2}\right)}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{\left|m - n\right| - \left(\ell + {\left(\frac{1}{2} \cdot \left(m + n\right) - M\right)}^{2}\right)} \cdot \cos \left(\mathsf{neg}\left(M\right)\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{\left|m - n\right| - \left(\ell + {\left(\frac{1}{2} \cdot \left(m + n\right) - M\right)}^{2}\right)} \cdot \cos \left(\mathsf{neg}\left(M\right)\right)} \]

   5. Applied rewrites 95.9%

      \[\leadsto \color{blue}{e^{\left|m - n\right| - \left({\left(\mathsf{fma}\left(n + m, 0.5, -M\right)\right)}^{2} + \ell\right)} \cdot \cos M} \]

   6. Taylor expanded in n around inf

      \[\leadsto e^{\frac{-1}{4} \cdot {n}^{2}} \cdot \cos M \]
   7. Step-by-step derivation

   8. Applied rewrites 88.8%

      \[\leadsto e^{\left(n \cdot n\right) \cdot -0.25} \cdot \cos M \]

   9. Taylor expanded in M around 0

      \[\leadsto e^{\left(n \cdot n\right) \cdot \frac{-1}{4}} \cdot 1 \]
   10. Step-by-step derivation

   11. Applied rewrites 88.8%

       \[\leadsto e^{\left(n \cdot n\right) \cdot -0.25} \cdot 1 \]

   if -7.2e-12 < n < 54

   1. Initial program 90.3%

      \[\cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in l around inf

      \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{-1 \cdot \ell}} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{\mathsf{neg}\left(\ell\right)}} \]

      2. lower-neg.f64 41.8

         \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{-\ell}} \]

   5. Applied rewrites 41.8%

      \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{-\ell}} \]

   6. Taylor expanded in K around 0

      \[\leadsto \color{blue}{\cos \left(\mathsf{neg}\left(M\right)\right)} \cdot e^{-\ell} \]
   7. Step-by-step derivation

      1. cos-neg-rev N/A

         \[\leadsto \color{blue}{\cos M} \cdot e^{-\ell} \]

      2. lower-cos.f64 44.3

         \[\leadsto \color{blue}{\cos M} \cdot e^{-\ell} \]

   8. Applied rewrites 44.3%

      \[\leadsto \color{blue}{\cos M} \cdot e^{-\ell} \]

   9. Taylor expanded in M around 0

      \[\leadsto 1 \cdot e^{-\ell} \]
   10. Step-by-step derivation

   11. Applied rewrites 43.5%

       \[\leadsto 1 \cdot e^{-\ell} \]
3. Recombined 2 regimes into one program.

4. Final simplification 65.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;n \leq -7.2 \cdot 10^{-12} \lor \neg \left(n \leq 54\right):\\ \;\;\;\;e^{\left(n \cdot n\right) \cdot -0.25} \cdot 1\\ \mathbf{else}:\\ \;\;\;\;1 \cdot e^{-\ell}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 63.6% accurate, 2.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;m \leq -55:\\ \;\;\;\;1 \cdot e^{\left(m \cdot m\right) \cdot -0.25}\\ \mathbf{elif}\;m \leq -9.5 \cdot 10^{-147}:\\ \;\;\;\;1 \cdot e^{-\ell}\\ \mathbf{else}:\\ \;\;\;\;e^{\left(n \cdot n\right) \cdot -0.25} \cdot 1\\ \end{array} \end{array} \]

FPCore

(FPCore (K m n M l)
 :precision binary64
 (if (<= m -55.0)
   (* 1.0 (exp (* (* m m) -0.25)))
   (if (<= m -9.5e-147) (* 1.0 (exp (- l))) (* (exp (* (* n n) -0.25)) 1.0))))

C

double code(double K, double m, double n, double M, double l) {
	double tmp;
	if (m <= -55.0) {
		tmp = 1.0 * exp(((m * m) * -0.25));
	} else if (m <= -9.5e-147) {
		tmp = 1.0 * exp(-l);
	} else {
		tmp = exp(((n * n) * -0.25)) * 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(k, m, n, m_1, l)
use fmin_fmax_functions
    real(8), intent (in) :: k
    real(8), intent (in) :: m
    real(8), intent (in) :: n
    real(8), intent (in) :: m_1
    real(8), intent (in) :: l
    real(8) :: tmp
    if (m <= (-55.0d0)) then
        tmp = 1.0d0 * exp(((m * m) * (-0.25d0)))
    else if (m <= (-9.5d-147)) then
        tmp = 1.0d0 * exp(-l)
    else
        tmp = exp(((n * n) * (-0.25d0))) * 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double K, double m, double n, double M, double l) {
	double tmp;
	if (m <= -55.0) {
		tmp = 1.0 * Math.exp(((m * m) * -0.25));
	} else if (m <= -9.5e-147) {
		tmp = 1.0 * Math.exp(-l);
	} else {
		tmp = Math.exp(((n * n) * -0.25)) * 1.0;
	}
	return tmp;
}

Python

def code(K, m, n, M, l):
	tmp = 0
	if m <= -55.0:
		tmp = 1.0 * math.exp(((m * m) * -0.25))
	elif m <= -9.5e-147:
		tmp = 1.0 * math.exp(-l)
	else:
		tmp = math.exp(((n * n) * -0.25)) * 1.0
	return tmp

Julia

function code(K, m, n, M, l)
	tmp = 0.0
	if (m <= -55.0)
		tmp = Float64(1.0 * exp(Float64(Float64(m * m) * -0.25)));
	elseif (m <= -9.5e-147)
		tmp = Float64(1.0 * exp(Float64(-l)));
	else
		tmp = Float64(exp(Float64(Float64(n * n) * -0.25)) * 1.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(K, m, n, M, l)
	tmp = 0.0;
	if (m <= -55.0)
		tmp = 1.0 * exp(((m * m) * -0.25));
	elseif (m <= -9.5e-147)
		tmp = 1.0 * exp(-l);
	else
		tmp = exp(((n * n) * -0.25)) * 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[K_, m_, n_, M_, l_] := If[LessEqual[m, -55.0], N[(1.0 * N[Exp[N[(N[(m * m), $MachinePrecision] * -0.25), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[m, -9.5e-147], N[(1.0 * N[Exp[(-l)], $MachinePrecision]), $MachinePrecision], N[(N[Exp[N[(N[(n * n), $MachinePrecision] * -0.25), $MachinePrecision]], $MachinePrecision] * 1.0), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if m < -55

   1. Initial program 73.0%

      \[\cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in m around inf

      \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{\frac{-1}{4} \cdot {m}^{2}}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{{m}^{2} \cdot \frac{-1}{4}}} \]

      2. lower-*.f64 N/A

         \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{{m}^{2} \cdot \frac{-1}{4}}} \]

      3. unpow2 N/A

         \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{\left(m \cdot m\right)} \cdot \frac{-1}{4}} \]

      4. lower-*.f64 70.3

         \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{\left(m \cdot m\right)} \cdot -0.25} \]

   5. Applied rewrites 70.3%

      \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{\left(m \cdot m\right) \cdot -0.25}} \]

   6. Taylor expanded in K around 0

      \[\leadsto \color{blue}{\cos \left(\mathsf{neg}\left(M\right)\right)} \cdot e^{\left(m \cdot m\right) \cdot \frac{-1}{4}} \]
   7. Step-by-step derivation

      1. cos-neg-rev N/A

         \[\leadsto \color{blue}{\cos M} \cdot e^{\left(m \cdot m\right) \cdot \frac{-1}{4}} \]

      2. lower-cos.f64 97.3

         \[\leadsto \color{blue}{\cos M} \cdot e^{\left(m \cdot m\right) \cdot -0.25} \]

   8. Applied rewrites 97.3%

      \[\leadsto \color{blue}{\cos M} \cdot e^{\left(m \cdot m\right) \cdot -0.25} \]

   9. Taylor expanded in M around 0

      \[\leadsto 1 \cdot e^{\left(m \cdot m\right) \cdot \frac{-1}{4}} \]
   10. Step-by-step derivation

   11. Applied rewrites 97.3%

       \[\leadsto 1 \cdot e^{\left(m \cdot m\right) \cdot -0.25} \]

   if -55 < m < -9.49999999999999986e-147

   1. Initial program 90.7%

      \[\cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in l around inf

      \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{-1 \cdot \ell}} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{\mathsf{neg}\left(\ell\right)}} \]

      2. lower-neg.f64 45.2

         \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{-\ell}} \]

   5. Applied rewrites 45.2%

      \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{-\ell}} \]

   6. Taylor expanded in K around 0

      \[\leadsto \color{blue}{\cos \left(\mathsf{neg}\left(M\right)\right)} \cdot e^{-\ell} \]
   7. Step-by-step derivation

      1. cos-neg-rev N/A

         \[\leadsto \color{blue}{\cos M} \cdot e^{-\ell} \]

      2. lower-cos.f64 45.5

         \[\leadsto \color{blue}{\cos M} \cdot e^{-\ell} \]

   8. Applied rewrites 45.5%

      \[\leadsto \color{blue}{\cos M} \cdot e^{-\ell} \]

   9. Taylor expanded in M around 0

      \[\leadsto 1 \cdot e^{-\ell} \]
   10. Step-by-step derivation

   11. Applied rewrites 45.5%

       \[\leadsto 1 \cdot e^{-\ell} \]

   if -9.49999999999999986e-147 < m

   1. Initial program 80.2%

      \[\cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in K around 0

      \[\leadsto \color{blue}{\cos \left(\mathsf{neg}\left(M\right)\right) \cdot e^{\left|m - n\right| - \left(\ell + {\left(\frac{1}{2} \cdot \left(m + n\right) - M\right)}^{2}\right)}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{e^{\left|m - n\right| - \left(\ell + {\left(\frac{1}{2} \cdot \left(m + n\right) - M\right)}^{2}\right)} \cdot \cos \left(\mathsf{neg}\left(M\right)\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{e^{\left|m - n\right| - \left(\ell + {\left(\frac{1}{2} \cdot \left(m + n\right) - M\right)}^{2}\right)} \cdot \cos \left(\mathsf{neg}\left(M\right)\right)} \]

   5. Applied rewrites 96.7%

      \[\leadsto \color{blue}{e^{\left|m - n\right| - \left({\left(\mathsf{fma}\left(n + m, 0.5, -M\right)\right)}^{2} + \ell\right)} \cdot \cos M} \]

   6. Taylor expanded in n around inf

      \[\leadsto e^{\frac{-1}{4} \cdot {n}^{2}} \cdot \cos M \]
   7. Step-by-step derivation

   8. Applied rewrites 50.3%

      \[\leadsto e^{\left(n \cdot n\right) \cdot -0.25} \cdot \cos M \]

   9. Taylor expanded in M around 0

      \[\leadsto e^{\left(n \cdot n\right) \cdot \frac{-1}{4}} \cdot 1 \]
   10. Step-by-step derivation

   11. Applied rewrites 50.2%

       \[\leadsto e^{\left(n \cdot n\right) \cdot -0.25} \cdot 1 \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 8: 34.1% accurate, 3.3× speedup

Math

\[\begin{array}{l} \\ 1 \cdot e^{-\ell} \end{array} \]

FPCore

(FPCore (K m n M l) :precision binary64 (* 1.0 (exp (- l))))

C

double code(double K, double m, double n, double M, double l) {
	return 1.0 * exp(-l);
}

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(k, m, n, m_1, l)
use fmin_fmax_functions
    real(8), intent (in) :: k
    real(8), intent (in) :: m
    real(8), intent (in) :: n
    real(8), intent (in) :: m_1
    real(8), intent (in) :: l
    code = 1.0d0 * exp(-l)
end function

Java

public static double code(double K, double m, double n, double M, double l) {
	return 1.0 * Math.exp(-l);
}

Python

def code(K, m, n, M, l):
	return 1.0 * math.exp(-l)

Julia

function code(K, m, n, M, l)
	return Float64(1.0 * exp(Float64(-l)))
end

MATLAB

function tmp = code(K, m, n, M, l)
	tmp = 1.0 * exp(-l);
end

Wolfram

code[K_, m_, n_, M_, l_] := N[(1.0 * N[Exp[(-l)], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 79.4%

   \[\cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]
2. Add Preprocessing

3. Taylor expanded in l around inf

   \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{-1 \cdot \ell}} \]
4. Step-by-step derivation

   1. mul-1-neg N/A

      \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{\mathsf{neg}\left(\ell\right)}} \]

   2. lower-neg.f64 33.5

      \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{-\ell}} \]

5. Applied rewrites 33.5%

   \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{-\ell}} \]

6. Taylor expanded in K around 0

   \[\leadsto \color{blue}{\cos \left(\mathsf{neg}\left(M\right)\right)} \cdot e^{-\ell} \]
7. Step-by-step derivation

   1. cos-neg-rev N/A

      \[\leadsto \color{blue}{\cos M} \cdot e^{-\ell} \]

   2. lower-cos.f64 39.3

      \[\leadsto \color{blue}{\cos M} \cdot e^{-\ell} \]

8. Applied rewrites 39.3%

   \[\leadsto \color{blue}{\cos M} \cdot e^{-\ell} \]

9. Taylor expanded in M around 0

   \[\leadsto 1 \cdot e^{-\ell} \]
10. Step-by-step derivation

11. Applied rewrites 38.9%

    \[\leadsto 1 \cdot e^{-\ell} \]
12. Add Preprocessing

Reproduce

herbie shell --seed 2024352 
(FPCore (K m n M l)
  :name "Maksimov and Kolovsky, Equation (32)"
  :precision binary64
  (* (cos (- (/ (* K (+ m n)) 2.0) M)) (exp (- (- (pow (- (/ (+ m n) 2.0) M) 2.0)) (- l (fabs (- m n)))))))