math.cos on complex, real part

Percentage Accurate: 100.0% → 100.0%

Time: 4.4s

Alternatives: 11

Speedup: 1.4×

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

Specification

Math

\[\begin{array}{l} \\ \left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (* (* 0.5 (cos re)) (+ (exp (- im)) (exp im))))

C

double code(double re, double im) {
	return (0.5 * cos(re)) * (exp(-im) + exp(im));
}

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(re, im)
use fmin_fmax_functions
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = (0.5d0 * cos(re)) * (exp(-im) + exp(im))
end function

Java

public static double code(double re, double im) {
	return (0.5 * Math.cos(re)) * (Math.exp(-im) + Math.exp(im));
}

Python

def code(re, im):
	return (0.5 * math.cos(re)) * (math.exp(-im) + math.exp(im))

Julia

function code(re, im)
	return Float64(Float64(0.5 * cos(re)) * Float64(exp(Float64(-im)) + exp(im)))
end

MATLAB

function tmp = code(re, im)
	tmp = (0.5 * cos(re)) * (exp(-im) + exp(im));
end

Wolfram

code[re_, im_] := N[(N[(0.5 * N[Cos[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (* (* 0.5 (cos re)) (+ (exp (- im)) (exp im))))

C

double code(double re, double im) {
	return (0.5 * cos(re)) * (exp(-im) + exp(im));
}

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(re, im)
use fmin_fmax_functions
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = (0.5d0 * cos(re)) * (exp(-im) + exp(im))
end function

Java

public static double code(double re, double im) {
	return (0.5 * Math.cos(re)) * (Math.exp(-im) + Math.exp(im));
}

Python

def code(re, im):
	return (0.5 * math.cos(re)) * (math.exp(-im) + math.exp(im))

Julia

function code(re, im)
	return Float64(Float64(0.5 * cos(re)) * Float64(exp(Float64(-im)) + exp(im)))
end

MATLAB

function tmp = code(re, im)
	tmp = (0.5 * cos(re)) * (exp(-im) + exp(im));
end

Wolfram

code[re_, im_] := N[(N[(0.5 * N[Cos[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 100.0% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \cosh im \cdot \cos re \end{array} \]

FPCore

(FPCore (re im) :precision binary64 (* (cosh im) (cos re)))

C

double code(double re, double im) {
	return cosh(im) * cos(re);
}

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(re, im)
use fmin_fmax_functions
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = cosh(im) * cos(re)
end function

Java

public static double code(double re, double im) {
	return Math.cosh(im) * Math.cos(re);
}

Python

def code(re, im):
	return math.cosh(im) * math.cos(re)

Julia

function code(re, im)
	return Float64(cosh(im) * cos(re))
end

MATLAB

function tmp = code(re, im)
	tmp = cosh(im) * cos(re);
end

Wolfram

code[re_, im_] := N[(N[Cosh[im], $MachinePrecision] * N[Cos[re], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]
2. Step-by-step derivation

   1. lift-*.f64 N/A

      \[\leadsto \color{blue}{\left(\frac{1}{2} \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right)} \]

   2. lift-*.f64 N/A

      \[\leadsto \color{blue}{\left(\frac{1}{2} \cdot \cos re\right)} \cdot \left(e^{-im} + e^{im}\right) \]

   3. lift-cos.f64 N/A

      \[\leadsto \left(\frac{1}{2} \cdot \color{blue}{\cos re}\right) \cdot \left(e^{-im} + e^{im}\right) \]

   4. lift-+.f64 N/A

      \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \color{blue}{\left(e^{-im} + e^{im}\right)} \]

   5. lift-exp.f64 N/A

      \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \left(\color{blue}{e^{-im}} + e^{im}\right) \]

   6. lift-neg.f64 N/A

      \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \left(e^{\color{blue}{\mathsf{neg}\left(im\right)}} + e^{im}\right) \]

   7. lift-exp.f64 N/A

      \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \left(e^{\mathsf{neg}\left(im\right)} + \color{blue}{e^{im}}\right) \]

   8. +-commutative N/A

      \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \color{blue}{\left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right)} \]

   9. *-commutative N/A

      \[\leadsto \color{blue}{\left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right) \cdot \left(\frac{1}{2} \cdot \cos re\right)} \]

   10. associate-*r* N/A

       \[\leadsto \color{blue}{\left(\left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right) \cdot \frac{1}{2}\right) \cdot \cos re} \]

   11. *-commutative N/A

       \[\leadsto \color{blue}{\left(\frac{1}{2} \cdot \left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right)\right)} \cdot \cos re \]

   12. lower-*.f64 N/A

       \[\leadsto \color{blue}{\left(\frac{1}{2} \cdot \left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right)\right) \cdot \cos re} \]

   13. cosh-undef N/A

       \[\leadsto \left(\frac{1}{2} \cdot \color{blue}{\left(2 \cdot \cosh im\right)}\right) \cdot \cos re \]

   14. associate-*r* N/A

       \[\leadsto \color{blue}{\left(\left(\frac{1}{2} \cdot 2\right) \cdot \cosh im\right)} \cdot \cos re \]

   15. metadata-eval N/A

       \[\leadsto \left(\color{blue}{1} \cdot \cosh im\right) \cdot \cos re \]

   16. lower-*.f64 N/A

       \[\leadsto \color{blue}{\left(1 \cdot \cosh im\right)} \cdot \cos re \]

   17. lower-cosh.f64 N/A

       \[\leadsto \left(1 \cdot \color{blue}{\cosh im}\right) \cdot \cos re \]

   18. lift-cos.f64 100.0

       \[\leadsto \left(1 \cdot \cosh im\right) \cdot \color{blue}{\cos re} \]

3. Applied rewrites 100.0%

   \[\leadsto \color{blue}{\left(1 \cdot \cosh im\right) \cdot \cos re} \]
4. Step-by-step derivation

   1. lift-*.f64 N/A

      \[\leadsto \color{blue}{\left(1 \cdot \cosh im\right)} \cdot \cos re \]

   2. lift-cosh.f64 N/A

      \[\leadsto \left(1 \cdot \color{blue}{\cosh im}\right) \cdot \cos re \]

   3. *-lft-identity N/A

      \[\leadsto \color{blue}{\cosh im} \cdot \cos re \]

   4. lift-cosh.f64 100.0

      \[\leadsto \color{blue}{\cosh im} \cdot \cos re \]

5. Applied rewrites 100.0%

   \[\leadsto \color{blue}{\cosh im} \cdot \cos re \]
6. Add Preprocessing

Alternative 2: 99.6% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 0.5 \cdot \cos re\\ t_1 := t\_0 \cdot \left(e^{-im} + e^{im}\right)\\ \mathbf{if}\;t\_1 \leq -\infty:\\ \;\;\;\;\cosh im \cdot \left(\left(re \cdot re\right) \cdot -0.5\right)\\ \mathbf{elif}\;t\_1 \leq 0.999999977542926:\\ \;\;\;\;t\_0 \cdot \mathsf{fma}\left(im, im, 2\right)\\ \mathbf{else}:\\ \;\;\;\;\cosh im\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* 0.5 (cos re))) (t_1 (* t_0 (+ (exp (- im)) (exp im)))))
   (if (<= t_1 (- INFINITY))
     (* (cosh im) (* (* re re) -0.5))
     (if (<= t_1 0.999999977542926) (* t_0 (fma im im 2.0)) (cosh im)))))

