Maksimov and Kolovsky, Equation (4)

Percentage Accurate: 86.4% → 99.9%

Time: 5.1s

Alternatives: 15

Speedup: 1.2×

• 50.0% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

\[\begin{array}{l} \\ \left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \end{array} \]

FPCore

(FPCore (J l K U)
 :precision binary64
 (+ (* (* J (- (exp l) (exp (- l)))) (cos (/ K 2.0))) U))

C

double code(double J, double l, double K, double U) {
	return ((J * (exp(l) - exp(-l))) * cos((K / 2.0))) + U;
}

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(j, l, k, u)
use fmin_fmax_functions
    real(8), intent (in) :: j
    real(8), intent (in) :: l
    real(8), intent (in) :: k
    real(8), intent (in) :: u
    code = ((j * (exp(l) - exp(-l))) * cos((k / 2.0d0))) + u
end function

Java

public static double code(double J, double l, double K, double U) {
	return ((J * (Math.exp(l) - Math.exp(-l))) * Math.cos((K / 2.0))) + U;
}

Python

def code(J, l, K, U):
	return ((J * (math.exp(l) - math.exp(-l))) * math.cos((K / 2.0))) + U

Julia

function code(J, l, K, U)
	return Float64(Float64(Float64(J * Float64(exp(l) - exp(Float64(-l)))) * cos(Float64(K / 2.0))) + U)
end

MATLAB

function tmp = code(J, l, K, U)
	tmp = ((J * (exp(l) - exp(-l))) * cos((K / 2.0))) + U;
end

Wolfram

