Maksimov and Kolovsky, Equation (4)

Percentage Accurate: 86.4% → 100.0%

Time: 5.8s

Alternatives: 18

Speedup: 1.2×

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

Specification

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(j, l, k, u)
use fmin_fmax_functions
    real(8), intent (in) :: j
    real(8), intent (in) :: l
    real(8), intent (in) :: k
    real(8), intent (in) :: u
    code = ((j * (exp(l) - exp(-l))) * cos((k / 2.0d0))) + u
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 86.4% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(j, l, k, u)
use fmin_fmax_functions
    real(8), intent (in) :: j
    real(8), intent (in) :: l
    real(8), intent (in) :: k
    real(8), intent (in) :: u
    code = ((j * (exp(l) - exp(-l))) * cos((k / 2.0d0))) + u
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 86.4%

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

2. Taylor expanded in J around 0

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

   1. +-commutative N/A

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

   2. associate-*r* N/A

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

   3. lower-fma.f64 N/A

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

   4. *-commutative N/A

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

   5. lower-*.f64 N/A

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

   6. lower-cos.f64 N/A

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

   7. lower-*.f64 N/A

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

   8. sinh-undef N/A

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

   9. lower-*.f64 N/A

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

   10. lower-sinh.f64 100.0

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

4. Applied rewrites 100.0%

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

Alternative 2: 94.1% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 86.8%

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

   2. Taylor expanded in l around 0

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

      1. +-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-fma.f64 N/A

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

      4. count-2-rev N/A

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

      5. lower-+.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. lower-cos.f64 N/A

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

      9. lower-*.f64 64.5

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

   4. Applied rewrites 64.5%

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

   5. Taylor expanded in U around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. associate-/l* N/A

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

      7. lower-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-/.f64 N/A

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

      10. lift-cos.f64 N/A

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

      11. lift-*.f64 N/A

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

      12. lift-*.f64 73.5

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

   7. Applied rewrites 73.5%

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

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

   1. Initial program 87.1%

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

   2. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 68.7

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

   4. Applied rewrites 68.7%

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

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

   1. Initial program 86.2%

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

   2. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. sinh-undef N/A

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

      5. lower-*.f64 N/A

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

      6. lower-sinh.f64 95.8

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

   4. Applied rewrites 95.8%

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

Alternative 3: 94.1% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 86.8%

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

   2. Taylor expanded in l around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 88.3

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

   4. Applied rewrites 88.3%

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

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

   1. Initial program 86.2%

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

   2. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. sinh-undef N/A

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

      5. lower-*.f64 N/A

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

      6. lower-sinh.f64 96.1

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

   4. Applied rewrites 96.1%

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

Alternative 4: 89.8% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 86.8%

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

   2. Taylor expanded in J around 0

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

      1. +-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-fma.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-cos.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. sinh-undef N/A

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

      9. lower-*.f64 N/A

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

      10. lower-sinh.f64 99.9

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

   4. Applied rewrites 99.9%

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

   5. Taylor expanded in l around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 88.3

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

   7. Applied rewrites 88.3%

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

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

   1. Initial program 86.2%

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

   2. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. sinh-undef N/A

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

      5. lower-*.f64 N/A

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

      6. lower-sinh.f64 96.1

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

   4. Applied rewrites 96.1%

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

Alternative 5: 88.9% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 86.8%

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

   2. Taylor expanded in l around 0

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

      1. +-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-fma.f64 N/A

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

      4. count-2-rev N/A

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

      5. lower-+.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. lower-cos.f64 N/A

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

      9. lower-*.f64 64.5

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

   4. Applied rewrites 64.5%

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

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

   1. Initial program 87.1%

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

   2. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 68.7

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

   4. Applied rewrites 68.7%

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

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

   1. Initial program 86.2%

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

   2. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. sinh-undef N/A

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

      5. lower-*.f64 N/A

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

      6. lower-sinh.f64 95.8

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

   4. Applied rewrites 95.8%

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