C

double code(double re, double im) {
	double t_0 = 0.5 * cos(re);
	double t_1 = t_0 * (exp(-im) + exp(im));
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = cosh(im) * ((re * re) * -0.5);
	} else if (t_1 <= 0.999999977542926) {
		tmp = t_0 * fma(im, im, 2.0);
	} else {
		tmp = cosh(im);
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(0.5 * cos(re))
	t_1 = Float64(t_0 * Float64(exp(Float64(-im)) + exp(im)))
	tmp = 0.0
	if (t_1 <= Float64(-Inf))
		tmp = Float64(cosh(im) * Float64(Float64(re * re) * -0.5));
	elseif (t_1 <= 0.999999977542926)
		tmp = Float64(t_0 * fma(im, im, 2.0));
	else
		tmp = cosh(im);
	end
	return tmp
end

Wolfram

code[re_, im_] := Block[{t$95$0 = N[(0.5 * N[Cos[re], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(N[Cosh[im], $MachinePrecision] * N[(N[(re * re), $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 0.999999977542926], N[(t$95$0 * N[(im * im + 2.0), $MachinePrecision]), $MachinePrecision], N[Cosh[im], $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im))) < -inf.0

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]
   2. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \color{blue}{\left(\frac{1}{2} \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right)} \]

      2. lift-*.f64 N/A

         \[\leadsto \color{blue}{\left(\frac{1}{2} \cdot \cos re\right)} \cdot \left(e^{-im} + e^{im}\right) \]

      3. lift-cos.f64 N/A

         \[\leadsto \left(\frac{1}{2} \cdot \color{blue}{\cos re}\right) \cdot \left(e^{-im} + e^{im}\right) \]

      4. lift-+.f64 N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \color{blue}{\left(e^{-im} + e^{im}\right)} \]

      5. lift-exp.f64 N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \left(\color{blue}{e^{-im}} + e^{im}\right) \]

      6. lift-neg.f64 N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \left(e^{\color{blue}{\mathsf{neg}\left(im\right)}} + e^{im}\right) \]

      7. lift-exp.f64 N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \left(e^{\mathsf{neg}\left(im\right)} + \color{blue}{e^{im}}\right) \]

      8. +-commutative N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \color{blue}{\left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right)} \]

      9. *-commutative N/A

         \[\leadsto \color{blue}{\left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right) \cdot \left(\frac{1}{2} \cdot \cos re\right)} \]

      10. associate-*r* N/A

          \[\leadsto \color{blue}{\left(\left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right) \cdot \frac{1}{2}\right) \cdot \cos re} \]

      11. *-commutative N/A

          \[\leadsto \color{blue}{\left(\frac{1}{2} \cdot \left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right)\right)} \cdot \cos re \]

      12. lower-*.f64 N/A

          \[\leadsto \color{blue}{\left(\frac{1}{2} \cdot \left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right)\right) \cdot \cos re} \]

      13. cosh-undef N/A

          \[\leadsto \left(\frac{1}{2} \cdot \color{blue}{\left(2 \cdot \cosh im\right)}\right) \cdot \cos re \]

      14. associate-*r* N/A

          \[\leadsto \color{blue}{\left(\left(\frac{1}{2} \cdot 2\right) \cdot \cosh im\right)} \cdot \cos re \]

      15. metadata-eval N/A

          \[\leadsto \left(\color{blue}{1} \cdot \cosh im\right) \cdot \cos re \]

      16. lower-*.f64 N/A

          \[\leadsto \color{blue}{\left(1 \cdot \cosh im\right)} \cdot \cos re \]

      17. lower-cosh.f64 N/A

          \[\leadsto \left(1 \cdot \color{blue}{\cosh im}\right) \cdot \cos re \]

      18. lift-cos.f64 100.0

          \[\leadsto \left(1 \cdot \cosh im\right) \cdot \color{blue}{\cos re} \]

   3. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\left(1 \cdot \cosh im\right) \cdot \cos re} \]
   4. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \color{blue}{\left(1 \cdot \cosh im\right)} \cdot \cos re \]

      2. lift-cosh.f64 N/A

         \[\leadsto \left(1 \cdot \color{blue}{\cosh im}\right) \cdot \cos re \]

      3. *-lft-identity N/A

         \[\leadsto \color{blue}{\cosh im} \cdot \cos re \]

      4. lift-cosh.f64 100.0

         \[\leadsto \color{blue}{\cosh im} \cdot \cos re \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\cosh im} \cdot \cos re \]

   6. Taylor expanded in re around 0

      \[\leadsto \cosh im \cdot \color{blue}{\left(1 + \frac{-1}{2} \cdot {re}^{2}\right)} \]
   7. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \cosh im \cdot \left(\frac{-1}{2} \cdot {re}^{2} + \color{blue}{1}\right) \]

      2. lower-fma.f64 N/A

         \[\leadsto \cosh im \cdot \mathsf{fma}\left(\frac{-1}{2}, \color{blue}{{re}^{2}}, 1\right) \]

      3. pow2 N/A

         \[\leadsto \cosh im \cdot \mathsf{fma}\left(\frac{-1}{2}, re \cdot \color{blue}{re}, 1\right) \]

      4. lift-*.f64 100.0

         \[\leadsto \cosh im \cdot \mathsf{fma}\left(-0.5, re \cdot \color{blue}{re}, 1\right) \]

   8. Applied rewrites 100.0%

      \[\leadsto \cosh im \cdot \color{blue}{\mathsf{fma}\left(-0.5, re \cdot re, 1\right)} \]

   9. Taylor expanded in re around inf

      \[\leadsto \cosh im \cdot \left(\frac{-1}{2} \cdot \color{blue}{{re}^{2}}\right) \]
   10. Step-by-step derivation

       1. *-commutative N/A

          \[\leadsto \cosh im \cdot \left({re}^{2} \cdot \frac{-1}{2}\right) \]

       2. lower-*.f64 N/A

          \[\leadsto \cosh im \cdot \left({re}^{2} \cdot \frac{-1}{2}\right) \]

       3. pow2 N/A

          \[\leadsto \cosh im \cdot \left(\left(re \cdot re\right) \cdot \frac{-1}{2}\right) \]

       4. lift-*.f64 100.0

          \[\leadsto \cosh im \cdot \left(\left(re \cdot re\right) \cdot -0.5\right) \]

   11. Applied rewrites 100.0%

       \[\leadsto \cosh im \cdot \left(\left(re \cdot re\right) \cdot \color{blue}{-0.5}\right) \]

   if -inf.0 < (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im))) < 0.99999997754292602

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]

   2. Taylor expanded in im around 0

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

      1. +-commutative N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \left({im}^{2} + \color{blue}{2}\right) \]

      2. unpow2 N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \left(im \cdot im + 2\right) \]

      3. lower-fma.f64 99.2

         \[\leadsto \left(0.5 \cdot \cos re\right) \cdot \mathsf{fma}\left(im, \color{blue}{im}, 2\right) \]

   4. Applied rewrites 99.2%

      \[\leadsto \left(0.5 \cdot \cos re\right) \cdot \color{blue}{\mathsf{fma}\left(im, im, 2\right)} \]

   if 0.99999997754292602 < (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im)))

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]

   2. Taylor expanded in re around 0

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

      1. cosh-undef N/A

         \[\leadsto \frac{1}{2} \cdot \left(2 \cdot \color{blue}{\cosh im}\right) \]

      2. associate-*r* N/A

         \[\leadsto \left(\frac{1}{2} \cdot 2\right) \cdot \color{blue}{\cosh im} \]

      3. metadata-eval N/A

         \[\leadsto 1 \cdot \cosh \color{blue}{im} \]

      4. lower-*.f64 N/A

         \[\leadsto 1 \cdot \color{blue}{\cosh im} \]

      5. lower-cosh.f64 99.7

         \[\leadsto 1 \cdot \cosh im \]

   4. Applied rewrites 99.7%

      \[\leadsto \color{blue}{1 \cdot \cosh im} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto 1 \cdot \color{blue}{\cosh im} \]

      2. lift-cosh.f64 N/A

         \[\leadsto 1 \cdot \cosh im \]

      3. *-lft-identity N/A

         \[\leadsto \cosh im \]

      4. lift-cosh.f64 99.7

         \[\leadsto \cosh im \]

   6. Applied rewrites 99.7%

      \[\leadsto \cosh im \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 3: 99.5% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right)\\ \mathbf{if}\;t\_0 \leq -\infty:\\ \;\;\;\;\cosh im \cdot \left(\left(re \cdot re\right) \cdot -0.5\right)\\ \mathbf{elif}\;t\_0 \leq 0.999999977542926:\\ \;\;\;\;\cos re\\ \mathbf{else}:\\ \;\;\;\;\cosh im\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (* 0.5 (cos re)) (+ (exp (- im)) (exp im)))))
   (if (<= t_0 (- INFINITY))
     (* (cosh im) (* (* re re) -0.5))
     (if (<= t_0 0.999999977542926) (cos re) (cosh im)))))