code[J_, l_, K_, U_] := N[(N[(N[(J * N[(N[Exp[l], $MachinePrecision] - N[Exp[(-l)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Cos[N[(K / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + U), $MachinePrecision]

Initial Program: 86.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \end{array} \]

FPCore

(FPCore (J l K U)
 :precision binary64
 (+ (* (* J (- (exp l) (exp (- l)))) (cos (/ K 2.0))) U))

C

double code(double J, double l, double K, double U) {
	return ((J * (exp(l) - exp(-l))) * cos((K / 2.0))) + U;
}

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(j, l, k, u)
use fmin_fmax_functions
    real(8), intent (in) :: j
    real(8), intent (in) :: l
    real(8), intent (in) :: k
    real(8), intent (in) :: u
    code = ((j * (exp(l) - exp(-l))) * cos((k / 2.0d0))) + u
end function

Java

public static double code(double J, double l, double K, double U) {
	return ((J * (Math.exp(l) - Math.exp(-l))) * Math.cos((K / 2.0))) + U;
}

Python

def code(J, l, K, U):
	return ((J * (math.exp(l) - math.exp(-l))) * math.cos((K / 2.0))) + U

Julia

function code(J, l, K, U)
	return Float64(Float64(Float64(J * Float64(exp(l) - exp(Float64(-l)))) * cos(Float64(K / 2.0))) + U)
end

MATLAB

function tmp = code(J, l, K, U)
	tmp = ((J * (exp(l) - exp(-l))) * cos((K / 2.0))) + U;
end

Wolfram

code[J_, l_, K_, U_] := N[(N[(N[(J * N[(N[Exp[l], $MachinePrecision] - N[Exp[(-l)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Cos[N[(K / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + U), $MachinePrecision]

Alternative 1: 99.9% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(\cos \left(0.5 \cdot K\right) \cdot J, 2 \cdot \sinh \ell, U\right) \end{array} \]

FPCore

(FPCore (J l K U)
 :precision binary64
 (fma (* (cos (* 0.5 K)) J) (* 2.0 (sinh l)) U))

C

double code(double J, double l, double K, double U) {
	return fma((cos((0.5 * K)) * J), (2.0 * sinh(l)), U);
}

Julia

function code(J, l, K, U)
	return fma(Float64(cos(Float64(0.5 * K)) * J), Float64(2.0 * sinh(l)), U)
end

Wolfram

code[J_, l_, K_, U_] := N[(N[(N[Cos[N[(0.5 * K), $MachinePrecision]], $MachinePrecision] * J), $MachinePrecision] * N[(2.0 * N[Sinh[l], $MachinePrecision]), $MachinePrecision] + U), $MachinePrecision]

Derivation

1. Initial program 86.4%

   \[\left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

2. Taylor expanded in J around 0

   \[\leadsto \color{blue}{U + J \cdot \left(\cos \left(\frac{1}{2} \cdot K\right) \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)\right)} \]
3. Step-by-step derivation

   1. +-commutative N/A

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

   2. associate-*r* N/A

      \[\leadsto \left(J \cdot \cos \left(\frac{1}{2} \cdot K\right)\right) \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) + U \]

   3. lower-fma.f64 N/A

      \[\leadsto \mathsf{fma}\left(J \cdot \cos \left(\frac{1}{2} \cdot K\right), \color{blue}{e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}}, U\right) \]

   4. *-commutative N/A

      \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, \color{blue}{e^{\ell}} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

   5. lower-*.f64 N/A

      \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, \color{blue}{e^{\ell}} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

   6. lower-cos.f64 N/A

      \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, e^{\color{blue}{\ell}} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

   7. lower-*.f64 N/A

      \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

   8. sinh-undef N/A

      \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, 2 \cdot \color{blue}{\sinh \ell}, U\right) \]

   9. lower-*.f64 N/A

      \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, 2 \cdot \color{blue}{\sinh \ell}, U\right) \]

   10. lower-sinh.f64 99.9

       \[\leadsto \mathsf{fma}\left(\cos \left(0.5 \cdot K\right) \cdot J, 2 \cdot \sinh \ell, U\right) \]

4. Applied rewrites 99.9%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\cos \left(0.5 \cdot K\right) \cdot J, 2 \cdot \sinh \ell, U\right)} \]
5. Add Preprocessing

Alternative 2: 99.5% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \cos \left(0.5 \cdot K\right) \cdot \left(\sinh \ell \cdot \left(J + J\right)\right)\\ t_1 := \cos \left(\frac{K}{2}\right)\\ t_2 := \left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot t\_1\\ \mathbf{if}\;t\_2 \leq -\infty:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;t\_2 \leq 10^{+17}:\\ \;\;\;\;\left(J \cdot \left(\ell + \ell\right)\right) \cdot t\_1 + U\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (J l K U)
 :precision binary64
 (let* ((t_0 (* (cos (* 0.5 K)) (* (sinh l) (+ J J))))
        (t_1 (cos (/ K 2.0)))
        (t_2 (* (* J (- (exp l) (exp (- l)))) t_1)))
   (if (<= t_2 (- INFINITY))
     t_0
     (if (<= t_2 1e+17) (+ (* (* J (+ l l)) t_1) U) t_0))))

C

double code(double J, double l, double K, double U) {
	double t_0 = cos((0.5 * K)) * (sinh(l) * (J + J));
	double t_1 = cos((K / 2.0));
	double t_2 = (J * (exp(l) - exp(-l))) * t_1;
	double tmp;
	if (t_2 <= -((double) INFINITY)) {
		tmp = t_0;
	} else if (t_2 <= 1e+17) {
		tmp = ((J * (l + l)) * t_1) + U;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Java

public static double code(double J, double l, double K, double U) {
	double t_0 = Math.cos((0.5 * K)) * (Math.sinh(l) * (J + J));
	double t_1 = Math.cos((K / 2.0));
	double t_2 = (J * (Math.exp(l) - Math.exp(-l))) * t_1;
	double tmp;
	if (t_2 <= -Double.POSITIVE_INFINITY) {
		tmp = t_0;
	} else if (t_2 <= 1e+17) {
		tmp = ((J * (l + l)) * t_1) + U;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(J, l, K, U):
	t_0 = math.cos((0.5 * K)) * (math.sinh(l) * (J + J))
	t_1 = math.cos((K / 2.0))
	t_2 = (J * (math.exp(l) - math.exp(-l))) * t_1
	tmp = 0
	if t_2 <= -math.inf:
		tmp = t_0
	elif t_2 <= 1e+17:
		tmp = ((J * (l + l)) * t_1) + U
	else:
		tmp = t_0
	return tmp

Julia

function code(J, l, K, U)
	t_0 = Float64(cos(Float64(0.5 * K)) * Float64(sinh(l) * Float64(J + J)))
	t_1 = cos(Float64(K / 2.0))
	t_2 = Float64(Float64(J * Float64(exp(l) - exp(Float64(-l)))) * t_1)
	tmp = 0.0
	if (t_2 <= Float64(-Inf))
		tmp = t_0;
	elseif (t_2 <= 1e+17)
		tmp = Float64(Float64(Float64(J * Float64(l + l)) * t_1) + U);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(J, l, K, U)
	t_0 = cos((0.5 * K)) * (sinh(l) * (J + J));
	t_1 = cos((K / 2.0));
	t_2 = (J * (exp(l) - exp(-l))) * t_1;
	tmp = 0.0;
	if (t_2 <= -Inf)
		tmp = t_0;
	elseif (t_2 <= 1e+17)
		tmp = ((J * (l + l)) * t_1) + U;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[J_, l_, K_, U_] := Block[{t$95$0 = N[(N[Cos[N[(0.5 * K), $MachinePrecision]], $MachinePrecision] * N[(N[Sinh[l], $MachinePrecision] * N[(J + J), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Cos[N[(K / 2.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(N[(J * N[(N[Exp[l], $MachinePrecision] - N[Exp[(-l)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision]}, If[LessEqual[t$95$2, (-Infinity)], t$95$0, If[LessEqual[t$95$2, 1e+17], N[(N[(N[(J * N[(l + l), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision] + U), $MachinePrecision], t$95$0]]]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 J (-.f64 (exp.f64 l) (exp.f64 (neg.f64 l)))) (cos.f64 (/.f64 K #s(literal 2 binary64)))) < -inf.0 or 1e17 < (*.f64 (*.f64 J (-.f64 (exp.f64 l) (exp.f64 (neg.f64 l)))) (cos.f64 (/.f64 K #s(literal 2 binary64))))

   1. Initial program 99.6%

      \[\left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

   2. Taylor expanded in J around 0

      \[\leadsto \color{blue}{U + J \cdot \left(\cos \left(\frac{1}{2} \cdot K\right) \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)\right)} \]
   3. Step-by-step derivation

      1. +-commutative N/A

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

      2. associate-*r* N/A

         \[\leadsto \left(J \cdot \cos \left(\frac{1}{2} \cdot K\right)\right) \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) + U \]

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(J \cdot \cos \left(\frac{1}{2} \cdot K\right), \color{blue}{e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}}, U\right) \]

      4. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, \color{blue}{e^{\ell}} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, \color{blue}{e^{\ell}} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

      6. lower-cos.f64 N/A

         \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, e^{\color{blue}{\ell}} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

      7. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

      8. sinh-undef N/A

         \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, 2 \cdot \color{blue}{\sinh \ell}, U\right) \]

      9. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, 2 \cdot \color{blue}{\sinh \ell}, U\right) \]

      10. lower-sinh.f64 100.0

          \[\leadsto \mathsf{fma}\left(\cos \left(0.5 \cdot K\right) \cdot J, 2 \cdot \sinh \ell, U\right) \]

   4. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\cos \left(0.5 \cdot K\right) \cdot J, 2 \cdot \sinh \ell, U\right)} \]

   5. Taylor expanded in J around inf

      \[\leadsto \color{blue}{J \cdot \left(\cos \left(\frac{1}{2} \cdot K\right) \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)\right)} \]
   6. Step-by-step derivation

      1. associate-*r* N/A

         \[\leadsto \left(J \cdot \cos \left(\frac{1}{2} \cdot K\right)\right) \cdot \color{blue}{\left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)} \]

      2. *-commutative N/A

         \[\leadsto \left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J\right) \cdot \left(\color{blue}{e^{\ell}} - e^{\mathsf{neg}\left(\ell\right)}\right) \]

      3. sinh-undef-rev N/A

         \[\leadsto \left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J\right) \cdot \left(2 \cdot \color{blue}{\sinh \ell}\right) \]

      4. associate-*r* N/A

         \[\leadsto \left(\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J\right) \cdot 2\right) \cdot \color{blue}{\sinh \ell} \]

      5. *-commutative N/A

         \[\leadsto \left(\left(J \cdot \cos \left(\frac{1}{2} \cdot K\right)\right) \cdot 2\right) \cdot \sinh \ell \]

      6. *-commutative N/A

         \[\leadsto \left(2 \cdot \left(J \cdot \cos \left(\frac{1}{2} \cdot K\right)\right)\right) \cdot \sinh \color{blue}{\ell} \]

      7. lower-*.f64 N/A

         \[\leadsto \left(2 \cdot \left(J \cdot \cos \left(\frac{1}{2} \cdot K\right)\right)\right) \cdot \color{blue}{\sinh \ell} \]

      8. associate-*r* N/A

         \[\leadsto \left(\left(2 \cdot J\right) \cdot \cos \left(\frac{1}{2} \cdot K\right)\right) \cdot \sinh \color{blue}{\ell} \]

      9. lower-*.f64 N/A

         \[\leadsto \left(\left(2 \cdot J\right) \cdot \cos \left(\frac{1}{2} \cdot K\right)\right) \cdot \sinh \color{blue}{\ell} \]

      10. count-2-rev N/A

          \[\leadsto \left(\left(J + J\right) \cdot \cos \left(\frac{1}{2} \cdot K\right)\right) \cdot \sinh \ell \]

      11. lower-+.f64 N/A

          \[\leadsto \left(\left(J + J\right) \cdot \cos \left(\frac{1}{2} \cdot K\right)\right) \cdot \sinh \ell \]

      12. lift-cos.f64 N/A

          \[\leadsto \left(\left(J + J\right) \cdot \cos \left(\frac{1}{2} \cdot K\right)\right) \cdot \sinh \ell \]

      13. lift-*.f64 N/A

          \[\leadsto \left(\left(J + J\right) \cdot \cos \left(\frac{1}{2} \cdot K\right)\right) \cdot \sinh \ell \]

      14. lift-sinh.f64 99.6

          \[\leadsto \left(\left(J + J\right) \cdot \cos \left(0.5 \cdot K\right)\right) \cdot \sinh \ell \]

   7. Applied rewrites 99.6%

      \[\leadsto \color{blue}{\left(\left(J + J\right) \cdot \cos \left(0.5 \cdot K\right)\right) \cdot \sinh \ell} \]
   8. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \left(\left(J + J\right) \cdot \cos \left(\frac{1}{2} \cdot K\right)\right) \cdot \color{blue}{\sinh \ell} \]

      2. lift-*.f64 N/A

         \[\leadsto \left(\left(J + J\right) \cdot \cos \left(\frac{1}{2} \cdot K\right)\right) \cdot \sinh \color{blue}{\ell} \]

      3. lift-+.f64 N/A

         \[\leadsto \left(\left(J + J\right) \cdot \cos \left(\frac{1}{2} \cdot K\right)\right) \cdot \sinh \ell \]

      4. lift-*.f64 N/A

         \[\leadsto \left(\left(J + J\right) \cdot \cos \left(\frac{1}{2} \cdot K\right)\right) \cdot \sinh \ell \]

      5. lift-cos.f64 N/A

         \[\leadsto \left(\left(J + J\right) \cdot \cos \left(\frac{1}{2} \cdot K\right)\right) \cdot \sinh \ell \]

      6. count-2-rev N/A

         \[\leadsto \left(\left(2 \cdot J\right) \cdot \cos \left(\frac{1}{2} \cdot K\right)\right) \cdot \sinh \ell \]

      7. lift-sinh.f64 N/A

         \[\leadsto \left(\left(2 \cdot J\right) \cdot \cos \left(\frac{1}{2} \cdot K\right)\right) \cdot \sinh \ell \]

      8. associate-*r* N/A

         \[\leadsto \left(2 \cdot \left(J \cdot \cos \left(\frac{1}{2} \cdot K\right)\right)\right) \cdot \sinh \color{blue}{\ell} \]

      9. *-commutative N/A

         \[\leadsto \left(\left(J \cdot \cos \left(\frac{1}{2} \cdot K\right)\right) \cdot 2\right) \cdot \sinh \color{blue}{\ell} \]

      10. *-commutative N/A

          \[\leadsto \left(\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J\right) \cdot 2\right) \cdot \sinh \ell \]

      11. associate-*r* N/A

          \[\leadsto \left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J\right) \cdot \color{blue}{\left(2 \cdot \sinh \ell\right)} \]

      12. sinh-undef-rev N/A

          \[\leadsto \left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J\right) \cdot \left(e^{\ell} - \color{blue}{e^{\mathsf{neg}\left(\ell\right)}}\right) \]

      13. associate-*l* N/A

          \[\leadsto \cos \left(\frac{1}{2} \cdot K\right) \cdot \color{blue}{\left(J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)\right)} \]

      14. lower-*.f64 N/A

          \[\leadsto \cos \left(\frac{1}{2} \cdot K\right) \cdot \color{blue}{\left(J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)\right)} \]

      15. lift-cos.f64 N/A

          \[\leadsto \cos \left(\frac{1}{2} \cdot K\right) \cdot \left(\color{blue}{J} \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)\right) \]

      16. lift-*.f64 N/A

          \[\leadsto \cos \left(\frac{1}{2} \cdot K\right) \cdot \left(J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)\right) \]

      17. sinh-undef-rev N/A

          \[\leadsto \cos \left(\frac{1}{2} \cdot K\right) \cdot \left(J \cdot \left(2 \cdot \color{blue}{\sinh \ell}\right)\right) \]

      18. *-commutative N/A

          \[\leadsto \cos \left(\frac{1}{2} \cdot K\right) \cdot \left(J \cdot \left(\sinh \ell \cdot \color{blue}{2}\right)\right) \]

      19. *-commutative N/A

          \[\leadsto \cos \left(\frac{1}{2} \cdot K\right) \cdot \left(\left(\sinh \ell \cdot 2\right) \cdot \color{blue}{J}\right) \]

      20. associate-*l* N/A

          \[\leadsto \cos \left(\frac{1}{2} \cdot K\right) \cdot \left(\sinh \ell \cdot \color{blue}{\left(2 \cdot J\right)}\right) \]

      21. lower-*.f64 N/A

          \[\leadsto \cos \left(\frac{1}{2} \cdot K\right) \cdot \left(\sinh \ell \cdot \color{blue}{\left(2 \cdot J\right)}\right) \]

      22. lift-sinh.f64 N/A

          \[\leadsto \cos \left(\frac{1}{2} \cdot K\right) \cdot \left(\sinh \ell \cdot \left(\color{blue}{2} \cdot J\right)\right) \]

      23. count-2-rev N/A

          \[\leadsto \cos \left(\frac{1}{2} \cdot K\right) \cdot \left(\sinh \ell \cdot \left(J + \color{blue}{J}\right)\right) \]

   9. Applied rewrites 99.6%

      \[\leadsto \cos \left(0.5 \cdot K\right) \cdot \color{blue}{\left(\sinh \ell \cdot \left(J + J\right)\right)} \]

   if -inf.0 < (*.f64 (*.f64 J (-.f64 (exp.f64 l) (exp.f64 (neg.f64 l)))) (cos.f64 (/.f64 K #s(literal 2 binary64)))) < 1e17

   1. Initial program 72.7%

      \[\left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

   2. Taylor expanded in l around 0

      \[\leadsto \left(J \cdot \color{blue}{\left(2 \cdot \ell\right)}\right) \cdot \cos \left(\frac{K}{2}\right) + U \]
   3. Step-by-step derivation

      1. count-2-rev N/A

         \[\leadsto \left(J \cdot \left(\ell + \color{blue}{\ell}\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

      2. lower-+.f64 99.2

         \[\leadsto \left(J \cdot \left(\ell + \color{blue}{\ell}\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

   4. Applied rewrites 99.2%

      \[\leadsto \left(J \cdot \color{blue}{\left(\ell + \ell\right)}\right) \cdot \cos \left(\frac{K}{2}\right) + U \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 87.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\cos \left(\frac{K}{2}\right) \leq -0.05:\\ \;\;\;\;\mathsf{fma}\left(\ell + \ell, \cos \left(0.5 \cdot K\right) \cdot J, U\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(2 \cdot \sinh \ell, J, U\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (J l K U)
 :precision binary64
 (if (<= (cos (/ K 2.0)) -0.05)
   (fma (+ l l) (* (cos (* 0.5 K)) J) U)
   (fma (* 2.0 (sinh l)) J U)))

C

double code(double J, double l, double K, double U) {
	double tmp;
	if (cos((K / 2.0)) <= -0.05) {
		tmp = fma((l + l), (cos((0.5 * K)) * J), U);
	} else {
		tmp = fma((2.0 * sinh(l)), J, U);
	}
	return tmp;
}

Julia

function code(J, l, K, U)
	tmp = 0.0
	if (cos(Float64(K / 2.0)) <= -0.05)
		tmp = fma(Float64(l + l), Float64(cos(Float64(0.5 * K)) * J), U);
	else
		tmp = fma(Float64(2.0 * sinh(l)), J, U);
	end
	return tmp
end

Wolfram

code[J_, l_, K_, U_] := If[LessEqual[N[Cos[N[(K / 2.0), $MachinePrecision]], $MachinePrecision], -0.05], N[(N[(l + l), $MachinePrecision] * N[(N[Cos[N[(0.5 * K), $MachinePrecision]], $MachinePrecision] * J), $MachinePrecision] + U), $MachinePrecision], N[(N[(2.0 * N[Sinh[l], $MachinePrecision]), $MachinePrecision] * J + U), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (cos.f64 (/.f64 K #s(literal 2 binary64))) < -0.050000000000000003

   1. Initial program 87.9%

      \[\left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

   2. Taylor expanded in J around 0

      \[\leadsto \color{blue}{U + J \cdot \left(\cos \left(\frac{1}{2} \cdot K\right) \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)\right)} \]
   3. Step-by-step derivation

      1. +-commutative N/A

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

      2. associate-*r* N/A

         \[\leadsto \left(J \cdot \cos \left(\frac{1}{2} \cdot K\right)\right) \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) + U \]

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(J \cdot \cos \left(\frac{1}{2} \cdot K\right), \color{blue}{e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}}, U\right) \]

      4. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, \color{blue}{e^{\ell}} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, \color{blue}{e^{\ell}} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

      6. lower-cos.f64 N/A

         \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, e^{\color{blue}{\ell}} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

      7. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

      8. sinh-undef N/A

         \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, 2 \cdot \color{blue}{\sinh \ell}, U\right) \]

      9. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, 2 \cdot \color{blue}{\sinh \ell}, U\right) \]

      10. lower-sinh.f64 99.9

          \[\leadsto \mathsf{fma}\left(\cos \left(0.5 \cdot K\right) \cdot J, 2 \cdot \sinh \ell, U\right) \]

   4. Applied rewrites 99.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\cos \left(0.5 \cdot K\right) \cdot J, 2 \cdot \sinh \ell, U\right)} \]

   5. Taylor expanded in l around 0

      \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, 2 \cdot \ell, U\right) \]
   6. Step-by-step derivation

   7. Applied rewrites 63.1%

      \[\leadsto \mathsf{fma}\left(\cos \left(0.5 \cdot K\right) \cdot J, 2 \cdot \ell, U\right) \]
   8. Step-by-step derivation

      1. lift-fma.f64 N/A

         \[\leadsto \left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J\right) \cdot \left(2 \cdot \ell\right) + \color{blue}{U} \]

      2. lift-*.f64 N/A

         \[\leadsto \left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J\right) \cdot \left(2 \cdot \ell\right) + U \]

      3. lift-*.f64 N/A

         \[\leadsto \left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J\right) \cdot \left(2 \cdot \ell\right) + U \]

      4. lift-cos.f64 N/A

         \[\leadsto \left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J\right) \cdot \left(2 \cdot \ell\right) + U \]

      5. *-commutative N/A

         \[\leadsto \left(2 \cdot \ell\right) \cdot \left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J\right) + U \]

      6. *-commutative N/A

         \[\leadsto \left(2 \cdot \ell\right) \cdot \left(J \cdot \cos \left(\frac{1}{2} \cdot K\right)\right) + U \]

      7. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(2 \cdot \ell, \color{blue}{J \cdot \cos \left(\frac{1}{2} \cdot K\right)}, U\right) \]

      8. lift-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(2 \cdot \ell, \color{blue}{J} \cdot \cos \left(\frac{1}{2} \cdot K\right), U\right) \]

      9. count-2-rev N/A

         \[\leadsto \mathsf{fma}\left(\ell + \ell, \color{blue}{J} \cdot \cos \left(\frac{1}{2} \cdot K\right), U\right) \]

      10. lower-+.f64 N/A

          \[\leadsto \mathsf{fma}\left(\ell + \ell, \color{blue}{J} \cdot \cos \left(\frac{1}{2} \cdot K\right), U\right) \]

      11. *-commutative N/A

          \[\leadsto \mathsf{fma}\left(\ell + \ell, \cos \left(\frac{1}{2} \cdot K\right) \cdot \color{blue}{J}, U\right) \]

      12. lift-cos.f64 N/A

          \[\leadsto \mathsf{fma}\left(\ell + \ell, \cos \left(\frac{1}{2} \cdot K\right) \cdot J, U\right) \]

      13. lift-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(\ell + \ell, \cos \left(\frac{1}{2} \cdot K\right) \cdot J, U\right) \]

      14. lift-*.f64 63.1

          \[\leadsto \mathsf{fma}\left(\ell + \ell, \cos \left(0.5 \cdot K\right) \cdot \color{blue}{J}, U\right) \]

   9. Applied rewrites 63.1%

      \[\leadsto \mathsf{fma}\left(\ell + \ell, \color{blue}{\cos \left(0.5 \cdot K\right) \cdot J}, U\right) \]

   if -0.050000000000000003 < (cos.f64 (/.f64 K #s(literal 2 binary64)))

   1. Initial program 86.0%

      \[\left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

   2. Taylor expanded in K around 0

      \[\leadsto \color{blue}{U + J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)} \]
   3. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) + \color{blue}{U} \]

      2. *-commutative N/A

         \[\leadsto \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) \cdot J + U \]

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}, \color{blue}{J}, U\right) \]

      4. sinh-undef N/A

         \[\leadsto \mathsf{fma}\left(2 \cdot \sinh \ell, J, U\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(2 \cdot \sinh \ell, J, U\right) \]

      6. lower-sinh.f64 94.8

         \[\leadsto \mathsf{fma}\left(2 \cdot \sinh \ell, J, U\right) \]

   4. Applied rewrites 94.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(2 \cdot \sinh \ell, J, U\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 87.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\cos \left(\frac{K}{2}\right) \leq -0.05:\\ \;\;\;\;\mathsf{fma}\left(J + J, \cos \left(0.5 \cdot K\right) \cdot \ell, U\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(2 \cdot \sinh \ell, J, U\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (J l K U)
 :precision binary64
 (if (<= (cos (/ K 2.0)) -0.05)
   (fma (+ J J) (* (cos (* 0.5 K)) l) U)
   (fma (* 2.0 (sinh l)) J U)))

C

double code(double J, double l, double K, double U) {
	double tmp;
	if (cos((K / 2.0)) <= -0.05) {
		tmp = fma((J + J), (cos((0.5 * K)) * l), U);
	} else {
		tmp = fma((2.0 * sinh(l)), J, U);
	}
	return tmp;
}

Julia

function code(J, l, K, U)
	tmp = 0.0
	if (cos(Float64(K / 2.0)) <= -0.05)
		tmp = fma(Float64(J + J), Float64(cos(Float64(0.5 * K)) * l), U);
	else
		tmp = fma(Float64(2.0 * sinh(l)), J, U);
	end
	return tmp
end

Wolfram

code[J_, l_, K_, U_] := If[LessEqual[N[Cos[N[(K / 2.0), $MachinePrecision]], $MachinePrecision], -0.05], N[(N[(J + J), $MachinePrecision] * N[(N[Cos[N[(0.5 * K), $MachinePrecision]], $MachinePrecision] * l), $MachinePrecision] + U), $MachinePrecision], N[(N[(2.0 * N[Sinh[l], $MachinePrecision]), $MachinePrecision] * J + U), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (cos.f64 (/.f64 K #s(literal 2 binary64))) < -0.050000000000000003

   1. Initial program 87.9%

      \[\left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

   2. Taylor expanded in l around 0

      \[\leadsto \color{blue}{U + 2 \cdot \left(J \cdot \left(\ell \cdot \cos \left(\frac{1}{2} \cdot K\right)\right)\right)} \]
   3. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto 2 \cdot \left(J \cdot \left(\ell \cdot \cos \left(\frac{1}{2} \cdot K\right)\right)\right) + \color{blue}{U} \]

      2. associate-*r* N/A

         \[\leadsto \left(2 \cdot J\right) \cdot \left(\ell \cdot \cos \left(\frac{1}{2} \cdot K\right)\right) + U \]

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(2 \cdot J, \color{blue}{\ell \cdot \cos \left(\frac{1}{2} \cdot K\right)}, U\right) \]

      4. count-2-rev N/A

         \[\leadsto \mathsf{fma}\left(J + J, \color{blue}{\ell} \cdot \cos \left(\frac{1}{2} \cdot K\right), U\right) \]

      5. lower-+.f64 N/A

         \[\leadsto \mathsf{fma}\left(J + J, \color{blue}{\ell} \cdot \cos \left(\frac{1}{2} \cdot K\right), U\right) \]

      6. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(J + J, \cos \left(\frac{1}{2} \cdot K\right) \cdot \color{blue}{\ell}, U\right) \]

      7. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(J + J, \cos \left(\frac{1}{2} \cdot K\right) \cdot \color{blue}{\ell}, U\right) \]

      8. lower-cos.f64 N/A

         \[\leadsto \mathsf{fma}\left(J + J, \cos \left(\frac{1}{2} \cdot K\right) \cdot \ell, U\right) \]

      9. lower-*.f64 63.0

         \[\leadsto \mathsf{fma}\left(J + J, \cos \left(0.5 \cdot K\right) \cdot \ell, U\right) \]

   4. Applied rewrites 63.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(J + J, \cos \left(0.5 \cdot K\right) \cdot \ell, U\right)} \]

   if -0.050000000000000003 < (cos.f64 (/.f64 K #s(literal 2 binary64)))

   1. Initial program 86.0%

      \[\left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

   2. Taylor expanded in K around 0

      \[\leadsto \color{blue}{U + J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)} \]
   3. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) + \color{blue}{U} \]

      2. *-commutative N/A

         \[\leadsto \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) \cdot J + U \]

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}, \color{blue}{J}, U\right) \]

      4. sinh-undef N/A

         \[\leadsto \mathsf{fma}\left(2 \cdot \sinh \ell, J, U\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(2 \cdot \sinh \ell, J, U\right) \]

      6. lower-sinh.f64 94.8

         \[\leadsto \mathsf{fma}\left(2 \cdot \sinh \ell, J, U\right) \]

   4. Applied rewrites 94.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(2 \cdot \sinh \ell, J, U\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 87.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\cos \left(\frac{K}{2}\right) \leq -0.05:\\ \;\;\;\;\mathsf{fma}\left(\cos \left(0.5 \cdot K\right), J \cdot \left(\ell + \ell\right), U\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(2 \cdot \sinh \ell, J, U\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (J l K U)
 :precision binary64
 (if (<= (cos (/ K 2.0)) -0.05)
   (fma (cos (* 0.5 K)) (* J (+ l l)) U)
   (fma (* 2.0 (sinh l)) J U)))

C

double code(double J, double l, double K, double U) {
	double tmp;
	if (cos((K / 2.0)) <= -0.05) {
		tmp = fma(cos((0.5 * K)), (J * (l + l)), U);
	} else {
		tmp = fma((2.0 * sinh(l)), J, U);
	}
	return tmp;
}

Julia

function code(J, l, K, U)
	tmp = 0.0
	if (cos(Float64(K / 2.0)) <= -0.05)
		tmp = fma(cos(Float64(0.5 * K)), Float64(J * Float64(l + l)), U);
	else
		tmp = fma(Float64(2.0 * sinh(l)), J, U);
	end
	return tmp
end

Wolfram

code[J_, l_, K_, U_] := If[LessEqual[N[Cos[N[(K / 2.0), $MachinePrecision]], $MachinePrecision], -0.05], N[(N[Cos[N[(0.5 * K), $MachinePrecision]], $MachinePrecision] * N[(J * N[(l + l), $MachinePrecision]), $MachinePrecision] + U), $MachinePrecision], N[(N[(2.0 * N[Sinh[l], $MachinePrecision]), $MachinePrecision] * J + U), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (cos.f64 (/.f64 K #s(literal 2 binary64))) < -0.050000000000000003

   1. Initial program 87.9%

      \[\left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

   2. Taylor expanded in J around 0

      \[\leadsto \color{blue}{U + J \cdot \left(\cos \left(\frac{1}{2} \cdot K\right) \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)\right)} \]
   3. Step-by-step derivation

      1. +-commutative N/A

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

      2. associate-*r* N/A

         \[\leadsto \left(J \cdot \cos \left(\frac{1}{2} \cdot K\right)\right) \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) + U \]

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(J \cdot \cos \left(\frac{1}{2} \cdot K\right), \color{blue}{e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}}, U\right) \]

      4. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, \color{blue}{e^{\ell}} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, \color{blue}{e^{\ell}} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

      6. lower-cos.f64 N/A

         \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, e^{\color{blue}{\ell}} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

      7. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

      8. sinh-undef N/A

         \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, 2 \cdot \color{blue}{\sinh \ell}, U\right) \]

      9. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, 2 \cdot \color{blue}{\sinh \ell}, U\right) \]

      10. lower-sinh.f64 99.9

          \[\leadsto \mathsf{fma}\left(\cos \left(0.5 \cdot K\right) \cdot J, 2 \cdot \sinh \ell, U\right) \]

   4. Applied rewrites 99.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\cos \left(0.5 \cdot K\right) \cdot J, 2 \cdot \sinh \ell, U\right)} \]

   5. Taylor expanded in l around 0

      \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, 2 \cdot \ell, U\right) \]
   6. Step-by-step derivation

   7. Applied rewrites 63.1%

      \[\leadsto \mathsf{fma}\left(\cos \left(0.5 \cdot K\right) \cdot J, 2 \cdot \ell, U\right) \]
   8. Step-by-step derivation

      1. lift-fma.f64 N/A

         \[\leadsto \left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J\right) \cdot \left(2 \cdot \ell\right) + \color{blue}{U} \]

      2. lift-*.f64 N/A

         \[\leadsto \left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J\right) \cdot \left(2 \cdot \ell\right) + U \]

      3. lift-*.f64 N/A

         \[\leadsto \left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J\right) \cdot \left(2 \cdot \ell\right) + U \]

      4. lift-cos.f64 N/A

         \[\leadsto \left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J\right) \cdot \left(2 \cdot \ell\right) + U \]

      5. associate-*l* N/A

         \[\leadsto \cos \left(\frac{1}{2} \cdot K\right) \cdot \left(J \cdot \left(2 \cdot \ell\right)\right) + U \]

      6. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right), \color{blue}{J \cdot \left(2 \cdot \ell\right)}, U\right) \]

      7. lift-cos.f64 N/A

         \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right), \color{blue}{J} \cdot \left(2 \cdot \ell\right), U\right) \]

      8. lift-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right), J \cdot \left(2 \cdot \ell\right), U\right) \]

      9. lower-*.f64 63.1

         \[\leadsto \mathsf{fma}\left(\cos \left(0.5 \cdot K\right), J \cdot \color{blue}{\left(2 \cdot \ell\right)}, U\right) \]

      10. lift-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right), J \cdot \left(2 \cdot \color{blue}{\ell}\right), U\right) \]

      11. count-2-rev N/A

          \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right), J \cdot \left(\ell + \color{blue}{\ell}\right), U\right) \]

      12. lower-+.f64 63.1

          \[\leadsto \mathsf{fma}\left(\cos \left(0.5 \cdot K\right), J \cdot \left(\ell + \color{blue}{\ell}\right), U\right) \]

   9. Applied rewrites 63.1%

      \[\leadsto \mathsf{fma}\left(\cos \left(0.5 \cdot K\right), \color{blue}{J \cdot \left(\ell + \ell\right)}, U\right) \]

   if -0.050000000000000003 < (cos.f64 (/.f64 K #s(literal 2 binary64)))

   1. Initial program 86.0%

      \[\left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

   2. Taylor expanded in K around 0

      \[\leadsto \color{blue}{U + J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)} \]
   3. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) + \color{blue}{U} \]

      2. *-commutative N/A

         \[\leadsto \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) \cdot J + U \]

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}, \color{blue}{J}, U\right) \]

      4. sinh-undef N/A

         \[\leadsto \mathsf{fma}\left(2 \cdot \sinh \ell, J, U\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(2 \cdot \sinh \ell, J, U\right) \]

      6. lower-sinh.f64 94.8

         \[\leadsto \mathsf{fma}\left(2 \cdot \sinh \ell, J, U\right) \]

   4. Applied rewrites 94.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(2 \cdot \sinh \ell, J, U\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 85.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\cos \left(\frac{K}{2}\right) \leq -0.54:\\ \;\;\;\;\left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \mathsf{fma}\left(K \cdot K, -0.125, 1\right) + U\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(2 \cdot \sinh \ell, J, U\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (J l K U)
 :precision binary64
 (if (<= (cos (/ K 2.0)) -0.54)
   (+ (* (* J (- (exp l) (exp (- l)))) (fma (* K K) -0.125 1.0)) U)
   (fma (* 2.0 (sinh l)) J U)))

C

double code(double J, double l, double K, double U) {
	double tmp;
	if (cos((K / 2.0)) <= -0.54) {
		tmp = ((J * (exp(l) - exp(-l))) * fma((K * K), -0.125, 1.0)) + U;
	} else {
		tmp = fma((2.0 * sinh(l)), J, U);
	}
	return tmp;
}

Julia

function code(J, l, K, U)
	tmp = 0.0
	if (cos(Float64(K / 2.0)) <= -0.54)
		tmp = Float64(Float64(Float64(J * Float64(exp(l) - exp(Float64(-l)))) * fma(Float64(K * K), -0.125, 1.0)) + U);
	else
		tmp = fma(Float64(2.0 * sinh(l)), J, U);
	end
	return tmp
end

Wolfram

code[J_, l_, K_, U_] := If[LessEqual[N[Cos[N[(K / 2.0), $MachinePrecision]], $MachinePrecision], -0.54], N[(N[(N[(J * N[(N[Exp[l], $MachinePrecision] - N[Exp[(-l)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(K * K), $MachinePrecision] * -0.125 + 1.0), $MachinePrecision]), $MachinePrecision] + U), $MachinePrecision], N[(N[(2.0 * N[Sinh[l], $MachinePrecision]), $MachinePrecision] * J + U), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (cos.f64 (/.f64 K #s(literal 2 binary64))) < -0.54000000000000004

   1. Initial program 87.4%

      \[\left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

   2. Taylor expanded in K around 0

      \[\leadsto \left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \color{blue}{\left(1 + \frac{-1}{8} \cdot {K}^{2}\right)} + U \]
   3. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

         \[\leadsto \left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \left({K}^{2} \cdot \frac{-1}{8} + 1\right) + U \]

      3. lower-fma.f64 N/A

         \[\leadsto \left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \mathsf{fma}\left({K}^{2}, \color{blue}{\frac{-1}{8}}, 1\right) + U \]

      4. unpow2 N/A

         \[\leadsto \left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \mathsf{fma}\left(K \cdot K, \frac{-1}{8}, 1\right) + U \]

      5. lower-*.f64 67.6

         \[\leadsto \left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \mathsf{fma}\left(K \cdot K, -0.125, 1\right) + U \]

   4. Applied rewrites 67.6%

      \[\leadsto \left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \color{blue}{\mathsf{fma}\left(K \cdot K, -0.125, 1\right)} + U \]

   if -0.54000000000000004 < (cos.f64 (/.f64 K #s(literal 2 binary64)))

   1. Initial program 86.3%

      \[\left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

   2. Taylor expanded in K around 0

      \[\leadsto \color{blue}{U + J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)} \]
   3. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) + \color{blue}{U} \]

      2. *-commutative N/A

         \[\leadsto \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) \cdot J + U \]

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}, \color{blue}{J}, U\right) \]

      4. sinh-undef N/A

         \[\leadsto \mathsf{fma}\left(2 \cdot \sinh \ell, J, U\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(2 \cdot \sinh \ell, J, U\right) \]

      6. lower-sinh.f64 89.3

         \[\leadsto \mathsf{fma}\left(2 \cdot \sinh \ell, J, U\right) \]

   4. Applied rewrites 89.3%

      \[\leadsto \color{blue}{\mathsf{fma}\left(2 \cdot \sinh \ell, J, U\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 7: 84.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\cos \left(\frac{K}{2}\right) \leq -0.54:\\ \;\;\;\;\mathsf{fma}\left(\left(1 - e^{-\ell}\right) \cdot J, \left(K \cdot K\right) \cdot -0.125, U\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(2 \cdot \sinh \ell, J, U\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (J l K U)
 :precision binary64
 (if (<= (cos (/ K 2.0)) -0.54)
   (fma (* (- 1.0 (exp (- l))) J) (* (* K K) -0.125) U)
   (fma (* 2.0 (sinh l)) J U)))

C

double code(double J, double l, double K, double U) {
	double tmp;
	if (cos((K / 2.0)) <= -0.54) {
		tmp = fma(((1.0 - exp(-l)) * J), ((K * K) * -0.125), U);
	} else {
		tmp = fma((2.0 * sinh(l)), J, U);
	}
	return tmp;
}

Julia

function code(J, l, K, U)
	tmp = 0.0
	if (cos(Float64(K / 2.0)) <= -0.54)
		tmp = fma(Float64(Float64(1.0 - exp(Float64(-l))) * J), Float64(Float64(K * K) * -0.125), U);
	else
		tmp = fma(Float64(2.0 * sinh(l)), J, U);
	end
	return tmp
end

Wolfram

code[J_, l_, K_, U_] := If[LessEqual[N[Cos[N[(K / 2.0), $MachinePrecision]], $MachinePrecision], -0.54], N[(N[(N[(1.0 - N[Exp[(-l)], $MachinePrecision]), $MachinePrecision] * J), $MachinePrecision] * N[(N[(K * K), $MachinePrecision] * -0.125), $MachinePrecision] + U), $MachinePrecision], N[(N[(2.0 * N[Sinh[l], $MachinePrecision]), $MachinePrecision] * J + U), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (cos.f64 (/.f64 K #s(literal 2 binary64))) < -0.54000000000000004

   1. Initial program 87.4%

      \[\left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

   2. Taylor expanded in K around 0

      \[\leadsto \left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \color{blue}{\left(1 + \frac{-1}{8} \cdot {K}^{2}\right)} + U \]
   3. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

         \[\leadsto \left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \left({K}^{2} \cdot \frac{-1}{8} + 1\right) + U \]

      3. lower-fma.f64 N/A

         \[\leadsto \left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \mathsf{fma}\left({K}^{2}, \color{blue}{\frac{-1}{8}}, 1\right) + U \]

      4. unpow2 N/A

         \[\leadsto \left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \mathsf{fma}\left(K \cdot K, \frac{-1}{8}, 1\right) + U \]

      5. lower-*.f64 67.6

         \[\leadsto \left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \mathsf{fma}\left(K \cdot K, -0.125, 1\right) + U \]

   4. Applied rewrites 67.6%

      \[\leadsto \left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \color{blue}{\mathsf{fma}\left(K \cdot K, -0.125, 1\right)} + U \]

   5. Taylor expanded in l around 0

      \[\leadsto \left(J \cdot \left(\color{blue}{1} - e^{-\ell}\right)\right) \cdot \mathsf{fma}\left(K \cdot K, \frac{-1}{8}, 1\right) + U \]
   6. Step-by-step derivation

   7. Applied rewrites 58.8%

      \[\leadsto \left(J \cdot \left(\color{blue}{1} - e^{-\ell}\right)\right) \cdot \mathsf{fma}\left(K \cdot K, -0.125, 1\right) + U \]

   8. Taylor expanded in K around inf

      \[\leadsto \left(J \cdot \left(1 - e^{-\ell}\right)\right) \cdot \left(\frac{-1}{8} \cdot \color{blue}{{K}^{2}}\right) + U \]
   9. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(J \cdot \left(1 - e^{-\ell}\right)\right) \cdot \left({K}^{2} \cdot \frac{-1}{8}\right) + U \]

      2. lower-*.f64 N/A

         \[\leadsto \left(J \cdot \left(1 - e^{-\ell}\right)\right) \cdot \left({K}^{2} \cdot \frac{-1}{8}\right) + U \]

      3. pow2 N/A

         \[\leadsto \left(J \cdot \left(1 - e^{-\ell}\right)\right) \cdot \left(\left(K \cdot K\right) \cdot \frac{-1}{8}\right) + U \]

      4. lift-*.f64 58.8

         \[\leadsto \left(J \cdot \left(1 - e^{-\ell}\right)\right) \cdot \left(\left(K \cdot K\right) \cdot -0.125\right) + U \]

   10. Applied rewrites 58.8%

       \[\leadsto \left(J \cdot \left(1 - e^{-\ell}\right)\right) \cdot \left(\left(K \cdot K\right) \cdot \color{blue}{-0.125}\right) + U \]
   11. Step-by-step derivation

       1. lift-+.f64 N/A

          \[\leadsto \color{blue}{\left(J \cdot \left(1 - e^{-\ell}\right)\right) \cdot \left(\left(K \cdot K\right) \cdot \frac{-1}{8}\right) + U} \]

       2. lift-*.f64 N/A

          \[\leadsto \color{blue}{\left(J \cdot \left(1 - e^{-\ell}\right)\right) \cdot \left(\left(K \cdot K\right) \cdot \frac{-1}{8}\right)} + U \]

       3. lower-fma.f64 58.8

          \[\leadsto \color{blue}{\mathsf{fma}\left(J \cdot \left(1 - e^{-\ell}\right), \left(K \cdot K\right) \cdot -0.125, U\right)} \]

   12. Applied rewrites 58.8%

       \[\leadsto \color{blue}{\mathsf{fma}\left(\left(1 - e^{-\ell}\right) \cdot J, \left(K \cdot K\right) \cdot -0.125, U\right)} \]

   if -0.54000000000000004 < (cos.f64 (/.f64 K #s(literal 2 binary64)))

   1. Initial program 86.3%

      \[\left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

   2. Taylor expanded in K around 0

      \[\leadsto \color{blue}{U + J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)} \]
   3. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) + \color{blue}{U} \]

      2. *-commutative N/A

         \[\leadsto \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) \cdot J + U \]

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}, \color{blue}{J}, U\right) \]

      4. sinh-undef N/A

         \[\leadsto \mathsf{fma}\left(2 \cdot \sinh \ell, J, U\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(2 \cdot \sinh \ell, J, U\right) \]

      6. lower-sinh.f64 89.3

         \[\leadsto \mathsf{fma}\left(2 \cdot \sinh \ell, J, U\right) \]

   4. Applied rewrites 89.3%

      \[\leadsto \color{blue}{\mathsf{fma}\left(2 \cdot \sinh \ell, J, U\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 8: 83.0% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \cos \left(\frac{K}{2}\right)\\ \mathbf{if}\;t\_0 \leq -0.96:\\ \;\;\;\;U\\ \mathbf{elif}\;t\_0 \leq -0.52:\\ \;\;\;\;\mathsf{fma}\left(\left(J + J\right) \cdot \ell, \left(K \cdot K\right) \cdot -0.125, U\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(2 \cdot \sinh \ell, J, U\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (J l K U)
 :precision binary64
 (let* ((t_0 (cos (/ K 2.0))))
   (if (<= t_0 -0.96)
     U
     (if (<= t_0 -0.52)
       (fma (* (+ J J) l) (* (* K K) -0.125) U)
       (fma (* 2.0 (sinh l)) J U)))))

C

double code(double J, double l, double K, double U) {
	double t_0 = cos((K / 2.0));
	double tmp;
	if (t_0 <= -0.96) {
		tmp = U;
	} else if (t_0 <= -0.52) {
		tmp = fma(((J + J) * l), ((K * K) * -0.125), U);
	} else {
		tmp = fma((2.0 * sinh(l)), J, U);
	}
	return tmp;
}

Julia

function code(J, l, K, U)
	t_0 = cos(Float64(K / 2.0))
	tmp = 0.0
	if (t_0 <= -0.96)
		tmp = U;
	elseif (t_0 <= -0.52)
		tmp = fma(Float64(Float64(J + J) * l), Float64(Float64(K * K) * -0.125), U);
	else
		tmp = fma(Float64(2.0 * sinh(l)), J, U);
	end
	return tmp
end

Wolfram

code[J_, l_, K_, U_] := Block[{t$95$0 = N[Cos[N[(K / 2.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$0, -0.96], U, If[LessEqual[t$95$0, -0.52], N[(N[(N[(J + J), $MachinePrecision] * l), $MachinePrecision] * N[(N[(K * K), $MachinePrecision] * -0.125), $MachinePrecision] + U), $MachinePrecision], N[(N[(2.0 * N[Sinh[l], $MachinePrecision]), $MachinePrecision] * J + U), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (cos.f64 (/.f64 K #s(literal 2 binary64))) < -0.95999999999999996

   1. Initial program 89.7%

      \[\left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

   2. Taylor expanded in J around 0

      \[\leadsto \color{blue}{U} \]
   3. Step-by-step derivation

   4. Applied rewrites 37.5%

      \[\leadsto \color{blue}{U} \]

   if -0.95999999999999996 < (cos.f64 (/.f64 K #s(literal 2 binary64))) < -0.52000000000000002

   1. Initial program 86.7%

      \[\left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

   2. Taylor expanded in K around 0

      \[\leadsto \left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \color{blue}{\left(1 + \frac{-1}{8} \cdot {K}^{2}\right)} + U \]
   3. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

         \[\leadsto \left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \left({K}^{2} \cdot \frac{-1}{8} + 1\right) + U \]

      3. lower-fma.f64 N/A

         \[\leadsto \left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \mathsf{fma}\left({K}^{2}, \color{blue}{\frac{-1}{8}}, 1\right) + U \]

      4. unpow2 N/A

         \[\leadsto \left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \mathsf{fma}\left(K \cdot K, \frac{-1}{8}, 1\right) + U \]

      5. lower-*.f64 67.1

         \[\leadsto \left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \mathsf{fma}\left(K \cdot K, -0.125, 1\right) + U \]

   4. Applied rewrites 67.1%

      \[\leadsto \left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \color{blue}{\mathsf{fma}\left(K \cdot K, -0.125, 1\right)} + U \]

   5. Taylor expanded in l around 0

      \[\leadsto \color{blue}{\left(2 \cdot \left(J \cdot \ell\right)\right)} \cdot \mathsf{fma}\left(K \cdot K, \frac{-1}{8}, 1\right) + U \]
   6. Step-by-step derivation

      1. associate-*r* N/A

         \[\leadsto \left(\left(2 \cdot J\right) \cdot \color{blue}{\ell}\right) \cdot \mathsf{fma}\left(K \cdot K, \frac{-1}{8}, 1\right) + U \]

      2. lower-*.f64 N/A

         \[\leadsto \left(\left(2 \cdot J\right) \cdot \color{blue}{\ell}\right) \cdot \mathsf{fma}\left(K \cdot K, \frac{-1}{8}, 1\right) + U \]

      3. count-2-rev N/A

         \[\leadsto \left(\left(J + J\right) \cdot \ell\right) \cdot \mathsf{fma}\left(K \cdot K, \frac{-1}{8}, 1\right) + U \]

      4. lower-+.f64 53.0

         \[\leadsto \left(\left(J + J\right) \cdot \ell\right) \cdot \mathsf{fma}\left(K \cdot K, -0.125, 1\right) + U \]

   7. Applied rewrites 53.0%

      \[\leadsto \color{blue}{\left(\left(J + J\right) \cdot \ell\right)} \cdot \mathsf{fma}\left(K \cdot K, -0.125, 1\right) + U \]

   8. Taylor expanded in K around inf

      \[\leadsto \left(\left(J + J\right) \cdot \ell\right) \cdot \left(\frac{-1}{8} \cdot \color{blue}{{K}^{2}}\right) + U \]
   9. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(\left(J + J\right) \cdot \ell\right) \cdot \left({K}^{2} \cdot \frac{-1}{8}\right) + U \]

      2. lower-*.f64 N/A

         \[\leadsto \left(\left(J + J\right) \cdot \ell\right) \cdot \left({K}^{2} \cdot \frac{-1}{8}\right) + U \]

      3. pow2 N/A

         \[\leadsto \left(\left(J + J\right) \cdot \ell\right) \cdot \left(\left(K \cdot K\right) \cdot \frac{-1}{8}\right) + U \]

      4. lift-*.f64 53.0

         \[\leadsto \left(\left(J + J\right) \cdot \ell\right) \cdot \left(\left(K \cdot K\right) \cdot -0.125\right) + U \]

   10. Applied rewrites 53.0%

       \[\leadsto \left(\left(J + J\right) \cdot \ell\right) \cdot \left(\left(K \cdot K\right) \cdot \color{blue}{-0.125}\right) + U \]
   11. Step-by-step derivation

       1. lift-+.f64 N/A

          \[\leadsto \color{blue}{\left(\left(J + J\right) \cdot \ell\right) \cdot \left(\left(K \cdot K\right) \cdot \frac{-1}{8}\right) + U} \]

       2. lift-*.f64 N/A

          \[\leadsto \color{blue}{\left(\left(J + J\right) \cdot \ell\right) \cdot \left(\left(K \cdot K\right) \cdot \frac{-1}{8}\right)} + U \]

       3. lower-fma.f64 53.0

          \[\leadsto \color{blue}{\mathsf{fma}\left(\left(J + J\right) \cdot \ell, \left(K \cdot K\right) \cdot -0.125, U\right)} \]

   12. Applied rewrites 53.0%

       \[\leadsto \color{blue}{\mathsf{fma}\left(\left(J + J\right) \cdot \ell, \left(K \cdot K\right) \cdot -0.125, U\right)} \]

   if -0.52000000000000002 < (cos.f64 (/.f64 K #s(literal 2 binary64)))

   1. Initial program 86.2%

      \[\left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

   2. Taylor expanded in K around 0

      \[\leadsto \color{blue}{U + J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)} \]
   3. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) + \color{blue}{U} \]

      2. *-commutative N/A

         \[\leadsto \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) \cdot J + U \]

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}, \color{blue}{J}, U\right) \]

      4. sinh-undef N/A

         \[\leadsto \mathsf{fma}\left(2 \cdot \sinh \ell, J, U\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(2 \cdot \sinh \ell, J, U\right) \]

      6. lower-sinh.f64 89.5

         \[\leadsto \mathsf{fma}\left(2 \cdot \sinh \ell, J, U\right) \]

   4. Applied rewrites 89.5%

      \[\leadsto \color{blue}{\mathsf{fma}\left(2 \cdot \sinh \ell, J, U\right)} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 9: 80.5% accurate, 2.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(J + J\right) \cdot \sinh \ell\\ \mathbf{if}\;\ell \leq -175:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;\ell \leq 9:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\ell \cdot \ell, 0.3333333333333333, 2\right) \cdot \ell, J, U\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (J l K U)
 :precision binary64
 (let* ((t_0 (* (+ J J) (sinh l))))
   (if (<= l -175.0)
     t_0
     (if (<= l 9.0)
       (fma (* (fma (* l l) 0.3333333333333333 2.0) l) J U)
       t_0))))

C

double code(double J, double l, double K, double U) {
	double t_0 = (J + J) * sinh(l);
	double tmp;
	if (l <= -175.0) {
		tmp = t_0;
	} else if (l <= 9.0) {
		tmp = fma((fma((l * l), 0.3333333333333333, 2.0) * l), J, U);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(J, l, K, U)
	t_0 = Float64(Float64(J + J) * sinh(l))
	tmp = 0.0
	if (l <= -175.0)
		tmp = t_0;
	elseif (l <= 9.0)
		tmp = fma(Float64(fma(Float64(l * l), 0.3333333333333333, 2.0) * l), J, U);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[J_, l_, K_, U_] := Block[{t$95$0 = N[(N[(J + J), $MachinePrecision] * N[Sinh[l], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, -175.0], t$95$0, If[LessEqual[l, 9.0], N[(N[(N[(N[(l * l), $MachinePrecision] * 0.3333333333333333 + 2.0), $MachinePrecision] * l), $MachinePrecision] * J + U), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if l < -175 or 9 < l

   1. Initial program 100.0%

      \[\left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

   2. Taylor expanded in J around 0

      \[\leadsto \color{blue}{U + J \cdot \left(\cos \left(\frac{1}{2} \cdot K\right) \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)\right)} \]
   3. Step-by-step derivation

      1. +-commutative N/A

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

      2. associate-*r* N/A

         \[\leadsto \left(J \cdot \cos \left(\frac{1}{2} \cdot K\right)\right) \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) + U \]

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(J \cdot \cos \left(\frac{1}{2} \cdot K\right), \color{blue}{e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}}, U\right) \]

      4. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, \color{blue}{e^{\ell}} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, \color{blue}{e^{\ell}} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

      6. lower-cos.f64 N/A

         \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, e^{\color{blue}{\ell}} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

      7. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

      8. sinh-undef N/A

         \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, 2 \cdot \color{blue}{\sinh \ell}, U\right) \]

      9. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, 2 \cdot \color{blue}{\sinh \ell}, U\right) \]

      10. lower-sinh.f64 100.0

          \[\leadsto \mathsf{fma}\left(\cos \left(0.5 \cdot K\right) \cdot J, 2 \cdot \sinh \ell, U\right) \]

   4. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\cos \left(0.5 \cdot K\right) \cdot J, 2 \cdot \sinh \ell, U\right)} \]

   5. Taylor expanded in J around inf

      \[\leadsto \color{blue}{J \cdot \left(\cos \left(\frac{1}{2} \cdot K\right) \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)\right)} \]
   6. Step-by-step derivation

      1. associate-*r* N/A

         \[\leadsto \left(J \cdot \cos \left(\frac{1}{2} \cdot K\right)\right) \cdot \color{blue}{\left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)} \]

      2. *-commutative N/A

         \[\leadsto \left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J\right) \cdot \left(\color{blue}{e^{\ell}} - e^{\mathsf{neg}\left(\ell\right)}\right) \]

      3. sinh-undef-rev N/A

         \[\leadsto \left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J\right) \cdot \left(2 \cdot \color{blue}{\sinh \ell}\right) \]

      4. associate-*r* N/A

         \[\leadsto \left(\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J\right) \cdot 2\right) \cdot \color{blue}{\sinh \ell} \]

      5. *-commutative N/A

         \[\leadsto \left(\left(J \cdot \cos \left(\frac{1}{2} \cdot K\right)\right) \cdot 2\right) \cdot \sinh \ell \]

      6. *-commutative N/A

         \[\leadsto \left(2 \cdot \left(J \cdot \cos \left(\frac{1}{2} \cdot K\right)\right)\right) \cdot \sinh \color{blue}{\ell} \]

      7. lower-*.f64 N/A

         \[\leadsto \left(2 \cdot \left(J \cdot \cos \left(\frac{1}{2} \cdot K\right)\right)\right) \cdot \color{blue}{\sinh \ell} \]

      8. associate-*r* N/A

         \[\leadsto \left(\left(2 \cdot J\right) \cdot \cos \left(\frac{1}{2} \cdot K\right)\right) \cdot \sinh \color{blue}{\ell} \]

      9. lower-*.f64 N/A

         \[\leadsto \left(\left(2 \cdot J\right) \cdot \cos \left(\frac{1}{2} \cdot K\right)\right) \cdot \sinh \color{blue}{\ell} \]

      10. count-2-rev N/A

          \[\leadsto \left(\left(J + J\right) \cdot \cos \left(\frac{1}{2} \cdot K\right)\right) \cdot \sinh \ell \]

      11. lower-+.f64 N/A

          \[\leadsto \left(\left(J + J\right) \cdot \cos \left(\frac{1}{2} \cdot K\right)\right) \cdot \sinh \ell \]

      12. lift-cos.f64 N/A

          \[\leadsto \left(\left(J + J\right) \cdot \cos \left(\frac{1}{2} \cdot K\right)\right) \cdot \sinh \ell \]

      13. lift-*.f64 N/A

          \[\leadsto \left(\left(J + J\right) \cdot \cos \left(\frac{1}{2} \cdot K\right)\right) \cdot \sinh \ell \]

      14. lift-sinh.f64 99.8

          \[\leadsto \left(\left(J + J\right) \cdot \cos \left(0.5 \cdot K\right)\right) \cdot \sinh \ell \]

   7. Applied rewrites 99.8%

      \[\leadsto \color{blue}{\left(\left(J + J\right) \cdot \cos \left(0.5 \cdot K\right)\right) \cdot \sinh \ell} \]

   8. Taylor expanded in K around 0

      \[\leadsto \left(2 \cdot J\right) \cdot \sinh \color{blue}{\ell} \]
   9. Step-by-step derivation

      1. count-2-rev N/A

         \[\leadsto \left(J + J\right) \cdot \sinh \ell \]

      2. lift-+.f64 74.7

         \[\leadsto \left(J + J\right) \cdot \sinh \ell \]

   10. Applied rewrites 74.7%

       \[\leadsto \left(J + J\right) \cdot \sinh \color{blue}{\ell} \]

   if -175 < l < 9

   1. Initial program 72.7%

      \[\left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

   2. Taylor expanded in J around 0

      \[\leadsto \color{blue}{U + J \cdot \left(\cos \left(\frac{1}{2} \cdot K\right) \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)\right)} \]
   3. Step-by-step derivation

      1. +-commutative N/A

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

      2. associate-*r* N/A

         \[\leadsto \left(J \cdot \cos \left(\frac{1}{2} \cdot K\right)\right) \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) + U \]

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(J \cdot \cos \left(\frac{1}{2} \cdot K\right), \color{blue}{e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}}, U\right) \]

      4. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, \color{blue}{e^{\ell}} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, \color{blue}{e^{\ell}} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

      6. lower-cos.f64 N/A

         \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, e^{\color{blue}{\ell}} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

      7. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

      8. sinh-undef N/A

         \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, 2 \cdot \color{blue}{\sinh \ell}, U\right) \]

      9. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, 2 \cdot \color{blue}{\sinh \ell}, U\right) \]

      10. lower-sinh.f64 99.9

          \[\leadsto \mathsf{fma}\left(\cos \left(0.5 \cdot K\right) \cdot J, 2 \cdot \sinh \ell, U\right) \]

   4. Applied rewrites 99.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\cos \left(0.5 \cdot K\right) \cdot J, 2 \cdot \sinh \ell, U\right)} \]

   5. Taylor expanded in K around 0

      \[\leadsto \color{blue}{U + J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)} \]
   6. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) + \color{blue}{U} \]

      2. *-commutative N/A

         \[\leadsto \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) \cdot J + U \]

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}, \color{blue}{J}, U\right) \]

      4. sinh-undef-rev N/A

         \[\leadsto \mathsf{fma}\left(2 \cdot \sinh \ell, J, U\right) \]

      5. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\sinh \ell \cdot 2, J, U\right) \]

      6. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\sinh \ell \cdot 2, J, U\right) \]

      7. lift-sinh.f64 86.7

         \[\leadsto \mathsf{fma}\left(\sinh \ell \cdot 2, J, U\right) \]

   7. Applied rewrites 86.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\sinh \ell \cdot 2, J, U\right)} \]

   8. Taylor expanded in l around 0

      \[\leadsto \mathsf{fma}\left(\ell \cdot \left(2 + \frac{1}{3} \cdot {\ell}^{2}\right), J, U\right) \]
   9. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\left(2 + \frac{1}{3} \cdot {\ell}^{2}\right) \cdot \ell, J, U\right) \]

      2. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\left(2 + \frac{1}{3} \cdot {\ell}^{2}\right) \cdot \ell, J, U\right) \]

      3. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\left(\frac{1}{3} \cdot {\ell}^{2} + 2\right) \cdot \ell, J, U\right) \]

      4. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\left({\ell}^{2} \cdot \frac{1}{3} + 2\right) \cdot \ell, J, U\right) \]

      5. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left({\ell}^{2}, \frac{1}{3}, 2\right) \cdot \ell, J, U\right) \]

      6. unpow2 N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\ell \cdot \ell, \frac{1}{3}, 2\right) \cdot \ell, J, U\right) \]

      7. lower-*.f64 86.4

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\ell \cdot \ell, 0.3333333333333333, 2\right) \cdot \ell, J, U\right) \]

   10. Applied rewrites 86.4%

       \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\ell \cdot \ell, 0.3333333333333333, 2\right) \cdot \ell, J, U\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 10: 74.0% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \cos \left(\frac{K}{2}\right)\\ \mathbf{if}\;t\_0 \leq -0.96:\\ \;\;\;\;U\\ \mathbf{elif}\;t\_0 \leq -0.52:\\ \;\;\;\;\mathsf{fma}\left(\left(J + J\right) \cdot \ell, \left(K \cdot K\right) \cdot -0.125, U\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\ell \cdot \ell, 0.3333333333333333, 2\right) \cdot \ell, J, U\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (J l K U)
 :precision binary64
 (let* ((t_0 (cos (/ K 2.0))))
   (if (<= t_0 -0.96)
     U
     (if (<= t_0 -0.52)
       (fma (* (+ J J) l) (* (* K K) -0.125) U)
       (fma (* (fma (* l l) 0.3333333333333333 2.0) l) J U)))))

