math.cube on complex, real part

Percentage Accurate: 82.3% → 99.8%

Time: 8.6s

Alternatives: 8

Speedup: 1.4×

• 44.5% 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.re - \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.im \end{array} \]

FPCore

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

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_re) - (((x_46_re * x_46_im) + (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_46re) - (x_46im * x_46im)) * x_46re) - (((x_46re * x_46im) + (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_re) - (x_46_im * x_46_im)) * x_46_re) - (((x_46_re * x_46_im) + (x_46_im * x_46_re)) * x_46_im);
}

Python

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

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_re) - Float64(Float64(Float64(x_46_re * x_46_im) + Float64(x_46_im * x_46_re)) * x_46_im))
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_re) - (((x_46_re * x_46_im) + (x_46_im * x_46_re)) * x_46_im);
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$re), $MachinePrecision] - N[(N[(N[(x$46$re * x$46$im), $MachinePrecision] + N[(x$46$im * x$46$re), $MachinePrecision]), $MachinePrecision] * x$46$im), $MachinePrecision]), $MachinePrecision]

Initial Program: 82.3% accurate, 1.0× speedup

Math

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

FPCore

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

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_re) - (((x_46_re * x_46_im) + (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_46re) - (x_46im * x_46im)) * x_46re) - (((x_46re * x_46im) + (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_re) - (x_46_im * x_46_im)) * x_46_re) - (((x_46_re * x_46_im) + (x_46_im * x_46_re)) * x_46_im);
}

