Maksimov and Kolovsky, Equation (4)

Percentage Accurate: 86.4% → 99.9%

Time: 4.6s

Alternatives: 10

Speedup: 1.2×

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

Specification

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 86.4% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 86.4%

   \[\left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]
2. 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. *-commutative N/A

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

   4. lift-*.f64 N/A

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

   5. *-commutative N/A

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

   6. lift--.f64 N/A

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

   7. lift-exp.f64 N/A

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

   8. lift-exp.f64 N/A

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

   9. lift-neg.f64 N/A

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

   10. sinh-undef N/A

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

   11. associate-*l* N/A

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

   12. associate-*r* N/A

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

   13. lower-fma.f64 N/A

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

3. Applied rewrites 99.9%

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

Alternative 2: 88.8% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 86.4%

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

   2. Taylor expanded in K around 0

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

      1. lower-+.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-pow.f64 65.0

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

   4. Applied rewrites 65.0%

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

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

   1. Initial program 86.4%

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

   2. Taylor expanded in K around 0

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

      1. lower-+.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-exp.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-neg.f64 73.2

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

   4. Applied rewrites 73.2%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift-exp.f64 N/A

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

      6. lift-exp.f64 N/A

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

      7. lift-neg.f64 N/A

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

      8. sinh-undef N/A

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

      9. lift-sinh.f64 N/A

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

      10. associate-*r* N/A

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

      11. *-commutative N/A

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

      12. lower-fma.f64 N/A

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

      13. count-2-rev N/A

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

      14. lower-+.f64 80.3

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

   6. Applied rewrites 80.3%

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

Alternative 3: 88.0% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 86.4%

      \[\left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]
   2. 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. *-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lift--.f64 N/A

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

      7. lift-exp.f64 N/A

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

      8. lift-exp.f64 N/A

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

      9. lift-neg.f64 N/A

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

      10. sinh-undef N/A

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

      11. associate-*l* N/A

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

      12. associate-*r* N/A

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

      13. lower-fma.f64 N/A

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

   3. Applied rewrites 99.9%

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

   4. Taylor expanded in K around 0

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

      1. lower-+.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-pow.f64 70.1

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

   6. Applied rewrites 70.1%

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

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

   1. Initial program 86.4%

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

   2. Taylor expanded in K around 0

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

      1. lower-+.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-exp.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-neg.f64 73.2

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

   4. Applied rewrites 73.2%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift-exp.f64 N/A

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

      6. lift-exp.f64 N/A

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

      7. lift-neg.f64 N/A

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

      8. sinh-undef N/A

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

      9. lift-sinh.f64 N/A

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

      10. associate-*r* N/A

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

      11. *-commutative N/A

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

      12. lower-fma.f64 N/A

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

      13. count-2-rev N/A

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

      14. lower-+.f64 80.3

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

   6. Applied rewrites 80.3%

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

Alternative 4: 85.7% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 86.4%

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

   2. Taylor expanded in l around 0

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-cos.f64 N/A

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

      5. lower-*.f64 63.5

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

   4. Applied rewrites 63.5%

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

   5. Taylor expanded in K around 0

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

      1. lower-+.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-pow.f64 49.2

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

   7. Applied rewrites 49.2%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-*r* N/A

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

      4. count-2 N/A

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

      5. lift-+.f64 N/A

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

      6. lower-*.f64 49.2

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

      7. lift-+.f64 N/A

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

      8. +-commutative N/A

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

      9. lift-*.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 49.2

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

      12. lift-pow.f64 N/A

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

      13. unpow2 N/A

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

      14. lower-*.f64 49.2

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

   9. Applied rewrites 49.2%

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

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

   1. Initial program 86.4%

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

   2. Taylor expanded in K around 0

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

      1. lower-+.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-exp.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-neg.f64 73.2

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

   4. Applied rewrites 73.2%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift-exp.f64 N/A

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

      6. lift-exp.f64 N/A

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

      7. lift-neg.f64 N/A

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

      8. sinh-undef N/A

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

      9. lift-sinh.f64 N/A

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

      10. associate-*r* N/A

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

      11. *-commutative N/A

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

      12. lower-fma.f64 N/A

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

      13. count-2-rev N/A

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

      14. lower-+.f64 80.3

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

   6. Applied rewrites 80.3%

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

Alternative 5: 67.9% accurate, 2.8× speedup

Math

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

FPCore