C

double code(double J, double l, double K, double U) {
	double t_0 = cos((K / 2.0));
	double tmp;
	if (t_0 <= -0.96) {
		tmp = U;
	} else if (t_0 <= -0.52) {
		tmp = fma(((J + J) * l), ((K * K) * -0.125), U);
	} else {
		tmp = fma((fma((l * l), 0.3333333333333333, 2.0) * l), J, U);
	}
	return tmp;
}

Julia

function code(J, l, K, U)
	t_0 = cos(Float64(K / 2.0))
	tmp = 0.0
	if (t_0 <= -0.96)
		tmp = U;
	elseif (t_0 <= -0.52)
		tmp = fma(Float64(Float64(J + J) * l), Float64(Float64(K * K) * -0.125), U);
	else
		tmp = fma(Float64(fma(Float64(l * l), 0.3333333333333333, 2.0) * l), J, U);
	end
	return tmp
end

Wolfram

code[J_, l_, K_, U_] := Block[{t$95$0 = N[Cos[N[(K / 2.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$0, -0.96], U, If[LessEqual[t$95$0, -0.52], N[(N[(N[(J + J), $MachinePrecision] * l), $MachinePrecision] * N[(N[(K * K), $MachinePrecision] * -0.125), $MachinePrecision] + U), $MachinePrecision], N[(N[(N[(N[(l * l), $MachinePrecision] * 0.3333333333333333 + 2.0), $MachinePrecision] * l), $MachinePrecision] * J + U), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (cos.f64 (/.f64 K #s(literal 2 binary64))) < -0.95999999999999996

   1. Initial program 89.7%

      \[\left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

   2. Taylor expanded in J around 0

      \[\leadsto \color{blue}{U} \]
   3. Step-by-step derivation

   4. Applied rewrites 37.5%

      \[\leadsto \color{blue}{U} \]

   if -0.95999999999999996 < (cos.f64 (/.f64 K #s(literal 2 binary64))) < -0.52000000000000002

   1. Initial program 86.7%

      \[\left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

   2. Taylor expanded in K around 0

      \[\leadsto \left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \color{blue}{\left(1 + \frac{-1}{8} \cdot {K}^{2}\right)} + U \]
   3. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

         \[\leadsto \left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \left({K}^{2} \cdot \frac{-1}{8} + 1\right) + U \]

      3. lower-fma.f64 N/A

         \[\leadsto \left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \mathsf{fma}\left({K}^{2}, \color{blue}{\frac{-1}{8}}, 1\right) + U \]

      4. unpow2 N/A

         \[\leadsto \left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \mathsf{fma}\left(K \cdot K, \frac{-1}{8}, 1\right) + U \]

      5. lower-*.f64 67.1

         \[\leadsto \left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \mathsf{fma}\left(K \cdot K, -0.125, 1\right) + U \]

   4. Applied rewrites 67.1%

      \[\leadsto \left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \color{blue}{\mathsf{fma}\left(K \cdot K, -0.125, 1\right)} + U \]

   5. Taylor expanded in l around 0

      \[\leadsto \color{blue}{\left(2 \cdot \left(J \cdot \ell\right)\right)} \cdot \mathsf{fma}\left(K \cdot K, \frac{-1}{8}, 1\right) + U \]
   6. Step-by-step derivation

      1. associate-*r* N/A

         \[\leadsto \left(\left(2 \cdot J\right) \cdot \color{blue}{\ell}\right) \cdot \mathsf{fma}\left(K \cdot K, \frac{-1}{8}, 1\right) + U \]

      2. lower-*.f64 N/A

         \[\leadsto \left(\left(2 \cdot J\right) \cdot \color{blue}{\ell}\right) \cdot \mathsf{fma}\left(K \cdot K, \frac{-1}{8}, 1\right) + U \]

      3. count-2-rev N/A

         \[\leadsto \left(\left(J + J\right) \cdot \ell\right) \cdot \mathsf{fma}\left(K \cdot K, \frac{-1}{8}, 1\right) + U \]

      4. lower-+.f64 53.0

         \[\leadsto \left(\left(J + J\right) \cdot \ell\right) \cdot \mathsf{fma}\left(K \cdot K, -0.125, 1\right) + U \]

   7. Applied rewrites 53.0%

      \[\leadsto \color{blue}{\left(\left(J + J\right) \cdot \ell\right)} \cdot \mathsf{fma}\left(K \cdot K, -0.125, 1\right) + U \]

   8. Taylor expanded in K around inf

      \[\leadsto \left(\left(J + J\right) \cdot \ell\right) \cdot \left(\frac{-1}{8} \cdot \color{blue}{{K}^{2}}\right) + U \]
   9. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(\left(J + J\right) \cdot \ell\right) \cdot \left({K}^{2} \cdot \frac{-1}{8}\right) + U \]

      2. lower-*.f64 N/A

         \[\leadsto \left(\left(J + J\right) \cdot \ell\right) \cdot \left({K}^{2} \cdot \frac{-1}{8}\right) + U \]

      3. pow2 N/A

         \[\leadsto \left(\left(J + J\right) \cdot \ell\right) \cdot \left(\left(K \cdot K\right) \cdot \frac{-1}{8}\right) + U \]

      4. lift-*.f64 53.0

         \[\leadsto \left(\left(J + J\right) \cdot \ell\right) \cdot \left(\left(K \cdot K\right) \cdot -0.125\right) + U \]

   10. Applied rewrites 53.0%

       \[\leadsto \left(\left(J + J\right) \cdot \ell\right) \cdot \left(\left(K \cdot K\right) \cdot \color{blue}{-0.125}\right) + U \]
   11. Step-by-step derivation

       1. lift-+.f64 N/A

          \[\leadsto \color{blue}{\left(\left(J + J\right) \cdot \ell\right) \cdot \left(\left(K \cdot K\right) \cdot \frac{-1}{8}\right) + U} \]

       2. lift-*.f64 N/A

          \[\leadsto \color{blue}{\left(\left(J + J\right) \cdot \ell\right) \cdot \left(\left(K \cdot K\right) \cdot \frac{-1}{8}\right)} + U \]

       3. lower-fma.f64 53.0

          \[\leadsto \color{blue}{\mathsf{fma}\left(\left(J + J\right) \cdot \ell, \left(K \cdot K\right) \cdot -0.125, U\right)} \]

   12. Applied rewrites 53.0%

       \[\leadsto \color{blue}{\mathsf{fma}\left(\left(J + J\right) \cdot \ell, \left(K \cdot K\right) \cdot -0.125, U\right)} \]

   if -0.52000000000000002 < (cos.f64 (/.f64 K #s(literal 2 binary64)))

   1. Initial program 86.2%

      \[\left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

   2. Taylor expanded in J around 0

      \[\leadsto \color{blue}{U + J \cdot \left(\cos \left(\frac{1}{2} \cdot K\right) \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)\right)} \]
   3. Step-by-step derivation

      1. +-commutative N/A

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

      2. associate-*r* N/A

         \[\leadsto \left(J \cdot \cos \left(\frac{1}{2} \cdot K\right)\right) \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) + U \]

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(J \cdot \cos \left(\frac{1}{2} \cdot K\right), \color{blue}{e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}}, U\right) \]

      4. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, \color{blue}{e^{\ell}} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, \color{blue}{e^{\ell}} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

      6. lower-cos.f64 N/A

         \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, e^{\color{blue}{\ell}} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

      7. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

      8. sinh-undef N/A

         \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, 2 \cdot \color{blue}{\sinh \ell}, U\right) \]

      9. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, 2 \cdot \color{blue}{\sinh \ell}, U\right) \]

      10. lower-sinh.f64 99.9

          \[\leadsto \mathsf{fma}\left(\cos \left(0.5 \cdot K\right) \cdot J, 2 \cdot \sinh \ell, U\right) \]

   4. Applied rewrites 99.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\cos \left(0.5 \cdot K\right) \cdot J, 2 \cdot \sinh \ell, U\right)} \]

   5. Taylor expanded in K around 0

      \[\leadsto \color{blue}{U + J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)} \]
   6. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) + \color{blue}{U} \]

      2. *-commutative N/A

         \[\leadsto \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) \cdot J + U \]

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}, \color{blue}{J}, U\right) \]

      4. sinh-undef-rev N/A

         \[\leadsto \mathsf{fma}\left(2 \cdot \sinh \ell, J, U\right) \]

      5. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\sinh \ell \cdot 2, J, U\right) \]

      6. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\sinh \ell \cdot 2, J, U\right) \]

      7. lift-sinh.f64 89.5

         \[\leadsto \mathsf{fma}\left(\sinh \ell \cdot 2, J, U\right) \]

   7. Applied rewrites 89.5%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\sinh \ell \cdot 2, J, U\right)} \]

   8. Taylor expanded in l around 0

      \[\leadsto \mathsf{fma}\left(\ell \cdot \left(2 + \frac{1}{3} \cdot {\ell}^{2}\right), J, U\right) \]
   9. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\left(2 + \frac{1}{3} \cdot {\ell}^{2}\right) \cdot \ell, J, U\right) \]

      2. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\left(2 + \frac{1}{3} \cdot {\ell}^{2}\right) \cdot \ell, J, U\right) \]

      3. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\left(\frac{1}{3} \cdot {\ell}^{2} + 2\right) \cdot \ell, J, U\right) \]

      4. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\left({\ell}^{2} \cdot \frac{1}{3} + 2\right) \cdot \ell, J, U\right) \]

      5. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left({\ell}^{2}, \frac{1}{3}, 2\right) \cdot \ell, J, U\right) \]

      6. unpow2 N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\ell \cdot \ell, \frac{1}{3}, 2\right) \cdot \ell, J, U\right) \]

      7. lower-*.f64 78.8

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\ell \cdot \ell, 0.3333333333333333, 2\right) \cdot \ell, J, U\right) \]

   10. Applied rewrites 78.8%

       \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\ell \cdot \ell, 0.3333333333333333, 2\right) \cdot \ell, J, U\right) \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 11: 71.8% accurate, 4.1× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(\mathsf{fma}\left(\ell \cdot \ell, 0.3333333333333333, 2\right) \cdot \ell, J, U\right) \end{array} \]

