math.cube on complex, imaginary part

Percentage Accurate: 82.5% → 99.8%

Time: 9.3s

Alternatives: 10

Speedup: 1.4×

• 44.9% 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.5% 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.re_m = \left|x.re\right| \\ 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 \cdot 10^{+100}:\\ \;\;\;\;x.re\_m \cdot \left(3 \cdot \left(x.im\_m \cdot x.re\_m\right)\right) - {x.im\_m}^{3}\\ \mathbf{else}:\\ \;\;\;\;x.im\_m \cdot \left(x.im\_m \cdot \left(x.re\_m - x.im\_m\right)\right) + -3\\ \end{array} \end{array} \]

FPCore

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

C

x.re_m = fabs(x_46_re);
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_m, double x_46_im_m) {
	double tmp;
	if (x_46_im_m <= 2e+100) {
		tmp = (x_46_re_m * (3.0 * (x_46_im_m * x_46_re_m))) - pow(x_46_im_m, 3.0);
	} else {
		tmp = (x_46_im_m * (x_46_im_m * (x_46_re_m - x_46_im_m))) + -3.0;
	}
	return x_46_im_s * tmp;
}

Fortran

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

Java

x.re_m = Math.abs(x_46_re);
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_m, double x_46_im_m) {
	double tmp;
	if (x_46_im_m <= 2e+100) {
		tmp = (x_46_re_m * (3.0 * (x_46_im_m * x_46_re_m))) - Math.pow(x_46_im_m, 3.0);
	} else {
		tmp = (x_46_im_m * (x_46_im_m * (x_46_re_m - x_46_im_m))) + -3.0;
	}
	return x_46_im_s * tmp;
}

Python

x.re_m = math.fabs(x_46_re)
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_m, x_46_im_m):
	tmp = 0
	if x_46_im_m <= 2e+100:
		tmp = (x_46_re_m * (3.0 * (x_46_im_m * x_46_re_m))) - math.pow(x_46_im_m, 3.0)
	else:
		tmp = (x_46_im_m * (x_46_im_m * (x_46_re_m - x_46_im_m))) + -3.0
	return x_46_im_s * tmp

Julia

x.re_m = abs(x_46_re)
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_m, x_46_im_m)
	tmp = 0.0
	if (x_46_im_m <= 2e+100)
		tmp = Float64(Float64(x_46_re_m * Float64(3.0 * Float64(x_46_im_m * x_46_re_m))) - (x_46_im_m ^ 3.0));
	else
		tmp = Float64(Float64(x_46_im_m * Float64(x_46_im_m * Float64(x_46_re_m - x_46_im_m))) + -3.0);
	end
	return Float64(x_46_im_s * tmp)
end

MATLAB

x.re_m = abs(x_46_re);
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_m, x_46_im_m)
	tmp = 0.0;
	if (x_46_im_m <= 2e+100)
		tmp = (x_46_re_m * (3.0 * (x_46_im_m * x_46_re_m))) - (x_46_im_m ^ 3.0);
	else
		tmp = (x_46_im_m * (x_46_im_m * (x_46_re_m - x_46_im_m))) + -3.0;
	end
	tmp_2 = x_46_im_s * tmp;
end

Wolfram

