Maksimov and Kolovsky, Equation (4)

Percentage Accurate: 86.4% → 99.9%

Time: 11.0s

Alternatives: 21

Speedup: 1.5×

• 49.1% 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

real(8) function code(j, l, k, u)
    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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 1.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 87.6%

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

   1. lift-+.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. lift-*.f64 N/A

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

   4. associate-*l* N/A

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

   5. *-commutative N/A

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

   6. lower-fma.f64 N/A

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

4. Applied rewrites 100.0%

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

5. Final simplification 100.0%

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

Alternative 2: 72.3% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (J l K U)
 :precision binary64
 (let* ((t_0 (* (- (exp l) (exp (- l))) J)))
   (if (<= t_0 (- INFINITY))
     (fma (* (* 0.3333333333333333 (* l l)) l) J U)
     (if (<= t_0 5e+121)
       (fma (* 2.0 l) J U)
       (* (* (fma (* l l) 0.3333333333333333 2.0) l) J)))))

C

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

Julia

function code(J, l, K, U)
	t_0 = Float64(Float64(exp(l) - exp(Float64(-l))) * J)
	tmp = 0.0
	if (t_0 <= Float64(-Inf))
		tmp = fma(Float64(Float64(0.3333333333333333 * Float64(l * l)) * l), J, U);
	elseif (t_0 <= 5e+121)
		tmp = fma(Float64(2.0 * l), J, U);
	else
		tmp = Float64(Float64(fma(Float64(l * l), 0.3333333333333333, 2.0) * l) * J);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 100.0%

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

   3. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-exp.f64 N/A

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

      7. lower-neg.f64 78.1

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

   5. Applied rewrites 78.1%

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

   6. Taylor expanded in l around 0

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

   8. Applied rewrites 50.2%

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

   9. Taylor expanded in l around inf

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

   11. Applied rewrites 50.2%

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

   if -inf.0 < (*.f64 J (-.f64 (exp.f64 l) (exp.f64 (neg.f64 l)))) < 5.00000000000000007e121

   1. Initial program 74.0%

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

   3. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-exp.f64 N/A

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

      7. lower-neg.f64 74.0

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

   5. Applied rewrites 74.0%

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

   6. Taylor expanded in l around 0

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

   8. Applied rewrites 89.8%

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

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

   1. Initial program 99.4%

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

   3. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-exp.f64 N/A

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

      7. lower-neg.f64 76.1

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

   5. Applied rewrites 76.1%

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

   6. Taylor expanded in l around 0

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

   8. Applied rewrites 46.5%

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

   9. Taylor expanded in U around 0

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

   11. Applied rewrites 50.4%

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

4. Final simplification 69.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(e^{\ell} - e^{-\ell}\right) \cdot J \leq -\infty:\\ \;\;\;\;\mathsf{fma}\left(\left(0.3333333333333333 \cdot \left(\ell \cdot \ell\right)\right) \cdot \ell, J, U\right)\\ \mathbf{elif}\;\left(e^{\ell} - e^{-\ell}\right) \cdot J \leq 5 \cdot 10^{+121}:\\ \;\;\;\;\mathsf{fma}\left(2 \cdot \ell, J, U\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(\ell \cdot \ell, 0.3333333333333333, 2\right) \cdot \ell\right) \cdot J\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 96.2% accurate, 1.2× speedup

Math

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

   1. Initial program 85.4%

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

   3. Taylor expanded in l around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. +-commutative N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

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

      9. +-commutative N/A

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

      10. lower-fma.f64 N/A

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

      11. unpow2 N/A

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

      12. lower-*.f64 N/A

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

      13. unpow2 N/A

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

      14. lower-*.f64 N/A

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

      15. unpow2 N/A

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

      16. lower-*.f64 92.9

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

   5. Applied rewrites 92.9%

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

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

   1. Initial program 88.6%

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

   3. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-exp.f64 N/A

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

      7. lower-neg.f64 88.6

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

   5. Applied rewrites 88.6%

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

   7. Applied rewrites 98.7%

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

4. Final simplification 96.9%

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

Alternative 4: 95.4% accurate, 1.2× speedup

Math

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

   1. Initial program 85.4%

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

   3. Taylor expanded in l around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. +-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. unpow2 N/A

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

      9. lower-*.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-*.f64 90.6

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

   5. Applied rewrites 90.6%

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

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

   1. Initial program 88.6%

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

   3. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-exp.f64 N/A

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

      7. lower-neg.f64 88.6

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

   5. Applied rewrites 88.6%

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

   7. Applied rewrites 98.7%

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