FPCore

(FPCore (J l K U)
 :precision binary64
 (fma (* (fma (* l l) 0.3333333333333333 2.0) l) J U))

C

double code(double J, double l, double K, double U) {
	return fma((fma((l * l), 0.3333333333333333, 2.0) * l), J, U);
}

Julia

function code(J, l, K, U)
	return fma(Float64(fma(Float64(l * l), 0.3333333333333333, 2.0) * l), J, U)
end

Wolfram

code[J_, l_, K_, U_] := N[(N[(N[(N[(l * l), $MachinePrecision] * 0.3333333333333333 + 2.0), $MachinePrecision] * l), $MachinePrecision] * J + U), $MachinePrecision]

Derivation

1. Initial program 86.4%

   \[\left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

2. Taylor expanded in J around 0

   \[\leadsto \color{blue}{U + J \cdot \left(\cos \left(\frac{1}{2} \cdot K\right) \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)\right)} \]
3. Step-by-step derivation

   1. +-commutative N/A

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

   2. associate-*r* N/A

      \[\leadsto \left(J \cdot \cos \left(\frac{1}{2} \cdot K\right)\right) \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) + U \]

   3. lower-fma.f64 N/A

      \[\leadsto \mathsf{fma}\left(J \cdot \cos \left(\frac{1}{2} \cdot K\right), \color{blue}{e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}}, U\right) \]

   4. *-commutative N/A

      \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, \color{blue}{e^{\ell}} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

   5. lower-*.f64 N/A

      \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, \color{blue}{e^{\ell}} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

   6. lower-cos.f64 N/A

      \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, e^{\color{blue}{\ell}} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

   7. lower-*.f64 N/A

      \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

   8. sinh-undef N/A

      \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, 2 \cdot \color{blue}{\sinh \ell}, U\right) \]

   9. lower-*.f64 N/A

      \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, 2 \cdot \color{blue}{\sinh \ell}, U\right) \]

   10. lower-sinh.f64 99.9

       \[\leadsto \mathsf{fma}\left(\cos \left(0.5 \cdot K\right) \cdot J, 2 \cdot \sinh \ell, U\right) \]