Alternative 6: 88.6% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 86.9%

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

   2. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 67.6

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

   4. Applied rewrites 67.6%

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

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

   1. Initial program 86.2%

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

   2. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. sinh-undef N/A

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

      5. lower-*.f64 N/A

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

      6. lower-sinh.f64 95.8

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

   4. Applied rewrites 95.8%

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

Alternative 7: 87.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 86.9%

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

   2. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 67.6

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

   4. Applied rewrites 67.6%

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

   5. Taylor expanded in l around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. unpow2 N/A

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

      8. lower-*.f64 N/A

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

      9. count-2-rev N/A

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

      10. lift-+.f64 60.2

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

   7. Applied rewrites 60.2%

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

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

   1. Initial program 86.2%

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

   2. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. sinh-undef N/A

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

      5. lower-*.f64 N/A

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

      6. lower-sinh.f64 95.8

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

   4. Applied rewrites 95.8%

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

Alternative 8: 87.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 86.9%

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

   2. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 67.6

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

   4. Applied rewrites 67.6%

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

   5. Taylor expanded in l around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. unpow2 N/A

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

      8. lower-*.f64 N/A

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

      9. count-2-rev N/A

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

      10. lift-+.f64 60.2

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

   7. Applied rewrites 60.2%

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

   8. Taylor expanded in l around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. pow3 N/A

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

      6. lift-*.f64 N/A

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

      7. lift-*.f64 63.5

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

   10. Applied rewrites 63.5%

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

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

   1. Initial program 86.2%

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

   2. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. sinh-undef N/A

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

      5. lower-*.f64 N/A

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

      6. lower-sinh.f64 95.8

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

   4. Applied rewrites 95.8%

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

Alternative 9: 86.2% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 86.9%

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

   2. Taylor expanded in l around 0

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

      1. +-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-fma.f64 N/A

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

      4. count-2-rev N/A

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

      5. lower-+.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. lower-cos.f64 N/A

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

      9. lower-*.f64 65.0

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

   4. Applied rewrites 65.0%

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

   5. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. pow2 N/A

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

      6. lift-*.f64 56.6

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

   7. Applied rewrites 56.6%

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

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

   1. Initial program 86.2%

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

   2. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. sinh-undef N/A

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

      5. lower-*.f64 N/A

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

      6. lower-sinh.f64 95.8

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

   4. Applied rewrites 95.8%

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

Alternative 10: 78.8% accurate, 2.6× speedup

Math

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

FPCore

(FPCore (J l K U)
 :precision binary64
 (let* ((t_0 (* 2.0 (* (sinh l) J))))
   (if (<= l -1.45e+41)
     t_0
     (if (<= l 0.235)
       (fma (* (fma l (* l 0.3333333333333333) 2.0) J) l U)
       t_0))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if l < -1.44999999999999994e41 or 0.23499999999999999 < l

   1. Initial program 100.0%

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

   2. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. sinh-undef N/A

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

      5. lower-*.f64 N/A

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

      6. lower-sinh.f64 74.6

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

   4. Applied rewrites 74.6%

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

   5. Taylor expanded in J around inf

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

      1. *-commutative N/A

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

      2. rec-exp N/A

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

      3. mul-1-neg N/A

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

      4. mul-1-neg N/A

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

      5. sinh-undef-rev N/A

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

      6. associate-*l* N/A

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

      7. lower-*.f64 N/A

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

      8. lower-*.f64 N/A

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

      9. lift-sinh.f64 74.3

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

   7. Applied rewrites 74.3%

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

   if -1.44999999999999994e41 < l < 0.23499999999999999

   1. Initial program 74.7%

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

   2. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. sinh-undef N/A

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

      5. lower-*.f64 N/A

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

      6. lower-sinh.f64 86.6

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

   4. Applied rewrites 86.6%

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

   5. 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)} \]
   6. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. unpow2 N/A

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

      9. lower-*.f64 N/A

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

      10. count-2-rev N/A

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

      11. lift-+.f64 82.6

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

   7. Applied rewrites 82.6%

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

   8. Taylor expanded in J around 0

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

      1. *-commutative N/A

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

      2. *-commutative N/A

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

      3. pow2 N/A

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

      4. +-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lift-fma.f64 N/A

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

      7. lift-*.f64 82.6

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

   10. Applied rewrites 82.6%

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

       1. lift-fma.f64 N/A

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

       2. lift-*.f64 N/A

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

       3. associate-*l* N/A

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

       4. lower-fma.f64 N/A

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

       5. lower-*.f64 82.6

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

   12. Applied rewrites 82.6%

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

