math.exp on complex, real part

Percentage Accurate: 100.0% → 100.0%

Time: 4.5s

Alternatives: 20

Speedup: 1.0×

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

Specification

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

Alternative 2: 99.4% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (exp re) (cos im))))
   (if (<= t_0 (- INFINITY))
     (* (exp re) (fma (* im im) -0.5 1.0))
     (if (or (<= t_0 -0.005)
             (not (or (<= t_0 0.0) (not (<= t_0 1.000000002)))))
       (* (fma (fma 0.5 re 1.0) re 1.0) (cos im))
       (exp re)))))

C

double code(double re, double im) {
	double t_0 = exp(re) * cos(im);
	double tmp;
	if (t_0 <= -((double) INFINITY)) {
		tmp = exp(re) * fma((im * im), -0.5, 1.0);
	} else if ((t_0 <= -0.005) || !((t_0 <= 0.0) || !(t_0 <= 1.000000002))) {
		tmp = fma(fma(0.5, re, 1.0), re, 1.0) * cos(im);
	} else {
		tmp = exp(re);
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(exp(re) * cos(im))
	tmp = 0.0
	if (t_0 <= Float64(-Inf))
		tmp = Float64(exp(re) * fma(Float64(im * im), -0.5, 1.0));
	elseif ((t_0 <= -0.005) || !((t_0 <= 0.0) || !(t_0 <= 1.000000002)))
		tmp = Float64(fma(fma(0.5, re, 1.0), re, 1.0) * cos(im));
	else
		tmp = exp(re);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 100.0

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

   5. Applied rewrites 100.0%

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

   if -inf.0 < (*.f64 (exp.f64 re) (cos.f64 im)) < -0.0050000000000000001 or 0.0 < (*.f64 (exp.f64 re) (cos.f64 im)) < 1.00000000199999994

   1. Initial program 100.0%

      \[e^{re} \cdot \cos 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 \cos 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 \cos im \]

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 98.8

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

   5. Applied rewrites 98.8%

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

   if -0.0050000000000000001 < (*.f64 (exp.f64 re) (cos.f64 im)) < 0.0 or 1.00000000199999994 < (*.f64 (exp.f64 re) (cos.f64 im))

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. lift-exp.f64 100.0

         \[\leadsto e^{re} \]

   5. Applied rewrites 100.0%

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

4. Final simplification 99.4%

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

Alternative 3: 99.3% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (exp re) (cos im))))
   (if (<= t_0 (- INFINITY))
     (* (exp re) (fma (* im im) -0.5 1.0))
     (if (or (<= t_0 -0.005)
             (not (or (<= t_0 0.0) (not (<= t_0 1.000000002)))))
       (* (- re -1.0) (cos im))
       (exp re)))))

C

double code(double re, double im) {
	double t_0 = exp(re) * cos(im);
	double tmp;
	if (t_0 <= -((double) INFINITY)) {
		tmp = exp(re) * fma((im * im), -0.5, 1.0);
	} else if ((t_0 <= -0.005) || !((t_0 <= 0.0) || !(t_0 <= 1.000000002))) {
		tmp = (re - -1.0) * cos(im);
	} else {
		tmp = exp(re);
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(exp(re) * cos(im))
	tmp = 0.0
	if (t_0 <= Float64(-Inf))
		tmp = Float64(exp(re) * fma(Float64(im * im), -0.5, 1.0));
	elseif ((t_0 <= -0.005) || !((t_0 <= 0.0) || !(t_0 <= 1.000000002)))
		tmp = Float64(Float64(re - -1.0) * cos(im));
	else
		tmp = exp(re);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 100.0

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

   5. Applied rewrites 100.0%

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

   if -inf.0 < (*.f64 (exp.f64 re) (cos.f64 im)) < -0.0050000000000000001 or 0.0 < (*.f64 (exp.f64 re) (cos.f64 im)) < 1.00000000199999994

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. metadata-eval N/A

         \[\leadsto \left(re + 1 \cdot \color{blue}{1}\right) \cdot \cos 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 \cos im \]

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. metadata-eval N/A

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

      7. lower--.f64 N/A

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

      8. metadata-eval 98.7

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

   5. Applied rewrites 98.7%

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

   if -0.0050000000000000001 < (*.f64 (exp.f64 re) (cos.f64 im)) < 0.0 or 1.00000000199999994 < (*.f64 (exp.f64 re) (cos.f64 im))

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. lift-exp.f64 100.0

         \[\leadsto e^{re} \]

   5. Applied rewrites 100.0%

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

4. Final simplification 99.3%

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

Alternative 4: 98.8% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (exp re) (cos im))))
   (if (<= t_0 (- INFINITY))
     (*
      (fma (fma (fma 0.16666666666666666 re 0.5) re 1.0) re 1.0)
      (fma (* im im) -0.5 1.0))
     (if (or (<= t_0 -0.005)
             (not (or (<= t_0 0.0) (not (<= t_0 1.000000002)))))
       (* (- re -1.0) (cos im))
       (exp re)))))

