math.sin on complex, real part

Percentage Accurate: 100.0% → 100.0%

Time: 4.7s

Alternatives: 16

Speedup: 1.0×

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

Specification

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(re, im)
use fmin_fmax_functions
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = (0.5d0 * sin(re)) * (exp((0.0d0 - im)) + exp(im))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(re, im)
use fmin_fmax_functions
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = (0.5d0 * sin(re)) * (exp((0.0d0 - im)) + exp(im))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double re, double im) {
	return (0.5 * sin(re)) * (exp(-im) + exp(im));
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(re, im)
use fmin_fmax_functions
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = (0.5d0 * sin(re)) * (exp(-im) + exp(im))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

3. Final simplification 100.0%

   \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + e^{im}\right) \]
4. Add Preprocessing

Alternative 2: 64.6% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 0.5 \cdot \sin re\\ t_1 := t\_0 \cdot \left(e^{-im} + e^{im}\right)\\ t_2 := 1 + e^{im}\\ \mathbf{if}\;t\_1 \leq -2 \cdot 10^{+173}:\\ \;\;\;\;\left(\left(\left(re \cdot re\right) \cdot -0.08333333333333333\right) \cdot re\right) \cdot t\_2\\ \mathbf{elif}\;t\_1 \leq 1:\\ \;\;\;\;t\_0 \cdot \mathsf{fma}\left(im, im, 2\right)\\ \mathbf{else}:\\ \;\;\;\;\left(0.5 \cdot re\right) \cdot t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* 0.5 (sin re)))
        (t_1 (* t_0 (+ (exp (- im)) (exp im))))
        (t_2 (+ 1.0 (exp im))))
   (if (<= t_1 -2e+173)
     (* (* (* (* re re) -0.08333333333333333) re) t_2)
     (if (<= t_1 1.0) (* t_0 (fma im im 2.0)) (* (* 0.5 re) t_2)))))

C