4. Applied rewrites 99.9%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\cos \left(0.5 \cdot K\right) \cdot J, 2 \cdot \sinh \ell, U\right)} \]

5. Taylor expanded in K around 0

   \[\leadsto \color{blue}{U + J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)} \]
6. Step-by-step derivation

   1. +-commutative N/A

      \[\leadsto J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) + \color{blue}{U} \]

   2. *-commutative N/A

      \[\leadsto \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) \cdot J + U \]

   3. lower-fma.f64 N/A

      \[\leadsto \mathsf{fma}\left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}, \color{blue}{J}, U\right) \]

   4. sinh-undef-rev N/A

      \[\leadsto \mathsf{fma}\left(2 \cdot \sinh \ell, J, U\right) \]

   5. *-commutative N/A

      \[\leadsto \mathsf{fma}\left(\sinh \ell \cdot 2, J, U\right) \]

   6. lower-*.f64 N/A

      \[\leadsto \mathsf{fma}\left(\sinh \ell \cdot 2, J, U\right) \]

   7. lift-sinh.f64 80.7

      \[\leadsto \mathsf{fma}\left(\sinh \ell \cdot 2, J, U\right) \]

7. Applied rewrites 80.7%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\sinh \ell \cdot 2, J, U\right)} \]

8. Taylor expanded in l around 0

   \[\leadsto \mathsf{fma}\left(\ell \cdot \left(2 + \frac{1}{3} \cdot {\ell}^{2}\right), J, U\right) \]