C

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

Julia

function code(re, im)
	t_0 = Float64(exp(re) * cos(im))
	tmp = 0.0
	if (t_0 <= Float64(-Inf))
		tmp = Float64(fma(fma(fma(0.16666666666666666, re, 0.5), re, 1.0), re, 1.0) * fma(Float64(im * im), -0.5, 1.0));
	elseif ((t_0 <= -0.005) || !((t_0 <= 0.0) || !(t_0 <= 1.000000002)))
		tmp = Float64(Float64(re - -1.0) * cos(im));
	else
		tmp = exp(re);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. 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 \mathsf{fma}\left(im \cdot im, \frac{-1}{2}, 1\right) \]
   7. 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 \mathsf{fma}\left(im \cdot im, \frac{-1}{2}, 1\right) \]

      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 \mathsf{fma}\left(im \cdot im, \frac{-1}{2}, 1\right) \]

      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 \mathsf{fma}\left(im \cdot im, \frac{-1}{2}, 1\right) \]

      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 \mathsf{fma}\left(im \cdot im, \frac{-1}{2}, 1\right) \]

      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 \mathsf{fma}\left(im \cdot im, \frac{-1}{2}, 1\right) \]

      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 \mathsf{fma}\left(im \cdot im, \frac{-1}{2}, 1\right) \]

      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 \mathsf{fma}\left(im \cdot im, \frac{-1}{2}, 1\right) \]

      8. lower-fma.f64 93.3

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

   8. Applied rewrites 93.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 \mathsf{fma}\left(im \cdot im, -0.5, 1\right) \]

   if -inf.0 < (*.f64 (exp.f64 re) (cos.f64 im)) < -0.0050000000000000001 or 0.0 < (*.f64 (exp.f64 re) (cos.f64 im)) < 1.00000000199999994

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. metadata-eval N/A

         \[\leadsto \left(re + 1 \cdot \color{blue}{1}\right) \cdot \cos 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 \cos im \]

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. metadata-eval N/A

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

      7. lower--.f64 N/A

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

      8. metadata-eval 98.7

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

   5. Applied rewrites 98.7%

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

   if -0.0050000000000000001 < (*.f64 (exp.f64 re) (cos.f64 im)) < 0.0 or 1.00000000199999994 < (*.f64 (exp.f64 re) (cos.f64 im))

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. lift-exp.f64 100.0

         \[\leadsto e^{re} \]

   5. Applied rewrites 100.0%

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

4. Final simplification 99.0%

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

Alternative 5: 98.2% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (exp re) (cos im))))
   (if (<= t_0 (- INFINITY))
     (*
      (fma (fma (fma 0.16666666666666666 re 0.5) re 1.0) re 1.0)
      (fma (* im im) -0.5 1.0))
     (if (or (<= t_0 -0.005) (not (or (<= t_0 0.0) (not (<= t_0 0.9995)))))
       (cos im)
       (exp re)))))

C

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

Julia

