math.cube on complex, imaginary part

Percentage Accurate: 82.4% → 99.8%

Time: 10.6s

Alternatives: 11

Speedup: 1.2×

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

Specification

Math

\[\begin{array}{l} \\ \left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \end{array} \]

FPCore

(FPCore (x.re x.im)
 :precision binary64
 (+
  (* (- (* x.re x.re) (* x.im x.im)) x.im)
  (* (+ (* x.re x.im) (* x.im x.re)) x.re)))

C

double code(double x_46_re, double x_46_im) {
	return (((x_46_re * x_46_re) - (x_46_im * x_46_im)) * x_46_im) + (((x_46_re * x_46_im) + (x_46_im * x_46_re)) * x_46_re);
}

Fortran

real(8) function code(x_46re, x_46im)
    real(8), intent (in) :: x_46re
    real(8), intent (in) :: x_46im
    code = (((x_46re * x_46re) - (x_46im * x_46im)) * x_46im) + (((x_46re * x_46im) + (x_46im * x_46re)) * x_46re)
end function

Java

public static double code(double x_46_re, double x_46_im) {
	return (((x_46_re * x_46_re) - (x_46_im * x_46_im)) * x_46_im) + (((x_46_re * x_46_im) + (x_46_im * x_46_re)) * x_46_re);
}

Python

def code(x_46_re, x_46_im):
	return (((x_46_re * x_46_re) - (x_46_im * x_46_im)) * x_46_im) + (((x_46_re * x_46_im) + (x_46_im * x_46_re)) * x_46_re)

Julia

function code(x_46_re, x_46_im)
	return Float64(Float64(Float64(Float64(x_46_re * x_46_re) - Float64(x_46_im * x_46_im)) * x_46_im) + Float64(Float64(Float64(x_46_re * x_46_im) + Float64(x_46_im * x_46_re)) * x_46_re))
end

MATLAB

function tmp = code(x_46_re, x_46_im)
	tmp = (((x_46_re * x_46_re) - (x_46_im * x_46_im)) * x_46_im) + (((x_46_re * x_46_im) + (x_46_im * x_46_re)) * x_46_re);
end

Wolfram

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

Initial Program: 82.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \end{array} \]

FPCore

(FPCore (x.re x.im)
 :precision binary64
 (+
  (* (- (* x.re x.re) (* x.im x.im)) x.im)
  (* (+ (* x.re x.im) (* x.im x.re)) x.re)))

C

double code(double x_46_re, double x_46_im) {
	return (((x_46_re * x_46_re) - (x_46_im * x_46_im)) * x_46_im) + (((x_46_re * x_46_im) + (x_46_im * x_46_re)) * x_46_re);
}

Fortran

real(8) function code(x_46re, x_46im)
    real(8), intent (in) :: x_46re
    real(8), intent (in) :: x_46im
    code = (((x_46re * x_46re) - (x_46im * x_46im)) * x_46im) + (((x_46re * x_46im) + (x_46im * x_46re)) * x_46re)
end function

Java

public static double code(double x_46_re, double x_46_im) {
	return (((x_46_re * x_46_re) - (x_46_im * x_46_im)) * x_46_im) + (((x_46_re * x_46_im) + (x_46_im * x_46_re)) * x_46_re);
}

Python

def code(x_46_re, x_46_im):
	return (((x_46_re * x_46_re) - (x_46_im * x_46_im)) * x_46_im) + (((x_46_re * x_46_im) + (x_46_im * x_46_re)) * x_46_re)

Julia

function code(x_46_re, x_46_im)
	return Float64(Float64(Float64(Float64(x_46_re * x_46_re) - Float64(x_46_im * x_46_im)) * x_46_im) + Float64(Float64(Float64(x_46_re * x_46_im) + Float64(x_46_im * x_46_re)) * x_46_re))
end

MATLAB

function tmp = code(x_46_re, x_46_im)
	tmp = (((x_46_re * x_46_re) - (x_46_im * x_46_im)) * x_46_im) + (((x_46_re * x_46_im) + (x_46_im * x_46_re)) * x_46_re);
end

Wolfram

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

Alternative 1: 99.8% accurate, 0.2× speedup

Math

\[\begin{array}{l} x.im\_m = \left|x.im\right| \\ x.im\_s = \mathsf{copysign}\left(1, x.im\right) \\ x.im\_s \cdot \begin{array}{l} \mathbf{if}\;x.im\_m \leq 1.2 \cdot 10^{+98}:\\ \;\;\;\;\left(x.re \cdot \left(x.im\_m \cdot x.re\right)\right) \cdot 3 - {x.im\_m}^{3}\\ \mathbf{else}:\\ \;\;\;\;x.im\_m \cdot \left(\left(x.re - x.im\_m\right) \cdot \left(x.im\_m + x.re\right)\right) + -3\\ \end{array} \end{array} \]

FPCore

x.im\_m = (fabs.f64 x.im)
x.im\_s = (copysign.f64 #s(literal 1 binary64) x.im)
(FPCore (x.im_s x.re x.im_m)
 :precision binary64
 (*
  x.im_s
  (if (<= x.im_m 1.2e+98)
    (- (* (* x.re (* x.im_m x.re)) 3.0) (pow x.im_m 3.0))
    (+ (* x.im_m (* (- x.re x.im_m) (+ x.im_m x.re))) -3.0))))

C

x.im\_m = fabs(x_46_im);
x.im\_s = copysign(1.0, x_46_im);
double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	double tmp;
	if (x_46_im_m <= 1.2e+98) {
		tmp = ((x_46_re * (x_46_im_m * x_46_re)) * 3.0) - pow(x_46_im_m, 3.0);
	} else {
		tmp = (x_46_im_m * ((x_46_re - x_46_im_m) * (x_46_im_m + x_46_re))) + -3.0;
	}
	return x_46_im_s * tmp;
}

Fortran

x.im\_m = abs(x_46im)
x.im\_s = copysign(1.0d0, x_46im)
real(8) function code(x_46im_s, x_46re, x_46im_m)
    real(8), intent (in) :: x_46im_s
    real(8), intent (in) :: x_46re
    real(8), intent (in) :: x_46im_m
    real(8) :: tmp
    if (x_46im_m <= 1.2d+98) then
        tmp = ((x_46re * (x_46im_m * x_46re)) * 3.0d0) - (x_46im_m ** 3.0d0)
    else
        tmp = (x_46im_m * ((x_46re - x_46im_m) * (x_46im_m + x_46re))) + (-3.0d0)
    end if
    code = x_46im_s * tmp
end function

Java

x.im\_m = Math.abs(x_46_im);
x.im\_s = Math.copySign(1.0, x_46_im);
public static double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	double tmp;
	if (x_46_im_m <= 1.2e+98) {
		tmp = ((x_46_re * (x_46_im_m * x_46_re)) * 3.0) - Math.pow(x_46_im_m, 3.0);
	} else {
		tmp = (x_46_im_m * ((x_46_re - x_46_im_m) * (x_46_im_m + x_46_re))) + -3.0;
	}
	return x_46_im_s * tmp;
}

Python

x.im\_m = math.fabs(x_46_im)
x.im\_s = math.copysign(1.0, x_46_im)
def code(x_46_im_s, x_46_re, x_46_im_m):
	tmp = 0
	if x_46_im_m <= 1.2e+98:
		tmp = ((x_46_re * (x_46_im_m * x_46_re)) * 3.0) - math.pow(x_46_im_m, 3.0)
	else:
		tmp = (x_46_im_m * ((x_46_re - x_46_im_m) * (x_46_im_m + x_46_re))) + -3.0
	return x_46_im_s * tmp

Julia

x.im\_m = abs(x_46_im)
x.im\_s = copysign(1.0, x_46_im)
function code(x_46_im_s, x_46_re, x_46_im_m)
	tmp = 0.0
	if (x_46_im_m <= 1.2e+98)
		tmp = Float64(Float64(Float64(x_46_re * Float64(x_46_im_m * x_46_re)) * 3.0) - (x_46_im_m ^ 3.0));
	else
		tmp = Float64(Float64(x_46_im_m * Float64(Float64(x_46_re - x_46_im_m) * Float64(x_46_im_m + x_46_re))) + -3.0);
	end
	return Float64(x_46_im_s * tmp)
end

MATLAB

x.im\_m = abs(x_46_im);
x.im\_s = sign(x_46_im) * abs(1.0);
function tmp_2 = code(x_46_im_s, x_46_re, x_46_im_m)
	tmp = 0.0;
	if (x_46_im_m <= 1.2e+98)
		tmp = ((x_46_re * (x_46_im_m * x_46_re)) * 3.0) - (x_46_im_m ^ 3.0);
	else
		tmp = (x_46_im_m * ((x_46_re - x_46_im_m) * (x_46_im_m + x_46_re))) + -3.0;
	end
	tmp_2 = x_46_im_s * tmp;
end

Wolfram

