Maksimov and Kolovsky, Equation (4)

Percentage Accurate: 86.1% → 100.0%

Time: 8.8s

Alternatives: 15

Speedup: 2.2×

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

Specification

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 86.1% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 88.7%

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

5. Taylor expanded in K around 0

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

7. Applied rewrites 100.0%

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

Alternative 2: 87.5% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 91.4%

      \[\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(\frac{K}{-2}\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

   7. Applied rewrites 70.9%

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

   1. Initial program 83.8%

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

   3. Taylor expanded in l around 0

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

   5. Applied rewrites 80.3%

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

   7. Applied rewrites 80.3%

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

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

   1. Initial program 89.0%

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

   5. Taylor expanded in K around 0

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

   7. Applied rewrites 96.6%

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

Alternative 3: 93.6% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 87.4%

      \[\left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]
   2. Add Preprocessing
   3. 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 99.9%

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

   5. Taylor expanded in l around 0

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

   7. Applied rewrites 92.5%

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

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

   1. Initial program 89.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(\frac{K}{-2}\right) \cdot \left(\sinh \ell \cdot 2\right), J, U\right)} \]

   5. Taylor expanded in K around 0

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

   7. Applied rewrites 98.5%

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

Alternative 4: 92.7% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 88.9%

      \[\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)} \]

   5. Applied rewrites 90.4%

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

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

   1. Initial program 88.7%

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

   5. Taylor expanded in K around 0

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

   7. Applied rewrites 97.2%

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

Alternative 5: 88.1% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 87.8%

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

   3. Taylor expanded in l around 0

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

   5. Applied rewrites 68.5%

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

   7. Applied rewrites 68.5%

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

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

   1. Initial program 89.0%

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

   5. Taylor expanded in K around 0

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

   7. Applied rewrites 96.6%

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