function code(re, im)
	t_0 = Float64(exp(re) * cos(im))
	tmp = 0.0
	if (t_0 <= Float64(-Inf))
		tmp = Float64(fma(fma(fma(0.16666666666666666, re, 0.5), re, 1.0), re, 1.0) * fma(Float64(im * im), -0.5, 1.0));
	elseif ((t_0 <= -0.005) || !((t_0 <= 0.0) || !(t_0 <= 0.9995)))
		tmp = cos(im);
	else
		tmp = exp(re);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. 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 \mathsf{fma}\left(im \cdot im, \frac{-1}{2}, 1\right) \]
   7. 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 \mathsf{fma}\left(im \cdot im, \frac{-1}{2}, 1\right) \]

      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 \mathsf{fma}\left(im \cdot im, \frac{-1}{2}, 1\right) \]

      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 \mathsf{fma}\left(im \cdot im, \frac{-1}{2}, 1\right) \]

      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 \mathsf{fma}\left(im \cdot im, \frac{-1}{2}, 1\right) \]

      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 \mathsf{fma}\left(im \cdot im, \frac{-1}{2}, 1\right) \]

      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 \mathsf{fma}\left(im \cdot im, \frac{-1}{2}, 1\right) \]

      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 \mathsf{fma}\left(im \cdot im, \frac{-1}{2}, 1\right) \]

      8. lower-fma.f64 93.3

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

   8. Applied rewrites 93.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 \mathsf{fma}\left(im \cdot im, -0.5, 1\right) \]

   if -inf.0 < (*.f64 (exp.f64 re) (cos.f64 im)) < -0.0050000000000000001 or 0.0 < (*.f64 (exp.f64 re) (cos.f64 im)) < 0.99950000000000006

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. lift-cos.f64 97.1

         \[\leadsto \cos im \]

   5. Applied rewrites 97.1%

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

   if -0.0050000000000000001 < (*.f64 (exp.f64 re) (cos.f64 im)) < 0.0 or 0.99950000000000006 < (*.f64 (exp.f64 re) (cos.f64 im))

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. lift-exp.f64 99.9

         \[\leadsto e^{re} \]

   5. Applied rewrites 99.9%

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

4. Final simplification 98.9%

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

Alternative 6: 97.6% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (exp.f64 re) (cos.f64 im)) < -0.0050000000000000001 or 0.0 < (*.f64 (exp.f64 re) (cos.f64 im)) < 1.00000000199999994

   1. Initial program 100.0%

      \[e^{re} \cdot \cos 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 \cos 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 \cos 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 \cos 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 \cos 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 \cos 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 \cos 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 \cos 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 \cos im \]

      8. lower-fma.f64 97.0

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

   5. Applied rewrites 97.0%

      \[\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 \cos im \]

   if -0.0050000000000000001 < (*.f64 (exp.f64 re) (cos.f64 im)) < 0.0 or 1.00000000199999994 < (*.f64 (exp.f64 re) (cos.f64 im))

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. lift-exp.f64 100.0

         \[\leadsto e^{re} \]

   5. Applied rewrites 100.0%

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

4. Final simplification 98.3%

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

Alternative 7: 97.4% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 (exp.f64 re) (cos.f64 im)) < -0.0050000000000000001

   1. Initial program 100.0%

      \[e^{re} \cdot \cos 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 \cos 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 \cos 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 \cos 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 \cos 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 \cos 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 \cos 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 \cos 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 \cos im \]

      8. lower-fma.f64 90.3

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

   5. Applied rewrites 90.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 \cos im \]

   6. Taylor expanded in re around inf

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

      1. *-commutative N/A

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

      2. unpow2 N/A

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

      3. associate-*r* N/A

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

      4. *-commutative N/A

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

      5. distribute-lft-in N/A

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

      6. *-commutative N/A

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

      7. *-commutative N/A

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

      8. associate-*r* N/A

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

      9. rgt-mult-inverse N/A

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

      10. metadata-eval N/A

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

      11. lower-*.f64 N/A

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

      12. lift-fma.f64 90.3

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

   8. Applied rewrites 90.3%

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

   if -0.0050000000000000001 < (*.f64 (exp.f64 re) (cos.f64 im)) < 0.0 or 1.00000000199999994 < (*.f64 (exp.f64 re) (cos.f64 im))

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. lift-exp.f64 100.0

         \[\leadsto e^{re} \]

   5. Applied rewrites 100.0%

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

   if 0.0 < (*.f64 (exp.f64 re) (cos.f64 im)) < 1.00000000199999994

   1. Initial program 100.0%

      \[e^{re} \cdot \cos 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 \cos 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 \cos im \]

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 99.4

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

   5. Applied rewrites 99.4%

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

4. Final simplification 98.3%

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