x.re_m = N[Abs[x$46$re], $MachinePrecision]
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$95$m_, x$46$im$95$m_] := N[(x$46$im$95$s * If[LessEqual[x$46$im$95$m, 2e+100], N[(N[(x$46$re$95$m * N[(3.0 * N[(x$46$im$95$m * x$46$re$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[Power[x$46$im$95$m, 3.0], $MachinePrecision]), $MachinePrecision], N[(N[(x$46$im$95$m * N[(x$46$im$95$m * N[(x$46$re$95$m - x$46$im$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -3.0), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x.im < 2.00000000000000003e100

   1. Initial program 83.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 \]

   3. Simplified 88.2%

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

   5. Taylor expanded in x.im around 0 88.2%

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

   if 2.00000000000000003e100 < x.im

   1. Initial program 63.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 70.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 \]

      2. *-commutative 70.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 70.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 \]

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

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

   6. Taylor expanded in x.re around 0 61.0%

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

   8. Simplified 90.2%

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

4. Final simplification 88.5%

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

Alternative 2: 99.7% accurate, 0.1× speedup

Math

\[\begin{array}{l} x.re_m = \left|x.re\right| \\ 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(x.re\_m \cdot x.re\_m - x.im\_m \cdot x.im\_m\right)\\ t_1 := t\_0 + x.re\_m \cdot \left(x.im\_m \cdot x.re\_m + x.im\_m \cdot x.re\_m\right)\\ x.im\_s \cdot \begin{array}{l} \mathbf{if}\;t\_1 \leq 10^{+136}:\\ \;\;\;\;t\_0 + x.re\_m \cdot \left(\left(x.im\_m \cdot x.re\_m\right) \cdot 2\right)\\ \mathbf{elif}\;t\_1 \leq \infty:\\ \;\;\;\;\mathsf{fma}\left(x.im\_m \cdot x.re\_m, x.re\_m \cdot 3, -1\right)\\ \mathbf{else}:\\ \;\;\;\;x.im\_m \cdot \left(x.im\_m \cdot \left(x.re\_m - x.im\_m\right)\right) + -3\\ \end{array} \end{array} \end{array} \]

FPCore

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

C

x.re_m = fabs(x_46_re);
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_m, double x_46_im_m) {
	double t_0 = x_46_im_m * ((x_46_re_m * x_46_re_m) - (x_46_im_m * x_46_im_m));
	double t_1 = t_0 + (x_46_re_m * ((x_46_im_m * x_46_re_m) + (x_46_im_m * x_46_re_m)));
	double tmp;
	if (t_1 <= 1e+136) {
		tmp = t_0 + (x_46_re_m * ((x_46_im_m * x_46_re_m) * 2.0));
	} else if (t_1 <= ((double) INFINITY)) {
		tmp = fma((x_46_im_m * x_46_re_m), (x_46_re_m * 3.0), -1.0);
	} else {
		tmp = (x_46_im_m * (x_46_im_m * (x_46_re_m - x_46_im_m))) + -3.0;
	}
	return x_46_im_s * tmp;
}

Julia

x.re_m = abs(x_46_re)
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_m, x_46_im_m)
	t_0 = Float64(x_46_im_m * Float64(Float64(x_46_re_m * x_46_re_m) - Float64(x_46_im_m * x_46_im_m)))
	t_1 = Float64(t_0 + Float64(x_46_re_m * Float64(Float64(x_46_im_m * x_46_re_m) + Float64(x_46_im_m * x_46_re_m))))
	tmp = 0.0
	if (t_1 <= 1e+136)
		tmp = Float64(t_0 + Float64(x_46_re_m * Float64(Float64(x_46_im_m * x_46_re_m) * 2.0)));
	elseif (t_1 <= Inf)
		tmp = fma(Float64(x_46_im_m * x_46_re_m), Float64(x_46_re_m * 3.0), -1.0);
	else
		tmp = Float64(Float64(x_46_im_m * Float64(x_46_im_m * Float64(x_46_re_m - x_46_im_m))) + -3.0);
	end
	return Float64(x_46_im_s * tmp)
end

Wolfram

x.re_m = N[Abs[x$46$re], $MachinePrecision]
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$95$m_, x$46$im$95$m_] := Block[{t$95$0 = N[(x$46$im$95$m * N[(N[(x$46$re$95$m * x$46$re$95$m), $MachinePrecision] - N[(x$46$im$95$m * x$46$im$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 + N[(x$46$re$95$m * N[(N[(x$46$im$95$m * x$46$re$95$m), $MachinePrecision] + N[(x$46$im$95$m * x$46$re$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(x$46$im$95$s * If[LessEqual[t$95$1, 1e+136], N[(t$95$0 + N[(x$46$re$95$m * N[(N[(x$46$im$95$m * x$46$re$95$m), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(N[(x$46$im$95$m * x$46$re$95$m), $MachinePrecision] * N[(x$46$re$95$m * 3.0), $MachinePrecision] + -1.0), $MachinePrecision], N[(N[(x$46$im$95$m * N[(x$46$im$95$m * N[(x$46$re$95$m - x$46$im$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -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)) < 1.00000000000000006e136

   1. Initial program 96.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 \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. *-commutative 96.1%

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

      2. count-2 96.1%

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

      3. *-commutative 96.1%

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

   4. Applied egg-rr 96.1%

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

   if 1.00000000000000006e136 < (+.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 85.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 94.0%

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

      1. associate-*r* 94.1%

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

      2. fma-neg 94.1%

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

   6. Applied egg-rr 94.1%

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

   7. Taylor expanded in x.im around 0 94.1%

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

   9. Simplified 48.0%

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

   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. Step-by-step derivation

      1. difference-of-squares 20.6%

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

      2. *-commutative 20.6%

         \[\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 20.6%

      \[\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. Taylor expanded in x.re around 0 14.7%

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

   6. Taylor expanded in x.re around 0 14.7%

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

   8. Simplified 94.1%

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

4. Final simplification 82.9%

   \[\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 10^{+136}:\\ \;\;\;\;x.im \cdot \left(x.re \cdot x.re - x.im \cdot x.im\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:\\ \;\;\;\;\mathsf{fma}\left(x.im \cdot x.re, x.re \cdot 3, -1\right)\\ \mathbf{else}:\\ \;\;\;\;x.im \cdot \left(x.im \cdot \left(x.re - x.im\right)\right) + -3\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 99.8% accurate, 0.3× speedup

Math

\[\begin{array}{l} x.re_m = \left|x.re\right| \\ 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(x.re\_m \cdot x.re\_m - x.im\_m \cdot x.im\_m\right)\\ t_1 := t\_0 + x.re\_m \cdot \left(x.im\_m \cdot x.re\_m + x.im\_m \cdot x.re\_m\right)\\ x.im\_s \cdot \begin{array}{l} \mathbf{if}\;t\_1 \leq 4 \cdot 10^{+179}:\\ \;\;\;\;t\_0 + x.re\_m \cdot \left(\left(x.im\_m \cdot x.re\_m\right) \cdot 2\right)\\ \mathbf{elif}\;t\_1 \leq \infty:\\ \;\;\;\;-1 + x.re\_m \cdot \left(x.im\_m \cdot \left(x.re\_m \cdot 3\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x.im\_m \cdot \left(x.im\_m \cdot \left(x.re\_m - x.im\_m\right)\right) + -3\\ \end{array} \end{array} \end{array} \]

FPCore

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

C

x.re_m = fabs(x_46_re);
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_m, double x_46_im_m) {
	double t_0 = x_46_im_m * ((x_46_re_m * x_46_re_m) - (x_46_im_m * x_46_im_m));
	double t_1 = t_0 + (x_46_re_m * ((x_46_im_m * x_46_re_m) + (x_46_im_m * x_46_re_m)));
	double tmp;
	if (t_1 <= 4e+179) {
		tmp = t_0 + (x_46_re_m * ((x_46_im_m * x_46_re_m) * 2.0));
	} else if (t_1 <= ((double) INFINITY)) {
		tmp = -1.0 + (x_46_re_m * (x_46_im_m * (x_46_re_m * 3.0)));
	} else {
		tmp = (x_46_im_m * (x_46_im_m * (x_46_re_m - x_46_im_m))) + -3.0;
	}
	return x_46_im_s * tmp;
}

Java

x.re_m = Math.abs(x_46_re);
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_m, double x_46_im_m) {
	double t_0 = x_46_im_m * ((x_46_re_m * x_46_re_m) - (x_46_im_m * x_46_im_m));
	double t_1 = t_0 + (x_46_re_m * ((x_46_im_m * x_46_re_m) + (x_46_im_m * x_46_re_m)));
	double tmp;
	if (t_1 <= 4e+179) {
		tmp = t_0 + (x_46_re_m * ((x_46_im_m * x_46_re_m) * 2.0));
	} else if (t_1 <= Double.POSITIVE_INFINITY) {
		tmp = -1.0 + (x_46_re_m * (x_46_im_m * (x_46_re_m * 3.0)));
	} else {
		tmp = (x_46_im_m * (x_46_im_m * (x_46_re_m - x_46_im_m))) + -3.0;
	}
	return x_46_im_s * tmp;
}

Python

x.re_m = math.fabs(x_46_re)
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_m, x_46_im_m):
	t_0 = x_46_im_m * ((x_46_re_m * x_46_re_m) - (x_46_im_m * x_46_im_m))
	t_1 = t_0 + (x_46_re_m * ((x_46_im_m * x_46_re_m) + (x_46_im_m * x_46_re_m)))
	tmp = 0
	if t_1 <= 4e+179:
		tmp = t_0 + (x_46_re_m * ((x_46_im_m * x_46_re_m) * 2.0))
	elif t_1 <= math.inf:
		tmp = -1.0 + (x_46_re_m * (x_46_im_m * (x_46_re_m * 3.0)))
	else:
		tmp = (x_46_im_m * (x_46_im_m * (x_46_re_m - x_46_im_m))) + -3.0
	return x_46_im_s * tmp

Julia

x.re_m = abs(x_46_re)
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_m, x_46_im_m)
	t_0 = Float64(x_46_im_m * Float64(Float64(x_46_re_m * x_46_re_m) - Float64(x_46_im_m * x_46_im_m)))
	t_1 = Float64(t_0 + Float64(x_46_re_m * Float64(Float64(x_46_im_m * x_46_re_m) + Float64(x_46_im_m * x_46_re_m))))
	tmp = 0.0
	if (t_1 <= 4e+179)
		tmp = Float64(t_0 + Float64(x_46_re_m * Float64(Float64(x_46_im_m * x_46_re_m) * 2.0)));
	elseif (t_1 <= Inf)
		tmp = Float64(-1.0 + Float64(x_46_re_m * Float64(x_46_im_m * Float64(x_46_re_m * 3.0))));
	else
		tmp = Float64(Float64(x_46_im_m * Float64(x_46_im_m * Float64(x_46_re_m - x_46_im_m))) + -3.0);
	end
	return Float64(x_46_im_s * tmp)
end

MATLAB

x.re_m = abs(x_46_re);
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_m, x_46_im_m)
	t_0 = x_46_im_m * ((x_46_re_m * x_46_re_m) - (x_46_im_m * x_46_im_m));
	t_1 = t_0 + (x_46_re_m * ((x_46_im_m * x_46_re_m) + (x_46_im_m * x_46_re_m)));
	tmp = 0.0;
	if (t_1 <= 4e+179)
		tmp = t_0 + (x_46_re_m * ((x_46_im_m * x_46_re_m) * 2.0));
	elseif (t_1 <= Inf)
		tmp = -1.0 + (x_46_re_m * (x_46_im_m * (x_46_re_m * 3.0)));
	else
		tmp = (x_46_im_m * (x_46_im_m * (x_46_re_m - x_46_im_m))) + -3.0;
	end
	tmp_2 = x_46_im_s * tmp;
end

Wolfram

x.re_m = N[Abs[x$46$re], $MachinePrecision]
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$95$m_, x$46$im$95$m_] := Block[{t$95$0 = N[(x$46$im$95$m * N[(N[(x$46$re$95$m * x$46$re$95$m), $MachinePrecision] - N[(x$46$im$95$m * x$46$im$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 + N[(x$46$re$95$m * N[(N[(x$46$im$95$m * x$46$re$95$m), $MachinePrecision] + N[(x$46$im$95$m * x$46$re$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(x$46$im$95$s * If[LessEqual[t$95$1, 4e+179], N[(t$95$0 + N[(x$46$re$95$m * N[(N[(x$46$im$95$m * x$46$re$95$m), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(-1.0 + N[(x$46$re$95$m * N[(x$46$im$95$m * N[(x$46$re$95$m * 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x$46$im$95$m * N[(x$46$im$95$m * N[(x$46$re$95$m - x$46$im$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -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)) < 3.99999999999999992e179

   1. Initial program 96.2%

      \[\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. *-commutative 96.2%

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

      2. count-2 96.2%

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

      3. *-commutative 96.2%

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

   4. Applied egg-rr 96.2%

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

   if 3.99999999999999992e179 < (+.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 84.2%

      \[\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 93.7%

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

      1. associate-*r* 93.7%

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

      2. fma-neg 93.7%

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

   6. Applied egg-rr 93.7%

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

   7. Taylor expanded in x.im around 0 93.7%

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

   9. Simplified 46.3%

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

       1. fma-undefine 46.3%

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

       2. associate-*l* 46.3%

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

   11. Applied egg-rr 46.3%

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

   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. Step-by-step derivation

      1. difference-of-squares 20.6%

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

      2. *-commutative 20.6%

         \[\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 20.6%

      \[\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. Taylor expanded in x.re around 0 14.7%

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

   6. Taylor expanded in x.re around 0 14.7%

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

   8. Simplified 94.1%

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

4. Final simplification 83.3%

   \[\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 4 \cdot 10^{+179}:\\ \;\;\;\;x.im \cdot \left(x.re \cdot x.re - x.im \cdot x.im\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:\\ \;\;\;\;-1 + x.re \cdot \left(x.im \cdot \left(x.re \cdot 3\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x.im \cdot \left(x.im \cdot \left(x.re - x.im\right)\right) + -3\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 87.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} x.re_m = \left|x.re\right| \\ 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(x.im\_m \cdot \left(x.re\_m - x.im\_m\right)\right)\\ x.im\_s \cdot \begin{array}{l} \mathbf{if}\;x.im\_m \leq 4.2 \cdot 10^{-104}:\\ \;\;\;\;3 \cdot \left(x.im\_m \cdot \left(x.re\_m \cdot x.re\_m\right)\right)\\ \mathbf{elif}\;x.im\_m \leq 2 \cdot 10^{+90}:\\ \;\;\;\;t\_0 + x.re\_m \cdot \left(\left(x.im\_m \cdot x.re\_m\right) \cdot 2\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0 + -3\\ \end{array} \end{array} \end{array} \]

FPCore

x.re_m = (fabs.f64 x.re)
x.im\_m = (fabs.f64 x.im)
x.im\_s = (copysign.f64 #s(literal 1 binary64) x.im)
(FPCore (x.im_s x.re_m x.im_m)
 :precision binary64
 (let* ((t_0 (* x.im_m (* x.im_m (- x.re_m x.im_m)))))
   (*
    x.im_s
    (if (<= x.im_m 4.2e-104)
      (* 3.0 (* x.im_m (* x.re_m x.re_m)))
      (if (<= x.im_m 2e+90)
        (+ t_0 (* x.re_m (* (* x.im_m x.re_m) 2.0)))
        (+ t_0 -3.0))))))

C

x.re_m = fabs(x_46_re);
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_m, double x_46_im_m) {
	double t_0 = x_46_im_m * (x_46_im_m * (x_46_re_m - x_46_im_m));
	double tmp;
	if (x_46_im_m <= 4.2e-104) {
		tmp = 3.0 * (x_46_im_m * (x_46_re_m * x_46_re_m));
	} else if (x_46_im_m <= 2e+90) {
		tmp = t_0 + (x_46_re_m * ((x_46_im_m * x_46_re_m) * 2.0));
	} else {
		tmp = t_0 + -3.0;
	}
	return x_46_im_s * tmp;
}

Fortran

x.re_m = abs(x_46re)
x.im\_m = abs(x_46im)
x.im\_s = copysign(1.0d0, x_46im)
real(8) function code(x_46im_s, x_46re_m, x_46im_m)
    real(8), intent (in) :: x_46im_s
    real(8), intent (in) :: x_46re_m
    real(8), intent (in) :: x_46im_m
    real(8) :: t_0
    real(8) :: tmp
    t_0 = x_46im_m * (x_46im_m * (x_46re_m - x_46im_m))
    if (x_46im_m <= 4.2d-104) then
        tmp = 3.0d0 * (x_46im_m * (x_46re_m * x_46re_m))
    else if (x_46im_m <= 2d+90) then
        tmp = t_0 + (x_46re_m * ((x_46im_m * x_46re_m) * 2.0d0))
    else
        tmp = t_0 + (-3.0d0)
    end if
    code = x_46im_s * tmp
end function

Java

x.re_m = Math.abs(x_46_re);
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_m, double x_46_im_m) {
	double t_0 = x_46_im_m * (x_46_im_m * (x_46_re_m - x_46_im_m));
	double tmp;
	if (x_46_im_m <= 4.2e-104) {
		tmp = 3.0 * (x_46_im_m * (x_46_re_m * x_46_re_m));
	} else if (x_46_im_m <= 2e+90) {
		tmp = t_0 + (x_46_re_m * ((x_46_im_m * x_46_re_m) * 2.0));
	} else {
		tmp = t_0 + -3.0;
	}
	return x_46_im_s * tmp;
}

Python

x.re_m = math.fabs(x_46_re)
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_m, x_46_im_m):
	t_0 = x_46_im_m * (x_46_im_m * (x_46_re_m - x_46_im_m))
	tmp = 0
	if x_46_im_m <= 4.2e-104:
		tmp = 3.0 * (x_46_im_m * (x_46_re_m * x_46_re_m))
	elif x_46_im_m <= 2e+90:
		tmp = t_0 + (x_46_re_m * ((x_46_im_m * x_46_re_m) * 2.0))
	else:
		tmp = t_0 + -3.0
	return x_46_im_s * tmp

Julia

x.re_m = abs(x_46_re)
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_m, x_46_im_m)
	t_0 = Float64(x_46_im_m * Float64(x_46_im_m * Float64(x_46_re_m - x_46_im_m)))
	tmp = 0.0
	if (x_46_im_m <= 4.2e-104)
		tmp = Float64(3.0 * Float64(x_46_im_m * Float64(x_46_re_m * x_46_re_m)));
	elseif (x_46_im_m <= 2e+90)
		tmp = Float64(t_0 + Float64(x_46_re_m * Float64(Float64(x_46_im_m * x_46_re_m) * 2.0)));
	else
		tmp = Float64(t_0 + -3.0);
	end
	return Float64(x_46_im_s * tmp)
end

MATLAB

x.re_m = abs(x_46_re);
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_m, x_46_im_m)
	t_0 = x_46_im_m * (x_46_im_m * (x_46_re_m - x_46_im_m));
	tmp = 0.0;
	if (x_46_im_m <= 4.2e-104)
		tmp = 3.0 * (x_46_im_m * (x_46_re_m * x_46_re_m));
	elseif (x_46_im_m <= 2e+90)
		tmp = t_0 + (x_46_re_m * ((x_46_im_m * x_46_re_m) * 2.0));
	else
		tmp = t_0 + -3.0;
	end
	tmp_2 = x_46_im_s * tmp;
end

Wolfram

x.re_m = N[Abs[x$46$re], $MachinePrecision]
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$95$m_, x$46$im$95$m_] := Block[{t$95$0 = N[(x$46$im$95$m * N[(x$46$im$95$m * N[(x$46$re$95$m - x$46$im$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(x$46$im$95$s * If[LessEqual[x$46$im$95$m, 4.2e-104], N[(3.0 * N[(x$46$im$95$m * N[(x$46$re$95$m * x$46$re$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x$46$im$95$m, 2e+90], N[(t$95$0 + N[(x$46$re$95$m * N[(N[(x$46$im$95$m * x$46$re$95$m), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 + -3.0), $MachinePrecision]]]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if x.im < 4.19999999999999997e-104

   1. Initial program 80.7%

      \[\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 85.4%

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

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

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

      1. pow2 56.8%

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

   7. Applied egg-rr 56.8%

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

   if 4.19999999999999997e-104 < x.im < 1.99999999999999993e90

   1. Initial program 95.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 95.4%

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

      2. *-commutative 95.4%

         \[\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 95.4%

      \[\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. Taylor expanded in x.re around 0 68.8%

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

      1. *-commutative 95.4%

         \[\leadsto \left(x.re \cdot x.re - x.im \cdot x.im\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.4%

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

      3. *-commutative 95.4%

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

   7. Applied egg-rr 68.8%

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

   if 1.99999999999999993e90 < x.im

   1. Initial program 63.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 70.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 \]

      2. *-commutative 70.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 70.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 \]

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

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

   6. Taylor expanded in x.re around 0 61.0%

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

   8. Simplified 90.2%

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

4. Final simplification 64.1%

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

Alternative 5: 82.7% accurate, 1.4× speedup

Math

\[\begin{array}{l} x.re_m = \left|x.re\right| \\ 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.6 \cdot 10^{+31}:\\ \;\;\;\;3 \cdot \left(x.im\_m \cdot \left(x.re\_m \cdot x.re\_m\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x.im\_m \cdot \left(x.im\_m \cdot \left(x.re\_m - x.im\_m\right)\right) + -3\\ \end{array} \end{array} \]

FPCore

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

C

x.re_m = fabs(x_46_re);
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_m, double x_46_im_m) {
	double tmp;
	if (x_46_im_m <= 2.6e+31) {
		tmp = 3.0 * (x_46_im_m * (x_46_re_m * x_46_re_m));
	} else {
		tmp = (x_46_im_m * (x_46_im_m * (x_46_re_m - x_46_im_m))) + -3.0;
	}
	return x_46_im_s * tmp;
}

Fortran

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

Java

x.re_m = Math.abs(x_46_re);
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_m, double x_46_im_m) {
	double tmp;
	if (x_46_im_m <= 2.6e+31) {
		tmp = 3.0 * (x_46_im_m * (x_46_re_m * x_46_re_m));
	} else {
		tmp = (x_46_im_m * (x_46_im_m * (x_46_re_m - x_46_im_m))) + -3.0;
	}
	return x_46_im_s * tmp;
}

Python

x.re_m = math.fabs(x_46_re)
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_m, x_46_im_m):
	tmp = 0
	if x_46_im_m <= 2.6e+31:
		tmp = 3.0 * (x_46_im_m * (x_46_re_m * x_46_re_m))
	else:
		tmp = (x_46_im_m * (x_46_im_m * (x_46_re_m - x_46_im_m))) + -3.0
	return x_46_im_s * tmp

Julia

x.re_m = abs(x_46_re)
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_m, x_46_im_m)
	tmp = 0.0
	if (x_46_im_m <= 2.6e+31)
		tmp = Float64(3.0 * Float64(x_46_im_m * Float64(x_46_re_m * x_46_re_m)));
	else
		tmp = Float64(Float64(x_46_im_m * Float64(x_46_im_m * Float64(x_46_re_m - x_46_im_m))) + -3.0);
	end
	return Float64(x_46_im_s * tmp)
end

MATLAB

x.re_m = abs(x_46_re);
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_m, x_46_im_m)
	tmp = 0.0;
	if (x_46_im_m <= 2.6e+31)
		tmp = 3.0 * (x_46_im_m * (x_46_re_m * x_46_re_m));
	else
		tmp = (x_46_im_m * (x_46_im_m * (x_46_re_m - x_46_im_m))) + -3.0;
	end
	tmp_2 = x_46_im_s * tmp;
end

Wolfram

x.re_m = N[Abs[x$46$re], $MachinePrecision]
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$95$m_, x$46$im$95$m_] := N[(x$46$im$95$s * If[LessEqual[x$46$im$95$m, 2.6e+31], N[(3.0 * N[(x$46$im$95$m * N[(x$46$re$95$m * x$46$re$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x$46$im$95$m * N[(x$46$im$95$m * N[(x$46$re$95$m - x$46$im$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -3.0), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x.im < 2.6e31

   1. Initial program 82.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 \]

   3. Simplified 87.5%

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

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

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

      1. pow2 58.5%

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

   7. Applied egg-rr 58.5%

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

   if 2.6e31 < x.im

   1. Initial program 71.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. 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 \]

      2. *-commutative 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 \]

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

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

   6. Taylor expanded in x.re around 0 64.8%

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

   8. Simplified 85.7%

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

4. Final simplification 64.1%

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

Alternative 6: 62.9% accurate, 1.6× speedup

Math

\[\begin{array}{l} x.re_m = \left|x.re\right| \\ 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.26 \cdot 10^{+163}:\\ \;\;\;\;3 \cdot \left(x.im\_m \cdot \left(x.re\_m \cdot x.re\_m\right)\right)\\ \mathbf{else}:\\ \;\;\;\;-1 - x.im\_m \cdot \left(x.im\_m \cdot x.re\_m\right)\\ \end{array} \end{array} \]

FPCore

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

C

x.re_m = fabs(x_46_re);
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_m, double x_46_im_m) {
	double tmp;
	if (x_46_im_m <= 1.26e+163) {
		tmp = 3.0 * (x_46_im_m * (x_46_re_m * x_46_re_m));
	} else {
		tmp = -1.0 - (x_46_im_m * (x_46_im_m * x_46_re_m));
	}
	return x_46_im_s * tmp;
}

Fortran

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

Java

x.re_m = Math.abs(x_46_re);
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_m, double x_46_im_m) {
	double tmp;
	if (x_46_im_m <= 1.26e+163) {
		tmp = 3.0 * (x_46_im_m * (x_46_re_m * x_46_re_m));
	} else {
		tmp = -1.0 - (x_46_im_m * (x_46_im_m * x_46_re_m));
	}
	return x_46_im_s * tmp;
}

Python

x.re_m = math.fabs(x_46_re)
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_m, x_46_im_m):
	tmp = 0
	if x_46_im_m <= 1.26e+163:
		tmp = 3.0 * (x_46_im_m * (x_46_re_m * x_46_re_m))
	else:
		tmp = -1.0 - (x_46_im_m * (x_46_im_m * x_46_re_m))
	return x_46_im_s * tmp

Julia

x.re_m = abs(x_46_re)
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_m, x_46_im_m)
	tmp = 0.0
	if (x_46_im_m <= 1.26e+163)
		tmp = Float64(3.0 * Float64(x_46_im_m * Float64(x_46_re_m * x_46_re_m)));
	else
		tmp = Float64(-1.0 - Float64(x_46_im_m * Float64(x_46_im_m * x_46_re_m)));
	end
	return Float64(x_46_im_s * tmp)
end

MATLAB

x.re_m = abs(x_46_re);
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_m, x_46_im_m)
	tmp = 0.0;
	if (x_46_im_m <= 1.26e+163)
		tmp = 3.0 * (x_46_im_m * (x_46_re_m * x_46_re_m));
	else
		tmp = -1.0 - (x_46_im_m * (x_46_im_m * x_46_re_m));
	end
	tmp_2 = x_46_im_s * tmp;
end

Wolfram

x.re_m = N[Abs[x$46$re], $MachinePrecision]
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$95$m_, x$46$im$95$m_] := N[(x$46$im$95$s * If[LessEqual[x$46$im$95$m, 1.26e+163], N[(3.0 * N[(x$46$im$95$m * N[(x$46$re$95$m * x$46$re$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 - N[(x$46$im$95$m * N[(x$46$im$95$m * x$46$re$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x.im < 1.26e163

   1. Initial program 83.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 \]

   3. Simplified 86.2%

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

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

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

      1. pow2 55.9%

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

   7. Applied egg-rr 55.9%

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

   if 1.26e163 < x.im

   1. Initial program 55.2%

      \[\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 65.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 \]

      2. *-commutative 65.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 \]

   4. Applied egg-rr 65.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. Taylor expanded in x.re around 0 89.7%

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

   7. Simplified 28.6%

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

4. Final simplification 52.8%

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

Alternative 7: 50.7% accurate, 2.7× speedup

Math

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

FPCore

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

C

x.re_m = fabs(x_46_re);
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_m, double x_46_im_m) {
	return x_46_im_s * (3.0 * (x_46_im_m * (x_46_re_m * x_46_re_m)));
}

Fortran

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

Java

x.re_m = Math.abs(x_46_re);
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_m, double x_46_im_m) {
	return x_46_im_s * (3.0 * (x_46_im_m * (x_46_re_m * x_46_re_m)));
}

Python

x.re_m = math.fabs(x_46_re)
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_m, x_46_im_m):
	return x_46_im_s * (3.0 * (x_46_im_m * (x_46_re_m * x_46_re_m)))

Julia

x.re_m = abs(x_46_re)
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_m, x_46_im_m)
	return Float64(x_46_im_s * Float64(3.0 * Float64(x_46_im_m * Float64(x_46_re_m * x_46_re_m))))
end

MATLAB

x.re_m = abs(x_46_re);
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_m, x_46_im_m)
	tmp = x_46_im_s * (3.0 * (x_46_im_m * (x_46_re_m * x_46_re_m)));
end

Wolfram

x.re_m = N[Abs[x$46$re], $MachinePrecision]
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$95$m_, x$46$im$95$m_] := N[(x$46$im$95$s * N[(3.0 * N[(x$46$im$95$m * N[(x$46$re$95$m * x$46$re$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 80.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 82.6%

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

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

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

   1. pow2 50.8%

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

7. Applied egg-rr 50.8%

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

Alternative 8: 2.7% accurate, 19.0× speedup

Math

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

FPCore

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

C

x.re_m = fabs(x_46_re);
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_m, double x_46_im_m) {
	return x_46_im_s * 10.0;
}

Fortran

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

Java

x.re_m = Math.abs(x_46_re);
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_m, double x_46_im_m) {
	return x_46_im_s * 10.0;
}

Python

x.re_m = math.fabs(x_46_re)
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_m, x_46_im_m):
	return x_46_im_s * 10.0

Julia

x.re_m = abs(x_46_re)
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_m, x_46_im_m)
	return Float64(x_46_im_s * 10.0)
end

MATLAB

x.re_m = abs(x_46_re);
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_m, x_46_im_m)
	tmp = x_46_im_s * 10.0;
end

Wolfram

x.re_m = N[Abs[x$46$re], $MachinePrecision]
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$95$m_, x$46$im$95$m_] := N[(x$46$im$95$s * 10.0), $MachinePrecision]

Derivation

1. Initial program 80.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 82.6%

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

   1. sub-neg 82.6%

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

   2. flip-+ 20.8%

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

6. Applied egg-rr 12.7%

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

8. Simplified 2.8%

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

Alternative 9: 2.7% accurate, 19.0× speedup

Math

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

FPCore

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

C

x.re_m = fabs(x_46_re);
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_m, double x_46_im_m) {
	return x_46_im_s * 0.1;
}

Fortran

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

Java

x.re_m = Math.abs(x_46_re);
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_m, double x_46_im_m) {
	return x_46_im_s * 0.1;
}

Python

x.re_m = math.fabs(x_46_re)
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_m, x_46_im_m):
	return x_46_im_s * 0.1

Julia

x.re_m = abs(x_46_re)
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_m, x_46_im_m)
	return Float64(x_46_im_s * 0.1)
end

MATLAB

x.re_m = abs(x_46_re);
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_m, x_46_im_m)
	tmp = x_46_im_s * 0.1;
end

Wolfram

x.re_m = N[Abs[x$46$re], $MachinePrecision]
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$95$m_, x$46$im$95$m_] := N[(x$46$im$95$s * 0.1), $MachinePrecision]

Derivation

1. Initial program 80.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 82.6%

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

   1. sub-neg 82.6%

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

   2. flip3-+ 12.7%

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

   3. associate-*r* 12.6%

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

   4. *-commutative 12.6%

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

   5. associate-*l* 12.6%

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

   6. associate-*r* 12.2%

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

   7. associate-*l* 12.2%

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

   8. pow2 12.2%

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

6. Applied egg-rr 8.2%

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

8. Simplified 2.8%

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

Alternative 10: 2.7% accurate, 19.0× speedup

Math

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

FPCore

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

C

x.re_m = fabs(x_46_re);
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_m, double x_46_im_m) {
	return x_46_im_s * -3.0;
}

Fortran

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

Java

x.re_m = Math.abs(x_46_re);
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_m, double x_46_im_m) {
	return x_46_im_s * -3.0;
}

Python

x.re_m = math.fabs(x_46_re)
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_m, x_46_im_m):
	return x_46_im_s * -3.0

Julia

x.re_m = abs(x_46_re)
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_m, x_46_im_m)
	return Float64(x_46_im_s * -3.0)
end

MATLAB

x.re_m = abs(x_46_re);
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_m, x_46_im_m)
	tmp = x_46_im_s * -3.0;
end

Wolfram

x.re_m = N[Abs[x$46$re], $MachinePrecision]
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$95$m_, x$46$im$95$m_] := N[(x$46$im$95$s * -3.0), $MachinePrecision]

Derivation

1. Initial program 80.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. Taylor expanded in x.re around 0 80.4%

   \[\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 54.2%

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

6. Taylor expanded in x.im around 0 2.5%

   \[\leadsto \color{blue}{-3} \]
7. Add Preprocessing

Developer Target 1: 91.5% 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 2024136 
(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)))