Maksimov and Kolovsky, Equation (4)

Percentage Accurate: 86.5% → 100.0%

Time: 3.9s

Alternatives: 15

Speedup: 1.2×

• 50.4% 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.5% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 86.5%

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

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

   6. lower-fma.f64 N/A

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

3. Applied rewrites 100.0%

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

Alternative 2: 100.0% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 86.5%

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

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

   6. lower-fma.f64 N/A

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

3. Applied rewrites 100.0%

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

5. Applied rewrites 100.0%

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

Alternative 3: 89.0% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\cos \left(\frac{K}{2}\right) \leq -0.02:\\ \;\;\;\;\left(1 + \frac{\cos \left(0.5 \cdot K\right) \cdot \left(\left(\ell + \ell\right) \cdot J\right)}{U}\right) \cdot 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)
   (* (+ 1.0 (/ (* (cos (* 0.5 K)) (* (+ l l) J)) U)) 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 = (1.0 + ((cos((0.5 * K)) * ((l + l) * J)) / U)) * 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(1.0 + Float64(Float64(cos(Float64(0.5 * K)) * Float64(Float64(l + l) * J)) / U)) * 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[(1.0 + N[(N[(N[Cos[N[(0.5 * K), $MachinePrecision]], $MachinePrecision] * N[(N[(l + l), $MachinePrecision] * J), $MachinePrecision]), $MachinePrecision] / U), $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.5%

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

   2. Taylor expanded in l around 0

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

      1. lower-*.f64 63.3

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

   4. Applied rewrites 63.3%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. sum-to-mult N/A

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

      4. lower-*.f64 N/A

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

   6. Applied rewrites 67.0%

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

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

   1. Initial program 86.5%

      \[\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.9

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

   4. Applied rewrites 73.9%

      \[\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 81.1

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

   6. Applied rewrites 81.1%

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

Alternative 4: 88.3% 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(\cos \left(0.5 \cdot K\right) \cdot \left(\ell + \ell\right), 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 (* (cos (* 0.5 K)) (+ l 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((cos((0.5 * K)) * (l + 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(cos(Float64(0.5 * K)) * Float64(l + 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[(N[Cos[N[(0.5 * K), $MachinePrecision]], $MachinePrecision] * N[(l + l), $MachinePrecision]), $MachinePrecision] * J + 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.5%

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

   2. Taylor expanded in l around 0

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

      1. lower-*.f64 63.3

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

   4. Applied rewrites 63.3%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*l* N/A

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

      5. *-commutative N/A

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

   6. Applied rewrites 63.3%

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

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

   1. Initial program 86.5%

      \[\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.9

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

   4. Applied rewrites 73.9%

      \[\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 81.1

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

   6. Applied rewrites 81.1%

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

Alternative 5: 88.3% 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(\left(\ell + \ell\right) \cdot J, \cos \left(0.5 \cdot K\right), 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 (* (+ l l) J) (cos (* 0.5 K)) 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(((l + l) * J), cos((0.5 * K)), 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(Float64(l + l) * J), cos(Float64(0.5 * K)), 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[(l + l), $MachinePrecision] * J), $MachinePrecision] * N[Cos[N[(0.5 * K), $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.5%

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

   2. Taylor expanded in l around 0

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

      1. lower-*.f64 63.3

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

   4. Applied rewrites 63.3%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lower-fma.f64 63.3

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

      5. *-commutative N/A

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

      6. lower-*.f64 63.3

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

      7. lift-*.f64 N/A

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

      8. count-2-rev N/A

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

      9. lower-+.f64 63.3

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

      10. lower-+.f64 N/A

          \[\leadsto \mathsf{fma}\left(\left(\ell + \color{blue}{\ell}\right) \cdot J, \cos \mathsf{Rewrite=>}\left(lift-/.f64, \left(\frac{K}{2}\right)\right), U\right) \]

      11. lower-+.f64 N/A

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

      12. lower-+.f64 N/A

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

      13. lower-+.f64 N/A

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

      14. lower-+.f64 N/A

          \[\leadsto \mathsf{fma}\left(\left(\ell + \color{blue}{\ell}\right) \cdot J, \cos \mathsf{Rewrite<=}\left(lift-*.f64, \left(\frac{1}{2} \cdot K\right)\right), U\right) \]

   6. Applied rewrites 63.3%

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

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

   1. Initial program 86.5%

      \[\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.9

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

   4. Applied rewrites 73.9%

      \[\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 81.1

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

   6. Applied rewrites 81.1%

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

Alternative 6: 88.2% 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(\left(J + J\right) \cdot \sinh \ell, 1 + -0.125 \cdot {K}^{2}, 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 (* (+ J J) (sinh 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 = fma(((J + J) * sinh(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 = fma(Float64(Float64(J + J) * sinh(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 + J), $MachinePrecision] * N[Sinh[l], $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(-0.125 * N[Power[K, 2.0], $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.5%

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

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

      6. lower-fma.f64 N/A

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

   3. Applied rewrites 100.0%

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in K around 0

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

      1. lower-+.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-pow.f64 68.9

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

   8. Applied rewrites 68.9%

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

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

   1. Initial program 86.5%

      \[\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.9

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

   4. Applied rewrites 73.9%

      \[\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 81.1

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

   6. Applied rewrites 81.1%

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

Alternative 7: 88.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\cos \left(\frac{K}{2}\right) \leq -0.02:\\ \;\;\;\;\mathsf{fma}\left(J + J, \sinh \ell \cdot \mathsf{fma}\left(K \cdot K, -0.125, 1\right), 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 (+ J J) (* (sinh l) (fma (* K K) -0.125 1.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 = fma((J + J), (sinh(l) * fma((K * K), -0.125, 1.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 = fma(Float64(J + J), Float64(sinh(l) * fma(Float64(K * K), -0.125, 1.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[(J + J), $MachinePrecision] * N[(N[Sinh[l], $MachinePrecision] * N[(N[(K * K), $MachinePrecision] * -0.125 + 1.0), $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.5%

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

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

      6. lower-fma.f64 N/A

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

   3. Applied rewrites 100.0%

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in K around 0

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

      1. lower-+.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-pow.f64 68.9

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

   8. Applied rewrites 68.9%

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

      1. lift-fma.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-*l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-*.f64 68.7

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

      6. lift-+.f64 N/A

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

      7. +-commutative N/A

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

      8. lift-*.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-fma.f64 68.7

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

      11. lift-pow.f64 N/A

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

      12. unpow2 N/A

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

      13. lower-*.f64 68.7

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

   10. Applied rewrites 68.7%

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

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

   1. Initial program 86.5%

      \[\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.9

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

   4. Applied rewrites 73.9%

      \[\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 81.1

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

   6. Applied rewrites 81.1%

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

Alternative 8: 86.1% 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.5%

      \[\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.3

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

   4. Applied rewrites 63.3%

      \[\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 48.5

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

   7. Applied rewrites 48.5%

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

   9. Applied rewrites 48.5%

      \[\leadsto \color{blue}{\left(J + J\right) \cdot \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.5%

      \[\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.9

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

   4. Applied rewrites 73.9%

      \[\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 81.1

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

   6. Applied rewrites 81.1%

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

Alternative 9: 70.3% accurate, 2.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\ell \leq -0.00072:\\ \;\;\;\;\mathsf{fma}\left(1 - e^{-\ell}, J, U\right)\\ \mathbf{elif}\;\ell \leq 4.5 \cdot 10^{+53}:\\ \;\;\;\;2 \cdot \left(J \cdot \ell\right) + U\\ \mathbf{else}:\\ \;\;\;\;\left(J + J\right) \cdot \mathsf{fma}\left(\left(K \cdot K\right) \cdot \ell, -0.125, \ell\right) + U\\ \end{array} \end{array} \]

FPCore

(FPCore (J l K U)
 :precision binary64
 (if (<= l -0.00072)
   (fma (- 1.0 (exp (- l))) J U)
   (if (<= l 4.5e+53)
     (+ (* 2.0 (* J l)) U)
     (+ (* (+ J J) (fma (* (* K K) l) -0.125 l)) U))))

C

double code(double J, double l, double K, double U) {
	double tmp;
	if (l <= -0.00072) {
		tmp = fma((1.0 - exp(-l)), J, U);
	} else if (l <= 4.5e+53) {
		tmp = (2.0 * (J * l)) + U;
	} else {
		tmp = ((J + J) * fma(((K * K) * l), -0.125, l)) + U;
	}
	return tmp;
}

Julia

function code(J, l, K, U)
	tmp = 0.0
	if (l <= -0.00072)
		tmp = fma(Float64(1.0 - exp(Float64(-l))), J, U);
	elseif (l <= 4.5e+53)
		tmp = Float64(Float64(2.0 * Float64(J * l)) + U);
	else
		tmp = Float64(Float64(Float64(J + J) * fma(Float64(Float64(K * K) * l), -0.125, l)) + U);
	end
	return tmp
end

Wolfram

code[J_, l_, K_, U_] := If[LessEqual[l, -0.00072], N[(N[(1.0 - N[Exp[(-l)], $MachinePrecision]), $MachinePrecision] * J + U), $MachinePrecision], If[LessEqual[l, 4.5e+53], N[(N[(2.0 * N[(J * l), $MachinePrecision]), $MachinePrecision] + U), $MachinePrecision], N[(N[(N[(J + J), $MachinePrecision] * N[(N[(N[(K * K), $MachinePrecision] * l), $MachinePrecision] * -0.125 + l), $MachinePrecision]), $MachinePrecision] + U), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if l < -7.20000000000000045e-4

   1. Initial program 86.5%

      \[\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.9

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

   4. Applied rewrites 73.9%

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

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 55.6

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

   9. Applied rewrites 55.6%

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

   if -7.20000000000000045e-4 < l < 4.5000000000000002e53

   1. Initial program 86.5%

      \[\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.3

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

   4. Applied rewrites 63.3%

      \[\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 \color{blue}{\ell}\right) + U \]
   6. Step-by-step derivation

      1. lower-*.f64 53.5

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

   7. Applied rewrites 53.5%

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

   if 4.5000000000000002e53 < l

   1. Initial program 86.5%

      \[\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.3

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

   4. Applied rewrites 63.3%

      \[\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 48.5

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

   7. Applied rewrites 48.5%

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

   9. Applied rewrites 48.5%

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

Alternative 10: 67.6% accurate, 2.9× speedup

Math

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

FPCore

(FPCore (J l K U)
 :precision binary64
 (if (<= l -0.00072) (fma (- 1.0 (exp (- l))) J U) (+ (* 2.0 (* J l)) U)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if l < -7.20000000000000045e-4

   1. Initial program 86.5%

      \[\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.9

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

   4. Applied rewrites 73.9%

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

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 55.6

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

   9. Applied rewrites 55.6%

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

   if -7.20000000000000045e-4 < l

   1. Initial program 86.5%

      \[\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.3

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

   4. Applied rewrites 63.3%

      \[\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 \color{blue}{\ell}\right) + U \]
   6. Step-by-step derivation

      1. lower-*.f64 53.5

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

   7. Applied rewrites 53.5%

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

Alternative 11: 54.9% accurate, 1.6× speedup

Math

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

FPCore

(FPCore (J l K U)
 :precision binary64
 (if (<= (* J (- (exp l) (exp (- l)))) (- INFINITY))
   (* J (fma 2.0 l (/ U J)))
   (+ (* 2.0 (* J l)) U)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 86.5%

      \[\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.9

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

   4. Applied rewrites 73.9%

      \[\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 57.2

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

   7. Applied rewrites 57.2%

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

   8. Taylor expanded in l around 0

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 50.9

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

   10. Applied rewrites 50.9%

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

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

   1. Initial program 86.5%

      \[\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.3

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

   4. Applied rewrites 63.3%

      \[\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 \color{blue}{\ell}\right) + U \]
   6. Step-by-step derivation

      1. lower-*.f64 53.5

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

   7. Applied rewrites 53.5%

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

Alternative 12: 53.5% accurate, 7.1× speedup

Math

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

FPCore

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

C

double code(double J, double l, double K, double U) {
	return (2.0 * (J * l)) + 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 = (2.0d0 * (j * l)) + u
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 86.5%

   \[\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.3

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

4. Applied rewrites 63.3%

   \[\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 \color{blue}{\ell}\right) + U \]
6. Step-by-step derivation

   1. lower-*.f64 53.5

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

7. Applied rewrites 53.5%

   \[\leadsto 2 \cdot \left(J \cdot \color{blue}{\ell}\right) + U \]
8. Add Preprocessing

Alternative 13: 53.4% 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.5%

   \[\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.9

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

4. Applied rewrites 73.9%

   \[\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 81.1

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

6. Applied rewrites 81.1%

   \[\leadsto \color{blue}{\mathsf{fma}\left(J + J, \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.4%

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

Alternative 14: 37.6% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;J \cdot \left(e^{\ell} - e^{-\ell}\right) \leq -\infty:\\ \;\;\;\;J \cdot \frac{U}{J}\\ \mathbf{else}:\\ \;\;\;\;U\\ \end{array} \end{array} \]

FPCore

(FPCore (J l K U)
 :precision binary64
 (if (<= (* J (- (exp l) (exp (- l)))) (- INFINITY)) (* J (/ U J)) U))

C

double code(double J, double l, double K, double U) {
	double tmp;
	if ((J * (exp(l) - exp(-l))) <= -((double) INFINITY)) {
		tmp = J * (U / J);
	} else {
		tmp = U;
	}
	return tmp;
}

Java

public static double code(double J, double l, double K, double U) {
	double tmp;
	if ((J * (Math.exp(l) - Math.exp(-l))) <= -Double.POSITIVE_INFINITY) {
		tmp = J * (U / J);
	} else {
		tmp = U;
	}
	return tmp;
}

Python

def code(J, l, K, U):
	tmp = 0
	if (J * (math.exp(l) - math.exp(-l))) <= -math.inf:
		tmp = J * (U / J)
	else:
		tmp = U
	return tmp

Julia

function code(J, l, K, U)
	tmp = 0.0
	if (Float64(J * Float64(exp(l) - exp(Float64(-l)))) <= Float64(-Inf))
		tmp = Float64(J * Float64(U / J));
	else
		tmp = U;
	end
	return tmp
end

MATLAB

function tmp_2 = code(J, l, K, U)
	tmp = 0.0;
	if ((J * (exp(l) - exp(-l))) <= -Inf)
		tmp = J * (U / J);
	else
		tmp = U;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 86.5%

      \[\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.9

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

   4. Applied rewrites 73.9%

      \[\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 57.2

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

   7. Applied rewrites 57.2%

      \[\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.6

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

   10. Applied rewrites 33.6%

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

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

   1. Initial program 86.5%

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

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

Alternative 15: 36.2% 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.5%

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

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

Reproduce

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