Alternative 8: 68.6% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. 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 \mathsf{fma}\left(im \cdot im, \frac{-1}{2}, 1\right) \]
   7. 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 \mathsf{fma}\left(im \cdot im, \frac{-1}{2}, 1\right) \]

      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 \mathsf{fma}\left(im \cdot im, \frac{-1}{2}, 1\right) \]

      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 \mathsf{fma}\left(im \cdot im, \frac{-1}{2}, 1\right) \]

      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 \mathsf{fma}\left(im \cdot im, \frac{-1}{2}, 1\right) \]

      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 \mathsf{fma}\left(im \cdot im, \frac{-1}{2}, 1\right) \]

      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 \mathsf{fma}\left(im \cdot im, \frac{-1}{2}, 1\right) \]

      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 \mathsf{fma}\left(im \cdot im, \frac{-1}{2}, 1\right) \]

      8. lower-fma.f64 93.3

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

   8. Applied rewrites 93.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 \mathsf{fma}\left(im \cdot im, -0.5, 1\right) \]

   if -inf.0 < (*.f64 (exp.f64 re) (cos.f64 im)) < 0.99950000000000006

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. lift-cos.f64 50.1

         \[\leadsto \cos im \]

   5. Applied rewrites 50.1%

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

   if 0.99950000000000006 < (*.f64 (exp.f64 re) (cos.f64 im))

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. lift-exp.f64 99.9

         \[\leadsto e^{re} \]

   5. Applied rewrites 99.9%

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

   6. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      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) \]

      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) \]

      8. lower-fma.f64 87.5

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

   8. Applied rewrites 87.5%

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

Alternative 9: 42.4% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 (exp.f64 re) (cos.f64 im)) < -0.54000000000000004

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. metadata-eval N/A

         \[\leadsto \left(re + 1 \cdot \color{blue}{1}\right) \cdot \cos 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 \cos im \]

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. metadata-eval N/A

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

      7. lower--.f64 N/A

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

      8. metadata-eval 57.5

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

   5. Applied rewrites 57.5%

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

   6. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. pow2 N/A

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

      7. lift-*.f64 N/A

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

      8. pow2 N/A

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

      9. lift-*.f64 0.4

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

   8. Applied rewrites 0.4%

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

   9. Taylor expanded in im around 0

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

   11. Applied rewrites 36.2%

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

   12. Taylor expanded in re around inf

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

   14. Applied rewrites 35.6%

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

   if -0.54000000000000004 < (*.f64 (exp.f64 re) (cos.f64 im)) < 2

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. metadata-eval N/A

         \[\leadsto \left(re + 1 \cdot \color{blue}{1}\right) \cdot \cos 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 \cos im \]

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. metadata-eval N/A

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

      7. lower--.f64 N/A

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

      8. metadata-eval 66.4

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

   5. Applied rewrites 66.4%

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

   6. Taylor expanded in im around 0

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

   8. Applied rewrites 47.8%

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

   if 2 < (*.f64 (exp.f64 re) (cos.f64 im))

   1. Initial program 100.0%

      \[e^{re} \cdot \cos 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 \cos 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 \cos im \]

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 46.6

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

   5. Applied rewrites 46.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right)} \cdot \cos 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}{1} \]
   7. Step-by-step derivation

   8. Applied rewrites 46.6%

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

   9. Taylor expanded in re around inf

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

       1. *-commutative N/A

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

       2. unpow2 N/A

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

       3. associate-*r* N/A

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

       4. *-commutative N/A

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

       5. distribute-lft-in N/A

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

       6. rgt-mult-inverse N/A

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

       7. *-commutative N/A

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

       8. lower-*.f64 N/A

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

       9. lift-fma.f64 46.6

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

   11. Applied rewrites 46.6%

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

Alternative 10: 41.4% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 60.7

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

   5. Applied rewrites 60.7%

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

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 8.2%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. metadata-eval N/A

         \[\leadsto \left(re + 1 \cdot \color{blue}{1}\right) \cdot \cos 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 \cos im \]

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. metadata-eval N/A

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

      7. lower--.f64 N/A

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

      8. metadata-eval 99.3

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

   5. Applied rewrites 99.3%

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

   6. Taylor expanded in im around 0

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

   8. Applied rewrites 75.0%

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

   if 2 < (*.f64 (exp.f64 re) (cos.f64 im))

   1. Initial program 100.0%

      \[e^{re} \cdot \cos 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 \cos 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 \cos im \]

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 46.6

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

   5. Applied rewrites 46.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right)} \cdot \cos 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}{1} \]
   7. Step-by-step derivation

   8. Applied rewrites 46.6%

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

   9. Taylor expanded in re around inf

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

       1. *-commutative N/A

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

       2. unpow2 N/A

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

       3. associate-*r* N/A

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

       4. *-commutative N/A

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

       5. distribute-lft-in N/A

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

       6. rgt-mult-inverse N/A

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

       7. *-commutative N/A

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

       8. lower-*.f64 N/A

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

       9. lift-fma.f64 46.6

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

   11. Applied rewrites 46.6%

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