double code(double re, double im) {
	double t_0 = 0.5 * sin(re);
	double t_1 = t_0 * (exp(-im) + exp(im));
	double t_2 = 1.0 + exp(im);
	double tmp;
	if (t_1 <= -2e+173) {
		tmp = (((re * re) * -0.08333333333333333) * re) * t_2;
	} else if (t_1 <= 1.0) {
		tmp = t_0 * fma(im, im, 2.0);
	} else {
		tmp = (0.5 * re) * t_2;
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(0.5 * sin(re))
	t_1 = Float64(t_0 * Float64(exp(Float64(-im)) + exp(im)))
	t_2 = Float64(1.0 + exp(im))
	tmp = 0.0
	if (t_1 <= -2e+173)
		tmp = Float64(Float64(Float64(Float64(re * re) * -0.08333333333333333) * re) * t_2);
	elseif (t_1 <= 1.0)
		tmp = Float64(t_0 * fma(im, im, 2.0));
	else
		tmp = Float64(Float64(0.5 * re) * t_2);
	end
	return tmp
end

Wolfram

code[re_, im_] := Block[{t$95$0 = N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(1.0 + N[Exp[im], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+173], N[(N[(N[(N[(re * re), $MachinePrecision] * -0.08333333333333333), $MachinePrecision] * re), $MachinePrecision] * t$95$2), $MachinePrecision], If[LessEqual[t$95$1, 1.0], N[(t$95$0 * N[(im * im + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(0.5 * re), $MachinePrecision] * t$95$2), $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

   5. Applied rewrites 54.2%

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

   6. Taylor expanded in re around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. pow2 N/A

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

      5. +-commutative N/A

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

      6. lift-fma.f64 N/A

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

      7. lift-*.f64 47.8

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

   8. Applied rewrites 47.8%

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

   9. Taylor expanded in re around inf

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

       1. *-commutative N/A

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

       2. lower-*.f64 N/A

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

       3. pow2 N/A

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

       4. lift-*.f64 25.6

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

   11. Applied rewrites 25.6%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. unpow2 N/A

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

      3. lower-fma.f64 99.4

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

   5. Applied rewrites 99.4%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

   5. Applied rewrites 51.4%

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

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 33.4%

      \[\leadsto \left(0.5 \cdot \color{blue}{re}\right) \cdot \left(1 + e^{im}\right) \]
3. Recombined 3 regimes into one program.

4. Final simplification 63.8%

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

Alternative 3: 71.7% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 0.5 \cdot \sin re\\ t_1 := t\_0 \cdot \left(e^{-im} + e^{im}\right)\\ \mathbf{if}\;t\_1 \leq -2 \cdot 10^{+173}:\\ \;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(-9.92063492063492 \cdot 10^{-5}, re \cdot re, 0.004166666666666667\right) \cdot \left(re \cdot re\right) - 0.08333333333333333, re \cdot re, 0.5\right) \cdot re\right) \cdot \mathsf{fma}\left(im, im, 2\right)\\ \mathbf{elif}\;t\_1 \leq 1:\\ \;\;\;\;t\_0 \cdot \mathsf{fma}\left(im, im, 2\right)\\ \mathbf{else}:\\ \;\;\;\;\left(0.5 \cdot re\right) \cdot \left(1 + e^{im}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* 0.5 (sin re))) (t_1 (* t_0 (+ (exp (- im)) (exp im)))))
   (if (<= t_1 -2e+173)
     (*
      (*
       (fma
        (-
         (*
          (fma -9.92063492063492e-5 (* re re) 0.004166666666666667)
          (* re re))
         0.08333333333333333)
        (* re re)
        0.5)
       re)
      (fma im im 2.0))
     (if (<= t_1 1.0)
       (* t_0 (fma im im 2.0))
       (* (* 0.5 re) (+ 1.0 (exp im)))))))

C

double code(double re, double im) {
	double t_0 = 0.5 * sin(re);
	double t_1 = t_0 * (exp(-im) + exp(im));
	double tmp;
	if (t_1 <= -2e+173) {
		tmp = (fma(((fma(-9.92063492063492e-5, (re * re), 0.004166666666666667) * (re * re)) - 0.08333333333333333), (re * re), 0.5) * re) * fma(im, im, 2.0);
	} else if (t_1 <= 1.0) {
		tmp = t_0 * fma(im, im, 2.0);
	} else {
		tmp = (0.5 * re) * (1.0 + exp(im));
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(0.5 * sin(re))
	t_1 = Float64(t_0 * Float64(exp(Float64(-im)) + exp(im)))
	tmp = 0.0
	if (t_1 <= -2e+173)
		tmp = Float64(Float64(fma(Float64(Float64(fma(-9.92063492063492e-5, Float64(re * re), 0.004166666666666667) * Float64(re * re)) - 0.08333333333333333), Float64(re * re), 0.5) * re) * fma(im, im, 2.0));
	elseif (t_1 <= 1.0)
		tmp = Float64(t_0 * fma(im, im, 2.0));
	else
		tmp = Float64(Float64(0.5 * re) * Float64(1.0 + exp(im)));
	end
	return tmp
end

Wolfram

code[re_, im_] := Block[{t$95$0 = N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+173], N[(N[(N[(N[(N[(N[(-9.92063492063492e-5 * N[(re * re), $MachinePrecision] + 0.004166666666666667), $MachinePrecision] * N[(re * re), $MachinePrecision]), $MachinePrecision] - 0.08333333333333333), $MachinePrecision] * N[(re * re), $MachinePrecision] + 0.5), $MachinePrecision] * re), $MachinePrecision] * N[(im * im + 2.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1.0], N[(t$95$0 * N[(im * im + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(0.5 * re), $MachinePrecision] * N[(1.0 + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. unpow2 N/A

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

      3. lower-fma.f64 45.3

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

   5. Applied rewrites 45.3%

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

   6. Taylor expanded in re around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   8. Applied rewrites 47.8%

      \[\leadsto \color{blue}{\left(\mathsf{fma}\left(\mathsf{fma}\left(-9.92063492063492 \cdot 10^{-5}, re \cdot re, 0.004166666666666667\right) \cdot \left(re \cdot re\right) - 0.08333333333333333, re \cdot re, 0.5\right) \cdot re\right)} \cdot \mathsf{fma}\left(im, im, 2\right) \]

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. unpow2 N/A

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

      3. lower-fma.f64 99.4

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

   5. Applied rewrites 99.4%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

   5. Applied rewrites 51.4%

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

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 33.4%

      \[\leadsto \left(0.5 \cdot \color{blue}{re}\right) \cdot \left(1 + e^{im}\right) \]
3. Recombined 3 regimes into one program.

4. Final simplification 69.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + e^{im}\right) \leq -2 \cdot 10^{+173}:\\ \;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(-9.92063492063492 \cdot 10^{-5}, re \cdot re, 0.004166666666666667\right) \cdot \left(re \cdot re\right) - 0.08333333333333333, re \cdot re, 0.5\right) \cdot re\right) \cdot \mathsf{fma}\left(im, im, 2\right)\\ \mathbf{elif}\;\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + e^{im}\right) \leq 1:\\ \;\;\;\;\left(0.5 \cdot \sin re\right) \cdot \mathsf{fma}\left(im, im, 2\right)\\ \mathbf{else}:\\ \;\;\;\;\left(0.5 \cdot re\right) \cdot \left(1 + e^{im}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 71.4% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + e^{im}\right)\\ \mathbf{if}\;t\_0 \leq -2 \cdot 10^{+173}:\\ \;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(-9.92063492063492 \cdot 10^{-5}, re \cdot re, 0.004166666666666667\right) \cdot \left(re \cdot re\right) - 0.08333333333333333, re \cdot re, 0.5\right) \cdot re\right) \cdot \mathsf{fma}\left(im, im, 2\right)\\ \mathbf{elif}\;t\_0 \leq 1:\\ \;\;\;\;\sin re\\ \mathbf{else}:\\ \;\;\;\;\left(0.5 \cdot re\right) \cdot \left(1 + e^{im}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (* 0.5 (sin re)) (+ (exp (- im)) (exp im)))))
   (if (<= t_0 -2e+173)
     (*
      (*
       (fma
        (-
         (*
          (fma -9.92063492063492e-5 (* re re) 0.004166666666666667)
          (* re re))
         0.08333333333333333)
        (* re re)
        0.5)
       re)
      (fma im im 2.0))
     (if (<= t_0 1.0) (sin re) (* (* 0.5 re) (+ 1.0 (exp im)))))))

C

double code(double re, double im) {
	double t_0 = (0.5 * sin(re)) * (exp(-im) + exp(im));
	double tmp;
	if (t_0 <= -2e+173) {
		tmp = (fma(((fma(-9.92063492063492e-5, (re * re), 0.004166666666666667) * (re * re)) - 0.08333333333333333), (re * re), 0.5) * re) * fma(im, im, 2.0);
	} else if (t_0 <= 1.0) {
		tmp = sin(re);
	} else {
		tmp = (0.5 * re) * (1.0 + exp(im));
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(Float64(0.5 * sin(re)) * Float64(exp(Float64(-im)) + exp(im)))
	tmp = 0.0
	if (t_0 <= -2e+173)
		tmp = Float64(Float64(fma(Float64(Float64(fma(-9.92063492063492e-5, Float64(re * re), 0.004166666666666667) * Float64(re * re)) - 0.08333333333333333), Float64(re * re), 0.5) * re) * fma(im, im, 2.0));
	elseif (t_0 <= 1.0)
		tmp = sin(re);
	else
		tmp = Float64(Float64(0.5 * re) * Float64(1.0 + exp(im)));
	end
	return tmp
end

Wolfram

code[re_, im_] := Block[{t$95$0 = N[(N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -2e+173], N[(N[(N[(N[(N[(N[(-9.92063492063492e-5 * N[(re * re), $MachinePrecision] + 0.004166666666666667), $MachinePrecision] * N[(re * re), $MachinePrecision]), $MachinePrecision] - 0.08333333333333333), $MachinePrecision] * N[(re * re), $MachinePrecision] + 0.5), $MachinePrecision] * re), $MachinePrecision] * N[(im * im + 2.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 1.0], N[Sin[re], $MachinePrecision], N[(N[(0.5 * re), $MachinePrecision] * N[(1.0 + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. unpow2 N/A

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

      3. lower-fma.f64 45.3

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

   5. Applied rewrites 45.3%

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

   6. Taylor expanded in re around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   8. Applied rewrites 47.8%

      \[\leadsto \color{blue}{\left(\mathsf{fma}\left(\mathsf{fma}\left(-9.92063492063492 \cdot 10^{-5}, re \cdot re, 0.004166666666666667\right) \cdot \left(re \cdot re\right) - 0.08333333333333333, re \cdot re, 0.5\right) \cdot re\right)} \cdot \mathsf{fma}\left(im, im, 2\right) \]

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. lift-sin.f64 99.1

         \[\leadsto \sin re \]

   5. Applied rewrites 99.1%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

   5. Applied rewrites 51.4%

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

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 33.4%

      \[\leadsto \left(0.5 \cdot \color{blue}{re}\right) \cdot \left(1 + e^{im}\right) \]
3. Recombined 3 regimes into one program.

4. Final simplification 69.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + e^{im}\right) \leq -2 \cdot 10^{+173}:\\ \;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(-9.92063492063492 \cdot 10^{-5}, re \cdot re, 0.004166666666666667\right) \cdot \left(re \cdot re\right) - 0.08333333333333333, re \cdot re, 0.5\right) \cdot re\right) \cdot \mathsf{fma}\left(im, im, 2\right)\\ \mathbf{elif}\;\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + e^{im}\right) \leq 1:\\ \;\;\;\;\sin re\\ \mathbf{else}:\\ \;\;\;\;\left(0.5 \cdot re\right) \cdot \left(1 + e^{im}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 78.6% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + e^{im}\right)\\ \mathbf{if}\;t\_0 \leq -2 \cdot 10^{+173}:\\ \;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(-9.92063492063492 \cdot 10^{-5}, re \cdot re, 0.004166666666666667\right) \cdot \left(re \cdot re\right) - 0.08333333333333333, re \cdot re, 0.5\right) \cdot re\right) \cdot \mathsf{fma}\left(im, im, 2\right)\\ \mathbf{elif}\;t\_0 \leq 1:\\ \;\;\;\;\sin re\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(im \cdot im, 0.001388888888888889, 0.041666666666666664\right), im \cdot im, 0.5\right), im \cdot im, 1\right) \cdot re\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (* 0.5 (sin re)) (+ (exp (- im)) (exp im)))))
   (if (<= t_0 -2e+173)
     (*
      (*
       (fma
        (-
         (*
          (fma -9.92063492063492e-5 (* re re) 0.004166666666666667)
          (* re re))
         0.08333333333333333)
        (* re re)
        0.5)
       re)
      (fma im im 2.0))
     (if (<= t_0 1.0)
       (sin re)
       (*
        (fma
         (fma
          (fma (* im im) 0.001388888888888889 0.041666666666666664)
          (* im im)
          0.5)
         (* im im)
         1.0)
        re)))))

C

double code(double re, double im) {
	double t_0 = (0.5 * sin(re)) * (exp(-im) + exp(im));
	double tmp;
	if (t_0 <= -2e+173) {
		tmp = (fma(((fma(-9.92063492063492e-5, (re * re), 0.004166666666666667) * (re * re)) - 0.08333333333333333), (re * re), 0.5) * re) * fma(im, im, 2.0);
	} else if (t_0 <= 1.0) {
		tmp = sin(re);
	} else {
		tmp = fma(fma(fma((im * im), 0.001388888888888889, 0.041666666666666664), (im * im), 0.5), (im * im), 1.0) * re;
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(Float64(0.5 * sin(re)) * Float64(exp(Float64(-im)) + exp(im)))
	tmp = 0.0
	if (t_0 <= -2e+173)
		tmp = Float64(Float64(fma(Float64(Float64(fma(-9.92063492063492e-5, Float64(re * re), 0.004166666666666667) * Float64(re * re)) - 0.08333333333333333), Float64(re * re), 0.5) * re) * fma(im, im, 2.0));
	elseif (t_0 <= 1.0)
		tmp = sin(re);
	else
		tmp = Float64(fma(fma(fma(Float64(im * im), 0.001388888888888889, 0.041666666666666664), Float64(im * im), 0.5), Float64(im * im), 1.0) * re);
	end
	return tmp
end

Wolfram

code[re_, im_] := Block[{t$95$0 = N[(N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -2e+173], N[(N[(N[(N[(N[(N[(-9.92063492063492e-5 * N[(re * re), $MachinePrecision] + 0.004166666666666667), $MachinePrecision] * N[(re * re), $MachinePrecision]), $MachinePrecision] - 0.08333333333333333), $MachinePrecision] * N[(re * re), $MachinePrecision] + 0.5), $MachinePrecision] * re), $MachinePrecision] * N[(im * im + 2.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 1.0], N[Sin[re], $MachinePrecision], N[(N[(N[(N[(N[(im * im), $MachinePrecision] * 0.001388888888888889 + 0.041666666666666664), $MachinePrecision] * N[(im * im), $MachinePrecision] + 0.5), $MachinePrecision] * N[(im * im), $MachinePrecision] + 1.0), $MachinePrecision] * re), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. unpow2 N/A

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

      3. lower-fma.f64 45.3

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

   5. Applied rewrites 45.3%

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

   6. Taylor expanded in re around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   8. Applied rewrites 47.8%

      \[\leadsto \color{blue}{\left(\mathsf{fma}\left(\mathsf{fma}\left(-9.92063492063492 \cdot 10^{-5}, re \cdot re, 0.004166666666666667\right) \cdot \left(re \cdot re\right) - 0.08333333333333333, re \cdot re, 0.5\right) \cdot re\right)} \cdot \mathsf{fma}\left(im, im, 2\right) \]

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. lift-sin.f64 99.1

         \[\leadsto \sin re \]

   5. Applied rewrites 99.1%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. cosh-undef N/A

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

      6. lower-*.f64 N/A

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

      7. lower-cosh.f64 66.1

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

   5. Applied rewrites 66.1%

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

   6. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

   8. Applied rewrites 55.3%

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

   9. Taylor expanded in re around 0

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

       1. *-commutative N/A

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

       2. lower-*.f64 N/A

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

   11. Applied rewrites 55.3%

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

4. Final simplification 74.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + e^{im}\right) \leq -2 \cdot 10^{+173}:\\ \;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(-9.92063492063492 \cdot 10^{-5}, re \cdot re, 0.004166666666666667\right) \cdot \left(re \cdot re\right) - 0.08333333333333333, re \cdot re, 0.5\right) \cdot re\right) \cdot \mathsf{fma}\left(im, im, 2\right)\\ \mathbf{elif}\;\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + e^{im}\right) \leq 1:\\ \;\;\;\;\sin re\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(im \cdot im, 0.001388888888888889, 0.041666666666666664\right), im \cdot im, 0.5\right), im \cdot im, 1\right) \cdot re\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 54.7% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* (* 0.5 (sin re)) (+ (exp (- im)) (exp im))) -0.2)
   (* (* (fma (* re re) -0.08333333333333333 0.5) re) (fma im im 2.0))
   (*
    (fma
     (fma
      (fma (* im im) 0.001388888888888889 0.041666666666666664)
      (* im im)
      0.5)
     (* im im)
     1.0)
    re)))

C

double code(double re, double im) {
	double tmp;
	if (((0.5 * sin(re)) * (exp(-im) + exp(im))) <= -0.2) {
		tmp = (fma((re * re), -0.08333333333333333, 0.5) * re) * fma(im, im, 2.0);
	} else {
		tmp = fma(fma(fma((im * im), 0.001388888888888889, 0.041666666666666664), (im * im), 0.5), (im * im), 1.0) * re;
	}
	return tmp;
}

Julia

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

Wolfram

code[re_, im_] := If[LessEqual[N[(N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.2], N[(N[(N[(N[(re * re), $MachinePrecision] * -0.08333333333333333 + 0.5), $MachinePrecision] * re), $MachinePrecision] * N[(im * im + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(N[(im * im), $MachinePrecision] * 0.001388888888888889 + 0.041666666666666664), $MachinePrecision] * N[(im * im), $MachinePrecision] + 0.5), $MachinePrecision] * N[(im * im), $MachinePrecision] + 1.0), $MachinePrecision] * re), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. unpow2 N/A

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

      3. lower-fma.f64 60.0

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

   5. Applied rewrites 60.0%

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

   6. Taylor expanded in re around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. pow2 N/A

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

      5. +-commutative N/A

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

      6. lift-fma.f64 N/A

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

      7. lift-*.f64 35.5

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

   8. Applied rewrites 35.5%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. cosh-undef N/A

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

      6. lower-*.f64 N/A

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

      7. lower-cosh.f64 59.8

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

   5. Applied rewrites 59.8%

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

   6. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

   8. Applied rewrites 55.3%

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

   9. Taylor expanded in re around 0

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

       1. *-commutative N/A

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

       2. lower-*.f64 N/A

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

   11. Applied rewrites 55.3%

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

4. Final simplification 48.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + e^{im}\right) \leq -0.2:\\ \;\;\;\;\left(\mathsf{fma}\left(re \cdot re, -0.08333333333333333, 0.5\right) \cdot re\right) \cdot \mathsf{fma}\left(im, im, 2\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(im \cdot im, 0.001388888888888889, 0.041666666666666664\right), im \cdot im, 0.5\right), im \cdot im, 1\right) \cdot re\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 54.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + e^{im}\right) \leq 4 \cdot 10^{-7}:\\ \;\;\;\;\left(\mathsf{fma}\left(re \cdot re, -0.08333333333333333, 0.5\right) \cdot re\right) \cdot \mathsf{fma}\left(im, im, 2\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\left(im \cdot im\right) \cdot 0.001388888888888889, im \cdot im, 0.5\right) \cdot re, im \cdot im, re\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* (* 0.5 (sin re)) (+ (exp (- im)) (exp im))) 4e-7)
   (* (* (fma (* re re) -0.08333333333333333 0.5) re) (fma im im 2.0))
   (fma
    (* (fma (* (* im im) 0.001388888888888889) (* im im) 0.5) re)
    (* im im)
    re)))