Alternative 11: 76.7% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 86.9%

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

   2. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 67.6

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

   4. Applied rewrites 67.6%

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

   5. Taylor expanded in l around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. count-2-rev N/A

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

      4. lift-+.f64 53.7

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

   7. Applied rewrites 53.7%

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

   8. Taylor expanded in K around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. pow2 N/A

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

      4. lift-*.f64 53.7

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

   10. Applied rewrites 53.7%

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

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

   1. Initial program 86.2%

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

   2. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. sinh-undef N/A

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

      5. lower-*.f64 N/A

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

      6. lower-sinh.f64 95.8

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

   4. Applied rewrites 95.8%

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

   5. Taylor expanded in l around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 84.3

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

   7. Applied rewrites 84.3%

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

Alternative 12: 72.4% accurate, 4.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 86.4%

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

2. Taylor expanded in K around 0

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

   1. +-commutative N/A

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

   2. *-commutative N/A

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

   3. lower-fma.f64 N/A

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

   4. sinh-undef N/A

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

   5. lower-*.f64 N/A

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

   6. lower-sinh.f64 81.1

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

4. Applied rewrites 81.1%

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

5. Taylor expanded in l around 0

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. +-commutative N/A

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

   4. *-commutative N/A

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

   5. lower-fma.f64 N/A

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

   6. unpow2 N/A

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

   7. lower-*.f64 72.4

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

7. Applied rewrites 72.4%

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

Alternative 13: 71.6% accurate, 3.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(0.3333333333333333 \cdot J\right) \cdot \left(\left(\ell \cdot \ell\right) \cdot \ell\right)\\ \mathbf{if}\;\ell \leq -2.5 \cdot 10^{+96}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;\ell \leq 5.5 \cdot 10^{+57}:\\ \;\;\;\;\mathsf{fma}\left(J, \frac{\ell + \ell}{U}, 1\right) \cdot U\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (J l K U)
 :precision binary64
 (let* ((t_0 (* (* 0.3333333333333333 J) (* (* l l) l))))
   (if (<= l -2.5e+96)
     t_0
     (if (<= l 5.5e+57) (* (fma J (/ (+ l l) U) 1.0) U) t_0))))

C

