math.exp on complex, imaginary part

Percentage Accurate: 100.0% → 100.0%

Time: 3.6s

Alternatives: 13

Speedup: 1.0×

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

Specification

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[e^{re} \cdot \sin im \]
2. Add Preprocessing
3. Add Preprocessing

Alternative 2: 86.9% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (exp re) (sin im))))
   (if (<= t_0 (- INFINITY))
     (* (exp re) (* (* (* im im) -0.16666666666666666) im))
     (if (<= t_0 -0.02)
       (* (- re -1.0) (sin im))
       (if (or (<= t_0 1e-51) (not (<= t_0 1.0)))
         (* (exp re) im)
         (* (fma (fma 0.5 re 1.0) re 1.0) (sin im)))))))

C

double code(double re, double im) {
	double t_0 = exp(re) * sin(im);
	double tmp;
	if (t_0 <= -((double) INFINITY)) {
		tmp = exp(re) * (((im * im) * -0.16666666666666666) * im);
	} else if (t_0 <= -0.02) {
		tmp = (re - -1.0) * sin(im);
	} else if ((t_0 <= 1e-51) || !(t_0 <= 1.0)) {
		tmp = exp(re) * im;
	} else {
		tmp = fma(fma(0.5, re, 1.0), re, 1.0) * sin(im);
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(exp(re) * sin(im))
	tmp = 0.0
	if (t_0 <= Float64(-Inf))
		tmp = Float64(exp(re) * Float64(Float64(Float64(im * im) * -0.16666666666666666) * im));
	elseif (t_0 <= -0.02)
		tmp = Float64(Float64(re - -1.0) * sin(im));
	elseif ((t_0 <= 1e-51) || !(t_0 <= 1.0))
		tmp = Float64(exp(re) * im);
	else
		tmp = Float64(fma(fma(0.5, re, 1.0), re, 1.0) * sin(im));
	end
	return tmp
end

Wolfram

code[re_, im_] := Block[{t$95$0 = N[(N[Exp[re], $MachinePrecision] * N[Sin[im], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, (-Infinity)], N[(N[Exp[re], $MachinePrecision] * N[(N[(N[(im * im), $MachinePrecision] * -0.16666666666666666), $MachinePrecision] * im), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, -0.02], N[(N[(re - -1.0), $MachinePrecision] * N[Sin[im], $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[t$95$0, 1e-51], N[Not[LessEqual[t$95$0, 1.0]], $MachinePrecision]], N[(N[Exp[re], $MachinePrecision] * im), $MachinePrecision], N[(N[(N[(0.5 * re + 1.0), $MachinePrecision] * re + 1.0), $MachinePrecision] * N[Sin[im], $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if (*.f64 (exp.f64 re) (sin.f64 im)) < -inf.0

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 71.4

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

   5. Applied rewrites 71.4%

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

   6. Taylor expanded in im around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. pow2 N/A

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

      4. lift-*.f64 25.0

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

   8. Applied rewrites 25.0%

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

   if -inf.0 < (*.f64 (exp.f64 re) (sin.f64 im)) < -0.0200000000000000004

   1. Initial program 99.9%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. metadata-eval N/A

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

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

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

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. metadata-eval N/A

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

      7. lower--.f64 N/A

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

      8. metadata-eval 97.7

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

   5. Applied rewrites 97.7%

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

   if -0.0200000000000000004 < (*.f64 (exp.f64 re) (sin.f64 im)) < 1e-51 or 1 < (*.f64 (exp.f64 re) (sin.f64 im))

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

      \[\leadsto e^{re} \cdot \color{blue}{im} \]
   4. Step-by-step derivation

   5. Applied rewrites 98.1%

      \[\leadsto e^{re} \cdot \color{blue}{im} \]

   if 1e-51 < (*.f64 (exp.f64 re) (sin.f64 im)) < 1

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 100.0

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

   5. Applied rewrites 100.0%

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

4. Final simplification 90.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;e^{re} \cdot \sin im \leq -\infty:\\ \;\;\;\;e^{re} \cdot \left(\left(\left(im \cdot im\right) \cdot -0.16666666666666666\right) \cdot im\right)\\ \mathbf{elif}\;e^{re} \cdot \sin im \leq -0.02:\\ \;\;\;\;\left(re - -1\right) \cdot \sin im\\ \mathbf{elif}\;e^{re} \cdot \sin im \leq 10^{-51} \lor \neg \left(e^{re} \cdot \sin im \leq 1\right):\\ \;\;\;\;e^{re} \cdot im\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \sin im\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 89.8% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (exp re) (sin im))))
   (if (<= t_0 (- INFINITY))
     (* (* (* re re) 0.5) (* (fma (* im im) -0.16666666666666666 1.0) im))
     (if (<= t_0 -0.02)
       (* (- re -1.0) (sin im))
       (if (or (<= t_0 1e-51) (not (<= t_0 1.0)))
         (* (exp re) im)
         (* (fma (fma 0.5 re 1.0) re 1.0) (sin im)))))))

C

double code(double re, double im) {
	double t_0 = exp(re) * sin(im);
	double tmp;
	if (t_0 <= -((double) INFINITY)) {
		tmp = ((re * re) * 0.5) * (fma((im * im), -0.16666666666666666, 1.0) * im);
	} else if (t_0 <= -0.02) {
		tmp = (re - -1.0) * sin(im);
	} else if ((t_0 <= 1e-51) || !(t_0 <= 1.0)) {
		tmp = exp(re) * im;
	} else {
		tmp = fma(fma(0.5, re, 1.0), re, 1.0) * sin(im);
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(exp(re) * sin(im))
	tmp = 0.0
	if (t_0 <= Float64(-Inf))
		tmp = Float64(Float64(Float64(re * re) * 0.5) * Float64(fma(Float64(im * im), -0.16666666666666666, 1.0) * im));
	elseif (t_0 <= -0.02)
		tmp = Float64(Float64(re - -1.0) * sin(im));
	elseif ((t_0 <= 1e-51) || !(t_0 <= 1.0))
		tmp = Float64(exp(re) * im);
	else
		tmp = Float64(fma(fma(0.5, re, 1.0), re, 1.0) * sin(im));
	end
	return tmp
end

Wolfram

code[re_, im_] := Block[{t$95$0 = N[(N[Exp[re], $MachinePrecision] * N[Sin[im], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, (-Infinity)], N[(N[(N[(re * re), $MachinePrecision] * 0.5), $MachinePrecision] * N[(N[(N[(im * im), $MachinePrecision] * -0.16666666666666666 + 1.0), $MachinePrecision] * im), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, -0.02], N[(N[(re - -1.0), $MachinePrecision] * N[Sin[im], $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[t$95$0, 1e-51], N[Not[LessEqual[t$95$0, 1.0]], $MachinePrecision]], N[(N[Exp[re], $MachinePrecision] * im), $MachinePrecision], N[(N[(N[(0.5 * re + 1.0), $MachinePrecision] * re + 1.0), $MachinePrecision] * N[Sin[im], $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if (*.f64 (exp.f64 re) (sin.f64 im)) < -inf.0

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 52.6

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

   5. Applied rewrites 52.6%

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

   6. Taylor expanded in re around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 52.6

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

   8. Applied rewrites 52.6%

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

   9. Taylor expanded in im around 0

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

       1. *-commutative N/A

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

       2. lower-*.f64 N/A

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

       3. +-commutative N/A

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

       4. *-commutative N/A

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

       5. lower-fma.f64 N/A

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

       6. pow2 N/A

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

       7. lift-*.f64 47.5

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

   11. Applied rewrites 47.5%

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

   if -inf.0 < (*.f64 (exp.f64 re) (sin.f64 im)) < -0.0200000000000000004

   1. Initial program 99.9%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. metadata-eval N/A

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

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

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

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. metadata-eval N/A

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

      7. lower--.f64 N/A

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

      8. metadata-eval 97.7

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

   5. Applied rewrites 97.7%

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

   if -0.0200000000000000004 < (*.f64 (exp.f64 re) (sin.f64 im)) < 1e-51 or 1 < (*.f64 (exp.f64 re) (sin.f64 im))

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

      \[\leadsto e^{re} \cdot \color{blue}{im} \]
   4. Step-by-step derivation

   5. Applied rewrites 98.1%

      \[\leadsto e^{re} \cdot \color{blue}{im} \]

   if 1e-51 < (*.f64 (exp.f64 re) (sin.f64 im)) < 1

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 100.0

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

   5. Applied rewrites 100.0%

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

4. Final simplification 92.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;e^{re} \cdot \sin im \leq -\infty:\\ \;\;\;\;\left(\left(re \cdot re\right) \cdot 0.5\right) \cdot \left(\mathsf{fma}\left(im \cdot im, -0.16666666666666666, 1\right) \cdot im\right)\\ \mathbf{elif}\;e^{re} \cdot \sin im \leq -0.02:\\ \;\;\;\;\left(re - -1\right) \cdot \sin im\\ \mathbf{elif}\;e^{re} \cdot \sin im \leq 10^{-51} \lor \neg \left(e^{re} \cdot \sin im \leq 1\right):\\ \;\;\;\;e^{re} \cdot im\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right) \cdot \sin im\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 89.8% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (exp re) (sin im))))
   (if (<= t_0 (- INFINITY))
     (* (* (* re re) 0.5) (* (fma (* im im) -0.16666666666666666 1.0) im))
     (if (or (<= t_0 -0.02) (not (or (<= t_0 1e-51) (not (<= t_0 1.0)))))
       (* (- re -1.0) (sin im))
       (* (exp re) im)))))

C

double code(double re, double im) {
	double t_0 = exp(re) * sin(im);
	double tmp;
	if (t_0 <= -((double) INFINITY)) {
		tmp = ((re * re) * 0.5) * (fma((im * im), -0.16666666666666666, 1.0) * im);
	} else if ((t_0 <= -0.02) || !((t_0 <= 1e-51) || !(t_0 <= 1.0))) {
		tmp = (re - -1.0) * sin(im);
	} else {
		tmp = exp(re) * im;
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(exp(re) * sin(im))
	tmp = 0.0
	if (t_0 <= Float64(-Inf))
		tmp = Float64(Float64(Float64(re * re) * 0.5) * Float64(fma(Float64(im * im), -0.16666666666666666, 1.0) * im));
	elseif ((t_0 <= -0.02) || !((t_0 <= 1e-51) || !(t_0 <= 1.0)))
		tmp = Float64(Float64(re - -1.0) * sin(im));
	else
		tmp = Float64(exp(re) * im);
	end
	return tmp
end

Wolfram

code[re_, im_] := Block[{t$95$0 = N[(N[Exp[re], $MachinePrecision] * N[Sin[im], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, (-Infinity)], N[(N[(N[(re * re), $MachinePrecision] * 0.5), $MachinePrecision] * N[(N[(N[(im * im), $MachinePrecision] * -0.16666666666666666 + 1.0), $MachinePrecision] * im), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[t$95$0, -0.02], N[Not[Or[LessEqual[t$95$0, 1e-51], N[Not[LessEqual[t$95$0, 1.0]], $MachinePrecision]]], $MachinePrecision]], N[(N[(re - -1.0), $MachinePrecision] * N[Sin[im], $MachinePrecision]), $MachinePrecision], N[(N[Exp[re], $MachinePrecision] * im), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (exp.f64 re) (sin.f64 im)) < -inf.0

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 52.6

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

   5. Applied rewrites 52.6%

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

   6. Taylor expanded in re around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 52.6

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

   8. Applied rewrites 52.6%

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

   9. Taylor expanded in im around 0

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

       1. *-commutative N/A

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

       2. lower-*.f64 N/A

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

       3. +-commutative N/A

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

       4. *-commutative N/A

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

       5. lower-fma.f64 N/A

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

       6. pow2 N/A

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

       7. lift-*.f64 47.5

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

   11. Applied rewrites 47.5%

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

   if -inf.0 < (*.f64 (exp.f64 re) (sin.f64 im)) < -0.0200000000000000004 or 1e-51 < (*.f64 (exp.f64 re) (sin.f64 im)) < 1

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. metadata-eval N/A

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

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

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

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. metadata-eval N/A

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

      7. lower--.f64 N/A

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

      8. metadata-eval 99.0

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

   5. Applied rewrites 99.0%

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

   if -0.0200000000000000004 < (*.f64 (exp.f64 re) (sin.f64 im)) < 1e-51 or 1 < (*.f64 (exp.f64 re) (sin.f64 im))

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

      \[\leadsto e^{re} \cdot \color{blue}{im} \]
   4. Step-by-step derivation

   5. Applied rewrites 98.1%

      \[\leadsto e^{re} \cdot \color{blue}{im} \]
3. Recombined 3 regimes into one program.

4. Final simplification 92.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;e^{re} \cdot \sin im \leq -\infty:\\ \;\;\;\;\left(\left(re \cdot re\right) \cdot 0.5\right) \cdot \left(\mathsf{fma}\left(im \cdot im, -0.16666666666666666, 1\right) \cdot im\right)\\ \mathbf{elif}\;e^{re} \cdot \sin im \leq -0.02 \lor \neg \left(e^{re} \cdot \sin im \leq 10^{-51} \lor \neg \left(e^{re} \cdot \sin im \leq 1\right)\right):\\ \;\;\;\;\left(re - -1\right) \cdot \sin im\\ \mathbf{else}:\\ \;\;\;\;e^{re} \cdot im\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 89.5% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (exp re) (sin im))))
   (if (<= t_0 (- INFINITY))
     (* (* (* re re) 0.5) (* (fma (* im im) -0.16666666666666666 1.0) im))
     (if (or (<= t_0 -0.02) (not (or (<= t_0 1e-51) (not (<= t_0 1.0)))))
       (sin im)
       (* (exp re) im)))))

C

double code(double re, double im) {
	double t_0 = exp(re) * sin(im);
	double tmp;
	if (t_0 <= -((double) INFINITY)) {
		tmp = ((re * re) * 0.5) * (fma((im * im), -0.16666666666666666, 1.0) * im);
	} else if ((t_0 <= -0.02) || !((t_0 <= 1e-51) || !(t_0 <= 1.0))) {
		tmp = sin(im);
	} else {
		tmp = exp(re) * im;
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(exp(re) * sin(im))
	tmp = 0.0
	if (t_0 <= Float64(-Inf))
		tmp = Float64(Float64(Float64(re * re) * 0.5) * Float64(fma(Float64(im * im), -0.16666666666666666, 1.0) * im));
	elseif ((t_0 <= -0.02) || !((t_0 <= 1e-51) || !(t_0 <= 1.0)))
		tmp = sin(im);
	else
		tmp = Float64(exp(re) * im);
	end
	return tmp
end

Wolfram

code[re_, im_] := Block[{t$95$0 = N[(N[Exp[re], $MachinePrecision] * N[Sin[im], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, (-Infinity)], N[(N[(N[(re * re), $MachinePrecision] * 0.5), $MachinePrecision] * N[(N[(N[(im * im), $MachinePrecision] * -0.16666666666666666 + 1.0), $MachinePrecision] * im), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[t$95$0, -0.02], N[Not[Or[LessEqual[t$95$0, 1e-51], N[Not[LessEqual[t$95$0, 1.0]], $MachinePrecision]]], $MachinePrecision]], N[Sin[im], $MachinePrecision], N[(N[Exp[re], $MachinePrecision] * im), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (exp.f64 re) (sin.f64 im)) < -inf.0

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 52.6

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

   5. Applied rewrites 52.6%

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

   6. Taylor expanded in re around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 52.6

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

   8. Applied rewrites 52.6%

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

   9. Taylor expanded in im around 0

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

       1. *-commutative N/A

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

       2. lower-*.f64 N/A

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

       3. +-commutative N/A

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

       4. *-commutative N/A

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

       5. lower-fma.f64 N/A

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

       6. pow2 N/A

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

       7. lift-*.f64 47.5

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

   11. Applied rewrites 47.5%

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

   if -inf.0 < (*.f64 (exp.f64 re) (sin.f64 im)) < -0.0200000000000000004 or 1e-51 < (*.f64 (exp.f64 re) (sin.f64 im)) < 1

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. lift-sin.f64 98.3

         \[\leadsto \sin im \]

   5. Applied rewrites 98.3%

      \[\leadsto \color{blue}{\sin im} \]

   if -0.0200000000000000004 < (*.f64 (exp.f64 re) (sin.f64 im)) < 1e-51 or 1 < (*.f64 (exp.f64 re) (sin.f64 im))

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

      \[\leadsto e^{re} \cdot \color{blue}{im} \]
   4. Step-by-step derivation

   5. Applied rewrites 98.1%

      \[\leadsto e^{re} \cdot \color{blue}{im} \]
3. Recombined 3 regimes into one program.

4. Final simplification 92.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;e^{re} \cdot \sin im \leq -\infty:\\ \;\;\;\;\left(\left(re \cdot re\right) \cdot 0.5\right) \cdot \left(\mathsf{fma}\left(im \cdot im, -0.16666666666666666, 1\right) \cdot im\right)\\ \mathbf{elif}\;e^{re} \cdot \sin im \leq -0.02 \lor \neg \left(e^{re} \cdot \sin im \leq 10^{-51} \lor \neg \left(e^{re} \cdot \sin im \leq 1\right)\right):\\ \;\;\;\;\sin im\\ \mathbf{else}:\\ \;\;\;\;e^{re} \cdot im\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 56.6% accurate, 0.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 4 regimes

2. if (*.f64 (exp.f64 re) (sin.f64 im)) < -inf.0

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 52.6

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

   5. Applied rewrites 52.6%

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

   6. Taylor expanded in re around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 52.6

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

   8. Applied rewrites 52.6%

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

   9. Taylor expanded in im around 0

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

       1. *-commutative N/A

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

       2. lower-*.f64 N/A

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

       3. +-commutative N/A

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

       4. *-commutative N/A

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

       5. lower-fma.f64 N/A

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

       6. pow2 N/A

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

       7. lift-*.f64 47.5

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

   11. Applied rewrites 47.5%

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

   if -inf.0 < (*.f64 (exp.f64 re) (sin.f64 im)) < -0.0200000000000000004 or -0.0 < (*.f64 (exp.f64 re) (sin.f64 im)) < 1

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. lift-sin.f64 98.2

         \[\leadsto \sin im \]

   5. Applied rewrites 98.2%

      \[\leadsto \color{blue}{\sin im} \]

   if -0.0200000000000000004 < (*.f64 (exp.f64 re) (sin.f64 im)) < -0.0

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\sin im + re \cdot \sin im} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\sin im, \color{blue}{re}, \sin im\right) \]

      4. lift-sin.f64 N/A

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

      5. lift-sin.f64 34.6

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

   5. Applied rewrites 34.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\sin im, re, \sin im\right)} \]

   6. Taylor expanded in im around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-+.f64 N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower--.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. pow2 N/A

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

      11. lift-*.f64 34.4

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

   8. Applied rewrites 34.4%

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

   9. Taylor expanded in im around inf

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

       1. *-commutative N/A

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

       2. pow2 N/A

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

       3. associate-*r* N/A

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

       4. lower-*.f64 N/A

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

       5. lower-*.f64 N/A

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

       6. lift-*.f64 N/A

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

       7. lift--.f64 23.8

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

   11. Applied rewrites 23.8%

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

   if 1 < (*.f64 (exp.f64 re) (sin.f64 im))

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 67.6

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

   5. Applied rewrites 67.6%

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

   6. Taylor expanded in im around 0

      \[\leadsto e^{re} \cdot im \]
   7. Step-by-step derivation

   8. Applied rewrites 91.2%

      \[\leadsto e^{re} \cdot im \]

   9. Taylor expanded in re around 0

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

       1. +-commutative N/A

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

       2. *-commutative N/A

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

       3. lower-fma.f64 N/A

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

       4. +-commutative N/A

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

       5. *-commutative N/A

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

       6. lower-fma.f64 N/A

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

       7. +-commutative N/A

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

       8. lower-fma.f64 71.3

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

   11. Applied rewrites 71.3%

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

Alternative 7: 92.4% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (exp re) (sin im))))
   (if (or (<= t_0 -0.02) (not (or (<= t_0 0.0) (not (<= t_0 1.0)))))
     (* (fma (fma (fma 0.16666666666666666 re 0.5) re 1.0) re 1.0) (sin im))
     (* (exp re) im))))

C

double code(double re, double im) {
	double t_0 = exp(re) * sin(im);
	double tmp;
	if ((t_0 <= -0.02) || !((t_0 <= 0.0) || !(t_0 <= 1.0))) {
		tmp = fma(fma(fma(0.16666666666666666, re, 0.5), re, 1.0), re, 1.0) * sin(im);
	} else {
		tmp = exp(re) * im;
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(exp(re) * sin(im))
	tmp = 0.0
	if ((t_0 <= -0.02) || !((t_0 <= 0.0) || !(t_0 <= 1.0)))
		tmp = Float64(fma(fma(fma(0.16666666666666666, re, 0.5), re, 1.0), re, 1.0) * sin(im));
	else
		tmp = Float64(exp(re) * im);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (exp.f64 re) (sin.f64 im)) < -0.0200000000000000004 or -0.0 < (*.f64 (exp.f64 re) (sin.f64 im)) < 1

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-fma.f64 94.1

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

   5. Applied rewrites 94.1%

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

   if -0.0200000000000000004 < (*.f64 (exp.f64 re) (sin.f64 im)) < -0.0 or 1 < (*.f64 (exp.f64 re) (sin.f64 im))

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

      \[\leadsto e^{re} \cdot \color{blue}{im} \]
   4. Step-by-step derivation

   5. Applied rewrites 97.7%

      \[\leadsto e^{re} \cdot \color{blue}{im} \]
3. Recombined 2 regimes into one program.

4. Final simplification 96.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;e^{re} \cdot \sin im \leq -0.02 \lor \neg \left(e^{re} \cdot \sin im \leq 0 \lor \neg \left(e^{re} \cdot \sin im \leq 1\right)\right):\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, 1\right), re, 1\right) \cdot \sin im\\ \mathbf{else}:\\ \;\;\;\;e^{re} \cdot im\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 29.5% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (exp.f64 re) (sin.f64 im)) < -0.0

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\sin im + re \cdot \sin im} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\sin im, \color{blue}{re}, \sin im\right) \]

      4. lift-sin.f64 N/A

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

      5. lift-sin.f64 40.9

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

   5. Applied rewrites 40.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\sin im, re, \sin im\right)} \]

   6. Taylor expanded in im around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-+.f64 N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower--.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. pow2 N/A

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

      11. lift-*.f64 25.3

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

   8. Applied rewrites 25.3%

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

   9. Taylor expanded in im around inf

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

       1. *-commutative N/A

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

       2. pow2 N/A

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

       3. associate-*r* N/A

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

       4. lower-*.f64 N/A

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

       5. lower-*.f64 N/A

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

       6. lift-*.f64 N/A

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

       7. lift--.f64 18.4

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

   11. Applied rewrites 18.4%

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

   if -0.0 < (*.f64 (exp.f64 re) (sin.f64 im))

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 51.3

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

   5. Applied rewrites 51.3%

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

   6. Taylor expanded in im around 0

      \[\leadsto e^{re} \cdot im \]
   7. Step-by-step derivation

   8. Applied rewrites 59.7%

      \[\leadsto e^{re} \cdot im \]

   9. Taylor expanded in re around 0

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

       1. +-commutative N/A

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

       2. *-commutative N/A

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

       3. lower-fma.f64 N/A

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

       4. +-commutative N/A

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

       5. *-commutative N/A

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

       6. lower-fma.f64 N/A

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

       7. +-commutative N/A

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

       8. lower-fma.f64 52.9

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

   11. Applied rewrites 52.9%

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

Alternative 9: 24.3% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* (exp re) (sin im)) 0.0)
   (* (* (* (- (* -0.16666666666666666 re) 0.16666666666666666) im) im) im)
   (* (- re -1.0) im)))

C

double code(double re, double im) {
	double tmp;
	if ((exp(re) * sin(im)) <= 0.0) {
		tmp = ((((-0.16666666666666666 * re) - 0.16666666666666666) * im) * im) * im;
	} else {
		tmp = (re - -1.0) * 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 ((exp(re) * sin(im)) <= 0.0d0) then
        tmp = (((((-0.16666666666666666d0) * re) - 0.16666666666666666d0) * im) * im) * im
    else
        tmp = (re - (-1.0d0)) * im
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (exp.f64 re) (sin.f64 im)) < -0.0

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\sin im + re \cdot \sin im} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\sin im, \color{blue}{re}, \sin im\right) \]

      4. lift-sin.f64 N/A

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

      5. lift-sin.f64 40.9

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

   5. Applied rewrites 40.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\sin im, re, \sin im\right)} \]

   6. Taylor expanded in im around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-+.f64 N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower--.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. pow2 N/A

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

      11. lift-*.f64 25.3

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

   8. Applied rewrites 25.3%

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

   9. Taylor expanded in im around inf

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

       1. *-commutative N/A

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

       2. pow2 N/A

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

       3. associate-*r* N/A

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

       4. lower-*.f64 N/A

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

       5. lower-*.f64 N/A

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

       6. lift-*.f64 N/A

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

       7. lift--.f64 18.4

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

   11. Applied rewrites 18.4%

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

   if -0.0 < (*.f64 (exp.f64 re) (sin.f64 im))

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. metadata-eval N/A

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

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

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

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. metadata-eval N/A

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

      7. lower--.f64 N/A

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

      8. metadata-eval 67.1

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

   5. Applied rewrites 67.1%

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

   6. Taylor expanded in im around 0

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

   8. Applied rewrites 35.6%

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