x.im\_m = N[Abs[x$46$im], $MachinePrecision]
x.im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x$46$im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$46$im$95$s_, x$46$re_, x$46$im$95$m_] := N[(x$46$im$95$s * If[LessEqual[x$46$im$95$m, 1.2e+98], N[(N[(N[(x$46$re * N[(x$46$im$95$m * x$46$re), $MachinePrecision]), $MachinePrecision] * 3.0), $MachinePrecision] - N[Power[x$46$im$95$m, 3.0], $MachinePrecision]), $MachinePrecision], N[(N[(x$46$im$95$m * N[(N[(x$46$re - x$46$im$95$m), $MachinePrecision] * N[(x$46$im$95$m + x$46$re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -3.0), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x.im < 1.1999999999999999e98

   1. Initial program 82.1%

      \[\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]

   3. Simplified 89.5%

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

   if 1.1999999999999999e98 < x.im

   1. Initial program 62.8%

      \[\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]
   2. Add Preprocessing

   3. Taylor expanded in x.re around 0 62.8%

      \[\leadsto \left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \color{blue}{2 \cdot \left(x.im \cdot {x.re}^{2}\right)} \]

   5. Simplified 79.1%

      \[\leadsto \left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \color{blue}{-3} \]
   6. Step-by-step derivation

      1. difference-of-squares 100.0%

         \[\leadsto \color{blue}{\left(\left(x.re + x.im\right) \cdot \left(x.re - x.im\right)\right)} \cdot x.im + -3 \]

      2. *-commutative 100.0%

         \[\leadsto \color{blue}{\left(\left(x.re - x.im\right) \cdot \left(x.re + x.im\right)\right)} \cdot x.im + -3 \]

   7. Applied egg-rr 100.0%

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

4. Final simplification 91.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x.im \leq 1.2 \cdot 10^{+98}:\\ \;\;\;\;\left(x.re \cdot \left(x.im \cdot x.re\right)\right) \cdot 3 - {x.im}^{3}\\ \mathbf{else}:\\ \;\;\;\;x.im \cdot \left(\left(x.re - x.im\right) \cdot \left(x.im + x.re\right)\right) + -3\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 99.8% accurate, 0.2× speedup

Math

\[\begin{array}{l} x.im\_m = \left|x.im\right| \\ x.im\_s = \mathsf{copysign}\left(1, x.im\right) \\ x.im\_s \cdot \begin{array}{l} \mathbf{if}\;x.im\_m \leq 1.2 \cdot 10^{+98}:\\ \;\;\;\;x.re \cdot \left(3 \cdot \left(x.im\_m \cdot x.re\right)\right) - {x.im\_m}^{3}\\ \mathbf{else}:\\ \;\;\;\;x.im\_m \cdot \left(\left(x.re - x.im\_m\right) \cdot \left(x.im\_m + x.re\right)\right) + -3\\ \end{array} \end{array} \]

FPCore

x.im\_m = (fabs.f64 x.im)
x.im\_s = (copysign.f64 #s(literal 1 binary64) x.im)
(FPCore (x.im_s x.re x.im_m)
 :precision binary64
 (*
  x.im_s
  (if (<= x.im_m 1.2e+98)
    (- (* x.re (* 3.0 (* x.im_m x.re))) (pow x.im_m 3.0))
    (+ (* x.im_m (* (- x.re x.im_m) (+ x.im_m x.re))) -3.0))))

C

x.im\_m = fabs(x_46_im);
x.im\_s = copysign(1.0, x_46_im);
double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	double tmp;
	if (x_46_im_m <= 1.2e+98) {
		tmp = (x_46_re * (3.0 * (x_46_im_m * x_46_re))) - pow(x_46_im_m, 3.0);
	} else {
		tmp = (x_46_im_m * ((x_46_re - x_46_im_m) * (x_46_im_m + x_46_re))) + -3.0;
	}
	return x_46_im_s * tmp;
}

Fortran

x.im\_m = abs(x_46im)
x.im\_s = copysign(1.0d0, x_46im)
real(8) function code(x_46im_s, x_46re, x_46im_m)
    real(8), intent (in) :: x_46im_s
    real(8), intent (in) :: x_46re
    real(8), intent (in) :: x_46im_m
    real(8) :: tmp
    if (x_46im_m <= 1.2d+98) then
        tmp = (x_46re * (3.0d0 * (x_46im_m * x_46re))) - (x_46im_m ** 3.0d0)
    else
        tmp = (x_46im_m * ((x_46re - x_46im_m) * (x_46im_m + x_46re))) + (-3.0d0)
    end if
    code = x_46im_s * tmp
end function

Java

x.im\_m = Math.abs(x_46_im);
x.im\_s = Math.copySign(1.0, x_46_im);
public static double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	double tmp;
	if (x_46_im_m <= 1.2e+98) {
		tmp = (x_46_re * (3.0 * (x_46_im_m * x_46_re))) - Math.pow(x_46_im_m, 3.0);
	} else {
		tmp = (x_46_im_m * ((x_46_re - x_46_im_m) * (x_46_im_m + x_46_re))) + -3.0;
	}
	return x_46_im_s * tmp;
}

Python

x.im\_m = math.fabs(x_46_im)
x.im\_s = math.copysign(1.0, x_46_im)
def code(x_46_im_s, x_46_re, x_46_im_m):
	tmp = 0
	if x_46_im_m <= 1.2e+98:
		tmp = (x_46_re * (3.0 * (x_46_im_m * x_46_re))) - math.pow(x_46_im_m, 3.0)
	else:
		tmp = (x_46_im_m * ((x_46_re - x_46_im_m) * (x_46_im_m + x_46_re))) + -3.0
	return x_46_im_s * tmp

Julia

x.im\_m = abs(x_46_im)
x.im\_s = copysign(1.0, x_46_im)
function code(x_46_im_s, x_46_re, x_46_im_m)
	tmp = 0.0
	if (x_46_im_m <= 1.2e+98)
		tmp = Float64(Float64(x_46_re * Float64(3.0 * Float64(x_46_im_m * x_46_re))) - (x_46_im_m ^ 3.0));
	else
		tmp = Float64(Float64(x_46_im_m * Float64(Float64(x_46_re - x_46_im_m) * Float64(x_46_im_m + x_46_re))) + -3.0);
	end
	return Float64(x_46_im_s * tmp)
end

MATLAB

x.im\_m = abs(x_46_im);
x.im\_s = sign(x_46_im) * abs(1.0);
function tmp_2 = code(x_46_im_s, x_46_re, x_46_im_m)
	tmp = 0.0;
	if (x_46_im_m <= 1.2e+98)
		tmp = (x_46_re * (3.0 * (x_46_im_m * x_46_re))) - (x_46_im_m ^ 3.0);
	else
		tmp = (x_46_im_m * ((x_46_re - x_46_im_m) * (x_46_im_m + x_46_re))) + -3.0;
	end
	tmp_2 = x_46_im_s * tmp;
end

Wolfram

x.im\_m = N[Abs[x$46$im], $MachinePrecision]
x.im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x$46$im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$46$im$95$s_, x$46$re_, x$46$im$95$m_] := N[(x$46$im$95$s * If[LessEqual[x$46$im$95$m, 1.2e+98], N[(N[(x$46$re * N[(3.0 * N[(x$46$im$95$m * x$46$re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[Power[x$46$im$95$m, 3.0], $MachinePrecision]), $MachinePrecision], N[(N[(x$46$im$95$m * N[(N[(x$46$re - x$46$im$95$m), $MachinePrecision] * N[(x$46$im$95$m + x$46$re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -3.0), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x.im < 1.1999999999999999e98

   1. Initial program 82.1%

      \[\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]

   3. Simplified 89.5%

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

   5. Taylor expanded in x.re around 0 89.5%

      \[\leadsto x.re \cdot \color{blue}{\left(3 \cdot \left(x.im \cdot x.re\right)\right)} - {x.im}^{3} \]

   if 1.1999999999999999e98 < x.im

   1. Initial program 62.8%

      \[\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]
   2. Add Preprocessing

   3. Taylor expanded in x.re around 0 62.8%

      \[\leadsto \left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \color{blue}{2 \cdot \left(x.im \cdot {x.re}^{2}\right)} \]

   5. Simplified 79.1%

      \[\leadsto \left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \color{blue}{-3} \]
   6. Step-by-step derivation

      1. difference-of-squares 100.0%

         \[\leadsto \color{blue}{\left(\left(x.re + x.im\right) \cdot \left(x.re - x.im\right)\right)} \cdot x.im + -3 \]

      2. *-commutative 100.0%

         \[\leadsto \color{blue}{\left(\left(x.re - x.im\right) \cdot \left(x.re + x.im\right)\right)} \cdot x.im + -3 \]

   7. Applied egg-rr 100.0%

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

4. Final simplification 91.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x.im \leq 1.2 \cdot 10^{+98}:\\ \;\;\;\;x.re \cdot \left(3 \cdot \left(x.im \cdot x.re\right)\right) - {x.im}^{3}\\ \mathbf{else}:\\ \;\;\;\;x.im \cdot \left(\left(x.re - x.im\right) \cdot \left(x.im + x.re\right)\right) + -3\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 99.8% accurate, 0.3× speedup

Math

\[\begin{array}{l} x.im\_m = \left|x.im\right| \\ x.im\_s = \mathsf{copysign}\left(1, x.im\right) \\ \begin{array}{l} t_0 := x.im\_m \cdot \left(\left(x.re - x.im\_m\right) \cdot \left(x.im\_m + x.re\right)\right)\\ t_1 := x.im\_m \cdot \left(x.re \cdot x.re - x.im\_m \cdot x.im\_m\right) + x.re \cdot \left(x.im\_m \cdot x.re + x.im\_m \cdot x.re\right)\\ t_2 := x.re \cdot \left(\left(x.im\_m \cdot x.re\right) \cdot 2\right)\\ x.im\_s \cdot \begin{array}{l} \mathbf{if}\;t\_1 \leq 5 \cdot 10^{+305}:\\ \;\;\;\;t\_0 + t\_2\\ \mathbf{elif}\;t\_1 \leq \infty:\\ \;\;\;\;t\_2 + \left(x.im\_m + x.re\right) \cdot \left(x.im\_m \cdot x.re\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0 + -3\\ \end{array} \end{array} \end{array} \]

FPCore

x.im\_m = (fabs.f64 x.im)
x.im\_s = (copysign.f64 #s(literal 1 binary64) x.im)
(FPCore (x.im_s x.re x.im_m)
 :precision binary64
 (let* ((t_0 (* x.im_m (* (- x.re x.im_m) (+ x.im_m x.re))))
        (t_1
         (+
          (* x.im_m (- (* x.re x.re) (* x.im_m x.im_m)))
          (* x.re (+ (* x.im_m x.re) (* x.im_m x.re)))))
        (t_2 (* x.re (* (* x.im_m x.re) 2.0))))
   (*
    x.im_s
    (if (<= t_1 5e+305)
      (+ t_0 t_2)
      (if (<= t_1 INFINITY)
        (+ t_2 (* (+ x.im_m x.re) (* x.im_m x.re)))
        (+ t_0 -3.0))))))

C

x.im\_m = fabs(x_46_im);
x.im\_s = copysign(1.0, x_46_im);
double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	double t_0 = x_46_im_m * ((x_46_re - x_46_im_m) * (x_46_im_m + x_46_re));
	double t_1 = (x_46_im_m * ((x_46_re * x_46_re) - (x_46_im_m * x_46_im_m))) + (x_46_re * ((x_46_im_m * x_46_re) + (x_46_im_m * x_46_re)));
	double t_2 = x_46_re * ((x_46_im_m * x_46_re) * 2.0);
	double tmp;
	if (t_1 <= 5e+305) {
		tmp = t_0 + t_2;
	} else if (t_1 <= ((double) INFINITY)) {
		tmp = t_2 + ((x_46_im_m + x_46_re) * (x_46_im_m * x_46_re));
	} else {
		tmp = t_0 + -3.0;
	}
	return x_46_im_s * tmp;
}

Java

x.im\_m = Math.abs(x_46_im);
x.im\_s = Math.copySign(1.0, x_46_im);
public static double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	double t_0 = x_46_im_m * ((x_46_re - x_46_im_m) * (x_46_im_m + x_46_re));
	double t_1 = (x_46_im_m * ((x_46_re * x_46_re) - (x_46_im_m * x_46_im_m))) + (x_46_re * ((x_46_im_m * x_46_re) + (x_46_im_m * x_46_re)));
	double t_2 = x_46_re * ((x_46_im_m * x_46_re) * 2.0);
	double tmp;
	if (t_1 <= 5e+305) {
		tmp = t_0 + t_2;
	} else if (t_1 <= Double.POSITIVE_INFINITY) {
		tmp = t_2 + ((x_46_im_m + x_46_re) * (x_46_im_m * x_46_re));
	} else {
		tmp = t_0 + -3.0;
	}
	return x_46_im_s * tmp;
}

Python

x.im\_m = math.fabs(x_46_im)
x.im\_s = math.copysign(1.0, x_46_im)
def code(x_46_im_s, x_46_re, x_46_im_m):
	t_0 = x_46_im_m * ((x_46_re - x_46_im_m) * (x_46_im_m + x_46_re))
	t_1 = (x_46_im_m * ((x_46_re * x_46_re) - (x_46_im_m * x_46_im_m))) + (x_46_re * ((x_46_im_m * x_46_re) + (x_46_im_m * x_46_re)))
	t_2 = x_46_re * ((x_46_im_m * x_46_re) * 2.0)
	tmp = 0
	if t_1 <= 5e+305:
		tmp = t_0 + t_2
	elif t_1 <= math.inf:
		tmp = t_2 + ((x_46_im_m + x_46_re) * (x_46_im_m * x_46_re))
	else:
		tmp = t_0 + -3.0
	return x_46_im_s * tmp

Julia

x.im\_m = abs(x_46_im)
x.im\_s = copysign(1.0, x_46_im)
function code(x_46_im_s, x_46_re, x_46_im_m)
	t_0 = Float64(x_46_im_m * Float64(Float64(x_46_re - x_46_im_m) * Float64(x_46_im_m + x_46_re)))
	t_1 = Float64(Float64(x_46_im_m * Float64(Float64(x_46_re * x_46_re) - Float64(x_46_im_m * x_46_im_m))) + Float64(x_46_re * Float64(Float64(x_46_im_m * x_46_re) + Float64(x_46_im_m * x_46_re))))
	t_2 = Float64(x_46_re * Float64(Float64(x_46_im_m * x_46_re) * 2.0))
	tmp = 0.0
	if (t_1 <= 5e+305)
		tmp = Float64(t_0 + t_2);
	elseif (t_1 <= Inf)
		tmp = Float64(t_2 + Float64(Float64(x_46_im_m + x_46_re) * Float64(x_46_im_m * x_46_re)));
	else
		tmp = Float64(t_0 + -3.0);
	end
	return Float64(x_46_im_s * tmp)
end

MATLAB

x.im\_m = abs(x_46_im);
x.im\_s = sign(x_46_im) * abs(1.0);
function tmp_2 = code(x_46_im_s, x_46_re, x_46_im_m)
	t_0 = x_46_im_m * ((x_46_re - x_46_im_m) * (x_46_im_m + x_46_re));
	t_1 = (x_46_im_m * ((x_46_re * x_46_re) - (x_46_im_m * x_46_im_m))) + (x_46_re * ((x_46_im_m * x_46_re) + (x_46_im_m * x_46_re)));
	t_2 = x_46_re * ((x_46_im_m * x_46_re) * 2.0);
	tmp = 0.0;
	if (t_1 <= 5e+305)
		tmp = t_0 + t_2;
	elseif (t_1 <= Inf)
		tmp = t_2 + ((x_46_im_m + x_46_re) * (x_46_im_m * x_46_re));
	else
		tmp = t_0 + -3.0;
	end
	tmp_2 = x_46_im_s * tmp;
end

Wolfram

x.im\_m = N[Abs[x$46$im], $MachinePrecision]
x.im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x$46$im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$46$im$95$s_, x$46$re_, x$46$im$95$m_] := Block[{t$95$0 = N[(x$46$im$95$m * N[(N[(x$46$re - x$46$im$95$m), $MachinePrecision] * N[(x$46$im$95$m + x$46$re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x$46$im$95$m * N[(N[(x$46$re * x$46$re), $MachinePrecision] - N[(x$46$im$95$m * x$46$im$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(x$46$re * N[(N[(x$46$im$95$m * x$46$re), $MachinePrecision] + N[(x$46$im$95$m * x$46$re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(x$46$re * N[(N[(x$46$im$95$m * x$46$re), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]}, N[(x$46$im$95$s * If[LessEqual[t$95$1, 5e+305], N[(t$95$0 + t$95$2), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(t$95$2 + N[(N[(x$46$im$95$m + x$46$re), $MachinePrecision] * N[(x$46$im$95$m * x$46$re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 + -3.0), $MachinePrecision]]]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (+.f64 (*.f64 (-.f64 (*.f64 x.re x.re) (*.f64 x.im x.im)) x.im) (*.f64 (+.f64 (*.f64 x.re x.im) (*.f64 x.im x.re)) x.re)) < 5.00000000000000009e305

   1. Initial program 95.0%

      \[\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. difference-of-squares 37.2%

         \[\leadsto \color{blue}{\left(\left(x.re + x.im\right) \cdot \left(x.re - x.im\right)\right)} \cdot x.im + -3 \]

      2. *-commutative 37.2%

         \[\leadsto \color{blue}{\left(\left(x.re - x.im\right) \cdot \left(x.re + x.im\right)\right)} \cdot x.im + -3 \]

   4. Applied egg-rr 95.0%

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

      1. *-commutative 95.0%

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

      2. count-2 95.0%

         \[\leadsto \left(\left(x.re - x.im\right) \cdot \left(x.re + x.im\right)\right) \cdot x.im + \color{blue}{\left(2 \cdot \left(x.re \cdot x.im\right)\right)} \cdot x.re \]

      3. *-commutative 95.0%

         \[\leadsto \left(\left(x.re - x.im\right) \cdot \left(x.re + x.im\right)\right) \cdot x.im + \color{blue}{\left(\left(x.re \cdot x.im\right) \cdot 2\right)} \cdot x.re \]

   6. Applied egg-rr 95.0%

      \[\leadsto \left(\left(x.re - x.im\right) \cdot \left(x.re + x.im\right)\right) \cdot x.im + \color{blue}{\left(\left(x.re \cdot x.im\right) \cdot 2\right)} \cdot x.re \]

   if 5.00000000000000009e305 < (+.f64 (*.f64 (-.f64 (*.f64 x.re x.re) (*.f64 x.im x.im)) x.im) (*.f64 (+.f64 (*.f64 x.re x.im) (*.f64 x.im x.re)) x.re)) < +inf.0

   1. Initial program 77.3%

      \[\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. difference-of-squares 77.3%

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

   4. Applied egg-rr 77.3%

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

   6. Simplified 38.3%

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

      1. pow1 38.3%

         \[\leadsto \color{blue}{{\left(\left(\left(x.im + x.re\right) \cdot \left(x.re + -3\right)\right) \cdot x.im\right)}^{1}} + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]

      2. associate-*l* 60.8%

         \[\leadsto {\color{blue}{\left(\left(x.im + x.re\right) \cdot \left(\left(x.re + -3\right) \cdot x.im\right)\right)}}^{1} + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]

      3. *-commutative 60.8%

         \[\leadsto {\left(\left(x.im + x.re\right) \cdot \color{blue}{\left(x.im \cdot \left(x.re + -3\right)\right)}\right)}^{1} + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]

   8. Applied egg-rr 60.8%

      \[\leadsto \color{blue}{{\left(\left(x.im + x.re\right) \cdot \left(x.im \cdot \left(x.re + -3\right)\right)\right)}^{1}} + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]

   10. Simplified 60.8%

       \[\leadsto \color{blue}{\left(x.im + x.re\right) \cdot \left(x.im \cdot \left(x.re + -3\right)\right)} + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]

   11. Taylor expanded in x.re around inf 66.5%

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

       1. *-commutative 77.3%

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

       2. count-2 77.3%

          \[\leadsto \left(\left(x.re - x.im\right) \cdot \left(x.re + x.im\right)\right) \cdot x.im + \color{blue}{\left(2 \cdot \left(x.re \cdot x.im\right)\right)} \cdot x.re \]

       3. *-commutative 77.3%

          \[\leadsto \left(\left(x.re - x.im\right) \cdot \left(x.re + x.im\right)\right) \cdot x.im + \color{blue}{\left(\left(x.re \cdot x.im\right) \cdot 2\right)} \cdot x.re \]

   13. Applied egg-rr 66.5%

       \[\leadsto \left(x.im + x.re\right) \cdot \left(x.im \cdot x.re\right) + \color{blue}{\left(\left(x.re \cdot x.im\right) \cdot 2\right)} \cdot x.re \]

   if +inf.0 < (+.f64 (*.f64 (-.f64 (*.f64 x.re x.re) (*.f64 x.im x.im)) x.im) (*.f64 (+.f64 (*.f64 x.re x.im) (*.f64 x.im x.re)) x.re))

   1. Initial program 0.0%

      \[\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]
   2. Add Preprocessing

   3. Taylor expanded in x.re around 0 0.0%

      \[\leadsto \left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \color{blue}{2 \cdot \left(x.im \cdot {x.re}^{2}\right)} \]

   5. Simplified 50.0%

      \[\leadsto \left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \color{blue}{-3} \]
   6. Step-by-step derivation

      1. difference-of-squares 100.0%

         \[\leadsto \color{blue}{\left(\left(x.re + x.im\right) \cdot \left(x.re - x.im\right)\right)} \cdot x.im + -3 \]

      2. *-commutative 100.0%

         \[\leadsto \color{blue}{\left(\left(x.re - x.im\right) \cdot \left(x.re + x.im\right)\right)} \cdot x.im + -3 \]

   7. Applied egg-rr 100.0%

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

4. Final simplification 91.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x.im \cdot \left(x.re \cdot x.re - x.im \cdot x.im\right) + x.re \cdot \left(x.im \cdot x.re + x.im \cdot x.re\right) \leq 5 \cdot 10^{+305}:\\ \;\;\;\;x.im \cdot \left(\left(x.re - x.im\right) \cdot \left(x.im + x.re\right)\right) + x.re \cdot \left(\left(x.im \cdot x.re\right) \cdot 2\right)\\ \mathbf{elif}\;x.im \cdot \left(x.re \cdot x.re - x.im \cdot x.im\right) + x.re \cdot \left(x.im \cdot x.re + x.im \cdot x.re\right) \leq \infty:\\ \;\;\;\;x.re \cdot \left(\left(x.im \cdot x.re\right) \cdot 2\right) + \left(x.im + x.re\right) \cdot \left(x.im \cdot x.re\right)\\ \mathbf{else}:\\ \;\;\;\;x.im \cdot \left(\left(x.re - x.im\right) \cdot \left(x.im + x.re\right)\right) + -3\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 91.9% accurate, 0.9× speedup

Math

\[\begin{array}{l} x.im\_m = \left|x.im\right| \\ x.im\_s = \mathsf{copysign}\left(1, x.im\right) \\ x.im\_s \cdot \begin{array}{l} \mathbf{if}\;x.im\_m \leq 1.2 \cdot 10^{-62}:\\ \;\;\;\;x.re \cdot \left(\left(x.im\_m \cdot x.re\right) \cdot 2\right) + \left(x.im\_m + x.re\right) \cdot \left(x.im\_m \cdot x.re\right)\\ \mathbf{else}:\\ \;\;\;\;x.im\_m \cdot \left(\left(x.re - x.im\_m\right) \cdot \left(x.im\_m + x.re\right)\right) - x.re\\ \end{array} \end{array} \]

FPCore

x.im\_m = (fabs.f64 x.im)
x.im\_s = (copysign.f64 #s(literal 1 binary64) x.im)
(FPCore (x.im_s x.re x.im_m)
 :precision binary64
 (*
  x.im_s
  (if (<= x.im_m 1.2e-62)
    (+ (* x.re (* (* x.im_m x.re) 2.0)) (* (+ x.im_m x.re) (* x.im_m x.re)))
    (- (* x.im_m (* (- x.re x.im_m) (+ x.im_m x.re))) x.re))))

C

x.im\_m = fabs(x_46_im);
x.im\_s = copysign(1.0, x_46_im);
double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	double tmp;
	if (x_46_im_m <= 1.2e-62) {
		tmp = (x_46_re * ((x_46_im_m * x_46_re) * 2.0)) + ((x_46_im_m + x_46_re) * (x_46_im_m * x_46_re));
	} else {
		tmp = (x_46_im_m * ((x_46_re - x_46_im_m) * (x_46_im_m + x_46_re))) - x_46_re;
	}
	return x_46_im_s * tmp;
}

Fortran

x.im\_m = abs(x_46im)
x.im\_s = copysign(1.0d0, x_46im)
real(8) function code(x_46im_s, x_46re, x_46im_m)
    real(8), intent (in) :: x_46im_s
    real(8), intent (in) :: x_46re
    real(8), intent (in) :: x_46im_m
    real(8) :: tmp
    if (x_46im_m <= 1.2d-62) then
        tmp = (x_46re * ((x_46im_m * x_46re) * 2.0d0)) + ((x_46im_m + x_46re) * (x_46im_m * x_46re))
    else
        tmp = (x_46im_m * ((x_46re - x_46im_m) * (x_46im_m + x_46re))) - x_46re
    end if
    code = x_46im_s * tmp
end function

Java

x.im\_m = Math.abs(x_46_im);
x.im\_s = Math.copySign(1.0, x_46_im);
public static double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	double tmp;
	if (x_46_im_m <= 1.2e-62) {
		tmp = (x_46_re * ((x_46_im_m * x_46_re) * 2.0)) + ((x_46_im_m + x_46_re) * (x_46_im_m * x_46_re));
	} else {
		tmp = (x_46_im_m * ((x_46_re - x_46_im_m) * (x_46_im_m + x_46_re))) - x_46_re;
	}
	return x_46_im_s * tmp;
}

Python

x.im\_m = math.fabs(x_46_im)
x.im\_s = math.copysign(1.0, x_46_im)
def code(x_46_im_s, x_46_re, x_46_im_m):
	tmp = 0
	if x_46_im_m <= 1.2e-62:
		tmp = (x_46_re * ((x_46_im_m * x_46_re) * 2.0)) + ((x_46_im_m + x_46_re) * (x_46_im_m * x_46_re))
	else:
		tmp = (x_46_im_m * ((x_46_re - x_46_im_m) * (x_46_im_m + x_46_re))) - x_46_re
	return x_46_im_s * tmp

Julia

x.im\_m = abs(x_46_im)
x.im\_s = copysign(1.0, x_46_im)
function code(x_46_im_s, x_46_re, x_46_im_m)
	tmp = 0.0
	if (x_46_im_m <= 1.2e-62)
		tmp = Float64(Float64(x_46_re * Float64(Float64(x_46_im_m * x_46_re) * 2.0)) + Float64(Float64(x_46_im_m + x_46_re) * Float64(x_46_im_m * x_46_re)));
	else
		tmp = Float64(Float64(x_46_im_m * Float64(Float64(x_46_re - x_46_im_m) * Float64(x_46_im_m + x_46_re))) - x_46_re);
	end
	return Float64(x_46_im_s * tmp)
end

MATLAB

x.im\_m = abs(x_46_im);
x.im\_s = sign(x_46_im) * abs(1.0);
function tmp_2 = code(x_46_im_s, x_46_re, x_46_im_m)
	tmp = 0.0;
	if (x_46_im_m <= 1.2e-62)
		tmp = (x_46_re * ((x_46_im_m * x_46_re) * 2.0)) + ((x_46_im_m + x_46_re) * (x_46_im_m * x_46_re));
	else
		tmp = (x_46_im_m * ((x_46_re - x_46_im_m) * (x_46_im_m + x_46_re))) - x_46_re;
	end
	tmp_2 = x_46_im_s * tmp;
end

Wolfram

x.im\_m = N[Abs[x$46$im], $MachinePrecision]
x.im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x$46$im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$46$im$95$s_, x$46$re_, x$46$im$95$m_] := N[(x$46$im$95$s * If[LessEqual[x$46$im$95$m, 1.2e-62], N[(N[(x$46$re * N[(N[(x$46$im$95$m * x$46$re), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision] + N[(N[(x$46$im$95$m + x$46$re), $MachinePrecision] * N[(x$46$im$95$m * x$46$re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x$46$im$95$m * N[(N[(x$46$re - x$46$im$95$m), $MachinePrecision] * N[(x$46$im$95$m + x$46$re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - x$46$re), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x.im < 1.19999999999999992e-62

   1. Initial program 79.0%

      \[\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. difference-of-squares 80.1%

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

   4. Applied egg-rr 80.1%

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

   6. Simplified 41.0%

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

      1. pow1 41.0%

         \[\leadsto \color{blue}{{\left(\left(\left(x.im + x.re\right) \cdot \left(x.re + -3\right)\right) \cdot x.im\right)}^{1}} + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]

      2. associate-*l* 50.7%

         \[\leadsto {\color{blue}{\left(\left(x.im + x.re\right) \cdot \left(\left(x.re + -3\right) \cdot x.im\right)\right)}}^{1} + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]

      3. *-commutative 50.7%

         \[\leadsto {\left(\left(x.im + x.re\right) \cdot \color{blue}{\left(x.im \cdot \left(x.re + -3\right)\right)}\right)}^{1} + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]

   8. Applied egg-rr 50.7%

      \[\leadsto \color{blue}{{\left(\left(x.im + x.re\right) \cdot \left(x.im \cdot \left(x.re + -3\right)\right)\right)}^{1}} + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]

   10. Simplified 50.7%

       \[\leadsto \color{blue}{\left(x.im + x.re\right) \cdot \left(x.im \cdot \left(x.re + -3\right)\right)} + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]

   11. Taylor expanded in x.re around inf 70.0%

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

       1. *-commutative 80.1%

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

       2. count-2 80.1%

          \[\leadsto \left(\left(x.re - x.im\right) \cdot \left(x.re + x.im\right)\right) \cdot x.im + \color{blue}{\left(2 \cdot \left(x.re \cdot x.im\right)\right)} \cdot x.re \]

       3. *-commutative 80.1%

          \[\leadsto \left(\left(x.re - x.im\right) \cdot \left(x.re + x.im\right)\right) \cdot x.im + \color{blue}{\left(\left(x.re \cdot x.im\right) \cdot 2\right)} \cdot x.re \]

   13. Applied egg-rr 70.0%

       \[\leadsto \left(x.im + x.re\right) \cdot \left(x.im \cdot x.re\right) + \color{blue}{\left(\left(x.re \cdot x.im\right) \cdot 2\right)} \cdot x.re \]

   if 1.19999999999999992e-62 < x.im

   1. Initial program 78.4%

      \[\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. difference-of-squares 86.0%

         \[\leadsto \color{blue}{\left(\left(x.re + x.im\right) \cdot \left(x.re - x.im\right)\right)} \cdot x.im + -3 \]

      2. *-commutative 86.0%

         \[\leadsto \color{blue}{\left(\left(x.re - x.im\right) \cdot \left(x.re + x.im\right)\right)} \cdot x.im + -3 \]

   4. Applied egg-rr 83.8%

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

      1. *-commutative 83.8%

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

      2. count-2 83.8%

         \[\leadsto \left(\left(x.re - x.im\right) \cdot \left(x.re + x.im\right)\right) \cdot x.im + \color{blue}{\left(2 \cdot \left(x.re \cdot x.im\right)\right)} \cdot x.re \]

      3. *-commutative 83.8%

         \[\leadsto \left(\left(x.re - x.im\right) \cdot \left(x.re + x.im\right)\right) \cdot x.im + \color{blue}{\left(\left(x.re \cdot x.im\right) \cdot 2\right)} \cdot x.re \]

   6. Applied egg-rr 83.8%

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

      1. pow1 83.8%

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

      2. *-commutative 83.8%

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

      3. *-commutative 83.8%

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

      4. count-2 83.8%

         \[\leadsto \left(\left(x.re - x.im\right) \cdot \left(x.re + x.im\right)\right) \cdot x.im + {\left(x.re \cdot \color{blue}{\left(x.re \cdot x.im + x.re \cdot x.im\right)}\right)}^{1} \]

      5. flip-+ 0.0%

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

      6. +-inverses 0.0%

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

      7. +-inverses 0.0%

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

   8. Applied egg-rr 0.0%

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

   10. Simplified 92.7%

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

4. Final simplification 76.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x.im \leq 1.2 \cdot 10^{-62}:\\ \;\;\;\;x.re \cdot \left(\left(x.im \cdot x.re\right) \cdot 2\right) + \left(x.im + x.re\right) \cdot \left(x.im \cdot x.re\right)\\ \mathbf{else}:\\ \;\;\;\;x.im \cdot \left(\left(x.re - x.im\right) \cdot \left(x.im + x.re\right)\right) - x.re\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 86.4% accurate, 0.9× speedup

Math

\[\begin{array}{l} x.im\_m = \left|x.im\right| \\ x.im\_s = \mathsf{copysign}\left(1, x.im\right) \\ x.im\_s \cdot \begin{array}{l} \mathbf{if}\;x.im\_m \leq 3.3 \cdot 10^{-63}:\\ \;\;\;\;x.re \cdot \left(\left(x.im\_m \cdot x.re\right) \cdot 2\right) + x.im\_m \cdot \left(x.re \cdot \left(x.im\_m + x.re\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x.im\_m \cdot \left(\left(x.re - x.im\_m\right) \cdot \left(x.im\_m + x.re\right)\right) - x.re\\ \end{array} \end{array} \]

FPCore

x.im\_m = (fabs.f64 x.im)
x.im\_s = (copysign.f64 #s(literal 1 binary64) x.im)
(FPCore (x.im_s x.re x.im_m)
 :precision binary64
 (*
  x.im_s
  (if (<= x.im_m 3.3e-63)
    (+ (* x.re (* (* x.im_m x.re) 2.0)) (* x.im_m (* x.re (+ x.im_m x.re))))
    (- (* x.im_m (* (- x.re x.im_m) (+ x.im_m x.re))) x.re))))

C

x.im\_m = fabs(x_46_im);
x.im\_s = copysign(1.0, x_46_im);
double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	double tmp;
	if (x_46_im_m <= 3.3e-63) {
		tmp = (x_46_re * ((x_46_im_m * x_46_re) * 2.0)) + (x_46_im_m * (x_46_re * (x_46_im_m + x_46_re)));
	} else {
		tmp = (x_46_im_m * ((x_46_re - x_46_im_m) * (x_46_im_m + x_46_re))) - x_46_re;
	}
	return x_46_im_s * tmp;
}

Fortran

x.im\_m = abs(x_46im)
x.im\_s = copysign(1.0d0, x_46im)
real(8) function code(x_46im_s, x_46re, x_46im_m)
    real(8), intent (in) :: x_46im_s
    real(8), intent (in) :: x_46re
    real(8), intent (in) :: x_46im_m
    real(8) :: tmp
    if (x_46im_m <= 3.3d-63) then
        tmp = (x_46re * ((x_46im_m * x_46re) * 2.0d0)) + (x_46im_m * (x_46re * (x_46im_m + x_46re)))
    else
        tmp = (x_46im_m * ((x_46re - x_46im_m) * (x_46im_m + x_46re))) - x_46re
    end if
    code = x_46im_s * tmp
end function

Java

x.im\_m = Math.abs(x_46_im);
x.im\_s = Math.copySign(1.0, x_46_im);
public static double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	double tmp;
	if (x_46_im_m <= 3.3e-63) {
		tmp = (x_46_re * ((x_46_im_m * x_46_re) * 2.0)) + (x_46_im_m * (x_46_re * (x_46_im_m + x_46_re)));
	} else {
		tmp = (x_46_im_m * ((x_46_re - x_46_im_m) * (x_46_im_m + x_46_re))) - x_46_re;
	}
	return x_46_im_s * tmp;
}

Python

x.im\_m = math.fabs(x_46_im)
x.im\_s = math.copysign(1.0, x_46_im)
def code(x_46_im_s, x_46_re, x_46_im_m):
	tmp = 0
	if x_46_im_m <= 3.3e-63:
		tmp = (x_46_re * ((x_46_im_m * x_46_re) * 2.0)) + (x_46_im_m * (x_46_re * (x_46_im_m + x_46_re)))
	else:
		tmp = (x_46_im_m * ((x_46_re - x_46_im_m) * (x_46_im_m + x_46_re))) - x_46_re
	return x_46_im_s * tmp

Julia

x.im\_m = abs(x_46_im)
x.im\_s = copysign(1.0, x_46_im)
function code(x_46_im_s, x_46_re, x_46_im_m)
	tmp = 0.0
	if (x_46_im_m <= 3.3e-63)
		tmp = Float64(Float64(x_46_re * Float64(Float64(x_46_im_m * x_46_re) * 2.0)) + Float64(x_46_im_m * Float64(x_46_re * Float64(x_46_im_m + x_46_re))));
	else
		tmp = Float64(Float64(x_46_im_m * Float64(Float64(x_46_re - x_46_im_m) * Float64(x_46_im_m + x_46_re))) - x_46_re);
	end
	return Float64(x_46_im_s * tmp)
end

MATLAB

x.im\_m = abs(x_46_im);
x.im\_s = sign(x_46_im) * abs(1.0);
function tmp_2 = code(x_46_im_s, x_46_re, x_46_im_m)
	tmp = 0.0;
	if (x_46_im_m <= 3.3e-63)
		tmp = (x_46_re * ((x_46_im_m * x_46_re) * 2.0)) + (x_46_im_m * (x_46_re * (x_46_im_m + x_46_re)));
	else
		tmp = (x_46_im_m * ((x_46_re - x_46_im_m) * (x_46_im_m + x_46_re))) - x_46_re;
	end
	tmp_2 = x_46_im_s * tmp;
end

Wolfram

x.im\_m = N[Abs[x$46$im], $MachinePrecision]
x.im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x$46$im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$46$im$95$s_, x$46$re_, x$46$im$95$m_] := N[(x$46$im$95$s * If[LessEqual[x$46$im$95$m, 3.3e-63], N[(N[(x$46$re * N[(N[(x$46$im$95$m * x$46$re), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision] + N[(x$46$im$95$m * N[(x$46$re * N[(x$46$im$95$m + x$46$re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x$46$im$95$m * N[(N[(x$46$re - x$46$im$95$m), $MachinePrecision] * N[(x$46$im$95$m + x$46$re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - x$46$re), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x.im < 3.29999999999999994e-63

   1. Initial program 79.4%

      \[\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. difference-of-squares 38.7%

         \[\leadsto \color{blue}{\left(\left(x.re + x.im\right) \cdot \left(x.re - x.im\right)\right)} \cdot x.im + -3 \]

      2. *-commutative 38.7%

         \[\leadsto \color{blue}{\left(\left(x.re - x.im\right) \cdot \left(x.re + x.im\right)\right)} \cdot x.im + -3 \]

   4. Applied egg-rr 80.5%

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

      1. *-commutative 80.5%

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

      2. count-2 80.5%

         \[\leadsto \left(\left(x.re - x.im\right) \cdot \left(x.re + x.im\right)\right) \cdot x.im + \color{blue}{\left(2 \cdot \left(x.re \cdot x.im\right)\right)} \cdot x.re \]

      3. *-commutative 80.5%

         \[\leadsto \left(\left(x.re - x.im\right) \cdot \left(x.re + x.im\right)\right) \cdot x.im + \color{blue}{\left(\left(x.re \cdot x.im\right) \cdot 2\right)} \cdot x.re \]

   6. Applied egg-rr 80.5%

      \[\leadsto \left(\left(x.re - x.im\right) \cdot \left(x.re + x.im\right)\right) \cdot x.im + \color{blue}{\left(\left(x.re \cdot x.im\right) \cdot 2\right)} \cdot x.re \]

   7. Taylor expanded in x.re around inf 60.5%

      \[\leadsto \left(\color{blue}{x.re} \cdot \left(x.re + x.im\right)\right) \cdot x.im + \left(\left(x.re \cdot x.im\right) \cdot 2\right) \cdot x.re \]

   if 3.29999999999999994e-63 < x.im

   1. Initial program 77.5%

      \[\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. difference-of-squares 85.0%

         \[\leadsto \color{blue}{\left(\left(x.re + x.im\right) \cdot \left(x.re - x.im\right)\right)} \cdot x.im + -3 \]

      2. *-commutative 85.0%

         \[\leadsto \color{blue}{\left(\left(x.re - x.im\right) \cdot \left(x.re + x.im\right)\right)} \cdot x.im + -3 \]

   4. Applied egg-rr 82.8%

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

      1. *-commutative 82.8%

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

      2. count-2 82.8%

         \[\leadsto \left(\left(x.re - x.im\right) \cdot \left(x.re + x.im\right)\right) \cdot x.im + \color{blue}{\left(2 \cdot \left(x.re \cdot x.im\right)\right)} \cdot x.re \]

      3. *-commutative 82.8%

         \[\leadsto \left(\left(x.re - x.im\right) \cdot \left(x.re + x.im\right)\right) \cdot x.im + \color{blue}{\left(\left(x.re \cdot x.im\right) \cdot 2\right)} \cdot x.re \]

   6. Applied egg-rr 82.8%

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

      1. pow1 82.8%

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

      2. *-commutative 82.8%

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

      3. *-commutative 82.8%

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

      4. count-2 82.8%

         \[\leadsto \left(\left(x.re - x.im\right) \cdot \left(x.re + x.im\right)\right) \cdot x.im + {\left(x.re \cdot \color{blue}{\left(x.re \cdot x.im + x.re \cdot x.im\right)}\right)}^{1} \]

      5. flip-+ 0.0%

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

      6. +-inverses 0.0%

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

      7. +-inverses 0.0%

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

   8. Applied egg-rr 0.0%

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

   10. Simplified 91.6%

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

4. Final simplification 69.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x.im \leq 3.3 \cdot 10^{-63}:\\ \;\;\;\;x.re \cdot \left(\left(x.im \cdot x.re\right) \cdot 2\right) + x.im \cdot \left(x.re \cdot \left(x.im + x.re\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x.im \cdot \left(\left(x.re - x.im\right) \cdot \left(x.im + x.re\right)\right) - x.re\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 86.4% accurate, 1.2× speedup

Math

\[\begin{array}{l} x.im\_m = \left|x.im\right| \\ x.im\_s = \mathsf{copysign}\left(1, x.im\right) \\ x.im\_s \cdot \begin{array}{l} \mathbf{if}\;x.im\_m \leq 4.3 \cdot 10^{-63}:\\ \;\;\;\;3 \cdot \left(x.im\_m \cdot \left(x.re \cdot x.re\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x.im\_m \cdot \left(\left(x.re - x.im\_m\right) \cdot \left(x.im\_m + x.re\right)\right) - x.re\\ \end{array} \end{array} \]

FPCore

x.im\_m = (fabs.f64 x.im)
x.im\_s = (copysign.f64 #s(literal 1 binary64) x.im)
(FPCore (x.im_s x.re x.im_m)
 :precision binary64
 (*
  x.im_s
  (if (<= x.im_m 4.3e-63)
    (* 3.0 (* x.im_m (* x.re x.re)))
    (- (* x.im_m (* (- x.re x.im_m) (+ x.im_m x.re))) x.re))))

C

x.im\_m = fabs(x_46_im);
x.im\_s = copysign(1.0, x_46_im);
double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	double tmp;
	if (x_46_im_m <= 4.3e-63) {
		tmp = 3.0 * (x_46_im_m * (x_46_re * x_46_re));
	} else {
		tmp = (x_46_im_m * ((x_46_re - x_46_im_m) * (x_46_im_m + x_46_re))) - x_46_re;
	}
	return x_46_im_s * tmp;
}

Fortran

x.im\_m = abs(x_46im)
x.im\_s = copysign(1.0d0, x_46im)
real(8) function code(x_46im_s, x_46re, x_46im_m)
    real(8), intent (in) :: x_46im_s
    real(8), intent (in) :: x_46re
    real(8), intent (in) :: x_46im_m
    real(8) :: tmp
    if (x_46im_m <= 4.3d-63) then
        tmp = 3.0d0 * (x_46im_m * (x_46re * x_46re))
    else
        tmp = (x_46im_m * ((x_46re - x_46im_m) * (x_46im_m + x_46re))) - x_46re
    end if
    code = x_46im_s * tmp
end function

Java

x.im\_m = Math.abs(x_46_im);
x.im\_s = Math.copySign(1.0, x_46_im);
public static double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	double tmp;
	if (x_46_im_m <= 4.3e-63) {
		tmp = 3.0 * (x_46_im_m * (x_46_re * x_46_re));
	} else {
		tmp = (x_46_im_m * ((x_46_re - x_46_im_m) * (x_46_im_m + x_46_re))) - x_46_re;
	}
	return x_46_im_s * tmp;
}

Python

x.im\_m = math.fabs(x_46_im)
x.im\_s = math.copysign(1.0, x_46_im)
def code(x_46_im_s, x_46_re, x_46_im_m):
	tmp = 0
	if x_46_im_m <= 4.3e-63:
		tmp = 3.0 * (x_46_im_m * (x_46_re * x_46_re))
	else:
		tmp = (x_46_im_m * ((x_46_re - x_46_im_m) * (x_46_im_m + x_46_re))) - x_46_re
	return x_46_im_s * tmp

Julia

x.im\_m = abs(x_46_im)
x.im\_s = copysign(1.0, x_46_im)
function code(x_46_im_s, x_46_re, x_46_im_m)
	tmp = 0.0
	if (x_46_im_m <= 4.3e-63)
		tmp = Float64(3.0 * Float64(x_46_im_m * Float64(x_46_re * x_46_re)));
	else
		tmp = Float64(Float64(x_46_im_m * Float64(Float64(x_46_re - x_46_im_m) * Float64(x_46_im_m + x_46_re))) - x_46_re);
	end
	return Float64(x_46_im_s * tmp)
end

MATLAB

x.im\_m = abs(x_46_im);
x.im\_s = sign(x_46_im) * abs(1.0);
function tmp_2 = code(x_46_im_s, x_46_re, x_46_im_m)
	tmp = 0.0;
	if (x_46_im_m <= 4.3e-63)
		tmp = 3.0 * (x_46_im_m * (x_46_re * x_46_re));
	else
		tmp = (x_46_im_m * ((x_46_re - x_46_im_m) * (x_46_im_m + x_46_re))) - x_46_re;
	end
	tmp_2 = x_46_im_s * tmp;
end

Wolfram

x.im\_m = N[Abs[x$46$im], $MachinePrecision]
x.im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x$46$im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$46$im$95$s_, x$46$re_, x$46$im$95$m_] := N[(x$46$im$95$s * If[LessEqual[x$46$im$95$m, 4.3e-63], N[(3.0 * N[(x$46$im$95$m * N[(x$46$re * x$46$re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x$46$im$95$m * N[(N[(x$46$re - x$46$im$95$m), $MachinePrecision] * N[(x$46$im$95$m + x$46$re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - x$46$re), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x.im < 4.2999999999999999e-63

   1. Initial program 79.4%

      \[\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]

   3. Simplified 87.6%

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

   5. Taylor expanded in x.re around inf 58.6%

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

      1. unpow2 58.6%

         \[\leadsto 3 \cdot \left(x.im \cdot \color{blue}{\left(x.re \cdot x.re\right)}\right) \]

   7. Applied egg-rr 58.6%

      \[\leadsto 3 \cdot \left(x.im \cdot \color{blue}{\left(x.re \cdot x.re\right)}\right) \]

   if 4.2999999999999999e-63 < x.im

   1. Initial program 77.5%

      \[\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. difference-of-squares 85.0%

         \[\leadsto \color{blue}{\left(\left(x.re + x.im\right) \cdot \left(x.re - x.im\right)\right)} \cdot x.im + -3 \]

      2. *-commutative 85.0%

         \[\leadsto \color{blue}{\left(\left(x.re - x.im\right) \cdot \left(x.re + x.im\right)\right)} \cdot x.im + -3 \]

   4. Applied egg-rr 82.8%

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

      1. *-commutative 82.8%

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

      2. count-2 82.8%

         \[\leadsto \left(\left(x.re - x.im\right) \cdot \left(x.re + x.im\right)\right) \cdot x.im + \color{blue}{\left(2 \cdot \left(x.re \cdot x.im\right)\right)} \cdot x.re \]

      3. *-commutative 82.8%

         \[\leadsto \left(\left(x.re - x.im\right) \cdot \left(x.re + x.im\right)\right) \cdot x.im + \color{blue}{\left(\left(x.re \cdot x.im\right) \cdot 2\right)} \cdot x.re \]

   6. Applied egg-rr 82.8%

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

      1. pow1 82.8%

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

      2. *-commutative 82.8%

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

      3. *-commutative 82.8%

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

      4. count-2 82.8%

         \[\leadsto \left(\left(x.re - x.im\right) \cdot \left(x.re + x.im\right)\right) \cdot x.im + {\left(x.re \cdot \color{blue}{\left(x.re \cdot x.im + x.re \cdot x.im\right)}\right)}^{1} \]

      5. flip-+ 0.0%

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

      6. +-inverses 0.0%

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

      7. +-inverses 0.0%

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

   8. Applied egg-rr 0.0%

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

   10. Simplified 91.6%

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

4. Final simplification 68.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x.im \leq 4.3 \cdot 10^{-63}:\\ \;\;\;\;3 \cdot \left(x.im \cdot \left(x.re \cdot x.re\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x.im \cdot \left(\left(x.re - x.im\right) \cdot \left(x.im + x.re\right)\right) - x.re\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 85.2% accurate, 1.2× speedup

Math

\[\begin{array}{l} x.im\_m = \left|x.im\right| \\ x.im\_s = \mathsf{copysign}\left(1, x.im\right) \\ x.im\_s \cdot \begin{array}{l} \mathbf{if}\;x.im\_m \leq 2.75 \cdot 10^{-15}:\\ \;\;\;\;3 \cdot \left(x.im\_m \cdot \left(x.re \cdot x.re\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x.im\_m \cdot \left(\left(x.re - x.im\_m\right) \cdot \left(x.im\_m + x.re\right)\right) + -3\\ \end{array} \end{array} \]

FPCore

x.im\_m = (fabs.f64 x.im)
x.im\_s = (copysign.f64 #s(literal 1 binary64) x.im)
(FPCore (x.im_s x.re x.im_m)
 :precision binary64
 (*
  x.im_s
  (if (<= x.im_m 2.75e-15)
    (* 3.0 (* x.im_m (* x.re x.re)))
    (+ (* x.im_m (* (- x.re x.im_m) (+ x.im_m x.re))) -3.0))))

C

x.im\_m = fabs(x_46_im);
x.im\_s = copysign(1.0, x_46_im);
double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	double tmp;
	if (x_46_im_m <= 2.75e-15) {
		tmp = 3.0 * (x_46_im_m * (x_46_re * x_46_re));
	} else {
		tmp = (x_46_im_m * ((x_46_re - x_46_im_m) * (x_46_im_m + x_46_re))) + -3.0;
	}
	return x_46_im_s * tmp;
}

Fortran

x.im\_m = abs(x_46im)
x.im\_s = copysign(1.0d0, x_46im)
real(8) function code(x_46im_s, x_46re, x_46im_m)
    real(8), intent (in) :: x_46im_s
    real(8), intent (in) :: x_46re
    real(8), intent (in) :: x_46im_m
    real(8) :: tmp
    if (x_46im_m <= 2.75d-15) then
        tmp = 3.0d0 * (x_46im_m * (x_46re * x_46re))
    else
        tmp = (x_46im_m * ((x_46re - x_46im_m) * (x_46im_m + x_46re))) + (-3.0d0)
    end if
    code = x_46im_s * tmp
end function

Java

x.im\_m = Math.abs(x_46_im);
x.im\_s = Math.copySign(1.0, x_46_im);
public static double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	double tmp;
	if (x_46_im_m <= 2.75e-15) {
		tmp = 3.0 * (x_46_im_m * (x_46_re * x_46_re));
	} else {
		tmp = (x_46_im_m * ((x_46_re - x_46_im_m) * (x_46_im_m + x_46_re))) + -3.0;
	}
	return x_46_im_s * tmp;
}

Python

x.im\_m = math.fabs(x_46_im)
x.im\_s = math.copysign(1.0, x_46_im)
def code(x_46_im_s, x_46_re, x_46_im_m):
	tmp = 0
	if x_46_im_m <= 2.75e-15:
		tmp = 3.0 * (x_46_im_m * (x_46_re * x_46_re))
	else:
		tmp = (x_46_im_m * ((x_46_re - x_46_im_m) * (x_46_im_m + x_46_re))) + -3.0
	return x_46_im_s * tmp

Julia

x.im\_m = abs(x_46_im)
x.im\_s = copysign(1.0, x_46_im)
function code(x_46_im_s, x_46_re, x_46_im_m)
	tmp = 0.0
	if (x_46_im_m <= 2.75e-15)
		tmp = Float64(3.0 * Float64(x_46_im_m * Float64(x_46_re * x_46_re)));
	else
		tmp = Float64(Float64(x_46_im_m * Float64(Float64(x_46_re - x_46_im_m) * Float64(x_46_im_m + x_46_re))) + -3.0);
	end
	return Float64(x_46_im_s * tmp)
end

MATLAB

x.im\_m = abs(x_46_im);
x.im\_s = sign(x_46_im) * abs(1.0);
function tmp_2 = code(x_46_im_s, x_46_re, x_46_im_m)
	tmp = 0.0;
	if (x_46_im_m <= 2.75e-15)
		tmp = 3.0 * (x_46_im_m * (x_46_re * x_46_re));
	else
		tmp = (x_46_im_m * ((x_46_re - x_46_im_m) * (x_46_im_m + x_46_re))) + -3.0;
	end
	tmp_2 = x_46_im_s * tmp;
end

Wolfram

x.im\_m = N[Abs[x$46$im], $MachinePrecision]
x.im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x$46$im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$46$im$95$s_, x$46$re_, x$46$im$95$m_] := N[(x$46$im$95$s * If[LessEqual[x$46$im$95$m, 2.75e-15], N[(3.0 * N[(x$46$im$95$m * N[(x$46$re * x$46$re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x$46$im$95$m * N[(N[(x$46$re - x$46$im$95$m), $MachinePrecision] * N[(x$46$im$95$m + x$46$re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -3.0), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x.im < 2.7500000000000001e-15

   1. Initial program 79.9%

      \[\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]

   3. Simplified 88.2%

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

   5. Taylor expanded in x.re around inf 58.2%

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

      1. unpow2 58.2%

         \[\leadsto 3 \cdot \left(x.im \cdot \color{blue}{\left(x.re \cdot x.re\right)}\right) \]

   7. Applied egg-rr 58.2%

      \[\leadsto 3 \cdot \left(x.im \cdot \color{blue}{\left(x.re \cdot x.re\right)}\right) \]

   if 2.7500000000000001e-15 < x.im

   1. Initial program 75.6%

      \[\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]
   2. Add Preprocessing

   3. Taylor expanded in x.re around 0 75.6%

      \[\leadsto \left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \color{blue}{2 \cdot \left(x.im \cdot {x.re}^{2}\right)} \]

   5. Simplified 79.2%

      \[\leadsto \left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \color{blue}{-3} \]
   6. Step-by-step derivation

      1. difference-of-squares 92.9%

         \[\leadsto \color{blue}{\left(\left(x.re + x.im\right) \cdot \left(x.re - x.im\right)\right)} \cdot x.im + -3 \]

      2. *-commutative 92.9%

         \[\leadsto \color{blue}{\left(\left(x.re - x.im\right) \cdot \left(x.re + x.im\right)\right)} \cdot x.im + -3 \]

   7. Applied egg-rr 92.9%

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

4. Final simplification 67.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x.im \leq 2.75 \cdot 10^{-15}:\\ \;\;\;\;3 \cdot \left(x.im \cdot \left(x.re \cdot x.re\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x.im \cdot \left(\left(x.re - x.im\right) \cdot \left(x.im + x.re\right)\right) + -3\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 68.3% accurate, 1.6× speedup

Math

\[\begin{array}{l} x.im\_m = \left|x.im\right| \\ x.im\_s = \mathsf{copysign}\left(1, x.im\right) \\ x.im\_s \cdot \begin{array}{l} \mathbf{if}\;x.im\_m \leq 3.5 \cdot 10^{+131}:\\ \;\;\;\;3 \cdot \left(x.im\_m \cdot \left(x.re \cdot x.re\right)\right)\\ \mathbf{else}:\\ \;\;\;\;-3 + x.im\_m \cdot \left(x.im\_m \cdot -3\right)\\ \end{array} \end{array} \]

FPCore

x.im\_m = (fabs.f64 x.im)
x.im\_s = (copysign.f64 #s(literal 1 binary64) x.im)
(FPCore (x.im_s x.re x.im_m)
 :precision binary64
 (*
  x.im_s
  (if (<= x.im_m 3.5e+131)
    (* 3.0 (* x.im_m (* x.re x.re)))
    (+ -3.0 (* x.im_m (* x.im_m -3.0))))))

C

x.im\_m = fabs(x_46_im);
x.im\_s = copysign(1.0, x_46_im);
double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	double tmp;
	if (x_46_im_m <= 3.5e+131) {
		tmp = 3.0 * (x_46_im_m * (x_46_re * x_46_re));
	} else {
		tmp = -3.0 + (x_46_im_m * (x_46_im_m * -3.0));
	}
	return x_46_im_s * tmp;
}

Fortran

x.im\_m = abs(x_46im)
x.im\_s = copysign(1.0d0, x_46im)
real(8) function code(x_46im_s, x_46re, x_46im_m)
    real(8), intent (in) :: x_46im_s
    real(8), intent (in) :: x_46re
    real(8), intent (in) :: x_46im_m
    real(8) :: tmp
    if (x_46im_m <= 3.5d+131) then
        tmp = 3.0d0 * (x_46im_m * (x_46re * x_46re))
    else
        tmp = (-3.0d0) + (x_46im_m * (x_46im_m * (-3.0d0)))
    end if
    code = x_46im_s * tmp
end function

Java

x.im\_m = Math.abs(x_46_im);
x.im\_s = Math.copySign(1.0, x_46_im);
public static double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	double tmp;
	if (x_46_im_m <= 3.5e+131) {
		tmp = 3.0 * (x_46_im_m * (x_46_re * x_46_re));
	} else {
		tmp = -3.0 + (x_46_im_m * (x_46_im_m * -3.0));
	}
	return x_46_im_s * tmp;
}

Python

x.im\_m = math.fabs(x_46_im)
x.im\_s = math.copysign(1.0, x_46_im)
def code(x_46_im_s, x_46_re, x_46_im_m):
	tmp = 0
	if x_46_im_m <= 3.5e+131:
		tmp = 3.0 * (x_46_im_m * (x_46_re * x_46_re))
	else:
		tmp = -3.0 + (x_46_im_m * (x_46_im_m * -3.0))
	return x_46_im_s * tmp

Julia

x.im\_m = abs(x_46_im)
x.im\_s = copysign(1.0, x_46_im)
function code(x_46_im_s, x_46_re, x_46_im_m)
	tmp = 0.0
	if (x_46_im_m <= 3.5e+131)
		tmp = Float64(3.0 * Float64(x_46_im_m * Float64(x_46_re * x_46_re)));
	else
		tmp = Float64(-3.0 + Float64(x_46_im_m * Float64(x_46_im_m * -3.0)));
	end
	return Float64(x_46_im_s * tmp)
end

MATLAB

x.im\_m = abs(x_46_im);
x.im\_s = sign(x_46_im) * abs(1.0);
function tmp_2 = code(x_46_im_s, x_46_re, x_46_im_m)
	tmp = 0.0;
	if (x_46_im_m <= 3.5e+131)
		tmp = 3.0 * (x_46_im_m * (x_46_re * x_46_re));
	else
		tmp = -3.0 + (x_46_im_m * (x_46_im_m * -3.0));
	end
	tmp_2 = x_46_im_s * tmp;
end

Wolfram

x.im\_m = N[Abs[x$46$im], $MachinePrecision]
x.im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x$46$im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$46$im$95$s_, x$46$re_, x$46$im$95$m_] := N[(x$46$im$95$s * If[LessEqual[x$46$im$95$m, 3.5e+131], N[(3.0 * N[(x$46$im$95$m * N[(x$46$re * x$46$re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-3.0 + N[(x$46$im$95$m * N[(x$46$im$95$m * -3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x.im < 3.4999999999999999e131

   1. Initial program 82.8%

      \[\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]

   3. Simplified 89.0%

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

   5. Taylor expanded in x.re around inf 54.3%

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

      1. unpow2 54.3%

         \[\leadsto 3 \cdot \left(x.im \cdot \color{blue}{\left(x.re \cdot x.re\right)}\right) \]

   7. Applied egg-rr 54.3%

      \[\leadsto 3 \cdot \left(x.im \cdot \color{blue}{\left(x.re \cdot x.re\right)}\right) \]

   if 3.4999999999999999e131 < x.im

   1. Initial program 52.9%

      \[\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. difference-of-squares 64.7%

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

   4. Applied egg-rr 64.7%

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

   6. Simplified 48.3%

      \[\leadsto \color{blue}{\left(\left(x.im + x.re\right) \cdot \left(x.re + -3\right)\right)} \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]

   7. Taylor expanded in x.re around 0 39.5%

      \[\leadsto \color{blue}{\left(-3 \cdot x.im\right)} \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]

   9. Simplified 39.5%

      \[\leadsto \color{blue}{\left(x.im \cdot -3\right)} \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]

   10. Taylor expanded in x.re around 0 39.5%

       \[\leadsto \left(x.im \cdot -3\right) \cdot x.im + \color{blue}{2 \cdot \left(x.im \cdot {x.re}^{2}\right)} \]

   12. Simplified 72.1%

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

4. Final simplification 56.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x.im \leq 3.5 \cdot 10^{+131}:\\ \;\;\;\;3 \cdot \left(x.im \cdot \left(x.re \cdot x.re\right)\right)\\ \mathbf{else}:\\ \;\;\;\;-3 + x.im \cdot \left(x.im \cdot -3\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 68.3% accurate, 1.6× speedup

Math

\[\begin{array}{l} x.im\_m = \left|x.im\right| \\ x.im\_s = \mathsf{copysign}\left(1, x.im\right) \\ x.im\_s \cdot \begin{array}{l} \mathbf{if}\;x.im\_m \leq 3.5 \cdot 10^{+131}:\\ \;\;\;\;3 \cdot \left(x.im\_m \cdot \left(x.re \cdot x.re\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x.re - x.im\_m \cdot x.im\_m\\ \end{array} \end{array} \]

FPCore

x.im\_m = (fabs.f64 x.im)
x.im\_s = (copysign.f64 #s(literal 1 binary64) x.im)
(FPCore (x.im_s x.re x.im_m)
 :precision binary64
 (*
  x.im_s
  (if (<= x.im_m 3.5e+131)
    (* 3.0 (* x.im_m (* x.re x.re)))
    (- x.re (* x.im_m x.im_m)))))

C

x.im\_m = fabs(x_46_im);
x.im\_s = copysign(1.0, x_46_im);
double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	double tmp;
	if (x_46_im_m <= 3.5e+131) {
		tmp = 3.0 * (x_46_im_m * (x_46_re * x_46_re));
	} else {
		tmp = x_46_re - (x_46_im_m * x_46_im_m);
	}
	return x_46_im_s * tmp;
}

Fortran

x.im\_m = abs(x_46im)
x.im\_s = copysign(1.0d0, x_46im)
real(8) function code(x_46im_s, x_46re, x_46im_m)
    real(8), intent (in) :: x_46im_s
    real(8), intent (in) :: x_46re
    real(8), intent (in) :: x_46im_m
    real(8) :: tmp
    if (x_46im_m <= 3.5d+131) then
        tmp = 3.0d0 * (x_46im_m * (x_46re * x_46re))
    else
        tmp = x_46re - (x_46im_m * x_46im_m)
    end if
    code = x_46im_s * tmp
end function

Java

x.im\_m = Math.abs(x_46_im);
x.im\_s = Math.copySign(1.0, x_46_im);
public static double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	double tmp;
	if (x_46_im_m <= 3.5e+131) {
		tmp = 3.0 * (x_46_im_m * (x_46_re * x_46_re));
	} else {
		tmp = x_46_re - (x_46_im_m * x_46_im_m);
	}
	return x_46_im_s * tmp;
}

Python

x.im\_m = math.fabs(x_46_im)
x.im\_s = math.copysign(1.0, x_46_im)
def code(x_46_im_s, x_46_re, x_46_im_m):
	tmp = 0
	if x_46_im_m <= 3.5e+131:
		tmp = 3.0 * (x_46_im_m * (x_46_re * x_46_re))
	else:
		tmp = x_46_re - (x_46_im_m * x_46_im_m)
	return x_46_im_s * tmp

Julia

x.im\_m = abs(x_46_im)
x.im\_s = copysign(1.0, x_46_im)
function code(x_46_im_s, x_46_re, x_46_im_m)
	tmp = 0.0
	if (x_46_im_m <= 3.5e+131)
		tmp = Float64(3.0 * Float64(x_46_im_m * Float64(x_46_re * x_46_re)));
	else
		tmp = Float64(x_46_re - Float64(x_46_im_m * x_46_im_m));
	end
	return Float64(x_46_im_s * tmp)
end

MATLAB

x.im\_m = abs(x_46_im);
x.im\_s = sign(x_46_im) * abs(1.0);
function tmp_2 = code(x_46_im_s, x_46_re, x_46_im_m)
	tmp = 0.0;
	if (x_46_im_m <= 3.5e+131)
		tmp = 3.0 * (x_46_im_m * (x_46_re * x_46_re));
	else
		tmp = x_46_re - (x_46_im_m * x_46_im_m);
	end
	tmp_2 = x_46_im_s * tmp;
end

Wolfram

x.im\_m = N[Abs[x$46$im], $MachinePrecision]
x.im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x$46$im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$46$im$95$s_, x$46$re_, x$46$im$95$m_] := N[(x$46$im$95$s * If[LessEqual[x$46$im$95$m, 3.5e+131], N[(3.0 * N[(x$46$im$95$m * N[(x$46$re * x$46$re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x$46$re - N[(x$46$im$95$m * x$46$im$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x.im < 3.4999999999999999e131

   1. Initial program 82.8%

      \[\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]

   3. Simplified 89.0%

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

   5. Taylor expanded in x.re around inf 54.3%

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

      1. unpow2 54.3%

         \[\leadsto 3 \cdot \left(x.im \cdot \color{blue}{\left(x.re \cdot x.re\right)}\right) \]

   7. Applied egg-rr 54.3%

      \[\leadsto 3 \cdot \left(x.im \cdot \color{blue}{\left(x.re \cdot x.re\right)}\right) \]

   if 3.4999999999999999e131 < x.im

   1. Initial program 52.9%

      \[\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. difference-of-squares 64.7%

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

   4. Applied egg-rr 64.7%

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

   6. Simplified 48.3%

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

      1. pow1 48.3%

         \[\leadsto \color{blue}{{\left(\left(\left(x.im + x.re\right) \cdot \left(x.re + -3\right)\right) \cdot x.im\right)}^{1}} + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]

      2. associate-*l* 48.3%

         \[\leadsto {\color{blue}{\left(\left(x.im + x.re\right) \cdot \left(\left(x.re + -3\right) \cdot x.im\right)\right)}}^{1} + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]

      3. *-commutative 48.3%

         \[\leadsto {\left(\left(x.im + x.re\right) \cdot \color{blue}{\left(x.im \cdot \left(x.re + -3\right)\right)}\right)}^{1} + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]

   8. Applied egg-rr 48.3%

      \[\leadsto \color{blue}{{\left(\left(x.im + x.re\right) \cdot \left(x.im \cdot \left(x.re + -3\right)\right)\right)}^{1}} + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]

   10. Simplified 48.3%

       \[\leadsto \color{blue}{\left(x.im + x.re\right) \cdot \left(x.im \cdot \left(x.re + -3\right)\right)} + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]
   11. Step-by-step derivation

       1. +-commutative 48.3%

          \[\leadsto \color{blue}{\left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re + \left(x.im + x.re\right) \cdot \left(x.im \cdot \left(x.re + -3\right)\right)} \]

       2. *-commutative 48.3%

          \[\leadsto \color{blue}{x.re \cdot \left(x.re \cdot x.im + x.im \cdot x.re\right)} + \left(x.im + x.re\right) \cdot \left(x.im \cdot \left(x.re + -3\right)\right) \]

       3. fma-define 51.2%

          \[\leadsto \color{blue}{\mathsf{fma}\left(x.re, x.re \cdot x.im + x.im \cdot x.re, \left(x.im + x.re\right) \cdot \left(x.im \cdot \left(x.re + -3\right)\right)\right)} \]

       4. *-commutative 51.2%

          \[\leadsto \mathsf{fma}\left(x.re, \color{blue}{x.im \cdot x.re} + x.im \cdot x.re, \left(x.im + x.re\right) \cdot \left(x.im \cdot \left(x.re + -3\right)\right)\right) \]

       5. flip-+ 0.0%

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

       6. +-inverses 0.0%

          \[\leadsto \mathsf{fma}\left(x.re, \frac{\color{blue}{0}}{x.im \cdot x.re - x.im \cdot x.re}, \left(x.im + x.re\right) \cdot \left(x.im \cdot \left(x.re + -3\right)\right)\right) \]

       7. +-inverses 0.0%

          \[\leadsto \mathsf{fma}\left(x.re, \frac{0}{\color{blue}{0}}, \left(x.im + x.re\right) \cdot \left(x.im \cdot \left(x.re + -3\right)\right)\right) \]

       8. +-commutative 0.0%

          \[\leadsto \mathsf{fma}\left(x.re, \frac{0}{0}, \color{blue}{\left(x.re + x.im\right)} \cdot \left(x.im \cdot \left(x.re + -3\right)\right)\right) \]

   12. Applied egg-rr 0.0%

       \[\leadsto \color{blue}{\mathsf{fma}\left(x.re, \frac{0}{0}, \left(x.re + x.im\right) \cdot \left(x.im \cdot \left(x.re + -3\right)\right)\right)} \]

   14. Simplified 57.1%

       \[\leadsto \color{blue}{x.re + x.im \cdot \left(\left(x.re + -3\right) \cdot \left(x.im + x.re\right)\right)} \]

   15. Taylor expanded in x.re around 0 72.1%

       \[\leadsto x.re + x.im \cdot \color{blue}{\left(-3 \cdot x.im\right)} \]

   17. Simplified 72.1%

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

4. Final simplification 56.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x.im \leq 3.5 \cdot 10^{+131}:\\ \;\;\;\;3 \cdot \left(x.im \cdot \left(x.re \cdot x.re\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x.re - x.im \cdot x.im\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 26.3% accurate, 3.8× speedup

Math

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

FPCore

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

C

x.im\_m = fabs(x_46_im);
x.im\_s = copysign(1.0, x_46_im);
double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	return x_46_im_s * (x_46_re - (x_46_im_m * x_46_im_m));
}

Fortran

x.im\_m = abs(x_46im)
x.im\_s = copysign(1.0d0, x_46im)
real(8) function code(x_46im_s, x_46re, x_46im_m)
    real(8), intent (in) :: x_46im_s
    real(8), intent (in) :: x_46re
    real(8), intent (in) :: x_46im_m
    code = x_46im_s * (x_46re - (x_46im_m * x_46im_m))
end function

Java

x.im\_m = Math.abs(x_46_im);
x.im\_s = Math.copySign(1.0, x_46_im);
public static double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	return x_46_im_s * (x_46_re - (x_46_im_m * x_46_im_m));
}

Python

x.im\_m = math.fabs(x_46_im)
x.im\_s = math.copysign(1.0, x_46_im)
def code(x_46_im_s, x_46_re, x_46_im_m):
	return x_46_im_s * (x_46_re - (x_46_im_m * x_46_im_m))

Julia

x.im\_m = abs(x_46_im)
x.im\_s = copysign(1.0, x_46_im)
function code(x_46_im_s, x_46_re, x_46_im_m)
	return Float64(x_46_im_s * Float64(x_46_re - Float64(x_46_im_m * x_46_im_m)))
end

MATLAB

x.im\_m = abs(x_46_im);
x.im\_s = sign(x_46_im) * abs(1.0);
function tmp = code(x_46_im_s, x_46_re, x_46_im_m)
	tmp = x_46_im_s * (x_46_re - (x_46_im_m * x_46_im_m));
end

Wolfram

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

Derivation

1. Initial program 78.8%

   \[\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]
2. Add Preprocessing
3. Step-by-step derivation

   1. difference-of-squares 81.2%

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

4. Applied egg-rr 81.2%

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

6. Simplified 41.2%

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

   1. pow1 41.2%

      \[\leadsto \color{blue}{{\left(\left(\left(x.im + x.re\right) \cdot \left(x.re + -3\right)\right) \cdot x.im\right)}^{1}} + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]

   2. associate-*l* 48.0%

      \[\leadsto {\color{blue}{\left(\left(x.im + x.re\right) \cdot \left(\left(x.re + -3\right) \cdot x.im\right)\right)}}^{1} + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]

   3. *-commutative 48.0%

      \[\leadsto {\left(\left(x.im + x.re\right) \cdot \color{blue}{\left(x.im \cdot \left(x.re + -3\right)\right)}\right)}^{1} + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]

8. Applied egg-rr 48.0%

   \[\leadsto \color{blue}{{\left(\left(x.im + x.re\right) \cdot \left(x.im \cdot \left(x.re + -3\right)\right)\right)}^{1}} + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]

10. Simplified 48.0%

    \[\leadsto \color{blue}{\left(x.im + x.re\right) \cdot \left(x.im \cdot \left(x.re + -3\right)\right)} + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]
11. Step-by-step derivation

    1. +-commutative 48.0%

       \[\leadsto \color{blue}{\left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re + \left(x.im + x.re\right) \cdot \left(x.im \cdot \left(x.re + -3\right)\right)} \]

    2. *-commutative 48.0%

       \[\leadsto \color{blue}{x.re \cdot \left(x.re \cdot x.im + x.im \cdot x.re\right)} + \left(x.im + x.re\right) \cdot \left(x.im \cdot \left(x.re + -3\right)\right) \]

    3. fma-define 48.4%

       \[\leadsto \color{blue}{\mathsf{fma}\left(x.re, x.re \cdot x.im + x.im \cdot x.re, \left(x.im + x.re\right) \cdot \left(x.im \cdot \left(x.re + -3\right)\right)\right)} \]

    4. *-commutative 48.4%

       \[\leadsto \mathsf{fma}\left(x.re, \color{blue}{x.im \cdot x.re} + x.im \cdot x.re, \left(x.im + x.re\right) \cdot \left(x.im \cdot \left(x.re + -3\right)\right)\right) \]

    5. flip-+ 0.0%

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

    6. +-inverses 0.0%

       \[\leadsto \mathsf{fma}\left(x.re, \frac{\color{blue}{0}}{x.im \cdot x.re - x.im \cdot x.re}, \left(x.im + x.re\right) \cdot \left(x.im \cdot \left(x.re + -3\right)\right)\right) \]

    7. +-inverses 0.0%

       \[\leadsto \mathsf{fma}\left(x.re, \frac{0}{\color{blue}{0}}, \left(x.im + x.re\right) \cdot \left(x.im \cdot \left(x.re + -3\right)\right)\right) \]

    8. +-commutative 0.0%

       \[\leadsto \mathsf{fma}\left(x.re, \frac{0}{0}, \color{blue}{\left(x.re + x.im\right)} \cdot \left(x.im \cdot \left(x.re + -3\right)\right)\right) \]

12. Applied egg-rr 0.0%

    \[\leadsto \color{blue}{\mathsf{fma}\left(x.re, \frac{0}{0}, \left(x.re + x.im\right) \cdot \left(x.im \cdot \left(x.re + -3\right)\right)\right)} \]

14. Simplified 26.7%

    \[\leadsto \color{blue}{x.re + x.im \cdot \left(\left(x.re + -3\right) \cdot \left(x.im + x.re\right)\right)} \]

15. Taylor expanded in x.re around 0 13.7%

    \[\leadsto x.re + x.im \cdot \color{blue}{\left(-3 \cdot x.im\right)} \]

17. Simplified 13.7%

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

18. Final simplification 13.7%

    \[\leadsto x.re - x.im \cdot x.im \]
19. Add Preprocessing

Alternative 11: 2.7% accurate, 19.0× speedup

Math

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

FPCore

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

C

x.im\_m = fabs(x_46_im);
x.im\_s = copysign(1.0, x_46_im);
double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	return x_46_im_s * -27.0;
}

Fortran

x.im\_m = abs(x_46im)
x.im\_s = copysign(1.0d0, x_46im)
real(8) function code(x_46im_s, x_46re, x_46im_m)
    real(8), intent (in) :: x_46im_s
    real(8), intent (in) :: x_46re
    real(8), intent (in) :: x_46im_m
    code = x_46im_s * (-27.0d0)
end function

Java

x.im\_m = Math.abs(x_46_im);
x.im\_s = Math.copySign(1.0, x_46_im);
public static double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	return x_46_im_s * -27.0;
}

Python

x.im\_m = math.fabs(x_46_im)
x.im\_s = math.copysign(1.0, x_46_im)
def code(x_46_im_s, x_46_re, x_46_im_m):
	return x_46_im_s * -27.0

Julia

x.im\_m = abs(x_46_im)
x.im\_s = copysign(1.0, x_46_im)
function code(x_46_im_s, x_46_re, x_46_im_m)
	return Float64(x_46_im_s * -27.0)
end

MATLAB

x.im\_m = abs(x_46_im);
x.im\_s = sign(x_46_im) * abs(1.0);
function tmp = code(x_46_im_s, x_46_re, x_46_im_m)
	tmp = x_46_im_s * -27.0;
end

Wolfram

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

Derivation

1. Initial program 78.8%

   \[\left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]
2. Add Preprocessing
3. Step-by-step derivation

   1. difference-of-squares 81.2%

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

4. Applied egg-rr 81.2%

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

6. Simplified 41.2%

   \[\leadsto \color{blue}{\left(\left(x.im + x.re\right) \cdot \left(x.re + -3\right)\right)} \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]

7. Taylor expanded in x.re around 0 34.6%

   \[\leadsto \color{blue}{\left(-3 \cdot x.im\right)} \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]

9. Simplified 34.6%

   \[\leadsto \color{blue}{\left(x.im \cdot -3\right)} \cdot x.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]

10. Taylor expanded in x.re around 0 33.6%

    \[\leadsto \left(x.im \cdot -3\right) \cdot x.im + \color{blue}{2 \cdot \left(x.im \cdot {x.re}^{2}\right)} \]

12. Simplified 12.9%

    \[\leadsto \left(x.im \cdot -3\right) \cdot x.im + \color{blue}{-3} \]

13. Taylor expanded in x.im around 0 2.8%

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

15. Simplified 2.8%

    \[\leadsto \color{blue}{-27} \]
16. Add Preprocessing

Developer Target 1: 91.2% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \left(x.re \cdot x.im\right) \cdot \left(2 \cdot x.re\right) + \left(x.im \cdot \left(x.re - x.im\right)\right) \cdot \left(x.re + x.im\right) \end{array} \]

FPCore

(FPCore (x.re x.im)
 :precision binary64
 (+ (* (* x.re x.im) (* 2.0 x.re)) (* (* x.im (- x.re x.im)) (+ x.re x.im))))

C

double code(double x_46_re, double x_46_im) {
	return ((x_46_re * x_46_im) * (2.0 * x_46_re)) + ((x_46_im * (x_46_re - x_46_im)) * (x_46_re + x_46_im));
}

Fortran

real(8) function code(x_46re, x_46im)
    real(8), intent (in) :: x_46re
    real(8), intent (in) :: x_46im
    code = ((x_46re * x_46im) * (2.0d0 * x_46re)) + ((x_46im * (x_46re - x_46im)) * (x_46re + x_46im))
end function

Java

public static double code(double x_46_re, double x_46_im) {
	return ((x_46_re * x_46_im) * (2.0 * x_46_re)) + ((x_46_im * (x_46_re - x_46_im)) * (x_46_re + x_46_im));
}

Python

def code(x_46_re, x_46_im):
	return ((x_46_re * x_46_im) * (2.0 * x_46_re)) + ((x_46_im * (x_46_re - x_46_im)) * (x_46_re + x_46_im))

Julia

function code(x_46_re, x_46_im)
	return Float64(Float64(Float64(x_46_re * x_46_im) * Float64(2.0 * x_46_re)) + Float64(Float64(x_46_im * Float64(x_46_re - x_46_im)) * Float64(x_46_re + x_46_im)))
end

MATLAB

function tmp = code(x_46_re, x_46_im)
	tmp = ((x_46_re * x_46_im) * (2.0 * x_46_re)) + ((x_46_im * (x_46_re - x_46_im)) * (x_46_re + x_46_im));
end

Wolfram

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

Reproduce

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

  :alt
  (! :herbie-platform default (+ (* (* x.re x.im) (* 2 x.re)) (* (* x.im (- x.re x.im)) (+ x.re x.im))))

  (+ (* (- (* x.re x.re) (* x.im x.im)) x.im) (* (+ (* x.re x.im) (* x.im x.re)) x.re)))