C

double code(double re, double im) {
	double tmp;
	if (((0.5 * sin(re)) * (exp(-im) + exp(im))) <= 4e-7) {
		tmp = (fma((re * re), -0.08333333333333333, 0.5) * re) * fma(im, im, 2.0);
	} else {
		tmp = fma((fma(((im * im) * 0.001388888888888889), (im * im), 0.5) * re), (im * im), re);
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if (Float64(Float64(0.5 * sin(re)) * Float64(exp(Float64(-im)) + exp(im))) <= 4e-7)
		tmp = Float64(Float64(fma(Float64(re * re), -0.08333333333333333, 0.5) * re) * fma(im, im, 2.0));
	else
		tmp = fma(Float64(fma(Float64(Float64(im * im) * 0.001388888888888889), Float64(im * im), 0.5) * re), Float64(im * im), re);
	end
	return tmp
end

Wolfram

code[re_, im_] := If[LessEqual[N[(N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 4e-7], N[(N[(N[(N[(re * re), $MachinePrecision] * -0.08333333333333333 + 0.5), $MachinePrecision] * re), $MachinePrecision] * N[(im * im + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(N[(im * im), $MachinePrecision] * 0.001388888888888889), $MachinePrecision] * N[(im * im), $MachinePrecision] + 0.5), $MachinePrecision] * re), $MachinePrecision] * N[(im * im), $MachinePrecision] + re), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. unpow2 N/A

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

      3. lower-fma.f64 74.7

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

   5. Applied rewrites 74.7%

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

   6. Taylor expanded in re around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. pow2 N/A

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

      5. +-commutative N/A

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

      6. lift-fma.f64 N/A

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

      7. lift-*.f64 58.2

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

   8. Applied rewrites 58.2%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. cosh-undef N/A

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

      6. lower-*.f64 N/A

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

      7. lower-cosh.f64 40.0

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

   5. Applied rewrites 40.0%

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

   6. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

   8. Applied rewrites 33.6%

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

   9. Taylor expanded in re around 0

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

       1. *-commutative N/A

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

       2. lower-*.f64 N/A

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

       3. +-commutative N/A

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

       4. *-commutative N/A

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

       5. lower-fma.f64 N/A

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

       6. +-commutative N/A

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

       7. *-commutative N/A

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

       8. lower-fma.f64 N/A

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

       9. pow2 N/A

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

       10. lift-*.f64 N/A

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

       11. pow2 N/A

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

       12. lift-*.f64 33.6

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

   11. Applied rewrites 33.6%

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

   12. Taylor expanded in im around inf

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

       1. *-commutative N/A

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

       2. lower-*.f64 N/A

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

       3. pow2 N/A

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

       4. lift-*.f64 33.6

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

   14. Applied rewrites 33.6%

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

4. Final simplification 48.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + e^{im}\right) \leq 4 \cdot 10^{-7}:\\ \;\;\;\;\left(\mathsf{fma}\left(re \cdot re, -0.08333333333333333, 0.5\right) \cdot re\right) \cdot \mathsf{fma}\left(im, im, 2\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\left(im \cdot im\right) \cdot 0.001388888888888889, im \cdot im, 0.5\right) \cdot re, im \cdot im, re\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 53.5% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* (* 0.5 (sin re)) (+ (exp (- im)) (exp im))) 4e-7)
   (* (* (fma (* re re) -0.08333333333333333 0.5) re) (fma im im 2.0))
   (* (* 0.5 re) (fma (fma (* im im) 0.08333333333333333 1.0) (* im im) 2.0))))