Alternative 10: 30.2% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (exp.f64 re) (sin.f64 im)) < -0.0

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. lift-sin.f64 40.8

         \[\leadsto \sin im \]

   5. Applied rewrites 40.8%

      \[\leadsto \color{blue}{\sin im} \]

   6. Taylor expanded in im around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. lower--.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

      9. pow2 N/A

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

      10. lift-*.f64 N/A

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

      11. pow2 N/A

          \[\leadsto \mathsf{fma}\left(\left(im \cdot im\right) \cdot \frac{1}{120} - \frac{1}{6}, im \cdot im, 1\right) \cdot im \]

      12. lift-*.f64 27.3

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

   8. Applied rewrites 27.3%

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

   9. Taylor expanded in im around 0

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

   11. Applied rewrites 24.9%

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

   if -0.0 < (*.f64 (exp.f64 re) (sin.f64 im))

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. metadata-eval N/A

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

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

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

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. metadata-eval N/A

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

      7. lower--.f64 N/A

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

      8. metadata-eval 67.1

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

   5. Applied rewrites 67.1%

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

   6. Taylor expanded in im around 0

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

   8. Applied rewrites 35.6%

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

Alternative 11: 28.0% accurate, 17.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;im \leq 1.08 \cdot 10^{+65}:\\ \;\;\;\;im\\ \mathbf{else}:\\ \;\;\;\;re \cdot im\\ \end{array} \end{array} \]

