math.exp on complex, real part

Percentage Accurate: 100.0% → 100.0%

Time: 2.4s

Alternatives: 14

Speedup: 1.0×

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

Alternative 2: 98.8% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (fma (fma 0.5 re 1.0) re 1.0) (cos im)))
        (t_1 (* (exp re) (cos im))))
   (if (<= t_1 (- INFINITY))
     (* (exp re) (* (* im im) -0.5))
     (if (<= t_1 -0.001)
       t_0
       (if (<= t_1 1e-37) (exp re) (if (<= t_1 0.995) t_0 (exp re)))))))

C

double code(double re, double im) {
	double t_0 = fma(fma(0.5, re, 1.0), re, 1.0) * cos(im);
	double t_1 = exp(re) * cos(im);
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = exp(re) * ((im * im) * -0.5);
	} else if (t_1 <= -0.001) {
		tmp = t_0;
	} else if (t_1 <= 1e-37) {
		tmp = exp(re);
	} else if (t_1 <= 0.995) {
		tmp = t_0;
	} else {
		tmp = exp(re);
	}
	return tmp;
}

Julia

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

Wolfram

code[re_, im_] := Block[{t$95$0 = N[(N[(N[(0.5 * re + 1.0), $MachinePrecision] * re + 1.0), $MachinePrecision] * N[Cos[im], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Exp[re], $MachinePrecision] * N[Cos[im], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(N[Exp[re], $MachinePrecision] * N[(N[(im * im), $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, -0.001], t$95$0, If[LessEqual[t$95$1, 1e-37], N[Exp[re], $MachinePrecision], If[LessEqual[t$95$1, 0.995], t$95$0, 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. Taylor expanded in im around 0

      \[\leadsto e^{re} \cdot \color{blue}{\left(1 + \frac{-1}{2} \cdot {im}^{2}\right)} \]
   3. 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) \]

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in im around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. pow2 N/A

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

      4. lift-*.f64 100.0

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

   7. Applied rewrites 100.0%

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

   if -inf.0 < (*.f64 (exp.f64 re) (cos.f64 im)) < -1e-3 or 1.00000000000000007e-37 < (*.f64 (exp.f64 re) (cos.f64 im)) < 0.994999999999999996

   1. Initial program 100.0%

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

   2. 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 \]
   3. 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.6

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

   4. Applied rewrites 98.6%

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

   if -1e-3 < (*.f64 (exp.f64 re) (cos.f64 im)) < 1.00000000000000007e-37 or 0.994999999999999996 < (*.f64 (exp.f64 re) (cos.f64 im))

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

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

      1. lift-exp.f64 98.8

         \[\leadsto e^{re} \]

   4. Applied rewrites 98.8%

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

Alternative 3: 98.7% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \cos im \cdot \frac{-1}{re - 1}\\ t_1 := e^{re} \cdot \cos im\\ \mathbf{if}\;t\_1 \leq -\infty:\\ \;\;\;\;e^{re} \cdot \left(\left(im \cdot im\right) \cdot -0.5\right)\\ \mathbf{elif}\;t\_1 \leq -0.001:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;t\_1 \leq 10^{-37}:\\ \;\;\;\;e^{re}\\ \mathbf{elif}\;t\_1 \leq 0.995:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;e^{re}\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (cos im) (/ -1.0 (- re 1.0)))) (t_1 (* (exp re) (cos im))))
   (if (<= t_1 (- INFINITY))
     (* (exp re) (* (* im im) -0.5))
     (if (<= t_1 -0.001)
       t_0
       (if (<= t_1 1e-37) (exp re) (if (<= t_1 0.995) t_0 (exp re)))))))

C

double code(double re, double im) {
	double t_0 = cos(im) * (-1.0 / (re - 1.0));
	double t_1 = exp(re) * cos(im);
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = exp(re) * ((im * im) * -0.5);
	} else if (t_1 <= -0.001) {
		tmp = t_0;
	} else if (t_1 <= 1e-37) {
		tmp = exp(re);
	} else if (t_1 <= 0.995) {
		tmp = t_0;
	} else {
		tmp = exp(re);
	}
	return tmp;
}

Java

public static double code(double re, double im) {
	double t_0 = Math.cos(im) * (-1.0 / (re - 1.0));
	double t_1 = Math.exp(re) * Math.cos(im);
	double tmp;
	if (t_1 <= -Double.POSITIVE_INFINITY) {
		tmp = Math.exp(re) * ((im * im) * -0.5);
	} else if (t_1 <= -0.001) {
		tmp = t_0;
	} else if (t_1 <= 1e-37) {
		tmp = Math.exp(re);
	} else if (t_1 <= 0.995) {
		tmp = t_0;
	} else {
		tmp = Math.exp(re);
	}
	return tmp;
}

Python

def code(re, im):
	t_0 = math.cos(im) * (-1.0 / (re - 1.0))
	t_1 = math.exp(re) * math.cos(im)
	tmp = 0
	if t_1 <= -math.inf:
		tmp = math.exp(re) * ((im * im) * -0.5)
	elif t_1 <= -0.001:
		tmp = t_0
	elif t_1 <= 1e-37:
		tmp = math.exp(re)
	elif t_1 <= 0.995:
		tmp = t_0
	else:
		tmp = math.exp(re)
	return tmp

Julia

function code(re, im)
	t_0 = Float64(cos(im) * Float64(-1.0 / Float64(re - 1.0)))
	t_1 = Float64(exp(re) * cos(im))
	tmp = 0.0
	if (t_1 <= Float64(-Inf))
		tmp = Float64(exp(re) * Float64(Float64(im * im) * -0.5));
	elseif (t_1 <= -0.001)
		tmp = t_0;
	elseif (t_1 <= 1e-37)
		tmp = exp(re);
	elseif (t_1 <= 0.995)
		tmp = t_0;
	else
		tmp = exp(re);
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	t_0 = cos(im) * (-1.0 / (re - 1.0));
	t_1 = exp(re) * cos(im);
	tmp = 0.0;
	if (t_1 <= -Inf)
		tmp = exp(re) * ((im * im) * -0.5);
	elseif (t_1 <= -0.001)
		tmp = t_0;
	elseif (t_1 <= 1e-37)
		tmp = exp(re);
	elseif (t_1 <= 0.995)
		tmp = t_0;
	else
		tmp = exp(re);
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := Block[{t$95$0 = N[(N[Cos[im], $MachinePrecision] * N[(-1.0 / N[(re - 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Exp[re], $MachinePrecision] * N[Cos[im], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(N[Exp[re], $MachinePrecision] * N[(N[(im * im), $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, -0.001], t$95$0, If[LessEqual[t$95$1, 1e-37], N[Exp[re], $MachinePrecision], If[LessEqual[t$95$1, 0.995], t$95$0, 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. Taylor expanded in im around 0

      \[\leadsto e^{re} \cdot \color{blue}{\left(1 + \frac{-1}{2} \cdot {im}^{2}\right)} \]
   3. 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) \]

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in im around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. pow2 N/A

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

      4. lift-*.f64 100.0

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

   7. Applied rewrites 100.0%

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

   if -inf.0 < (*.f64 (exp.f64 re) (cos.f64 im)) < -1e-3 or 1.00000000000000007e-37 < (*.f64 (exp.f64 re) (cos.f64 im)) < 0.994999999999999996

   1. Initial program 100.0%

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

   2. Taylor expanded in re around 0

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

      1. distribute-rgt1-in N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift-cos.f64 N/A

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

      6. +-commutative N/A

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

      7. metadata-eval N/A

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

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

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

      9. metadata-eval N/A

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

      10. metadata-eval N/A

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

      11. metadata-eval N/A

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

      12. lower--.f64 N/A

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

      13. metadata-eval 98.2

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

   4. Applied rewrites 98.2%

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

      1. lift--.f64 N/A

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

      2. flip-- N/A

         \[\leadsto \cos im \cdot \frac{re \cdot re - -1 \cdot -1}{\color{blue}{re + -1}} \]

      3. lower-/.f64 N/A

         \[\leadsto \cos im \cdot \frac{re \cdot re - -1 \cdot -1}{\color{blue}{re + -1}} \]

      4. metadata-eval N/A

         \[\leadsto \cos im \cdot \frac{re \cdot re - 1}{re + -1} \]

      5. unpow2 N/A

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

      6. negate-sub N/A

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

      7. unpow2 N/A

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

      8. metadata-eval N/A

         \[\leadsto \cos im \cdot \frac{re \cdot re + -1}{re + -1} \]

      9. lower-fma.f64 N/A

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

      10. metadata-eval N/A

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

      11. negate-sub-reverse N/A

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

      12. lower--.f64 98.2

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

   6. Applied rewrites 98.2%

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

   7. Taylor expanded in re around 0

      \[\leadsto \cos im \cdot \frac{-1}{\color{blue}{re} - 1} \]
   8. Step-by-step derivation

   9. Applied rewrites 98.2%

      \[\leadsto \cos im \cdot \frac{-1}{\color{blue}{re} - 1} \]

   if -1e-3 < (*.f64 (exp.f64 re) (cos.f64 im)) < 1.00000000000000007e-37 or 0.994999999999999996 < (*.f64 (exp.f64 re) (cos.f64 im))

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

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

      1. lift-exp.f64 98.8

         \[\leadsto e^{re} \]

   4. Applied rewrites 98.8%

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

Alternative 4: 98.7% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (cos im) (- re -1.0))) (t_1 (* (exp re) (cos im))))
   (if (<= t_1 (- INFINITY))
     (* (exp re) (* (* im im) -0.5))
     (if (<= t_1 -0.001)
       t_0
       (if (<= t_1 1e-37) (exp re) (if (<= t_1 0.995) t_0 (exp re)))))))

C

double code(double re, double im) {
	double t_0 = cos(im) * (re - -1.0);
	double t_1 = exp(re) * cos(im);
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = exp(re) * ((im * im) * -0.5);
	} else if (t_1 <= -0.001) {
		tmp = t_0;
	} else if (t_1 <= 1e-37) {
		tmp = exp(re);
	} else if (t_1 <= 0.995) {
		tmp = t_0;
	} else {
		tmp = exp(re);
	}
	return tmp;
}

Java

public static double code(double re, double im) {
	double t_0 = Math.cos(im) * (re - -1.0);
	double t_1 = Math.exp(re) * Math.cos(im);
	double tmp;
	if (t_1 <= -Double.POSITIVE_INFINITY) {
		tmp = Math.exp(re) * ((im * im) * -0.5);
	} else if (t_1 <= -0.001) {
		tmp = t_0;
	} else if (t_1 <= 1e-37) {
		tmp = Math.exp(re);
	} else if (t_1 <= 0.995) {
		tmp = t_0;
	} else {
		tmp = Math.exp(re);
	}
	return tmp;
}

Python

def code(re, im):
	t_0 = math.cos(im) * (re - -1.0)
	t_1 = math.exp(re) * math.cos(im)
	tmp = 0
	if t_1 <= -math.inf:
		tmp = math.exp(re) * ((im * im) * -0.5)
	elif t_1 <= -0.001:
		tmp = t_0
	elif t_1 <= 1e-37:
		tmp = math.exp(re)
	elif t_1 <= 0.995:
		tmp = t_0
	else:
		tmp = math.exp(re)
	return tmp

Julia

function code(re, im)
	t_0 = Float64(cos(im) * Float64(re - -1.0))
	t_1 = Float64(exp(re) * cos(im))
	tmp = 0.0
	if (t_1 <= Float64(-Inf))
		tmp = Float64(exp(re) * Float64(Float64(im * im) * -0.5));
	elseif (t_1 <= -0.001)
		tmp = t_0;
	elseif (t_1 <= 1e-37)
		tmp = exp(re);
	elseif (t_1 <= 0.995)
		tmp = t_0;
	else
		tmp = exp(re);
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	t_0 = cos(im) * (re - -1.0);
	t_1 = exp(re) * cos(im);
	tmp = 0.0;
	if (t_1 <= -Inf)
		tmp = exp(re) * ((im * im) * -0.5);
	elseif (t_1 <= -0.001)
		tmp = t_0;
	elseif (t_1 <= 1e-37)
		tmp = exp(re);
	elseif (t_1 <= 0.995)
		tmp = t_0;
	else
		tmp = exp(re);
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := Block[{t$95$0 = N[(N[Cos[im], $MachinePrecision] * N[(re - -1.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Exp[re], $MachinePrecision] * N[Cos[im], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(N[Exp[re], $MachinePrecision] * N[(N[(im * im), $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, -0.001], t$95$0, If[LessEqual[t$95$1, 1e-37], N[Exp[re], $MachinePrecision], If[LessEqual[t$95$1, 0.995], t$95$0, 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. Taylor expanded in im around 0

      \[\leadsto e^{re} \cdot \color{blue}{\left(1 + \frac{-1}{2} \cdot {im}^{2}\right)} \]
   3. 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) \]

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in im around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. pow2 N/A

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

      4. lift-*.f64 100.0

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

   7. Applied rewrites 100.0%

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

   if -inf.0 < (*.f64 (exp.f64 re) (cos.f64 im)) < -1e-3 or 1.00000000000000007e-37 < (*.f64 (exp.f64 re) (cos.f64 im)) < 0.994999999999999996

   1. Initial program 100.0%

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

   2. Taylor expanded in re around 0

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

      1. distribute-rgt1-in N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift-cos.f64 N/A

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

      6. +-commutative N/A

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

      7. metadata-eval N/A

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

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

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

      9. metadata-eval N/A

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

      10. metadata-eval N/A

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

      11. metadata-eval N/A

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

      12. lower--.f64 N/A

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

      13. metadata-eval 98.2

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

   4. Applied rewrites 98.2%

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

   if -1e-3 < (*.f64 (exp.f64 re) (cos.f64 im)) < 1.00000000000000007e-37 or 0.994999999999999996 < (*.f64 (exp.f64 re) (cos.f64 im))

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

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

      1. lift-exp.f64 98.8

         \[\leadsto e^{re} \]

   4. Applied rewrites 98.8%

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

Alternative 5: 98.5% 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 \left(\left(im \cdot im\right) \cdot -0.5\right)\\ \mathbf{elif}\;t\_0 \leq -0.001:\\ \;\;\;\;\cos im\\ \mathbf{elif}\;t\_0 \leq 10^{-37}:\\ \;\;\;\;e^{re}\\ \mathbf{elif}\;t\_0 \leq 0.995:\\ \;\;\;\;\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) (* (* im im) -0.5))
     (if (<= t_0 -0.001)
       (cos im)
       (if (<= t_0 1e-37) (exp re) (if (<= t_0 0.995) (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) * ((im * im) * -0.5);
	} else if (t_0 <= -0.001) {
		tmp = cos(im);
	} else if (t_0 <= 1e-37) {
		tmp = exp(re);
	} else if (t_0 <= 0.995) {
		tmp = cos(im);
	} else {
		tmp = exp(re);
	}
	return tmp;
}

Java

public static double code(double re, double im) {
	double t_0 = Math.exp(re) * Math.cos(im);
	double tmp;
	if (t_0 <= -Double.POSITIVE_INFINITY) {
		tmp = Math.exp(re) * ((im * im) * -0.5);
	} else if (t_0 <= -0.001) {
		tmp = Math.cos(im);
	} else if (t_0 <= 1e-37) {
		tmp = Math.exp(re);
	} else if (t_0 <= 0.995) {
		tmp = Math.cos(im);
	} else {
		tmp = Math.exp(re);
	}
	return tmp;
}

Python

def code(re, im):
	t_0 = math.exp(re) * math.cos(im)
	tmp = 0
	if t_0 <= -math.inf:
		tmp = math.exp(re) * ((im * im) * -0.5)
	elif t_0 <= -0.001:
		tmp = math.cos(im)
	elif t_0 <= 1e-37:
		tmp = math.exp(re)
	elif t_0 <= 0.995:
		tmp = math.cos(im)
	else:
		tmp = math.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) * Float64(Float64(im * im) * -0.5));
	elseif (t_0 <= -0.001)
		tmp = cos(im);
	elseif (t_0 <= 1e-37)
		tmp = exp(re);
	elseif (t_0 <= 0.995)
		tmp = cos(im);
	else
		tmp = exp(re);
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	t_0 = exp(re) * cos(im);
	tmp = 0.0;
	if (t_0 <= -Inf)
		tmp = exp(re) * ((im * im) * -0.5);
	elseif (t_0 <= -0.001)
		tmp = cos(im);
	elseif (t_0 <= 1e-37)
		tmp = exp(re);
	elseif (t_0 <= 0.995)
		tmp = cos(im);
	else
		tmp = exp(re);
	end
	tmp_2 = 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), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, -0.001], N[Cos[im], $MachinePrecision], If[LessEqual[t$95$0, 1e-37], N[Exp[re], $MachinePrecision], If[LessEqual[t$95$0, 0.995], 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. Taylor expanded in im around 0

      \[\leadsto e^{re} \cdot \color{blue}{\left(1 + \frac{-1}{2} \cdot {im}^{2}\right)} \]
   3. 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) \]

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in im around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. pow2 N/A

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

      4. lift-*.f64 100.0

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

   7. Applied rewrites 100.0%

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

   if -inf.0 < (*.f64 (exp.f64 re) (cos.f64 im)) < -1e-3 or 1.00000000000000007e-37 < (*.f64 (exp.f64 re) (cos.f64 im)) < 0.994999999999999996

   1. Initial program 100.0%

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

   2. Taylor expanded in re around 0

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

      1. lift-cos.f64 97.0

         \[\leadsto \cos im \]

   4. Applied rewrites 97.0%

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

   if -1e-3 < (*.f64 (exp.f64 re) (cos.f64 im)) < 1.00000000000000007e-37 or 0.994999999999999996 < (*.f64 (exp.f64 re) (cos.f64 im))

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

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

      1. lift-exp.f64 98.8

         \[\leadsto e^{re} \]

   4. Applied rewrites 98.8%

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

Alternative 6: 78.4% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (exp.f64 re) (cos.f64 im)) < -1e-3

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

      \[\leadsto e^{re} \cdot \color{blue}{\left(1 + \frac{-1}{2} \cdot {im}^{2}\right)} \]
   3. 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 36.4

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

   4. Applied rewrites 36.4%

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

   5. Taylor expanded in im around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. pow2 N/A

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

      4. lift-*.f64 36.4

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

   7. Applied rewrites 36.4%

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

   if -1e-3 < (*.f64 (exp.f64 re) (cos.f64 im))

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

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

      1. lift-exp.f64 88.0

         \[\leadsto e^{re} \]

   4. Applied rewrites 88.0%

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

Alternative 7: 77.0% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (exp.f64 re) (cos.f64 im)) < -1e-3

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

      \[\leadsto e^{re} \cdot \color{blue}{\left(1 + \frac{-1}{2} \cdot {im}^{2}\right)} \]
   3. 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 36.4

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

   4. Applied rewrites 36.4%

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

   5. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. metadata-eval N/A

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

      3. negate-sub N/A

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

      4. lift--.f64 28.6

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

   7. Applied rewrites 28.6%

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

   8. Taylor expanded in im around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. pow2 N/A

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

      4. lift-*.f64 28.6

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

   10. Applied rewrites 28.6%

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

   if -1e-3 < (*.f64 (exp.f64 re) (cos.f64 im))

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

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

      1. lift-exp.f64 88.0

         \[\leadsto e^{re} \]

   4. Applied rewrites 88.0%

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

Alternative 8: 75.5% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (exp.f64 re) (cos.f64 im)) < -1e-3

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

      \[\leadsto e^{re} \cdot \color{blue}{\left(1 + \frac{-1}{2} \cdot {im}^{2}\right)} \]
   3. 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 36.4

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

   4. Applied rewrites 36.4%

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

   5. Taylor expanded in re around 0

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

   7. Applied rewrites 20.5%

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

   8. Taylor expanded in im around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. pow2 N/A

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

      4. lift-*.f64 20.5

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

   10. Applied rewrites 20.5%

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

       1. lift-*.f64 N/A

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

       2. lift-*.f64 N/A

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

       3. associate-*l* N/A

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

       4. lower-*.f64 N/A

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

       5. lower-*.f64 20.5

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

   12. Applied rewrites 20.5%

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

   if -1e-3 < (*.f64 (exp.f64 re) (cos.f64 im))

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

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

      1. lift-exp.f64 88.0

         \[\leadsto e^{re} \]

   4. Applied rewrites 88.0%

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

Alternative 9: 48.3% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* (exp re) (cos im)) 0.0)
   (* 1.0 (* im (* im -0.5)))
   (fma (fma 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 = 1.0 * (im * (im * -0.5));
	} else {
		tmp = fma(fma(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(1.0 * Float64(im * Float64(im * -0.5)));
	else
		tmp = fma(fma(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[(1.0 * N[(im * N[(im * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(0.5 * 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. Taylor expanded in im around 0

      \[\leadsto e^{re} \cdot \color{blue}{\left(1 + \frac{-1}{2} \cdot {im}^{2}\right)} \]
   3. 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 59.0

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

   4. Applied rewrites 59.0%

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

   5. Taylor expanded in re around 0

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

   7. Applied rewrites 10.2%

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

   8. Taylor expanded in im around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. pow2 N/A

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

      4. lift-*.f64 24.0

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

   10. Applied rewrites 24.0%

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

       1. lift-*.f64 N/A

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

       2. lift-*.f64 N/A

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

       3. associate-*l* N/A

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

       4. lower-*.f64 N/A

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

       5. lower-*.f64 24.0

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

   12. Applied rewrites 24.0%

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

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

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

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

      1. lift-exp.f64 82.9

         \[\leadsto e^{re} \]

   4. Applied rewrites 82.9%

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

   5. Taylor expanded in re around 0

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

   7. Applied rewrites 49.1%

      \[\leadsto 1 \]

   8. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 66.8

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

   10. Applied rewrites 66.8%

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

Alternative 10: 48.2% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Java

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

Python

def code(re, im):
	t_0 = math.exp(re) * math.cos(im)
	tmp = 0
	if t_0 <= 0.0:
		tmp = 1.0 * (im * (im * -0.5))
	elif t_0 <= 2.0:
		tmp = 1.0 * (-1.0 / (re - 1.0))
	else:
		tmp = (re * re) * 0.5
	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 * Float64(im * Float64(im * -0.5)));
	elseif (t_0 <= 2.0)
		tmp = Float64(1.0 * Float64(-1.0 / Float64(re - 1.0)));
	else
		tmp = Float64(Float64(re * re) * 0.5);
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	t_0 = exp(re) * cos(im);
	tmp = 0.0;
	if (t_0 <= 0.0)
		tmp = 1.0 * (im * (im * -0.5));
	elseif (t_0 <= 2.0)
		tmp = 1.0 * (-1.0 / (re - 1.0));
	else
		tmp = (re * re) * 0.5;
	end
	tmp_2 = 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[(im * N[(im * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 2.0], N[(1.0 * N[(-1.0 / N[(re - 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(re * re), $MachinePrecision] * 0.5), $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. Taylor expanded in im around 0

      \[\leadsto e^{re} \cdot \color{blue}{\left(1 + \frac{-1}{2} \cdot {im}^{2}\right)} \]
   3. 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 59.0

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

   4. Applied rewrites 59.0%

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

   5. Taylor expanded in re around 0

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

   7. Applied rewrites 10.2%

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

   8. Taylor expanded in im around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. pow2 N/A

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

      4. lift-*.f64 24.0

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

   10. Applied rewrites 24.0%

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

       1. lift-*.f64 N/A

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

       2. lift-*.f64 N/A

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

       3. associate-*l* N/A

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

       4. lower-*.f64 N/A

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

       5. lower-*.f64 24.0

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

   12. Applied rewrites 24.0%

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

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

   1. Initial program 100.0%

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

   2. Taylor expanded in re around 0

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

      1. distribute-rgt1-in N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift-cos.f64 N/A

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

      6. +-commutative N/A

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

      7. metadata-eval N/A

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

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

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

      9. metadata-eval N/A

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

      10. metadata-eval N/A

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

      11. metadata-eval N/A

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

      12. lower--.f64 N/A

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

      13. metadata-eval 98.5

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

   4. Applied rewrites 98.5%

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

      1. lift--.f64 N/A

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

      2. flip-- N/A

         \[\leadsto \cos im \cdot \frac{re \cdot re - -1 \cdot -1}{\color{blue}{re + -1}} \]

      3. lower-/.f64 N/A

         \[\leadsto \cos im \cdot \frac{re \cdot re - -1 \cdot -1}{\color{blue}{re + -1}} \]

      4. metadata-eval N/A

         \[\leadsto \cos im \cdot \frac{re \cdot re - 1}{re + -1} \]

      5. unpow2 N/A

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

      6. negate-sub N/A

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

      7. unpow2 N/A

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

      8. metadata-eval N/A

         \[\leadsto \cos im \cdot \frac{re \cdot re + -1}{re + -1} \]

      9. lower-fma.f64 N/A

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

      10. metadata-eval N/A

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

      11. negate-sub-reverse N/A

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

      12. lower--.f64 98.5

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

   6. Applied rewrites 98.5%

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

   7. Taylor expanded in re around 0

      \[\leadsto \cos im \cdot \frac{-1}{\color{blue}{re} - 1} \]
   8. Step-by-step derivation

   9. Applied rewrites 98.6%

      \[\leadsto \cos im \cdot \frac{-1}{\color{blue}{re} - 1} \]

   10. Taylor expanded in im around 0

       \[\leadsto 1 \cdot \frac{\color{blue}{-1}}{re - 1} \]
   11. Step-by-step derivation

   12. Applied rewrites 73.2%

       \[\leadsto 1 \cdot \frac{\color{blue}{-1}}{re - 1} \]

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

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

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

      1. lift-exp.f64 99.8

         \[\leadsto e^{re} \]

   4. Applied rewrites 99.8%

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

   5. Taylor expanded in re around 0

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

   7. Applied rewrites 3.2%

      \[\leadsto 1 \]

   8. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 53.8

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

   10. Applied rewrites 53.8%

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

   11. Taylor expanded in re around inf

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

       1. *-commutative N/A

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

       2. lower-*.f64 N/A

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

       3. pow2 N/A

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

       4. lower-*.f64 53.7

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

   13. Applied rewrites 53.7%

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

Alternative 11: 48.2% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

function tmp_2 = code(re, im)
	t_0 = exp(re) * cos(im);
	tmp = 0.0;
	if (t_0 <= 1e-37)
		tmp = 1.0 * (im * (im * -0.5));
	elseif (t_0 <= 2.0)
		tmp = re - -1.0;
	else
		tmp = (re * re) * 0.5;
	end
	tmp_2 = 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, 1e-37], N[(1.0 * N[(im * N[(im * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 2.0], N[(re - -1.0), $MachinePrecision], N[(N[(re * re), $MachinePrecision] * 0.5), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (exp.f64 re) (cos.f64 im)) < 1.00000000000000007e-37

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

      \[\leadsto e^{re} \cdot \color{blue}{\left(1 + \frac{-1}{2} \cdot {im}^{2}\right)} \]
   3. 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 59.0

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

   4. Applied rewrites 59.0%

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

   5. Taylor expanded in re around 0

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

   7. Applied rewrites 10.2%

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

   8. Taylor expanded in im around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. pow2 N/A

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

      4. lift-*.f64 24.0

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

   10. Applied rewrites 24.0%

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

       1. lift-*.f64 N/A

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

       2. lift-*.f64 N/A

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

       3. associate-*l* N/A

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

       4. lower-*.f64 N/A

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

       5. lower-*.f64 24.0

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

   12. Applied rewrites 24.0%

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

   if 1.00000000000000007e-37 < (*.f64 (exp.f64 re) (cos.f64 im)) < 2

   1. Initial program 100.0%

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

   2. Taylor expanded in re around 0

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

      1. distribute-rgt1-in N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift-cos.f64 N/A

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

      6. +-commutative N/A

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

      7. metadata-eval N/A

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

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

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

      9. metadata-eval N/A

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

      10. metadata-eval N/A

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

      11. metadata-eval N/A

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

      12. lower--.f64 N/A

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

      13. metadata-eval 98.7

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

   4. Applied rewrites 98.7%

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

   5. Taylor expanded in im around 0

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

      1. +-commutative N/A

         \[\leadsto re + 1 \]

      2. metadata-eval N/A

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

      3. negate-sub N/A

         \[\leadsto re - -1 \]

      4. lift--.f64 73.3

         \[\leadsto re - -1 \]

   7. Applied rewrites 73.3%

      \[\leadsto re - \color{blue}{-1} \]

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

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

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

      1. lift-exp.f64 99.8

         \[\leadsto e^{re} \]

   4. Applied rewrites 99.8%

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

   5. Taylor expanded in re around 0

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

   7. Applied rewrites 3.2%

      \[\leadsto 1 \]

   8. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 53.8

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

   10. Applied rewrites 53.8%

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

   11. Taylor expanded in re around inf

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

       1. *-commutative N/A

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

       2. lower-*.f64 N/A

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

       3. pow2 N/A

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

       4. lower-*.f64 53.7

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

   13. Applied rewrites 53.7%

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

Alternative 12: 38.6% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

function code(re, im)
	tmp = 0.0
	if (Float64(exp(re) * cos(im)) <= 2.0)
		tmp = Float64(re - -1.0);
	else
		tmp = Float64(Float64(re * re) * 0.5);
	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;
	else
		tmp = (re * re) * 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[N[(N[Exp[re], $MachinePrecision] * N[Cos[im], $MachinePrecision]), $MachinePrecision], 2.0], N[(re - -1.0), $MachinePrecision], N[(N[(re * re), $MachinePrecision] * 0.5), $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. Taylor expanded in re around 0

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

      1. distribute-rgt1-in N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift-cos.f64 N/A

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

      6. +-commutative N/A

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

      7. metadata-eval N/A

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

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

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

      9. metadata-eval N/A

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

      10. metadata-eval N/A

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

      11. metadata-eval N/A

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

      12. lower--.f64 N/A

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

      13. metadata-eval 62.0

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

   4. Applied rewrites 62.0%

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

   5. Taylor expanded in im around 0

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

      1. +-commutative N/A

         \[\leadsto re + 1 \]

      2. metadata-eval N/A

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

      3. negate-sub N/A

         \[\leadsto re - -1 \]

      4. lift--.f64 35.0

         \[\leadsto re - -1 \]

   7. Applied rewrites 35.0%

      \[\leadsto re - \color{blue}{-1} \]

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

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

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

      1. lift-exp.f64 99.8

         \[\leadsto e^{re} \]

   4. Applied rewrites 99.8%

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

   5. Taylor expanded in re around 0

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

   7. Applied rewrites 3.2%

      \[\leadsto 1 \]

   8. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 53.8

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

   10. Applied rewrites 53.8%

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

   11. Taylor expanded in re around inf

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

       1. *-commutative N/A

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

       2. lower-*.f64 N/A

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

       3. pow2 N/A

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

       4. lower-*.f64 53.7

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

   13. Applied rewrites 53.7%

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

Alternative 13: 29.4% accurate, 12.7× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

2. Taylor expanded in re around 0

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

   1. distribute-rgt1-in N/A

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

   2. +-commutative N/A

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

   3. *-commutative N/A

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

   4. lower-*.f64 N/A

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

   5. lift-cos.f64 N/A

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

   6. +-commutative N/A

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

   7. metadata-eval N/A

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

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

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

   9. metadata-eval N/A

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

   10. metadata-eval N/A

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

   11. metadata-eval N/A

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

   12. lower--.f64 N/A

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

   13. metadata-eval 51.2

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

4. Applied rewrites 51.2%

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

5. Taylor expanded in im around 0

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

   1. +-commutative N/A

      \[\leadsto re + 1 \]

   2. metadata-eval N/A

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

   3. negate-sub N/A

      \[\leadsto re - -1 \]

   4. lift--.f64 29.4

      \[\leadsto re - -1 \]

7. Applied rewrites 29.4%

   \[\leadsto re - \color{blue}{-1} \]
8. Add Preprocessing

Alternative 14: 28.9% accurate, 46.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. Taylor expanded in im around 0

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

   1. lift-exp.f64 71.9

      \[\leadsto e^{re} \]

4. Applied rewrites 71.9%

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

5. Taylor expanded in re around 0

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

7. Applied rewrites 28.9%

   \[\leadsto 1 \]
8. Add Preprocessing

Reproduce

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