math.sin on complex, imaginary part

Percentage Accurate: 54.5% → 99.5%

Time: 8.5s

Alternatives: 14

Speedup: 2.8×

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

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 54.5% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.5% accurate, 0.5× speedup

Math

\[\begin{array}{l} im\_m = \left|im\right| \\ im\_s = \mathsf{copysign}\left(1, im\right) \\ im\_s \cdot \begin{array}{l} \mathbf{if}\;e^{-im\_m} - e^{im\_m} \leq -2 \cdot 10^{+189}:\\ \;\;\;\;0.5 \cdot \left(\left(27 - e^{im\_m}\right) \cdot \cos re\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(\cos re \cdot \left(im\_m \cdot \left({im\_m}^{2} \cdot \left({im\_m}^{2} \cdot \left({im\_m}^{2} \cdot -0.0003968253968253968 - 0.016666666666666666\right) - 0.3333333333333333\right) - 2\right)\right)\right)\\ \end{array} \end{array} \]

FPCore

im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
 :precision binary64
 (*
  im_s
  (if (<= (- (exp (- im_m)) (exp im_m)) -2e+189)
    (* 0.5 (* (- 27.0 (exp im_m)) (cos re)))
    (*
     0.5
     (*
      (cos re)
      (*
       im_m
       (-
        (*
         (pow im_m 2.0)
         (-
          (*
           (pow im_m 2.0)
           (- (* (pow im_m 2.0) -0.0003968253968253968) 0.016666666666666666))
          0.3333333333333333))
        2.0)))))))

C

im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
	double tmp;
	if ((exp(-im_m) - exp(im_m)) <= -2e+189) {
		tmp = 0.5 * ((27.0 - exp(im_m)) * cos(re));
	} else {
		tmp = 0.5 * (cos(re) * (im_m * ((pow(im_m, 2.0) * ((pow(im_m, 2.0) * ((pow(im_m, 2.0) * -0.0003968253968253968) - 0.016666666666666666)) - 0.3333333333333333)) - 2.0)));
	}
	return im_s * tmp;
}

Fortran

im\_m = abs(im)
im\_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
    real(8), intent (in) :: im_s
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    real(8) :: tmp
    if ((exp(-im_m) - exp(im_m)) <= (-2d+189)) then
        tmp = 0.5d0 * ((27.0d0 - exp(im_m)) * cos(re))
    else
        tmp = 0.5d0 * (cos(re) * (im_m * (((im_m ** 2.0d0) * (((im_m ** 2.0d0) * (((im_m ** 2.0d0) * (-0.0003968253968253968d0)) - 0.016666666666666666d0)) - 0.3333333333333333d0)) - 2.0d0)))
    end if
    code = im_s * tmp
end function

Java

im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
	double tmp;
	if ((Math.exp(-im_m) - Math.exp(im_m)) <= -2e+189) {
		tmp = 0.5 * ((27.0 - Math.exp(im_m)) * Math.cos(re));
	} else {
		tmp = 0.5 * (Math.cos(re) * (im_m * ((Math.pow(im_m, 2.0) * ((Math.pow(im_m, 2.0) * ((Math.pow(im_m, 2.0) * -0.0003968253968253968) - 0.016666666666666666)) - 0.3333333333333333)) - 2.0)));
	}
	return im_s * tmp;
}

Python

im\_m = math.fabs(im)
im\_s = math.copysign(1.0, im)
def code(im_s, re, im_m):
	tmp = 0
	if (math.exp(-im_m) - math.exp(im_m)) <= -2e+189:
		tmp = 0.5 * ((27.0 - math.exp(im_m)) * math.cos(re))
	else:
		tmp = 0.5 * (math.cos(re) * (im_m * ((math.pow(im_m, 2.0) * ((math.pow(im_m, 2.0) * ((math.pow(im_m, 2.0) * -0.0003968253968253968) - 0.016666666666666666)) - 0.3333333333333333)) - 2.0)))
	return im_s * tmp

Julia

im\_m = abs(im)
im\_s = copysign(1.0, im)
function code(im_s, re, im_m)
	tmp = 0.0
	if (Float64(exp(Float64(-im_m)) - exp(im_m)) <= -2e+189)
		tmp = Float64(0.5 * Float64(Float64(27.0 - exp(im_m)) * cos(re)));
	else
		tmp = Float64(0.5 * Float64(cos(re) * Float64(im_m * Float64(Float64((im_m ^ 2.0) * Float64(Float64((im_m ^ 2.0) * Float64(Float64((im_m ^ 2.0) * -0.0003968253968253968) - 0.016666666666666666)) - 0.3333333333333333)) - 2.0))));
	end
	return Float64(im_s * tmp)
end

MATLAB

im\_m = abs(im);
im\_s = sign(im) * abs(1.0);
function tmp_2 = code(im_s, re, im_m)
	tmp = 0.0;
	if ((exp(-im_m) - exp(im_m)) <= -2e+189)
		tmp = 0.5 * ((27.0 - exp(im_m)) * cos(re));
	else
		tmp = 0.5 * (cos(re) * (im_m * (((im_m ^ 2.0) * (((im_m ^ 2.0) * (((im_m ^ 2.0) * -0.0003968253968253968) - 0.016666666666666666)) - 0.3333333333333333)) - 2.0)));
	end
	tmp_2 = im_s * tmp;
end

Wolfram