C

double code(double re, double im) {
	double tmp;
	if (((0.5 * sin(re)) * (exp(-im) + exp(im))) <= 4e-7) {
		tmp = (fma((re * re), -0.08333333333333333, 0.5) * re) * fma(im, im, 2.0);
	} else {
		tmp = (0.5 * re) * fma(fma((im * im), 0.08333333333333333, 1.0), (im * im), 2.0);
	}
	return tmp;
}

Julia

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

Wolfram

code[re_, im_] := If[LessEqual[N[(N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 4e-7], N[(N[(N[(N[(re * re), $MachinePrecision] * -0.08333333333333333 + 0.5), $MachinePrecision] * re), $MachinePrecision] * N[(im * im + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(0.5 * re), $MachinePrecision] * N[(N[(N[(im * im), $MachinePrecision] * 0.08333333333333333 + 1.0), $MachinePrecision] * N[(im * im), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. unpow2 N/A

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

      3. lower-fma.f64 74.7

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

   5. Applied rewrites 74.7%

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

   6. Taylor expanded in re around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. pow2 N/A

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

      5. +-commutative N/A

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

      6. lift-fma.f64 N/A

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

      7. lift-*.f64 58.2

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

   8. Applied rewrites 58.2%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

   5. Applied rewrites 71.6%

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

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 20.8%

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

   9. Taylor expanded in im around 0

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

       1. +-commutative N/A

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

       2. *-commutative N/A

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

       3. lower-fma.f64 N/A

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

       4. +-commutative N/A

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

       5. *-commutative N/A

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

       6. lower-fma.f64 N/A

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

       7. pow2 N/A

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

       8. lift-*.f64 N/A

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

       9. pow2 N/A

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

       10. lift-*.f64 31.0

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

   11. Applied rewrites 31.0%

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

4. Final simplification 46.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + e^{im}\right) \leq 4 \cdot 10^{-7}:\\ \;\;\;\;\left(\mathsf{fma}\left(re \cdot re, -0.08333333333333333, 0.5\right) \cdot re\right) \cdot \mathsf{fma}\left(im, im, 2\right)\\ \mathbf{else}:\\ \;\;\;\;\left(0.5 \cdot re\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(im \cdot im, 0.08333333333333333, 1\right), im \cdot im, 2\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 52.1% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + e^{im}\right) \leq 4 \cdot 10^{-7}:\\ \;\;\;\;\left(\mathsf{fma}\left(re \cdot re, -0.08333333333333333, 0.5\right) \cdot re\right) \cdot \mathsf{fma}\left(im, im, 2\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.041666666666666664 \cdot im, im, 0.5\right) \cdot re, im \cdot im, re\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* (* 0.5 (sin re)) (+ (exp (- im)) (exp im))) 4e-7)
   (* (* (fma (* re re) -0.08333333333333333 0.5) re) (fma im im 2.0))
   (fma (* (fma (* 0.041666666666666664 im) im 0.5) re) (* im im) re)))

C

double code(double re, double im) {
	double tmp;
	if (((0.5 * sin(re)) * (exp(-im) + exp(im))) <= 4e-7) {
		tmp = (fma((re * re), -0.08333333333333333, 0.5) * re) * fma(im, im, 2.0);
	} else {
		tmp = fma((fma((0.041666666666666664 * im), im, 0.5) * re), (im * im), re);
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if (Float64(Float64(0.5 * sin(re)) * Float64(exp(Float64(-im)) + exp(im))) <= 4e-7)
		tmp = Float64(Float64(fma(Float64(re * re), -0.08333333333333333, 0.5) * re) * fma(im, im, 2.0));
	else
		tmp = fma(Float64(fma(Float64(0.041666666666666664 * im), im, 0.5) * re), Float64(im * im), re);
	end
	return tmp
end

Wolfram

code[re_, im_] := If[LessEqual[N[(N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 4e-7], N[(N[(N[(N[(re * re), $MachinePrecision] * -0.08333333333333333 + 0.5), $MachinePrecision] * re), $MachinePrecision] * N[(im * im + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(0.041666666666666664 * im), $MachinePrecision] * im + 0.5), $MachinePrecision] * re), $MachinePrecision] * N[(im * im), $MachinePrecision] + re), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. unpow2 N/A

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

      3. lower-fma.f64 74.7

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

   5. Applied rewrites 74.7%

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

   6. Taylor expanded in re around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. pow2 N/A

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

      5. +-commutative N/A

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

      6. lift-fma.f64 N/A

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

      7. lift-*.f64 58.2

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

   8. Applied rewrites 58.2%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. cosh-undef N/A

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

      6. lower-*.f64 N/A

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

      7. lower-cosh.f64 40.0

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

   5. Applied rewrites 40.0%

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

   6. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

   8. Applied rewrites 33.6%

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

   9. Taylor expanded in re around 0

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

       1. *-commutative N/A

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

       2. lower-*.f64 N/A

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

       3. +-commutative N/A

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

       4. *-commutative N/A

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

       5. lower-fma.f64 N/A

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

       6. +-commutative N/A

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

       7. *-commutative N/A

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

       8. lower-fma.f64 N/A

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

       9. pow2 N/A

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

       10. lift-*.f64 N/A

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

       11. pow2 N/A

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

       12. lift-*.f64 33.6

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

   11. Applied rewrites 33.6%

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

   12. Taylor expanded in im around 0

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

       1. pow2 N/A

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

       2. +-commutative N/A

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

       3. associate-*r* N/A

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

       4. lower-fma.f64 N/A

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

       5. lower-*.f64 26.6

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

   14. Applied rewrites 26.6%

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

4. Final simplification 45.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + e^{im}\right) \leq 4 \cdot 10^{-7}:\\ \;\;\;\;\left(\mathsf{fma}\left(re \cdot re, -0.08333333333333333, 0.5\right) \cdot re\right) \cdot \mathsf{fma}\left(im, im, 2\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.041666666666666664 \cdot im, im, 0.5\right) \cdot re, im \cdot im, re\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 52.0% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* (* 0.5 (sin re)) (+ (exp (- im)) (exp im))) -0.2)
   (* (* (fma (* re re) -0.08333333333333333 0.5) re) (* im im))
   (fma (* (fma (* 0.041666666666666664 im) im 0.5) re) (* im im) re)))

C

double code(double re, double im) {
	double tmp;
	if (((0.5 * sin(re)) * (exp(-im) + exp(im))) <= -0.2) {
		tmp = (fma((re * re), -0.08333333333333333, 0.5) * re) * (im * im);
	} else {
		tmp = fma((fma((0.041666666666666664 * im), im, 0.5) * re), (im * im), re);
	}
	return tmp;
}

Julia

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

Wolfram

code[re_, im_] := If[LessEqual[N[(N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.2], N[(N[(N[(N[(re * re), $MachinePrecision] * -0.08333333333333333 + 0.5), $MachinePrecision] * re), $MachinePrecision] * N[(im * im), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(0.041666666666666664 * im), $MachinePrecision] * im + 0.5), $MachinePrecision] * re), $MachinePrecision] * N[(im * im), $MachinePrecision] + re), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. unpow2 N/A

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

      3. lower-fma.f64 60.0

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

   5. Applied rewrites 60.0%

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

   6. Taylor expanded in re around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. pow2 N/A

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

      5. +-commutative N/A

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

      6. lift-fma.f64 N/A

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

      7. lift-*.f64 35.5

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

   8. Applied rewrites 35.5%

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

   9. Taylor expanded in im around inf

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

       1. pow2 N/A

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

       2. lift-*.f64 35.3

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

   11. Applied rewrites 35.3%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. cosh-undef N/A

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

      6. lower-*.f64 N/A

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

      7. lower-cosh.f64 59.8

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

   5. Applied rewrites 59.8%

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

   6. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

   8. Applied rewrites 55.3%

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

   9. Taylor expanded in re around 0

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

       1. *-commutative N/A

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

       2. lower-*.f64 N/A

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

       3. +-commutative N/A

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

       4. *-commutative N/A

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

       5. lower-fma.f64 N/A

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

       6. +-commutative N/A

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

       7. *-commutative N/A

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

       8. lower-fma.f64 N/A

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

       9. pow2 N/A

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

       10. lift-*.f64 N/A

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

       11. pow2 N/A

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

       12. lift-*.f64 55.3

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

   11. Applied rewrites 55.3%

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

   12. Taylor expanded in im around 0

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

       1. pow2 N/A

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

       2. +-commutative N/A

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

       3. associate-*r* N/A

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

       4. lower-fma.f64 N/A

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

       5. lower-*.f64 50.6

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

   14. Applied rewrites 50.6%

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

4. Final simplification 45.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + e^{im}\right) \leq -0.2:\\ \;\;\;\;\left(\mathsf{fma}\left(re \cdot re, -0.08333333333333333, 0.5\right) \cdot re\right) \cdot \left(im \cdot im\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.041666666666666664 \cdot im, im, 0.5\right) \cdot re, im \cdot im, re\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 41.8% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* (* 0.5 (sin re)) (+ (exp (- im)) (exp im))) 4e-7)
   (* (fma -0.16666666666666666 (* re re) 1.0) re)
   (fma (* (* im im) re) 0.5 re)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. lift-sin.f64 55.2

         \[\leadsto \sin re \]

   5. Applied rewrites 55.2%

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

   6. Taylor expanded in re around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. pow2 N/A

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

      6. lift-*.f64 46.4

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

   8. Applied rewrites 46.4%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. cosh-undef N/A

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

      6. lower-*.f64 N/A

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

      7. lower-cosh.f64 40.0

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

   5. Applied rewrites 40.0%

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

   6. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. pow2 N/A

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

      6. lower-*.f64 19.2

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

   8. Applied rewrites 19.2%

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