C

double code(double re, double im) {
	double t_0 = (0.5 * cos(re)) * (exp(-im) + exp(im));
	double tmp;
	if (t_0 <= -((double) INFINITY)) {
		tmp = cosh(im) * ((re * re) * -0.5);
	} else if (t_0 <= 0.999999977542926) {
		tmp = cos(re);
	} else {
		tmp = cosh(im);
	}
	return tmp;
}

Java

public static double code(double re, double im) {
	double t_0 = (0.5 * Math.cos(re)) * (Math.exp(-im) + Math.exp(im));
	double tmp;
	if (t_0 <= -Double.POSITIVE_INFINITY) {
		tmp = Math.cosh(im) * ((re * re) * -0.5);
	} else if (t_0 <= 0.999999977542926) {
		tmp = Math.cos(re);
	} else {
		tmp = Math.cosh(im);
	}
	return tmp;
}

Python

def code(re, im):
	t_0 = (0.5 * math.cos(re)) * (math.exp(-im) + math.exp(im))
	tmp = 0
	if t_0 <= -math.inf:
		tmp = math.cosh(im) * ((re * re) * -0.5)
	elif t_0 <= 0.999999977542926:
		tmp = math.cos(re)
	else:
		tmp = math.cosh(im)
	return tmp

Julia

function code(re, im)
	t_0 = Float64(Float64(0.5 * cos(re)) * Float64(exp(Float64(-im)) + exp(im)))
	tmp = 0.0
	if (t_0 <= Float64(-Inf))
		tmp = Float64(cosh(im) * Float64(Float64(re * re) * -0.5));
	elseif (t_0 <= 0.999999977542926)
		tmp = cos(re);
	else
		tmp = cosh(im);
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	t_0 = (0.5 * cos(re)) * (exp(-im) + exp(im));
	tmp = 0.0;
	if (t_0 <= -Inf)
		tmp = cosh(im) * ((re * re) * -0.5);
	elseif (t_0 <= 0.999999977542926)
		tmp = cos(re);
	else
		tmp = cosh(im);
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := Block[{t$95$0 = N[(N[(0.5 * N[Cos[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, (-Infinity)], N[(N[Cosh[im], $MachinePrecision] * N[(N[(re * re), $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 0.999999977542926], N[Cos[re], $MachinePrecision], N[Cosh[im], $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im))) < -inf.0

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]
   2. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \color{blue}{\left(\frac{1}{2} \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right)} \]

      2. lift-*.f64 N/A

         \[\leadsto \color{blue}{\left(\frac{1}{2} \cdot \cos re\right)} \cdot \left(e^{-im} + e^{im}\right) \]

      3. lift-cos.f64 N/A

         \[\leadsto \left(\frac{1}{2} \cdot \color{blue}{\cos re}\right) \cdot \left(e^{-im} + e^{im}\right) \]

      4. lift-+.f64 N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \color{blue}{\left(e^{-im} + e^{im}\right)} \]

      5. lift-exp.f64 N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \left(\color{blue}{e^{-im}} + e^{im}\right) \]

      6. lift-neg.f64 N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \left(e^{\color{blue}{\mathsf{neg}\left(im\right)}} + e^{im}\right) \]

      7. lift-exp.f64 N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \left(e^{\mathsf{neg}\left(im\right)} + \color{blue}{e^{im}}\right) \]

      8. +-commutative N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \color{blue}{\left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right)} \]

      9. *-commutative N/A

         \[\leadsto \color{blue}{\left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right) \cdot \left(\frac{1}{2} \cdot \cos re\right)} \]

      10. associate-*r* N/A

          \[\leadsto \color{blue}{\left(\left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right) \cdot \frac{1}{2}\right) \cdot \cos re} \]

      11. *-commutative N/A

          \[\leadsto \color{blue}{\left(\frac{1}{2} \cdot \left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right)\right)} \cdot \cos re \]

      12. lower-*.f64 N/A

          \[\leadsto \color{blue}{\left(\frac{1}{2} \cdot \left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right)\right) \cdot \cos re} \]

      13. cosh-undef N/A

          \[\leadsto \left(\frac{1}{2} \cdot \color{blue}{\left(2 \cdot \cosh im\right)}\right) \cdot \cos re \]

      14. associate-*r* N/A

          \[\leadsto \color{blue}{\left(\left(\frac{1}{2} \cdot 2\right) \cdot \cosh im\right)} \cdot \cos re \]

      15. metadata-eval N/A

          \[\leadsto \left(\color{blue}{1} \cdot \cosh im\right) \cdot \cos re \]

      16. lower-*.f64 N/A

          \[\leadsto \color{blue}{\left(1 \cdot \cosh im\right)} \cdot \cos re \]

      17. lower-cosh.f64 N/A

          \[\leadsto \left(1 \cdot \color{blue}{\cosh im}\right) \cdot \cos re \]

      18. lift-cos.f64 100.0

          \[\leadsto \left(1 \cdot \cosh im\right) \cdot \color{blue}{\cos re} \]

   3. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\left(1 \cdot \cosh im\right) \cdot \cos re} \]
   4. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \color{blue}{\left(1 \cdot \cosh im\right)} \cdot \cos re \]

      2. lift-cosh.f64 N/A

         \[\leadsto \left(1 \cdot \color{blue}{\cosh im}\right) \cdot \cos re \]

      3. *-lft-identity N/A

         \[\leadsto \color{blue}{\cosh im} \cdot \cos re \]

      4. lift-cosh.f64 100.0

         \[\leadsto \color{blue}{\cosh im} \cdot \cos re \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\cosh im} \cdot \cos re \]

   6. Taylor expanded in re around 0

      \[\leadsto \cosh im \cdot \color{blue}{\left(1 + \frac{-1}{2} \cdot {re}^{2}\right)} \]
   7. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \cosh im \cdot \left(\frac{-1}{2} \cdot {re}^{2} + \color{blue}{1}\right) \]

      2. lower-fma.f64 N/A

         \[\leadsto \cosh im \cdot \mathsf{fma}\left(\frac{-1}{2}, \color{blue}{{re}^{2}}, 1\right) \]

      3. pow2 N/A

         \[\leadsto \cosh im \cdot \mathsf{fma}\left(\frac{-1}{2}, re \cdot \color{blue}{re}, 1\right) \]

      4. lift-*.f64 100.0

         \[\leadsto \cosh im \cdot \mathsf{fma}\left(-0.5, re \cdot \color{blue}{re}, 1\right) \]

   8. Applied rewrites 100.0%

      \[\leadsto \cosh im \cdot \color{blue}{\mathsf{fma}\left(-0.5, re \cdot re, 1\right)} \]

   9. Taylor expanded in re around inf

      \[\leadsto \cosh im \cdot \left(\frac{-1}{2} \cdot \color{blue}{{re}^{2}}\right) \]
   10. Step-by-step derivation

       1. *-commutative N/A

          \[\leadsto \cosh im \cdot \left({re}^{2} \cdot \frac{-1}{2}\right) \]

       2. lower-*.f64 N/A

          \[\leadsto \cosh im \cdot \left({re}^{2} \cdot \frac{-1}{2}\right) \]

       3. pow2 N/A

          \[\leadsto \cosh im \cdot \left(\left(re \cdot re\right) \cdot \frac{-1}{2}\right) \]

       4. lift-*.f64 100.0

          \[\leadsto \cosh im \cdot \left(\left(re \cdot re\right) \cdot -0.5\right) \]

   11. Applied rewrites 100.0%

       \[\leadsto \cosh im \cdot \left(\left(re \cdot re\right) \cdot \color{blue}{-0.5}\right) \]

   if -inf.0 < (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im))) < 0.99999997754292602

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]

   2. Taylor expanded in im around 0

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

      1. lift-cos.f64 98.6

         \[\leadsto \cos re \]

   4. Applied rewrites 98.6%

      \[\leadsto \color{blue}{\cos re} \]

   if 0.99999997754292602 < (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im)))

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]

   2. Taylor expanded in re around 0

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

      1. cosh-undef N/A

         \[\leadsto \frac{1}{2} \cdot \left(2 \cdot \color{blue}{\cosh im}\right) \]

      2. associate-*r* N/A

         \[\leadsto \left(\frac{1}{2} \cdot 2\right) \cdot \color{blue}{\cosh im} \]

      3. metadata-eval N/A

         \[\leadsto 1 \cdot \cosh \color{blue}{im} \]

      4. lower-*.f64 N/A

         \[\leadsto 1 \cdot \color{blue}{\cosh im} \]

      5. lower-cosh.f64 99.7

         \[\leadsto 1 \cdot \cosh im \]

   4. Applied rewrites 99.7%

      \[\leadsto \color{blue}{1 \cdot \cosh im} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto 1 \cdot \color{blue}{\cosh im} \]

      2. lift-cosh.f64 N/A

         \[\leadsto 1 \cdot \cosh im \]

      3. *-lft-identity N/A

         \[\leadsto \cosh im \]

      4. lift-cosh.f64 99.7

         \[\leadsto \cosh im \]

   6. Applied rewrites 99.7%

      \[\leadsto \cosh im \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 4: 77.8% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;0.5 \cdot \cos re \leq -0.01:\\ \;\;\;\;\cosh im \cdot \left(\left(re \cdot re\right) \cdot -0.5\right)\\ \mathbf{else}:\\ \;\;\;\;\cosh im\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* 0.5 (cos re)) -0.01) (* (cosh im) (* (* re re) -0.5)) (cosh im)))

