math.sin on complex, real part

Percentage Accurate: 100.0% → 100.0%

Time: 3.2s

Alternatives: 8

Speedup: 1.4×

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

Specification

Math

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

FPCore

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

C

double code(double re, double im) {
	return (0.5 * sin(re)) * (exp((0.0 - 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 * sin(re)) * (exp((0.0d0 - im)) + exp(im))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double re, double im) {
	return (0.5 * sin(re)) * (exp((0.0 - 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 * sin(re)) * (exp((0.0d0 - im)) + exp(im))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.4× speedup

Math

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

FPCore

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

C

double code(double re, double im) {
	return sin(re) * cosh(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 = sin(re) * cosh(im)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

   1. lift-*.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. *-commutative N/A

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

   4. associate-*l* N/A

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

   5. *-commutative N/A

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

   6. metadata-eval N/A

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

   7. mult-flip N/A

      \[\leadsto \sin re \cdot \color{blue}{\frac{e^{0 - im} + e^{im}}{2}} \]

   8. lift-+.f64 N/A

      \[\leadsto \sin re \cdot \frac{\color{blue}{e^{0 - im} + e^{im}}}{2} \]

   9. +-commutative N/A

      \[\leadsto \sin re \cdot \frac{\color{blue}{e^{im} + e^{0 - im}}}{2} \]

   10. lift-exp.f64 N/A

       \[\leadsto \sin re \cdot \frac{\color{blue}{e^{im}} + e^{0 - im}}{2} \]

   11. lift-exp.f64 N/A

       \[\leadsto \sin re \cdot \frac{e^{im} + \color{blue}{e^{0 - im}}}{2} \]

   12. lift--.f64 N/A

       \[\leadsto \sin re \cdot \frac{e^{im} + e^{\color{blue}{0 - im}}}{2} \]

   13. sub0-neg N/A

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

   14. cosh-def N/A

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

   15. lower-*.f64 N/A

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

   16. lower-cosh.f64 100.0

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

3. Applied rewrites 100.0%

   \[\leadsto \color{blue}{\sin re \cdot \cosh im} \]
4. Add Preprocessing

Alternative 2: 86.8% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (* 0.5 (sin re)) (+ (exp (- 0.0 im)) (exp im)))))
   (if (<= t_0 (- INFINITY))
     (* (* re (fma (* -0.16666666666666666 re) re 1.0)) (cosh im))
     (if (<= t_0 1.0) (* (* (sin re) 2.0) 0.5) (* (cosh im) re)))))

C

double code(double re, double im) {
	double t_0 = (0.5 * sin(re)) * (exp((0.0 - im)) + exp(im));
	double tmp;
	if (t_0 <= -((double) INFINITY)) {
		tmp = (re * fma((-0.16666666666666666 * re), re, 1.0)) * cosh(im);
	} else if (t_0 <= 1.0) {
		tmp = (sin(re) * 2.0) * 0.5;
	} else {
		tmp = cosh(im) * re;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 100.0%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-*l* N/A

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

      5. *-commutative N/A

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

      6. metadata-eval N/A

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

      7. mult-flip N/A

         \[\leadsto \sin re \cdot \color{blue}{\frac{e^{0 - im} + e^{im}}{2}} \]

      8. lift-+.f64 N/A

         \[\leadsto \sin re \cdot \frac{\color{blue}{e^{0 - im} + e^{im}}}{2} \]

      9. +-commutative N/A

         \[\leadsto \sin re \cdot \frac{\color{blue}{e^{im} + e^{0 - im}}}{2} \]

      10. lift-exp.f64 N/A

          \[\leadsto \sin re \cdot \frac{\color{blue}{e^{im}} + e^{0 - im}}{2} \]

      11. lift-exp.f64 N/A

          \[\leadsto \sin re \cdot \frac{e^{im} + \color{blue}{e^{0 - im}}}{2} \]

      12. lift--.f64 N/A

          \[\leadsto \sin re \cdot \frac{e^{im} + e^{\color{blue}{0 - im}}}{2} \]

      13. sub0-neg N/A

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

      14. cosh-def N/A

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

      15. lower-*.f64 N/A

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

      16. lower-cosh.f64 100.0

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

   3. Applied rewrites 100.0%

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

   4. Taylor expanded in re around 0

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

      1. lower-*.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-pow.f64 63.7

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

   6. Applied rewrites 63.7%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lift-pow.f64 N/A

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

      5. unpow2 N/A

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

      6. associate-*r* N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-*.f64 63.7

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

   8. Applied rewrites 63.7%

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

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

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

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

   4. Applied rewrites 50.2%

      \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \color{blue}{2} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-*l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-*.f64 50.2

         \[\leadsto \color{blue}{\left(\sin re \cdot 2\right)} \cdot 0.5 \]

   6. Applied rewrites 50.2%

      \[\leadsto \color{blue}{\left(\sin re \cdot 2\right) \cdot 0.5} \]

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

   1. Initial program 100.0%

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

   2. Taylor expanded in re around 0

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. lower-exp.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-neg.f64 63.5

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

   4. Applied rewrites 63.5%

      \[\leadsto \color{blue}{0.5 \cdot \left(re \cdot \left(e^{im} + e^{-im}\right)\right)} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. lift-+.f64 N/A

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

      6. distribute-rgt-in N/A

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

      7. metadata-eval N/A

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

      8. mult-flip-rev N/A

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

      9. metadata-eval N/A

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

      10. mult-flip-rev N/A

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

      11. div-add N/A

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

      12. lift-exp.f64 N/A

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

      13. lift-exp.f64 N/A

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

      14. lift-neg.f64 N/A

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

      15. cosh-def N/A

          \[\leadsto \cosh im \cdot re \]

      16. lift-cosh.f64 N/A

          \[\leadsto \cosh im \cdot re \]

      17. lower-*.f64 63.5

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

   6. Applied rewrites 63.5%

      \[\leadsto \color{blue}{\cosh im \cdot re} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 3: 63.7% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* (* 0.5 (sin re)) (+ (exp (- 0.0 im)) (exp im))) -0.1)
   (* (* re (fma (* -0.16666666666666666 re) re 1.0)) (cosh im))
   (* (cosh im) re)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 100.0%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-*l* N/A

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

      5. *-commutative N/A

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

      6. metadata-eval N/A

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

      7. mult-flip N/A

         \[\leadsto \sin re \cdot \color{blue}{\frac{e^{0 - im} + e^{im}}{2}} \]

      8. lift-+.f64 N/A

         \[\leadsto \sin re \cdot \frac{\color{blue}{e^{0 - im} + e^{im}}}{2} \]

      9. +-commutative N/A

         \[\leadsto \sin re \cdot \frac{\color{blue}{e^{im} + e^{0 - im}}}{2} \]

      10. lift-exp.f64 N/A

          \[\leadsto \sin re \cdot \frac{\color{blue}{e^{im}} + e^{0 - im}}{2} \]

      11. lift-exp.f64 N/A

          \[\leadsto \sin re \cdot \frac{e^{im} + \color{blue}{e^{0 - im}}}{2} \]

      12. lift--.f64 N/A

          \[\leadsto \sin re \cdot \frac{e^{im} + e^{\color{blue}{0 - im}}}{2} \]

      13. sub0-neg N/A

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

      14. cosh-def N/A

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

      15. lower-*.f64 N/A

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

      16. lower-cosh.f64 100.0

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

   3. Applied rewrites 100.0%

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

   4. Taylor expanded in re around 0

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

      1. lower-*.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-pow.f64 63.7

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

   6. Applied rewrites 63.7%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lift-pow.f64 N/A

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

      5. unpow2 N/A

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

      6. associate-*r* N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-*.f64 63.7

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

   8. Applied rewrites 63.7%

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

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

   1. Initial program 100.0%

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

   2. Taylor expanded in re around 0

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. lower-exp.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-neg.f64 63.5

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

   4. Applied rewrites 63.5%

      \[\leadsto \color{blue}{0.5 \cdot \left(re \cdot \left(e^{im} + e^{-im}\right)\right)} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. lift-+.f64 N/A

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

      6. distribute-rgt-in N/A

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

      7. metadata-eval N/A

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

      8. mult-flip-rev N/A

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

      9. metadata-eval N/A

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

      10. mult-flip-rev N/A

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

      11. div-add N/A

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

      12. lift-exp.f64 N/A

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

      13. lift-exp.f64 N/A

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

      14. lift-neg.f64 N/A

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

      15. cosh-def N/A

          \[\leadsto \cosh im \cdot re \]

      16. lift-cosh.f64 N/A

          \[\leadsto \cosh im \cdot re \]

      17. lower-*.f64 63.5

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

   6. Applied rewrites 63.5%

      \[\leadsto \color{blue}{\cosh im \cdot re} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 52.6% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* (* 0.5 (sin re)) (+ (exp (- 0.0 im)) (exp im))) (- INFINITY))
   (* 0.5 (* re (+ 1.0 (/ (- (* 1.0 1.0) (* im im)) (+ 1.0 im)))))
   (* (cosh im) re)))

C

double code(double re, double im) {
	double tmp;
	if (((0.5 * sin(re)) * (exp((0.0 - im)) + exp(im))) <= -((double) INFINITY)) {
		tmp = 0.5 * (re * (1.0 + (((1.0 * 1.0) - (im * im)) / (1.0 + im))));
	} else {
		tmp = cosh(im) * re;
	}
	return tmp;
}

Java

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

Python

def code(re, im):
	tmp = 0
	if ((0.5 * math.sin(re)) * (math.exp((0.0 - im)) + math.exp(im))) <= -math.inf:
		tmp = 0.5 * (re * (1.0 + (((1.0 * 1.0) - (im * im)) / (1.0 + im))))
	else:
		tmp = math.cosh(im) * re
	return tmp

Julia

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

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if (((0.5 * sin(re)) * (exp((0.0 - im)) + exp(im))) <= -Inf)
		tmp = 0.5 * (re * (1.0 + (((1.0 * 1.0) - (im * im)) / (1.0 + im))));
	else
		tmp = cosh(im) * re;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 100.0%

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

   2. Taylor expanded in re around 0

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. lower-exp.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-neg.f64 63.5

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

   4. Applied rewrites 63.5%

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

   5. Taylor expanded in im around 0

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

   7. Applied rewrites 44.9%

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

   8. Taylor expanded in im around 0

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

      1. lower-+.f64 N/A

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

      2. lower-*.f64 32.8

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

   10. Applied rewrites 32.8%

       \[\leadsto 0.5 \cdot \left(re \cdot \left(1 + \left(1 + \color{blue}{-1 \cdot im}\right)\right)\right) \]
   11. Step-by-step derivation

       1. lift-+.f64 N/A

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

       2. lift-*.f64 N/A

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

       3. fp-cancel-sign-sub-inv N/A

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

       4. flip-- N/A

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

       5. lower-unsound-/.f64 N/A

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

       6. metadata-eval N/A

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

       7. *-lft-identity N/A

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

       8. metadata-eval N/A

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

       9. *-lft-identity N/A

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

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

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

       11. lower-unsound--.f64 N/A

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

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

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

       13. metadata-eval N/A

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

       14. *-lft-identity N/A

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

       15. lower-unsound-+.f64 40.3

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

   12. Applied rewrites 40.3%

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

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

   1. Initial program 100.0%

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

   2. Taylor expanded in re around 0

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. lower-exp.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-neg.f64 63.5

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

   4. Applied rewrites 63.5%

      \[\leadsto \color{blue}{0.5 \cdot \left(re \cdot \left(e^{im} + e^{-im}\right)\right)} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. lift-+.f64 N/A

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

      6. distribute-rgt-in N/A

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

      7. metadata-eval N/A

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

      8. mult-flip-rev N/A

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

      9. metadata-eval N/A

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

      10. mult-flip-rev N/A

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

      11. div-add N/A

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

      12. lift-exp.f64 N/A

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

      13. lift-exp.f64 N/A

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

      14. lift-neg.f64 N/A

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

      15. cosh-def N/A

          \[\leadsto \cosh im \cdot re \]

      16. lift-cosh.f64 N/A

          \[\leadsto \cosh im \cdot re \]

      17. lower-*.f64 63.5

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

   6. Applied rewrites 63.5%

      \[\leadsto \color{blue}{\cosh im \cdot re} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 48.6% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* (* 0.5 (sin re)) (+ (exp (- 0.0 im)) (exp im))) (- INFINITY))
   (* (+ (- 1.0 im) 1.0) (* 0.5 re))
   (* (cosh im) re)))