Alternative 11: 41.4% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 60.7

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

   5. Applied rewrites 60.7%

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

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 8.2%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. metadata-eval N/A

         \[\leadsto \left(re + 1 \cdot \color{blue}{1}\right) \cdot \cos 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 \cos im \]

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. metadata-eval N/A

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

      7. lower--.f64 N/A

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

      8. metadata-eval 99.3

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

   5. Applied rewrites 99.3%

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

   6. Taylor expanded in im around 0

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

   8. Applied rewrites 75.0%

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

   if 2 < (*.f64 (exp.f64 re) (cos.f64 im))

   1. Initial program 100.0%

      \[e^{re} \cdot \cos 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 \cos 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 \cos im \]

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 46.6

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

   5. Applied rewrites 46.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right)} \cdot \cos 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}{1} \]
   7. Step-by-step derivation

   8. Applied rewrites 46.6%

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

   9. Taylor expanded in re around inf

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

       1. *-commutative N/A

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

       2. lower-*.f64 N/A

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

       3. unpow2 N/A

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

       4. lower-*.f64 46.6

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

   11. Applied rewrites 46.6%

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

Alternative 12: 46.9% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (exp.f64 re) (cos.f64 im)) < -0.0050000000000000001

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 38.6

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

   5. Applied rewrites 38.6%

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

   6. 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 \mathsf{fma}\left(im \cdot im, \frac{-1}{2}, 1\right) \]
   7. 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 \mathsf{fma}\left(im \cdot im, \frac{-1}{2}, 1\right) \]

      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 \mathsf{fma}\left(im \cdot im, \frac{-1}{2}, 1\right) \]

      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 \mathsf{fma}\left(im \cdot im, \frac{-1}{2}, 1\right) \]

      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 \mathsf{fma}\left(im \cdot im, \frac{-1}{2}, 1\right) \]

      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 \mathsf{fma}\left(im \cdot im, \frac{-1}{2}, 1\right) \]

      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 \mathsf{fma}\left(im \cdot im, \frac{-1}{2}, 1\right) \]

      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 \mathsf{fma}\left(im \cdot im, \frac{-1}{2}, 1\right) \]

      8. lower-fma.f64 36.3

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

   8. Applied rewrites 36.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 \mathsf{fma}\left(im \cdot im, -0.5, 1\right) \]

   if -0.0050000000000000001 < (*.f64 (exp.f64 re) (cos.f64 im))

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. lift-exp.f64 87.2

         \[\leadsto e^{re} \]

   5. Applied rewrites 87.2%

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

   6. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      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) \]

      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) \]

      8. lower-fma.f64 53.1

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

   8. Applied rewrites 53.1%

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

Alternative 13: 46.6% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (exp.f64 re) (cos.f64 im)) < -0.0050000000000000001

   1. Initial program 100.0%

      \[e^{re} \cdot \cos 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 \cos 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 \cos im \]

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 80.8

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

   5. Applied rewrites 80.8%

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. pow2 N/A

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

      7. lift-*.f64 N/A

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

      8. pow2 N/A

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

      9. lift-*.f64 0.5

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

   8. Applied rewrites 0.5%

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

   9. Taylor expanded in im around 0

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

   11. Applied rewrites 33.9%

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

   if -0.0050000000000000001 < (*.f64 (exp.f64 re) (cos.f64 im))

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. lift-exp.f64 87.2

         \[\leadsto e^{re} \]

   5. Applied rewrites 87.2%

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

   6. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      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) \]

      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) \]

      8. lower-fma.f64 53.1

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

   8. Applied rewrites 53.1%

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