C

double code(double re, double im) {
	double tmp;
	if ((0.5 * cos(re)) <= -0.01) {
		tmp = cosh(im) * ((re * re) * -0.5);
	} else {
		tmp = cosh(im);
	}
	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(re, im)
use fmin_fmax_functions
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    real(8) :: tmp
    if ((0.5d0 * cos(re)) <= (-0.01d0)) then
        tmp = cosh(im) * ((re * re) * (-0.5d0))
    else
        tmp = cosh(im)
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if ((0.5 * Math.cos(re)) <= -0.01) {
		tmp = Math.cosh(im) * ((re * re) * -0.5);
	} else {
		tmp = Math.cosh(im);
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if (0.5 * math.cos(re)) <= -0.01:
		tmp = math.cosh(im) * ((re * re) * -0.5)
	else:
		tmp = math.cosh(im)
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if (Float64(0.5 * cos(re)) <= -0.01)
		tmp = Float64(cosh(im) * Float64(Float64(re * re) * -0.5));
	else
		tmp = cosh(im);
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if ((0.5 * cos(re)) <= -0.01)
		tmp = cosh(im) * ((re * re) * -0.5);
	else
		tmp = cosh(im);
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[N[(0.5 * N[Cos[re], $MachinePrecision]), $MachinePrecision], -0.01], N[(N[Cosh[im], $MachinePrecision] * N[(N[(re * re), $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision], N[Cosh[im], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) < -0.0100000000000000002

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]
   2. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \color{blue}{\left(\frac{1}{2} \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right)} \]

      2. lift-*.f64 N/A

         \[\leadsto \color{blue}{\left(\frac{1}{2} \cdot \cos re\right)} \cdot \left(e^{-im} + e^{im}\right) \]

      3. lift-cos.f64 N/A

         \[\leadsto \left(\frac{1}{2} \cdot \color{blue}{\cos re}\right) \cdot \left(e^{-im} + e^{im}\right) \]

      4. lift-+.f64 N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \color{blue}{\left(e^{-im} + e^{im}\right)} \]

      5. lift-exp.f64 N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \left(\color{blue}{e^{-im}} + e^{im}\right) \]

      6. lift-neg.f64 N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \left(e^{\color{blue}{\mathsf{neg}\left(im\right)}} + e^{im}\right) \]

      7. lift-exp.f64 N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \left(e^{\mathsf{neg}\left(im\right)} + \color{blue}{e^{im}}\right) \]

      8. +-commutative N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \color{blue}{\left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right)} \]

      9. *-commutative N/A

         \[\leadsto \color{blue}{\left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right) \cdot \left(\frac{1}{2} \cdot \cos re\right)} \]

      10. associate-*r* N/A

          \[\leadsto \color{blue}{\left(\left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right) \cdot \frac{1}{2}\right) \cdot \cos re} \]

      11. *-commutative N/A

          \[\leadsto \color{blue}{\left(\frac{1}{2} \cdot \left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right)\right)} \cdot \cos re \]

      12. lower-*.f64 N/A

          \[\leadsto \color{blue}{\left(\frac{1}{2} \cdot \left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right)\right) \cdot \cos re} \]

      13. cosh-undef N/A

          \[\leadsto \left(\frac{1}{2} \cdot \color{blue}{\left(2 \cdot \cosh im\right)}\right) \cdot \cos re \]

      14. associate-*r* N/A

          \[\leadsto \color{blue}{\left(\left(\frac{1}{2} \cdot 2\right) \cdot \cosh im\right)} \cdot \cos re \]

      15. metadata-eval N/A

          \[\leadsto \left(\color{blue}{1} \cdot \cosh im\right) \cdot \cos re \]

      16. lower-*.f64 N/A

          \[\leadsto \color{blue}{\left(1 \cdot \cosh im\right)} \cdot \cos re \]

      17. lower-cosh.f64 N/A

          \[\leadsto \left(1 \cdot \color{blue}{\cosh im}\right) \cdot \cos re \]

      18. lift-cos.f64 100.0

          \[\leadsto \left(1 \cdot \cosh im\right) \cdot \color{blue}{\cos re} \]

   3. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\left(1 \cdot \cosh im\right) \cdot \cos re} \]
   4. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \color{blue}{\left(1 \cdot \cosh im\right)} \cdot \cos re \]

      2. lift-cosh.f64 N/A

         \[\leadsto \left(1 \cdot \color{blue}{\cosh im}\right) \cdot \cos re \]

      3. *-lft-identity N/A

         \[\leadsto \color{blue}{\cosh im} \cdot \cos re \]

      4. lift-cosh.f64 100.0

         \[\leadsto \color{blue}{\cosh im} \cdot \cos re \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\cosh im} \cdot \cos re \]

   6. Taylor expanded in re around 0

      \[\leadsto \cosh im \cdot \color{blue}{\left(1 + \frac{-1}{2} \cdot {re}^{2}\right)} \]
   7. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \cosh im \cdot \left(\frac{-1}{2} \cdot {re}^{2} + \color{blue}{1}\right) \]

      2. lower-fma.f64 N/A

         \[\leadsto \cosh im \cdot \mathsf{fma}\left(\frac{-1}{2}, \color{blue}{{re}^{2}}, 1\right) \]

      3. pow2 N/A

         \[\leadsto \cosh im \cdot \mathsf{fma}\left(\frac{-1}{2}, re \cdot \color{blue}{re}, 1\right) \]

      4. lift-*.f64 53.4

         \[\leadsto \cosh im \cdot \mathsf{fma}\left(-0.5, re \cdot \color{blue}{re}, 1\right) \]

   8. Applied rewrites 53.4%

      \[\leadsto \cosh im \cdot \color{blue}{\mathsf{fma}\left(-0.5, re \cdot re, 1\right)} \]

   9. Taylor expanded in re around inf

      \[\leadsto \cosh im \cdot \left(\frac{-1}{2} \cdot \color{blue}{{re}^{2}}\right) \]
   10. Step-by-step derivation

       1. *-commutative N/A

          \[\leadsto \cosh im \cdot \left({re}^{2} \cdot \frac{-1}{2}\right) \]

       2. lower-*.f64 N/A

          \[\leadsto \cosh im \cdot \left({re}^{2} \cdot \frac{-1}{2}\right) \]

       3. pow2 N/A

          \[\leadsto \cosh im \cdot \left(\left(re \cdot re\right) \cdot \frac{-1}{2}\right) \]

       4. lift-*.f64 53.4

          \[\leadsto \cosh im \cdot \left(\left(re \cdot re\right) \cdot -0.5\right) \]

   11. Applied rewrites 53.4%

       \[\leadsto \cosh im \cdot \left(\left(re \cdot re\right) \cdot \color{blue}{-0.5}\right) \]

   if -0.0100000000000000002 < (*.f64 #s(literal 1/2 binary64) (cos.f64 re))

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]

   2. Taylor expanded in re around 0

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

      1. cosh-undef N/A

         \[\leadsto \frac{1}{2} \cdot \left(2 \cdot \color{blue}{\cosh im}\right) \]

      2. associate-*r* N/A

         \[\leadsto \left(\frac{1}{2} \cdot 2\right) \cdot \color{blue}{\cosh im} \]

      3. metadata-eval N/A

         \[\leadsto 1 \cdot \cosh \color{blue}{im} \]

      4. lower-*.f64 N/A

         \[\leadsto 1 \cdot \color{blue}{\cosh im} \]

      5. lower-cosh.f64 85.9

         \[\leadsto 1 \cdot \cosh im \]

   4. Applied rewrites 85.9%

      \[\leadsto \color{blue}{1 \cdot \cosh im} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto 1 \cdot \color{blue}{\cosh im} \]

      2. lift-cosh.f64 N/A

         \[\leadsto 1 \cdot \cosh im \]

      3. *-lft-identity N/A

         \[\leadsto \cosh im \]

      4. lift-cosh.f64 85.9

         \[\leadsto \cosh im \]

   6. Applied rewrites 85.9%

      \[\leadsto \cosh im \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 76.5% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;0.5 \cdot \cos re \leq -0.01:\\ \;\;\;\;\mathsf{fma}\left(re \cdot re, -0.25, 0.5\right) \cdot \mathsf{fma}\left(im, im, 2\right)\\ \mathbf{else}:\\ \;\;\;\;\cosh im\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* 0.5 (cos re)) -0.01)
   (* (fma (* re re) -0.25 0.5) (fma im im 2.0))
   (cosh im)))