4. Final simplification 35.2%

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

Alternative 12: 30.4% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* (* 0.5 (sin re)) (+ (exp (- im)) (exp im))) -0.2)
   (* (* (* re re) -0.16666666666666666) re)
   re))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. lift-sin.f64 28.5

         \[\leadsto \sin re \]

   5. Applied rewrites 28.5%

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

   6. Taylor expanded in re around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. pow2 N/A

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

      6. lift-*.f64 16.6

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

   8. Applied rewrites 16.6%

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

   9. Taylor expanded in re around inf

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

       1. *-commutative N/A

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

       2. lower-*.f64 N/A

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

       3. pow2 N/A

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

       4. lift-*.f64 16.4

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

   11. Applied rewrites 16.4%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. cosh-undef N/A

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

      6. lower-*.f64 N/A

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

      7. lower-cosh.f64 59.8

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

   5. Applied rewrites 59.8%

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

   6. Taylor expanded in im around 0

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

   8. Applied rewrites 35.0%

      \[\leadsto re \]
3. Recombined 2 regimes into one program.

4. Final simplification 28.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + e^{im}\right) \leq -0.2:\\ \;\;\;\;\left(\left(re \cdot re\right) \cdot -0.16666666666666666\right) \cdot re\\ \mathbf{else}:\\ \;\;\;\;re\\ \end{array} \]
5. Add Preprocessing

