Maksimov and Kolovsky, Equation (4)

Percentage Accurate: 86.3% → 99.9%

Time: 11.4s

Alternatives: 17

Speedup: 1.4×

• 50.8% 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.0× speedup

Math

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

FPCore

(FPCore (J l K U)
 :precision binary64
 (+ (* (* J (* (* (cosh l) 2.0) (tanh l))) (cos (/ K 2.0))) U))

C

double code(double J, double l, double K, double U) {
	return ((J * ((cosh(l) * 2.0) * tanh(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 * ((cosh(l) * 2.0d0) * tanh(l))) * cos((k / 2.0d0))) + u
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 87.2%

   \[\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 \left(J \cdot \color{blue}{\left(e^{\ell} - e^{-\ell}\right)}\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

   2. flip-- N/A

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

   3. difference-of-squares N/A

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

   4. lift--.f64 N/A

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

   5. associate-/l* N/A

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

   6. lower-*.f64 N/A

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

   7. lift-exp.f64 N/A

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

   8. lift-exp.f64 N/A

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

   9. lift-neg.f64 N/A

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

   10. cosh-undef N/A

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

   11. *-commutative N/A

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

   12. lower-*.f64 N/A

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

   13. lower-cosh.f64 N/A

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

   14. lift--.f64 N/A

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

   15. lift-exp.f64 N/A

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

   16. lift-exp.f64 N/A

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

   17. lift-neg.f64 N/A

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

4. Applied rewrites 100.0%

   \[\leadsto \left(J \cdot \color{blue}{\left(\left(\cosh \ell \cdot 2\right) \cdot \tanh \ell\right)}\right) \cdot \cos \left(\frac{K}{2}\right) + U \]
5. Add Preprocessing

Alternative 2: 96.8% 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.78:\\ \;\;\;\;\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(\sinh \ell \cdot 2, 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.78)
     (+
      (*
       (*
        J
        (*
         (fma
          (fma
           (fma 0.0003968253968253968 (* l l) 0.016666666666666666)
           (* l l)
           0.3333333333333333)
          (* l l)
          2.0)
         l))
       t_0)
      U)
     (fma (* (sinh l) 2.0) 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.78) {
		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((sinh(l) * 2.0), 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.78)
		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(sinh(l) * 2.0), 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.78], 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[(N[Sinh[l], $MachinePrecision] * 2.0), $MachinePrecision] * J + U), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 83.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 \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 \color{blue}{\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 \ell\right)}\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

      2. lower-*.f64 N/A

         \[\leadsto \left(J \cdot \color{blue}{\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 \ell\right)}\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

      3. +-commutative N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

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

      9. +-commutative N/A

         \[\leadsto \left(J \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\frac{1}{2520} \cdot {\ell}^{2} + \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 \]

      10. lower-fma.f64 N/A

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

      11. unpow2 N/A

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

      12. lower-*.f64 N/A

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

      13. 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), \color{blue}{\ell \cdot \ell}, \frac{1}{3}\right), {\ell}^{2}, 2\right) \cdot \ell\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

      14. lower-*.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), \color{blue}{\ell \cdot \ell}, \frac{1}{3}\right), {\ell}^{2}, 2\right) \cdot \ell\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

      15. 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), \color{blue}{\ell \cdot \ell}, 2\right) \cdot \ell\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

      16. lower-*.f64 95.9

          \[\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), \color{blue}{\ell \cdot \ell}, 2\right) \cdot \ell\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

   5. Applied rewrites 95.9%

      \[\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.78000000000000003 < (cos.f64 (/.f64 K #s(literal 2 binary64)))

   1. Initial program 89.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 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 \color{blue}{J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) + U} \]

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-exp.f64 N/A

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

      7. lower-neg.f64 89.4

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

   5. Applied rewrites 89.4%

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

   7. Applied rewrites 98.6%

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

Alternative 3: 95.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.78:\\ \;\;\;\;\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(\sinh \ell \cdot 2, 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.78)
     (+
      (*
       (*
        J
        (*
         (fma
          (fma 0.016666666666666666 (* l l) 0.3333333333333333)
          (* l l)
          2.0)
         l))
       t_0)
      U)
     (fma (* (sinh l) 2.0) 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.78) {
		tmp = ((J * (fma(fma(0.016666666666666666, (l * l), 0.3333333333333333), (l * l), 2.0) * l)) * t_0) + U;
	} else {
		tmp = fma((sinh(l) * 2.0), 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.78)
		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(sinh(l) * 2.0), 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.78], 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[(N[Sinh[l], $MachinePrecision] * 2.0), $MachinePrecision] * J + U), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 83.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 \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 \color{blue}{\left(\left(2 + {\ell}^{2} \cdot \left(\frac{1}{3} + \frac{1}{60} \cdot {\ell}^{2}\right)\right) \cdot \ell\right)}\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(J \cdot \left(\color{blue}{\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(\color{blue}{\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(\color{blue}{\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(\color{blue}{\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(\color{blue}{\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}, \color{blue}{\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}, \color{blue}{\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), \color{blue}{\ell \cdot \ell}, 2\right) \cdot \ell\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

      11. lower-*.f64 94.0

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

   5. Applied rewrites 94.0%

      \[\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.78000000000000003 < (cos.f64 (/.f64 K #s(literal 2 binary64)))

   1. Initial program 89.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 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 \color{blue}{J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) + U} \]

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-exp.f64 N/A

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

      7. lower-neg.f64 89.4

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

   5. Applied rewrites 89.4%

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

   7. Applied rewrites 98.6%

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

Alternative 4: 94.2% 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.78:\\ \;\;\;\;\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(\sinh \ell \cdot 2, 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.78)
     (+ (* (* J (* (fma (* l l) 0.3333333333333333 2.0) l)) t_0) U)
     (fma (* (sinh l) 2.0) 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.78) {
		tmp = ((J * (fma((l * l), 0.3333333333333333, 2.0) * l)) * t_0) + U;
	} else {
		tmp = fma((sinh(l) * 2.0), 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.78)
		tmp = Float64(Float64(Float64(J * Float64(fma(Float64(l * l), 0.3333333333333333, 2.0) * l)) * t_0) + U);
	else
		tmp = fma(Float64(sinh(l) * 2.0), 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.78], 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[(N[Sinh[l], $MachinePrecision] * 2.0), $MachinePrecision] * J + U), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 83.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 \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 \color{blue}{\left(\left(2 + \frac{1}{3} \cdot {\ell}^{2}\right) \cdot \ell\right)}\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(J \cdot \left(\color{blue}{\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(\color{blue}{{\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(\color{blue}{\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(\color{blue}{\ell \cdot \ell}, \frac{1}{3}, 2\right) \cdot \ell\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

      7. lower-*.f64 92.1

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

   5. Applied rewrites 92.1%

      \[\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.78000000000000003 < (cos.f64 (/.f64 K #s(literal 2 binary64)))

   1. Initial program 89.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 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 \color{blue}{J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) + U} \]

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-exp.f64 N/A

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

      7. lower-neg.f64 89.4

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

   5. Applied rewrites 89.4%

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

   7. Applied rewrites 98.6%

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

Alternative 5: 93.3% 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.52:\\ \;\;\;\;\left(\left(J \cdot \mathsf{fma}\left(\ell \cdot \ell, 0.3333333333333333, 2\right)\right) \cdot \ell\right) \cdot t\_0 + U\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\sinh \ell \cdot 2, 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.52)
     (+ (* (* (* J (fma (* l l) 0.3333333333333333 2.0)) l) t_0) U)
     (fma (* (sinh l) 2.0) 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.52) {
		tmp = (((J * fma((l * l), 0.3333333333333333, 2.0)) * l) * t_0) + U;
	} else {
		tmp = fma((sinh(l) * 2.0), 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.52)
		tmp = Float64(Float64(Float64(Float64(J * fma(Float64(l * l), 0.3333333333333333, 2.0)) * l) * t_0) + U);
	else
		tmp = fma(Float64(sinh(l) * 2.0), 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.52], N[(N[(N[(N[(J * N[(N[(l * l), $MachinePrecision] * 0.3333333333333333 + 2.0), $MachinePrecision]), $MachinePrecision] * l), $MachinePrecision] * t$95$0), $MachinePrecision] + U), $MachinePrecision], N[(N[(N[Sinh[l], $MachinePrecision] * 2.0), $MachinePrecision] * J + U), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 84.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}{\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 \color{blue}{\left(\left(\frac{1}{3} \cdot \left(J \cdot {\ell}^{2}\right) + 2 \cdot J\right) \cdot \ell\right)} \cdot \cos \left(\frac{K}{2}\right) + U \]

      2. lower-*.f64 N/A

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

      3. associate-*r* N/A

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

      4. *-commutative N/A

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

      5. *-commutative N/A

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

      6. *-commutative N/A

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

      7. associate-*l* N/A

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

      8. *-commutative N/A

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

      9. distribute-lft-out N/A

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

      10. +-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. +-commutative N/A

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

      13. *-commutative N/A

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

      14. lower-fma.f64 N/A

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

      15. unpow2 N/A

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

      16. lower-*.f64 92.1

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

   5. Applied rewrites 92.1%

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

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

   1. Initial program 88.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 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 \color{blue}{J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) + U} \]

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-exp.f64 N/A

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

      7. lower-neg.f64 88.8

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

   5. Applied rewrites 88.8%

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

   7. Applied rewrites 97.6%

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

Alternative 6: 93.3% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 84.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 + \ell \cdot \left(\frac{1}{3} \cdot \left(J \cdot \left({\ell}^{2} \cdot \cos \left(\frac{1}{2} \cdot K\right)\right)\right) + 2 \cdot \left(J \cdot \cos \left(\frac{1}{2} \cdot K\right)\right)\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

   5. Applied rewrites 92.1%

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

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

   1. Initial program 88.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 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 \color{blue}{J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) + U} \]

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-exp.f64 N/A

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

      7. lower-neg.f64 88.8

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

   5. Applied rewrites 88.8%

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

   7. Applied rewrites 97.6%

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

Alternative 7: 87.9% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 86.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 \color{blue}{2 \cdot \left(J \cdot \left(\ell \cdot \cos \left(\frac{1}{2} \cdot K\right)\right)\right) + U} \]

      2. *-commutative N/A

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

      3. associate-*r* N/A

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

      4. associate-*l* N/A

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

      5. *-commutative N/A

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

      6. associate-*r* N/A

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

      7. associate-*r* N/A

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

      8. lower-fma.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. lower-*.f64 N/A

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

      12. cos-neg-rev N/A

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

      13. lower-cos.f64 N/A

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

      14. distribute-lft-neg-in N/A

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

      15. lower-*.f64 N/A

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

      16. metadata-eval 66.6

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

   5. Applied rewrites 66.6%

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

   7. Applied rewrites 66.6%

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

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

   1. Initial program 87.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 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 \color{blue}{J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) + U} \]

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-exp.f64 N/A

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

      7. lower-neg.f64 87.4

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

   5. Applied rewrites 87.4%

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

   7. Applied rewrites 95.4%

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

Alternative 8: 87.5% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 86.6%

      \[\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 \color{blue}{\left(\left(2 + {\ell}^{2} \cdot \left(\frac{1}{3} + \frac{1}{60} \cdot {\ell}^{2}\right)\right) \cdot \ell\right)}\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(J \cdot \left(\color{blue}{\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(\color{blue}{\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(\color{blue}{\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(\color{blue}{\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(\color{blue}{\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}, \color{blue}{\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}, \color{blue}{\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), \color{blue}{\ell \cdot \ell}, 2\right) \cdot \ell\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

      11. lower-*.f64 94.7

          \[\leadsto \left(J \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(0.016666666666666666, \ell \cdot \ell, 0.3333333333333333\right), \color{blue}{\ell \cdot \ell}, 2\right) \cdot \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(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 \]

   6. Taylor expanded in K around 0

      \[\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 \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(\frac{1}{60}, \ell \cdot \ell, \frac{1}{3}\right), \ell \cdot \ell, 2\right) \cdot \ell\right)\right) \cdot \color{blue}{\left(\frac{-1}{8} \cdot {K}^{2} + 1\right)} + U \]

      2. *-commutative 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 \left(\color{blue}{{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(\frac{1}{60}, \ell \cdot \ell, \frac{1}{3}\right), \ell \cdot \ell, 2\right) \cdot \ell\right)\right) \cdot \color{blue}{\mathsf{fma}\left({K}^{2}, \frac{-1}{8}, 1\right)} + U \]

      4. 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 \mathsf{fma}\left(\color{blue}{K \cdot K}, \frac{-1}{8}, 1\right) + U \]

      5. lower-*.f64 56.7

         \[\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 \mathsf{fma}\left(\color{blue}{K \cdot K}, -0.125, 1\right) + U \]

   8. Applied rewrites 56.7%

      \[\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 \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(\frac{1}{60}, \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(\frac{1}{60}, \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. lift-*.f64 N/A

         \[\leadsto \color{blue}{\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 \mathsf{fma}\left(K \cdot K, \frac{-1}{8}, 1\right) + U \]

      4. associate-*l* N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(\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) \cdot \mathsf{fma}\left(K \cdot K, \frac{-1}{8}, 1\right), J, U\right)} \]

   10. Applied rewrites 58.5%

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

   11. Taylor expanded in l around inf

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

   13. Applied rewrites 58.5%

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

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

   1. Initial program 87.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 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 \color{blue}{J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) + U} \]

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-exp.f64 N/A

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

      7. lower-neg.f64 87.1

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

   5. Applied rewrites 87.1%

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

   7. Applied rewrites 95.0%

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

Alternative 9: 99.9% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 87.2%

   \[\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. associate-*l* N/A

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

   5. *-commutative N/A

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

   6. lower-fma.f64 N/A

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

4. Applied rewrites 100.0%

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

Alternative 10: 83.4% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\cos \left(\frac{K}{2}\right) \leq -0.04:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(-0.125, K \cdot K, 1\right) \cdot \left(\mathsf{fma}\left(0.016666666666666666 \cdot \left(\ell \cdot \ell\right), \ell \cdot \ell, 2\right) \cdot \ell\right), J, U\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\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, J, U\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (J l K U)
 :precision binary64
 (if (<= (cos (/ K 2.0)) -0.04)
   (fma
    (*
     (fma -0.125 (* K K) 1.0)
     (* (fma (* 0.016666666666666666 (* l l)) (* l l) 2.0) l))
    J
    U)
   (fma
    (*
     (fma
      (fma
       (fma 0.0003968253968253968 (* l l) 0.016666666666666666)
       (* l l)
       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.04) {
		tmp = fma((fma(-0.125, (K * K), 1.0) * (fma((0.016666666666666666 * (l * l)), (l * l), 2.0) * l)), J, U);
	} else {
		tmp = fma((fma(fma(fma(0.0003968253968253968, (l * l), 0.016666666666666666), (l * l), 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.04)
		tmp = fma(Float64(fma(-0.125, Float64(K * K), 1.0) * Float64(fma(Float64(0.016666666666666666 * Float64(l * l)), Float64(l * l), 2.0) * l)), J, U);
	else
		tmp = fma(Float64(fma(fma(fma(0.0003968253968253968, Float64(l * l), 0.016666666666666666), Float64(l * l), 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.04], N[(N[(N[(-0.125 * N[(K * K), $MachinePrecision] + 1.0), $MachinePrecision] * N[(N[(N[(0.016666666666666666 * N[(l * l), $MachinePrecision]), $MachinePrecision] * N[(l * l), $MachinePrecision] + 2.0), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * J + U), $MachinePrecision], 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 + U), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 86.6%

      \[\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 \color{blue}{\left(\left(2 + {\ell}^{2} \cdot \left(\frac{1}{3} + \frac{1}{60} \cdot {\ell}^{2}\right)\right) \cdot \ell\right)}\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(J \cdot \left(\color{blue}{\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(\color{blue}{\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(\color{blue}{\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(\color{blue}{\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(\color{blue}{\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}, \color{blue}{\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}, \color{blue}{\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), \color{blue}{\ell \cdot \ell}, 2\right) \cdot \ell\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

      11. lower-*.f64 94.7

          \[\leadsto \left(J \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(0.016666666666666666, \ell \cdot \ell, 0.3333333333333333\right), \color{blue}{\ell \cdot \ell}, 2\right) \cdot \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(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 \]

   6. Taylor expanded in K around 0

      \[\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 \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(\frac{1}{60}, \ell \cdot \ell, \frac{1}{3}\right), \ell \cdot \ell, 2\right) \cdot \ell\right)\right) \cdot \color{blue}{\left(\frac{-1}{8} \cdot {K}^{2} + 1\right)} + U \]

      2. *-commutative 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 \left(\color{blue}{{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(\frac{1}{60}, \ell \cdot \ell, \frac{1}{3}\right), \ell \cdot \ell, 2\right) \cdot \ell\right)\right) \cdot \color{blue}{\mathsf{fma}\left({K}^{2}, \frac{-1}{8}, 1\right)} + U \]

      4. 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 \mathsf{fma}\left(\color{blue}{K \cdot K}, \frac{-1}{8}, 1\right) + U \]

      5. lower-*.f64 56.7

         \[\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 \mathsf{fma}\left(\color{blue}{K \cdot K}, -0.125, 1\right) + U \]

   8. Applied rewrites 56.7%

      \[\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 \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(\frac{1}{60}, \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(\frac{1}{60}, \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. lift-*.f64 N/A

         \[\leadsto \color{blue}{\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 \mathsf{fma}\left(K \cdot K, \frac{-1}{8}, 1\right) + U \]

      4. associate-*l* N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(\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) \cdot \mathsf{fma}\left(K \cdot K, \frac{-1}{8}, 1\right), J, U\right)} \]

   10. Applied rewrites 58.5%

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

   11. Taylor expanded in l around inf

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

   13. Applied rewrites 58.5%

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

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

   1. Initial program 87.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 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 \color{blue}{J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) + U} \]

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-exp.f64 N/A

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

      7. lower-neg.f64 87.1

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

   5. Applied rewrites 87.1%

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

   7. Applied rewrites 95.0%

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

   8. Taylor expanded in l around 0

      \[\leadsto \mathsf{fma}\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), J, U\right) \]
   9. Step-by-step derivation

   10. Applied rewrites 89.4%

       \[\leadsto \mathsf{fma}\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, J, U\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 11: 83.1% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\cos \left(\frac{K}{2}\right) \leq -0.04:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(-0.125, K \cdot K, 1\right) \cdot \left(\mathsf{fma}\left(0.3333333333333333, \ell \cdot \ell, 2\right) \cdot \ell\right), J, U\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\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, J, U\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (J l K U)
 :precision binary64
 (if (<= (cos (/ K 2.0)) -0.04)
   (fma
    (* (fma -0.125 (* K K) 1.0) (* (fma 0.3333333333333333 (* l l) 2.0) l))
    J
    U)
   (fma
    (*
     (fma
      (fma
       (fma 0.0003968253968253968 (* l l) 0.016666666666666666)
       (* l l)
       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.04) {
		tmp = fma((fma(-0.125, (K * K), 1.0) * (fma(0.3333333333333333, (l * l), 2.0) * l)), J, U);
	} else {
		tmp = fma((fma(fma(fma(0.0003968253968253968, (l * l), 0.016666666666666666), (l * l), 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.04)
		tmp = fma(Float64(fma(-0.125, Float64(K * K), 1.0) * Float64(fma(0.3333333333333333, Float64(l * l), 2.0) * l)), J, U);
	else
		tmp = fma(Float64(fma(fma(fma(0.0003968253968253968, Float64(l * l), 0.016666666666666666), Float64(l * l), 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.04], N[(N[(N[(-0.125 * N[(K * K), $MachinePrecision] + 1.0), $MachinePrecision] * N[(N[(0.3333333333333333 * N[(l * l), $MachinePrecision] + 2.0), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * J + U), $MachinePrecision], 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 + U), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 86.6%

      \[\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 \color{blue}{\left(\left(2 + {\ell}^{2} \cdot \left(\frac{1}{3} + \frac{1}{60} \cdot {\ell}^{2}\right)\right) \cdot \ell\right)}\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(J \cdot \left(\color{blue}{\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(\color{blue}{\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(\color{blue}{\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(\color{blue}{\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(\color{blue}{\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}, \color{blue}{\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}, \color{blue}{\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), \color{blue}{\ell \cdot \ell}, 2\right) \cdot \ell\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

      11. lower-*.f64 94.7

          \[\leadsto \left(J \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(0.016666666666666666, \ell \cdot \ell, 0.3333333333333333\right), \color{blue}{\ell \cdot \ell}, 2\right) \cdot \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(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 \]

   6. Taylor expanded in K around 0

      \[\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 \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(\frac{1}{60}, \ell \cdot \ell, \frac{1}{3}\right), \ell \cdot \ell, 2\right) \cdot \ell\right)\right) \cdot \color{blue}{\left(\frac{-1}{8} \cdot {K}^{2} + 1\right)} + U \]

      2. *-commutative 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 \left(\color{blue}{{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(\frac{1}{60}, \ell \cdot \ell, \frac{1}{3}\right), \ell \cdot \ell, 2\right) \cdot \ell\right)\right) \cdot \color{blue}{\mathsf{fma}\left({K}^{2}, \frac{-1}{8}, 1\right)} + U \]

      4. 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 \mathsf{fma}\left(\color{blue}{K \cdot K}, \frac{-1}{8}, 1\right) + U \]

      5. lower-*.f64 56.7

         \[\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 \mathsf{fma}\left(\color{blue}{K \cdot K}, -0.125, 1\right) + U \]

   8. Applied rewrites 56.7%

      \[\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 \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(\frac{1}{60}, \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(\frac{1}{60}, \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. lift-*.f64 N/A

         \[\leadsto \color{blue}{\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 \mathsf{fma}\left(K \cdot K, \frac{-1}{8}, 1\right) + U \]

      4. associate-*l* N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(\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) \cdot \mathsf{fma}\left(K \cdot K, \frac{-1}{8}, 1\right), J, U\right)} \]

   10. Applied rewrites 58.5%

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

   11. Taylor expanded in l around 0

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

   13. Applied rewrites 56.7%

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

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

   1. Initial program 87.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 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 \color{blue}{J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) + U} \]

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-exp.f64 N/A

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

      7. lower-neg.f64 87.1

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

   5. Applied rewrites 87.1%

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

   7. Applied rewrites 95.0%

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

   8. Taylor expanded in l around 0

      \[\leadsto \mathsf{fma}\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), J, U\right) \]
   9. Step-by-step derivation

   10. Applied rewrites 89.4%

       \[\leadsto \mathsf{fma}\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, J, U\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 12: 81.6% accurate, 2.1× speedup

Math

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

   1. Initial program 86.6%

      \[\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 \color{blue}{\left(\left(2 + {\ell}^{2} \cdot \left(\frac{1}{3} + \frac{1}{60} \cdot {\ell}^{2}\right)\right) \cdot \ell\right)}\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(J \cdot \left(\color{blue}{\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(\color{blue}{\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(\color{blue}{\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(\color{blue}{\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(\color{blue}{\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}, \color{blue}{\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}, \color{blue}{\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), \color{blue}{\ell \cdot \ell}, 2\right) \cdot \ell\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

      11. lower-*.f64 94.7

          \[\leadsto \left(J \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(0.016666666666666666, \ell \cdot \ell, 0.3333333333333333\right), \color{blue}{\ell \cdot \ell}, 2\right) \cdot \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(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 \]

   6. Taylor expanded in K around 0

      \[\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 \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(\frac{1}{60}, \ell \cdot \ell, \frac{1}{3}\right), \ell \cdot \ell, 2\right) \cdot \ell\right)\right) \cdot \color{blue}{\left(\frac{-1}{8} \cdot {K}^{2} + 1\right)} + U \]

      2. *-commutative 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 \left(\color{blue}{{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(\frac{1}{60}, \ell \cdot \ell, \frac{1}{3}\right), \ell \cdot \ell, 2\right) \cdot \ell\right)\right) \cdot \color{blue}{\mathsf{fma}\left({K}^{2}, \frac{-1}{8}, 1\right)} + U \]

      4. 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 \mathsf{fma}\left(\color{blue}{K \cdot K}, \frac{-1}{8}, 1\right) + U \]

      5. lower-*.f64 56.7

         \[\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 \mathsf{fma}\left(\color{blue}{K \cdot K}, -0.125, 1\right) + U \]

   8. Applied rewrites 56.7%

      \[\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 \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(\frac{1}{60}, \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(\frac{1}{60}, \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. lift-*.f64 N/A

         \[\leadsto \color{blue}{\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 \mathsf{fma}\left(K \cdot K, \frac{-1}{8}, 1\right) + U \]

      4. associate-*l* N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(\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) \cdot \mathsf{fma}\left(K \cdot K, \frac{-1}{8}, 1\right), J, U\right)} \]

   10. Applied rewrites 58.5%

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

   11. Taylor expanded in l around 0

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

   13. Applied rewrites 56.7%

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

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

   1. Initial program 87.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 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 \color{blue}{J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) + U} \]

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-exp.f64 N/A

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

      7. lower-neg.f64 87.1

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

   5. Applied rewrites 87.1%

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

   7. Applied rewrites 95.0%

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

   8. 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) \]
   9. Step-by-step derivation

   10. Applied rewrites 86.9%

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

Alternative 13: 80.3% accurate, 2.2× speedup

Math

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

   1. Initial program 87.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 \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 \color{blue}{2 \cdot \left(J \cdot \left(\ell \cdot \cos \left(\frac{1}{2} \cdot K\right)\right)\right) + U} \]

      2. *-commutative N/A

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

      3. associate-*r* N/A

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

      4. associate-*l* N/A

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

      5. *-commutative N/A

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

      6. associate-*r* N/A

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

      7. associate-*r* N/A

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

      8. lower-fma.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. lower-*.f64 N/A

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

      12. cos-neg-rev N/A

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

      13. lower-cos.f64 N/A

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

      14. distribute-lft-neg-in N/A

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

      15. lower-*.f64 N/A

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

      16. metadata-eval 64.7

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

   5. Applied rewrites 64.7%

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

   7. Applied rewrites 64.7%

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

   8. Taylor expanded in K around 0

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

   10. Applied rewrites 53.6%

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

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

   1. Initial program 87.2%

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-exp.f64 N/A

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

      7. lower-neg.f64 86.4

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

   5. Applied rewrites 86.4%

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

   7. Applied rewrites 94.2%

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

   8. 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) \]
   9. Step-by-step derivation

   10. Applied rewrites 86.1%

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

Alternative 14: 74.8% accurate, 2.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 87.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 \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 \color{blue}{2 \cdot \left(J \cdot \left(\ell \cdot \cos \left(\frac{1}{2} \cdot K\right)\right)\right) + U} \]

      2. *-commutative N/A

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

      3. associate-*r* N/A

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

      4. associate-*l* N/A

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

      5. *-commutative N/A

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

      6. associate-*r* N/A

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

      7. associate-*r* N/A

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

      8. lower-fma.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. lower-*.f64 N/A

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

      12. cos-neg-rev N/A

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

      13. lower-cos.f64 N/A

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

      14. distribute-lft-neg-in N/A

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

      15. lower-*.f64 N/A

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

      16. metadata-eval 64.7

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

   5. Applied rewrites 64.7%

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

   7. Applied rewrites 64.7%

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

   8. Taylor expanded in K around 0

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

   10. Applied rewrites 53.6%

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

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

   1. Initial program 87.2%

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-exp.f64 N/A

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

      7. lower-neg.f64 86.4

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

   5. Applied rewrites 86.4%

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

   6. Taylor expanded in l around 0

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

   8. Applied rewrites 78.7%

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

Alternative 15: 70.6% accurate, 9.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\ell \leq -2.7 \cdot 10^{+66} \lor \neg \left(\ell \leq 1.45 \cdot 10^{+39}\right):\\ \;\;\;\;\left(\mathsf{fma}\left(\ell \cdot \ell, 0.3333333333333333, 2\right) \cdot \ell\right) \cdot J\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\ell + \ell, J, U\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (J l K U)
 :precision binary64
 (if (or (<= l -2.7e+66) (not (<= l 1.45e+39)))
   (* (* (fma (* l l) 0.3333333333333333 2.0) l) J)
   (fma (+ l l) J U)))

C

double code(double J, double l, double K, double U) {
	double tmp;
	if ((l <= -2.7e+66) || !(l <= 1.45e+39)) {
		tmp = (fma((l * l), 0.3333333333333333, 2.0) * l) * J;
	} else {
		tmp = fma((l + l), J, U);
	}
	return tmp;
}

Julia

function code(J, l, K, U)
	tmp = 0.0
	if ((l <= -2.7e+66) || !(l <= 1.45e+39))
		tmp = Float64(Float64(fma(Float64(l * l), 0.3333333333333333, 2.0) * l) * J);
	else
		tmp = fma(Float64(l + l), J, U);
	end
	return tmp
end

Wolfram

code[J_, l_, K_, U_] := If[Or[LessEqual[l, -2.7e+66], N[Not[LessEqual[l, 1.45e+39]], $MachinePrecision]], N[(N[(N[(N[(l * l), $MachinePrecision] * 0.3333333333333333 + 2.0), $MachinePrecision] * l), $MachinePrecision] * J), $MachinePrecision], N[(N[(l + l), $MachinePrecision] * J + U), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if l < -2.7e66 or 1.45000000000000015e39 < 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 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 \color{blue}{J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) + U} \]

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-exp.f64 N/A

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

      7. lower-neg.f64 80.0

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

   5. Applied rewrites 80.0%

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

   6. Taylor expanded in l around 0

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

   8. Applied rewrites 25.6%

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

   9. Taylor expanded in l around 0

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

   11. Applied rewrites 64.5%

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

   12. Taylor expanded in J around inf

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

   14. Applied rewrites 69.7%

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

   if -2.7e66 < l < 1.45000000000000015e39

   1. Initial program 77.6%

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-exp.f64 N/A

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

      7. lower-neg.f64 71.9

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

   5. Applied rewrites 71.9%

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

   6. Taylor expanded in l around 0

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

   8. Applied rewrites 72.8%

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

   10. Applied rewrites 72.8%

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

4. Final simplification 71.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\ell \leq -2.7 \cdot 10^{+66} \lor \neg \left(\ell \leq 1.45 \cdot 10^{+39}\right):\\ \;\;\;\;\left(\mathsf{fma}\left(\ell \cdot \ell, 0.3333333333333333, 2\right) \cdot \ell\right) \cdot J\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\ell + \ell, J, U\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 16: 70.2% accurate, 11.4× speedup

Math

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

FPCore

(FPCore (J l K U)
 :precision binary64
 (let* ((t_0 (fma (* l l) 0.3333333333333333 2.0)))
   (if (<= l -1.6e+50) (* (* t_0 l) J) (fma (* t_0 J) l U))))

C

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

Julia

function code(J, l, K, U)
	t_0 = fma(Float64(l * l), 0.3333333333333333, 2.0)
	tmp = 0.0
	if (l <= -1.6e+50)
		tmp = Float64(Float64(t_0 * l) * J);
	else
		tmp = fma(Float64(t_0 * J), l, U);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if l < -1.59999999999999991e50

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-exp.f64 N/A

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

      7. lower-neg.f64 84.3

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

   5. Applied rewrites 84.3%

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

   6. Taylor expanded in l around 0

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

   8. Applied rewrites 26.2%

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

   9. Taylor expanded in l around 0

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

   11. Applied rewrites 64.0%

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

   12. Taylor expanded in J around inf

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

   14. Applied rewrites 75.0%

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

   if -1.59999999999999991e50 < l

   1. Initial program 84.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 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 \color{blue}{J \cdot \left(e^{\ell} - e^{\mathsf{neg}\left(\ell\right)}\right) + U} \]

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-exp.f64 N/A

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

      7. lower-neg.f64 73.2

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

   5. Applied rewrites 73.2%

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

   6. Taylor expanded in l around 0

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

   8. Applied rewrites 70.5%

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

Alternative 17: 53.0% accurate, 33.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 87.2%

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

   2. *-commutative N/A

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

   3. lower-fma.f64 N/A

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

   4. lower--.f64 N/A

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

   5. lower-exp.f64 N/A

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

   6. lower-exp.f64 N/A

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

   7. lower-neg.f64 75.4

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

5. Applied rewrites 75.4%

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

6. Taylor expanded in l around 0

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

8. Applied rewrites 52.5%

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

10. Applied rewrites 52.5%

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

Reproduce

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