FPCore

(FPCore (re im) :precision binary64 (if (<= im 1.08e+65) im (* re im)))

C

double code(double re, double im) {
	double tmp;
	if (im <= 1.08e+65) {
		tmp = im;
	} else {
		tmp = re * 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 (im <= 1.08d+65) then
        tmp = im
    else
        tmp = re * im
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if (im <= 1.08e+65) {
		tmp = im;
	} else {
		tmp = re * im;
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if im <= 1.08e+65:
		tmp = im
	else:
		tmp = re * im
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if (im <= 1.08e+65)
		tmp = im;
	else
		tmp = Float64(re * im);
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if (im <= 1.08e+65)
		tmp = im;
	else
		tmp = re * im;
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[im, 1.08e+65], im, N[(re * im), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if im < 1.08e65

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. lift-sin.f64 49.0

         \[\leadsto \sin im \]

   5. Applied rewrites 49.0%

      \[\leadsto \color{blue}{\sin im} \]

   6. Taylor expanded in im around 0

      \[\leadsto im \]
   7. Step-by-step derivation

   8. Applied rewrites 32.5%

      \[\leadsto im \]

   if 1.08e65 < im

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. metadata-eval N/A

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

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

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

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. metadata-eval N/A

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

      7. lower--.f64 N/A

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

      8. metadata-eval 56.6

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

   5. Applied rewrites 56.6%

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

   6. Taylor expanded in im around 0

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

   8. Applied rewrites 12.6%

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

   9. Taylor expanded in re around inf

      \[\leadsto re \cdot im \]
   10. Step-by-step derivation

   11. Applied rewrites 13.3%

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

Alternative 12: 29.7% accurate, 22.9× speedup

Math

\[\begin{array}{l} \\ \left(re - -1\right) \cdot im \end{array} \]

FPCore

(FPCore (re im) :precision binary64 (* (- re -1.0) im))

C

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

Java

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

Python

def code(re, im):
	return (re - -1.0) * im

Julia

function code(re, im)
	return Float64(Float64(re - -1.0) * im)
end

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[e^{re} \cdot \sin im \]
2. Add Preprocessing

3. Taylor expanded in re around 0

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

   1. +-commutative N/A

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

   2. metadata-eval N/A

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

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

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

   4. metadata-eval N/A

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

   5. metadata-eval N/A

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

   6. metadata-eval N/A

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

   7. lower--.f64 N/A

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

   8. metadata-eval 51.0

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

5. Applied rewrites 51.0%

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

6. Taylor expanded in im around 0

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

8. Applied rewrites 30.2%

   \[\leadsto \left(re - -1\right) \cdot \color{blue}{im} \]
9. Add Preprocessing

Alternative 13: 26.6% accurate, 206.0× speedup

Math

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

FPCore

(FPCore (re im) :precision binary64 im)

C

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

Java

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

Python

def code(re, im):
	return im

Julia

function code(re, im)
	return im
end

MATLAB

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

Wolfram

code[re_, im_] := im

Derivation

1. Initial program 100.0%

   \[e^{re} \cdot \sin im \]
2. Add Preprocessing

3. Taylor expanded in re around 0

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

   1. lift-sin.f64 50.5

      \[\leadsto \sin im \]

5. Applied rewrites 50.5%

   \[\leadsto \color{blue}{\sin im} \]

6. Taylor expanded in im around 0

   \[\leadsto im \]
7. Step-by-step derivation

8. Applied rewrites 25.7%

   \[\leadsto im \]
9. Add Preprocessing

Reproduce

herbie shell --seed 2025061 
(FPCore (re im)
  :name "math.exp on complex, imaginary part"
  :precision binary64
  (* (exp re) (sin im)))