Maksimov and Kolovsky, Equation (4)

Percentage Accurate: 86.3% → 99.9%

Time: 6.6s

Alternatives: 17

Speedup: 1.4×

• 49.5% 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.3% 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.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 86.3%

   \[\left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-+.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. lift-*.f64 N/A

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

   4. lift--.f64 N/A

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

   5. lift-exp.f64 N/A

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

   6. lift-neg.f64 N/A

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

   7. lift-exp.f64 N/A

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

   8. lift-/.f64 N/A

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

   9. lift-cos.f64 N/A

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

   10. lower-fma.f64 N/A

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

   11. *-commutative N/A

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

   12. lower-*.f64 N/A

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

   13. sinh-undef N/A

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

   14. lower-*.f64 N/A

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

   15. lower-sinh.f64 N/A

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

   16. lift-cos.f64 N/A

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

   17. lift-/.f64 99.9

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

4. Applied rewrites 99.9%

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

Alternative 2: 97.2% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \cos \left(\frac{K}{2}\right)\\ \mathbf{if}\;t\_0 \leq 0.998:\\ \;\;\;\;\left(J \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.0003968253968253968, \ell \cdot \ell, 0.016666666666666666\right), \ell \cdot \ell, 0.3333333333333333\right), \ell \cdot \ell, 2\right) \cdot \ell\right)\right) \cdot t\_0 + 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
 (let* ((t_0 (cos (/ K 2.0))))
   (if (<= t_0 0.998)
     (+
      (*
       (*
        J
        (*
         (fma
          (fma
           (fma 0.0003968253968253968 (* l l) 0.016666666666666666)
           (* l l)
           0.3333333333333333)
          (* l l)
          2.0)
         l))
       t_0)
      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.998) {
		tmp = ((J * (fma(fma(fma(0.0003968253968253968, (l * l), 0.016666666666666666), (l * l), 0.3333333333333333), (l * l), 2.0) * l)) * t_0) + 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.998)
		tmp = Float64(Float64(Float64(J * Float64(fma(fma(fma(0.0003968253968253968, Float64(l * l), 0.016666666666666666), Float64(l * l), 0.3333333333333333), Float64(l * l), 2.0) * l)) * t_0) + 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.998], N[(N[(N[(J * N[(N[(N[(N[(0.0003968253968253968 * N[(l * l), $MachinePrecision] + 0.016666666666666666), $MachinePrecision] * N[(l * l), $MachinePrecision] + 0.3333333333333333), $MachinePrecision] * N[(l * l), $MachinePrecision] + 2.0), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * t$95$0), $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.998

   1. Initial program 86.4%

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

   3. Taylor expanded in l around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   5. Applied rewrites 94.7%

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

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

   1. Initial program 86.1%

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

   3. Taylor expanded in K around 0

      \[\leadsto \color{blue}{U + J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)} \]
   4. 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 99.6

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

   5. Applied rewrites 99.6%

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

Alternative 3: 94.9% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \cos \left(\frac{K}{2}\right)\\ \mathbf{if}\;t\_0 \leq -0.01:\\ \;\;\;\;\left(J \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(0.016666666666666666, \ell \cdot \ell, 0.3333333333333333\right), \ell \cdot \ell, 2\right) \cdot \ell\right)\right) \cdot t\_0 + 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
 (let* ((t_0 (cos (/ K 2.0))))
   (if (<= t_0 -0.01)
     (+
      (*
       (*
        J
        (*
         (fma
          (fma 0.016666666666666666 (* l l) 0.3333333333333333)
          (* l l)
          2.0)
         l))
       t_0)
      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.01) {
		tmp = ((J * (fma(fma(0.016666666666666666, (l * l), 0.3333333333333333), (l * l), 2.0) * l)) * t_0) + 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.01)
		tmp = Float64(Float64(Float64(J * Float64(fma(fma(0.016666666666666666, Float64(l * l), 0.3333333333333333), Float64(l * l), 2.0) * l)) * t_0) + 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.01], N[(N[(N[(J * N[(N[(N[(0.016666666666666666 * N[(l * l), $MachinePrecision] + 0.3333333333333333), $MachinePrecision] * N[(l * l), $MachinePrecision] + 2.0), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * t$95$0), $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.0100000000000000002

   1. Initial program 86.8%

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

   3. Taylor expanded in l around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. +-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. unpow2 N/A

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

      9. lower-*.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-*.f64 92.9

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

   5. Applied rewrites 92.9%

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

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

   1. Initial program 86.1%

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

   3. Taylor expanded in K around 0

      \[\leadsto \color{blue}{U + J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)} \]
   4. 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 95.6

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

   5. Applied rewrites 95.6%

      \[\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: 93.5% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \cos \left(\frac{K}{2}\right)\\ \mathbf{if}\;t\_0 \leq -0.01:\\ \;\;\;\;\left(J \cdot \left(\mathsf{fma}\left(\ell \cdot \ell, 0.3333333333333333, 2\right) \cdot \ell\right)\right) \cdot t\_0 + 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
 (let* ((t_0 (cos (/ K 2.0))))
   (if (<= t_0 -0.01)
     (+ (* (* J (* (fma (* l l) 0.3333333333333333 2.0) l)) t_0) 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.01) {
		tmp = ((J * (fma((l * l), 0.3333333333333333, 2.0) * l)) * t_0) + 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.01)
		tmp = Float64(Float64(Float64(J * Float64(fma(Float64(l * l), 0.3333333333333333, 2.0) * l)) * t_0) + 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.01], N[(N[(N[(J * N[(N[(N[(l * l), $MachinePrecision] * 0.3333333333333333 + 2.0), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * t$95$0), $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.0100000000000000002

   1. Initial program 86.8%

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

   3. Taylor expanded in l around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 87.3

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

   5. Applied rewrites 87.3%

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

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

   1. Initial program 86.1%

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

   3. Taylor expanded in K around 0

      \[\leadsto \color{blue}{U + J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)} \]
   4. 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 95.6

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

   5. Applied rewrites 95.6%

      \[\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: 55.8% accurate, 1.4× speedup

Math

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

FPCore

(FPCore (J l K U)
 :precision binary64
 (if (<= (* J (- (exp l) (exp (- l)))) 0.0)
   (fma (+ J J) l U)
   (* (fma 2.0 l (/ U J)) J)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 J (-.f64 (exp.f64 l) (exp.f64 (neg.f64 l)))) < -0.0

   1. Initial program 81.5%

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

   3. 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)} \]
   4. 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. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. associate-*r* N/A

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

      5. lower-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. lower-cos.f64 N/A

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

      9. lower-*.f64 76.4

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

   5. Applied rewrites 76.4%

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

   6. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-fma.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 65.3

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

   8. Applied rewrites 65.3%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. count-2-rev N/A

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

      4. lower-+.f64 65.3

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

   10. Applied rewrites 65.3%

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

   if -0.0 < (*.f64 J (-.f64 (exp.f64 l) (exp.f64 (neg.f64 l))))

   1. Initial program 99.1%

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

   3. 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)} \]
   4. 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. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. associate-*r* N/A

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

      5. lower-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. lower-cos.f64 N/A

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

      9. lower-*.f64 31.7

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

   5. Applied rewrites 31.7%

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

   6. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-fma.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 24.2

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

   8. Applied rewrites 24.2%

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

   9. Taylor expanded in J around inf

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

       1. *-commutative N/A

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

       2. lower-*.f64 N/A

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

       3. lower-fma.f64 N/A

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

       4. lower-/.f64 29.7

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

   11. Applied rewrites 29.7%

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

Alternative 6: 99.5% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \cos \left(0.5 \cdot K\right)\\ \mathbf{if}\;\ell \leq -9.5 \lor \neg \left(\ell \leq 5\right):\\ \;\;\;\;\left(t\_0 \cdot J\right) \cdot \left(2 \cdot \sinh \ell\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(J \cdot \ell, t\_0 \cdot 2, U\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (J l K U)
 :precision binary64
 (let* ((t_0 (cos (* 0.5 K))))
   (if (or (<= l -9.5) (not (<= l 5.0)))
     (* (* t_0 J) (* 2.0 (sinh l)))
     (fma (* J l) (* t_0 2.0) U))))

C

double code(double J, double l, double K, double U) {
	double t_0 = cos((0.5 * K));
	double tmp;
	if ((l <= -9.5) || !(l <= 5.0)) {
		tmp = (t_0 * J) * (2.0 * sinh(l));
	} else {
		tmp = fma((J * l), (t_0 * 2.0), U);
	}
	return tmp;
}

Julia

function code(J, l, K, U)
	t_0 = cos(Float64(0.5 * K))
	tmp = 0.0
	if ((l <= -9.5) || !(l <= 5.0))
		tmp = Float64(Float64(t_0 * J) * Float64(2.0 * sinh(l)));
	else
		tmp = fma(Float64(J * l), Float64(t_0 * 2.0), U);
	end
	return tmp
end

Wolfram

code[J_, l_, K_, U_] := Block[{t$95$0 = N[Cos[N[(0.5 * K), $MachinePrecision]], $MachinePrecision]}, If[Or[LessEqual[l, -9.5], N[Not[LessEqual[l, 5.0]], $MachinePrecision]], N[(N[(t$95$0 * J), $MachinePrecision] * N[(2.0 * N[Sinh[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(J * l), $MachinePrecision] * N[(t$95$0 * 2.0), $MachinePrecision] + U), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if l < -9.5 or 5 < 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. Add Preprocessing

   3. 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)} \]
   4. 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. lower-*.f64 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)} \]

      3. *-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) \]

      4. lower-*.f64 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) \]

      5. lower-cos.f64 N/A

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

      6. lower-*.f64 N/A

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

      7. sinh-undef N/A

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

      8. lower-*.f64 N/A

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

      9. lower-sinh.f64 99.6

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

   5. Applied rewrites 99.6%

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

   if -9.5 < l < 5

   1. Initial program 72.7%

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

   3. 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)} \]
   4. 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. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. associate-*r* N/A

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

      5. lower-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. lower-cos.f64 N/A

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

      9. lower-*.f64 99.4

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

   5. Applied rewrites 99.4%

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

      1. lift-fma.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-cos.f64 N/A

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

      6. associate-*l* N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. lower-*.f64 N/A

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

      11. lift-cos.f64 N/A

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

      12. lift-*.f64 99.4

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

   7. Applied rewrites 99.4%

      \[\leadsto \mathsf{fma}\left(J \cdot \ell, \color{blue}{\cos \left(0.5 \cdot K\right) \cdot 2}, U\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\ell \leq -9.5 \lor \neg \left(\ell \leq 5\right):\\ \;\;\;\;\left(\cos \left(0.5 \cdot K\right) \cdot J\right) \cdot \left(2 \cdot \sinh \ell\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(J \cdot \ell, \cos \left(0.5 \cdot K\right) \cdot 2, U\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 87.2% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\cos \left(\frac{K}{2}\right) \leq -0.01:\\ \;\;\;\;\mathsf{fma}\left(\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.0003968253968253968, \ell \cdot \ell, 0.016666666666666666\right), \ell \cdot \ell, 0.3333333333333333\right), \ell \cdot \ell, 2\right) \cdot \ell\right) \cdot J, \mathsf{fma}\left(K \cdot K, -0.125, 1\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.01)
   (fma
    (*
     (*
      (fma
       (fma
        (fma 0.0003968253968253968 (* l l) 0.016666666666666666)
        (* l l)
        0.3333333333333333)
       (* l l)
       2.0)
      l)
     J)
    (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.01) {
		tmp = fma(((fma(fma(fma(0.0003968253968253968, (l * l), 0.016666666666666666), (l * l), 0.3333333333333333), (l * l), 2.0) * l) * J), 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.01)
		tmp = fma(Float64(Float64(fma(fma(fma(0.0003968253968253968, Float64(l * l), 0.016666666666666666), Float64(l * l), 0.3333333333333333), Float64(l * l), 2.0) * l) * J), 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.01], N[(N[(N[(N[(N[(N[(0.0003968253968253968 * N[(l * l), $MachinePrecision] + 0.016666666666666666), $MachinePrecision] * N[(l * l), $MachinePrecision] + 0.3333333333333333), $MachinePrecision] * N[(l * l), $MachinePrecision] + 2.0), $MachinePrecision] * l), $MachinePrecision] * J), $MachinePrecision] * N[(N[(K * K), $MachinePrecision] * -0.125 + 1.0), $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.0100000000000000002

   1. Initial program 86.8%

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

   3. Taylor expanded in l around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   5. Applied rewrites 94.8%

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

   6. Taylor expanded in K around 0

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

      1. +-commutative N/A

         \[\leadsto \left(J \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2520}, \ell \cdot \ell, \frac{1}{60}\right), \ell \cdot \ell, \frac{1}{3}\right), \ell \cdot \ell, 2\right) \cdot \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(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2520}, \ell \cdot \ell, \frac{1}{60}\right), \ell \cdot \ell, \frac{1}{3}\right), \ell \cdot \ell, 2\right) \cdot \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(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2520}, \ell \cdot \ell, \frac{1}{60}\right), \ell \cdot \ell, \frac{1}{3}\right), \ell \cdot \ell, 2\right) \cdot \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(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2520}, \ell \cdot \ell, \frac{1}{60}\right), \ell \cdot \ell, \frac{1}{3}\right), \ell \cdot \ell, 2\right) \cdot \ell\right)\right) \cdot \mathsf{fma}\left(K \cdot K, \frac{-1}{8}, 1\right) + U \]

      5. lower-*.f64 62.4

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

   8. Applied rewrites 62.4%

      \[\leadsto \left(J \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.0003968253968253968, \ell \cdot \ell, 0.016666666666666666\right), \ell \cdot \ell, 0.3333333333333333\right), \ell \cdot \ell, 2\right) \cdot \ell\right)\right) \cdot \color{blue}{\mathsf{fma}\left(K \cdot K, -0.125, 1\right)} + U \]
   9. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lower-fma.f64 62.4

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 62.4

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

   10. Applied rewrites 62.4%

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

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

   1. Initial program 86.1%

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

   3. Taylor expanded in K around 0

      \[\leadsto \color{blue}{U + J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)} \]
   4. 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 95.6

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

   5. Applied rewrites 95.6%

      \[\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: 99.9% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 86.3%

   \[\left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-+.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. lift-*.f64 N/A

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

   4. lift--.f64 N/A

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

   5. lift-exp.f64 N/A

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

   6. lift-neg.f64 N/A

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

   7. lift-exp.f64 N/A

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

   8. lift-/.f64 N/A

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

   9. lift-cos.f64 N/A

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

   10. associate-*l* N/A

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

   11. lower-fma.f64 N/A

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

4. Applied rewrites 99.9%

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

Alternative 9: 83.6% accurate, 1.9× speedup

Math

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

FPCore

(FPCore (J l K U)
 :precision binary64
 (if (<= (cos (/ K 2.0)) -0.01)
   (fma
    (*
     (*
      (fma
       (fma
        (fma 0.0003968253968253968 (* l l) 0.016666666666666666)
        (* l l)
        0.3333333333333333)
       (* l l)
       2.0)
      l)
     J)
    (fma (* K K) -0.125 1.0)
    U)
   (fma
    (*
     (*
      (fma
       (fma
        (fma (* l l) 0.0003968253968253968 0.016666666666666666)
        (* l l)
        0.3333333333333333)
       (* l l)
       2.0)
      l)
     J)
    1.0
    U)))

C

double code(double J, double l, double K, double U) {
	double tmp;
	if (cos((K / 2.0)) <= -0.01) {
		tmp = fma(((fma(fma(fma(0.0003968253968253968, (l * l), 0.016666666666666666), (l * l), 0.3333333333333333), (l * l), 2.0) * l) * J), fma((K * K), -0.125, 1.0), U);
	} else {
		tmp = fma(((fma(fma(fma((l * l), 0.0003968253968253968, 0.016666666666666666), (l * l), 0.3333333333333333), (l * l), 2.0) * l) * J), 1.0, U);
	}
	return tmp;
}

Julia

function code(J, l, K, U)
	tmp = 0.0
	if (cos(Float64(K / 2.0)) <= -0.01)
		tmp = fma(Float64(Float64(fma(fma(fma(0.0003968253968253968, Float64(l * l), 0.016666666666666666), Float64(l * l), 0.3333333333333333), Float64(l * l), 2.0) * l) * J), fma(Float64(K * K), -0.125, 1.0), U);
	else
		tmp = fma(Float64(Float64(fma(fma(fma(Float64(l * l), 0.0003968253968253968, 0.016666666666666666), Float64(l * l), 0.3333333333333333), Float64(l * l), 2.0) * l) * J), 1.0, U);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 86.8%

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

   3. Taylor expanded in l around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   5. Applied rewrites 94.8%

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

   6. Taylor expanded in K around 0

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

      1. +-commutative N/A

         \[\leadsto \left(J \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2520}, \ell \cdot \ell, \frac{1}{60}\right), \ell \cdot \ell, \frac{1}{3}\right), \ell \cdot \ell, 2\right) \cdot \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(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2520}, \ell \cdot \ell, \frac{1}{60}\right), \ell \cdot \ell, \frac{1}{3}\right), \ell \cdot \ell, 2\right) \cdot \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(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2520}, \ell \cdot \ell, \frac{1}{60}\right), \ell \cdot \ell, \frac{1}{3}\right), \ell \cdot \ell, 2\right) \cdot \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(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2520}, \ell \cdot \ell, \frac{1}{60}\right), \ell \cdot \ell, \frac{1}{3}\right), \ell \cdot \ell, 2\right) \cdot \ell\right)\right) \cdot \mathsf{fma}\left(K \cdot K, \frac{-1}{8}, 1\right) + U \]

      5. lower-*.f64 62.4

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

   8. Applied rewrites 62.4%

      \[\leadsto \left(J \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.0003968253968253968, \ell \cdot \ell, 0.016666666666666666\right), \ell \cdot \ell, 0.3333333333333333\right), \ell \cdot \ell, 2\right) \cdot \ell\right)\right) \cdot \color{blue}{\mathsf{fma}\left(K \cdot K, -0.125, 1\right)} + U \]
   9. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lower-fma.f64 62.4

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 62.4

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

   10. Applied rewrites 62.4%

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

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

   1. Initial program 86.1%

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

   3. Taylor expanded in l around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   5. Applied rewrites 95.0%

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

   6. Taylor expanded in K around 0

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

   8. Applied rewrites 90.7%

      \[\leadsto \left(J \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.0003968253968253968, \ell \cdot \ell, 0.016666666666666666\right), \ell \cdot \ell, 0.3333333333333333\right), \ell \cdot \ell, 2\right) \cdot \ell\right)\right) \cdot \color{blue}{1} + U \]
   9. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lower-fma.f64 90.7

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

   10. Applied rewrites 90.7%

       \[\leadsto \color{blue}{\mathsf{fma}\left(\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\ell \cdot \ell, 0.0003968253968253968, 0.016666666666666666\right), \ell \cdot \ell, 0.3333333333333333\right), \ell \cdot \ell, 2\right) \cdot \ell\right) \cdot J, 1, U\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 83.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\cos \left(\frac{K}{2}\right) \leq -0.01:\\ \;\;\;\;\mathsf{fma}\left(\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.0003968253968253968, \ell \cdot \ell, 0.016666666666666666\right), \ell \cdot \ell, 0.3333333333333333\right), \ell \cdot \ell, 2\right) \cdot \ell\right) \cdot J, \mathsf{fma}\left(K \cdot K, -0.125, 1\right), U\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\ell \cdot \ell, 0.0003968253968253968, 0.016666666666666666\right), \ell \cdot \ell, 0.3333333333333333\right), \ell \cdot \ell, 2\right) \cdot \ell\right) \cdot J, 1, U\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 82.8% accurate, 2.0× speedup