im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := N[(im$95$s * If[LessEqual[N[(N[Exp[(-im$95$m)], $MachinePrecision] - N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision], -2e+189], N[(0.5 * N[(N[(27.0 - N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision] * N[Cos[re], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(N[Cos[re], $MachinePrecision] * N[(im$95$m * N[(N[(N[Power[im$95$m, 2.0], $MachinePrecision] * N[(N[(N[Power[im$95$m, 2.0], $MachinePrecision] * N[(N[(N[Power[im$95$m, 2.0], $MachinePrecision] * -0.0003968253968253968), $MachinePrecision] - 0.016666666666666666), $MachinePrecision]), $MachinePrecision] - 0.3333333333333333), $MachinePrecision]), $MachinePrecision] - 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im)) < -2e189

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
   2. Step-by-step derivation

      1. /-rgt-identity 100.0%

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

      2. exp-0 100.0%

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

      3. associate-*l/ 100.0%

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

      4. cos-neg 100.0%

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

      5. associate-*l* 100.0%

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

      6. associate-*r/ 100.0%

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

      7. exp-0 100.0%

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

      8. /-rgt-identity 100.0%

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

      9. *-commutative 100.0%

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

      10. neg-sub0 100.0%

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

      11. cos-neg 100.0%

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

   3. Simplified 100.0%

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

   6. Applied egg-rr 100.0%

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

   if -2e189 < (-.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))

   1. Initial program 35.2%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
   2. Step-by-step derivation

      1. /-rgt-identity 35.2%

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

      2. exp-0 35.2%

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

      3. associate-*l/ 35.2%

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

      4. cos-neg 35.2%

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

      5. associate-*l* 35.2%

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

      6. associate-*r/ 35.2%

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

      7. exp-0 35.2%

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

      8. /-rgt-identity 35.2%

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

      9. *-commutative 35.2%

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

      10. neg-sub0 35.2%

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

      11. cos-neg 35.2%

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

   3. Simplified 35.2%

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

   5. Taylor expanded in im around 0 96.1%

      \[\leadsto 0.5 \cdot \left(\color{blue}{\left(im \cdot \left({im}^{2} \cdot \left({im}^{2} \cdot \left(-0.0003968253968253968 \cdot {im}^{2} - 0.016666666666666666\right) - 0.3333333333333333\right) - 2\right)\right)} \cdot \cos re\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 97.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;e^{-im} - e^{im} \leq -2 \cdot 10^{+189}:\\ \;\;\;\;0.5 \cdot \left(\left(27 - e^{im}\right) \cdot \cos re\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(\cos re \cdot \left(im \cdot \left({im}^{2} \cdot \left({im}^{2} \cdot \left({im}^{2} \cdot -0.0003968253968253968 - 0.016666666666666666\right) - 0.3333333333333333\right) - 2\right)\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 99.6% accurate, 0.6× speedup

Math

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

FPCore

im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
 :precision binary64
 (let* ((t_0 (- (exp (- im_m)) (exp im_m))))
   (*
    im_s
    (if (<= t_0 -0.02) (* 0.5 (* (cos re) t_0)) (* im_m (- (cos re)))))))

C

im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
	double t_0 = exp(-im_m) - exp(im_m);
	double tmp;
	if (t_0 <= -0.02) {
		tmp = 0.5 * (cos(re) * t_0);
	} else {
		tmp = im_m * -cos(re);
	}
	return im_s * tmp;
}

Fortran

im\_m = abs(im)
im\_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
    real(8), intent (in) :: im_s
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    real(8) :: t_0
    real(8) :: tmp
    t_0 = exp(-im_m) - exp(im_m)
    if (t_0 <= (-0.02d0)) then
        tmp = 0.5d0 * (cos(re) * t_0)
    else
        tmp = im_m * -cos(re)
    end if
    code = im_s * tmp
end function

Java

im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
	double t_0 = Math.exp(-im_m) - Math.exp(im_m);
	double tmp;
	if (t_0 <= -0.02) {
		tmp = 0.5 * (Math.cos(re) * t_0);
	} else {
		tmp = im_m * -Math.cos(re);
	}
	return im_s * tmp;
}

Python

im\_m = math.fabs(im)
im\_s = math.copysign(1.0, im)
def code(im_s, re, im_m):
	t_0 = math.exp(-im_m) - math.exp(im_m)
	tmp = 0
	if t_0 <= -0.02:
		tmp = 0.5 * (math.cos(re) * t_0)
	else:
		tmp = im_m * -math.cos(re)
	return im_s * tmp

Julia

im\_m = abs(im)
im\_s = copysign(1.0, im)
function code(im_s, re, im_m)
	t_0 = Float64(exp(Float64(-im_m)) - exp(im_m))
	tmp = 0.0
	if (t_0 <= -0.02)
		tmp = Float64(0.5 * Float64(cos(re) * t_0));
	else
		tmp = Float64(im_m * Float64(-cos(re)));
	end
	return Float64(im_s * tmp)
end

MATLAB

im\_m = abs(im);
im\_s = sign(im) * abs(1.0);
function tmp_2 = code(im_s, re, im_m)
	t_0 = exp(-im_m) - exp(im_m);
	tmp = 0.0;
	if (t_0 <= -0.02)
		tmp = 0.5 * (cos(re) * t_0);
	else
		tmp = im_m * -cos(re);
	end
	tmp_2 = im_s * tmp;
end

Wolfram

im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := Block[{t$95$0 = N[(N[Exp[(-im$95$m)], $MachinePrecision] - N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]}, N[(im$95$s * If[LessEqual[t$95$0, -0.02], N[(0.5 * N[(N[Cos[re], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], N[(im$95$m * (-N[Cos[re], $MachinePrecision])), $MachinePrecision]]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im)) < -0.0200000000000000004

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
   2. Step-by-step derivation

      1. /-rgt-identity 100.0%

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

      2. exp-0 100.0%

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

      3. associate-*l/ 100.0%

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

      4. cos-neg 100.0%

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

      5. associate-*l* 100.0%

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

      6. associate-*r/ 100.0%

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

      7. exp-0 100.0%

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

      8. /-rgt-identity 100.0%

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

      9. *-commutative 100.0%

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

      10. neg-sub0 100.0%

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

      11. cos-neg 100.0%

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

   3. Simplified 100.0%

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

   if -0.0200000000000000004 < (-.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))

   1. Initial program 35.2%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
   2. Step-by-step derivation

      1. /-rgt-identity 35.2%

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

      2. exp-0 35.2%

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

      3. associate-*l/ 35.2%

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

      4. cos-neg 35.2%

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

      5. associate-*l* 35.2%

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

      6. associate-*r/ 35.2%

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

      7. exp-0 35.2%

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

      8. /-rgt-identity 35.2%

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

      9. *-commutative 35.2%

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

      10. neg-sub0 35.2%

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

      11. cos-neg 35.2%

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

   3. Simplified 35.2%

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

   5. Taylor expanded in im around 0 70.4%

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

   6. Taylor expanded in im around 0 70.4%

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

      1. associate-*r* 70.4%

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

      2. mul-1-neg 70.4%

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

   8. Simplified 70.4%

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

4. Final simplification 77.1%

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

Alternative 3: 95.2% accurate, 1.4× speedup

Math

\[\begin{array}{l} im\_m = \left|im\right| \\ im\_s = \mathsf{copysign}\left(1, im\right) \\ im\_s \cdot \begin{array}{l} \mathbf{if}\;im\_m \leq 0.00095:\\ \;\;\;\;im\_m \cdot \left(-\cos re\right)\\ \mathbf{elif}\;im\_m \leq 1.05 \cdot 10^{+103}:\\ \;\;\;\;0.5 \cdot \left(e^{-im\_m} - e^{im\_m}\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(\cos re \cdot \left(26 + im\_m \cdot \left(im\_m \cdot \left(im\_m \cdot -0.16666666666666666\right) + -1\right)\right)\right)\\ \end{array} \end{array} \]

FPCore

im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
 :precision binary64
 (*
  im_s
  (if (<= im_m 0.00095)
    (* im_m (- (cos re)))
    (if (<= im_m 1.05e+103)
      (* 0.5 (- (exp (- im_m)) (exp im_m)))
      (*
       0.5
       (*
        (cos re)
        (+ 26.0 (* im_m (+ (* im_m (* im_m -0.16666666666666666)) -1.0)))))))))

C

im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
	double tmp;
	if (im_m <= 0.00095) {
		tmp = im_m * -cos(re);
	} else if (im_m <= 1.05e+103) {
		tmp = 0.5 * (exp(-im_m) - exp(im_m));
	} else {
		tmp = 0.5 * (cos(re) * (26.0 + (im_m * ((im_m * (im_m * -0.16666666666666666)) + -1.0))));
	}
	return im_s * tmp;
}

Fortran

im\_m = abs(im)
im\_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
    real(8), intent (in) :: im_s
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    real(8) :: tmp
    if (im_m <= 0.00095d0) then
        tmp = im_m * -cos(re)
    else if (im_m <= 1.05d+103) then
        tmp = 0.5d0 * (exp(-im_m) - exp(im_m))
    else
        tmp = 0.5d0 * (cos(re) * (26.0d0 + (im_m * ((im_m * (im_m * (-0.16666666666666666d0))) + (-1.0d0)))))
    end if
    code = im_s * tmp
end function

Java

im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
	double tmp;
	if (im_m <= 0.00095) {
		tmp = im_m * -Math.cos(re);
	} else if (im_m <= 1.05e+103) {
		tmp = 0.5 * (Math.exp(-im_m) - Math.exp(im_m));
	} else {
		tmp = 0.5 * (Math.cos(re) * (26.0 + (im_m * ((im_m * (im_m * -0.16666666666666666)) + -1.0))));
	}
	return im_s * tmp;
}

Python

im\_m = math.fabs(im)
im\_s = math.copysign(1.0, im)
def code(im_s, re, im_m):
	tmp = 0
	if im_m <= 0.00095:
		tmp = im_m * -math.cos(re)
	elif im_m <= 1.05e+103:
		tmp = 0.5 * (math.exp(-im_m) - math.exp(im_m))
	else:
		tmp = 0.5 * (math.cos(re) * (26.0 + (im_m * ((im_m * (im_m * -0.16666666666666666)) + -1.0))))
	return im_s * tmp

Julia

im\_m = abs(im)
im\_s = copysign(1.0, im)
function code(im_s, re, im_m)
	tmp = 0.0
	if (im_m <= 0.00095)
		tmp = Float64(im_m * Float64(-cos(re)));
	elseif (im_m <= 1.05e+103)
		tmp = Float64(0.5 * Float64(exp(Float64(-im_m)) - exp(im_m)));
	else
		tmp = Float64(0.5 * Float64(cos(re) * Float64(26.0 + Float64(im_m * Float64(Float64(im_m * Float64(im_m * -0.16666666666666666)) + -1.0)))));
	end
	return Float64(im_s * tmp)
end

MATLAB

im\_m = abs(im);
im\_s = sign(im) * abs(1.0);
function tmp_2 = code(im_s, re, im_m)
	tmp = 0.0;
	if (im_m <= 0.00095)
		tmp = im_m * -cos(re);
	elseif (im_m <= 1.05e+103)
		tmp = 0.5 * (exp(-im_m) - exp(im_m));
	else
		tmp = 0.5 * (cos(re) * (26.0 + (im_m * ((im_m * (im_m * -0.16666666666666666)) + -1.0))));
	end
	tmp_2 = im_s * tmp;
end

Wolfram

im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := N[(im$95$s * If[LessEqual[im$95$m, 0.00095], N[(im$95$m * (-N[Cos[re], $MachinePrecision])), $MachinePrecision], If[LessEqual[im$95$m, 1.05e+103], N[(0.5 * N[(N[Exp[(-im$95$m)], $MachinePrecision] - N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(N[Cos[re], $MachinePrecision] * N[(26.0 + N[(im$95$m * N[(N[(im$95$m * N[(im$95$m * -0.16666666666666666), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if im < 9.49999999999999998e-4

   1. Initial program 35.2%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
   2. Step-by-step derivation

      1. /-rgt-identity 35.2%

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

      2. exp-0 35.2%

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

      3. associate-*l/ 35.2%

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

      4. cos-neg 35.2%

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

      5. associate-*l* 35.2%

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

      6. associate-*r/ 35.2%

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

      7. exp-0 35.2%

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

      8. /-rgt-identity 35.2%

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

      9. *-commutative 35.2%

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

      10. neg-sub0 35.2%

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

      11. cos-neg 35.2%

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

   3. Simplified 35.2%

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

   5. Taylor expanded in im around 0 70.4%

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

   6. Taylor expanded in im around 0 70.4%

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

      1. associate-*r* 70.4%

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

      2. mul-1-neg 70.4%

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

   8. Simplified 70.4%

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

   if 9.49999999999999998e-4 < im < 1.0500000000000001e103

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
   2. Step-by-step derivation

      1. /-rgt-identity 100.0%

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

      2. exp-0 100.0%

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

      3. associate-*l/ 100.0%

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

      4. cos-neg 100.0%

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

      5. associate-*l* 100.0%

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

      6. associate-*r/ 100.0%

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

      7. exp-0 100.0%

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

      8. /-rgt-identity 100.0%

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

      9. *-commutative 100.0%

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

      10. neg-sub0 100.0%

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

      11. cos-neg 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in re around 0 72.7%

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

   if 1.0500000000000001e103 < im

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
   2. Step-by-step derivation

      1. /-rgt-identity 100.0%

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

      2. exp-0 100.0%

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

      3. associate-*l/ 100.0%

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

      4. cos-neg 100.0%

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

      5. associate-*l* 100.0%

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

      6. associate-*r/ 100.0%

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

      7. exp-0 100.0%

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

      8. /-rgt-identity 100.0%

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

      9. *-commutative 100.0%

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

      10. neg-sub0 100.0%

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

      11. cos-neg 100.0%

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

   3. Simplified 100.0%

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

   6. Applied egg-rr 100.0%

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

   7. Taylor expanded in im around 0 100.0%

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

   8. Taylor expanded in im around inf 100.0%

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

      1. *-commutative 100.0%

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

   10. Simplified 100.0%

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

4. Final simplification 74.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 0.00095:\\ \;\;\;\;im \cdot \left(-\cos re\right)\\ \mathbf{elif}\;im \leq 1.05 \cdot 10^{+103}:\\ \;\;\;\;0.5 \cdot \left(e^{-im} - e^{im}\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(\cos re \cdot \left(26 + im \cdot \left(im \cdot \left(im \cdot -0.16666666666666666\right) + -1\right)\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 99.3% accurate, 1.5× speedup

Math

\[\begin{array}{l} im\_m = \left|im\right| \\ im\_s = \mathsf{copysign}\left(1, im\right) \\ im\_s \cdot \begin{array}{l} \mathbf{if}\;im\_m \leq 3.5:\\ \;\;\;\;im\_m \cdot \left(-\cos re\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(\left(27 - e^{im\_m}\right) \cdot \cos re\right)\\ \end{array} \end{array} \]

FPCore

im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
 :precision binary64
 (*
  im_s
  (if (<= im_m 3.5)
    (* im_m (- (cos re)))
    (* 0.5 (* (- 27.0 (exp im_m)) (cos re))))))

C

im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
	double tmp;
	if (im_m <= 3.5) {
		tmp = im_m * -cos(re);
	} else {
		tmp = 0.5 * ((27.0 - exp(im_m)) * cos(re));
	}
	return im_s * tmp;
}

Fortran

im\_m = abs(im)
im\_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
    real(8), intent (in) :: im_s
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    real(8) :: tmp
    if (im_m <= 3.5d0) then
        tmp = im_m * -cos(re)
    else
        tmp = 0.5d0 * ((27.0d0 - exp(im_m)) * cos(re))
    end if
    code = im_s * tmp
end function

Java

im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
	double tmp;
	if (im_m <= 3.5) {
		tmp = im_m * -Math.cos(re);
	} else {
		tmp = 0.5 * ((27.0 - Math.exp(im_m)) * Math.cos(re));
	}
	return im_s * tmp;
}

Python

im\_m = math.fabs(im)
im\_s = math.copysign(1.0, im)
def code(im_s, re, im_m):
	tmp = 0
	if im_m <= 3.5:
		tmp = im_m * -math.cos(re)
	else:
		tmp = 0.5 * ((27.0 - math.exp(im_m)) * math.cos(re))
	return im_s * tmp

Julia

im\_m = abs(im)
im\_s = copysign(1.0, im)
function code(im_s, re, im_m)
	tmp = 0.0
	if (im_m <= 3.5)
		tmp = Float64(im_m * Float64(-cos(re)));
	else
		tmp = Float64(0.5 * Float64(Float64(27.0 - exp(im_m)) * cos(re)));
	end
	return Float64(im_s * tmp)
end

MATLAB

im\_m = abs(im);
im\_s = sign(im) * abs(1.0);
function tmp_2 = code(im_s, re, im_m)
	tmp = 0.0;
	if (im_m <= 3.5)
		tmp = im_m * -cos(re);
	else
		tmp = 0.5 * ((27.0 - exp(im_m)) * cos(re));
	end
	tmp_2 = im_s * tmp;
end

Wolfram

im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := N[(im$95$s * If[LessEqual[im$95$m, 3.5], N[(im$95$m * (-N[Cos[re], $MachinePrecision])), $MachinePrecision], N[(0.5 * N[(N[(27.0 - N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision] * N[Cos[re], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if im < 3.5

   1. Initial program 35.2%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
   2. Step-by-step derivation

      1. /-rgt-identity 35.2%

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

      2. exp-0 35.2%

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

      3. associate-*l/ 35.2%

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

      4. cos-neg 35.2%

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

      5. associate-*l* 35.2%

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

      6. associate-*r/ 35.2%

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

      7. exp-0 35.2%

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

      8. /-rgt-identity 35.2%

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

      9. *-commutative 35.2%

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

      10. neg-sub0 35.2%

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

      11. cos-neg 35.2%

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

   3. Simplified 35.2%

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

   5. Taylor expanded in im around 0 70.4%

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

   6. Taylor expanded in im around 0 70.4%

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

      1. associate-*r* 70.4%

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

      2. mul-1-neg 70.4%

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

   8. Simplified 70.4%

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

   if 3.5 < im

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
   2. Step-by-step derivation

      1. /-rgt-identity 100.0%

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

      2. exp-0 100.0%

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

      3. associate-*l/ 100.0%

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

      4. cos-neg 100.0%

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

      5. associate-*l* 100.0%

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

      6. associate-*r/ 100.0%

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

      7. exp-0 100.0%

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

      8. /-rgt-identity 100.0%

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

      9. *-commutative 100.0%

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

      10. neg-sub0 100.0%

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

      11. cos-neg 100.0%

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

   3. Simplified 100.0%

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

   6. Applied egg-rr 100.0%

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

4. Final simplification 77.1%

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

Alternative 5: 95.1% accurate, 2.5× speedup

Math

\[\begin{array}{l} im\_m = \left|im\right| \\ im\_s = \mathsf{copysign}\left(1, im\right) \\ im\_s \cdot \begin{array}{l} \mathbf{if}\;im\_m \leq 4.5:\\ \;\;\;\;im\_m \cdot \left(-\cos re\right)\\ \mathbf{elif}\;im\_m \leq 1.1 \cdot 10^{+103}:\\ \;\;\;\;0.5 \cdot \left(27 - e^{im\_m}\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(\cos re \cdot \left(26 + im\_m \cdot \left(im\_m \cdot \left(im\_m \cdot -0.16666666666666666\right) + -1\right)\right)\right)\\ \end{array} \end{array} \]

FPCore

im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
 :precision binary64
 (*
  im_s
  (if (<= im_m 4.5)
    (* im_m (- (cos re)))
    (if (<= im_m 1.1e+103)
      (* 0.5 (- 27.0 (exp im_m)))
      (*
       0.5
       (*
        (cos re)
        (+ 26.0 (* im_m (+ (* im_m (* im_m -0.16666666666666666)) -1.0)))))))))

C

im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
	double tmp;
	if (im_m <= 4.5) {
		tmp = im_m * -cos(re);
	} else if (im_m <= 1.1e+103) {
		tmp = 0.5 * (27.0 - exp(im_m));
	} else {
		tmp = 0.5 * (cos(re) * (26.0 + (im_m * ((im_m * (im_m * -0.16666666666666666)) + -1.0))));
	}
	return im_s * tmp;
}

Fortran

im\_m = abs(im)
im\_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
    real(8), intent (in) :: im_s
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    real(8) :: tmp
    if (im_m <= 4.5d0) then
        tmp = im_m * -cos(re)
    else if (im_m <= 1.1d+103) then
        tmp = 0.5d0 * (27.0d0 - exp(im_m))
    else
        tmp = 0.5d0 * (cos(re) * (26.0d0 + (im_m * ((im_m * (im_m * (-0.16666666666666666d0))) + (-1.0d0)))))
    end if
    code = im_s * tmp
end function

Java

im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
	double tmp;
	if (im_m <= 4.5) {
		tmp = im_m * -Math.cos(re);
	} else if (im_m <= 1.1e+103) {
		tmp = 0.5 * (27.0 - Math.exp(im_m));
	} else {
		tmp = 0.5 * (Math.cos(re) * (26.0 + (im_m * ((im_m * (im_m * -0.16666666666666666)) + -1.0))));
	}
	return im_s * tmp;
}

Python

im\_m = math.fabs(im)
im\_s = math.copysign(1.0, im)
def code(im_s, re, im_m):
	tmp = 0
	if im_m <= 4.5:
		tmp = im_m * -math.cos(re)
	elif im_m <= 1.1e+103:
		tmp = 0.5 * (27.0 - math.exp(im_m))
	else:
		tmp = 0.5 * (math.cos(re) * (26.0 + (im_m * ((im_m * (im_m * -0.16666666666666666)) + -1.0))))
	return im_s * tmp

Julia

im\_m = abs(im)
im\_s = copysign(1.0, im)
function code(im_s, re, im_m)
	tmp = 0.0
	if (im_m <= 4.5)
		tmp = Float64(im_m * Float64(-cos(re)));
	elseif (im_m <= 1.1e+103)
		tmp = Float64(0.5 * Float64(27.0 - exp(im_m)));
	else
		tmp = Float64(0.5 * Float64(cos(re) * Float64(26.0 + Float64(im_m * Float64(Float64(im_m * Float64(im_m * -0.16666666666666666)) + -1.0)))));
	end
	return Float64(im_s * tmp)
end

MATLAB

im\_m = abs(im);
im\_s = sign(im) * abs(1.0);
function tmp_2 = code(im_s, re, im_m)
	tmp = 0.0;
	if (im_m <= 4.5)
		tmp = im_m * -cos(re);
	elseif (im_m <= 1.1e+103)
		tmp = 0.5 * (27.0 - exp(im_m));
	else
		tmp = 0.5 * (cos(re) * (26.0 + (im_m * ((im_m * (im_m * -0.16666666666666666)) + -1.0))));
	end
	tmp_2 = im_s * tmp;
end

Wolfram

im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := N[(im$95$s * If[LessEqual[im$95$m, 4.5], N[(im$95$m * (-N[Cos[re], $MachinePrecision])), $MachinePrecision], If[LessEqual[im$95$m, 1.1e+103], N[(0.5 * N[(27.0 - N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(N[Cos[re], $MachinePrecision] * N[(26.0 + N[(im$95$m * N[(N[(im$95$m * N[(im$95$m * -0.16666666666666666), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if im < 4.5

   1. Initial program 35.2%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
   2. Step-by-step derivation

      1. /-rgt-identity 35.2%

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

      2. exp-0 35.2%

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

      3. associate-*l/ 35.2%

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

      4. cos-neg 35.2%

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

      5. associate-*l* 35.2%

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

      6. associate-*r/ 35.2%

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

      7. exp-0 35.2%

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

      8. /-rgt-identity 35.2%

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

      9. *-commutative 35.2%

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

      10. neg-sub0 35.2%

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

      11. cos-neg 35.2%

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

   3. Simplified 35.2%

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

   5. Taylor expanded in im around 0 70.4%

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

   6. Taylor expanded in im around 0 70.4%

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

      1. associate-*r* 70.4%

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

      2. mul-1-neg 70.4%

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

   8. Simplified 70.4%

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

   if 4.5 < im < 1.09999999999999996e103

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
   2. Step-by-step derivation

      1. /-rgt-identity 100.0%

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

      2. exp-0 100.0%

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

      3. associate-*l/ 100.0%

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

      4. cos-neg 100.0%

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

      5. associate-*l* 100.0%

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

      6. associate-*r/ 100.0%

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

      7. exp-0 100.0%

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

      8. /-rgt-identity 100.0%

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

      9. *-commutative 100.0%

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

      10. neg-sub0 100.0%

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

      11. cos-neg 100.0%

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

   3. Simplified 100.0%

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

   6. Applied egg-rr 100.0%

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

   7. Taylor expanded in re around 0 72.7%

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

   if 1.09999999999999996e103 < im

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
   2. Step-by-step derivation

      1. /-rgt-identity 100.0%

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

      2. exp-0 100.0%

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

      3. associate-*l/ 100.0%

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

      4. cos-neg 100.0%

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

      5. associate-*l* 100.0%

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

      6. associate-*r/ 100.0%

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

      7. exp-0 100.0%

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

      8. /-rgt-identity 100.0%

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

      9. *-commutative 100.0%

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

      10. neg-sub0 100.0%

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

      11. cos-neg 100.0%

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

   3. Simplified 100.0%

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

   6. Applied egg-rr 100.0%

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

   7. Taylor expanded in im around 0 100.0%

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

   8. Taylor expanded in im around inf 100.0%

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

      1. *-commutative 100.0%

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

   10. Simplified 100.0%

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

4. Final simplification 74.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 4.5:\\ \;\;\;\;im \cdot \left(-\cos re\right)\\ \mathbf{elif}\;im \leq 1.1 \cdot 10^{+103}:\\ \;\;\;\;0.5 \cdot \left(27 - e^{im}\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(\cos re \cdot \left(26 + im \cdot \left(im \cdot \left(im \cdot -0.16666666666666666\right) + -1\right)\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 93.3% accurate, 2.5× speedup

Math

\[\begin{array}{l} im\_m = \left|im\right| \\ im\_s = \mathsf{copysign}\left(1, im\right) \\ im\_s \cdot \begin{array}{l} \mathbf{if}\;im\_m \leq 4.4:\\ \;\;\;\;im\_m \cdot \left(-\cos re\right)\\ \mathbf{elif}\;im\_m \leq 1.9 \cdot 10^{+154}:\\ \;\;\;\;0.5 \cdot \left(27 - e^{im\_m}\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(\cos re \cdot \left(26 + im\_m \cdot \left(im\_m \cdot -0.5 + -1\right)\right)\right)\\ \end{array} \end{array} \]

FPCore

im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
 :precision binary64
 (*
  im_s
  (if (<= im_m 4.4)
    (* im_m (- (cos re)))
    (if (<= im_m 1.9e+154)
      (* 0.5 (- 27.0 (exp im_m)))
      (* 0.5 (* (cos re) (+ 26.0 (* im_m (+ (* im_m -0.5) -1.0)))))))))

C

im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
	double tmp;
	if (im_m <= 4.4) {
		tmp = im_m * -cos(re);
	} else if (im_m <= 1.9e+154) {
		tmp = 0.5 * (27.0 - exp(im_m));
	} else {
		tmp = 0.5 * (cos(re) * (26.0 + (im_m * ((im_m * -0.5) + -1.0))));
	}
	return im_s * tmp;
}

Fortran

im\_m = abs(im)
im\_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
    real(8), intent (in) :: im_s
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    real(8) :: tmp
    if (im_m <= 4.4d0) then
        tmp = im_m * -cos(re)
    else if (im_m <= 1.9d+154) then
        tmp = 0.5d0 * (27.0d0 - exp(im_m))
    else
        tmp = 0.5d0 * (cos(re) * (26.0d0 + (im_m * ((im_m * (-0.5d0)) + (-1.0d0)))))
    end if
    code = im_s * tmp
end function

Java

im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
	double tmp;
	if (im_m <= 4.4) {
		tmp = im_m * -Math.cos(re);
	} else if (im_m <= 1.9e+154) {
		tmp = 0.5 * (27.0 - Math.exp(im_m));
	} else {
		tmp = 0.5 * (Math.cos(re) * (26.0 + (im_m * ((im_m * -0.5) + -1.0))));
	}
	return im_s * tmp;
}

Python

im\_m = math.fabs(im)
im\_s = math.copysign(1.0, im)
def code(im_s, re, im_m):
	tmp = 0
	if im_m <= 4.4:
		tmp = im_m * -math.cos(re)
	elif im_m <= 1.9e+154:
		tmp = 0.5 * (27.0 - math.exp(im_m))
	else:
		tmp = 0.5 * (math.cos(re) * (26.0 + (im_m * ((im_m * -0.5) + -1.0))))
	return im_s * tmp

Julia

im\_m = abs(im)
im\_s = copysign(1.0, im)
function code(im_s, re, im_m)
	tmp = 0.0
	if (im_m <= 4.4)
		tmp = Float64(im_m * Float64(-cos(re)));
	elseif (im_m <= 1.9e+154)
		tmp = Float64(0.5 * Float64(27.0 - exp(im_m)));
	else
		tmp = Float64(0.5 * Float64(cos(re) * Float64(26.0 + Float64(im_m * Float64(Float64(im_m * -0.5) + -1.0)))));
	end
	return Float64(im_s * tmp)
end

MATLAB

im\_m = abs(im);
im\_s = sign(im) * abs(1.0);
function tmp_2 = code(im_s, re, im_m)
	tmp = 0.0;
	if (im_m <= 4.4)
		tmp = im_m * -cos(re);
	elseif (im_m <= 1.9e+154)
		tmp = 0.5 * (27.0 - exp(im_m));
	else
		tmp = 0.5 * (cos(re) * (26.0 + (im_m * ((im_m * -0.5) + -1.0))));
	end
	tmp_2 = im_s * tmp;
end

Wolfram

im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := N[(im$95$s * If[LessEqual[im$95$m, 4.4], N[(im$95$m * (-N[Cos[re], $MachinePrecision])), $MachinePrecision], If[LessEqual[im$95$m, 1.9e+154], N[(0.5 * N[(27.0 - N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(N[Cos[re], $MachinePrecision] * N[(26.0 + N[(im$95$m * N[(N[(im$95$m * -0.5), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if im < 4.4000000000000004

   1. Initial program 35.2%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
   2. Step-by-step derivation

      1. /-rgt-identity 35.2%

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

      2. exp-0 35.2%

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

      3. associate-*l/ 35.2%

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

      4. cos-neg 35.2%

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

      5. associate-*l* 35.2%

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

      6. associate-*r/ 35.2%

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

      7. exp-0 35.2%

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

      8. /-rgt-identity 35.2%

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

      9. *-commutative 35.2%

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

      10. neg-sub0 35.2%

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

      11. cos-neg 35.2%

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

   3. Simplified 35.2%

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

   5. Taylor expanded in im around 0 70.4%

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

   6. Taylor expanded in im around 0 70.4%

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

      1. associate-*r* 70.4%

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

      2. mul-1-neg 70.4%

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

   8. Simplified 70.4%

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

   if 4.4000000000000004 < im < 1.8999999999999999e154

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
   2. Step-by-step derivation

      1. /-rgt-identity 100.0%

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

      2. exp-0 100.0%

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

      3. associate-*l/ 100.0%

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

      4. cos-neg 100.0%

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

      5. associate-*l* 100.0%

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

      6. associate-*r/ 100.0%

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

      7. exp-0 100.0%

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

      8. /-rgt-identity 100.0%

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

      9. *-commutative 100.0%

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

      10. neg-sub0 100.0%

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

      11. cos-neg 100.0%

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

   3. Simplified 100.0%

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

   6. Applied egg-rr 100.0%

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

   7. Taylor expanded in re around 0 69.0%

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

   if 1.8999999999999999e154 < im

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
   2. Step-by-step derivation

      1. /-rgt-identity 100.0%

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

      2. exp-0 100.0%

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

      3. associate-*l/ 100.0%

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

      4. cos-neg 100.0%

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

      5. associate-*l* 100.0%

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

      6. associate-*r/ 100.0%

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

      7. exp-0 100.0%

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

      8. /-rgt-identity 100.0%

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

      9. *-commutative 100.0%

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

      10. neg-sub0 100.0%

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

      11. cos-neg 100.0%

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

   3. Simplified 100.0%

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

   6. Applied egg-rr 100.0%

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

   7. Taylor expanded in im around 0 100.0%

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

4. Final simplification 73.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 4.4:\\ \;\;\;\;im \cdot \left(-\cos re\right)\\ \mathbf{elif}\;im \leq 1.9 \cdot 10^{+154}:\\ \;\;\;\;0.5 \cdot \left(27 - e^{im}\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(\cos re \cdot \left(26 + im \cdot \left(im \cdot -0.5 + -1\right)\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 87.0% accurate, 2.8× speedup

Math

\[\begin{array}{l} im\_m = \left|im\right| \\ im\_s = \mathsf{copysign}\left(1, im\right) \\ im\_s \cdot \begin{array}{l} \mathbf{if}\;im\_m \leq 4.5:\\ \;\;\;\;im\_m \cdot \left(-\cos re\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(27 - e^{im\_m}\right)\\ \end{array} \end{array} \]

FPCore

im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
 :precision binary64
 (* im_s (if (<= im_m 4.5) (* im_m (- (cos re))) (* 0.5 (- 27.0 (exp im_m))))))

C

im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
	double tmp;
	if (im_m <= 4.5) {
		tmp = im_m * -cos(re);
	} else {
		tmp = 0.5 * (27.0 - exp(im_m));
	}
	return im_s * tmp;
}

Fortran

im\_m = abs(im)
im\_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
    real(8), intent (in) :: im_s
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    real(8) :: tmp
    if (im_m <= 4.5d0) then
        tmp = im_m * -cos(re)
    else
        tmp = 0.5d0 * (27.0d0 - exp(im_m))
    end if
    code = im_s * tmp
end function

Java

im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
	double tmp;
	if (im_m <= 4.5) {
		tmp = im_m * -Math.cos(re);
	} else {
		tmp = 0.5 * (27.0 - Math.exp(im_m));
	}
	return im_s * tmp;
}

Python

im\_m = math.fabs(im)
im\_s = math.copysign(1.0, im)
def code(im_s, re, im_m):
	tmp = 0
	if im_m <= 4.5:
		tmp = im_m * -math.cos(re)
	else:
		tmp = 0.5 * (27.0 - math.exp(im_m))
	return im_s * tmp

Julia

im\_m = abs(im)
im\_s = copysign(1.0, im)
function code(im_s, re, im_m)
	tmp = 0.0
	if (im_m <= 4.5)
		tmp = Float64(im_m * Float64(-cos(re)));
	else
		tmp = Float64(0.5 * Float64(27.0 - exp(im_m)));
	end
	return Float64(im_s * tmp)
end

MATLAB

im\_m = abs(im);
im\_s = sign(im) * abs(1.0);
function tmp_2 = code(im_s, re, im_m)
	tmp = 0.0;
	if (im_m <= 4.5)
		tmp = im_m * -cos(re);
	else
		tmp = 0.5 * (27.0 - exp(im_m));
	end
	tmp_2 = im_s * tmp;
end

Wolfram

im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := N[(im$95$s * If[LessEqual[im$95$m, 4.5], N[(im$95$m * (-N[Cos[re], $MachinePrecision])), $MachinePrecision], N[(0.5 * N[(27.0 - N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if im < 4.5

   1. Initial program 35.2%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
   2. Step-by-step derivation

      1. /-rgt-identity 35.2%

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

      2. exp-0 35.2%

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

      3. associate-*l/ 35.2%

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

      4. cos-neg 35.2%

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

      5. associate-*l* 35.2%

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

      6. associate-*r/ 35.2%

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

      7. exp-0 35.2%

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

      8. /-rgt-identity 35.2%

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

      9. *-commutative 35.2%

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

      10. neg-sub0 35.2%

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

      11. cos-neg 35.2%

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

   3. Simplified 35.2%

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

   5. Taylor expanded in im around 0 70.4%

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

   6. Taylor expanded in im around 0 70.4%

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

      1. associate-*r* 70.4%

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

      2. mul-1-neg 70.4%

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

   8. Simplified 70.4%

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

   if 4.5 < im

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
   2. Step-by-step derivation

      1. /-rgt-identity 100.0%

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

      2. exp-0 100.0%

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

      3. associate-*l/ 100.0%

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

      4. cos-neg 100.0%

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

      5. associate-*l* 100.0%

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

      6. associate-*r/ 100.0%

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

      7. exp-0 100.0%

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

      8. /-rgt-identity 100.0%

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

      9. *-commutative 100.0%

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

      10. neg-sub0 100.0%

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

      11. cos-neg 100.0%

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

   3. Simplified 100.0%

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

   6. Applied egg-rr 100.0%

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

   7. Taylor expanded in re around 0 67.2%

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

4. Final simplification 69.7%

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

Alternative 8: 74.5% accurate, 2.8× speedup

Math

\[\begin{array}{l} im\_m = \left|im\right| \\ im\_s = \mathsf{copysign}\left(1, im\right) \\ im\_s \cdot \begin{array}{l} \mathbf{if}\;im\_m \leq 9.5 \cdot 10^{-13}:\\ \;\;\;\;im\_m \cdot \left(-\cos re\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(im\_m \cdot \left(\left(im\_m \cdot im\_m\right) \cdot -0.3333333333333333 - 2\right)\right)\\ \end{array} \end{array} \]

FPCore

im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
 :precision binary64
 (*
  im_s
  (if (<= im_m 9.5e-13)
    (* im_m (- (cos re)))
    (* 0.5 (* im_m (- (* (* im_m im_m) -0.3333333333333333) 2.0))))))

C

im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
	double tmp;
	if (im_m <= 9.5e-13) {
		tmp = im_m * -cos(re);
	} else {
		tmp = 0.5 * (im_m * (((im_m * im_m) * -0.3333333333333333) - 2.0));
	}
	return im_s * tmp;
}

Fortran

im\_m = abs(im)
im\_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
    real(8), intent (in) :: im_s
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    real(8) :: tmp
    if (im_m <= 9.5d-13) then
        tmp = im_m * -cos(re)
    else
        tmp = 0.5d0 * (im_m * (((im_m * im_m) * (-0.3333333333333333d0)) - 2.0d0))
    end if
    code = im_s * tmp
end function

Java

im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
	double tmp;
	if (im_m <= 9.5e-13) {
		tmp = im_m * -Math.cos(re);
	} else {
		tmp = 0.5 * (im_m * (((im_m * im_m) * -0.3333333333333333) - 2.0));
	}
	return im_s * tmp;
}

Python

im\_m = math.fabs(im)
im\_s = math.copysign(1.0, im)
def code(im_s, re, im_m):
	tmp = 0
	if im_m <= 9.5e-13:
		tmp = im_m * -math.cos(re)
	else:
		tmp = 0.5 * (im_m * (((im_m * im_m) * -0.3333333333333333) - 2.0))
	return im_s * tmp

Julia

im\_m = abs(im)
im\_s = copysign(1.0, im)
function code(im_s, re, im_m)
	tmp = 0.0
	if (im_m <= 9.5e-13)
		tmp = Float64(im_m * Float64(-cos(re)));
	else
		tmp = Float64(0.5 * Float64(im_m * Float64(Float64(Float64(im_m * im_m) * -0.3333333333333333) - 2.0)));
	end
	return Float64(im_s * tmp)
end

MATLAB

im\_m = abs(im);
im\_s = sign(im) * abs(1.0);
function tmp_2 = code(im_s, re, im_m)
	tmp = 0.0;
	if (im_m <= 9.5e-13)
		tmp = im_m * -cos(re);
	else
		tmp = 0.5 * (im_m * (((im_m * im_m) * -0.3333333333333333) - 2.0));
	end
	tmp_2 = im_s * tmp;
end

Wolfram

im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := N[(im$95$s * If[LessEqual[im$95$m, 9.5e-13], N[(im$95$m * (-N[Cos[re], $MachinePrecision])), $MachinePrecision], N[(0.5 * N[(im$95$m * N[(N[(N[(im$95$m * im$95$m), $MachinePrecision] * -0.3333333333333333), $MachinePrecision] - 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if im < 9.49999999999999991e-13

   1. Initial program 35.2%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
   2. Step-by-step derivation

      1. /-rgt-identity 35.2%

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

      2. exp-0 35.2%

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

      3. associate-*l/ 35.2%

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

      4. cos-neg 35.2%

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

      5. associate-*l* 35.2%

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

      6. associate-*r/ 35.2%

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

      7. exp-0 35.2%

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

      8. /-rgt-identity 35.2%

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

      9. *-commutative 35.2%

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

      10. neg-sub0 35.2%

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

      11. cos-neg 35.2%

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

   3. Simplified 35.2%

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

   5. Taylor expanded in im around 0 70.4%

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

   6. Taylor expanded in im around 0 70.4%

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

      1. associate-*r* 70.4%

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

      2. mul-1-neg 70.4%

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

   8. Simplified 70.4%

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

   if 9.49999999999999991e-13 < im

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
   2. Step-by-step derivation

      1. /-rgt-identity 100.0%

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

      2. exp-0 100.0%

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

      3. associate-*l/ 100.0%

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

      4. cos-neg 100.0%

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

      5. associate-*l* 100.0%

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

      6. associate-*r/ 100.0%

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

      7. exp-0 100.0%

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

      8. /-rgt-identity 100.0%

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

      9. *-commutative 100.0%

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

      10. neg-sub0 100.0%

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

      11. cos-neg 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in im around 0 83.5%

      \[\leadsto 0.5 \cdot \left(\color{blue}{\left(im \cdot \left({im}^{2} \cdot \left({im}^{2} \cdot \left(-0.0003968253968253968 \cdot {im}^{2} - 0.016666666666666666\right) - 0.3333333333333333\right) - 2\right)\right)} \cdot \cos re\right) \]

   6. Taylor expanded in re around 0 57.4%

      \[\leadsto 0.5 \cdot \color{blue}{\left(im \cdot \left({im}^{2} \cdot \left({im}^{2} \cdot \left(-0.0003968253968253968 \cdot {im}^{2} - 0.016666666666666666\right) - 0.3333333333333333\right) - 2\right)\right)} \]

   7. Taylor expanded in im around 0 41.0%

      \[\leadsto 0.5 \cdot \left(im \cdot \left(\color{blue}{-0.3333333333333333 \cdot {im}^{2}} - 2\right)\right) \]
   8. Step-by-step derivation

      1. *-commutative 41.0%

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

   9. Simplified 41.0%

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

       1. unpow2 41.0%

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

   11. Applied egg-rr 41.0%

       \[\leadsto 0.5 \cdot \left(im \cdot \left(\color{blue}{\left(im \cdot im\right)} \cdot -0.3333333333333333 - 2\right)\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 63.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 9.5 \cdot 10^{-13}:\\ \;\;\;\;im \cdot \left(-\cos re\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(im \cdot \left(\left(im \cdot im\right) \cdot -0.3333333333333333 - 2\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 47.6% accurate, 22.0× speedup

Math

\[\begin{array}{l} im\_m = \left|im\right| \\ im\_s = \mathsf{copysign}\left(1, im\right) \\ im\_s \cdot \begin{array}{l} \mathbf{if}\;im\_m \leq 8.5:\\ \;\;\;\;-im\_m\\ \mathbf{else}:\\ \;\;\;\;13 + im\_m \cdot \left(im\_m \cdot -0.25 - 0.5\right)\\ \end{array} \end{array} \]

FPCore

im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
 :precision binary64
 (* im_s (if (<= im_m 8.5) (- im_m) (+ 13.0 (* im_m (- (* im_m -0.25) 0.5))))))

C

im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
	double tmp;
	if (im_m <= 8.5) {
		tmp = -im_m;
	} else {
		tmp = 13.0 + (im_m * ((im_m * -0.25) - 0.5));
	}
	return im_s * tmp;
}

Fortran

im\_m = abs(im)
im\_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
    real(8), intent (in) :: im_s
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    real(8) :: tmp
    if (im_m <= 8.5d0) then
        tmp = -im_m
    else
        tmp = 13.0d0 + (im_m * ((im_m * (-0.25d0)) - 0.5d0))
    end if
    code = im_s * tmp
end function

Java

im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
	double tmp;
	if (im_m <= 8.5) {
		tmp = -im_m;
	} else {
		tmp = 13.0 + (im_m * ((im_m * -0.25) - 0.5));
	}
	return im_s * tmp;
}

Python

im\_m = math.fabs(im)
im\_s = math.copysign(1.0, im)
def code(im_s, re, im_m):
	tmp = 0
	if im_m <= 8.5:
		tmp = -im_m
	else:
		tmp = 13.0 + (im_m * ((im_m * -0.25) - 0.5))
	return im_s * tmp

Julia

im\_m = abs(im)
im\_s = copysign(1.0, im)
function code(im_s, re, im_m)
	tmp = 0.0
	if (im_m <= 8.5)
		tmp = Float64(-im_m);
	else
		tmp = Float64(13.0 + Float64(im_m * Float64(Float64(im_m * -0.25) - 0.5)));
	end
	return Float64(im_s * tmp)
end

MATLAB

im\_m = abs(im);
im\_s = sign(im) * abs(1.0);
function tmp_2 = code(im_s, re, im_m)
	tmp = 0.0;
	if (im_m <= 8.5)
		tmp = -im_m;
	else
		tmp = 13.0 + (im_m * ((im_m * -0.25) - 0.5));
	end
	tmp_2 = im_s * tmp;
end

Wolfram

im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := N[(im$95$s * If[LessEqual[im$95$m, 8.5], (-im$95$m), N[(13.0 + N[(im$95$m * N[(N[(im$95$m * -0.25), $MachinePrecision] - 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if im < 8.5

   1. Initial program 35.2%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
   2. Step-by-step derivation

      1. /-rgt-identity 35.2%

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

      2. exp-0 35.2%

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

      3. associate-*l/ 35.2%

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

      4. cos-neg 35.2%

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

      5. associate-*l* 35.2%

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

      6. associate-*r/ 35.2%

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

      7. exp-0 35.2%

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

      8. /-rgt-identity 35.2%

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

      9. *-commutative 35.2%

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

      10. neg-sub0 35.2%

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

      11. cos-neg 35.2%

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

   3. Simplified 35.2%

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

   5. Taylor expanded in im around 0 70.4%

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

   6. Taylor expanded in re around 0 42.0%

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

      1. mul-1-neg 42.0%

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

   8. Simplified 42.0%

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

   if 8.5 < im

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
   2. Step-by-step derivation

      1. /-rgt-identity 100.0%

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

      2. exp-0 100.0%

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

      3. associate-*l/ 100.0%

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

      4. cos-neg 100.0%

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

      5. associate-*l* 100.0%

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

      6. associate-*r/ 100.0%

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

      7. exp-0 100.0%

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

      8. /-rgt-identity 100.0%

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

      9. *-commutative 100.0%

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

      10. neg-sub0 100.0%

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

      11. cos-neg 100.0%

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

   3. Simplified 100.0%

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

   6. Applied egg-rr 100.0%

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

   7. Taylor expanded in re around 0 67.2%

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

   8. Taylor expanded in im around 0 34.4%

      \[\leadsto \color{blue}{13 + im \cdot \left(-0.25 \cdot im - 0.5\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 40.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 8.5:\\ \;\;\;\;-im\\ \mathbf{else}:\\ \;\;\;\;13 + im \cdot \left(im \cdot -0.25 - 0.5\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 47.6% accurate, 25.7× speedup

Math

\[\begin{array}{l} im\_m = \left|im\right| \\ im\_s = \mathsf{copysign}\left(1, im\right) \\ im\_s \cdot \begin{array}{l} \mathbf{if}\;im\_m \leq 9.5:\\ \;\;\;\;-im\_m\\ \mathbf{else}:\\ \;\;\;\;13 + im\_m \cdot \left(im\_m \cdot -0.25\right)\\ \end{array} \end{array} \]

FPCore

im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
 :precision binary64
 (* im_s (if (<= im_m 9.5) (- im_m) (+ 13.0 (* im_m (* im_m -0.25))))))

C

im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
	double tmp;
	if (im_m <= 9.5) {
		tmp = -im_m;
	} else {
		tmp = 13.0 + (im_m * (im_m * -0.25));
	}
	return im_s * tmp;
}

Fortran

im\_m = abs(im)
im\_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
    real(8), intent (in) :: im_s
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    real(8) :: tmp
    if (im_m <= 9.5d0) then
        tmp = -im_m
    else
        tmp = 13.0d0 + (im_m * (im_m * (-0.25d0)))
    end if
    code = im_s * tmp
end function

Java

im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
	double tmp;
	if (im_m <= 9.5) {
		tmp = -im_m;
	} else {
		tmp = 13.0 + (im_m * (im_m * -0.25));
	}
	return im_s * tmp;
}

Python

im\_m = math.fabs(im)
im\_s = math.copysign(1.0, im)
def code(im_s, re, im_m):
	tmp = 0
	if im_m <= 9.5:
		tmp = -im_m
	else:
		tmp = 13.0 + (im_m * (im_m * -0.25))
	return im_s * tmp

Julia

im\_m = abs(im)
im\_s = copysign(1.0, im)
function code(im_s, re, im_m)
	tmp = 0.0
	if (im_m <= 9.5)
		tmp = Float64(-im_m);
	else
		tmp = Float64(13.0 + Float64(im_m * Float64(im_m * -0.25)));
	end
	return Float64(im_s * tmp)
end

MATLAB

im\_m = abs(im);
im\_s = sign(im) * abs(1.0);
function tmp_2 = code(im_s, re, im_m)
	tmp = 0.0;
	if (im_m <= 9.5)
		tmp = -im_m;
	else
		tmp = 13.0 + (im_m * (im_m * -0.25));
	end
	tmp_2 = im_s * tmp;
end

Wolfram

im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := N[(im$95$s * If[LessEqual[im$95$m, 9.5], (-im$95$m), N[(13.0 + N[(im$95$m * N[(im$95$m * -0.25), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if im < 9.5

   1. Initial program 35.2%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
   2. Step-by-step derivation

      1. /-rgt-identity 35.2%

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

      2. exp-0 35.2%

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

      3. associate-*l/ 35.2%

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

      4. cos-neg 35.2%

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

      5. associate-*l* 35.2%

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

      6. associate-*r/ 35.2%

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

      7. exp-0 35.2%

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

      8. /-rgt-identity 35.2%

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

      9. *-commutative 35.2%

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

      10. neg-sub0 35.2%

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

      11. cos-neg 35.2%

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

   3. Simplified 35.2%

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

   5. Taylor expanded in im around 0 70.4%

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

   6. Taylor expanded in re around 0 42.0%

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

      1. mul-1-neg 42.0%

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

   8. Simplified 42.0%

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

   if 9.5 < im

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
   2. Step-by-step derivation

      1. /-rgt-identity 100.0%

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

      2. exp-0 100.0%

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

      3. associate-*l/ 100.0%

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

      4. cos-neg 100.0%

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

      5. associate-*l* 100.0%

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

      6. associate-*r/ 100.0%

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

      7. exp-0 100.0%

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

      8. /-rgt-identity 100.0%

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

      9. *-commutative 100.0%

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

      10. neg-sub0 100.0%

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

      11. cos-neg 100.0%

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

   3. Simplified 100.0%

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

   6. Applied egg-rr 100.0%

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

   7. Taylor expanded in re around 0 67.2%

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

   8. Taylor expanded in im around 0 34.4%

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

   9. Taylor expanded in im around inf 34.4%

      \[\leadsto 13 + im \cdot \color{blue}{\left(-0.25 \cdot im\right)} \]
   10. Step-by-step derivation

       1. *-commutative 34.4%

          \[\leadsto 13 + im \cdot \color{blue}{\left(im \cdot -0.25\right)} \]

   11. Simplified 34.4%

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

Alternative 11: 53.7% accurate, 28.1× speedup

Math

\[\begin{array}{l} im\_m = \left|im\right| \\ im\_s = \mathsf{copysign}\left(1, im\right) \\ im\_s \cdot \left(0.5 \cdot \left(im\_m \cdot \left(\left(im\_m \cdot im\_m\right) \cdot -0.3333333333333333 - 2\right)\right)\right) \end{array} \]

FPCore

im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
 :precision binary64
 (* im_s (* 0.5 (* im_m (- (* (* im_m im_m) -0.3333333333333333) 2.0)))))

C

im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
	return im_s * (0.5 * (im_m * (((im_m * im_m) * -0.3333333333333333) - 2.0)));
}

Fortran

im\_m = abs(im)
im\_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
    real(8), intent (in) :: im_s
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    code = im_s * (0.5d0 * (im_m * (((im_m * im_m) * (-0.3333333333333333d0)) - 2.0d0)))
end function

Java

im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
	return im_s * (0.5 * (im_m * (((im_m * im_m) * -0.3333333333333333) - 2.0)));
}

Python

im\_m = math.fabs(im)
im\_s = math.copysign(1.0, im)
def code(im_s, re, im_m):
	return im_s * (0.5 * (im_m * (((im_m * im_m) * -0.3333333333333333) - 2.0)))

Julia

im\_m = abs(im)
im\_s = copysign(1.0, im)
function code(im_s, re, im_m)
	return Float64(im_s * Float64(0.5 * Float64(im_m * Float64(Float64(Float64(im_m * im_m) * -0.3333333333333333) - 2.0))))
end

MATLAB

im\_m = abs(im);
im\_s = sign(im) * abs(1.0);
function tmp = code(im_s, re, im_m)
	tmp = im_s * (0.5 * (im_m * (((im_m * im_m) * -0.3333333333333333) - 2.0)));
end

Wolfram

im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := N[(im$95$s * N[(0.5 * N[(im$95$m * N[(N[(N[(im$95$m * im$95$m), $MachinePrecision] * -0.3333333333333333), $MachinePrecision] - 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 49.9%

   \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
2. Step-by-step derivation

   1. /-rgt-identity 49.9%

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

   2. exp-0 49.9%

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

   3. associate-*l/ 49.9%

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

   4. cos-neg 49.9%

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

   5. associate-*l* 49.9%

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

   6. associate-*r/ 49.9%

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

   7. exp-0 49.9%

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

   8. /-rgt-identity 49.9%

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

   9. *-commutative 49.9%

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

   10. neg-sub0 49.9%

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

   11. cos-neg 49.9%

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

3. Simplified 49.9%

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

5. Taylor expanded in im around 0 93.2%

   \[\leadsto 0.5 \cdot \left(\color{blue}{\left(im \cdot \left({im}^{2} \cdot \left({im}^{2} \cdot \left(-0.0003968253968253968 \cdot {im}^{2} - 0.016666666666666666\right) - 0.3333333333333333\right) - 2\right)\right)} \cdot \cos re\right) \]

6. Taylor expanded in re around 0 61.3%

   \[\leadsto 0.5 \cdot \color{blue}{\left(im \cdot \left({im}^{2} \cdot \left({im}^{2} \cdot \left(-0.0003968253968253968 \cdot {im}^{2} - 0.016666666666666666\right) - 0.3333333333333333\right) - 2\right)\right)} \]

7. Taylor expanded in im around 0 54.4%

   \[\leadsto 0.5 \cdot \left(im \cdot \left(\color{blue}{-0.3333333333333333 \cdot {im}^{2}} - 2\right)\right) \]
8. Step-by-step derivation

   1. *-commutative 54.4%

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

9. Simplified 54.4%

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

    1. unpow2 54.4%

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

11. Applied egg-rr 54.4%

    \[\leadsto 0.5 \cdot \left(im \cdot \left(\color{blue}{\left(im \cdot im\right)} \cdot -0.3333333333333333 - 2\right)\right) \]
12. Add Preprocessing

Alternative 12: 29.9% accurate, 154.5× speedup

Math

\[\begin{array}{l} im\_m = \left|im\right| \\ im\_s = \mathsf{copysign}\left(1, im\right) \\ im\_s \cdot \left(-im\_m\right) \end{array} \]

FPCore

im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m) :precision binary64 (* im_s (- im_m)))

C

im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
	return im_s * -im_m;
}

Fortran

im\_m = abs(im)
im\_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
    real(8), intent (in) :: im_s
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    code = im_s * -im_m
end function

Java

im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
	return im_s * -im_m;
}

Python

im\_m = math.fabs(im)
im\_s = math.copysign(1.0, im)
def code(im_s, re, im_m):
	return im_s * -im_m

Julia

im\_m = abs(im)
im\_s = copysign(1.0, im)
function code(im_s, re, im_m)
	return Float64(im_s * Float64(-im_m))
end

MATLAB

im\_m = abs(im);
im\_s = sign(im) * abs(1.0);
function tmp = code(im_s, re, im_m)
	tmp = im_s * -im_m;
end

Wolfram

im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := N[(im$95$s * (-im$95$m)), $MachinePrecision]

Derivation

1. Initial program 49.9%

   \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
2. Step-by-step derivation

   1. /-rgt-identity 49.9%

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

   2. exp-0 49.9%

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

   3. associate-*l/ 49.9%

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

   4. cos-neg 49.9%

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

   5. associate-*l* 49.9%

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

   6. associate-*r/ 49.9%

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

   7. exp-0 49.9%

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

   8. /-rgt-identity 49.9%

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

   9. *-commutative 49.9%

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

   10. neg-sub0 49.9%

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

   11. cos-neg 49.9%

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

3. Simplified 49.9%

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

5. Taylor expanded in im around 0 55.6%

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

6. Taylor expanded in re around 0 33.3%

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

   1. mul-1-neg 33.3%

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

8. Simplified 33.3%

   \[\leadsto \color{blue}{-im} \]
9. Add Preprocessing

Alternative 13: 3.5% accurate, 309.0× speedup

Math

\[\begin{array}{l} im\_m = \left|im\right| \\ im\_s = \mathsf{copysign}\left(1, im\right) \\ im\_s \cdot 0 \end{array} \]

FPCore

im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m) :precision binary64 (* im_s 0.0))

C

im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
	return im_s * 0.0;
}

Fortran

im\_m = abs(im)
im\_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
    real(8), intent (in) :: im_s
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    code = im_s * 0.0d0
end function

Java

im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
	return im_s * 0.0;
}

Python

im\_m = math.fabs(im)
im\_s = math.copysign(1.0, im)
def code(im_s, re, im_m):
	return im_s * 0.0

Julia

im\_m = abs(im)
im\_s = copysign(1.0, im)
function code(im_s, re, im_m)
	return Float64(im_s * 0.0)
end

MATLAB

im\_m = abs(im);
im\_s = sign(im) * abs(1.0);
function tmp = code(im_s, re, im_m)
	tmp = im_s * 0.0;
end

Wolfram

im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := N[(im$95$s * 0.0), $MachinePrecision]

Derivation

1. Initial program 49.9%

   \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
2. Step-by-step derivation

   1. /-rgt-identity 49.9%

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

   2. exp-0 49.9%

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

   3. associate-*l/ 49.9%

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

   4. cos-neg 49.9%

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

   5. associate-*l* 49.9%

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

   6. associate-*r/ 49.9%

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

   7. exp-0 49.9%

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

   8. /-rgt-identity 49.9%

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

   9. *-commutative 49.9%

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

   10. neg-sub0 49.9%

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

   11. cos-neg 49.9%

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

3. Simplified 49.9%

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

6. Applied egg-rr 3.6%

   \[\leadsto 0.5 \cdot \color{blue}{0} \]
7. Step-by-step derivation

   1. metadata-eval 3.6%

      \[\leadsto \color{blue}{0} \]

8. Applied egg-rr 3.6%

   \[\leadsto \color{blue}{0} \]
9. Add Preprocessing

Alternative 14: 3.6% accurate, 309.0× speedup

Math

\[\begin{array}{l} im\_m = \left|im\right| \\ im\_s = \mathsf{copysign}\left(1, im\right) \\ im\_s \cdot -1 \end{array} \]

FPCore

im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m) :precision binary64 (* im_s -1.0))

C

im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
	return im_s * -1.0;
}

Fortran

im\_m = abs(im)
im\_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
    real(8), intent (in) :: im_s
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    code = im_s * (-1.0d0)
end function

Java

im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
	return im_s * -1.0;
}

Python

im\_m = math.fabs(im)
im\_s = math.copysign(1.0, im)
def code(im_s, re, im_m):
	return im_s * -1.0

Julia

im\_m = abs(im)
im\_s = copysign(1.0, im)
function code(im_s, re, im_m)
	return Float64(im_s * -1.0)
end

MATLAB

im\_m = abs(im);
im\_s = sign(im) * abs(1.0);
function tmp = code(im_s, re, im_m)
	tmp = im_s * -1.0;
end

Wolfram

im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := N[(im$95$s * -1.0), $MachinePrecision]

Derivation

1. Initial program 49.9%

   \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
2. Step-by-step derivation

   1. /-rgt-identity 49.9%

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

   2. exp-0 49.9%

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

   3. associate-*l/ 49.9%

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

   4. cos-neg 49.9%

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

   5. associate-*l* 49.9%

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

   6. associate-*r/ 49.9%

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

   7. exp-0 49.9%

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

   8. /-rgt-identity 49.9%

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

   9. *-commutative 49.9%

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

   10. neg-sub0 49.9%

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

   11. cos-neg 49.9%

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

3. Simplified 49.9%

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

6. Applied egg-rr 2.7%

   \[\leadsto 0.5 \cdot \color{blue}{-2} \]
7. Step-by-step derivation

   1. metadata-eval 2.7%

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

8. Applied egg-rr 2.7%

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

Developer Target 1: 99.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\left|im\right| < 1:\\ \;\;\;\;-\cos re \cdot \left(\left(im + \left(\left(0.16666666666666666 \cdot im\right) \cdot im\right) \cdot im\right) + \left(\left(\left(\left(0.008333333333333333 \cdot im\right) \cdot im\right) \cdot im\right) \cdot im\right) \cdot im\right)\\ \mathbf{else}:\\ \;\;\;\;\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (< (fabs im) 1.0)
   (-
    (*
     (cos re)
     (+
      (+ im (* (* (* 0.16666666666666666 im) im) im))
      (* (* (* (* (* 0.008333333333333333 im) im) im) im) im))))
   (* (* 0.5 (cos re)) (- (exp (- 0.0 im)) (exp im)))))

C

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

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    real(8) :: tmp
    if (abs(im) < 1.0d0) then
        tmp = -(cos(re) * ((im + (((0.16666666666666666d0 * im) * im) * im)) + (((((0.008333333333333333d0 * im) * im) * im) * im) * im)))
    else
        tmp = (0.5d0 * cos(re)) * (exp((0.0d0 - im)) - exp(im))
    end if
    code = tmp
end function

Java

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

Python

def code(re, im):
	tmp = 0
	if math.fabs(im) < 1.0:
		tmp = -(math.cos(re) * ((im + (((0.16666666666666666 * im) * im) * im)) + (((((0.008333333333333333 * im) * im) * im) * im) * im)))
	else:
		tmp = (0.5 * math.cos(re)) * (math.exp((0.0 - im)) - math.exp(im))
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Reproduce

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

  :alt
  (! :herbie-platform default (if (< (fabs im) 1) (- (* (cos re) (+ im (* 1/6 im im im) (* 1/120 im im im im im)))) (* (* 1/2 (cos re)) (- (exp (- 0 im)) (exp im)))))

  (* (* 0.5 (cos re)) (- (exp (- 0.0 im)) (exp im))))