C

double code(double re, double im) {
	double tmp;
	if ((0.5 * cos(re)) <= -0.01) {
		tmp = fma((re * re), -0.25, 0.5) * fma(im, im, 2.0);
	} else {
		tmp = cosh(im);
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if (Float64(0.5 * cos(re)) <= -0.01)
		tmp = Float64(fma(Float64(re * re), -0.25, 0.5) * fma(im, im, 2.0));
	else
		tmp = cosh(im);
	end
	return tmp
end

Wolfram

code[re_, im_] := If[LessEqual[N[(0.5 * N[Cos[re], $MachinePrecision]), $MachinePrecision], -0.01], N[(N[(N[(re * re), $MachinePrecision] * -0.25 + 0.5), $MachinePrecision] * N[(im * im + 2.0), $MachinePrecision]), $MachinePrecision], N[Cosh[im], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) < -0.0100000000000000002

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]

   2. Taylor expanded in im around 0

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

      1. +-commutative N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \left({im}^{2} + \color{blue}{2}\right) \]

      2. unpow2 N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \left(im \cdot im + 2\right) \]

      3. lower-fma.f64 74.9

         \[\leadsto \left(0.5 \cdot \cos re\right) \cdot \mathsf{fma}\left(im, \color{blue}{im}, 2\right) \]

   4. Applied rewrites 74.9%

      \[\leadsto \left(0.5 \cdot \cos re\right) \cdot \color{blue}{\mathsf{fma}\left(im, im, 2\right)} \]

   5. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\left(\frac{1}{2} + \frac{-1}{4} \cdot {re}^{2}\right)} \cdot \mathsf{fma}\left(im, im, 2\right) \]
   6. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(\frac{1}{2} + {re}^{2} \cdot \color{blue}{\frac{-1}{4}}\right) \cdot \mathsf{fma}\left(im, im, 2\right) \]

      2. pow2 N/A

         \[\leadsto \left(\frac{1}{2} + \left(re \cdot re\right) \cdot \frac{-1}{4}\right) \cdot \mathsf{fma}\left(im, im, 2\right) \]

      3. +-commutative N/A

         \[\leadsto \left(\left(re \cdot re\right) \cdot \frac{-1}{4} + \color{blue}{\frac{1}{2}}\right) \cdot \mathsf{fma}\left(im, im, 2\right) \]

      4. lift-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(re \cdot re, \color{blue}{\frac{-1}{4}}, \frac{1}{2}\right) \cdot \mathsf{fma}\left(im, im, 2\right) \]

      5. lift-*.f64 48.0

         \[\leadsto \mathsf{fma}\left(re \cdot re, -0.25, 0.5\right) \cdot \mathsf{fma}\left(im, im, 2\right) \]

   7. Applied rewrites 48.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(re \cdot re, -0.25, 0.5\right)} \cdot \mathsf{fma}\left(im, im, 2\right) \]

   if -0.0100000000000000002 < (*.f64 #s(literal 1/2 binary64) (cos.f64 re))

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]

   2. Taylor expanded in re around 0

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

      1. cosh-undef N/A

         \[\leadsto \frac{1}{2} \cdot \left(2 \cdot \color{blue}{\cosh im}\right) \]

      2. associate-*r* N/A

         \[\leadsto \left(\frac{1}{2} \cdot 2\right) \cdot \color{blue}{\cosh im} \]

      3. metadata-eval N/A

         \[\leadsto 1 \cdot \cosh \color{blue}{im} \]

      4. lower-*.f64 N/A

         \[\leadsto 1 \cdot \color{blue}{\cosh im} \]

      5. lower-cosh.f64 85.9

         \[\leadsto 1 \cdot \cosh im \]

   4. Applied rewrites 85.9%

      \[\leadsto \color{blue}{1 \cdot \cosh im} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto 1 \cdot \color{blue}{\cosh im} \]

      2. lift-cosh.f64 N/A

         \[\leadsto 1 \cdot \cosh im \]

      3. *-lft-identity N/A

         \[\leadsto \cosh im \]

      4. lift-cosh.f64 85.9

         \[\leadsto \cosh im \]

   6. Applied rewrites 85.9%

      \[\leadsto \cosh im \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 76.4% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \leq -0.02:\\ \;\;\;\;\mathsf{fma}\left(re \cdot re, -0.25, 0.5\right) \cdot \left(im \cdot im\right)\\ \mathbf{else}:\\ \;\;\;\;\cosh im\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* (* 0.5 (cos re)) (+ (exp (- im)) (exp im))) -0.02)
   (* (fma (* re re) -0.25 0.5) (* im im))
   (cosh im)))