C

double code(double re, double im) {
	double tmp;
	if (((0.5 * sin(re)) * (exp((0.0 - im)) + exp(im))) <= -((double) INFINITY)) {
		tmp = ((1.0 - im) + 1.0) * (0.5 * re);
	} else {
		tmp = cosh(im) * re;
	}
	return tmp;
}

Java

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

Python

def code(re, im):
	tmp = 0
	if ((0.5 * math.sin(re)) * (math.exp((0.0 - im)) + math.exp(im))) <= -math.inf:
		tmp = ((1.0 - im) + 1.0) * (0.5 * re)
	else:
		tmp = math.cosh(im) * re
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 100.0%

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

   2. Taylor expanded in re around 0

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. lower-exp.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-neg.f64 63.5

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

   4. Applied rewrites 63.5%

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

   5. Taylor expanded in im around 0

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

   7. Applied rewrites 44.9%

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

   8. Taylor expanded in im around 0

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

      1. lower-+.f64 N/A

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

      2. lower-*.f64 32.8

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

   10. Applied rewrites 32.8%

       \[\leadsto 0.5 \cdot \left(re \cdot \left(1 + \left(1 + \color{blue}{-1 \cdot im}\right)\right)\right) \]
   11. Step-by-step derivation

       1. lift-*.f64 N/A

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

       2. lift-*.f64 N/A

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

       3. associate-*r* N/A

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

       4. *-commutative N/A

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

       5. lower-*.f64 N/A

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

       6. lift-+.f64 N/A

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

       7. +-commutative N/A

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

       8. lower-+.f64 N/A

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

       9. lift-+.f64 N/A

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

       10. lift-*.f64 N/A

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

       11. mul-1-neg N/A

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

       12. sub-flip-reverse N/A

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

       13. lower--.f64 N/A

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

       14. lower--.f64 N/A

           \[\leadsto \left(\left(1 - im\right) + 1\right) \cdot \mathsf{Rewrite=>}\left(lower-*.f64, \left(\frac{1}{2} \cdot re\right)\right) \]

   12. Applied rewrites 32.8%

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

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

   1. Initial program 100.0%

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

   2. Taylor expanded in re around 0

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. lower-exp.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-neg.f64 63.5

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

   4. Applied rewrites 63.5%

      \[\leadsto \color{blue}{0.5 \cdot \left(re \cdot \left(e^{im} + e^{-im}\right)\right)} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. lift-+.f64 N/A

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

      6. distribute-rgt-in N/A

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

      7. metadata-eval N/A

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

      8. mult-flip-rev N/A

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

      9. metadata-eval N/A

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

      10. mult-flip-rev N/A

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

      11. div-add N/A

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

      12. lift-exp.f64 N/A

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

      13. lift-exp.f64 N/A

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

      14. lift-neg.f64 N/A

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

      15. cosh-def N/A

          \[\leadsto \cosh im \cdot re \]

      16. lift-cosh.f64 N/A

          \[\leadsto \cosh im \cdot re \]

      17. lower-*.f64 63.5

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

   6. Applied rewrites 63.5%

      \[\leadsto \color{blue}{\cosh im \cdot re} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 48.4% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* (* 0.5 (sin re)) (+ (exp (- 0.0 im)) (exp im))) (- INFINITY))
   (* (+ (- 1.0 im) 1.0) (* 0.5 re))
   (fma (* (* im im) re) 0.5 re)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 100.0%

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

   2. Taylor expanded in re around 0

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. lower-exp.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-neg.f64 63.5

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

   4. Applied rewrites 63.5%

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

   5. Taylor expanded in im around 0

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

   7. Applied rewrites 44.9%

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

   8. Taylor expanded in im around 0

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

      1. lower-+.f64 N/A

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

      2. lower-*.f64 32.8

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

   10. Applied rewrites 32.8%

       \[\leadsto 0.5 \cdot \left(re \cdot \left(1 + \left(1 + \color{blue}{-1 \cdot im}\right)\right)\right) \]
   11. Step-by-step derivation

       1. lift-*.f64 N/A

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

       2. lift-*.f64 N/A

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

       3. associate-*r* N/A

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

       4. *-commutative N/A

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

       5. lower-*.f64 N/A

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

       6. lift-+.f64 N/A

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

       7. +-commutative N/A

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

       8. lower-+.f64 N/A

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

       9. lift-+.f64 N/A

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

       10. lift-*.f64 N/A

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

       11. mul-1-neg N/A

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

       12. sub-flip-reverse N/A

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

       13. lower--.f64 N/A

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

       14. lower--.f64 N/A

           \[\leadsto \left(\left(1 - im\right) + 1\right) \cdot \mathsf{Rewrite=>}\left(lower-*.f64, \left(\frac{1}{2} \cdot re\right)\right) \]

   12. Applied rewrites 32.8%

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

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

   1. Initial program 100.0%

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

   2. Taylor expanded in re around 0

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. lower-exp.f64 N/A

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

      5. lower-exp.f64 N/A

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

      6. lower-neg.f64 63.5

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

   4. Applied rewrites 63.5%

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

   5. Taylor expanded in im around 0

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

      1. lower-+.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-pow.f64 48.4

         \[\leadsto re + 0.5 \cdot \left({im}^{2} \cdot re\right) \]

   7. Applied rewrites 48.4%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 48.4

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

      6. lift-pow.f64 N/A

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

      7. unpow2 N/A

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

      8. lower-*.f64 48.4

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

   9. Applied rewrites 48.4%

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