4. Final simplification 96.1%

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

Alternative 5: 93.9% accurate, 1.3× speedup

Math

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

   1. Initial program 85.4%

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

   3. Taylor expanded in l around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 84.8

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

   5. Applied rewrites 84.8%

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

   1. Initial program 88.6%

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

   3. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-exp.f64 N/A

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

      7. lower-neg.f64 88.6

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

   5. Applied rewrites 88.6%

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

   7. Applied rewrites 98.7%

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

4. Final simplification 94.3%

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

Alternative 6: 93.0% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\cos \left(\frac{K}{2}\right) \leq 0.6:\\ \;\;\;\;\mathsf{fma}\left(\left(\mathsf{fma}\left(\ell \cdot \ell, 0.3333333333333333, 2\right) \cdot J\right) \cdot \cos \left(0.5 \cdot K\right), \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.6)
   (fma (* (* (fma (* l l) 0.3333333333333333 2.0) J) (cos (* 0.5 K))) l U)
   (fma (* 2.0 (sinh l)) J U)))

C

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

Julia

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

Wolfram

code[J_, l_, K_, U_] := If[LessEqual[N[Cos[N[(K / 2.0), $MachinePrecision]], $MachinePrecision], 0.6], N[(N[(N[(N[(N[(l * l), $MachinePrecision] * 0.3333333333333333 + 2.0), $MachinePrecision] * J), $MachinePrecision] * N[Cos[N[(0.5 * K), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * l + 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.599999999999999978

   1. Initial program 85.4%

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

   3. Taylor expanded in l around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-*r* N/A

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

      4. *-commutative N/A

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

      5. associate-*r* N/A

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

      6. associate-*r* N/A

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

      7. lower-fma.f64 N/A

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

   5. Applied rewrites 81.5%

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

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

   1. Initial program 88.6%

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

   3. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-exp.f64 N/A

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

      7. lower-neg.f64 88.6

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

   5. Applied rewrites 88.6%

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

   7. Applied rewrites 98.7%

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

4. Final simplification 93.2%

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

Alternative 7: 87.3% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

code[J_, l_, K_, U_] := Block[{t$95$0 = N[(2.0 * N[Sinh[l], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Cos[N[(K / 2.0), $MachinePrecision]], $MachinePrecision], -0.05], N[(N[(N[(N[(K * K), $MachinePrecision] * -0.125 + 1.0), $MachinePrecision] * t$95$0), $MachinePrecision] * J + U), $MachinePrecision], N[(t$95$0 * 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 95.3%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*l* N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 75.7

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

   7. Applied rewrites 75.7%

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

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

   1. Initial program 85.6%

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

   3. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-exp.f64 N/A

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

      7. lower-neg.f64 85.6

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

   5. Applied rewrites 85.6%

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

   7. Applied rewrites 94.9%

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

4. Final simplification 91.1%

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

Alternative 8: 84.9% accurate, 1.4× speedup

Math

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 95.3%

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

   3. Taylor expanded in l around 0

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. associate-*r* N/A

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

      6. lower-*.f64 N/A

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

   5. Applied rewrites 81.3%

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

   6. Taylor expanded in K around 0

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

   8. Applied rewrites 64.0%

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

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

   1. Initial program 85.6%

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

   3. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-exp.f64 N/A

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

      7. lower-neg.f64 85.6

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

   5. Applied rewrites 85.6%

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

   7. Applied rewrites 94.9%

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

4. Final simplification 88.8%

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

Alternative 9: 81.5% accurate, 1.8× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 95.3%

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

   3. Taylor expanded in l around 0

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. associate-*r* N/A

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

      6. lower-*.f64 N/A

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

   5. Applied rewrites 81.3%

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

   6. Taylor expanded in K around 0

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

   8. Applied rewrites 64.0%

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

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

   1. Initial program 85.6%

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

   3. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-exp.f64 N/A

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

      7. lower-neg.f64 85.6

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

   5. Applied rewrites 85.6%

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

   6. Taylor expanded in l around 0

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

   8. Applied rewrites 85.5%

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

   10. Applied rewrites 85.5%

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

4. Final simplification 81.2%

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

Alternative 10: 81.5% accurate, 1.8× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 95.3%

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

   3. Taylor expanded in l around 0

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. associate-*r* N/A

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

      6. lower-*.f64 N/A

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

   5. Applied rewrites 81.3%

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

   6. Taylor expanded in K around 0

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

   8. Applied rewrites 64.0%

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

   9. Taylor expanded in K around inf

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

   11. Applied rewrites 63.9%

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

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

   1. Initial program 85.6%

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

   3. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-exp.f64 N/A

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

      7. lower-neg.f64 85.6

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

   5. Applied rewrites 85.6%

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

   6. Taylor expanded in l around 0

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

   8. Applied rewrites 85.5%

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

   10. Applied rewrites 85.5%

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

4. Final simplification 81.2%

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

Alternative 11: 83.3% accurate, 2.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 95.3%

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

   3. Taylor expanded in l around 0

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. associate-*r* N/A

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

      6. lower-*.f64 N/A

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

   5. Applied rewrites 81.3%

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

   6. Taylor expanded in K around 0

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

   8. Applied rewrites 60.8%

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

   10. Applied rewrites 62.7%

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

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

   1. Initial program 85.6%

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

   3. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-exp.f64 N/A

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

      7. lower-neg.f64 85.6

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

   5. Applied rewrites 85.6%

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

   6. Taylor expanded in l around 0

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

   8. Applied rewrites 85.5%

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

   10. Applied rewrites 85.5%

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

4. Final simplification 81.0%

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

Alternative 12: 83.3% accurate, 2.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 95.3%

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

   3. Taylor expanded in l around 0

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. associate-*r* N/A

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

      6. lower-*.f64 N/A

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

   5. Applied rewrites 81.3%

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

   6. Taylor expanded in K around 0

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

   8. Applied rewrites 60.8%

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

   10. Applied rewrites 62.7%

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

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

   1. Initial program 85.6%

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

   3. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-exp.f64 N/A

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

      7. lower-neg.f64 85.6

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

   5. Applied rewrites 85.6%

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

   6. Taylor expanded in l around 0

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

   8. Applied rewrites 85.5%

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

   9. Taylor expanded in l around inf

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

   11. Applied rewrites 85.5%

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

4. Final simplification 81.0%

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

Alternative 13: 81.8% accurate, 2.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 95.3%

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

   3. Taylor expanded in l around 0

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. associate-*r* N/A

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

      6. lower-*.f64 N/A

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

   5. Applied rewrites 81.3%

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

   6. Taylor expanded in K around 0

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

   8. Applied rewrites 60.8%

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

   10. Applied rewrites 62.7%

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

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

   1. Initial program 85.6%

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

   3. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-exp.f64 N/A

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

      7. lower-neg.f64 85.6

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

   5. Applied rewrites 85.6%

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

   6. Taylor expanded in l around 0

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

   8. Applied rewrites 83.3%

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

4. Final simplification 79.2%

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

Alternative 14: 81.8% accurate, 2.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 95.3%

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

   3. Taylor expanded in l around 0

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. associate-*r* N/A

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

      6. lower-*.f64 N/A

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

   5. Applied rewrites 81.3%

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

   6. Taylor expanded in K around 0

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

   8. Applied rewrites 60.8%

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

   9. Taylor expanded in K around inf

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

   11. Applied rewrites 62.7%

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

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

   1. Initial program 85.6%

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

   3. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-exp.f64 N/A

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

      7. lower-neg.f64 85.6

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

   5. Applied rewrites 85.6%

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

   6. Taylor expanded in l around 0

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

   8. Applied rewrites 83.3%

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

4. Final simplification 79.2%

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

Alternative 15: 79.7% accurate, 2.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 95.3%

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

   3. Taylor expanded in l around 0

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

      1. +-commutative N/A

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

      2. associate-*r* N/A

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

      3. associate-*r* N/A

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

      4. associate-*r* N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. associate-*r* N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower-*.f64 N/A

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

      11. lower-cos.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 58.8

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

   5. Applied rewrites 58.8%

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

   6. Taylor expanded in K around 0

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

   8. Applied rewrites 60.7%

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

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

   1. Initial program 85.6%

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

   3. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-exp.f64 N/A

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

      7. lower-neg.f64 85.6

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

   5. Applied rewrites 85.6%

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

   6. Taylor expanded in l around 0

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

   8. Applied rewrites 83.3%

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

4. Final simplification 78.8%

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

Alternative 16: 76.1% accurate, 2.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 95.3%

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

   3. Taylor expanded in l around 0

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

      1. +-commutative N/A

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

      2. associate-*r* N/A

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

      3. associate-*r* N/A

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

      4. associate-*r* N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. associate-*r* N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower-*.f64 N/A

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

      11. lower-cos.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 58.8

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

   5. Applied rewrites 58.8%

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

   6. Taylor expanded in K around 0

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

   8. Applied rewrites 60.7%

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

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

   1. Initial program 85.6%

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

   3. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-exp.f64 N/A

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

      7. lower-neg.f64 85.6

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

   5. Applied rewrites 85.6%

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

   6. Taylor expanded in l around 0

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

   8. Applied rewrites 77.3%

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

   10. Applied rewrites 77.3%

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

4. Final simplification 74.0%

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

Alternative 17: 74.1% accurate, 2.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 95.3%

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

   3. Taylor expanded in l around 0

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

      1. +-commutative N/A

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

      2. associate-*r* N/A

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

      3. associate-*r* N/A

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

      4. associate-*r* N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. associate-*r* N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower-*.f64 N/A

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

      11. lower-cos.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 58.8

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

   5. Applied rewrites 58.8%

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

   6. Taylor expanded in K around 0

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

   8. Applied rewrites 60.7%

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

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

   1. Initial program 85.6%

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

   3. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-exp.f64 N/A

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

      7. lower-neg.f64 85.6

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

   5. Applied rewrites 85.6%

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

   6. Taylor expanded in l around 0

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

   8. Applied rewrites 75.5%

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

4. Final simplification 72.5%

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

Alternative 18: 72.3% accurate, 9.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if l < -1.9e5 or 4.00000000000000021e32 < l

   1. Initial program 100.0%

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

   3. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-exp.f64 N/A

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

      7. lower-neg.f64 77.2

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

   5. Applied rewrites 77.2%

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

   6. Taylor expanded in l around 0

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

   8. Applied rewrites 51.9%

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

   9. Taylor expanded in U around 0

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

   11. Applied rewrites 54.8%

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

   if -1.9e5 < l < 4.00000000000000021e32

   1. Initial program 76.0%

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

   3. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-exp.f64 N/A

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

      7. lower-neg.f64 74.1

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

   5. Applied rewrites 74.1%

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

   6. Taylor expanded in l around 0

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

   8. Applied rewrites 82.0%

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

Alternative 19: 54.7% accurate, 27.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 87.6%

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

3. Taylor expanded in K around 0

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

   1. +-commutative N/A

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

   2. *-commutative N/A

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

   3. lower-fma.f64 N/A

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

   4. lower--.f64 N/A

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

   5. lower-exp.f64 N/A

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

   6. lower-exp.f64 N/A

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

   7. lower-neg.f64 75.6

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

5. Applied rewrites 75.6%

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

6. Taylor expanded in l around 0

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

8. Applied rewrites 55.7%

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

Alternative 20: 54.7% accurate, 27.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 87.6%

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

3. Taylor expanded in K around 0

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

   1. +-commutative N/A

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

   2. *-commutative N/A

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

   3. lower-fma.f64 N/A

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

   4. lower--.f64 N/A

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

   5. lower-exp.f64 N/A

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

   6. lower-exp.f64 N/A

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

   7. lower-neg.f64 75.6

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

5. Applied rewrites 75.6%

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

6. Taylor expanded in l around 0

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

8. Applied rewrites 55.7%

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

9. Final simplification 55.7%

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

Alternative 21: 19.8% accurate, 30.0× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(j, l, k, u)
    real(8), intent (in) :: j
    real(8), intent (in) :: l
    real(8), intent (in) :: k
    real(8), intent (in) :: u
    code = (j * 2.0d0) * l
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 87.6%

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

3. Taylor expanded in K around 0

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

   1. +-commutative N/A

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

   2. *-commutative N/A

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

   3. lower-fma.f64 N/A

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

   4. lower--.f64 N/A

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

   5. lower-exp.f64 N/A

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

   6. lower-exp.f64 N/A

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

   7. lower-neg.f64 75.6

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

5. Applied rewrites 75.6%

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

6. Taylor expanded in l around 0

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

8. Applied rewrites 55.7%

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

9. Taylor expanded in U around 0

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

11. Applied rewrites 21.5%

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

12. Final simplification 21.5%

    \[\leadsto \left(J \cdot 2\right) \cdot \ell \]
13. Add Preprocessing

Reproduce

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