Maksimov and Kolovsky, Equation (32)

Percentage Accurate: 75.5% → 96.5%

Time: 5.1s

Alternatives: 10

Speedup: 1.5×

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.5% accurate, 1.1× speedup

Math

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

FPCore

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

C

double code(double K, double m, double n, double M, double l) {
	return cos(M) * exp((fabs((m - n)) - (pow(((0.5 * (n + m)) - M), 2.0) + 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 = cos(m_1) * exp((abs((m - n)) - ((((0.5d0 * (n + m)) - m_1) ** 2.0d0) + l)))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 77.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. 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. lower-+.f64 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)} \]

5. Applied rewrites 96.0%

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

6. Final simplification 96.0%

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

Alternative 2: 94.1% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;M \leq -2 \cdot 10^{+114} \lor \neg \left(M \leq 20000\right):\\ \;\;\;\;1 \cdot e^{\left(-M\right) \cdot M}\\ \mathbf{else}:\\ \;\;\;\;e^{\left|m - n\right| - \left(\ell + 0.25 \cdot {\left(m + n\right)}^{2}\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (K m n M l)
 :precision binary64
 (if (or (<= M -2e+114) (not (<= M 20000.0)))
   (* 1.0 (exp (* (- M) M)))
   (exp (- (fabs (- m n)) (+ l (* 0.25 (pow (+ m n) 2.0)))))))

C

double code(double K, double m, double n, double M, double l) {
	double tmp;
	if ((M <= -2e+114) || !(M <= 20000.0)) {
		tmp = 1.0 * exp((-M * M));
	} else {
		tmp = exp((fabs((m - n)) - (l + (0.25 * pow((m + n), 2.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_1 <= (-2d+114)) .or. (.not. (m_1 <= 20000.0d0))) then
        tmp = 1.0d0 * exp((-m_1 * m_1))
    else
        tmp = exp((abs((m - n)) - (l + (0.25d0 * ((m + n) ** 2.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 <= -2e+114) || !(M <= 20000.0)) {
		tmp = 1.0 * Math.exp((-M * M));
	} else {
		tmp = Math.exp((Math.abs((m - n)) - (l + (0.25 * Math.pow((m + n), 2.0)))));
	}
	return tmp;
}

Python

def code(K, m, n, M, l):
	tmp = 0
	if (M <= -2e+114) or not (M <= 20000.0):
		tmp = 1.0 * math.exp((-M * M))
	else:
		tmp = math.exp((math.fabs((m - n)) - (l + (0.25 * math.pow((m + n), 2.0)))))
	return tmp

Julia

function code(K, m, n, M, l)
	tmp = 0.0
	if ((M <= -2e+114) || !(M <= 20000.0))
		tmp = Float64(1.0 * exp(Float64(Float64(-M) * M)));
	else
		tmp = exp(Float64(abs(Float64(m - n)) - Float64(l + Float64(0.25 * (Float64(m + n) ^ 2.0)))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(K, m, n, M, l)
	tmp = 0.0;
	if ((M <= -2e+114) || ~((M <= 20000.0)))
		tmp = 1.0 * exp((-M * M));
	else
		tmp = exp((abs((m - n)) - (l + (0.25 * ((m + n) ^ 2.0)))));
	end
	tmp_2 = tmp;
end

Wolfram

code[K_, m_, n_, M_, l_] := If[Or[LessEqual[M, -2e+114], N[Not[LessEqual[M, 20000.0]], $MachinePrecision]], N[(1.0 * N[Exp[N[((-M) * M), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Exp[N[(N[Abs[N[(m - n), $MachinePrecision]], $MachinePrecision] - N[(l + N[(0.25 * N[Power[N[(m + n), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if M < -2e114 or 2e4 < M

   1. Initial program 78.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 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. 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. lower-+.f64 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)} \]

   5. Applied rewrites 98.0%

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

   6. Taylor expanded in M around inf

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

      1. lower-*.f64 N/A

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

      2. unpow2 N/A

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

      3. lower-*.f64 95.0

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

   8. Applied rewrites 95.0%

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

   9. Taylor expanded in M around 0

      \[\leadsto 1 \cdot e^{\color{blue}{-1 \cdot \left(M \cdot M\right)}} \]
   10. Step-by-step derivation

   11. Applied rewrites 95.0%

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

   if -2e114 < M < 2e4

   1. Initial program 76.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 M around 0

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

      1. *-commutative N/A

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

      2. 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}{\cos \left(\frac{1}{2} \cdot \left(K \cdot \left(m + n\right)\right)\right)} \]

   5. Applied rewrites 76.1%

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

   6. Taylor expanded in K around 0

      \[\leadsto e^{\left|n - m\right| - \left(\ell + \frac{1}{4} \cdot {\left(m + n\right)}^{2}\right)} \]
   7. 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-fabs.f64 N/A

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

      4. lift--.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. lower-pow.f64 N/A

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

      8. lift-+.f64 94.8

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

   8. Applied rewrites 94.8%

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

4. Final simplification 94.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;M \leq -2 \cdot 10^{+114} \lor \neg \left(M \leq 20000\right):\\ \;\;\;\;1 \cdot e^{\left(-M\right) \cdot M}\\ \mathbf{else}:\\ \;\;\;\;e^{\left|m - n\right| - \left(\ell + 0.25 \cdot {\left(m + n\right)}^{2}\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 65.0% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;n \leq 5.6 \cdot 10^{-273}:\\ \;\;\;\;\cos M \cdot e^{-0.25 \cdot \left(m \cdot m\right)}\\ \mathbf{elif}\;n \leq 6.5 \cdot 10^{-211}:\\ \;\;\;\;\cos M \cdot e^{-\ell}\\ \mathbf{elif}\;n \leq 54:\\ \;\;\;\;\cos M \cdot e^{\left(-M\right) \cdot M}\\ \mathbf{else}:\\ \;\;\;\;e^{-0.25 \cdot \left(n \cdot n\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (K m n M l)
 :precision binary64
 (if (<= n 5.6e-273)
   (* (cos M) (exp (* -0.25 (* m m))))
   (if (<= n 6.5e-211)
     (* (cos M) (exp (- l)))
     (if (<= n 54.0) (* (cos M) (exp (* (- M) M))) (exp (* -0.25 (* n n)))))))

C

double code(double K, double m, double n, double M, double l) {
	double tmp;
	if (n <= 5.6e-273) {
		tmp = cos(M) * exp((-0.25 * (m * m)));
	} else if (n <= 6.5e-211) {
		tmp = cos(M) * exp(-l);
	} else if (n <= 54.0) {
		tmp = cos(M) * exp((-M * M));
	} else {
		tmp = exp((-0.25 * (n * n)));
	}
	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 <= 5.6d-273) then
        tmp = cos(m_1) * exp(((-0.25d0) * (m * m)))
    else if (n <= 6.5d-211) then
        tmp = cos(m_1) * exp(-l)
    else if (n <= 54.0d0) then
        tmp = cos(m_1) * exp((-m_1 * m_1))
    else
        tmp = exp(((-0.25d0) * (n * n)))
    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 <= 5.6e-273) {
		tmp = Math.cos(M) * Math.exp((-0.25 * (m * m)));
	} else if (n <= 6.5e-211) {
		tmp = Math.cos(M) * Math.exp(-l);
	} else if (n <= 54.0) {
		tmp = Math.cos(M) * Math.exp((-M * M));
	} else {
		tmp = Math.exp((-0.25 * (n * n)));
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

function tmp_2 = code(K, m, n, M, l)
	tmp = 0.0;
	if (n <= 5.6e-273)
		tmp = cos(M) * exp((-0.25 * (m * m)));
	elseif (n <= 6.5e-211)
		tmp = cos(M) * exp(-l);
	elseif (n <= 54.0)
		tmp = cos(M) * exp((-M * M));
	else
		tmp = exp((-0.25 * (n * n)));
	end
	tmp_2 = tmp;
end

Wolfram

code[K_, m_, n_, M_, l_] := If[LessEqual[n, 5.6e-273], N[(N[Cos[M], $MachinePrecision] * N[Exp[N[(-0.25 * N[(m * m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[n, 6.5e-211], N[(N[Cos[M], $MachinePrecision] * N[Exp[(-l)], $MachinePrecision]), $MachinePrecision], If[LessEqual[n, 54.0], N[(N[Cos[M], $MachinePrecision] * N[Exp[N[((-M) * M), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Exp[N[(-0.25 * N[(n * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if n < 5.59999999999999971e-273

   1. Initial program 77.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. 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. lower-+.f64 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)} \]

   5. Applied rewrites 95.6%

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

   6. Taylor expanded in m around inf

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

      1. lower-*.f64 N/A

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

      2. unpow2 N/A

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

      3. lower-*.f64 55.9

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

   8. Applied rewrites 55.9%

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

   if 5.59999999999999971e-273 < n < 6.4999999999999996e-211

   1. Initial program 84.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 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^{\mathsf{neg}\left(\ell\right)} \]

      2. lower-neg.f64 58.0

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

   5. Applied rewrites 58.0%

      \[\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 \cos M \cdot e^{-\ell} \]

      2. lift-cos.f64 68.6

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

   8. Applied rewrites 68.6%

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

   if 6.4999999999999996e-211 < n < 54

   1. Initial program 78.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 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. 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. lower-+.f64 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)} \]

   5. Applied rewrites 90.5%

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

   6. Taylor expanded in M around inf

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

      1. lower-*.f64 N/A

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

      2. unpow2 N/A

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

      3. lower-*.f64 69.8

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

   8. Applied rewrites 69.8%

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

   if 54 < n

   1. Initial program 73.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 M around 0

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

      1. *-commutative N/A

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

      2. 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}{\cos \left(\frac{1}{2} \cdot \left(K \cdot \left(m + n\right)\right)\right)} \]

   5. Applied rewrites 73.7%

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

   6. Taylor expanded in K around 0

      \[\leadsto e^{\left|n - m\right| - \left(\ell + \frac{1}{4} \cdot {\left(m + n\right)}^{2}\right)} \]
   7. 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-fabs.f64 N/A

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

      4. lift--.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. lower-pow.f64 N/A

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

      8. lift-+.f64 98.3

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

   8. Applied rewrites 98.3%

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

   9. Taylor expanded in n around inf

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

       1. lower-*.f64 N/A

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

       2. pow2 N/A

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

       3. lift-*.f64 96.5

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

   11. Applied rewrites 96.5%

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

4. Final simplification 68.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;n \leq 5.6 \cdot 10^{-273}:\\ \;\;\;\;\cos M \cdot e^{-0.25 \cdot \left(m \cdot m\right)}\\ \mathbf{elif}\;n \leq 6.5 \cdot 10^{-211}:\\ \;\;\;\;\cos M \cdot e^{-\ell}\\ \mathbf{elif}\;n \leq 54:\\ \;\;\;\;\cos M \cdot e^{\left(-M\right) \cdot M}\\ \mathbf{else}:\\ \;\;\;\;e^{-0.25 \cdot \left(n \cdot n\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 65.0% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;n \leq 5.6 \cdot 10^{-273}:\\ \;\;\;\;e^{-0.25 \cdot \left(m \cdot m\right)}\\ \mathbf{elif}\;n \leq 6.5 \cdot 10^{-211}:\\ \;\;\;\;\cos M \cdot e^{-\ell}\\ \mathbf{elif}\;n \leq 54:\\ \;\;\;\;\cos M \cdot e^{\left(-M\right) \cdot M}\\ \mathbf{else}:\\ \;\;\;\;e^{-0.25 \cdot \left(n \cdot n\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (K m n M l)
 :precision binary64
 (if (<= n 5.6e-273)
   (exp (* -0.25 (* m m)))
   (if (<= n 6.5e-211)
     (* (cos M) (exp (- l)))
     (if (<= n 54.0) (* (cos M) (exp (* (- M) M))) (exp (* -0.25 (* n n)))))))

C

double code(double K, double m, double n, double M, double l) {
	double tmp;
	if (n <= 5.6e-273) {
		tmp = exp((-0.25 * (m * m)));
	} else if (n <= 6.5e-211) {
		tmp = cos(M) * exp(-l);
	} else if (n <= 54.0) {
		tmp = cos(M) * exp((-M * M));
	} else {
		tmp = exp((-0.25 * (n * n)));
	}
	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 <= 5.6d-273) then
        tmp = exp(((-0.25d0) * (m * m)))
    else if (n <= 6.5d-211) then
        tmp = cos(m_1) * exp(-l)
    else if (n <= 54.0d0) then
        tmp = cos(m_1) * exp((-m_1 * m_1))
    else
        tmp = exp(((-0.25d0) * (n * n)))
    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 <= 5.6e-273) {
		tmp = Math.exp((-0.25 * (m * m)));
	} else if (n <= 6.5e-211) {
		tmp = Math.cos(M) * Math.exp(-l);
	} else if (n <= 54.0) {
		tmp = Math.cos(M) * Math.exp((-M * M));
	} else {
		tmp = Math.exp((-0.25 * (n * n)));
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

function tmp_2 = code(K, m, n, M, l)
	tmp = 0.0;
	if (n <= 5.6e-273)
		tmp = exp((-0.25 * (m * m)));
	elseif (n <= 6.5e-211)
		tmp = cos(M) * exp(-l);
	elseif (n <= 54.0)
		tmp = cos(M) * exp((-M * M));
	else
		tmp = exp((-0.25 * (n * n)));
	end
	tmp_2 = tmp;
end

Wolfram

code[K_, m_, n_, M_, l_] := If[LessEqual[n, 5.6e-273], N[Exp[N[(-0.25 * N[(m * m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[n, 6.5e-211], N[(N[Cos[M], $MachinePrecision] * N[Exp[(-l)], $MachinePrecision]), $MachinePrecision], If[LessEqual[n, 54.0], N[(N[Cos[M], $MachinePrecision] * N[Exp[N[((-M) * M), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Exp[N[(-0.25 * N[(n * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if n < 5.59999999999999971e-273

   1. Initial program 77.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 M around 0

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

      1. *-commutative N/A

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

      2. 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}{\cos \left(\frac{1}{2} \cdot \left(K \cdot \left(m + n\right)\right)\right)} \]

   5. Applied rewrites 70.0%

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

   6. Taylor expanded in K around 0

      \[\leadsto e^{\left|n - m\right| - \left(\ell + \frac{1}{4} \cdot {\left(m + n\right)}^{2}\right)} \]
   7. 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-fabs.f64 N/A

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

      4. lift--.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. lower-pow.f64 N/A

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

      8. lift-+.f64 87.1

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

   8. Applied rewrites 87.1%

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

   9. Taylor expanded in m around inf

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

       1. lower-*.f64 N/A

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

       2. unpow2 N/A

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

       3. lower-*.f64 55.9

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

   11. Applied rewrites 55.9%

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

   if 5.59999999999999971e-273 < n < 6.4999999999999996e-211

   1. Initial program 84.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 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^{\mathsf{neg}\left(\ell\right)} \]

      2. lower-neg.f64 58.0

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

   5. Applied rewrites 58.0%

      \[\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 \cos M \cdot e^{-\ell} \]

      2. lift-cos.f64 68.6

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

   8. Applied rewrites 68.6%

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

   if 6.4999999999999996e-211 < n < 54

   1. Initial program 78.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 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. 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. lower-+.f64 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)} \]

   5. Applied rewrites 90.5%

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

   6. Taylor expanded in M around inf

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

      1. lower-*.f64 N/A

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

      2. unpow2 N/A

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

      3. lower-*.f64 69.8

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

   8. Applied rewrites 69.8%

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

   if 54 < n

   1. Initial program 73.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 M around 0

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

      1. *-commutative N/A

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

      2. 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}{\cos \left(\frac{1}{2} \cdot \left(K \cdot \left(m + n\right)\right)\right)} \]

   5. Applied rewrites 73.7%

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

   6. Taylor expanded in K around 0

      \[\leadsto e^{\left|n - m\right| - \left(\ell + \frac{1}{4} \cdot {\left(m + n\right)}^{2}\right)} \]
   7. 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-fabs.f64 N/A

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

      4. lift--.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. lower-pow.f64 N/A

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

      8. lift-+.f64 98.3

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

   8. Applied rewrites 98.3%

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

   9. Taylor expanded in n around inf

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

       1. lower-*.f64 N/A

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

       2. pow2 N/A

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

       3. lift-*.f64 96.5

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

   11. Applied rewrites 96.5%

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

4. Final simplification 68.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;n \leq 5.6 \cdot 10^{-273}:\\ \;\;\;\;e^{-0.25 \cdot \left(m \cdot m\right)}\\ \mathbf{elif}\;n \leq 6.5 \cdot 10^{-211}:\\ \;\;\;\;\cos M \cdot e^{-\ell}\\ \mathbf{elif}\;n \leq 54:\\ \;\;\;\;\cos M \cdot e^{\left(-M\right) \cdot M}\\ \mathbf{else}:\\ \;\;\;\;e^{-0.25 \cdot \left(n \cdot n\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 65.0% accurate, 1.6× speedup

Math

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

FPCore

(FPCore (K m n M l)
 :precision binary64
 (if (<= n 5.6e-273)
   (exp (* -0.25 (* m m)))
   (if (<= n 6.5e-211)
     (* (cos M) (exp (- l)))
     (if (<= n 54.0) (* 1.0 (exp (* (- M) M))) (exp (* -0.25 (* n n)))))))

C

double code(double K, double m, double n, double M, double l) {
	double tmp;
	if (n <= 5.6e-273) {
		tmp = exp((-0.25 * (m * m)));
	} else if (n <= 6.5e-211) {
		tmp = cos(M) * exp(-l);
	} else if (n <= 54.0) {
		tmp = 1.0 * exp((-M * M));
	} else {
		tmp = exp((-0.25 * (n * n)));
	}
	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 <= 5.6d-273) then
        tmp = exp(((-0.25d0) * (m * m)))
    else if (n <= 6.5d-211) then
        tmp = cos(m_1) * exp(-l)
    else if (n <= 54.0d0) then
        tmp = 1.0d0 * exp((-m_1 * m_1))
    else
        tmp = exp(((-0.25d0) * (n * n)))
    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 <= 5.6e-273) {
		tmp = Math.exp((-0.25 * (m * m)));
	} else if (n <= 6.5e-211) {
		tmp = Math.cos(M) * Math.exp(-l);
	} else if (n <= 54.0) {
		tmp = 1.0 * Math.exp((-M * M));
	} else {
		tmp = Math.exp((-0.25 * (n * n)));
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 4 regimes

2. if n < 5.59999999999999971e-273

   1. Initial program 77.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 M around 0

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

      1. *-commutative N/A

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

      2. 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}{\cos \left(\frac{1}{2} \cdot \left(K \cdot \left(m + n\right)\right)\right)} \]

   5. Applied rewrites 70.0%

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

   6. Taylor expanded in K around 0

      \[\leadsto e^{\left|n - m\right| - \left(\ell + \frac{1}{4} \cdot {\left(m + n\right)}^{2}\right)} \]
   7. 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-fabs.f64 N/A

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

      4. lift--.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. lower-pow.f64 N/A

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

      8. lift-+.f64 87.1

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

   8. Applied rewrites 87.1%

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

   9. Taylor expanded in m around inf

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

       1. lower-*.f64 N/A

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

       2. unpow2 N/A

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

       3. lower-*.f64 55.9

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

   11. Applied rewrites 55.9%

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

   if 5.59999999999999971e-273 < n < 6.4999999999999996e-211

   1. Initial program 84.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 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^{\mathsf{neg}\left(\ell\right)} \]

      2. lower-neg.f64 58.0

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

   5. Applied rewrites 58.0%

      \[\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 \cos M \cdot e^{-\ell} \]

      2. lift-cos.f64 68.6

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

   8. Applied rewrites 68.6%

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

   if 6.4999999999999996e-211 < n < 54

   1. Initial program 78.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 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. 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. lower-+.f64 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)} \]

   5. Applied rewrites 90.5%

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

   6. Taylor expanded in M around inf

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

      1. lower-*.f64 N/A

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

      2. unpow2 N/A

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

      3. lower-*.f64 69.8

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

   8. Applied rewrites 69.8%

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

   9. Taylor expanded in M around 0

      \[\leadsto 1 \cdot e^{\color{blue}{-1 \cdot \left(M \cdot M\right)}} \]
   10. Step-by-step derivation

   11. Applied rewrites 69.8%

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

   if 54 < n

   1. Initial program 73.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 M around 0

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

      1. *-commutative N/A

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

      2. 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}{\cos \left(\frac{1}{2} \cdot \left(K \cdot \left(m + n\right)\right)\right)} \]

   5. Applied rewrites 73.7%

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

   6. Taylor expanded in K around 0

      \[\leadsto e^{\left|n - m\right| - \left(\ell + \frac{1}{4} \cdot {\left(m + n\right)}^{2}\right)} \]
   7. 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-fabs.f64 N/A

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

      4. lift--.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. lower-pow.f64 N/A

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

      8. lift-+.f64 98.3

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

   8. Applied rewrites 98.3%

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

   9. Taylor expanded in n around inf

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

       1. lower-*.f64 N/A

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

       2. pow2 N/A

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

       3. lift-*.f64 96.5

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

   11. Applied rewrites 96.5%

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

4. Final simplification 68.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;n \leq 5.6 \cdot 10^{-273}:\\ \;\;\;\;e^{-0.25 \cdot \left(m \cdot m\right)}\\ \mathbf{elif}\;n \leq 6.5 \cdot 10^{-211}:\\ \;\;\;\;\cos M \cdot e^{-\ell}\\ \mathbf{elif}\;n \leq 54:\\ \;\;\;\;1 \cdot e^{\left(-M\right) \cdot M}\\ \mathbf{else}:\\ \;\;\;\;e^{-0.25 \cdot \left(n \cdot n\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 64.6% accurate, 2.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;n \leq 1.1 \cdot 10^{-271}:\\ \;\;\;\;e^{-0.25 \cdot \left(m \cdot m\right)}\\ \mathbf{elif}\;n \leq 6.5 \cdot 10^{-211}:\\ \;\;\;\;\left(1 + -0.5 \cdot \left(M \cdot M\right)\right) \cdot e^{-\ell}\\ \mathbf{elif}\;n \leq 54:\\ \;\;\;\;1 \cdot e^{\left(-M\right) \cdot M}\\ \mathbf{else}:\\ \;\;\;\;e^{-0.25 \cdot \left(n \cdot n\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (K m n M l)
 :precision binary64
 (if (<= n 1.1e-271)
   (exp (* -0.25 (* m m)))
   (if (<= n 6.5e-211)
     (* (+ 1.0 (* -0.5 (* M M))) (exp (- l)))
     (if (<= n 54.0) (* 1.0 (exp (* (- M) M))) (exp (* -0.25 (* n n)))))))

C

double code(double K, double m, double n, double M, double l) {
	double tmp;
	if (n <= 1.1e-271) {
		tmp = exp((-0.25 * (m * m)));
	} else if (n <= 6.5e-211) {
		tmp = (1.0 + (-0.5 * (M * M))) * exp(-l);
	} else if (n <= 54.0) {
		tmp = 1.0 * exp((-M * M));
	} else {
		tmp = exp((-0.25 * (n * n)));
	}
	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 <= 1.1d-271) then
        tmp = exp(((-0.25d0) * (m * m)))
    else if (n <= 6.5d-211) then
        tmp = (1.0d0 + ((-0.5d0) * (m_1 * m_1))) * exp(-l)
    else if (n <= 54.0d0) then
        tmp = 1.0d0 * exp((-m_1 * m_1))
    else
        tmp = exp(((-0.25d0) * (n * n)))
    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 <= 1.1e-271) {
		tmp = Math.exp((-0.25 * (m * m)));
	} else if (n <= 6.5e-211) {
		tmp = (1.0 + (-0.5 * (M * M))) * Math.exp(-l);
	} else if (n <= 54.0) {
		tmp = 1.0 * Math.exp((-M * M));
	} else {
		tmp = Math.exp((-0.25 * (n * n)));
	}
	return tmp;
}

Python

def code(K, m, n, M, l):
	tmp = 0
	if n <= 1.1e-271:
		tmp = math.exp((-0.25 * (m * m)))
	elif n <= 6.5e-211:
		tmp = (1.0 + (-0.5 * (M * M))) * math.exp(-l)
	elif n <= 54.0:
		tmp = 1.0 * math.exp((-M * M))
	else:
		tmp = math.exp((-0.25 * (n * n)))
	return tmp

Julia

function code(K, m, n, M, l)
	tmp = 0.0
	if (n <= 1.1e-271)
		tmp = exp(Float64(-0.25 * Float64(m * m)));
	elseif (n <= 6.5e-211)
		tmp = Float64(Float64(1.0 + Float64(-0.5 * Float64(M * M))) * exp(Float64(-l)));
	elseif (n <= 54.0)
		tmp = Float64(1.0 * exp(Float64(Float64(-M) * M)));
	else
		tmp = exp(Float64(-0.25 * Float64(n * n)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(K, m, n, M, l)
	tmp = 0.0;
	if (n <= 1.1e-271)
		tmp = exp((-0.25 * (m * m)));
	elseif (n <= 6.5e-211)
		tmp = (1.0 + (-0.5 * (M * M))) * exp(-l);
	elseif (n <= 54.0)
		tmp = 1.0 * exp((-M * M));
	else
		tmp = exp((-0.25 * (n * n)));
	end
	tmp_2 = tmp;
end

Wolfram

code[K_, m_, n_, M_, l_] := If[LessEqual[n, 1.1e-271], N[Exp[N[(-0.25 * N[(m * m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[n, 6.5e-211], N[(N[(1.0 + N[(-0.5 * N[(M * M), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Exp[(-l)], $MachinePrecision]), $MachinePrecision], If[LessEqual[n, 54.0], N[(1.0 * N[Exp[N[((-M) * M), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Exp[N[(-0.25 * N[(n * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if n < 1.1e-271

   1. Initial program 78.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 0

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

      1. *-commutative N/A

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

      2. 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}{\cos \left(\frac{1}{2} \cdot \left(K \cdot \left(m + n\right)\right)\right)} \]

   5. Applied rewrites 70.4%

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

   6. Taylor expanded in K around 0

      \[\leadsto e^{\left|n - m\right| - \left(\ell + \frac{1}{4} \cdot {\left(m + n\right)}^{2}\right)} \]
   7. 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-fabs.f64 N/A

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

      4. lift--.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. lower-pow.f64 N/A

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

      8. lift-+.f64 87.3

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

   8. Applied rewrites 87.3%

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

   9. Taylor expanded in m around inf

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

       1. lower-*.f64 N/A

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

       2. unpow2 N/A

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

       3. lower-*.f64 55.9

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

   11. Applied rewrites 55.9%

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

   if 1.1e-271 < n < 6.4999999999999996e-211

   1. Initial program 82.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^{\mathsf{neg}\left(\ell\right)} \]

      2. lower-neg.f64 58.8

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

   5. Applied rewrites 58.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 \cos M \cdot e^{-\ell} \]

      2. lift-cos.f64 70.7

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

   8. Applied rewrites 70.7%

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

   9. Taylor expanded in M around 0

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

       1. lower-+.f64 N/A

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

       2. lower-*.f64 N/A

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

       3. pow2 N/A

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

       4. lift-*.f64 70.5

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

   11. Applied rewrites 70.5%

       \[\leadsto \left(1 + \color{blue}{-0.5 \cdot \left(M \cdot M\right)}\right) \cdot e^{-\ell} \]

   if 6.4999999999999996e-211 < n < 54

   1. Initial program 78.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 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. 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. lower-+.f64 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)} \]

   5. Applied rewrites 90.5%

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

   6. Taylor expanded in M around inf

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

      1. lower-*.f64 N/A

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

      2. unpow2 N/A

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

      3. lower-*.f64 69.8

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

   8. Applied rewrites 69.8%

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

   9. Taylor expanded in M around 0

      \[\leadsto 1 \cdot e^{\color{blue}{-1 \cdot \left(M \cdot M\right)}} \]
   10. Step-by-step derivation

   11. Applied rewrites 69.8%

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

   if 54 < n

   1. Initial program 73.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 M around 0

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

      1. *-commutative N/A

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

      2. 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}{\cos \left(\frac{1}{2} \cdot \left(K \cdot \left(m + n\right)\right)\right)} \]

   5. Applied rewrites 73.7%

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

   6. Taylor expanded in K around 0

      \[\leadsto e^{\left|n - m\right| - \left(\ell + \frac{1}{4} \cdot {\left(m + n\right)}^{2}\right)} \]
   7. 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-fabs.f64 N/A

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

      4. lift--.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. lower-pow.f64 N/A

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

      8. lift-+.f64 98.3

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

   8. Applied rewrites 98.3%

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

   9. Taylor expanded in n around inf

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

       1. lower-*.f64 N/A

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

       2. pow2 N/A

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

       3. lift-*.f64 96.5

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

   11. Applied rewrites 96.5%

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

4. Final simplification 68.2%

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

Alternative 7: 64.9% accurate, 2.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;n \leq 5.6 \cdot 10^{-273}:\\ \;\;\;\;e^{-0.25 \cdot \left(m \cdot m\right)}\\ \mathbf{elif}\;n \leq 6.5 \cdot 10^{-211}:\\ \;\;\;\;e^{-\ell}\\ \mathbf{elif}\;n \leq 54:\\ \;\;\;\;1 \cdot e^{\left(-M\right) \cdot M}\\ \mathbf{else}:\\ \;\;\;\;e^{-0.25 \cdot \left(n \cdot n\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (K m n M l)
 :precision binary64
 (if (<= n 5.6e-273)
   (exp (* -0.25 (* m m)))
   (if (<= n 6.5e-211)
     (exp (- l))
     (if (<= n 54.0) (* 1.0 (exp (* (- M) M))) (exp (* -0.25 (* n n)))))))

C

double code(double K, double m, double n, double M, double l) {
	double tmp;
	if (n <= 5.6e-273) {
		tmp = exp((-0.25 * (m * m)));
	} else if (n <= 6.5e-211) {
		tmp = exp(-l);
	} else if (n <= 54.0) {
		tmp = 1.0 * exp((-M * M));
	} else {
		tmp = exp((-0.25 * (n * n)));
	}
	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 <= 5.6d-273) then
        tmp = exp(((-0.25d0) * (m * m)))
    else if (n <= 6.5d-211) then
        tmp = exp(-l)
    else if (n <= 54.0d0) then
        tmp = 1.0d0 * exp((-m_1 * m_1))
    else
        tmp = exp(((-0.25d0) * (n * n)))
    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 <= 5.6e-273) {
		tmp = Math.exp((-0.25 * (m * m)));
	} else if (n <= 6.5e-211) {
		tmp = Math.exp(-l);
	} else if (n <= 54.0) {
		tmp = 1.0 * Math.exp((-M * M));
	} else {
		tmp = Math.exp((-0.25 * (n * n)));
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

function tmp_2 = code(K, m, n, M, l)
	tmp = 0.0;
	if (n <= 5.6e-273)
		tmp = exp((-0.25 * (m * m)));
	elseif (n <= 6.5e-211)
		tmp = exp(-l);
	elseif (n <= 54.0)
		tmp = 1.0 * exp((-M * M));
	else
		tmp = exp((-0.25 * (n * n)));
	end
	tmp_2 = tmp;
end

Wolfram

code[K_, m_, n_, M_, l_] := If[LessEqual[n, 5.6e-273], N[Exp[N[(-0.25 * N[(m * m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[n, 6.5e-211], N[Exp[(-l)], $MachinePrecision], If[LessEqual[n, 54.0], N[(1.0 * N[Exp[N[((-M) * M), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Exp[N[(-0.25 * N[(n * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if n < 5.59999999999999971e-273

   1. Initial program 77.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 M around 0

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

      1. *-commutative N/A

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

      2. 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}{\cos \left(\frac{1}{2} \cdot \left(K \cdot \left(m + n\right)\right)\right)} \]

   5. Applied rewrites 70.0%

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

   6. Taylor expanded in K around 0

      \[\leadsto e^{\left|n - m\right| - \left(\ell + \frac{1}{4} \cdot {\left(m + n\right)}^{2}\right)} \]
   7. 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-fabs.f64 N/A

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

      4. lift--.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. lower-pow.f64 N/A

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

      8. lift-+.f64 87.1

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

   8. Applied rewrites 87.1%

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

   9. Taylor expanded in m around inf

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

       1. lower-*.f64 N/A

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

       2. unpow2 N/A

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

       3. lower-*.f64 55.9

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

   11. Applied rewrites 55.9%

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

   if 5.59999999999999971e-273 < n < 6.4999999999999996e-211

   1. Initial program 84.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 M around 0

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

      1. *-commutative N/A

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

      2. 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}{\cos \left(\frac{1}{2} \cdot \left(K \cdot \left(m + n\right)\right)\right)} \]

   5. Applied rewrites 68.0%

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

   6. Taylor expanded in K around 0

      \[\leadsto e^{\left|n - m\right| - \left(\ell + \frac{1}{4} \cdot {\left(m + n\right)}^{2}\right)} \]
   7. 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-fabs.f64 N/A

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

      4. lift--.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. lower-pow.f64 N/A

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

      8. lift-+.f64 78.5

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

   8. Applied rewrites 78.5%

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

   9. Taylor expanded in l around inf

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

       1. lower-*.f64 52.8

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

   11. Applied rewrites 52.8%

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

   if 6.4999999999999996e-211 < n < 54

   1. Initial program 78.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 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. 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. lower-+.f64 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)} \]

   5. Applied rewrites 90.5%

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

   6. Taylor expanded in M around inf

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

      1. lower-*.f64 N/A

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

      2. unpow2 N/A

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

      3. lower-*.f64 69.8

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

   8. Applied rewrites 69.8%

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

   9. Taylor expanded in M around 0

      \[\leadsto 1 \cdot e^{\color{blue}{-1 \cdot \left(M \cdot M\right)}} \]
   10. Step-by-step derivation

   11. Applied rewrites 69.8%

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

   if 54 < n

   1. Initial program 73.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 M around 0

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

      1. *-commutative N/A

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

      2. 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}{\cos \left(\frac{1}{2} \cdot \left(K \cdot \left(m + n\right)\right)\right)} \]

   5. Applied rewrites 73.7%

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

   6. Taylor expanded in K around 0

      \[\leadsto e^{\left|n - m\right| - \left(\ell + \frac{1}{4} \cdot {\left(m + n\right)}^{2}\right)} \]
   7. 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-fabs.f64 N/A

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

      4. lift--.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. lower-pow.f64 N/A

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

      8. lift-+.f64 98.3

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

   8. Applied rewrites 98.3%

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

   9. Taylor expanded in n around inf

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

       1. lower-*.f64 N/A

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

       2. pow2 N/A

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

       3. lift-*.f64 96.5

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

   11. Applied rewrites 96.5%

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

4. Final simplification 67.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;n \leq 5.6 \cdot 10^{-273}:\\ \;\;\;\;e^{-0.25 \cdot \left(m \cdot m\right)}\\ \mathbf{elif}\;n \leq 6.5 \cdot 10^{-211}:\\ \;\;\;\;e^{-\ell}\\ \mathbf{elif}\;n \leq 54:\\ \;\;\;\;1 \cdot e^{\left(-M\right) \cdot M}\\ \mathbf{else}:\\ \;\;\;\;e^{-0.25 \cdot \left(n \cdot n\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 63.3% accurate, 2.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := e^{-0.25 \cdot \left(m \cdot m\right)}\\ \mathbf{if}\;n \leq 5.6 \cdot 10^{-273}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;n \leq 1.95 \cdot 10^{-208}:\\ \;\;\;\;e^{-\ell}\\ \mathbf{elif}\;n \leq 1.15 \cdot 10^{-35}:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;e^{-0.25 \cdot \left(n \cdot n\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (K m n M l)
 :precision binary64
 (let* ((t_0 (exp (* -0.25 (* m m)))))
   (if (<= n 5.6e-273)
     t_0
     (if (<= n 1.95e-208)
       (exp (- l))
       (if (<= n 1.15e-35) t_0 (exp (* -0.25 (* n n))))))))

C

double code(double K, double m, double n, double M, double l) {
	double t_0 = exp((-0.25 * (m * m)));
	double tmp;
	if (n <= 5.6e-273) {
		tmp = t_0;
	} else if (n <= 1.95e-208) {
		tmp = exp(-l);
	} else if (n <= 1.15e-35) {
		tmp = t_0;
	} else {
		tmp = exp((-0.25 * (n * n)));
	}
	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) :: t_0
    real(8) :: tmp
    t_0 = exp(((-0.25d0) * (m * m)))
    if (n <= 5.6d-273) then
        tmp = t_0
    else if (n <= 1.95d-208) then
        tmp = exp(-l)
    else if (n <= 1.15d-35) then
        tmp = t_0
    else
        tmp = exp(((-0.25d0) * (n * n)))
    end if
    code = tmp
end function

Java

public static double code(double K, double m, double n, double M, double l) {
	double t_0 = Math.exp((-0.25 * (m * m)));
	double tmp;
	if (n <= 5.6e-273) {
		tmp = t_0;
	} else if (n <= 1.95e-208) {
		tmp = Math.exp(-l);
	} else if (n <= 1.15e-35) {
		tmp = t_0;
	} else {
		tmp = Math.exp((-0.25 * (n * n)));
	}
	return tmp;
}

Python

def code(K, m, n, M, l):
	t_0 = math.exp((-0.25 * (m * m)))
	tmp = 0
	if n <= 5.6e-273:
		tmp = t_0
	elif n <= 1.95e-208:
		tmp = math.exp(-l)
	elif n <= 1.15e-35:
		tmp = t_0
	else:
		tmp = math.exp((-0.25 * (n * n)))
	return tmp

Julia

function code(K, m, n, M, l)
	t_0 = exp(Float64(-0.25 * Float64(m * m)))
	tmp = 0.0
	if (n <= 5.6e-273)
		tmp = t_0;
	elseif (n <= 1.95e-208)
		tmp = exp(Float64(-l));
	elseif (n <= 1.15e-35)
		tmp = t_0;
	else
		tmp = exp(Float64(-0.25 * Float64(n * n)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(K, m, n, M, l)
	t_0 = exp((-0.25 * (m * m)));
	tmp = 0.0;
	if (n <= 5.6e-273)
		tmp = t_0;
	elseif (n <= 1.95e-208)
		tmp = exp(-l);
	elseif (n <= 1.15e-35)
		tmp = t_0;
	else
		tmp = exp((-0.25 * (n * n)));
	end
	tmp_2 = tmp;
end

Wolfram

code[K_, m_, n_, M_, l_] := Block[{t$95$0 = N[Exp[N[(-0.25 * N[(m * m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[n, 5.6e-273], t$95$0, If[LessEqual[n, 1.95e-208], N[Exp[(-l)], $MachinePrecision], If[LessEqual[n, 1.15e-35], t$95$0, N[Exp[N[(-0.25 * N[(n * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if n < 5.59999999999999971e-273 or 1.95000000000000002e-208 < n < 1.1499999999999999e-35

   1. Initial program 78.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 0

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

      1. *-commutative N/A

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

      2. 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}{\cos \left(\frac{1}{2} \cdot \left(K \cdot \left(m + n\right)\right)\right)} \]

   5. Applied rewrites 67.7%

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

   6. Taylor expanded in K around 0

      \[\leadsto e^{\left|n - m\right| - \left(\ell + \frac{1}{4} \cdot {\left(m + n\right)}^{2}\right)} \]
   7. 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-fabs.f64 N/A

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

      4. lift--.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. lower-pow.f64 N/A

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

      8. lift-+.f64 83.8

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

   8. Applied rewrites 83.8%

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

   9. Taylor expanded in m around inf

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

       1. lower-*.f64 N/A

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

       2. unpow2 N/A

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

       3. lower-*.f64 57.4

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

   11. Applied rewrites 57.4%

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

   if 5.59999999999999971e-273 < n < 1.95000000000000002e-208

   1. Initial program 84.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 M around 0

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

      1. *-commutative N/A

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

      2. 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}{\cos \left(\frac{1}{2} \cdot \left(K \cdot \left(m + n\right)\right)\right)} \]

   5. Applied rewrites 68.0%

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

   6. Taylor expanded in K around 0

      \[\leadsto e^{\left|n - m\right| - \left(\ell + \frac{1}{4} \cdot {\left(m + n\right)}^{2}\right)} \]
   7. 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-fabs.f64 N/A

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

      4. lift--.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. lower-pow.f64 N/A

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

      8. lift-+.f64 78.5

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

   8. Applied rewrites 78.5%

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

   9. Taylor expanded in l around inf

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

       1. lower-*.f64 52.8

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

   11. Applied rewrites 52.8%

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

   if 1.1499999999999999e-35 < n

   1. Initial program 73.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 M around 0

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

      1. *-commutative N/A

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

      2. 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}{\cos \left(\frac{1}{2} \cdot \left(K \cdot \left(m + n\right)\right)\right)} \]

   5. Applied rewrites 71.7%

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

   6. Taylor expanded in K around 0

      \[\leadsto e^{\left|n - m\right| - \left(\ell + \frac{1}{4} \cdot {\left(m + n\right)}^{2}\right)} \]
   7. 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-fabs.f64 N/A

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

      4. lift--.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. lower-pow.f64 N/A

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

      8. lift-+.f64 96.7

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

   8. Applied rewrites 96.7%

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

   9. Taylor expanded in n around inf

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

       1. lower-*.f64 N/A

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

       2. pow2 N/A

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

       3. lift-*.f64 91.9

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

   11. Applied rewrites 91.9%

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

4. Final simplification 65.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;n \leq 5.6 \cdot 10^{-273}:\\ \;\;\;\;e^{-0.25 \cdot \left(m \cdot m\right)}\\ \mathbf{elif}\;n \leq 1.95 \cdot 10^{-208}:\\ \;\;\;\;e^{-\ell}\\ \mathbf{elif}\;n \leq 1.15 \cdot 10^{-35}:\\ \;\;\;\;e^{-0.25 \cdot \left(m \cdot m\right)}\\ \mathbf{else}:\\ \;\;\;\;e^{-0.25 \cdot \left(n \cdot n\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 68.6% accurate, 2.9× speedup

Math

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

FPCore

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

C

double code(double K, double m, double n, double M, double l) {
	double tmp;
	if ((m <= -1.6e-7) || !(m <= 54.0)) {
		tmp = exp((-0.25 * (m * m)));
	} else {
		tmp = 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 ((m <= (-1.6d-7)) .or. (.not. (m <= 54.0d0))) then
        tmp = exp(((-0.25d0) * (m * m)))
    else
        tmp = 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 ((m <= -1.6e-7) || !(m <= 54.0)) {
		tmp = Math.exp((-0.25 * (m * m)));
	} else {
		tmp = Math.exp(-l);
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

code[K_, m_, n_, M_, l_] := If[Or[LessEqual[m, -1.6e-7], N[Not[LessEqual[m, 54.0]], $MachinePrecision]], N[Exp[N[(-0.25 * N[(m * m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Exp[(-l)], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if m < -1.6e-7 or 54 < m

   1. Initial program 71.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 0

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

      1. *-commutative N/A

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

      2. 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}{\cos \left(\frac{1}{2} \cdot \left(K \cdot \left(m + n\right)\right)\right)} \]

   5. Applied rewrites 71.1%

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

   6. Taylor expanded in K around 0

      \[\leadsto e^{\left|n - m\right| - \left(\ell + \frac{1}{4} \cdot {\left(m + n\right)}^{2}\right)} \]
   7. 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-fabs.f64 N/A

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

      4. lift--.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. lower-pow.f64 N/A

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

      8. lift-+.f64 97.7

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

   8. Applied rewrites 97.7%

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

   9. Taylor expanded in m around inf

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

       1. lower-*.f64 N/A

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

       2. unpow2 N/A

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

       3. lower-*.f64 96.2

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

   11. Applied rewrites 96.2%

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

   if -1.6e-7 < m < 54

   1. Initial program 83.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 M around 0

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

      1. *-commutative N/A

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

      2. 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}{\cos \left(\frac{1}{2} \cdot \left(K \cdot \left(m + n\right)\right)\right)} \]

   5. Applied rewrites 66.2%

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

   6. Taylor expanded in K around 0

      \[\leadsto e^{\left|n - m\right| - \left(\ell + \frac{1}{4} \cdot {\left(m + n\right)}^{2}\right)} \]
   7. 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-fabs.f64 N/A

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

      4. lift--.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. lower-pow.f64 N/A

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

      8. lift-+.f64 75.3

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

   8. Applied rewrites 75.3%

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

   9. Taylor expanded in l around inf

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

       1. lower-*.f64 45.3

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

   11. Applied rewrites 45.3%

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

4. Final simplification 70.7%

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

Alternative 10: 35.6% accurate, 3.5× speedup

Math

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

FPCore

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

C

double code(double K, double m, double n, double M, double l) {
	return 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 = exp(-l)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 77.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 M around 0

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

   1. *-commutative N/A

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

   2. 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}{\cos \left(\frac{1}{2} \cdot \left(K \cdot \left(m + n\right)\right)\right)} \]

5. Applied rewrites 68.7%

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

6. Taylor expanded in K around 0

   \[\leadsto e^{\left|n - m\right| - \left(\ell + \frac{1}{4} \cdot {\left(m + n\right)}^{2}\right)} \]
7. 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-fabs.f64 N/A

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

   4. lift--.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. lower-pow.f64 N/A

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

   8. lift-+.f64 86.5

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

8. Applied rewrites 86.5%

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

9. Taylor expanded in l around inf

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

    1. lower-*.f64 38.7

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

11. Applied rewrites 38.7%

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

12. Final simplification 38.7%

    \[\leadsto e^{-\ell} \]
13. Add Preprocessing

Reproduce

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