C

double code(double re, double im) {
	double tmp;
	if (((0.5 * cos(re)) * (exp(-im) + exp(im))) <= -0.02) {
		tmp = fma((re * re), -0.25, 0.5) * (im * im);
	} else {
		tmp = cosh(im);
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if (Float64(Float64(0.5 * cos(re)) * Float64(exp(Float64(-im)) + exp(im))) <= -0.02)
		tmp = Float64(fma(Float64(re * re), -0.25, 0.5) * Float64(im * im));
	else
		tmp = cosh(im);
	end
	return tmp
end

Wolfram

code[re_, im_] := If[LessEqual[N[(N[(0.5 * N[Cos[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.02], N[(N[(N[(re * re), $MachinePrecision] * -0.25 + 0.5), $MachinePrecision] * N[(im * im), $MachinePrecision]), $MachinePrecision], N[Cosh[im], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im))) < -0.0200000000000000004

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]

   2. Taylor expanded in im around 0

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

      1. +-commutative N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \left({im}^{2} + \color{blue}{2}\right) \]

      2. unpow2 N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \left(im \cdot im + 2\right) \]

      3. lower-fma.f64 74.8

         \[\leadsto \left(0.5 \cdot \cos re\right) \cdot \mathsf{fma}\left(im, \color{blue}{im}, 2\right) \]

   4. Applied rewrites 74.8%

      \[\leadsto \left(0.5 \cdot \cos re\right) \cdot \color{blue}{\mathsf{fma}\left(im, im, 2\right)} \]

   5. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\left(\frac{1}{2} + \frac{-1}{4} \cdot {re}^{2}\right)} \cdot \mathsf{fma}\left(im, im, 2\right) \]
   6. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(\frac{1}{2} + {re}^{2} \cdot \color{blue}{\frac{-1}{4}}\right) \cdot \mathsf{fma}\left(im, im, 2\right) \]

      2. pow2 N/A

         \[\leadsto \left(\frac{1}{2} + \left(re \cdot re\right) \cdot \frac{-1}{4}\right) \cdot \mathsf{fma}\left(im, im, 2\right) \]

      3. +-commutative N/A

         \[\leadsto \left(\left(re \cdot re\right) \cdot \frac{-1}{4} + \color{blue}{\frac{1}{2}}\right) \cdot \mathsf{fma}\left(im, im, 2\right) \]

      4. lift-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(re \cdot re, \color{blue}{\frac{-1}{4}}, \frac{1}{2}\right) \cdot \mathsf{fma}\left(im, im, 2\right) \]

      5. lift-*.f64 48.1

         \[\leadsto \mathsf{fma}\left(re \cdot re, -0.25, 0.5\right) \cdot \mathsf{fma}\left(im, im, 2\right) \]

   7. Applied rewrites 48.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left(re \cdot re, -0.25, 0.5\right)} \cdot \mathsf{fma}\left(im, im, 2\right) \]

   8. Taylor expanded in im around inf

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

      1. pow2 N/A

         \[\leadsto \mathsf{fma}\left(re \cdot re, \frac{-1}{4}, \frac{1}{2}\right) \cdot \left(im \cdot im\right) \]

      2. lower-*.f64 47.6

         \[\leadsto \mathsf{fma}\left(re \cdot re, -0.25, 0.5\right) \cdot \left(im \cdot im\right) \]

   10. Applied rewrites 47.6%

       \[\leadsto \mathsf{fma}\left(re \cdot re, -0.25, 0.5\right) \cdot \left(im \cdot \color{blue}{im}\right) \]

   if -0.0200000000000000004 < (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im)))

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]

   2. Taylor expanded in re around 0

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

      1. cosh-undef N/A

         \[\leadsto \frac{1}{2} \cdot \left(2 \cdot \color{blue}{\cosh im}\right) \]

      2. associate-*r* N/A

         \[\leadsto \left(\frac{1}{2} \cdot 2\right) \cdot \color{blue}{\cosh im} \]

      3. metadata-eval N/A

         \[\leadsto 1 \cdot \cosh \color{blue}{im} \]

      4. lower-*.f64 N/A

         \[\leadsto 1 \cdot \color{blue}{\cosh im} \]

      5. lower-cosh.f64 86.0

         \[\leadsto 1 \cdot \cosh im \]

   4. Applied rewrites 86.0%

      \[\leadsto \color{blue}{1 \cdot \cosh im} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto 1 \cdot \color{blue}{\cosh im} \]

      2. lift-cosh.f64 N/A

         \[\leadsto 1 \cdot \cosh im \]

      3. *-lft-identity N/A

         \[\leadsto \cosh im \]

      4. lift-cosh.f64 86.0

         \[\leadsto \cosh im \]

   6. Applied rewrites 86.0%

      \[\leadsto \cosh im \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 7: 71.9% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \leq -0.02:\\ \;\;\;\;\mathsf{fma}\left(-0.5, re \cdot re, 1\right)\\ \mathbf{else}:\\ \;\;\;\;\cosh im\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* (* 0.5 (cos re)) (+ (exp (- im)) (exp im))) -0.02)
   (fma -0.5 (* re re) 1.0)
   (cosh im)))

C