Alternative 14: 45.9% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. metadata-eval N/A

         \[\leadsto \left(re + 1 \cdot \color{blue}{1}\right) \cdot \cos 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 \cos im \]

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. metadata-eval N/A

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

      7. lower--.f64 N/A

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

      8. metadata-eval 26.5

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

   5. Applied rewrites 26.5%

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

   6. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. pow2 N/A

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

      7. lift-*.f64 N/A

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

      8. pow2 N/A

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

      9. lift-*.f64 1.3

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

   8. Applied rewrites 1.3%

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

   9. Taylor expanded in im around 0

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

   11. Applied rewrites 13.5%

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

   if 0.0 < (*.f64 (exp.f64 re) (cos.f64 im))

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. lift-exp.f64 82.3

         \[\leadsto e^{re} \]

   5. Applied rewrites 82.3%

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

   6. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      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) \]

      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) \]

      8. lower-fma.f64 72.7

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

   8. Applied rewrites 72.7%

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

Alternative 15: 45.7% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. metadata-eval N/A

         \[\leadsto \left(re + 1 \cdot \color{blue}{1}\right) \cdot \cos 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 \cos im \]

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. metadata-eval N/A

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

      7. lower--.f64 N/A

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

      8. metadata-eval 26.5

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

   5. Applied rewrites 26.5%

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

   6. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. pow2 N/A

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

      7. lift-*.f64 N/A

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

      8. pow2 N/A

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

      9. lift-*.f64 1.3

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

   8. Applied rewrites 1.3%

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

   9. Taylor expanded in im around 0

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

   11. Applied rewrites 13.5%

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

   12. Taylor expanded in re around inf

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

   14. Applied rewrites 13.1%

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

   if 0.0 < (*.f64 (exp.f64 re) (cos.f64 im))

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. lift-exp.f64 82.3

         \[\leadsto e^{re} \]

   5. Applied rewrites 82.3%

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

   6. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      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) \]

      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) \]

      8. lower-fma.f64 72.7

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

   8. Applied rewrites 72.7%

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

Alternative 16: 42.5% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. metadata-eval N/A

         \[\leadsto \left(re + 1 \cdot \color{blue}{1}\right) \cdot \cos 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 \cos im \]

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. metadata-eval N/A

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

      7. lower--.f64 N/A

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

      8. metadata-eval 26.5

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

   5. Applied rewrites 26.5%

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

   6. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. pow2 N/A

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

      7. lift-*.f64 N/A

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

      8. pow2 N/A

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

      9. lift-*.f64 1.3

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

   8. Applied rewrites 1.3%

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

   9. Taylor expanded in im around 0

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

   11. Applied rewrites 13.5%

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

   12. Taylor expanded in re around inf

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

   14. Applied rewrites 13.1%

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

   if 0.0 < (*.f64 (exp.f64 re) (cos.f64 im))

   1. Initial program 100.0%

      \[e^{re} \cdot \cos 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 \cos 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 \cos im \]

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 83.9

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

   5. Applied rewrites 83.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right)} \cdot \cos 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}{1} \]
   7. Step-by-step derivation

   8. Applied rewrites 66.6%

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

Alternative 17: 37.9% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (exp.f64 re) (cos.f64 im)) < 2

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. metadata-eval N/A

         \[\leadsto \left(re + 1 \cdot \color{blue}{1}\right) \cdot \cos 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 \cos im \]

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. metadata-eval N/A

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

      7. lower--.f64 N/A

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

      8. metadata-eval 65.0

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

   5. Applied rewrites 65.0%

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

   6. Taylor expanded in im around 0

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

   8. Applied rewrites 40.5%

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

   if 2 < (*.f64 (exp.f64 re) (cos.f64 im))

   1. Initial program 100.0%

      \[e^{re} \cdot \cos 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 \cos 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 \cos im \]

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 46.6

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

   5. Applied rewrites 46.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(0.5, re, 1\right), re, 1\right)} \cdot \cos 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}{1} \]
   7. Step-by-step derivation

   8. Applied rewrites 46.6%

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

   9. Taylor expanded in re around inf

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

       1. *-commutative N/A

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

       2. lower-*.f64 N/A

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

       3. unpow2 N/A

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

       4. lower-*.f64 46.6

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

   11. Applied rewrites 46.6%

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

Alternative 18: 97.4% accurate, 1.5× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re -0.36)
   (exp re)
   (if (<= re 145.0)
     (* (fma (fma 0.5 re 1.0) re 1.0) (cos im))
     (if (<= re 1.02e+103)
       (exp re)
       (* (* (* re re) (fma 0.16666666666666666 re 0.5)) (cos im))))))

C