Math

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

FPCore

(FPCore (J l K U)
 :precision binary64
 (if (<= (cos (/ K 2.0)) -0.01)
   (+
    (*
     (* (fma (* (* l l) J) 0.3333333333333333 (* 2.0 J)) l)
     (fma (* K K) -0.125 1.0))
    U)
   (fma
    (*
     (*
      (fma
       (fma
        (fma (* l l) 0.0003968253968253968 0.016666666666666666)
        (* l l)
        0.3333333333333333)
       (* l l)
       2.0)
      l)
     J)
    1.0
    U)))

C

double code(double J, double l, double K, double U) {
	double tmp;
	if (cos((K / 2.0)) <= -0.01) {
		tmp = ((fma(((l * l) * J), 0.3333333333333333, (2.0 * J)) * l) * fma((K * K), -0.125, 1.0)) + U;
	} else {
		tmp = fma(((fma(fma(fma((l * l), 0.0003968253968253968, 0.016666666666666666), (l * l), 0.3333333333333333), (l * l), 2.0) * l) * J), 1.0, U);
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 86.8%

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

   3. Taylor expanded in l around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. unpow2 N/A

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

      8. lower-*.f64 N/A

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

      9. lower-*.f64 83.9

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

   5. Applied rewrites 83.9%

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

   6. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 59.6

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

   8. Applied rewrites 59.6%

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

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

   1. Initial program 86.1%

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

   3. Taylor expanded in l around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   5. Applied rewrites 95.0%

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

   6. Taylor expanded in K around 0

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

   8. Applied rewrites 90.7%

      \[\leadsto \left(J \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.0003968253968253968, \ell \cdot \ell, 0.016666666666666666\right), \ell \cdot \ell, 0.3333333333333333\right), \ell \cdot \ell, 2\right) \cdot \ell\right)\right) \cdot \color{blue}{1} + U \]
   9. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lower-fma.f64 90.7

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

   10. Applied rewrites 90.7%

       \[\leadsto \color{blue}{\mathsf{fma}\left(\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\ell \cdot \ell, 0.0003968253968253968, 0.016666666666666666\right), \ell \cdot \ell, 0.3333333333333333\right), \ell \cdot \ell, 2\right) \cdot \ell\right) \cdot J, 1, U\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 82.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\cos \left(\frac{K}{2}\right) \leq -0.01:\\ \;\;\;\;\left(\mathsf{fma}\left(\left(\ell \cdot \ell\right) \cdot J, 0.3333333333333333, 2 \cdot J\right) \cdot \ell\right) \cdot \mathsf{fma}\left(K \cdot K, -0.125, 1\right) + U\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\ell \cdot \ell, 0.0003968253968253968, 0.016666666666666666\right), \ell \cdot \ell, 0.3333333333333333\right), \ell \cdot \ell, 2\right) \cdot \ell\right) \cdot J, 1, U\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 81.3% accurate, 2.0× speedup