9. Step-by-step derivation

   1. *-commutative N/A

      \[\leadsto \mathsf{fma}\left(\left(2 + \frac{1}{3} \cdot {\ell}^{2}\right) \cdot \ell, J, U\right) \]

   2. lower-*.f64 N/A

      \[\leadsto \mathsf{fma}\left(\left(2 + \frac{1}{3} \cdot {\ell}^{2}\right) \cdot \ell, J, U\right) \]

   3. +-commutative N/A

      \[\leadsto \mathsf{fma}\left(\left(\frac{1}{3} \cdot {\ell}^{2} + 2\right) \cdot \ell, J, U\right) \]

   4. *-commutative N/A

      \[\leadsto \mathsf{fma}\left(\left({\ell}^{2} \cdot \frac{1}{3} + 2\right) \cdot \ell, J, U\right) \]

   5. lower-fma.f64 N/A

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left({\ell}^{2}, \frac{1}{3}, 2\right) \cdot \ell, J, U\right) \]

   6. unpow2 N/A

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\ell \cdot \ell, \frac{1}{3}, 2\right) \cdot \ell, J, U\right) \]

   7. lower-*.f64 71.8

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\ell \cdot \ell, 0.3333333333333333, 2\right) \cdot \ell, J, U\right) \]

10. Applied rewrites 71.8%

    \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\ell \cdot \ell, 0.3333333333333333, 2\right) \cdot \ell, J, U\right) \]