Alternative 7: 40.7% accurate, 5.4× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(\left(im \cdot im\right) \cdot re, 0.5, re\right) \end{array} \]

FPCore

(FPCore (re im) :precision binary64 (fma (* (* im im) re) 0.5 re))

C

double code(double re, double im) {
	return fma(((im * im) * re), 0.5, re);
}

Julia

function code(re, im)
	return fma(Float64(Float64(im * im) * re), 0.5, re)
end

Wolfram

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

Derivation

1. Initial program 100.0%

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

2. Taylor expanded in re around 0

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

   1. lower-*.f64 N/A

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

   2. lower-*.f64 N/A

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

   3. lower-+.f64 N/A

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

   4. lower-exp.f64 N/A

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

   5. lower-exp.f64 N/A

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

   6. lower-neg.f64 63.5

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

4. Applied rewrites 63.5%

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

5. Taylor expanded in im around 0

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

   1. lower-+.f64 N/A

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

   2. lower-*.f64 N/A

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

   3. lower-*.f64 N/A

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

   4. lower-pow.f64 48.4

      \[\leadsto re + 0.5 \cdot \left({im}^{2} \cdot re\right) \]

7. Applied rewrites 48.4%

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

   1. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-*.f64 N/A

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

   4. *-commutative N/A

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

   5. lower-fma.f64 48.4

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

   6. lift-pow.f64 N/A

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

   7. unpow2 N/A

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

   8. lower-*.f64 48.4

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