Math

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

FPCore

(FPCore (J l K U)
 :precision binary64
 (if (<= (cos (/ K 2.0)) -0.01)
   (+
    (*
     (* (fma (* (* l l) J) 0.3333333333333333 (* 2.0 J)) l)
     (fma (* K K) -0.125 1.0))
    U)
   (fma
    (*
     (fma (fma (* l l) 0.016666666666666666 0.3333333333333333) (* l l) 2.0)
     l)
    J
    U)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 86.8%

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

   3. Taylor expanded in l around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. unpow2 N/A

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

      8. lower-*.f64 N/A

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

      9. lower-*.f64 83.9

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

   5. Applied rewrites 83.9%

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

   6. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 59.6

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

   8. Applied rewrites 59.6%

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

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

   1. Initial program 86.1%

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

   3. Taylor expanded in K around 0

      \[\leadsto \color{blue}{U + J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)} \]
   4. 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 95.6

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

   5. Applied rewrites 95.6%

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

   6. Taylor expanded in l around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. +-commutative N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

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

      9. pow2 N/A

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

      10. lift-*.f64 N/A

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

      11. pow2 N/A

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

      12. lift-*.f64 88.7

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

   8. Applied rewrites 88.7%

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

4. Final simplification 81.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\cos \left(\frac{K}{2}\right) \leq -0.01:\\ \;\;\;\;\left(\mathsf{fma}\left(\left(\ell \cdot \ell\right) \cdot J, 0.3333333333333333, 2 \cdot J\right) \cdot \ell\right) \cdot \mathsf{fma}\left(K \cdot K, -0.125, 1\right) + U\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\ell \cdot \ell, 0.016666666666666666, 0.3333333333333333\right), \ell \cdot \ell, 2\right) \cdot \ell, J, U\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 79.3% accurate, 2.2× speedup

