math.exp on complex, imaginary part

Percentage Accurate: 100.0% → 100.0%

Time: 11.0s

Alternatives: 16

Speedup: 1.0×

• 24.9% 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

real(8) function code(re, im)
    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

real(8) function code(re, im)
    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

real(8) function code(re, im)
    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: 89.3% 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(\mathsf{fma}\left(0.5, re, 1\right) \cdot re\right) \cdot \mathsf{fma}\left(-0.16666666666666666 \cdot \left(im \cdot im\right), im, im\right)\\ \mathbf{elif}\;t\_0 \leq -0.1:\\ \;\;\;\;\left(1 + re\right) \cdot \sin im\\ \mathbf{elif}\;t\_0 \leq 10^{-56} \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))
     (* (* (fma 0.5 re 1.0) re) (fma (* -0.16666666666666666 (* im im)) im im))
     (if (<= t_0 -0.1)
       (* (+ 1.0 re) (sin im))
       (if (or (<= t_0 1e-56) (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 = (fma(0.5, re, 1.0) * re) * fma((-0.16666666666666666 * (im * im)), im, im);
	} else if (t_0 <= -0.1) {
		tmp = (1.0 + re) * sin(im);
	} else if ((t_0 <= 1e-56) || !(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(fma(0.5, re, 1.0) * re) * fma(Float64(-0.16666666666666666 * Float64(im * im)), im, im));
	elseif (t_0 <= -0.1)
		tmp = Float64(Float64(1.0 + re) * sin(im));
	elseif ((t_0 <= 1e-56) || !(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[(0.5 * re + 1.0), $MachinePrecision] * re), $MachinePrecision] * N[(N[(-0.16666666666666666 * N[(im * im), $MachinePrecision]), $MachinePrecision] * im + im), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, -0.1], N[(N[(1.0 + re), $MachinePrecision] * N[Sin[im], $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[t$95$0, 1e-56], 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 \color{blue}{\left(re \cdot \left(1 + \frac{1}{2} \cdot re\right) + 1\right)} \cdot \sin im \]

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 69.8

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

   5. Applied rewrites 69.8%

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

   6. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. *-rgt-identity N/A

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

      6. lower-fma.f64 N/A

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

      7. unpow2 N/A

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

      8. cube-unmult N/A

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

      9. lower-pow.f64 68.4

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

   8. Applied rewrites 68.4%

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

   10. Applied rewrites 68.4%

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

   11. Taylor expanded in re around inf

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

   13. Applied rewrites 68.4%

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

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

   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. lower-+.f64 99.6

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

   5. Applied rewrites 99.6%

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

   if -0.10000000000000001 < (*.f64 (exp.f64 re) (sin.f64 im)) < 1e-56 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 \color{blue}{im \cdot e^{re}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-exp.f64 93.9

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

   5. Applied rewrites 93.9%

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

   if 1e-56 < (*.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 \color{blue}{\left(re \cdot \left(1 + \frac{1}{2} \cdot re\right) + 1\right)} \cdot \sin im \]

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 99.2

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

   5. Applied rewrites 99.2%

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

   \[\leadsto \begin{array}{l} \mathbf{if}\;e^{re} \cdot \sin im \leq -\infty:\\ \;\;\;\;\left(\mathsf{fma}\left(0.5, re, 1\right) \cdot re\right) \cdot \mathsf{fma}\left(-0.16666666666666666 \cdot \left(im \cdot im\right), im, im\right)\\ \mathbf{elif}\;e^{re} \cdot \sin im \leq -0.1:\\ \;\;\;\;\left(1 + re\right) \cdot \sin im\\ \mathbf{elif}\;e^{re} \cdot \sin im \leq 10^{-56} \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.2% 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(\mathsf{fma}\left(0.5, re, 1\right) \cdot re\right) \cdot \mathsf{fma}\left(-0.16666666666666666 \cdot \left(im \cdot im\right), im, im\right)\\ \mathbf{elif}\;t\_0 \leq -0.1 \lor \neg \left(t\_0 \leq 10^{-56} \lor \neg \left(t\_0 \leq 1\right)\right):\\ \;\;\;\;\left(1 + re\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))
     (* (* (fma 0.5 re 1.0) re) (fma (* -0.16666666666666666 (* im im)) im im))
     (if (or (<= t_0 -0.1) (not (or (<= t_0 1e-56) (not (<= t_0 1.0)))))
       (* (+ 1.0 re) (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 = (fma(0.5, re, 1.0) * re) * fma((-0.16666666666666666 * (im * im)), im, im);
	} else if ((t_0 <= -0.1) || !((t_0 <= 1e-56) || !(t_0 <= 1.0))) {
		tmp = (1.0 + re) * 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(fma(0.5, re, 1.0) * re) * fma(Float64(-0.16666666666666666 * Float64(im * im)), im, im));
	elseif ((t_0 <= -0.1) || !((t_0 <= 1e-56) || !(t_0 <= 1.0)))
		tmp = Float64(Float64(1.0 + re) * 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[(0.5 * re + 1.0), $MachinePrecision] * re), $MachinePrecision] * N[(N[(-0.16666666666666666 * N[(im * im), $MachinePrecision]), $MachinePrecision] * im + im), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[t$95$0, -0.1], N[Not[Or[LessEqual[t$95$0, 1e-56], N[Not[LessEqual[t$95$0, 1.0]], $MachinePrecision]]], $MachinePrecision]], N[(N[(1.0 + re), $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 \color{blue}{\left(re \cdot \left(1 + \frac{1}{2} \cdot re\right) + 1\right)} \cdot \sin im \]

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 69.8

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

   5. Applied rewrites 69.8%

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

   6. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. *-rgt-identity N/A

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

      6. lower-fma.f64 N/A

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

      7. unpow2 N/A

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

      8. cube-unmult N/A

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

      9. lower-pow.f64 68.4

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

   8. Applied rewrites 68.4%

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

   10. Applied rewrites 68.4%

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

   11. Taylor expanded in re around inf

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

   13. Applied rewrites 68.4%

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

   if -inf.0 < (*.f64 (exp.f64 re) (sin.f64 im)) < -0.10000000000000001 or 1e-56 < (*.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. lower-+.f64 99.1

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

   5. Applied rewrites 99.1%

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

   if -0.10000000000000001 < (*.f64 (exp.f64 re) (sin.f64 im)) < 1e-56 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 \color{blue}{im \cdot e^{re}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-exp.f64 93.9

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

   5. Applied rewrites 93.9%

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

4. Final simplification 93.2%

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

Alternative 4: 88.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:\\ \;\;\;\;\left(\mathsf{fma}\left(0.5, re, 1\right) \cdot re\right) \cdot \mathsf{fma}\left(-0.16666666666666666 \cdot \left(im \cdot im\right), im, im\right)\\ \mathbf{elif}\;t\_0 \leq -0.1 \lor \neg \left(t\_0 \leq 10^{-56} \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))
     (* (* (fma 0.5 re 1.0) re) (fma (* -0.16666666666666666 (* im im)) im im))
     (if (or (<= t_0 -0.1) (not (or (<= t_0 1e-56) (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 = (fma(0.5, re, 1.0) * re) * fma((-0.16666666666666666 * (im * im)), im, im);
	} else if ((t_0 <= -0.1) || !((t_0 <= 1e-56) || !(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(fma(0.5, re, 1.0) * re) * fma(Float64(-0.16666666666666666 * Float64(im * im)), im, im));
	elseif ((t_0 <= -0.1) || !((t_0 <= 1e-56) || !(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[(0.5 * re + 1.0), $MachinePrecision] * re), $MachinePrecision] * N[(N[(-0.16666666666666666 * N[(im * im), $MachinePrecision]), $MachinePrecision] * im + im), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[t$95$0, -0.1], N[Not[Or[LessEqual[t$95$0, 1e-56], 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 \color{blue}{\left(re \cdot \left(1 + \frac{1}{2} \cdot re\right) + 1\right)} \cdot \sin im \]

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 69.8

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

   5. Applied rewrites 69.8%

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

   6. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. *-rgt-identity N/A

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

      6. lower-fma.f64 N/A

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

      7. unpow2 N/A

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

      8. cube-unmult N/A

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

      9. lower-pow.f64 68.4

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

   8. Applied rewrites 68.4%

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

   10. Applied rewrites 68.4%

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

   11. Taylor expanded in re around inf

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

   13. Applied rewrites 68.4%

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

   if -inf.0 < (*.f64 (exp.f64 re) (sin.f64 im)) < -0.10000000000000001 or 1e-56 < (*.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. lower-sin.f64 97.5

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

   5. Applied rewrites 97.5%

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

   if -0.10000000000000001 < (*.f64 (exp.f64 re) (sin.f64 im)) < 1e-56 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 \color{blue}{im \cdot e^{re}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-exp.f64 93.9

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

   5. Applied rewrites 93.9%

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

4. Final simplification 92.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;e^{re} \cdot \sin im \leq -\infty:\\ \;\;\;\;\left(\mathsf{fma}\left(0.5, re, 1\right) \cdot re\right) \cdot \mathsf{fma}\left(-0.16666666666666666 \cdot \left(im \cdot im\right), im, im\right)\\ \mathbf{elif}\;e^{re} \cdot \sin im \leq -0.1 \lor \neg \left(e^{re} \cdot \sin im \leq 10^{-56} \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 5: 91.9% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := e^{re} \cdot \sin im\\ \mathbf{if}\;t\_0 \leq -0.1 \lor \neg \left(t\_0 \leq 10^{-56} \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.1) (not (or (<= t_0 1e-56) (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.1) || !((t_0 <= 1e-56) || !(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.1) || !((t_0 <= 1e-56) || !(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.1], N[Not[Or[LessEqual[t$95$0, 1e-56], 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.10000000000000001 or 1e-56 < (*.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 \color{blue}{\left(re \cdot \left(1 + re \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot re\right)\right) + 1\right)} \cdot \sin im \]

      2. *-commutative N/A

         \[\leadsto \left(\color{blue}{\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 \color{blue}{\mathsf{fma}\left(1 + re \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot re\right), re, 1\right)} \cdot \sin im \]

      4. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{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(\color{blue}{\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(\color{blue}{\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(\color{blue}{\frac{1}{6} \cdot re + \frac{1}{2}}, re, 1\right), re, 1\right) \cdot \sin im \]

      8. lower-fma.f64 95.8

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

   5. Applied rewrites 95.8%

      \[\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.10000000000000001 < (*.f64 (exp.f64 re) (sin.f64 im)) < 1e-56 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 \color{blue}{im \cdot e^{re}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-exp.f64 93.9

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

   5. Applied rewrites 93.9%

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

4. Final simplification 94.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;e^{re} \cdot \sin im \leq -0.1 \lor \neg \left(e^{re} \cdot \sin im \leq 10^{-56} \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 6: 63.1% accurate, 0.4× speedup

Math

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

FPCore

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

C

double code(double re, double im) {
	double t_0 = exp(re) * sin(im);
	double tmp;
	if (t_0 <= -((double) INFINITY)) {
		tmp = (fma(0.5, re, 1.0) * re) * fma((-0.16666666666666666 * (im * im)), im, im);
	} else if (t_0 <= 1.0) {
		tmp = sin(im);
	} else {
		tmp = ((fma(0.16666666666666666, re, 0.5) * re) * 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(fma(0.5, re, 1.0) * re) * fma(Float64(-0.16666666666666666 * Float64(im * im)), im, im));
	elseif (t_0 <= 1.0)
		tmp = sin(im);
	else
		tmp = Float64(Float64(Float64(fma(0.16666666666666666, re, 0.5) * re) * 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[(0.5 * re + 1.0), $MachinePrecision] * re), $MachinePrecision] * N[(N[(-0.16666666666666666 * N[(im * im), $MachinePrecision]), $MachinePrecision] * im + im), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 1.0], N[Sin[im], $MachinePrecision], N[(N[(N[(N[(0.16666666666666666 * re + 0.5), $MachinePrecision] * re), $MachinePrecision] * 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 \color{blue}{\left(re \cdot \left(1 + \frac{1}{2} \cdot re\right) + 1\right)} \cdot \sin im \]

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 69.8

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

   5. Applied rewrites 69.8%

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

   6. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. *-rgt-identity N/A

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

      6. lower-fma.f64 N/A

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

      7. unpow2 N/A

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

      8. cube-unmult N/A

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

      9. lower-pow.f64 68.4

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

   8. Applied rewrites 68.4%

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

   10. Applied rewrites 68.4%

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

   11. Taylor expanded in re around inf

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

   13. Applied rewrites 68.4%

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

   if -inf.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. lower-sin.f64 65.1

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

   5. Applied rewrites 65.1%

      \[\leadsto \color{blue}{\sin 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 \color{blue}{im \cdot e^{re}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-exp.f64 76.5

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

   5. Applied rewrites 76.5%

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

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 56.6%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, re, 0.5\right), re, 1\right), re, 1\right) \cdot im \]
   9. Step-by-step derivation

   10. Applied rewrites 56.6%

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

   11. Taylor expanded in re around inf

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

   13. Applied rewrites 56.6%

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

Alternative 7: 38.6% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Julia

function code(re, im)
	tmp = 0.0
	if (Float64(exp(re) * sin(im)) <= 0.0)
		tmp = Float64(fma(fma(0.5, re, 1.0), re, 1.0) * fma(Float64(-0.16666666666666666 * Float64(im * im)), im, im));
	else
		tmp = fma(Float64(im * fma(fma(0.16666666666666666, re, 0.5), re, 1.0)), re, 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[(0.5 * re + 1.0), $MachinePrecision] * re + 1.0), $MachinePrecision] * N[(N[(-0.16666666666666666 * N[(im * im), $MachinePrecision]), $MachinePrecision] * im + im), $MachinePrecision]), $MachinePrecision], N[(N[(im * N[(N[(0.16666666666666666 * re + 0.5), $MachinePrecision] * re + 1.0), $MachinePrecision]), $MachinePrecision] * re + 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}{\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 \color{blue}{\left(re \cdot \left(1 + \frac{1}{2} \cdot re\right) + 1\right)} \cdot \sin im \]

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 53.9

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

   5. Applied rewrites 53.9%

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

   6. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. *-rgt-identity N/A

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

      6. lower-fma.f64 N/A

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

      7. unpow2 N/A

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

      8. cube-unmult N/A

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

      9. lower-pow.f64 33.1

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

   8. Applied rewrites 33.1%

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

   10. Applied rewrites 33.1%

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

   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 \color{blue}{im \cdot e^{re}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-exp.f64 55.8

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

   5. Applied rewrites 55.8%

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

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 48.6%

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

Alternative 8: 26.9% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Julia

function code(re, im)
	tmp = 0.0
	if (Float64(exp(re) * sin(im)) <= 0.0)
		tmp = Float64(Float64(Float64(re * re) * 0.5) * fma(Float64(-0.16666666666666666 * Float64(im * im)), im, im));
	else
		tmp = fma(Float64(im * fma(fma(0.16666666666666666, re, 0.5), re, 1.0)), re, 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[(re * re), $MachinePrecision] * 0.5), $MachinePrecision] * N[(N[(-0.16666666666666666 * N[(im * im), $MachinePrecision]), $MachinePrecision] * im + im), $MachinePrecision]), $MachinePrecision], N[(N[(im * N[(N[(0.16666666666666666 * re + 0.5), $MachinePrecision] * re + 1.0), $MachinePrecision]), $MachinePrecision] * re + 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}{\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 \color{blue}{\left(re \cdot \left(1 + \frac{1}{2} \cdot re\right) + 1\right)} \cdot \sin im \]

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 53.9

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

   5. Applied rewrites 53.9%

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

   6. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. *-rgt-identity N/A

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

      6. lower-fma.f64 N/A

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

      7. unpow2 N/A

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

      8. cube-unmult N/A

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

      9. lower-pow.f64 33.1

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

   8. Applied rewrites 33.1%

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

   10. Applied rewrites 33.1%

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

   11. Taylor expanded in re around inf

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

   13. Applied rewrites 12.0%

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

   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 \color{blue}{im \cdot e^{re}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-exp.f64 55.8

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

   5. Applied rewrites 55.8%

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

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 48.6%

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

Alternative 9: 32.3% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    real(8) :: tmp
    if ((exp(re) * sin(im)) <= 0.5d0) then
        tmp = 1.0d0 * im
    else
        tmp = ((re * re) * 0.5d0) * 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.5) {
		tmp = 1.0 * im;
	} else {
		tmp = ((re * re) * 0.5) * im;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-exp.f64 72.1

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

   5. Applied rewrites 72.1%

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

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 32.6%

      \[\leadsto 1 \cdot im \]

   if 0.5 < (*.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 \color{blue}{im \cdot e^{re}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-exp.f64 49.2

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

   5. Applied rewrites 49.2%

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

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 26.2%

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

   9. Taylor expanded in re around inf

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

   11. Applied rewrites 31.7%

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

Alternative 10: 97.0% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq -0.00024:\\ \;\;\;\;e^{re} \cdot im\\ \mathbf{elif}\;re \leq 0.295 \lor \neg \left(re \leq 4 \cdot 10^{+95}\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}:\\ \;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.0001984126984126984, im \cdot im, 0.008333333333333333\right), im \cdot im, -0.16666666666666666\right), im \cdot im, 1\right) \cdot e^{re}\right) \cdot im\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re -0.00024)
   (* (exp re) im)
   (if (or (<= re 0.295) (not (<= re 4e+95)))
     (* (fma (fma (fma 0.16666666666666666 re 0.5) re 1.0) re 1.0) (sin im))
     (*
      (*
       (fma
        (fma
         (fma -0.0001984126984126984 (* im im) 0.008333333333333333)
         (* im im)
         -0.16666666666666666)
        (* im im)
        1.0)
       (exp re))
      im))))

C

double code(double re, double im) {
	double tmp;
	if (re <= -0.00024) {
		tmp = exp(re) * im;
	} else if ((re <= 0.295) || !(re <= 4e+95)) {
		tmp = fma(fma(fma(0.16666666666666666, re, 0.5), re, 1.0), re, 1.0) * sin(im);
	} else {
		tmp = (fma(fma(fma(-0.0001984126984126984, (im * im), 0.008333333333333333), (im * im), -0.16666666666666666), (im * im), 1.0) * exp(re)) * im;
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if (re <= -0.00024)
		tmp = Float64(exp(re) * im);
	elseif ((re <= 0.295) || !(re <= 4e+95))
		tmp = Float64(fma(fma(fma(0.16666666666666666, re, 0.5), re, 1.0), re, 1.0) * sin(im));
	else
		tmp = Float64(Float64(fma(fma(fma(-0.0001984126984126984, Float64(im * im), 0.008333333333333333), Float64(im * im), -0.16666666666666666), Float64(im * im), 1.0) * exp(re)) * im);
	end
	return tmp
end

Wolfram

code[re_, im_] := If[LessEqual[re, -0.00024], N[(N[Exp[re], $MachinePrecision] * im), $MachinePrecision], If[Or[LessEqual[re, 0.295], N[Not[LessEqual[re, 4e+95]], $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[(N[(N[(N[(-0.0001984126984126984 * N[(im * im), $MachinePrecision] + 0.008333333333333333), $MachinePrecision] * N[(im * im), $MachinePrecision] + -0.16666666666666666), $MachinePrecision] * N[(im * im), $MachinePrecision] + 1.0), $MachinePrecision] * N[Exp[re], $MachinePrecision]), $MachinePrecision] * im), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if re < -2.40000000000000006e-4

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-exp.f64 98.7

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

   5. Applied rewrites 98.7%

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

   if -2.40000000000000006e-4 < re < 0.294999999999999984 or 4.00000000000000008e95 < re

   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 \color{blue}{\left(re \cdot \left(1 + re \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot re\right)\right) + 1\right)} \cdot \sin im \]

      2. *-commutative N/A

         \[\leadsto \left(\color{blue}{\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 \color{blue}{\mathsf{fma}\left(1 + re \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot re\right), re, 1\right)} \cdot \sin im \]

      4. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{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(\color{blue}{\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(\color{blue}{\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(\color{blue}{\frac{1}{6} \cdot re + \frac{1}{2}}, re, 1\right), re, 1\right) \cdot \sin im \]

      8. lower-fma.f64 99.4

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

   5. Applied rewrites 99.4%

      \[\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.294999999999999984 < re < 4.00000000000000008e95

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

   5. Applied rewrites 86.7%

      \[\leadsto \color{blue}{\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.0001984126984126984, im \cdot im, 0.008333333333333333\right), im \cdot im, -0.16666666666666666\right), im \cdot im, 1\right) \cdot e^{re}\right) \cdot im} \]
3. Recombined 3 regimes into one program.

4. Final simplification 98.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;re \leq -0.00024:\\ \;\;\;\;e^{re} \cdot im\\ \mathbf{elif}\;re \leq 0.295 \lor \neg \left(re \leq 4 \cdot 10^{+95}\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}:\\ \;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.0001984126984126984, im \cdot im, 0.008333333333333333\right), im \cdot im, -0.16666666666666666\right), im \cdot im, 1\right) \cdot e^{re}\right) \cdot im\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 38.8% accurate, 8.6× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

3. Taylor expanded in im around 0

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. lower-exp.f64 67.2

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

5. Applied rewrites 67.2%

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

6. Taylor expanded in re around 0

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

8. Applied rewrites 37.3%

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

Alternative 12: 40.0% accurate, 9.0× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (* (fma (fma (* 0.16666666666666666 re) re 1.0) re 1.0) im))

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

3. Taylor expanded in im around 0

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. lower-exp.f64 67.2

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

5. Applied rewrites 67.2%

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

6. Taylor expanded in re around 0

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

8. Applied rewrites 37.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 \]

9. Taylor expanded in re around inf

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

11. Applied rewrites 37.2%

    \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666 \cdot re, re, 1\right), re, 1\right) \cdot im \]
12. Add Preprocessing

Alternative 13: 37.6% accurate, 11.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

3. Taylor expanded in im around 0

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. lower-exp.f64 67.2

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

5. Applied rewrites 67.2%

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

6. Taylor expanded in re around 0

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

8. Applied rewrites 36.2%

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

Alternative 14: 28.4% accurate, 17.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;im \leq 4350000000000:\\ \;\;\;\;1 \cdot im\\ \mathbf{else}:\\ \;\;\;\;im \cdot re\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= im 4350000000000.0) (* 1.0 im) (* im re)))

C

double code(double re, double im) {
	double tmp;
	if (im <= 4350000000000.0) {
		tmp = 1.0 * im;
	} else {
		tmp = im * re;
	}
	return tmp;
}

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    real(8) :: tmp
    if (im <= 4350000000000.0d0) then
        tmp = 1.0d0 * im
    else
        tmp = im * re
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if (im <= 4350000000000.0) {
		tmp = 1.0 * im;
	} else {
		tmp = im * re;
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if im <= 4350000000000.0:
		tmp = 1.0 * im
	else:
		tmp = im * re
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if (im <= 4350000000000.0)
		tmp = Float64(1.0 * im);
	else
		tmp = Float64(im * re);
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if (im <= 4350000000000.0)
		tmp = 1.0 * im;
	else
		tmp = im * re;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if im < 4.35e12

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-exp.f64 77.9

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

   5. Applied rewrites 77.9%

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

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 36.0%

      \[\leadsto 1 \cdot im \]

   if 4.35e12 < im

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-exp.f64 41.5

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

   5. Applied rewrites 41.5%

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

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 12.8%

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

   9. Taylor expanded in re around inf

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

   11. Applied rewrites 13.0%

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

   12. Taylor expanded in re around 0

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

   14. Applied rewrites 9.2%

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

Alternative 15: 29.9% accurate, 29.4× speedup

Math

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

FPCore

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

C

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

Julia

function code(re, im)
	return fma(im, re, im)
end

Wolfram

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

Derivation

1. Initial program 100.0%

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

3. Taylor expanded in im around 0

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. lower-exp.f64 67.2

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

5. Applied rewrites 67.2%

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

6. Taylor expanded in re around 0

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

8. Applied rewrites 28.8%

   \[\leadsto \mathsf{fma}\left(im, \color{blue}{re}, im\right) \]
9. Add Preprocessing

Alternative 16: 7.0% accurate, 34.3× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = im * re
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

3. Taylor expanded in im around 0

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. lower-exp.f64 67.2

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

5. Applied rewrites 67.2%

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

6. Taylor expanded in re around 0

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

8. Applied rewrites 33.6%

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

9. Taylor expanded in re around inf

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

11. Applied rewrites 11.3%

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

12. Taylor expanded in re around 0

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

14. Applied rewrites 6.5%

    \[\leadsto im \cdot re \]
15. Add Preprocessing

Reproduce

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