Maksimov and Kolovsky, Equation (32)

Percentage Accurate: 76.0% → 96.6%

Time: 4.9s

Alternatives: 7

Speedup: 3.4×

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: 76.0% 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, 0.6× speedup

Math

\[\begin{array}{l} [K, m, n, M, l] = \mathsf{sort}([K, m, n, M, l])\\ \\ \begin{array}{l} t_0 := \left|n - m\right|\\ t_1 := 0.5 \cdot \left(n + m\right) - M\\ \mathbf{if}\;\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)} \leq -0.1:\\ \;\;\;\;e^{t\_0 - \left(\ell + 0.25 \cdot \left(\left(m + n\right) \cdot \left(m + n\right)\right)\right)} \cdot \sin \left(-0.5 \cdot \left(K \cdot m\right)\right)\\ \mathbf{else}:\\ \;\;\;\;1 \cdot e^{t\_0 - \mathsf{fma}\left(t\_1, t\_1, \ell\right)}\\ \end{array} \end{array} \]

FPCore

NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
(FPCore (K m n M l)
 :precision binary64
 (let* ((t_0 (fabs (- n m))) (t_1 (- (* 0.5 (+ n m)) M)))
   (if (<=
        (*
         (cos (- (/ (* K (+ m n)) 2.0) M))
         (exp (- (- (pow (- (/ (+ m n) 2.0) M) 2.0)) (- l (fabs (- m n))))))
        -0.1)
     (*
      (exp (- t_0 (+ l (* 0.25 (* (+ m n) (+ m n))))))
      (sin (* -0.5 (* K m))))
     (* 1.0 (exp (- t_0 (fma t_1 t_1 l)))))))

C

assert(K < m && m < n && n < M && M < l);
double code(double K, double m, double n, double M, double l) {
	double t_0 = fabs((n - m));
	double t_1 = (0.5 * (n + m)) - M;
	double tmp;
	if ((cos((((K * (m + n)) / 2.0) - M)) * exp((-pow((((m + n) / 2.0) - M), 2.0) - (l - fabs((m - n)))))) <= -0.1) {
		tmp = exp((t_0 - (l + (0.25 * ((m + n) * (m + n)))))) * sin((-0.5 * (K * m)));
	} else {
		tmp = 1.0 * exp((t_0 - fma(t_1, t_1, l)));
	}
	return tmp;
}

Julia

K, m, n, M, l = sort([K, m, n, M, l])
function code(K, m, n, M, l)
	t_0 = abs(Float64(n - m))
	t_1 = Float64(Float64(0.5 * Float64(n + m)) - M)
	tmp = 0.0
	if (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)))))) <= -0.1)
		tmp = Float64(exp(Float64(t_0 - Float64(l + Float64(0.25 * Float64(Float64(m + n) * Float64(m + n)))))) * sin(Float64(-0.5 * Float64(K * m))));
	else
		tmp = Float64(1.0 * exp(Float64(t_0 - fma(t_1, t_1, l))));
	end
	return tmp
end

Wolfram

NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
code[K_, m_, n_, M_, l_] := Block[{t$95$0 = N[Abs[N[(n - m), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[(0.5 * N[(n + m), $MachinePrecision]), $MachinePrecision] - M), $MachinePrecision]}, If[LessEqual[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], -0.1], N[(N[Exp[N[(t$95$0 - N[(l + N[(0.25 * N[(N[(m + n), $MachinePrecision] * N[(m + n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(-0.5 * N[(K * m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(1.0 * N[Exp[N[(t$95$0 - N[(t$95$1 * t$95$1 + l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (cos.f64 (-.f64 (/.f64 (*.f64 K (+.f64 m n)) #s(literal 2 binary64)) M)) (exp.f64 (-.f64 (neg.f64 (pow.f64 (-.f64 (/.f64 (+.f64 m n) #s(literal 2 binary64)) M) #s(literal 2 binary64))) (-.f64 l (fabs.f64 (-.f64 m n)))))) < -0.10000000000000001

   1. Initial program 76.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. Step-by-step derivation

      1. lift-cos.f64 N/A

         \[\leadsto \color{blue}{\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. lift--.f64 N/A

         \[\leadsto \cos \color{blue}{\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)} \]

      3. lift-/.f64 N/A

         \[\leadsto \cos \left(\color{blue}{\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)} \]

      4. lift-*.f64 N/A

         \[\leadsto \cos \left(\frac{\color{blue}{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)} \]

      5. lift-+.f64 N/A

         \[\leadsto \cos \left(\frac{K \cdot \color{blue}{\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)} \]

      6. cos-neg-rev N/A

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

      7. sin-+PI/2-rev N/A

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

      8. lower-sin.f64 N/A

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

      9. lower-+.f64 N/A

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

   3. Applied rewrites 75.8%

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

   4. Taylor expanded in M around 0

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

      1. lower-*.f64 N/A

         \[\leadsto e^{\left|m - n\right| - \left(\ell + \frac{1}{4} \cdot {\left(m + n\right)}^{2}\right)} \cdot \color{blue}{\sin \left(\frac{1}{2} \cdot \mathsf{PI}\left(\right) - \frac{1}{2} \cdot \left(K \cdot \left(m + n\right)\right)\right)} \]

   6. Applied rewrites 66.3%

      \[\leadsto \color{blue}{e^{\left|n - m\right| - \left(\ell + 0.25 \cdot \left(\left(m + n\right) \cdot \left(m + n\right)\right)\right)} \cdot \sin \left(0.5 \cdot \pi - 0.5 \cdot \left(K \cdot \left(m + n\right)\right)\right)} \]

   7. Taylor expanded in m around inf

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

      1. lower-*.f64 N/A

         \[\leadsto e^{\left|n - m\right| - \left(\ell + \frac{1}{4} \cdot \left(\left(m + n\right) \cdot \left(m + n\right)\right)\right)} \cdot \sin \left(\frac{-1}{2} \cdot \left(K \cdot m\right)\right) \]

      2. lift-*.f64 69.6

         \[\leadsto e^{\left|n - m\right| - \left(\ell + 0.25 \cdot \left(\left(m + n\right) \cdot \left(m + n\right)\right)\right)} \cdot \sin \left(-0.5 \cdot \left(K \cdot m\right)\right) \]

   9. Applied rewrites 69.6%

      \[\leadsto e^{\left|n - m\right| - \left(\ell + 0.25 \cdot \left(\left(m + n\right) \cdot \left(m + n\right)\right)\right)} \cdot \sin \left(-0.5 \cdot \left(K \cdot m\right)\right) \]

   if -0.10000000000000001 < (*.f64 (cos.f64 (-.f64 (/.f64 (*.f64 K (+.f64 m n)) #s(literal 2 binary64)) M)) (exp.f64 (-.f64 (neg.f64 (pow.f64 (-.f64 (/.f64 (+.f64 m n) #s(literal 2 binary64)) M) #s(literal 2 binary64))) (-.f64 l (fabs.f64 (-.f64 m n))))))

   1. Initial program 76.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. 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)}} \]
   3. Step-by-step derivation

      1. cos-neg N/A

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

      2. lower-*.f64 N/A

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

      3. lower-cos.f64 N/A

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

      4. lower-exp.f64 N/A

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

      5. lower--.f64 N/A

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

      6. fabs-sub N/A

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

      7. lower-fabs.f64 N/A

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

      8. lower--.f64 N/A

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

      9. +-commutative N/A

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

      10. unpow2 N/A

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

      11. lower-fma.f64 N/A

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

   4. Applied rewrites 96.6%

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

   5. Taylor expanded in M around 0

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

   7. Applied rewrites 96.2%

      \[\leadsto 1 \cdot e^{\color{blue}{\left|n - m\right| - \mathsf{fma}\left(0.5 \cdot \left(n + m\right) - M, 0.5 \cdot \left(n + m\right) - M, \ell\right)}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 96.3% accurate, 1.2× speedup

Math

\[\begin{array}{l} [K, m, n, M, l] = \mathsf{sort}([K, m, n, M, l])\\ \\ \begin{array}{l} t_0 := 0.5 \cdot \left(n + m\right) - M\\ \cos M \cdot e^{\left|n - m\right| - \mathsf{fma}\left(t\_0, t\_0, \ell\right)} \end{array} \end{array} \]

FPCore

NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
(FPCore (K m n M l)
 :precision binary64
 (let* ((t_0 (- (* 0.5 (+ n m)) M)))
   (* (cos M) (exp (- (fabs (- n m)) (fma t_0 t_0 l))))))

C

assert(K < m && m < n && n < M && M < l);
double code(double K, double m, double n, double M, double l) {
	double t_0 = (0.5 * (n + m)) - M;
	return cos(M) * exp((fabs((n - m)) - fma(t_0, t_0, l)));
}

Julia

K, m, n, M, l = sort([K, m, n, M, l])
function code(K, m, n, M, l)
	t_0 = Float64(Float64(0.5 * Float64(n + m)) - M)
	return Float64(cos(M) * exp(Float64(abs(Float64(n - m)) - fma(t_0, t_0, l))))
end

Wolfram

NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
code[K_, m_, n_, M_, l_] := Block[{t$95$0 = N[(N[(0.5 * N[(n + m), $MachinePrecision]), $MachinePrecision] - M), $MachinePrecision]}, N[(N[Cos[M], $MachinePrecision] * N[Exp[N[(N[Abs[N[(n - m), $MachinePrecision]], $MachinePrecision] - N[(t$95$0 * t$95$0 + l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Initial program 76.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. 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)}} \]
3. Step-by-step derivation

   1. cos-neg N/A

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

   2. lower-*.f64 N/A

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

   3. lower-cos.f64 N/A

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

   4. lower-exp.f64 N/A

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

   5. lower--.f64 N/A

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

   6. fabs-sub N/A

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

   7. lower-fabs.f64 N/A

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

   8. lower--.f64 N/A

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

   9. +-commutative N/A

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

   10. unpow2 N/A

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

   11. lower-fma.f64 N/A

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

4. Applied rewrites 96.6%

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

Alternative 3: 96.2% accurate, 2.2× speedup

Math

\[\begin{array}{l} [K, m, n, M, l] = \mathsf{sort}([K, m, n, M, l])\\ \\ \begin{array}{l} t_0 := 0.5 \cdot \left(n + m\right) - M\\ 1 \cdot e^{\left|n - m\right| - \mathsf{fma}\left(t\_0, t\_0, \ell\right)} \end{array} \end{array} \]

FPCore

NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
(FPCore (K m n M l)
 :precision binary64
 (let* ((t_0 (- (* 0.5 (+ n m)) M)))
   (* 1.0 (exp (- (fabs (- n m)) (fma t_0 t_0 l))))))

C

assert(K < m && m < n && n < M && M < l);
double code(double K, double m, double n, double M, double l) {
	double t_0 = (0.5 * (n + m)) - M;
	return 1.0 * exp((fabs((n - m)) - fma(t_0, t_0, l)));
}

Julia

K, m, n, M, l = sort([K, m, n, M, l])
function code(K, m, n, M, l)
	t_0 = Float64(Float64(0.5 * Float64(n + m)) - M)
	return Float64(1.0 * exp(Float64(abs(Float64(n - m)) - fma(t_0, t_0, l))))
end

Wolfram

NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
code[K_, m_, n_, M_, l_] := Block[{t$95$0 = N[(N[(0.5 * N[(n + m), $MachinePrecision]), $MachinePrecision] - M), $MachinePrecision]}, N[(1.0 * N[Exp[N[(N[Abs[N[(n - m), $MachinePrecision]], $MachinePrecision] - N[(t$95$0 * t$95$0 + l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Initial program 76.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. 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)}} \]
3. Step-by-step derivation

   1. cos-neg N/A

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

   2. lower-*.f64 N/A

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

   3. lower-cos.f64 N/A

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

   4. lower-exp.f64 N/A

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

   5. lower--.f64 N/A

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

   6. fabs-sub N/A

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

   7. lower-fabs.f64 N/A

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

   8. lower--.f64 N/A

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

   9. +-commutative N/A

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

   10. unpow2 N/A

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

   11. lower-fma.f64 N/A

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

4. Applied rewrites 96.6%

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

5. Taylor expanded in M around 0

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

7. Applied rewrites 96.2%

   \[\leadsto 1 \cdot e^{\color{blue}{\left|n - m\right| - \mathsf{fma}\left(0.5 \cdot \left(n + m\right) - M, 0.5 \cdot \left(n + m\right) - M, \ell\right)}} \]
8. Add Preprocessing

Alternative 4: 95.0% accurate, 2.3× speedup

Math

\[\begin{array}{l} [K, m, n, M, l] = \mathsf{sort}([K, m, n, M, l])\\ \\ \begin{array}{l} t_0 := 1 \cdot e^{-1 \cdot \left(M \cdot M\right)}\\ \mathbf{if}\;M \leq -5 \cdot 10^{+37}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;M \leq 2.6 \cdot 10^{+26}:\\ \;\;\;\;e^{\left|n - m\right| - \left(\ell + 0.25 \cdot \left(\left(m + n\right) \cdot \left(m + n\right)\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
(FPCore (K m n M l)
 :precision binary64
 (let* ((t_0 (* 1.0 (exp (* -1.0 (* M M))))))
   (if (<= M -5e+37)
     t_0
     (if (<= M 2.6e+26)
       (exp (- (fabs (- n m)) (+ l (* 0.25 (* (+ m n) (+ m n))))))
       t_0))))

C

assert(K < m && m < n && n < M && M < l);
double code(double K, double m, double n, double M, double l) {
	double t_0 = 1.0 * exp((-1.0 * (M * M)));
	double tmp;
	if (M <= -5e+37) {
		tmp = t_0;
	} else if (M <= 2.6e+26) {
		tmp = exp((fabs((n - m)) - (l + (0.25 * ((m + n) * (m + n))))));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
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) :: t_0
    real(8) :: tmp
    t_0 = 1.0d0 * exp(((-1.0d0) * (m_1 * m_1)))
    if (m_1 <= (-5d+37)) then
        tmp = t_0
    else if (m_1 <= 2.6d+26) then
        tmp = exp((abs((n - m)) - (l + (0.25d0 * ((m + n) * (m + n))))))
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

assert K < m && m < n && n < M && M < l;
public static double code(double K, double m, double n, double M, double l) {
	double t_0 = 1.0 * Math.exp((-1.0 * (M * M)));
	double tmp;
	if (M <= -5e+37) {
		tmp = t_0;
	} else if (M <= 2.6e+26) {
		tmp = Math.exp((Math.abs((n - m)) - (l + (0.25 * ((m + n) * (m + n))))));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

[K, m, n, M, l] = sort([K, m, n, M, l])
def code(K, m, n, M, l):
	t_0 = 1.0 * math.exp((-1.0 * (M * M)))
	tmp = 0
	if M <= -5e+37:
		tmp = t_0
	elif M <= 2.6e+26:
		tmp = math.exp((math.fabs((n - m)) - (l + (0.25 * ((m + n) * (m + n))))))
	else:
		tmp = t_0
	return tmp

Julia

K, m, n, M, l = sort([K, m, n, M, l])
function code(K, m, n, M, l)
	t_0 = Float64(1.0 * exp(Float64(-1.0 * Float64(M * M))))
	tmp = 0.0
	if (M <= -5e+37)
		tmp = t_0;
	elseif (M <= 2.6e+26)
		tmp = exp(Float64(abs(Float64(n - m)) - Float64(l + Float64(0.25 * Float64(Float64(m + n) * Float64(m + n))))));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

K, m, n, M, l = num2cell(sort([K, m, n, M, l])){:}
function tmp_2 = code(K, m, n, M, l)
	t_0 = 1.0 * exp((-1.0 * (M * M)));
	tmp = 0.0;
	if (M <= -5e+37)
		tmp = t_0;
	elseif (M <= 2.6e+26)
		tmp = exp((abs((n - m)) - (l + (0.25 * ((m + n) * (m + n))))));
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
code[K_, m_, n_, M_, l_] := Block[{t$95$0 = N[(1.0 * N[Exp[N[(-1.0 * N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[M, -5e+37], t$95$0, If[LessEqual[M, 2.6e+26], N[Exp[N[(N[Abs[N[(n - m), $MachinePrecision]], $MachinePrecision] - N[(l + N[(0.25 * N[(N[(m + n), $MachinePrecision] * N[(m + n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if M < -4.99999999999999989e37 or 2.60000000000000002e26 < M

   1. Initial program 76.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. 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)}} \]
   3. Step-by-step derivation

      1. cos-neg N/A

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

      2. lower-*.f64 N/A

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

      3. lower-cos.f64 N/A

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

      4. lower-exp.f64 N/A

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

      5. lower--.f64 N/A

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

      6. fabs-sub N/A

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

      7. lower-fabs.f64 N/A

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

      8. lower--.f64 N/A

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

      9. +-commutative N/A

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

      10. unpow2 N/A

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

      11. lower-fma.f64 N/A

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

   4. Applied rewrites 96.6%

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

   5. Taylor expanded in M around 0

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

   7. Applied rewrites 96.2%

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

   8. Taylor expanded in M around inf

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

      1. lower-*.f64 N/A

         \[\leadsto 1 \cdot e^{-1 \cdot {M}^{2}} \]

      2. unpow2 N/A

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

      3. lower-*.f64 53.8

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

   10. Applied rewrites 53.8%

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

   if -4.99999999999999989e37 < M < 2.60000000000000002e26

   1. Initial program 76.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. 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)}} \]
   3. Step-by-step derivation

      1. cos-neg N/A

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

      2. lower-*.f64 N/A

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

      3. lower-cos.f64 N/A

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

      4. lower-exp.f64 N/A

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

      5. lower--.f64 N/A

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

      6. fabs-sub N/A

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

      7. lower-fabs.f64 N/A

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

      8. lower--.f64 N/A

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

      9. +-commutative N/A

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

      10. unpow2 N/A

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

      11. lower-fma.f64 N/A

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

   4. Applied rewrites 96.6%

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

   5. Taylor expanded in M around 0

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

      1. lower-exp.f64 N/A

         \[\leadsto e^{\left|n - m\right| - \left(\ell + \frac{1}{4} \cdot {\left(m + n\right)}^{2}\right)} \]

      2. lower--.f64 N/A

         \[\leadsto e^{\left|n - m\right| - \left(\ell + \frac{1}{4} \cdot {\left(m + n\right)}^{2}\right)} \]

      3. lift--.f64 N/A

         \[\leadsto e^{\left|n - m\right| - \left(\ell + \frac{1}{4} \cdot {\left(m + n\right)}^{2}\right)} \]

      4. lift-fabs.f64 N/A

         \[\leadsto e^{\left|n - m\right| - \left(\ell + \frac{1}{4} \cdot {\left(m + n\right)}^{2}\right)} \]

      5. lower-+.f64 N/A

         \[\leadsto e^{\left|n - m\right| - \left(\ell + \frac{1}{4} \cdot {\left(m + n\right)}^{2}\right)} \]

      6. lower-*.f64 N/A

         \[\leadsto e^{\left|n - m\right| - \left(\ell + \frac{1}{4} \cdot {\left(m + n\right)}^{2}\right)} \]

      7. unpow2 N/A

         \[\leadsto e^{\left|n - m\right| - \left(\ell + \frac{1}{4} \cdot \left(\left(m + n\right) \cdot \left(m + n\right)\right)\right)} \]

      8. lower-*.f64 N/A

         \[\leadsto e^{\left|n - m\right| - \left(\ell + \frac{1}{4} \cdot \left(\left(m + n\right) \cdot \left(m + n\right)\right)\right)} \]

      9. lift-+.f64 N/A

         \[\leadsto e^{\left|n - m\right| - \left(\ell + \frac{1}{4} \cdot \left(\left(m + n\right) \cdot \left(m + n\right)\right)\right)} \]

      10. lift-+.f64 86.6

          \[\leadsto e^{\left|n - m\right| - \left(\ell + 0.25 \cdot \left(\left(m + n\right) \cdot \left(m + n\right)\right)\right)} \]

   7. Applied rewrites 86.6%

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

Alternative 5: 86.4% accurate, 3.4× speedup

Math

\[\begin{array}{l} [K, m, n, M, l] = \mathsf{sort}([K, m, n, M, l])\\ \\ \begin{array}{l} \mathbf{if}\;m \leq -18:\\ \;\;\;\;1 \cdot e^{-0.25 \cdot \left(m \cdot m\right)}\\ \mathbf{else}:\\ \;\;\;\;e^{\left|n\right| - \left(\ell + 0.25 \cdot \left(n \cdot n\right)\right)}\\ \end{array} \end{array} \]

FPCore

NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
(FPCore (K m n M l)
 :precision binary64
 (if (<= m -18.0)
   (* 1.0 (exp (* -0.25 (* m m))))
   (exp (- (fabs n) (+ l (* 0.25 (* n n)))))))

C

assert(K < m && m < n && n < M && M < l);
double code(double K, double m, double n, double M, double l) {
	double tmp;
	if (m <= -18.0) {
		tmp = 1.0 * exp((-0.25 * (m * m)));
	} else {
		tmp = exp((fabs(n) - (l + (0.25 * (n * n)))));
	}
	return tmp;
}

Fortran

NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
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 <= (-18.0d0)) then
        tmp = 1.0d0 * exp(((-0.25d0) * (m * m)))
    else
        tmp = exp((abs(n) - (l + (0.25d0 * (n * n)))))
    end if
    code = tmp
end function

Java

assert K < m && m < n && n < M && M < l;
public static double code(double K, double m, double n, double M, double l) {
	double tmp;
	if (m <= -18.0) {
		tmp = 1.0 * Math.exp((-0.25 * (m * m)));
	} else {
		tmp = Math.exp((Math.abs(n) - (l + (0.25 * (n * n)))));
	}
	return tmp;
}

Python

[K, m, n, M, l] = sort([K, m, n, M, l])
def code(K, m, n, M, l):
	tmp = 0
	if m <= -18.0:
		tmp = 1.0 * math.exp((-0.25 * (m * m)))
	else:
		tmp = math.exp((math.fabs(n) - (l + (0.25 * (n * n)))))
	return tmp

Julia

K, m, n, M, l = sort([K, m, n, M, l])
function code(K, m, n, M, l)
	tmp = 0.0
	if (m <= -18.0)
		tmp = Float64(1.0 * exp(Float64(-0.25 * Float64(m * m))));
	else
		tmp = exp(Float64(abs(n) - Float64(l + Float64(0.25 * Float64(n * n)))));
	end
	return tmp
end

MATLAB

K, m, n, M, l = num2cell(sort([K, m, n, M, l])){:}
function tmp_2 = code(K, m, n, M, l)
	tmp = 0.0;
	if (m <= -18.0)
		tmp = 1.0 * exp((-0.25 * (m * m)));
	else
		tmp = exp((abs(n) - (l + (0.25 * (n * n)))));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
code[K_, m_, n_, M_, l_] := If[LessEqual[m, -18.0], N[(1.0 * N[Exp[N[(-0.25 * N[(m * m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Exp[N[(N[Abs[n], $MachinePrecision] - N[(l + N[(0.25 * N[(n * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if m < -18

   1. Initial program 76.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. 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)}} \]
   3. Step-by-step derivation

      1. cos-neg N/A

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

      2. lower-*.f64 N/A

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

      3. lower-cos.f64 N/A

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

      4. lower-exp.f64 N/A

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

      5. lower--.f64 N/A

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

      6. fabs-sub N/A

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

      7. lower-fabs.f64 N/A

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

      8. lower--.f64 N/A

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

      9. +-commutative N/A

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

      10. unpow2 N/A

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

      11. lower-fma.f64 N/A

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

   4. Applied rewrites 96.6%

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

   5. Taylor expanded in M around 0

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

   7. Applied rewrites 96.2%

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

   8. Taylor expanded in m around inf

      \[\leadsto 1 \cdot e^{\frac{-1}{4} \cdot {m}^{2}} \]
   9. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto 1 \cdot e^{\frac{-1}{4} \cdot {m}^{2}} \]

      2. unpow2 N/A

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

      3. lower-*.f64 54.1

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

   10. Applied rewrites 54.1%

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

   if -18 < m

   1. Initial program 76.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. 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)}} \]
   3. Step-by-step derivation

      1. cos-neg N/A

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

      2. lower-*.f64 N/A

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

      3. lower-cos.f64 N/A

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

      4. lower-exp.f64 N/A

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

      5. lower--.f64 N/A

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

      6. fabs-sub N/A

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

      7. lower-fabs.f64 N/A

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

      8. lower--.f64 N/A

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

      9. +-commutative N/A

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

      10. unpow2 N/A

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

      11. lower-fma.f64 N/A

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

   4. Applied rewrites 96.6%

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

   5. Taylor expanded in M around 0

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

      1. lower-exp.f64 N/A

         \[\leadsto e^{\left|n - m\right| - \left(\ell + \frac{1}{4} \cdot {\left(m + n\right)}^{2}\right)} \]

      2. lower--.f64 N/A

         \[\leadsto e^{\left|n - m\right| - \left(\ell + \frac{1}{4} \cdot {\left(m + n\right)}^{2}\right)} \]

      3. lift--.f64 N/A

         \[\leadsto e^{\left|n - m\right| - \left(\ell + \frac{1}{4} \cdot {\left(m + n\right)}^{2}\right)} \]

      4. lift-fabs.f64 N/A

         \[\leadsto e^{\left|n - m\right| - \left(\ell + \frac{1}{4} \cdot {\left(m + n\right)}^{2}\right)} \]

      5. lower-+.f64 N/A

         \[\leadsto e^{\left|n - m\right| - \left(\ell + \frac{1}{4} \cdot {\left(m + n\right)}^{2}\right)} \]

      6. lower-*.f64 N/A

         \[\leadsto e^{\left|n - m\right| - \left(\ell + \frac{1}{4} \cdot {\left(m + n\right)}^{2}\right)} \]

      7. unpow2 N/A

         \[\leadsto e^{\left|n - m\right| - \left(\ell + \frac{1}{4} \cdot \left(\left(m + n\right) \cdot \left(m + n\right)\right)\right)} \]

      8. lower-*.f64 N/A

         \[\leadsto e^{\left|n - m\right| - \left(\ell + \frac{1}{4} \cdot \left(\left(m + n\right) \cdot \left(m + n\right)\right)\right)} \]

      9. lift-+.f64 N/A

         \[\leadsto e^{\left|n - m\right| - \left(\ell + \frac{1}{4} \cdot \left(\left(m + n\right) \cdot \left(m + n\right)\right)\right)} \]

      10. lift-+.f64 86.6

          \[\leadsto e^{\left|n - m\right| - \left(\ell + 0.25 \cdot \left(\left(m + n\right) \cdot \left(m + n\right)\right)\right)} \]

   7. Applied rewrites 86.6%

      \[\leadsto e^{\left|n - m\right| - \left(\ell + 0.25 \cdot \left(\left(m + n\right) \cdot \left(m + n\right)\right)\right)} \]

   8. Taylor expanded in m around 0

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

      1. pow2 N/A

         \[\leadsto e^{\left|n - m\right| - \left(\ell + \frac{1}{4} \cdot \left(n \cdot n\right)\right)} \]

      2. lift-*.f64 60.9

         \[\leadsto e^{\left|n - m\right| - \left(\ell + 0.25 \cdot \left(n \cdot n\right)\right)} \]

   10. Applied rewrites 60.9%

       \[\leadsto e^{\left|n - m\right| - \left(\ell + 0.25 \cdot \left(n \cdot n\right)\right)} \]

   11. Taylor expanded in m around 0

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

   13. Applied rewrites 68.5%

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

Alternative 6: 75.0% accurate, 3.3× speedup

Math

\[\begin{array}{l} [K, m, n, M, l] = \mathsf{sort}([K, m, n, M, l])\\ \\ \begin{array}{l} t_0 := 1 \cdot e^{-0.25 \cdot \left(m \cdot m\right)}\\ \mathbf{if}\;m \leq -3.2 \cdot 10^{+41}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;m \leq 6.2 \cdot 10^{-5}:\\ \;\;\;\;1 \cdot e^{-1 \cdot \left(M \cdot M\right)}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
(FPCore (K m n M l)
 :precision binary64
 (let* ((t_0 (* 1.0 (exp (* -0.25 (* m m))))))
   (if (<= m -3.2e+41)
     t_0
     (if (<= m 6.2e-5) (* 1.0 (exp (* -1.0 (* M M)))) t_0))))

C

assert(K < m && m < n && n < M && M < l);
double code(double K, double m, double n, double M, double l) {
	double t_0 = 1.0 * exp((-0.25 * (m * m)));
	double tmp;
	if (m <= -3.2e+41) {
		tmp = t_0;
	} else if (m <= 6.2e-5) {
		tmp = 1.0 * exp((-1.0 * (M * M)));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
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) :: t_0
    real(8) :: tmp
    t_0 = 1.0d0 * exp(((-0.25d0) * (m * m)))
    if (m <= (-3.2d+41)) then
        tmp = t_0
    else if (m <= 6.2d-5) then
        tmp = 1.0d0 * exp(((-1.0d0) * (m_1 * m_1)))
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

assert K < m && m < n && n < M && M < l;
public static double code(double K, double m, double n, double M, double l) {
	double t_0 = 1.0 * Math.exp((-0.25 * (m * m)));
	double tmp;
	if (m <= -3.2e+41) {
		tmp = t_0;
	} else if (m <= 6.2e-5) {
		tmp = 1.0 * Math.exp((-1.0 * (M * M)));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

[K, m, n, M, l] = sort([K, m, n, M, l])
def code(K, m, n, M, l):
	t_0 = 1.0 * math.exp((-0.25 * (m * m)))
	tmp = 0
	if m <= -3.2e+41:
		tmp = t_0
	elif m <= 6.2e-5:
		tmp = 1.0 * math.exp((-1.0 * (M * M)))
	else:
		tmp = t_0
	return tmp

Julia

K, m, n, M, l = sort([K, m, n, M, l])
function code(K, m, n, M, l)
	t_0 = Float64(1.0 * exp(Float64(-0.25 * Float64(m * m))))
	tmp = 0.0
	if (m <= -3.2e+41)
		tmp = t_0;
	elseif (m <= 6.2e-5)
		tmp = Float64(1.0 * exp(Float64(-1.0 * Float64(M * M))));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

K, m, n, M, l = num2cell(sort([K, m, n, M, l])){:}
function tmp_2 = code(K, m, n, M, l)
	t_0 = 1.0 * exp((-0.25 * (m * m)));
	tmp = 0.0;
	if (m <= -3.2e+41)
		tmp = t_0;
	elseif (m <= 6.2e-5)
		tmp = 1.0 * exp((-1.0 * (M * M)));
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
code[K_, m_, n_, M_, l_] := Block[{t$95$0 = N[(1.0 * N[Exp[N[(-0.25 * N[(m * m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[m, -3.2e+41], t$95$0, If[LessEqual[m, 6.2e-5], N[(1.0 * N[Exp[N[(-1.0 * N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if m < -3.2000000000000001e41 or 6.20000000000000027e-5 < m

   1. Initial program 76.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. 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)}} \]
   3. Step-by-step derivation

      1. cos-neg N/A

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

      2. lower-*.f64 N/A

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

      3. lower-cos.f64 N/A

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

      4. lower-exp.f64 N/A

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

      5. lower--.f64 N/A

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

      6. fabs-sub N/A

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

      7. lower-fabs.f64 N/A

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

      8. lower--.f64 N/A

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

      9. +-commutative N/A

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

      10. unpow2 N/A

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

      11. lower-fma.f64 N/A

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

   4. Applied rewrites 96.6%

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

   5. Taylor expanded in M around 0

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

   7. Applied rewrites 96.2%

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

   8. Taylor expanded in m around inf

      \[\leadsto 1 \cdot e^{\frac{-1}{4} \cdot {m}^{2}} \]
   9. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto 1 \cdot e^{\frac{-1}{4} \cdot {m}^{2}} \]

      2. unpow2 N/A

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

      3. lower-*.f64 54.1

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

   10. Applied rewrites 54.1%

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

   if -3.2000000000000001e41 < m < 6.20000000000000027e-5

   1. Initial program 76.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. 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)}} \]
   3. Step-by-step derivation

      1. cos-neg N/A

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

      2. lower-*.f64 N/A

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

      3. lower-cos.f64 N/A

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

      4. lower-exp.f64 N/A

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

      5. lower--.f64 N/A

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

      6. fabs-sub N/A

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

      7. lower-fabs.f64 N/A

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

      8. lower--.f64 N/A

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

      9. +-commutative N/A

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

      10. unpow2 N/A

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

      11. lower-fma.f64 N/A

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

   4. Applied rewrites 96.6%

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

   5. Taylor expanded in M around 0

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

   7. Applied rewrites 96.2%

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

   8. Taylor expanded in M around inf

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

      1. lower-*.f64 N/A

         \[\leadsto 1 \cdot e^{-1 \cdot {M}^{2}} \]

      2. unpow2 N/A

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

      3. lower-*.f64 53.8

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

   10. Applied rewrites 53.8%

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

Alternative 7: 53.8% accurate, 4.6× speedup

Math

\[\begin{array}{l} [K, m, n, M, l] = \mathsf{sort}([K, m, n, M, l])\\ \\ 1 \cdot e^{-1 \cdot \left(M \cdot M\right)} \end{array} \]

FPCore

NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
(FPCore (K m n M l) :precision binary64 (* 1.0 (exp (* -1.0 (* M M)))))

C

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

Fortran

NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
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(((-1.0d0) * (m_1 * m_1)))
end function

Java

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

Python

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

Julia

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

MATLAB

K, m, n, M, l = num2cell(sort([K, m, n, M, l])){:}
function tmp = code(K, m, n, M, l)
	tmp = 1.0 * exp((-1.0 * (M * M)));
end

Wolfram

NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
code[K_, m_, n_, M_, l_] := N[(1.0 * N[Exp[N[(-1.0 * N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 76.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. 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)}} \]
3. Step-by-step derivation

   1. cos-neg N/A

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

   2. lower-*.f64 N/A

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

   3. lower-cos.f64 N/A

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

   4. lower-exp.f64 N/A

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

   5. lower--.f64 N/A

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

   6. fabs-sub N/A

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

   7. lower-fabs.f64 N/A

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

   8. lower--.f64 N/A

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

   9. +-commutative N/A

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

   10. unpow2 N/A

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

   11. lower-fma.f64 N/A

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

4. Applied rewrites 96.6%

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

5. Taylor expanded in M around 0

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

7. Applied rewrites 96.2%

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

8. Taylor expanded in M around inf

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

   1. lower-*.f64 N/A

      \[\leadsto 1 \cdot e^{-1 \cdot {M}^{2}} \]

   2. unpow2 N/A

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

   3. lower-*.f64 53.8

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

10. Applied rewrites 53.8%

    \[\leadsto 1 \cdot e^{-1 \cdot \left(M \cdot M\right)} \]
11. Add Preprocessing

Reproduce

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