Math

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

FPCore

(FPCore (J l K U)
 :precision binary64
 (if (<= (cos (/ K 2.0)) -0.01)
   (fma (* (* l J) (fma (* K K) -0.125 1.0)) 2.0 U)
   (fma
    (*
     (fma (fma (* l l) 0.016666666666666666 0.3333333333333333) (* l l) 2.0)
     l)
    J
    U)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 86.8%

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

   3. 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)} \]
   4. 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. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. associate-*r* N/A

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

      5. lower-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. lower-cos.f64 N/A

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

      9. lower-*.f64 63.8

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

   5. Applied rewrites 63.8%

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

   6. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 51.4

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

   8. Applied rewrites 51.4%

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

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

   1. Initial program 86.1%

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

   3. Taylor expanded in K around 0

      \[\leadsto \color{blue}{U + J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)} \]
   4. 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 95.6

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

   5. Applied rewrites 95.6%

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

   6. Taylor expanded in l around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. +-commutative N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

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

      9. pow2 N/A

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

      10. lift-*.f64 N/A

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

      11. pow2 N/A

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

      12. lift-*.f64 88.7

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

   8. Applied rewrites 88.7%

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

4. Final simplification 79.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\cos \left(\frac{K}{2}\right) \leq -0.01:\\ \;\;\;\;\mathsf{fma}\left(\left(\ell \cdot J\right) \cdot \mathsf{fma}\left(K \cdot K, -0.125, 1\right), 2, U\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\ell \cdot \ell, 0.016666666666666666, 0.3333333333333333\right), \ell \cdot \ell, 2\right) \cdot \ell, J, U\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 13: 75.8% accurate, 2.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\cos \left(\frac{K}{2}\right) \leq -0.01:\\ \;\;\;\;\mathsf{fma}\left(\left(\ell \cdot J\right) \cdot \mathsf{fma}\left(K \cdot K, -0.125, 1\right), 2, 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
 (if (<= (cos (/ K 2.0)) -0.01)
   (fma (* (* l J) (fma (* K K) -0.125 1.0)) 2.0 U)
   (fma (* (fma (* l l) 0.3333333333333333 2.0) l) J U)))