9. Applied rewrites 48.4%

   \[\leadsto \mathsf{fma}\left(\left(im \cdot im\right) \cdot re, 0.5, re\right) \]
10. Add Preprocessing

Alternative 8: 26.7% accurate, 9.3× speedup

Math

\[\begin{array}{l} \\ \left(0.5 \cdot re\right) \cdot 2 \end{array} \]

FPCore

(FPCore (re im) :precision binary64 (* (* 0.5 re) 2.0))

C

double code(double re, double im) {
	return (0.5 * re) * 2.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 = (0.5d0 * re) * 2.0d0
end function

Java

public static double code(double re, double im) {
	return (0.5 * re) * 2.0;
}

Python

def code(re, im):
	return (0.5 * re) * 2.0

Julia

function code(re, im)
	return Float64(Float64(0.5 * re) * 2.0)
end

MATLAB

function tmp = code(re, im)
	tmp = (0.5 * re) * 2.0;
end

Wolfram

code[re_, im_] := N[(N[(0.5 * re), $MachinePrecision] * 2.0), $MachinePrecision]

Derivation

1. Initial program 100.0%

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

2. Taylor expanded in im around 0

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

4. Applied rewrites 50.2%

   \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \color{blue}{2} \]

5. Taylor expanded in re around 0

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

   1. lower-*.f64 26.7

      \[\leadsto \left(0.5 \cdot \color{blue}{re}\right) \cdot 2 \]

7. Applied rewrites 26.7%

   \[\leadsto \color{blue}{\left(0.5 \cdot re\right)} \cdot 2 \]
8. Add Preprocessing

Reproduce

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