(FPCore (J l K U)
 :precision binary64
 (if (<= l -1.0)
   (+ U (* J (- 1.0 (exp (- l)))))
   (if (<= l 5e+89) (fma (+ J J) l U) (* (+ 1.0 (/ (* (+ J J) l) U)) U))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if l < -1

   1. Initial program 86.4%

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

   2. Taylor expanded in K around 0

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

      1. lower-+.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-exp.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-neg.f64 73.2

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

   4. Applied rewrites 73.2%

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

   5. Taylor expanded in l around 0

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

   7. Applied rewrites 54.1%

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

   if -1 < l < 4.99999999999999983e89

   1. Initial program 86.4%

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

   2. Taylor expanded in K around 0

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

      1. lower-+.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-exp.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-neg.f64 73.2

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

   4. Applied rewrites 73.2%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift-exp.f64 N/A

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

      6. lift-exp.f64 N/A

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

      7. lift-neg.f64 N/A

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

      8. sinh-undef N/A

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

      9. lift-sinh.f64 N/A

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

      10. associate-*r* N/A

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

      11. *-commutative N/A

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

      12. lower-fma.f64 N/A

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

      13. count-2-rev N/A

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

      14. lower-+.f64 80.3

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

   6. Applied rewrites 80.3%

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

   7. Taylor expanded in l around 0

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

   9. Applied rewrites 53.3%

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

   if 4.99999999999999983e89 < l

   1. Initial program 86.4%

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

   2. Taylor expanded in K around 0

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

      1. lower-+.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-exp.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-neg.f64 73.2

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

   4. Applied rewrites 73.2%

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

      1. lift-+.f64 N/A

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

      2. sum-to-mult N/A

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

      3. lower-unsound-*.f64 N/A

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

   6. Applied rewrites 79.3%

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

   7. Taylor expanded in l around 0

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

   9. Applied rewrites 56.3%

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

Alternative 6: 61.6% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 86.4%

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

   2. Taylor expanded in l around 0

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-cos.f64 N/A

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

      5. lower-*.f64 63.5

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

   4. Applied rewrites 63.5%

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

   5. Taylor expanded in K around 0

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

      1. lower-+.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-pow.f64 49.2

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

   7. Applied rewrites 49.2%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-*r* N/A

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

      4. count-2 N/A

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

      5. lift-+.f64 N/A

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

      6. lower-*.f64 49.2

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

      7. lift-+.f64 N/A

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

      8. +-commutative N/A

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

      9. lift-*.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 49.2

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

      12. lift-pow.f64 N/A

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

      13. unpow2 N/A

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

      14. lower-*.f64 49.2

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

   9. Applied rewrites 49.2%

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

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

   1. Initial program 86.4%

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

   2. Taylor expanded in K around 0

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

      1. lower-+.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-exp.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-neg.f64 73.2

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

   4. Applied rewrites 73.2%

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

      1. lift-+.f64 N/A

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

      2. sum-to-mult N/A

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

      3. lower-unsound-*.f64 N/A

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

   6. Applied rewrites 79.3%

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

   7. Taylor expanded in l around 0

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

   9. Applied rewrites 56.3%

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

Alternative 7: 56.5% accurate, 3.5× speedup

Math

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

FPCore

(FPCore (J l K U)
 :precision binary64
 (if (<= J -3.9e+171) (fma (+ J J) l U) (* (+ 1.0 (/ (* (+ J J) l) U)) U)))

C

double code(double J, double l, double K, double U) {
	double tmp;
	if (J <= -3.9e+171) {
		tmp = fma((J + J), l, U);
	} else {
		tmp = (1.0 + (((J + J) * l) / U)) * U;
	}
	return tmp;
}

Julia

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

Wolfram

code[J_, l_, K_, U_] := If[LessEqual[J, -3.9e+171], N[(N[(J + J), $MachinePrecision] * l + U), $MachinePrecision], N[(N[(1.0 + N[(N[(N[(J + J), $MachinePrecision] * l), $MachinePrecision] / U), $MachinePrecision]), $MachinePrecision] * U), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if J < -3.9e171

   1. Initial program 86.4%

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

   2. Taylor expanded in K around 0

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

      1. lower-+.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-exp.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-neg.f64 73.2

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

   4. Applied rewrites 73.2%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift-exp.f64 N/A

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

      6. lift-exp.f64 N/A

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

      7. lift-neg.f64 N/A

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

      8. sinh-undef N/A

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

      9. lift-sinh.f64 N/A

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

      10. associate-*r* N/A

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

      11. *-commutative N/A

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

      12. lower-fma.f64 N/A

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

      13. count-2-rev N/A

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

      14. lower-+.f64 80.3

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

   6. Applied rewrites 80.3%

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

   7. Taylor expanded in l around 0

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

   9. Applied rewrites 53.3%

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

   if -3.9e171 < J

   1. Initial program 86.4%

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

   2. Taylor expanded in K around 0

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

      1. lower-+.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-exp.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-neg.f64 73.2

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

   4. Applied rewrites 73.2%

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

      1. lift-+.f64 N/A

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

      2. sum-to-mult N/A

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

      3. lower-unsound-*.f64 N/A

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

   6. Applied rewrites 79.3%

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

   7. Taylor expanded in l around 0

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

   9. Applied rewrites 56.3%

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

Alternative 8: 53.3% accurate, 7.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 86.4%

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

2. Taylor expanded in K around 0

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

   1. lower-+.f64 N/A

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

   2. lower-*.f64 N/A

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

   3. lower--.f64 N/A

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

   4. lower-exp.f64 N/A

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

   5. lower-exp.f64 N/A

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

   6. lower-neg.f64 73.2

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

4. Applied rewrites 73.2%

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

   1. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-*.f64 N/A

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

   4. lift--.f64 N/A

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

   5. lift-exp.f64 N/A

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

   6. lift-exp.f64 N/A

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

   7. lift-neg.f64 N/A

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

   8. sinh-undef N/A

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

   9. lift-sinh.f64 N/A

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

   10. associate-*r* N/A

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

   11. *-commutative N/A

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

   12. lower-fma.f64 N/A

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

   13. count-2-rev N/A

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

   14. lower-+.f64 80.3

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

6. Applied rewrites 80.3%

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

7. Taylor expanded in l around 0

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

9. Applied rewrites 53.3%

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

Alternative 9: 39.1% accurate, 4.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := J \cdot \frac{U}{J}\\ \mathbf{if}\;\ell \leq -165000:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;\ell \leq 1.3 \cdot 10^{+17}:\\ \;\;\;\;U\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (J l K U)
 :precision binary64
 (let* ((t_0 (* J (/ U J))))
   (if (<= l -165000.0) t_0 (if (<= l 1.3e+17) U t_0))))

C

double code(double J, double l, double K, double U) {
	double t_0 = J * (U / J);
	double tmp;
	if (l <= -165000.0) {
		tmp = t_0;
	} else if (l <= 1.3e+17) {
		tmp = U;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(j, l, k, u)
use fmin_fmax_functions
    real(8), intent (in) :: j
    real(8), intent (in) :: l
    real(8), intent (in) :: k
    real(8), intent (in) :: u
    real(8) :: t_0
    real(8) :: tmp
    t_0 = j * (u / j)
    if (l <= (-165000.0d0)) then
        tmp = t_0
    else if (l <= 1.3d+17) then
        tmp = u
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double J, double l, double K, double U) {
	double t_0 = J * (U / J);
	double tmp;
	if (l <= -165000.0) {
		tmp = t_0;
	} else if (l <= 1.3e+17) {
		tmp = U;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(J, l, K, U):
	t_0 = J * (U / J)
	tmp = 0
	if l <= -165000.0:
		tmp = t_0
	elif l <= 1.3e+17:
		tmp = U
	else:
		tmp = t_0
	return tmp

Julia

function code(J, l, K, U)
	t_0 = Float64(J * Float64(U / J))
	tmp = 0.0
	if (l <= -165000.0)
		tmp = t_0;
	elseif (l <= 1.3e+17)
		tmp = U;
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(J, l, K, U)
	t_0 = J * (U / J);
	tmp = 0.0;
	if (l <= -165000.0)
		tmp = t_0;
	elseif (l <= 1.3e+17)
		tmp = U;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[J_, l_, K_, U_] := Block[{t$95$0 = N[(J * N[(U / J), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, -165000.0], t$95$0, If[LessEqual[l, 1.3e+17], U, t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if l < -165000 or 1.3e17 < l

   1. Initial program 86.4%

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

   2. Taylor expanded in K around 0

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

      1. lower-+.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-exp.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-neg.f64 73.2

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

   4. Applied rewrites 73.2%

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

   5. Taylor expanded in J around inf

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

      1. lower-*.f64 N/A

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

      2. lower--.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. lower-exp.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-exp.f64 N/A

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

      7. lower-neg.f64 56.4

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

   7. Applied rewrites 56.4%

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

   8. Taylor expanded in J around 0

      \[\leadsto J \cdot \frac{U}{J} \]
   9. Step-by-step derivation

      1. lower-/.f64 33.4

         \[\leadsto J \cdot \frac{U}{J} \]

   10. Applied rewrites 33.4%

       \[\leadsto J \cdot \frac{U}{J} \]

   if -165000 < l < 1.3e17

   1. Initial program 86.4%

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

   2. Taylor expanded in J around 0

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

   4. Applied rewrites 35.8%

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

Alternative 10: 35.8% accurate, 68.7× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 86.4%

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

2. Taylor expanded in J around 0

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

4. Applied rewrites 35.8%

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

Reproduce

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