C

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

Julia

function code(J, l, K, U)
	tmp = 0.0
	if (cos(Float64(K / 2.0)) <= -0.01)
		tmp = fma(Float64(Float64(l * J) * fma(Float64(K * K), -0.125, 1.0)), 2.0, 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_] := If[LessEqual[N[Cos[N[(K / 2.0), $MachinePrecision]], $MachinePrecision], -0.01], N[(N[(N[(l * J), $MachinePrecision] * N[(N[(K * K), $MachinePrecision] * -0.125 + 1.0), $MachinePrecision]), $MachinePrecision] * 2.0 + U), $MachinePrecision], N[(N[(N[(N[(l * l), $MachinePrecision] * 0.3333333333333333 + 2.0), $MachinePrecision] * l), $MachinePrecision] * J + U), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 86.8%

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

   3. 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)} \]
   4. 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. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. associate-*r* N/A

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

      5. lower-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. lower-cos.f64 N/A

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

      9. lower-*.f64 63.8

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

   5. Applied rewrites 63.8%

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

   6. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 51.4

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

   8. Applied rewrites 51.4%

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

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

   1. Initial program 86.1%

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

   3. Taylor expanded in K around 0

      \[\leadsto \color{blue}{U + J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)} \]
   4. 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 95.6

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

   5. Applied rewrites 95.6%

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

   6. Taylor expanded in l around 0

      \[\leadsto \mathsf{fma}\left(\ell \cdot \left(2 + \frac{1}{3} \cdot {\ell}^{2}\right), J, U\right) \]
   7. 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. pow2 N/A

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

      7. lift-*.f64 84.1

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

   8. Applied rewrites 84.1%

      \[\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. Final simplification 75.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\cos \left(\frac{K}{2}\right) \leq -0.01:\\ \;\;\;\;\mathsf{fma}\left(\left(\ell \cdot J\right) \cdot \mathsf{fma}\left(K \cdot K, -0.125, 1\right), 2, U\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\ell \cdot \ell, 0.3333333333333333, 2\right) \cdot \ell, J, U\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 14: 72.7% accurate, 2.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\cos \left(\frac{K}{2}\right) \leq -0.01:\\ \;\;\;\;\left(\left(J \cdot \ell\right) \cdot \mathsf{fma}\left(K \cdot K, -0.125, 1\right)\right) \cdot 2\\ \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
 (if (<= (cos (/ K 2.0)) -0.01)
   (* (* (* J l) (fma (* K K) -0.125 1.0)) 2.0)
   (fma (* (fma (* l l) 0.3333333333333333 2.0) l) J U)))