11. Add Preprocessing

Alternative 12: 56.8% accurate, 4.1× speedup

Math

\[\begin{array}{l} \\ -\left(\frac{\ell \cdot J}{U} \cdot -2 - 1\right) \cdot U \end{array} \]

FPCore

(FPCore (J l K U) :precision binary64 (- (* (- (* (/ (* l J) U) -2.0) 1.0) U)))

C

double code(double J, double l, double K, double U) {
	return -(((((l * J) / U) * -2.0) - 1.0) * U);
}

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(j, l, k, u)
use fmin_fmax_functions
    real(8), intent (in) :: j
    real(8), intent (in) :: l
    real(8), intent (in) :: k
    real(8), intent (in) :: u
    code = -(((((l * j) / u) * (-2.0d0)) - 1.0d0) * u)
end function

Java

public static double code(double J, double l, double K, double U) {
	return -(((((l * J) / U) * -2.0) - 1.0) * U);
}

Python

def code(J, l, K, U):
	return -(((((l * J) / U) * -2.0) - 1.0) * U)

Julia

function code(J, l, K, U)
	return Float64(-Float64(Float64(Float64(Float64(Float64(l * J) / U) * -2.0) - 1.0) * U))
end

MATLAB

function tmp = code(J, l, K, U)
	tmp = -(((((l * J) / U) * -2.0) - 1.0) * U);
end

Wolfram

code[J_, l_, K_, U_] := (-N[(N[(N[(N[(N[(l * J), $MachinePrecision] / U), $MachinePrecision] * -2.0), $MachinePrecision] - 1.0), $MachinePrecision] * U), $MachinePrecision])

Derivation

1. Initial program 86.4%

   \[\left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

2. Taylor expanded in J around 0

   \[\leadsto \color{blue}{U + J \cdot \left(\cos \left(\frac{1}{2} \cdot K\right) \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)\right)} \]
3. Step-by-step derivation

   1. +-commutative N/A

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

   2. associate-*r* N/A

      \[\leadsto \left(J \cdot \cos \left(\frac{1}{2} \cdot K\right)\right) \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) + U \]

   3. lower-fma.f64 N/A

      \[\leadsto \mathsf{fma}\left(J \cdot \cos \left(\frac{1}{2} \cdot K\right), \color{blue}{e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}}, U\right) \]

   4. *-commutative N/A

      \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, \color{blue}{e^{\ell}} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

   5. lower-*.f64 N/A

      \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, \color{blue}{e^{\ell}} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

   6. lower-cos.f64 N/A

      \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, e^{\color{blue}{\ell}} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

   7. lower-*.f64 N/A

      \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

   8. sinh-undef N/A

      \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, 2 \cdot \color{blue}{\sinh \ell}, U\right) \]

   9. lower-*.f64 N/A

      \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, 2 \cdot \color{blue}{\sinh \ell}, U\right) \]

   10. lower-sinh.f64 99.9

       \[\leadsto \mathsf{fma}\left(\cos \left(0.5 \cdot K\right) \cdot J, 2 \cdot \sinh \ell, U\right) \]

4. Applied rewrites 99.9%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\cos \left(0.5 \cdot K\right) \cdot J, 2 \cdot \sinh \ell, U\right)} \]

5. Taylor expanded in K around 0

   \[\leadsto \color{blue}{U + J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)} \]
6. Step-by-step derivation

   1. +-commutative N/A

      \[\leadsto J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) + \color{blue}{U} \]

   2. *-commutative N/A

      \[\leadsto \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) \cdot J + U \]

   3. lower-fma.f64 N/A

      \[\leadsto \mathsf{fma}\left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}, \color{blue}{J}, U\right) \]

   4. sinh-undef-rev N/A

      \[\leadsto \mathsf{fma}\left(2 \cdot \sinh \ell, J, U\right) \]

   5. *-commutative N/A

      \[\leadsto \mathsf{fma}\left(\sinh \ell \cdot 2, J, U\right) \]

   6. lower-*.f64 N/A

      \[\leadsto \mathsf{fma}\left(\sinh \ell \cdot 2, J, U\right) \]

   7. lift-sinh.f64 80.7

      \[\leadsto \mathsf{fma}\left(\sinh \ell \cdot 2, J, U\right) \]

7. Applied rewrites 80.7%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\sinh \ell \cdot 2, J, U\right)} \]

8. Taylor expanded in U around -inf

   \[\leadsto -1 \cdot \color{blue}{\left(U \cdot \left(-1 \cdot \frac{J \cdot \left(e^{\ell} - \frac{1}{e^{\ell}}\right)}{U} - 1\right)\right)} \]