Alternative 13: 74.1% accurate, 1.5× speedup

Math

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

FPCore

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

C

double code(double re, double im) {
	return (0.5 * sin(re)) * (1.0 + exp(im));
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(re, im)
use fmin_fmax_functions
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = (0.5d0 * sin(re)) * (1.0d0 + exp(im))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

3. Taylor expanded in im around 0

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

5. Applied rewrites 75.3%

   \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \left(\color{blue}{1} + e^{im}\right) \]
6. Add Preprocessing

Alternative 14: 49.4% accurate, 2.3× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* 0.5 (sin re)) -0.01)
   (* (* (fma (* re re) -0.08333333333333333 0.5) re) (* im im))
   (fma (* (* im im) re) 0.5 re)))

C

double code(double re, double im) {
	double tmp;
	if ((0.5 * sin(re)) <= -0.01) {
		tmp = (fma((re * re), -0.08333333333333333, 0.5) * re) * (im * im);
	} else {
		tmp = fma(((im * im) * re), 0.5, re);
	}
	return tmp;
}

Julia

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

Wolfram

code[re_, im_] := If[LessEqual[N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision], -0.01], N[(N[(N[(N[(re * re), $MachinePrecision] * -0.08333333333333333 + 0.5), $MachinePrecision] * re), $MachinePrecision] * N[(im * im), $MachinePrecision]), $MachinePrecision], N[(N[(N[(im * im), $MachinePrecision] * re), $MachinePrecision] * 0.5 + re), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) < -0.0100000000000000002

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. unpow2 N/A

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

      3. lower-fma.f64 64.2

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

   5. Applied rewrites 64.2%

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

   6. Taylor expanded in re around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. pow2 N/A

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

      5. +-commutative N/A

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

      6. lift-fma.f64 N/A

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

      7. lift-*.f64 29.6

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

   8. Applied rewrites 29.6%

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

   9. Taylor expanded in im around inf

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

       1. pow2 N/A

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

       2. lift-*.f64 29.3

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

   11. Applied rewrites 29.3%

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

   if -0.0100000000000000002 < (*.f64 #s(literal 1/2 binary64) (sin.f64 re))

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. cosh-undef N/A

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

      6. lower-*.f64 N/A

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

      7. lower-cosh.f64 66.0

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

   5. Applied rewrites 66.0%

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

   6. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. pow2 N/A

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

      6. lower-*.f64 46.9

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

   8. Applied rewrites 46.9%

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

Alternative 15: 34.3% accurate, 18.6× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

3. Taylor expanded in im around 0

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

   1. lift-sin.f64 50.2

      \[\leadsto \sin re \]

5. Applied rewrites 50.2%

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

6. Taylor expanded in re around 0

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. +-commutative N/A

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

   4. lower-fma.f64 N/A

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

   5. pow2 N/A

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

   6. lift-*.f64 32.8

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

8. Applied rewrites 32.8%

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

Alternative 16: 26.7% accurate, 317.0× speedup

Math

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

FPCore

(FPCore (re im) :precision binary64 re)

C

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

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
end function

Java

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

Python

def code(re, im):
	return re

Julia

function code(re, im)
	return re
end

MATLAB

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

Wolfram

code[re_, im_] := re

Derivation

1. Initial program 100.0%

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

3. Taylor expanded in re around 0

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

   1. associate-*r* N/A

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

   2. lower-*.f64 N/A

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

   3. *-commutative N/A

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

   4. lower-*.f64 N/A

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

   5. cosh-undef N/A

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

   6. lower-*.f64 N/A

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

   7. lower-cosh.f64 57.2

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

5. Applied rewrites 57.2%

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

6. Taylor expanded in im around 0

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

8. Applied rewrites 23.4%

   \[\leadsto re \]
9. Add Preprocessing

Reproduce

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