C

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

Julia

function code(J, l, K, U)
	tmp = 0.0
	if (cos(Float64(K / 2.0)) <= -0.01)
		tmp = Float64(Float64(Float64(J * l) * fma(Float64(K * K), -0.125, 1.0)) * 2.0);
	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_] := If[LessEqual[N[Cos[N[(K / 2.0), $MachinePrecision]], $MachinePrecision], -0.01], N[(N[(N[(J * l), $MachinePrecision] * N[(N[(K * K), $MachinePrecision] * -0.125 + 1.0), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision], N[(N[(N[(N[(l * l), $MachinePrecision] * 0.3333333333333333 + 2.0), $MachinePrecision] * l), $MachinePrecision] * J + U), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 86.8%

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

   3. 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)} \]
   4. 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. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. associate-*r* N/A

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

      5. lower-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. lower-cos.f64 N/A

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

      9. lower-*.f64 63.8

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

   5. Applied rewrites 63.8%

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

   6. Taylor expanded in J around inf

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift-cos.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 28.9

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

   8. Applied rewrites 28.9%

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

   9. Taylor expanded in K around 0

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

       1. +-commutative N/A

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

       2. *-commutative N/A

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

       3. lower-fma.f64 N/A

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

       4. unpow2 N/A

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

       5. lower-*.f64 39.0

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

   11. Applied rewrites 39.0%

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

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

   1. Initial program 86.1%

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

   3. Taylor expanded in K around 0

      \[\leadsto \color{blue}{U + J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)} \]
   4. 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 95.6

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

   5. Applied rewrites 95.6%

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

   6. Taylor expanded in l around 0

      \[\leadsto \mathsf{fma}\left(\ell \cdot \left(2 + \frac{1}{3} \cdot {\ell}^{2}\right), J, U\right) \]
   7. 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. pow2 N/A

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

      7. lift-*.f64 84.1

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

   8. Applied rewrites 84.1%

      \[\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. Final simplification 72.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\cos \left(\frac{K}{2}\right) \leq -0.01:\\ \;\;\;\;\left(\left(J \cdot \ell\right) \cdot \mathsf{fma}\left(K \cdot K, -0.125, 1\right)\right) \cdot 2\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\ell \cdot \ell, 0.3333333333333333, 2\right) \cdot \ell, J, U\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 15: 71.9% accurate, 14.3× 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.3%

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

3. Taylor expanded in K around 0

   \[\leadsto \color{blue}{U + J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right)} \]
4. 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 80.4

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

5. Applied rewrites 80.4%

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

6. Taylor expanded in l around 0

   \[\leadsto \mathsf{fma}\left(\ell \cdot \left(2 + \frac{1}{3} \cdot {\ell}^{2}\right), J, U\right) \]
7. 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. pow2 N/A

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

   7. lift-*.f64 71.9

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

8. Applied rewrites 71.9%

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

9. Final simplification 71.9%

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

Alternative 16: 54.3% accurate, 33.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 86.3%

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

3. 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)} \]
4. 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. *-commutative N/A

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

   3. lower-fma.f64 N/A

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

   4. associate-*r* N/A

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

   5. lower-*.f64 N/A

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

   6. *-commutative N/A

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

   7. lower-*.f64 N/A

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

   8. lower-cos.f64 N/A

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

   9. lower-*.f64 64.4

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

5. Applied rewrites 64.4%

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

6. Taylor expanded in K around 0

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

   1. +-commutative N/A

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

   2. associate-*r* N/A

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

   3. lower-fma.f64 N/A

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

   4. *-commutative N/A

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

   5. lower-*.f64 54.3

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

8. Applied rewrites 54.3%

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

   1. lift-*.f64 N/A

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

   2. *-commutative N/A

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

   3. count-2-rev N/A

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

   4. lower-+.f64 54.3

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

10. Applied rewrites 54.3%

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

Alternative 17: 37.2% accurate, 330.0× 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.3%

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

3. Taylor expanded in J around 0

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

5. Applied rewrites 37.2%

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

Reproduce

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