double code(double J, double l, double K, double U) {
	double t_0 = (0.3333333333333333 * J) * ((l * l) * l);
	double tmp;
	if (l <= -2.5e+96) {
		tmp = t_0;
	} else if (l <= 5.5e+57) {
		tmp = fma(J, ((l + l) / U), 1.0) * U;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(J, l, K, U)
	t_0 = Float64(Float64(0.3333333333333333 * J) * Float64(Float64(l * l) * l))
	tmp = 0.0
	if (l <= -2.5e+96)
		tmp = t_0;
	elseif (l <= 5.5e+57)
		tmp = Float64(fma(J, Float64(Float64(l + l) / U), 1.0) * U);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[J_, l_, K_, U_] := Block[{t$95$0 = N[(N[(0.3333333333333333 * J), $MachinePrecision] * N[(N[(l * l), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, -2.5e+96], t$95$0, If[LessEqual[l, 5.5e+57], N[(N[(J * N[(N[(l + l), $MachinePrecision] / U), $MachinePrecision] + 1.0), $MachinePrecision] * U), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if l < -2.5000000000000002e96 or 5.5000000000000002e57 < l

   1. Initial program 100.0%

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

   2. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. sinh-undef N/A

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

      5. lower-*.f64 N/A

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

      6. lower-sinh.f64 74.8

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

   4. Applied rewrites 74.8%

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

   5. 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)} \]
   6. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. unpow2 N/A

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

      9. lower-*.f64 N/A

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

      10. count-2-rev N/A

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

      11. lift-+.f64 65.0

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

   7. Applied rewrites 65.0%

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

   8. Taylor expanded in l around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-fma.f64 N/A

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

      4. associate-*r/ N/A

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

      5. lower-/.f64 N/A

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

      6. count-2-rev N/A

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

      7. lift-+.f64 N/A

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

      8. pow2 N/A

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

      9. lift-*.f64 N/A

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

      10. unpow3 N/A

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

      11. pow2 N/A

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

      12. lower-*.f64 N/A

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

      13. pow2 N/A

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

      14. lift-*.f64 70.8

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

   10. Applied rewrites 70.8%

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

   11. Taylor expanded in l around inf

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

       1. lower-*.f64 70.8

          \[\leadsto \left(0.3333333333333333 \cdot J\right) \cdot \left(\left(\ell \cdot \ell\right) \cdot \ell\right) \]

   13. Applied rewrites 70.8%

       \[\leadsto \left(0.3333333333333333 \cdot J\right) \cdot \left(\left(\ell \cdot \ell\right) \cdot \ell\right) \]

   if -2.5000000000000002e96 < l < 5.5000000000000002e57

   1. Initial program 78.4%

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

   2. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. sinh-undef N/A

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

      5. lower-*.f64 N/A

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

      6. lower-sinh.f64 84.7

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

   4. Applied rewrites 84.7%

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

   5. Taylor expanded in U around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. associate-/l* N/A

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

      5. lower-fma.f64 N/A

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

      6. rec-exp N/A

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

      7. lower-/.f64 N/A

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

      8. sinh-undef-rev N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. lift-sinh.f64 82.7

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

   7. Applied rewrites 82.7%

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

   8. Taylor expanded in l around 0

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

      1. count-2-rev N/A

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

      2. lower-+.f64 71.6

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

   10. Applied rewrites 71.6%

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

Alternative 14: 71.3% accurate, 3.4× speedup

Math

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

FPCore

(FPCore (J l K U)
 :precision binary64
 (let* ((t_0 (* (* 0.3333333333333333 J) (* (* l l) l))))
   (if (<= l -3.8e+98) t_0 (if (<= l 3.4e+19) (fma (+ J J) l U) t_0))))

C

double code(double J, double l, double K, double U) {
	double t_0 = (0.3333333333333333 * J) * ((l * l) * l);
	double tmp;
	if (l <= -3.8e+98) {
		tmp = t_0;
	} else if (l <= 3.4e+19) {
		tmp = fma((J + J), l, U);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(J, l, K, U)
	t_0 = Float64(Float64(0.3333333333333333 * J) * Float64(Float64(l * l) * l))
	tmp = 0.0
	if (l <= -3.8e+98)
		tmp = t_0;
	elseif (l <= 3.4e+19)
		tmp = fma(Float64(J + J), l, U);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if l < -3.7999999999999999e98 or 3.4e19 < l

   1. Initial program 100.0%

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

   2. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. sinh-undef N/A

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

      5. lower-*.f64 N/A

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

      6. lower-sinh.f64 74.7

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

   4. Applied rewrites 74.7%

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

   5. 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)} \]
   6. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. unpow2 N/A

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

      9. lower-*.f64 N/A

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

      10. count-2-rev N/A

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

      11. lift-+.f64 61.5

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

   7. Applied rewrites 61.5%

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

   8. Taylor expanded in l around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-fma.f64 N/A

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

      4. associate-*r/ N/A

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

      5. lower-/.f64 N/A

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

      6. count-2-rev N/A

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

      7. lift-+.f64 N/A

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

      8. pow2 N/A

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

      9. lift-*.f64 N/A

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

      10. unpow3 N/A

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

      11. pow2 N/A

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

      12. lower-*.f64 N/A

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

      13. pow2 N/A

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

      14. lift-*.f64 66.9

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

   10. Applied rewrites 66.9%

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

   11. Taylor expanded in l around inf

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

       1. lower-*.f64 66.9

          \[\leadsto \left(0.3333333333333333 \cdot J\right) \cdot \left(\left(\ell \cdot \ell\right) \cdot \ell\right) \]

   13. Applied rewrites 66.9%

       \[\leadsto \left(0.3333333333333333 \cdot J\right) \cdot \left(\left(\ell \cdot \ell\right) \cdot \ell\right) \]

   if -3.7999999999999999e98 < l < 3.4e19

   1. Initial program 77.4%

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

   2. Taylor expanded in l around 0

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

      1. +-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-fma.f64 N/A

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

      4. count-2-rev N/A

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

      5. lower-+.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. lower-cos.f64 N/A

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

      9. lower-*.f64 85.5

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

   4. Applied rewrites 85.5%

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

   5. Taylor expanded in K around 0

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

   7. Applied rewrites 74.6%

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

Alternative 15: 70.2% accurate, 4.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 86.4%

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

2. Taylor expanded in K around 0

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

   1. +-commutative N/A

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

   2. *-commutative N/A

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

   3. lower-fma.f64 N/A

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

   4. sinh-undef N/A

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

   5. lower-*.f64 N/A

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

   6. lower-sinh.f64 81.1

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

4. Applied rewrites 81.1%

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

5. 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)} \]
6. Step-by-step derivation

   1. +-commutative N/A

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

   2. *-commutative N/A

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

   3. lower-fma.f64 N/A

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

   4. *-commutative N/A

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

   5. lower-fma.f64 N/A

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

   6. *-commutative N/A

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

   7. lower-*.f64 N/A

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

   8. unpow2 N/A

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

   9. lower-*.f64 N/A

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

   10. count-2-rev N/A

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

   11. lift-+.f64 70.2

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

7. Applied rewrites 70.2%

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

8. Taylor expanded in J around 0

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

   1. *-commutative N/A

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

   2. *-commutative N/A

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

   3. pow2 N/A

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

   4. +-commutative N/A

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

   5. lower-*.f64 N/A

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

   6. lift-fma.f64 N/A

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

   7. lift-*.f64 70.2

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

10. Applied rewrites 70.2%

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

    1. lift-fma.f64 N/A

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

    2. lift-*.f64 N/A

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

    3. associate-*l* N/A

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

    4. lower-fma.f64 N/A

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

    5. lower-*.f64 70.2

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

12. Applied rewrites 70.2%

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

Alternative 16: 55.0% accurate, 7.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 86.4%

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

2. Taylor expanded in l around 0

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

   1. +-commutative N/A

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

   2. associate-*r* N/A

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

   3. lower-fma.f64 N/A

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

   4. count-2-rev N/A

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

   5. lower-+.f64 N/A

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

   6. *-commutative N/A

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

   7. lower-*.f64 N/A

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

   8. lower-cos.f64 N/A

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

   9. lower-*.f64 64.9

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

4. Applied rewrites 64.9%

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

5. Taylor expanded in K around 0

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

7. Applied rewrites 55.0%

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

Alternative 17: 47.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(J + J\right) \cdot \ell\\ t_1 := \left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \cos \left(\frac{K}{2}\right)\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{-201}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;t\_1 \leq 4 \cdot 10^{+141}:\\ \;\;\;\;U\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (J l K U)
 :precision binary64
 (let* ((t_0 (* (+ J J) l))
        (t_1 (* (* J (- (exp l) (exp (- l)))) (cos (/ K 2.0)))))
   (if (<= t_1 -1e-201) t_0 (if (<= t_1 4e+141) U t_0))))

C

double code(double J, double l, double K, double U) {
	double t_0 = (J + J) * l;
	double t_1 = (J * (exp(l) - exp(-l))) * cos((K / 2.0));
	double tmp;
	if (t_1 <= -1e-201) {
		tmp = t_0;
	} else if (t_1 <= 4e+141) {
		tmp = U;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(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
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = (j + j) * l
    t_1 = (j * (exp(l) - exp(-l))) * cos((k / 2.0d0))
    if (t_1 <= (-1d-201)) then
        tmp = t_0
    else if (t_1 <= 4d+141) then
        tmp = u
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double J, double l, double K, double U) {
	double t_0 = (J + J) * l;
	double t_1 = (J * (Math.exp(l) - Math.exp(-l))) * Math.cos((K / 2.0));
	double tmp;
	if (t_1 <= -1e-201) {
		tmp = t_0;
	} else if (t_1 <= 4e+141) {
		tmp = U;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(J, l, K, U):
	t_0 = (J + J) * l
	t_1 = (J * (math.exp(l) - math.exp(-l))) * math.cos((K / 2.0))
	tmp = 0
	if t_1 <= -1e-201:
		tmp = t_0
	elif t_1 <= 4e+141:
		tmp = U
	else:
		tmp = t_0
	return tmp

Julia

function code(J, l, K, U)
	t_0 = Float64(Float64(J + J) * l)
	t_1 = Float64(Float64(J * Float64(exp(l) - exp(Float64(-l)))) * cos(Float64(K / 2.0)))
	tmp = 0.0
	if (t_1 <= -1e-201)
		tmp = t_0;
	elseif (t_1 <= 4e+141)
		tmp = U;
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(J, l, K, U)
	t_0 = (J + J) * l;
	t_1 = (J * (exp(l) - exp(-l))) * cos((K / 2.0));
	tmp = 0.0;
	if (t_1 <= -1e-201)
		tmp = t_0;
	elseif (t_1 <= 4e+141)
		tmp = U;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 J (-.f64 (exp.f64 l) (exp.f64 (neg.f64 l)))) (cos.f64 (/.f64 K #s(literal 2 binary64)))) < -9.99999999999999946e-202 or 4.00000000000000007e141 < (*.f64 (*.f64 J (-.f64 (exp.f64 l) (exp.f64 (neg.f64 l)))) (cos.f64 (/.f64 K #s(literal 2 binary64))))

   1. Initial program 99.3%

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

   2. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. sinh-undef N/A

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

      5. lower-*.f64 N/A

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

      6. lower-sinh.f64 74.6

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

   4. Applied rewrites 74.6%

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

   5. 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)} \]
   6. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. unpow2 N/A

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

      9. lower-*.f64 N/A

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

      10. count-2-rev N/A

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

      11. lift-+.f64 53.3

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

   7. Applied rewrites 53.3%

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

   8. Taylor expanded in l around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-fma.f64 N/A

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

      4. associate-*r/ N/A

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

      5. lower-/.f64 N/A

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

      6. count-2-rev N/A

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

      7. lift-+.f64 N/A

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

      8. pow2 N/A

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

      9. lift-*.f64 N/A

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

      10. unpow3 N/A

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

      11. pow2 N/A

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

      12. lower-*.f64 N/A

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

      13. pow2 N/A

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

      14. lift-*.f64 56.4

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

   10. Applied rewrites 56.4%

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

   11. Taylor expanded in l around 0

       \[\leadsto 2 \cdot \left(J \cdot \ell\right) \]
   12. Step-by-step derivation

       1. associate-*r* N/A

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

       2. lower-*.f64 N/A

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

       3. count-2-rev N/A

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

       4. lift-+.f64 21.9

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

   13. Applied rewrites 21.9%

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

   if -9.99999999999999946e-202 < (*.f64 (*.f64 J (-.f64 (exp.f64 l) (exp.f64 (neg.f64 l)))) (cos.f64 (/.f64 K #s(literal 2 binary64)))) < 4.00000000000000007e141

   1. Initial program 73.1%

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

   2. Taylor expanded in J around 0

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

   4. Applied rewrites 72.6%

      \[\leadsto \color{blue}{U} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 18: 37.6% accurate, 68.7× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(j, l, k, u)
use fmin_fmax_functions
    real(8), intent (in) :: j
    real(8), intent (in) :: l
    real(8), intent (in) :: k
    real(8), intent (in) :: u
    code = u
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 86.4%

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

2. Taylor expanded in J around 0

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

4. Applied rewrites 37.6%

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

Reproduce

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