double code(double re, double im) {
	double tmp;
	if (re <= -0.36) {
		tmp = exp(re);
	} else if (re <= 145.0) {
		tmp = fma(fma(0.5, re, 1.0), re, 1.0) * cos(im);
	} else if (re <= 1.02e+103) {
		tmp = exp(re);
	} else {
		tmp = ((re * re) * fma(0.16666666666666666, re, 0.5)) * cos(im);
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if (re <= -0.36)
		tmp = exp(re);
	elseif (re <= 145.0)
		tmp = Float64(fma(fma(0.5, re, 1.0), re, 1.0) * cos(im));
	elseif (re <= 1.02e+103)
		tmp = exp(re);
	else
		tmp = Float64(Float64(Float64(re * re) * fma(0.16666666666666666, re, 0.5)) * cos(im));
	end
	return tmp
end

Wolfram

code[re_, im_] := If[LessEqual[re, -0.36], N[Exp[re], $MachinePrecision], If[LessEqual[re, 145.0], N[(N[(N[(0.5 * re + 1.0), $MachinePrecision] * re + 1.0), $MachinePrecision] * N[Cos[im], $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 1.02e+103], N[Exp[re], $MachinePrecision], N[(N[(N[(re * re), $MachinePrecision] * N[(0.16666666666666666 * re + 0.5), $MachinePrecision]), $MachinePrecision] * N[Cos[im], $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if re < -0.35999999999999999 or 145 < re < 1.01999999999999991e103

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. lift-exp.f64 96.2

         \[\leadsto e^{re} \]

   5. Applied rewrites 96.2%

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

   if -0.35999999999999999 < re < 145

   1. Initial program 100.0%

      \[e^{re} \cdot \cos 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 \cos 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 \cos im \]

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 98.8

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

   5. Applied rewrites 98.8%

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

   if 1.01999999999999991e103 < re

   1. Initial program 100.0%

      \[e^{re} \cdot \cos 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 \cos 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 \cos 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 \cos 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 \cos 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 \cos 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 \cos 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 \cos 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 \cos im \]

      8. lower-fma.f64 100.0

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

   5. Applied rewrites 100.0%

      \[\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 \cos im \]

   6. Taylor expanded in re around inf

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

      1. *-commutative N/A

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

      2. unpow3 N/A

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

      3. unpow2 N/A

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

      4. associate-*r* N/A

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

      5. unpow2 N/A

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

      6. associate-*r* N/A

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

      7. *-commutative N/A

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

      8. distribute-lft-in N/A

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

      9. *-commutative N/A

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

      10. *-commutative N/A

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

      11. associate-*r* N/A

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

      12. rgt-mult-inverse N/A

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

      13. metadata-eval N/A

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

      14. *-commutative N/A

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

      15. associate-*r* N/A

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

      16. *-commutative N/A

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

      17. associate-*r* N/A

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

      18. unpow2 N/A

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

      19. lower-*.f64 N/A

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

   8. Applied rewrites 100.0%

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

Alternative 19: 29.0% accurate, 22.9× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(re, im)
use fmin_fmax_functions
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = (re - (-1.0d0)) * 1.0d0
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

3. Taylor expanded in re around 0

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

   1. +-commutative N/A

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

   2. metadata-eval N/A

      \[\leadsto \left(re + 1 \cdot \color{blue}{1}\right) \cdot \cos 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 \cos im \]

   4. metadata-eval N/A

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

   5. metadata-eval N/A

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

   6. metadata-eval N/A

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

   7. lower--.f64 N/A

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

   8. metadata-eval 54.2

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

5. Applied rewrites 54.2%

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

6. Taylor expanded in im around 0

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

8. Applied rewrites 34.1%

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

Alternative 20: 28.5% accurate, 206.0× speedup

Math

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

FPCore

(FPCore (re im) :precision binary64 1.0)

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(re, im)
use fmin_fmax_functions
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = 1.0d0
end function

Java

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

Python

def code(re, im):
	return 1.0

Julia

function code(re, im)
	return 1.0
end

MATLAB

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

Wolfram

code[re_, im_] := 1.0

Derivation

1. Initial program 100.0%

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

3. Taylor expanded in im around 0

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

   1. lift-exp.f64 74.1

      \[\leadsto e^{re} \]

5. Applied rewrites 74.1%

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

6. Taylor expanded in re around 0

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

8. Applied rewrites 33.7%

   \[\leadsto 1 \]
9. Add Preprocessing

Reproduce

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