double code(double re, double im) {
	double tmp;
	if (((0.5 * cos(re)) * (exp(-im) + exp(im))) <= -0.02) {
		tmp = fma(-0.5, (re * re), 1.0);
	} else {
		tmp = cosh(im);
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if (Float64(Float64(0.5 * cos(re)) * Float64(exp(Float64(-im)) + exp(im))) <= -0.02)
		tmp = fma(-0.5, Float64(re * re), 1.0);
	else
		tmp = cosh(im);
	end
	return tmp
end

Wolfram

code[re_, im_] := If[LessEqual[N[(N[(0.5 * N[Cos[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.02], N[(-0.5 * N[(re * re), $MachinePrecision] + 1.0), $MachinePrecision], N[Cosh[im], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im))) < -0.0200000000000000004

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]

   2. Taylor expanded in im around 0

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

      1. lift-cos.f64 49.3

         \[\leadsto \cos re \]

   4. Applied rewrites 49.3%

      \[\leadsto \color{blue}{\cos re} \]

   5. Taylor expanded in re around 0

      \[\leadsto 1 + \color{blue}{\frac{-1}{2} \cdot {re}^{2}} \]
   6. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \frac{-1}{2} \cdot {re}^{2} + 1 \]

      2. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{-1}{2}, {re}^{\color{blue}{2}}, 1\right) \]

      3. pow2 N/A

         \[\leadsto \mathsf{fma}\left(\frac{-1}{2}, re \cdot re, 1\right) \]

      4. lift-*.f64 29.6

         \[\leadsto \mathsf{fma}\left(-0.5, re \cdot re, 1\right) \]

   7. Applied rewrites 29.6%

      \[\leadsto \mathsf{fma}\left(-0.5, \color{blue}{re \cdot re}, 1\right) \]

   if -0.0200000000000000004 < (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im)))

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]

   2. Taylor expanded in re around 0

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

      1. cosh-undef N/A

         \[\leadsto \frac{1}{2} \cdot \left(2 \cdot \color{blue}{\cosh im}\right) \]

      2. associate-*r* N/A

         \[\leadsto \left(\frac{1}{2} \cdot 2\right) \cdot \color{blue}{\cosh im} \]

      3. metadata-eval N/A

         \[\leadsto 1 \cdot \cosh \color{blue}{im} \]

      4. lower-*.f64 N/A

         \[\leadsto 1 \cdot \color{blue}{\cosh im} \]

      5. lower-cosh.f64 86.0

         \[\leadsto 1 \cdot \cosh im \]

   4. Applied rewrites 86.0%

      \[\leadsto \color{blue}{1 \cdot \cosh im} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto 1 \cdot \color{blue}{\cosh im} \]

      2. lift-cosh.f64 N/A

         \[\leadsto 1 \cdot \cosh im \]

      3. *-lft-identity N/A

         \[\leadsto \cosh im \]

      4. lift-cosh.f64 86.0

         \[\leadsto \cosh im \]

   6. Applied rewrites 86.0%

      \[\leadsto \cosh im \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 8: 54.4% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;0.5 \cdot \cos re \leq -0.01:\\ \;\;\;\;\mathsf{fma}\left(-0.5, re \cdot re, 1\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \mathsf{fma}\left(im, im, 2\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* 0.5 (cos re)) -0.01)
   (fma -0.5 (* re re) 1.0)
   (* 0.5 (fma im im 2.0))))

C

double code(double re, double im) {
	double tmp;
	if ((0.5 * cos(re)) <= -0.01) {
		tmp = fma(-0.5, (re * re), 1.0);
	} else {
		tmp = 0.5 * fma(im, im, 2.0);
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if (Float64(0.5 * cos(re)) <= -0.01)
		tmp = fma(-0.5, Float64(re * re), 1.0);
	else
		tmp = Float64(0.5 * fma(im, im, 2.0));
	end
	return tmp
end

Wolfram

code[re_, im_] := If[LessEqual[N[(0.5 * N[Cos[re], $MachinePrecision]), $MachinePrecision], -0.01], N[(-0.5 * N[(re * re), $MachinePrecision] + 1.0), $MachinePrecision], N[(0.5 * N[(im * im + 2.0), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) < -0.0100000000000000002

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]

   2. Taylor expanded in im around 0

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

      1. lift-cos.f64 49.4

         \[\leadsto \cos re \]

   4. Applied rewrites 49.4%

      \[\leadsto \color{blue}{\cos re} \]

   5. Taylor expanded in re around 0

      \[\leadsto 1 + \color{blue}{\frac{-1}{2} \cdot {re}^{2}} \]
   6. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \frac{-1}{2} \cdot {re}^{2} + 1 \]

      2. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{-1}{2}, {re}^{\color{blue}{2}}, 1\right) \]

      3. pow2 N/A

         \[\leadsto \mathsf{fma}\left(\frac{-1}{2}, re \cdot re, 1\right) \]

      4. lift-*.f64 29.5

         \[\leadsto \mathsf{fma}\left(-0.5, re \cdot re, 1\right) \]

   7. Applied rewrites 29.5%

      \[\leadsto \mathsf{fma}\left(-0.5, \color{blue}{re \cdot re}, 1\right) \]

   if -0.0100000000000000002 < (*.f64 #s(literal 1/2 binary64) (cos.f64 re))

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]

   2. Taylor expanded in im around 0

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

      1. +-commutative N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \left({im}^{2} + \color{blue}{2}\right) \]

      2. unpow2 N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \left(im \cdot im + 2\right) \]

      3. lower-fma.f64 76.5

         \[\leadsto \left(0.5 \cdot \cos re\right) \cdot \mathsf{fma}\left(im, \color{blue}{im}, 2\right) \]

   4. Applied rewrites 76.5%

      \[\leadsto \left(0.5 \cdot \cos re\right) \cdot \color{blue}{\mathsf{fma}\left(im, im, 2\right)} \]

   5. Taylor expanded in re around 0

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

   7. Applied rewrites 62.6%

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

Alternative 9: 51.9% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \leq 2:\\ \;\;\;\;\mathsf{fma}\left(-0.5, re \cdot re, 1\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(im \cdot im\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* (* 0.5 (cos re)) (+ (exp (- im)) (exp im))) 2.0)
   (fma -0.5 (* re re) 1.0)
   (* 0.5 (* im im))))

C