Alternative 6: 88.1% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 87.8%

      \[\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 99.9%

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

   5. Taylor expanded in l around 0

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

   7. Applied rewrites 68.5%

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

   9. Applied rewrites 68.5%

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

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

   1. Initial program 89.0%

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

   5. Taylor expanded in K around 0

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

   7. Applied rewrites 96.6%

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

Alternative 7: 83.5% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 89.1%

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

   5. Taylor expanded in l around 0

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

   7. Applied rewrites 57.7%

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

   8. Taylor expanded in K around 0

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

   10. Applied rewrites 61.8%

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

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

   1. Initial program 88.7%

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

   5. Taylor expanded in K around 0

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

   7. Applied rewrites 90.8%

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

Alternative 8: 95.1% accurate, 2.0× speedup

Math

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

FPCore

(FPCore (J l K U)
 :precision binary64
 (+
  (*
   (*
    J
    (*
     (fma
      (fma
       (fma 0.0003968253968253968 (* l l) 0.016666666666666666)
       (* l l)
       0.3333333333333333)
      (* l l)
      2.0)
     l))
   (cos (/ K 2.0)))
  U))

C

double code(double J, double l, double K, double U) {
	return ((J * (fma(fma(fma(0.0003968253968253968, (l * l), 0.016666666666666666), (l * l), 0.3333333333333333), (l * l), 2.0) * l)) * cos((K / 2.0))) + U;
}

Julia

function code(J, l, K, U)
	return Float64(Float64(Float64(J * Float64(fma(fma(fma(0.0003968253968253968, Float64(l * l), 0.016666666666666666), Float64(l * l), 0.3333333333333333), Float64(l * l), 2.0) * l)) * cos(Float64(K / 2.0))) + U)
end

Wolfram

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

Derivation

1. Initial program 88.7%

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

3. Taylor expanded in l around 0

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

5. Applied rewrites 97.6%

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

Alternative 9: 95.1% accurate, 2.0× speedup

Math

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

FPCore

(FPCore (J l K U)
 :precision binary64
 (fma
  (*
   (*
    (fma
     (fma
      (fma 0.0003968253968253968 (* l l) 0.016666666666666666)
      (* l l)
      0.3333333333333333)
     (* l l)
     2.0)
    l)
   J)
  (cos (/ K 2.0))
  U))

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 88.7%

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

3. Taylor expanded in l around 0

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

5. Applied rewrites 97.6%

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

   1. lift-+.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. lower-fma.f64 97.6

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

   4. lift-*.f64 N/A

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

   5. *-commutative N/A

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

   6. lower-*.f64 97.6

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

7. Applied rewrites 97.6%

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

Alternative 10: 78.3% accurate, 2.1× speedup

Math

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

FPCore

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 89.1%

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

   5. Taylor expanded in l around 0

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

   7. Applied rewrites 57.7%

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

   8. Taylor expanded in K around 0

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

   10. Applied rewrites 61.8%

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

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

   1. Initial program 88.7%

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

   5. Taylor expanded in K around 0

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

   7. Applied rewrites 90.8%

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

   8. Taylor expanded in l around 0

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

   10. Applied rewrites 87.4%

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

4. Final simplification 83.8%

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

Alternative 11: 93.0% accurate, 2.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 88.7%

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

3. Taylor expanded in l around 0

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

5. Applied rewrites 97.6%

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

6. Taylor expanded in l around 0

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

8. Applied rewrites 95.3%

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

   1. lift-+.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. lift-*.f64 N/A

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

   4. associate-*l* N/A

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

   5. *-commutative N/A

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

   6. lower-fma.f64 N/A

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

10. Applied rewrites 95.3%

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

Alternative 12: 74.8% accurate, 2.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 89.1%

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

   5. Taylor expanded in l around 0

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

   7. Applied rewrites 57.7%

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

   8. Taylor expanded in K around 0

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

   10. Applied rewrites 61.8%

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

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

   1. Initial program 88.7%

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

   5. Taylor expanded in K around 0

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

   7. Applied rewrites 90.8%

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

   8. Taylor expanded in l around 0

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

   10. Applied rewrites 83.4%

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

4. Final simplification 80.4%

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

Alternative 13: 59.3% accurate, 9.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\ell \leq -1.3 \cdot 10^{+75} \lor \neg \left(\ell \leq 1.05 \cdot 10^{-14}\right):\\ \;\;\;\;\mathsf{fma}\left(\ell \cdot \mathsf{fma}\left(-0.25, K \cdot K, 2\right), J, U\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\ell + \ell, J, U\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (J l K U)
 :precision binary64
 (if (or (<= l -1.3e+75) (not (<= l 1.05e-14)))
   (fma (* l (fma -0.25 (* K K) 2.0)) J U)
   (fma (+ l l) J U)))

C

double code(double J, double l, double K, double U) {
	double tmp;
	if ((l <= -1.3e+75) || !(l <= 1.05e-14)) {
		tmp = fma((l * fma(-0.25, (K * K), 2.0)), J, U);
	} else {
		tmp = fma((l + l), J, U);
	}
	return tmp;
}

Julia

function code(J, l, K, U)
	tmp = 0.0
	if ((l <= -1.3e+75) || !(l <= 1.05e-14))
		tmp = fma(Float64(l * fma(-0.25, Float64(K * K), 2.0)), J, U);
	else
		tmp = fma(Float64(l + l), J, U);
	end
	return tmp
end

Wolfram

code[J_, l_, K_, U_] := If[Or[LessEqual[l, -1.3e+75], N[Not[LessEqual[l, 1.05e-14]], $MachinePrecision]], N[(N[(l * N[(-0.25 * N[(K * K), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] * J + U), $MachinePrecision], N[(N[(l + l), $MachinePrecision] * J + U), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if l < -1.29999999999999992e75 or 1.0499999999999999e-14 < l

   1. Initial program 99.8%

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

   5. Taylor expanded in l around 0

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

   7. Applied rewrites 36.3%

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

   8. Taylor expanded in K around 0

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

   10. Applied rewrites 41.2%

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

   if -1.29999999999999992e75 < l < 1.0499999999999999e-14

   1. Initial program 79.1%

      \[\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 99.9%

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

   5. Taylor expanded in l around 0

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

   7. Applied rewrites 95.0%

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

   8. Taylor expanded in K around 0

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

   10. Applied rewrites 84.7%

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

   12. Applied rewrites 84.7%

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

4. Final simplification 64.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\ell \leq -1.3 \cdot 10^{+75} \lor \neg \left(\ell \leq 1.05 \cdot 10^{-14}\right):\\ \;\;\;\;\mathsf{fma}\left(\ell \cdot \mathsf{fma}\left(-0.25, K \cdot K, 2\right), J, U\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\ell + \ell, J, U\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 14: 54.3% accurate, 33.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 88.7%

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

5. Taylor expanded in l around 0

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

7. Applied rewrites 67.7%

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

8. Taylor expanded in K around 0

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

10. Applied rewrites 58.5%

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

12. Applied rewrites 58.5%

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

Alternative 15: 36.7% accurate, 330.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 88.7%

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

3. Taylor expanded in J around 0

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

5. Applied rewrites 40.8%

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

Reproduce

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