Python

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

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_re) - Float64(Float64(Float64(x_46_re * x_46_im) + Float64(x_46_im * x_46_re)) * x_46_im))
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_re) - (((x_46_re * x_46_im) + (x_46_im * x_46_re)) * x_46_im);
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$re), $MachinePrecision] - N[(N[(N[(x$46$re * x$46$im), $MachinePrecision] + N[(x$46$im * x$46$re), $MachinePrecision]), $MachinePrecision] * x$46$im), $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.8% accurate, 0.1× speedup

Math

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

FPCore

x.re\_m = (fabs.f64 x.re)
x.re\_s = (copysign.f64 #s(literal 1 binary64) x.re)
(FPCore (x.re_s x.re_m x.im)
 :precision binary64
 (*
  x.re_s
  (if (<= x.re_m 5e+91)
    (-
     (+
      (* x.im (- (* x.re_m (- x.re_m x.re_m)) (* x.re_m x.im)))
      (pow x.re_m 3.0))
     (* x.im (* (* x.re_m x.im) 2.0)))
    (* (- x.re_m x.im) (* x.re_m (+ x.re_m x.im))))))

C

x.re\_m = fabs(x_46_re);
x.re\_s = copysign(1.0, x_46_re);
double code(double x_46_re_s, double x_46_re_m, double x_46_im) {
	double tmp;
	if (x_46_re_m <= 5e+91) {
		tmp = ((x_46_im * ((x_46_re_m * (x_46_re_m - x_46_re_m)) - (x_46_re_m * x_46_im))) + pow(x_46_re_m, 3.0)) - (x_46_im * ((x_46_re_m * x_46_im) * 2.0));
	} else {
		tmp = (x_46_re_m - x_46_im) * (x_46_re_m * (x_46_re_m + x_46_im));
	}
	return x_46_re_s * tmp;
}

Fortran

x.re\_m = abs(x_46re)
x.re\_s = copysign(1.0d0, x_46re)
real(8) function code(x_46re_s, x_46re_m, x_46im)
    real(8), intent (in) :: x_46re_s
    real(8), intent (in) :: x_46re_m
    real(8), intent (in) :: x_46im
    real(8) :: tmp
    if (x_46re_m <= 5d+91) then
        tmp = ((x_46im * ((x_46re_m * (x_46re_m - x_46re_m)) - (x_46re_m * x_46im))) + (x_46re_m ** 3.0d0)) - (x_46im * ((x_46re_m * x_46im) * 2.0d0))
    else
        tmp = (x_46re_m - x_46im) * (x_46re_m * (x_46re_m + x_46im))
    end if
    code = x_46re_s * tmp
end function

Java

x.re\_m = Math.abs(x_46_re);
x.re\_s = Math.copySign(1.0, x_46_re);
public static double code(double x_46_re_s, double x_46_re_m, double x_46_im) {
	double tmp;
	if (x_46_re_m <= 5e+91) {
		tmp = ((x_46_im * ((x_46_re_m * (x_46_re_m - x_46_re_m)) - (x_46_re_m * x_46_im))) + Math.pow(x_46_re_m, 3.0)) - (x_46_im * ((x_46_re_m * x_46_im) * 2.0));
	} else {
		tmp = (x_46_re_m - x_46_im) * (x_46_re_m * (x_46_re_m + x_46_im));
	}
	return x_46_re_s * tmp;
}

Python

x.re\_m = math.fabs(x_46_re)
x.re\_s = math.copysign(1.0, x_46_re)
def code(x_46_re_s, x_46_re_m, x_46_im):
	tmp = 0
	if x_46_re_m <= 5e+91:
		tmp = ((x_46_im * ((x_46_re_m * (x_46_re_m - x_46_re_m)) - (x_46_re_m * x_46_im))) + math.pow(x_46_re_m, 3.0)) - (x_46_im * ((x_46_re_m * x_46_im) * 2.0))
	else:
		tmp = (x_46_re_m - x_46_im) * (x_46_re_m * (x_46_re_m + x_46_im))
	return x_46_re_s * tmp

Julia

x.re\_m = abs(x_46_re)
x.re\_s = copysign(1.0, x_46_re)
function code(x_46_re_s, x_46_re_m, x_46_im)
	tmp = 0.0
	if (x_46_re_m <= 5e+91)
		tmp = Float64(Float64(Float64(x_46_im * Float64(Float64(x_46_re_m * Float64(x_46_re_m - x_46_re_m)) - Float64(x_46_re_m * x_46_im))) + (x_46_re_m ^ 3.0)) - Float64(x_46_im * Float64(Float64(x_46_re_m * x_46_im) * 2.0)));
	else
		tmp = Float64(Float64(x_46_re_m - x_46_im) * Float64(x_46_re_m * Float64(x_46_re_m + x_46_im)));
	end
	return Float64(x_46_re_s * tmp)
end

MATLAB

x.re\_m = abs(x_46_re);
x.re\_s = sign(x_46_re) * abs(1.0);
function tmp_2 = code(x_46_re_s, x_46_re_m, x_46_im)
	tmp = 0.0;
	if (x_46_re_m <= 5e+91)
		tmp = ((x_46_im * ((x_46_re_m * (x_46_re_m - x_46_re_m)) - (x_46_re_m * x_46_im))) + (x_46_re_m ^ 3.0)) - (x_46_im * ((x_46_re_m * x_46_im) * 2.0));
	else
		tmp = (x_46_re_m - x_46_im) * (x_46_re_m * (x_46_re_m + x_46_im));
	end
	tmp_2 = x_46_re_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x.re < 5.0000000000000002e91

   1. Initial program 87.4%

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

      1. difference-of-squares 89.9%

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

      2. *-commutative 89.9%

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

   4. Applied egg-rr 89.9%

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

      1. *-commutative 89.9%

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

      2. *-un-lft-identity 89.9%

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

      3. distribute-lft-in 89.9%

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

      4. distribute-rgt-out 89.9%

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

      5. metadata-eval 89.9%

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

   6. Applied egg-rr 89.9%

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

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

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

   if 5.0000000000000002e91 < x.re

   1. Initial program 77.4%

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

      1. difference-of-squares 81.1%

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

      2. *-commutative 81.1%

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

   4. Applied egg-rr 81.1%

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

      1. *-commutative 81.1%

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

      2. *-un-lft-identity 81.1%

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

      3. distribute-lft-in 81.1%

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

      4. distribute-rgt-out 81.1%

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

      5. metadata-eval 81.1%

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

   6. Applied egg-rr 81.1%

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

   8. Applied egg-rr 100.0%

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

      1. fma-undefine 100.0%

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

      2. +-rgt-identity 100.0%

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

      3. *-commutative 100.0%

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

   10. Applied egg-rr 100.0%

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

4. Final simplification 94.8%

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

Alternative 2: 99.8% accurate, 0.2× speedup

Math

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

FPCore

x.re\_m = (fabs.f64 x.re)
x.re\_s = (copysign.f64 #s(literal 1 binary64) x.re)
(FPCore (x.re_s x.re_m x.im)
 :precision binary64
 (*
  x.re_s
  (if (<= x.re_m 1.55e+92)
    (+
     (pow x.re_m 3.0)
     (*
      x.im
      (- (* x.re_m (- x.re_m x.re_m)) (* x.im (+ x.re_m (* x.re_m 2.0))))))
    (* (- x.re_m x.im) (* x.re_m (+ x.re_m x.im))))))

C

x.re\_m = fabs(x_46_re);
x.re\_s = copysign(1.0, x_46_re);
double code(double x_46_re_s, double x_46_re_m, double x_46_im) {
	double tmp;
	if (x_46_re_m <= 1.55e+92) {
		tmp = pow(x_46_re_m, 3.0) + (x_46_im * ((x_46_re_m * (x_46_re_m - x_46_re_m)) - (x_46_im * (x_46_re_m + (x_46_re_m * 2.0)))));
	} else {
		tmp = (x_46_re_m - x_46_im) * (x_46_re_m * (x_46_re_m + x_46_im));
	}
	return x_46_re_s * tmp;
}

Fortran

x.re\_m = abs(x_46re)
x.re\_s = copysign(1.0d0, x_46re)
real(8) function code(x_46re_s, x_46re_m, x_46im)
    real(8), intent (in) :: x_46re_s
    real(8), intent (in) :: x_46re_m
    real(8), intent (in) :: x_46im
    real(8) :: tmp
    if (x_46re_m <= 1.55d+92) then
        tmp = (x_46re_m ** 3.0d0) + (x_46im * ((x_46re_m * (x_46re_m - x_46re_m)) - (x_46im * (x_46re_m + (x_46re_m * 2.0d0)))))
    else
        tmp = (x_46re_m - x_46im) * (x_46re_m * (x_46re_m + x_46im))
    end if
    code = x_46re_s * tmp
end function

Java

x.re\_m = Math.abs(x_46_re);
x.re\_s = Math.copySign(1.0, x_46_re);
public static double code(double x_46_re_s, double x_46_re_m, double x_46_im) {
	double tmp;
	if (x_46_re_m <= 1.55e+92) {
		tmp = Math.pow(x_46_re_m, 3.0) + (x_46_im * ((x_46_re_m * (x_46_re_m - x_46_re_m)) - (x_46_im * (x_46_re_m + (x_46_re_m * 2.0)))));
	} else {
		tmp = (x_46_re_m - x_46_im) * (x_46_re_m * (x_46_re_m + x_46_im));
	}
	return x_46_re_s * tmp;
}

Python

x.re\_m = math.fabs(x_46_re)
x.re\_s = math.copysign(1.0, x_46_re)
def code(x_46_re_s, x_46_re_m, x_46_im):
	tmp = 0
	if x_46_re_m <= 1.55e+92:
		tmp = math.pow(x_46_re_m, 3.0) + (x_46_im * ((x_46_re_m * (x_46_re_m - x_46_re_m)) - (x_46_im * (x_46_re_m + (x_46_re_m * 2.0)))))
	else:
		tmp = (x_46_re_m - x_46_im) * (x_46_re_m * (x_46_re_m + x_46_im))
	return x_46_re_s * tmp

Julia

x.re\_m = abs(x_46_re)
x.re\_s = copysign(1.0, x_46_re)
function code(x_46_re_s, x_46_re_m, x_46_im)
	tmp = 0.0
	if (x_46_re_m <= 1.55e+92)
		tmp = Float64((x_46_re_m ^ 3.0) + Float64(x_46_im * Float64(Float64(x_46_re_m * Float64(x_46_re_m - x_46_re_m)) - Float64(x_46_im * Float64(x_46_re_m + Float64(x_46_re_m * 2.0))))));
	else
		tmp = Float64(Float64(x_46_re_m - x_46_im) * Float64(x_46_re_m * Float64(x_46_re_m + x_46_im)));
	end
	return Float64(x_46_re_s * tmp)
end

MATLAB

x.re\_m = abs(x_46_re);
x.re\_s = sign(x_46_re) * abs(1.0);
function tmp_2 = code(x_46_re_s, x_46_re_m, x_46_im)
	tmp = 0.0;
	if (x_46_re_m <= 1.55e+92)
		tmp = (x_46_re_m ^ 3.0) + (x_46_im * ((x_46_re_m * (x_46_re_m - x_46_re_m)) - (x_46_im * (x_46_re_m + (x_46_re_m * 2.0)))));
	else
		tmp = (x_46_re_m - x_46_im) * (x_46_re_m * (x_46_re_m + x_46_im));
	end
	tmp_2 = x_46_re_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x.re < 1.5500000000000001e92

   1. Initial program 87.4%

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

      1. difference-of-squares 89.9%

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

      2. *-commutative 89.9%

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

   4. Applied egg-rr 89.9%

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

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

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

   if 1.5500000000000001e92 < x.re

   1. Initial program 77.4%

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

      1. difference-of-squares 81.1%

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

      2. *-commutative 81.1%

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

   4. Applied egg-rr 81.1%

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

      1. *-commutative 81.1%

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

      2. *-un-lft-identity 81.1%

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

      3. distribute-lft-in 81.1%

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

      4. distribute-rgt-out 81.1%

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

      5. metadata-eval 81.1%

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

   6. Applied egg-rr 81.1%

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

   8. Applied egg-rr 100.0%

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

      1. fma-undefine 100.0%

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

      2. +-rgt-identity 100.0%

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

      3. *-commutative 100.0%

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

   10. Applied egg-rr 100.0%

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

4. Final simplification 94.8%

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

Alternative 3: 93.8% accurate, 0.2× speedup

Math

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

FPCore

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

C

x.re\_m = fabs(x_46_re);
x.re\_s = copysign(1.0, x_46_re);
double code(double x_46_re_s, double x_46_re_m, double x_46_im) {
	double tmp;
	if (x_46_re_m <= 1e+91) {
		tmp = pow(x_46_re_m, 3.0) + (x_46_re_m * (x_46_im * (x_46_im * -3.0)));
	} else {
		tmp = (x_46_re_m - x_46_im) * (x_46_re_m * (x_46_re_m + x_46_im));
	}
	return x_46_re_s * tmp;
}

Fortran

x.re\_m = abs(x_46re)
x.re\_s = copysign(1.0d0, x_46re)
real(8) function code(x_46re_s, x_46re_m, x_46im)
    real(8), intent (in) :: x_46re_s
    real(8), intent (in) :: x_46re_m
    real(8), intent (in) :: x_46im
    real(8) :: tmp
    if (x_46re_m <= 1d+91) then
        tmp = (x_46re_m ** 3.0d0) + (x_46re_m * (x_46im * (x_46im * (-3.0d0))))
    else
        tmp = (x_46re_m - x_46im) * (x_46re_m * (x_46re_m + x_46im))
    end if
    code = x_46re_s * tmp
end function

Java

x.re\_m = Math.abs(x_46_re);
x.re\_s = Math.copySign(1.0, x_46_re);
public static double code(double x_46_re_s, double x_46_re_m, double x_46_im) {
	double tmp;
	if (x_46_re_m <= 1e+91) {
		tmp = Math.pow(x_46_re_m, 3.0) + (x_46_re_m * (x_46_im * (x_46_im * -3.0)));
	} else {
		tmp = (x_46_re_m - x_46_im) * (x_46_re_m * (x_46_re_m + x_46_im));
	}
	return x_46_re_s * tmp;
}

Python

x.re\_m = math.fabs(x_46_re)
x.re\_s = math.copysign(1.0, x_46_re)
def code(x_46_re_s, x_46_re_m, x_46_im):
	tmp = 0
	if x_46_re_m <= 1e+91:
		tmp = math.pow(x_46_re_m, 3.0) + (x_46_re_m * (x_46_im * (x_46_im * -3.0)))
	else:
		tmp = (x_46_re_m - x_46_im) * (x_46_re_m * (x_46_re_m + x_46_im))
	return x_46_re_s * tmp

Julia

x.re\_m = abs(x_46_re)
x.re\_s = copysign(1.0, x_46_re)
function code(x_46_re_s, x_46_re_m, x_46_im)
	tmp = 0.0
	if (x_46_re_m <= 1e+91)
		tmp = Float64((x_46_re_m ^ 3.0) + Float64(x_46_re_m * Float64(x_46_im * Float64(x_46_im * -3.0))));
	else
		tmp = Float64(Float64(x_46_re_m - x_46_im) * Float64(x_46_re_m * Float64(x_46_re_m + x_46_im)));
	end
	return Float64(x_46_re_s * tmp)
end

MATLAB

x.re\_m = abs(x_46_re);
x.re\_s = sign(x_46_re) * abs(1.0);
function tmp_2 = code(x_46_re_s, x_46_re_m, x_46_im)
	tmp = 0.0;
	if (x_46_re_m <= 1e+91)
		tmp = (x_46_re_m ^ 3.0) + (x_46_re_m * (x_46_im * (x_46_im * -3.0)));
	else
		tmp = (x_46_re_m - x_46_im) * (x_46_re_m * (x_46_re_m + x_46_im));
	end
	tmp_2 = x_46_re_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x.re < 1.00000000000000008e91

   1. Initial program 87.4%

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

   3. Simplified 86.5%

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

   if 1.00000000000000008e91 < x.re

   1. Initial program 77.4%

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

      1. difference-of-squares 81.1%

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

      2. *-commutative 81.1%

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

   4. Applied egg-rr 81.1%

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

      1. *-commutative 81.1%

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

      2. *-un-lft-identity 81.1%

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

      3. distribute-lft-in 81.1%

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

      4. distribute-rgt-out 81.1%

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

      5. metadata-eval 81.1%

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

   6. Applied egg-rr 81.1%

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

   8. Applied egg-rr 100.0%

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

      1. fma-undefine 100.0%

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

      2. +-rgt-identity 100.0%

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

      3. *-commutative 100.0%

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

   10. Applied egg-rr 100.0%

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

4. Final simplification 89.3%

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

Alternative 4: 99.8% accurate, 0.2× speedup

Math

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

FPCore

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

C

x.re\_m = fabs(x_46_re);
x.re\_s = copysign(1.0, x_46_re);
double code(double x_46_re_s, double x_46_re_m, double x_46_im) {
	double tmp;
	if (x_46_re_m <= 1.5e+92) {
		tmp = pow(x_46_re_m, 3.0) + ((x_46_re_m * x_46_im) * (x_46_im * -3.0));
	} else {
		tmp = (x_46_re_m - x_46_im) * (x_46_re_m * (x_46_re_m + x_46_im));
	}
	return x_46_re_s * tmp;
}

Fortran

x.re\_m = abs(x_46re)
x.re\_s = copysign(1.0d0, x_46re)
real(8) function code(x_46re_s, x_46re_m, x_46im)
    real(8), intent (in) :: x_46re_s
    real(8), intent (in) :: x_46re_m
    real(8), intent (in) :: x_46im
    real(8) :: tmp
    if (x_46re_m <= 1.5d+92) then
        tmp = (x_46re_m ** 3.0d0) + ((x_46re_m * x_46im) * (x_46im * (-3.0d0)))
    else
        tmp = (x_46re_m - x_46im) * (x_46re_m * (x_46re_m + x_46im))
    end if
    code = x_46re_s * tmp
end function

Java

x.re\_m = Math.abs(x_46_re);
x.re\_s = Math.copySign(1.0, x_46_re);
public static double code(double x_46_re_s, double x_46_re_m, double x_46_im) {
	double tmp;
	if (x_46_re_m <= 1.5e+92) {
		tmp = Math.pow(x_46_re_m, 3.0) + ((x_46_re_m * x_46_im) * (x_46_im * -3.0));
	} else {
		tmp = (x_46_re_m - x_46_im) * (x_46_re_m * (x_46_re_m + x_46_im));
	}
	return x_46_re_s * tmp;
}

Python

x.re\_m = math.fabs(x_46_re)
x.re\_s = math.copysign(1.0, x_46_re)
def code(x_46_re_s, x_46_re_m, x_46_im):
	tmp = 0
	if x_46_re_m <= 1.5e+92:
		tmp = math.pow(x_46_re_m, 3.0) + ((x_46_re_m * x_46_im) * (x_46_im * -3.0))
	else:
		tmp = (x_46_re_m - x_46_im) * (x_46_re_m * (x_46_re_m + x_46_im))
	return x_46_re_s * tmp

Julia

x.re\_m = abs(x_46_re)
x.re\_s = copysign(1.0, x_46_re)
function code(x_46_re_s, x_46_re_m, x_46_im)
	tmp = 0.0
	if (x_46_re_m <= 1.5e+92)
		tmp = Float64((x_46_re_m ^ 3.0) + Float64(Float64(x_46_re_m * x_46_im) * Float64(x_46_im * -3.0)));
	else
		tmp = Float64(Float64(x_46_re_m - x_46_im) * Float64(x_46_re_m * Float64(x_46_re_m + x_46_im)));
	end
	return Float64(x_46_re_s * tmp)
end

MATLAB

x.re\_m = abs(x_46_re);
x.re\_s = sign(x_46_re) * abs(1.0);
function tmp_2 = code(x_46_re_s, x_46_re_m, x_46_im)
	tmp = 0.0;
	if (x_46_re_m <= 1.5e+92)
		tmp = (x_46_re_m ^ 3.0) + ((x_46_re_m * x_46_im) * (x_46_im * -3.0));
	else
		tmp = (x_46_re_m - x_46_im) * (x_46_re_m * (x_46_re_m + x_46_im));
	end
	tmp_2 = x_46_re_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x.re < 1.50000000000000007e92

   1. Initial program 87.4%

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

   3. Simplified 86.5%

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

      1. +-commutative 86.5%

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

      2. associate-*r* 93.4%

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

      3. fma-define 94.4%

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

   6. Applied egg-rr 94.4%

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

      1. fma-undefine 93.4%

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

      2. +-commutative 93.4%

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

   8. Applied egg-rr 93.4%

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

   if 1.50000000000000007e92 < x.re

   1. Initial program 77.4%

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

      1. difference-of-squares 81.1%

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

      2. *-commutative 81.1%

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

   4. Applied egg-rr 81.1%

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

      1. *-commutative 81.1%

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

      2. *-un-lft-identity 81.1%

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

      3. distribute-lft-in 81.1%

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

      4. distribute-rgt-out 81.1%

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

      5. metadata-eval 81.1%

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

   6. Applied egg-rr 81.1%

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

   8. Applied egg-rr 100.0%

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

      1. fma-undefine 100.0%

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

      2. +-rgt-identity 100.0%

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

      3. *-commutative 100.0%

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

   10. Applied egg-rr 100.0%

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

4. Final simplification 94.8%

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

Alternative 5: 93.4% accurate, 0.8× speedup

Math

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

FPCore

x.re\_m = (fabs.f64 x.re)
x.re\_s = (copysign.f64 #s(literal 1 binary64) x.re)
(FPCore (x.re_s x.re_m x.im)
 :precision binary64
 (*
  x.re_s
  (if (<= x.re_m 5e+55)
    (-
     (* x.re_m (- (* x.re_m x.re_m) (* x.im x.im)))
     (* x.im (+ (* x.re_m x.im) (* x.re_m x.im))))
    (* (- x.re_m x.im) (* x.re_m (+ x.re_m x.im))))))

C

x.re\_m = fabs(x_46_re);
x.re\_s = copysign(1.0, x_46_re);
double code(double x_46_re_s, double x_46_re_m, double x_46_im) {
	double tmp;
	if (x_46_re_m <= 5e+55) {
		tmp = (x_46_re_m * ((x_46_re_m * x_46_re_m) - (x_46_im * x_46_im))) - (x_46_im * ((x_46_re_m * x_46_im) + (x_46_re_m * x_46_im)));
	} else {
		tmp = (x_46_re_m - x_46_im) * (x_46_re_m * (x_46_re_m + x_46_im));
	}
	return x_46_re_s * tmp;
}

Fortran

x.re\_m = abs(x_46re)
x.re\_s = copysign(1.0d0, x_46re)
real(8) function code(x_46re_s, x_46re_m, x_46im)
    real(8), intent (in) :: x_46re_s
    real(8), intent (in) :: x_46re_m
    real(8), intent (in) :: x_46im
    real(8) :: tmp
    if (x_46re_m <= 5d+55) then
        tmp = (x_46re_m * ((x_46re_m * x_46re_m) - (x_46im * x_46im))) - (x_46im * ((x_46re_m * x_46im) + (x_46re_m * x_46im)))
    else
        tmp = (x_46re_m - x_46im) * (x_46re_m * (x_46re_m + x_46im))
    end if
    code = x_46re_s * tmp
end function

Java

x.re\_m = Math.abs(x_46_re);
x.re\_s = Math.copySign(1.0, x_46_re);
public static double code(double x_46_re_s, double x_46_re_m, double x_46_im) {
	double tmp;
	if (x_46_re_m <= 5e+55) {
		tmp = (x_46_re_m * ((x_46_re_m * x_46_re_m) - (x_46_im * x_46_im))) - (x_46_im * ((x_46_re_m * x_46_im) + (x_46_re_m * x_46_im)));
	} else {
		tmp = (x_46_re_m - x_46_im) * (x_46_re_m * (x_46_re_m + x_46_im));
	}
	return x_46_re_s * tmp;
}

Python

x.re\_m = math.fabs(x_46_re)
x.re\_s = math.copysign(1.0, x_46_re)
def code(x_46_re_s, x_46_re_m, x_46_im):
	tmp = 0
	if x_46_re_m <= 5e+55:
		tmp = (x_46_re_m * ((x_46_re_m * x_46_re_m) - (x_46_im * x_46_im))) - (x_46_im * ((x_46_re_m * x_46_im) + (x_46_re_m * x_46_im)))
	else:
		tmp = (x_46_re_m - x_46_im) * (x_46_re_m * (x_46_re_m + x_46_im))
	return x_46_re_s * tmp

Julia

x.re\_m = abs(x_46_re)
x.re\_s = copysign(1.0, x_46_re)
function code(x_46_re_s, x_46_re_m, x_46_im)
	tmp = 0.0
	if (x_46_re_m <= 5e+55)
		tmp = Float64(Float64(x_46_re_m * Float64(Float64(x_46_re_m * x_46_re_m) - Float64(x_46_im * x_46_im))) - Float64(x_46_im * Float64(Float64(x_46_re_m * x_46_im) + Float64(x_46_re_m * x_46_im))));
	else
		tmp = Float64(Float64(x_46_re_m - x_46_im) * Float64(x_46_re_m * Float64(x_46_re_m + x_46_im)));
	end
	return Float64(x_46_re_s * tmp)
end

MATLAB

x.re\_m = abs(x_46_re);
x.re\_s = sign(x_46_re) * abs(1.0);
function tmp_2 = code(x_46_re_s, x_46_re_m, x_46_im)
	tmp = 0.0;
	if (x_46_re_m <= 5e+55)
		tmp = (x_46_re_m * ((x_46_re_m * x_46_re_m) - (x_46_im * x_46_im))) - (x_46_im * ((x_46_re_m * x_46_im) + (x_46_re_m * x_46_im)));
	else
		tmp = (x_46_re_m - x_46_im) * (x_46_re_m * (x_46_re_m + x_46_im));
	end
	tmp_2 = x_46_re_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x.re < 5.00000000000000046e55

   1. Initial program 87.3%

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

   if 5.00000000000000046e55 < x.re

   1. Initial program 78.2%

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

      1. difference-of-squares 81.8%

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

      2. *-commutative 81.8%

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

   4. Applied egg-rr 81.8%

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

      1. *-commutative 81.8%

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

      2. *-un-lft-identity 81.8%

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

      3. distribute-lft-in 81.8%

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

      4. distribute-rgt-out 81.8%

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

      5. metadata-eval 81.8%

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

   6. Applied egg-rr 81.8%

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

   8. Applied egg-rr 100.0%

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

      1. fma-undefine 100.0%

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

      2. +-rgt-identity 100.0%

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

      3. *-commutative 100.0%

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

   10. Applied egg-rr 100.0%

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

4. Final simplification 90.0%

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

Alternative 6: 93.4% accurate, 0.9× speedup

Math

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

FPCore

x.re\_m = (fabs.f64 x.re)
x.re\_s = (copysign.f64 #s(literal 1 binary64) x.re)
(FPCore (x.re_s x.re_m x.im)
 :precision binary64
 (*
  x.re_s
  (if (<= x.re_m 5.5e+55)
    (-
     (* x.re_m (* (- x.re_m x.im) (+ x.re_m x.im)))
     (* x.im (* (* x.re_m x.im) 2.0)))
    (* (- x.re_m x.im) (* x.re_m (+ x.re_m x.im))))))

C

x.re\_m = fabs(x_46_re);
x.re\_s = copysign(1.0, x_46_re);
double code(double x_46_re_s, double x_46_re_m, double x_46_im) {
	double tmp;
	if (x_46_re_m <= 5.5e+55) {
		tmp = (x_46_re_m * ((x_46_re_m - x_46_im) * (x_46_re_m + x_46_im))) - (x_46_im * ((x_46_re_m * x_46_im) * 2.0));
	} else {
		tmp = (x_46_re_m - x_46_im) * (x_46_re_m * (x_46_re_m + x_46_im));
	}
	return x_46_re_s * tmp;
}

Fortran

x.re\_m = abs(x_46re)
x.re\_s = copysign(1.0d0, x_46re)
real(8) function code(x_46re_s, x_46re_m, x_46im)
    real(8), intent (in) :: x_46re_s
    real(8), intent (in) :: x_46re_m
    real(8), intent (in) :: x_46im
    real(8) :: tmp
    if (x_46re_m <= 5.5d+55) then
        tmp = (x_46re_m * ((x_46re_m - x_46im) * (x_46re_m + x_46im))) - (x_46im * ((x_46re_m * x_46im) * 2.0d0))
    else
        tmp = (x_46re_m - x_46im) * (x_46re_m * (x_46re_m + x_46im))
    end if
    code = x_46re_s * tmp
end function

Java

x.re\_m = Math.abs(x_46_re);
x.re\_s = Math.copySign(1.0, x_46_re);
public static double code(double x_46_re_s, double x_46_re_m, double x_46_im) {
	double tmp;
	if (x_46_re_m <= 5.5e+55) {
		tmp = (x_46_re_m * ((x_46_re_m - x_46_im) * (x_46_re_m + x_46_im))) - (x_46_im * ((x_46_re_m * x_46_im) * 2.0));
	} else {
		tmp = (x_46_re_m - x_46_im) * (x_46_re_m * (x_46_re_m + x_46_im));
	}
	return x_46_re_s * tmp;
}

Python

x.re\_m = math.fabs(x_46_re)
x.re\_s = math.copysign(1.0, x_46_re)
def code(x_46_re_s, x_46_re_m, x_46_im):
	tmp = 0
	if x_46_re_m <= 5.5e+55:
		tmp = (x_46_re_m * ((x_46_re_m - x_46_im) * (x_46_re_m + x_46_im))) - (x_46_im * ((x_46_re_m * x_46_im) * 2.0))
	else:
		tmp = (x_46_re_m - x_46_im) * (x_46_re_m * (x_46_re_m + x_46_im))
	return x_46_re_s * tmp

Julia

x.re\_m = abs(x_46_re)
x.re\_s = copysign(1.0, x_46_re)
function code(x_46_re_s, x_46_re_m, x_46_im)
	tmp = 0.0
	if (x_46_re_m <= 5.5e+55)
		tmp = Float64(Float64(x_46_re_m * Float64(Float64(x_46_re_m - x_46_im) * Float64(x_46_re_m + x_46_im))) - Float64(x_46_im * Float64(Float64(x_46_re_m * x_46_im) * 2.0)));
	else
		tmp = Float64(Float64(x_46_re_m - x_46_im) * Float64(x_46_re_m * Float64(x_46_re_m + x_46_im)));
	end
	return Float64(x_46_re_s * tmp)
end

MATLAB

x.re\_m = abs(x_46_re);
x.re\_s = sign(x_46_re) * abs(1.0);
function tmp_2 = code(x_46_re_s, x_46_re_m, x_46_im)
	tmp = 0.0;
	if (x_46_re_m <= 5.5e+55)
		tmp = (x_46_re_m * ((x_46_re_m - x_46_im) * (x_46_re_m + x_46_im))) - (x_46_im * ((x_46_re_m * x_46_im) * 2.0));
	else
		tmp = (x_46_re_m - x_46_im) * (x_46_re_m * (x_46_re_m + x_46_im));
	end
	tmp_2 = x_46_re_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x.re < 5.5000000000000004e55

   1. Initial program 87.3%

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

      1. difference-of-squares 89.8%

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

      2. *-commutative 89.8%

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

   4. Applied egg-rr 89.8%

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

      1. *-commutative 89.8%

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

      2. *-un-lft-identity 89.8%

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

      3. distribute-lft-in 89.8%

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

      4. distribute-rgt-out 89.8%

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

      5. metadata-eval 89.8%

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

   6. Applied egg-rr 89.8%

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

   if 5.5000000000000004e55 < x.re

   1. Initial program 78.2%

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

      1. difference-of-squares 81.8%

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

      2. *-commutative 81.8%

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

   4. Applied egg-rr 81.8%

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

      1. *-commutative 81.8%

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

      2. *-un-lft-identity 81.8%

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

      3. distribute-lft-in 81.8%

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

      4. distribute-rgt-out 81.8%

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

      5. metadata-eval 81.8%

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

   6. Applied egg-rr 81.8%

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

   8. Applied egg-rr 100.0%

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

      1. fma-undefine 100.0%

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

      2. +-rgt-identity 100.0%

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

      3. *-commutative 100.0%

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

   10. Applied egg-rr 100.0%

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

4. Final simplification 92.0%

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

Alternative 7: 86.9% accurate, 1.4× speedup

Math

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

FPCore

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

C

x.re\_m = fabs(x_46_re);
x.re\_s = copysign(1.0, x_46_re);
double code(double x_46_re_s, double x_46_re_m, double x_46_im) {
	double tmp;
	if (x_46_re_m <= 1.76e-56) {
		tmp = x_46_re_m * (-3.0 * (x_46_im * x_46_im));
	} else {
		tmp = (x_46_re_m - x_46_im) * (x_46_re_m * (x_46_re_m + x_46_im));
	}
	return x_46_re_s * tmp;
}

Fortran

x.re\_m = abs(x_46re)
x.re\_s = copysign(1.0d0, x_46re)
real(8) function code(x_46re_s, x_46re_m, x_46im)
    real(8), intent (in) :: x_46re_s
    real(8), intent (in) :: x_46re_m
    real(8), intent (in) :: x_46im
    real(8) :: tmp
    if (x_46re_m <= 1.76d-56) then
        tmp = x_46re_m * ((-3.0d0) * (x_46im * x_46im))
    else
        tmp = (x_46re_m - x_46im) * (x_46re_m * (x_46re_m + x_46im))
    end if
    code = x_46re_s * tmp
end function

Java

x.re\_m = Math.abs(x_46_re);
x.re\_s = Math.copySign(1.0, x_46_re);
public static double code(double x_46_re_s, double x_46_re_m, double x_46_im) {
	double tmp;
	if (x_46_re_m <= 1.76e-56) {
		tmp = x_46_re_m * (-3.0 * (x_46_im * x_46_im));
	} else {
		tmp = (x_46_re_m - x_46_im) * (x_46_re_m * (x_46_re_m + x_46_im));
	}
	return x_46_re_s * tmp;
}

Python

x.re\_m = math.fabs(x_46_re)
x.re\_s = math.copysign(1.0, x_46_re)
def code(x_46_re_s, x_46_re_m, x_46_im):
	tmp = 0
	if x_46_re_m <= 1.76e-56:
		tmp = x_46_re_m * (-3.0 * (x_46_im * x_46_im))
	else:
		tmp = (x_46_re_m - x_46_im) * (x_46_re_m * (x_46_re_m + x_46_im))
	return x_46_re_s * tmp

Julia

x.re\_m = abs(x_46_re)
x.re\_s = copysign(1.0, x_46_re)
function code(x_46_re_s, x_46_re_m, x_46_im)
	tmp = 0.0
	if (x_46_re_m <= 1.76e-56)
		tmp = Float64(x_46_re_m * Float64(-3.0 * Float64(x_46_im * x_46_im)));
	else
		tmp = Float64(Float64(x_46_re_m - x_46_im) * Float64(x_46_re_m * Float64(x_46_re_m + x_46_im)));
	end
	return Float64(x_46_re_s * tmp)
end

MATLAB

x.re\_m = abs(x_46_re);
x.re\_s = sign(x_46_re) * abs(1.0);
function tmp_2 = code(x_46_re_s, x_46_re_m, x_46_im)
	tmp = 0.0;
	if (x_46_re_m <= 1.76e-56)
		tmp = x_46_re_m * (-3.0 * (x_46_im * x_46_im));
	else
		tmp = (x_46_re_m - x_46_im) * (x_46_re_m * (x_46_re_m + x_46_im));
	end
	tmp_2 = x_46_re_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x.re < 1.75999999999999999e-56

   1. Initial program 85.9%

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

   3. Simplified 84.7%

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

      1. +-commutative 84.7%

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

      2. associate-*r* 92.3%

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

      3. fma-define 93.4%

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

   6. Applied egg-rr 93.4%

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

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

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

   9. Simplified 62.0%

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

       1. unpow2 62.0%

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

   11. Applied egg-rr 62.0%

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

   if 1.75999999999999999e-56 < x.re

   1. Initial program 84.3%

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

      1. difference-of-squares 86.7%

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

      2. *-commutative 86.7%

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

   4. Applied egg-rr 86.7%

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

      1. *-commutative 86.7%

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

      2. *-un-lft-identity 86.7%

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

      3. distribute-lft-in 86.7%

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

      4. distribute-rgt-out 86.7%

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

      5. metadata-eval 86.7%

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

   6. Applied egg-rr 86.7%

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

   8. Applied egg-rr 91.6%

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

      1. fma-undefine 91.6%

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

      2. +-rgt-identity 91.6%

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

      3. *-commutative 91.6%

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

   10. Applied egg-rr 91.6%

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

4. Final simplification 71.6%

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

Alternative 8: 49.6% accurate, 2.7× speedup

Math

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

FPCore

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

C

x.re\_m = fabs(x_46_re);
x.re\_s = copysign(1.0, x_46_re);
double code(double x_46_re_s, double x_46_re_m, double x_46_im) {
	return x_46_re_s * (x_46_re_m * (-3.0 * (x_46_im * x_46_im)));
}

Fortran

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

Java

x.re\_m = Math.abs(x_46_re);
x.re\_s = Math.copySign(1.0, x_46_re);
public static double code(double x_46_re_s, double x_46_re_m, double x_46_im) {
	return x_46_re_s * (x_46_re_m * (-3.0 * (x_46_im * x_46_im)));
}

Python

x.re\_m = math.fabs(x_46_re)
x.re\_s = math.copysign(1.0, x_46_re)
def code(x_46_re_s, x_46_re_m, x_46_im):
	return x_46_re_s * (x_46_re_m * (-3.0 * (x_46_im * x_46_im)))

Julia

x.re\_m = abs(x_46_re)
x.re\_s = copysign(1.0, x_46_re)
function code(x_46_re_s, x_46_re_m, x_46_im)
	return Float64(x_46_re_s * Float64(x_46_re_m * Float64(-3.0 * Float64(x_46_im * x_46_im))))
end

MATLAB

x.re\_m = abs(x_46_re);
x.re\_s = sign(x_46_re) * abs(1.0);
function tmp = code(x_46_re_s, x_46_re_m, x_46_im)
	tmp = x_46_re_s * (x_46_re_m * (-3.0 * (x_46_im * x_46_im)));
end

Wolfram

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

Derivation

1. Initial program 85.4%

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

3. Simplified 83.8%

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

   1. +-commutative 83.8%

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

   2. associate-*r* 89.3%

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

   3. fma-define 90.5%

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

6. Applied egg-rr 90.5%

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

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

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

9. Simplified 48.3%

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

    1. unpow2 48.3%

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

11. Applied egg-rr 48.3%

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

12. Final simplification 48.3%

    \[\leadsto x.re \cdot \left(-3 \cdot \left(x.im \cdot x.im\right)\right) \]
13. Add Preprocessing

Developer target: 87.5% accurate, 1.1× speedup

Math

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

FPCore

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

C

double code(double x_46_re, double x_46_im) {
	return ((x_46_re * x_46_re) * (x_46_re - x_46_im)) + ((x_46_re * x_46_im) * (x_46_re - (3.0 * 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_46re) * (x_46re - x_46im)) + ((x_46re * x_46im) * (x_46re - (3.0d0 * x_46im)))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

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

  :alt
  (+ (* (* x.re x.re) (- x.re x.im)) (* (* x.re x.im) (- x.re (* 3.0 x.im))))

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