double code(double re, double im) {
	double tmp;
	if (((0.5 * cos(re)) * (exp(-im) + exp(im))) <= 2.0) {
		tmp = fma(-0.5, (re * re), 1.0);
	} else {
		tmp = 0.5 * (im * im);
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if (Float64(Float64(0.5 * cos(re)) * Float64(exp(Float64(-im)) + exp(im))) <= 2.0)
		tmp = fma(-0.5, Float64(re * re), 1.0);
	else
		tmp = Float64(0.5 * Float64(im * im));
	end
	return tmp
end

Wolfram

code[re_, im_] := If[LessEqual[N[(N[(0.5 * N[Cos[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], N[(-0.5 * N[(re * re), $MachinePrecision] + 1.0), $MachinePrecision], N[(0.5 * N[(im * im), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im))) < 2

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]

   2. Taylor expanded in im around 0

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

      1. lift-cos.f64 79.2

         \[\leadsto \cos re \]

   4. Applied rewrites 79.2%

      \[\leadsto \color{blue}{\cos re} \]

   5. Taylor expanded in re around 0

      \[\leadsto 1 + \color{blue}{\frac{-1}{2} \cdot {re}^{2}} \]
   6. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \frac{-1}{2} \cdot {re}^{2} + 1 \]

      2. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{-1}{2}, {re}^{\color{blue}{2}}, 1\right) \]

      3. pow2 N/A

         \[\leadsto \mathsf{fma}\left(\frac{-1}{2}, re \cdot re, 1\right) \]

      4. lift-*.f64 50.9

         \[\leadsto \mathsf{fma}\left(-0.5, re \cdot re, 1\right) \]

   7. Applied rewrites 50.9%

      \[\leadsto \mathsf{fma}\left(-0.5, \color{blue}{re \cdot re}, 1\right) \]

   if 2 < (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im)))

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]

   2. Taylor expanded in im around 0

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

      1. +-commutative N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \left({im}^{2} + \color{blue}{2}\right) \]

      2. unpow2 N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \left(im \cdot im + 2\right) \]

      3. lower-fma.f64 53.5

         \[\leadsto \left(0.5 \cdot \cos re\right) \cdot \mathsf{fma}\left(im, \color{blue}{im}, 2\right) \]

   4. Applied rewrites 53.5%

      \[\leadsto \left(0.5 \cdot \cos re\right) \cdot \color{blue}{\mathsf{fma}\left(im, im, 2\right)} \]

   5. Taylor expanded in re around 0

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

   7. Applied rewrites 53.5%

      \[\leadsto \color{blue}{0.5} \cdot \mathsf{fma}\left(im, im, 2\right) \]

   8. Taylor expanded in im around inf

      \[\leadsto \frac{1}{2} \cdot {im}^{\color{blue}{2}} \]
   9. Step-by-step derivation

      1. pow2 N/A

         \[\leadsto \frac{1}{2} \cdot \left(im \cdot im\right) \]

      2. lower-*.f64 53.5

         \[\leadsto 0.5 \cdot \left(im \cdot im\right) \]

   10. Applied rewrites 53.5%

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

Alternative 10: 47.2% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \leq 2:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(im \cdot im\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* (* 0.5 (cos re)) (+ (exp (- im)) (exp im))) 2.0)
   1.0
   (* 0.5 (* im im))))

C

double code(double re, double im) {
	double tmp;
	if (((0.5 * cos(re)) * (exp(-im) + exp(im))) <= 2.0) {
		tmp = 1.0;
	} else {
		tmp = 0.5 * (im * im);
	}
	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(re, im)
use fmin_fmax_functions
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    real(8) :: tmp
    if (((0.5d0 * cos(re)) * (exp(-im) + exp(im))) <= 2.0d0) then
        tmp = 1.0d0
    else
        tmp = 0.5d0 * (im * im)
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if (((0.5 * Math.cos(re)) * (Math.exp(-im) + Math.exp(im))) <= 2.0) {
		tmp = 1.0;
	} else {
		tmp = 0.5 * (im * im);
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if ((0.5 * math.cos(re)) * (math.exp(-im) + math.exp(im))) <= 2.0:
		tmp = 1.0
	else:
		tmp = 0.5 * (im * im)
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if (Float64(Float64(0.5 * cos(re)) * Float64(exp(Float64(-im)) + exp(im))) <= 2.0)
		tmp = 1.0;
	else
		tmp = Float64(0.5 * Float64(im * im));
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if (((0.5 * cos(re)) * (exp(-im) + exp(im))) <= 2.0)
		tmp = 1.0;
	else
		tmp = 0.5 * (im * im);
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[N[(N[(0.5 * N[Cos[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], 1.0, N[(0.5 * N[(im * im), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im))) < 2

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]

   2. Taylor expanded in re around 0

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

      1. cosh-undef N/A

         \[\leadsto \frac{1}{2} \cdot \left(2 \cdot \color{blue}{\cosh im}\right) \]

      2. associate-*r* N/A

         \[\leadsto \left(\frac{1}{2} \cdot 2\right) \cdot \color{blue}{\cosh im} \]

      3. metadata-eval N/A

         \[\leadsto 1 \cdot \cosh \color{blue}{im} \]

      4. lower-*.f64 N/A

         \[\leadsto 1 \cdot \color{blue}{\cosh im} \]

      5. lower-cosh.f64 43.7

         \[\leadsto 1 \cdot \cosh im \]

   4. Applied rewrites 43.7%

      \[\leadsto \color{blue}{1 \cdot \cosh im} \]

   5. Taylor expanded in im around 0

      \[\leadsto 1 \]
   6. Step-by-step derivation

   7. Applied rewrites 43.5%

      \[\leadsto 1 \]

   if 2 < (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im)))

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]

   2. Taylor expanded in im around 0

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

      1. +-commutative N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \left({im}^{2} + \color{blue}{2}\right) \]

      2. unpow2 N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \left(im \cdot im + 2\right) \]

      3. lower-fma.f64 53.5

         \[\leadsto \left(0.5 \cdot \cos re\right) \cdot \mathsf{fma}\left(im, \color{blue}{im}, 2\right) \]

   4. Applied rewrites 53.5%

      \[\leadsto \left(0.5 \cdot \cos re\right) \cdot \color{blue}{\mathsf{fma}\left(im, im, 2\right)} \]

   5. Taylor expanded in re around 0

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

   7. Applied rewrites 53.5%

      \[\leadsto \color{blue}{0.5} \cdot \mathsf{fma}\left(im, im, 2\right) \]

   8. Taylor expanded in im around inf

      \[\leadsto \frac{1}{2} \cdot {im}^{\color{blue}{2}} \]
   9. Step-by-step derivation

      1. pow2 N/A

         \[\leadsto \frac{1}{2} \cdot \left(im \cdot im\right) \]

      2. lower-*.f64 53.5

         \[\leadsto 0.5 \cdot \left(im \cdot im\right) \]

   10. Applied rewrites 53.5%

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

Alternative 11: 28.4% accurate, 62.8× speedup

Math

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

FPCore

(FPCore (re im) :precision binary64 1.0)

C

double code(double re, double im) {
	return 1.0;
}

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(re, im)
use fmin_fmax_functions
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = 1.0d0
end function

Java

public static double code(double re, double im) {
	return 1.0;
}

Python

def code(re, im):
	return 1.0

Julia

function code(re, im)
	return 1.0
end

MATLAB

function tmp = code(re, im)
	tmp = 1.0;
end

Wolfram

code[re_, im_] := 1.0

Derivation

1. Initial program 100.0%

   \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]

2. Taylor expanded in re around 0

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

   1. cosh-undef N/A

      \[\leadsto \frac{1}{2} \cdot \left(2 \cdot \color{blue}{\cosh im}\right) \]

   2. associate-*r* N/A

      \[\leadsto \left(\frac{1}{2} \cdot 2\right) \cdot \color{blue}{\cosh im} \]

   3. metadata-eval N/A

      \[\leadsto 1 \cdot \cosh \color{blue}{im} \]

   4. lower-*.f64 N/A

      \[\leadsto 1 \cdot \color{blue}{\cosh im} \]

   5. lower-cosh.f64 64.7

      \[\leadsto 1 \cdot \cosh im \]

4. Applied rewrites 64.7%

   \[\leadsto \color{blue}{1 \cdot \cosh im} \]

5. Taylor expanded in im around 0

   \[\leadsto 1 \]
6. Step-by-step derivation

7. Applied rewrites 28.4%

   \[\leadsto 1 \]
8. Add Preprocessing

Reproduce

herbie shell --seed 2025115 
(FPCore (re im)
  :name "math.cos on complex, real part"
  :precision binary64
  (* (* 0.5 (cos re)) (+ (exp (- im)) (exp im))))