9. Step-by-step derivation

   1. mul-1-neg N/A

      \[\leadsto \mathsf{neg}\left(U \cdot \left(-1 \cdot \frac{J \cdot \left(e^{\ell} - \frac{1}{e^{\ell}}\right)}{U} - 1\right)\right) \]

   2. lower-neg.f64 N/A

      \[\leadsto -U \cdot \left(-1 \cdot \frac{J \cdot \left(e^{\ell} - \frac{1}{e^{\ell}}\right)}{U} - 1\right) \]

   3. *-commutative N/A

      \[\leadsto -\left(-1 \cdot \frac{J \cdot \left(e^{\ell} - \frac{1}{e^{\ell}}\right)}{U} - 1\right) \cdot U \]

   4. lower-*.f64 N/A

      \[\leadsto -\left(-1 \cdot \frac{J \cdot \left(e^{\ell} - \frac{1}{e^{\ell}}\right)}{U} - 1\right) \cdot U \]

10. Applied rewrites 79.6%

    \[\leadsto -\left(\left(-\frac{\sinh \ell \cdot \left(J + J\right)}{U}\right) - 1\right) \cdot U \]

11. Taylor expanded in l around 0

    \[\leadsto -\left(-2 \cdot \frac{J \cdot \ell}{U} - 1\right) \cdot U \]
12. Step-by-step derivation

    1. *-commutative N/A

       \[\leadsto -\left(\frac{J \cdot \ell}{U} \cdot -2 - 1\right) \cdot U \]

    2. lower-*.f64 N/A

       \[\leadsto -\left(\frac{J \cdot \ell}{U} \cdot -2 - 1\right) \cdot U \]

    3. lower-/.f64 N/A

       \[\leadsto -\left(\frac{J \cdot \ell}{U} \cdot -2 - 1\right) \cdot U \]

    4. *-commutative N/A

       \[\leadsto -\left(\frac{\ell \cdot J}{U} \cdot -2 - 1\right) \cdot U \]

    5. lower-*.f64 56.8

       \[\leadsto -\left(\frac{\ell \cdot J}{U} \cdot -2 - 1\right) \cdot U \]

13. Applied rewrites 56.8%

    \[\leadsto -\left(\frac{\ell \cdot J}{U} \cdot -2 - 1\right) \cdot U \]
14. Add Preprocessing

Alternative 13: 53.7% accurate, 7.3× speedup

Math

\[\begin{array}{l} \\ \left(\ell + \ell\right) \cdot J + U \end{array} \]

FPCore

(FPCore (J l K U) :precision binary64 (+ (* (+ l l) J) U))

C

double code(double J, double l, double K, double U) {
	return ((l + l) * J) + U;
}

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(j, l, k, u)
use fmin_fmax_functions
    real(8), intent (in) :: j
    real(8), intent (in) :: l
    real(8), intent (in) :: k
    real(8), intent (in) :: u
    code = ((l + l) * j) + u
end function

Java

public static double code(double J, double l, double K, double U) {
	return ((l + l) * J) + U;
}

Python

def code(J, l, K, U):
	return ((l + l) * J) + U

Julia

function code(J, l, K, U)
	return Float64(Float64(Float64(l + l) * J) + U)
end

MATLAB

function tmp = code(J, l, K, U)
	tmp = ((l + l) * J) + U;
end

Wolfram

code[J_, l_, K_, U_] := N[(N[(N[(l + l), $MachinePrecision] * J), $MachinePrecision] + U), $MachinePrecision]

Derivation

1. Initial program 86.4%

   \[\left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

2. Taylor expanded in J around 0

   \[\leadsto \color{blue}{U + J \cdot \left(\cos \left(\frac{1}{2} \cdot K\right) \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)\right)} \]
3. Step-by-step derivation

   1. +-commutative N/A

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

   2. associate-*r* N/A

      \[\leadsto \left(J \cdot \cos \left(\frac{1}{2} \cdot K\right)\right) \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) + U \]

   3. lower-fma.f64 N/A

      \[\leadsto \mathsf{fma}\left(J \cdot \cos \left(\frac{1}{2} \cdot K\right), \color{blue}{e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}}, U\right) \]

   4. *-commutative N/A

      \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, \color{blue}{e^{\ell}} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

   5. lower-*.f64 N/A

      \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, \color{blue}{e^{\ell}} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

   6. lower-cos.f64 N/A

      \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, e^{\color{blue}{\ell}} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

   7. lower-*.f64 N/A

      \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

   8. sinh-undef N/A

      \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, 2 \cdot \color{blue}{\sinh \ell}, U\right) \]

   9. lower-*.f64 N/A

      \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, 2 \cdot \color{blue}{\sinh \ell}, U\right) \]

   10. lower-sinh.f64 99.9

       \[\leadsto \mathsf{fma}\left(\cos \left(0.5 \cdot K\right) \cdot J, 2 \cdot \sinh \ell, U\right) \]

4. Applied rewrites 99.9%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\cos \left(0.5 \cdot K\right) \cdot J, 2 \cdot \sinh \ell, U\right)} \]

5. Taylor expanded in K around 0

   \[\leadsto \color{blue}{U + J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)} \]
6. Step-by-step derivation

   1. +-commutative N/A

      \[\leadsto J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) + \color{blue}{U} \]

   2. *-commutative N/A

      \[\leadsto \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) \cdot J + U \]

   3. lower-fma.f64 N/A

      \[\leadsto \mathsf{fma}\left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}, \color{blue}{J}, U\right) \]

   4. sinh-undef-rev N/A

      \[\leadsto \mathsf{fma}\left(2 \cdot \sinh \ell, J, U\right) \]

   5. *-commutative N/A

      \[\leadsto \mathsf{fma}\left(\sinh \ell \cdot 2, J, U\right) \]

   6. lower-*.f64 N/A

      \[\leadsto \mathsf{fma}\left(\sinh \ell \cdot 2, J, U\right) \]

   7. lift-sinh.f64 80.7

      \[\leadsto \mathsf{fma}\left(\sinh \ell \cdot 2, J, U\right) \]

7. Applied rewrites 80.7%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\sinh \ell \cdot 2, J, U\right)} \]

8. Taylor expanded in l around 0

   \[\leadsto \mathsf{fma}\left(2 \cdot \ell, J, U\right) \]
9. Step-by-step derivation

   1. count-2-rev N/A

      \[\leadsto \mathsf{fma}\left(\ell + \ell, J, U\right) \]

   2. lower-+.f64 53.7

      \[\leadsto \mathsf{fma}\left(\ell + \ell, J, U\right) \]

10. Applied rewrites 53.7%

    \[\leadsto \mathsf{fma}\left(\ell + \ell, J, U\right) \]
11. Step-by-step derivation

    1. lift-fma.f64 N/A

       \[\leadsto \left(\ell + \ell\right) \cdot J + \color{blue}{U} \]

    2. lower-+.f64 N/A

       \[\leadsto \left(\ell + \ell\right) \cdot J + \color{blue}{U} \]

    3. lower-*.f64 53.7

       \[\leadsto \left(\ell + \ell\right) \cdot J + U \]

12. Applied rewrites 53.7%

    \[\leadsto \left(\ell + \ell\right) \cdot J + \color{blue}{U} \]
13. Add Preprocessing

Alternative 14: 53.7% accurate, 7.9× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(\ell + \ell, J, U\right) \end{array} \]

FPCore

(FPCore (J l K U) :precision binary64 (fma (+ l l) J U))

C

double code(double J, double l, double K, double U) {
	return fma((l + l), J, U);
}

Julia

function code(J, l, K, U)
	return fma(Float64(l + l), J, U)
end

Wolfram

code[J_, l_, K_, U_] := N[(N[(l + l), $MachinePrecision] * J + U), $MachinePrecision]

Derivation

1. Initial program 86.4%

   \[\left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

2. Taylor expanded in J around 0

   \[\leadsto \color{blue}{U + J \cdot \left(\cos \left(\frac{1}{2} \cdot K\right) \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)\right)} \]
3. Step-by-step derivation

   1. +-commutative N/A

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

   2. associate-*r* N/A

      \[\leadsto \left(J \cdot \cos \left(\frac{1}{2} \cdot K\right)\right) \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) + U \]

   3. lower-fma.f64 N/A

      \[\leadsto \mathsf{fma}\left(J \cdot \cos \left(\frac{1}{2} \cdot K\right), \color{blue}{e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}}, U\right) \]

   4. *-commutative N/A

      \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, \color{blue}{e^{\ell}} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

   5. lower-*.f64 N/A

      \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, \color{blue}{e^{\ell}} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

   6. lower-cos.f64 N/A

      \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, e^{\color{blue}{\ell}} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

   7. lower-*.f64 N/A

      \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}, U\right) \]

   8. sinh-undef N/A

      \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, 2 \cdot \color{blue}{\sinh \ell}, U\right) \]

   9. lower-*.f64 N/A

      \[\leadsto \mathsf{fma}\left(\cos \left(\frac{1}{2} \cdot K\right) \cdot J, 2 \cdot \color{blue}{\sinh \ell}, U\right) \]

   10. lower-sinh.f64 99.9

       \[\leadsto \mathsf{fma}\left(\cos \left(0.5 \cdot K\right) \cdot J, 2 \cdot \sinh \ell, U\right) \]

4. Applied rewrites 99.9%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\cos \left(0.5 \cdot K\right) \cdot J, 2 \cdot \sinh \ell, U\right)} \]

5. Taylor expanded in K around 0

   \[\leadsto \color{blue}{U + J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)} \]
6. Step-by-step derivation

   1. +-commutative N/A

      \[\leadsto J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) + \color{blue}{U} \]

   2. *-commutative N/A

      \[\leadsto \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) \cdot J + U \]

   3. lower-fma.f64 N/A

      \[\leadsto \mathsf{fma}\left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}, \color{blue}{J}, U\right) \]

   4. sinh-undef-rev N/A

      \[\leadsto \mathsf{fma}\left(2 \cdot \sinh \ell, J, U\right) \]

   5. *-commutative N/A

      \[\leadsto \mathsf{fma}\left(\sinh \ell \cdot 2, J, U\right) \]

   6. lower-*.f64 N/A

      \[\leadsto \mathsf{fma}\left(\sinh \ell \cdot 2, J, U\right) \]

   7. lift-sinh.f64 80.7

      \[\leadsto \mathsf{fma}\left(\sinh \ell \cdot 2, J, U\right) \]

7. Applied rewrites 80.7%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\sinh \ell \cdot 2, J, U\right)} \]

8. Taylor expanded in l around 0

   \[\leadsto \mathsf{fma}\left(2 \cdot \ell, J, U\right) \]
9. Step-by-step derivation

   1. count-2-rev N/A

      \[\leadsto \mathsf{fma}\left(\ell + \ell, J, U\right) \]

   2. lower-+.f64 53.7

      \[\leadsto \mathsf{fma}\left(\ell + \ell, J, U\right) \]

10. Applied rewrites 53.7%

    \[\leadsto \mathsf{fma}\left(\ell + \ell, J, U\right) \]
11. Add Preprocessing

Alternative 15: 36.4% accurate, 68.7× speedup

Math

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

FPCore

(FPCore (J l K U) :precision binary64 U)

C

double code(double J, double l, double K, double U) {
	return U;
}

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(j, l, k, u)
use fmin_fmax_functions
    real(8), intent (in) :: j
    real(8), intent (in) :: l
    real(8), intent (in) :: k
    real(8), intent (in) :: u
    code = u
end function

Java

public static double code(double J, double l, double K, double U) {
	return U;
}

Python

def code(J, l, K, U):
	return U

Julia

function code(J, l, K, U)
	return U
end

MATLAB

function tmp = code(J, l, K, U)
	tmp = U;
end

Wolfram

code[J_, l_, K_, U_] := U

Derivation

1. Initial program 86.4%

   \[\left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

2. Taylor expanded in J around 0

   \[\leadsto \color{blue}{U} \]
3. Step-by-step derivation

4. Applied rewrites 36.4%

   \[\leadsto \color{blue}{U} \]
5. Add Preprocessing

Reproduce

herbie shell --seed 2025133 
(FPCore (J l K U)
  :name "Maksimov and Kolovsky, Equation (4)"
  :precision binary64
  (+ (* (* J (- (exp l) (exp (- l)))) (cos (/ K 2.0))) U))