math.cube on complex, imaginary part

Percentage Accurate: 82.6% → 99.9%

Time: 7.9s

Alternatives: 9

Speedup: 1.4×

• 45.2% 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.6% 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.9% 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 5 \cdot 10^{+97}:\\ \;\;\;\;x.re\_m \cdot \left(x.im\_m \cdot \left(x.re\_m \cdot 3\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 5e+97)
    (- (* x.re_m (* x.im_m (* x.re_m 3.0))) (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 <= 5e+97) {
		tmp = (x_46_re_m * (x_46_im_m * (x_46_re_m * 3.0))) - 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 <= 5d+97) then
        tmp = (x_46re_m * (x_46im_m * (x_46re_m * 3.0d0))) - (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 <= 5e+97) {
		tmp = (x_46_re_m * (x_46_im_m * (x_46_re_m * 3.0))) - 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 <= 5e+97:
		tmp = (x_46_re_m * (x_46_im_m * (x_46_re_m * 3.0))) - 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 <= 5e+97)
		tmp = Float64(Float64(x_46_re_m * Float64(x_46_im_m * Float64(x_46_re_m * 3.0))) - (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 <= 5e+97)
		tmp = (x_46_re_m * (x_46_im_m * (x_46_re_m * 3.0))) - (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, 5e+97], N[(N[(x$46$re$95$m * N[(x$46$im$95$m * N[(x$46$re$95$m * 3.0), $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 < 4.99999999999999999e97

   1. Initial program 84.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 90.4%

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

   if 4.99999999999999999e97 < x.im

   1. Initial program 65.9%

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

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

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

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

      1. difference-of-squares 100.0%

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

      2. *-commutative 100.0%

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

   7. Applied egg-rr 100.0%

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

   8. Taylor expanded in x.re around 0 95.5%

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

4. Final simplification 91.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x.im \leq 5 \cdot 10^{+97}:\\ \;\;\;\;x.re \cdot \left(x.im \cdot \left(x.re \cdot 3\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.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) + x.re\_m \cdot \left(x.im\_m \cdot x.re\_m + x.im\_m \cdot x.re\_m\right)\\ t_1 := x.re\_m \cdot \left(\left(x.im\_m \cdot x.re\_m\right) \cdot 2\right)\\ x.im\_s \cdot \begin{array}{l} \mathbf{if}\;t\_0 \leq 10^{+274}:\\ \;\;\;\;x.im\_m \cdot \left(\left(x.re\_m - x.im\_m\right) \cdot \left(x.im\_m + x.re\_m\right)\right) + t\_1\\ \mathbf{elif}\;t\_0 \leq \infty:\\ \;\;\;\;t\_1 + \left(x.im\_m \cdot x.re\_m\right) \cdot \left(x.im\_m + x.re\_m\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)))
          (* x.re_m (+ (* x.im_m x.re_m) (* x.im_m x.re_m)))))
        (t_1 (* x.re_m (* (* x.im_m x.re_m) 2.0))))
   (*
    x.im_s
    (if (<= t_0 1e+274)
      (+ (* x.im_m (* (- x.re_m x.im_m) (+ x.im_m x.re_m))) t_1)
      (if (<= t_0 INFINITY)
        (+ t_1 (* (* x.im_m x.re_m) (+ x.im_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 t_0 = (x_46_im_m * ((x_46_re_m * x_46_re_m) - (x_46_im_m * x_46_im_m))) + (x_46_re_m * ((x_46_im_m * x_46_re_m) + (x_46_im_m * x_46_re_m)));
	double t_1 = x_46_re_m * ((x_46_im_m * x_46_re_m) * 2.0);
	double tmp;
	if (t_0 <= 1e+274) {
		tmp = (x_46_im_m * ((x_46_re_m - x_46_im_m) * (x_46_im_m + x_46_re_m))) + t_1;
	} else if (t_0 <= ((double) INFINITY)) {
		tmp = t_1 + ((x_46_im_m * x_46_re_m) * (x_46_im_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;
}

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))) + (x_46_re_m * ((x_46_im_m * x_46_re_m) + (x_46_im_m * x_46_re_m)));
	double t_1 = x_46_re_m * ((x_46_im_m * x_46_re_m) * 2.0);
	double tmp;
	if (t_0 <= 1e+274) {
		tmp = (x_46_im_m * ((x_46_re_m - x_46_im_m) * (x_46_im_m + x_46_re_m))) + t_1;
	} else if (t_0 <= Double.POSITIVE_INFINITY) {
		tmp = t_1 + ((x_46_im_m * x_46_re_m) * (x_46_im_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):
	t_0 = (x_46_im_m * ((x_46_re_m * x_46_re_m) - (x_46_im_m * x_46_im_m))) + (x_46_re_m * ((x_46_im_m * x_46_re_m) + (x_46_im_m * x_46_re_m)))
	t_1 = x_46_re_m * ((x_46_im_m * x_46_re_m) * 2.0)
	tmp = 0
	if t_0 <= 1e+274:
		tmp = (x_46_im_m * ((x_46_re_m - x_46_im_m) * (x_46_im_m + x_46_re_m))) + t_1
	elif t_0 <= math.inf:
		tmp = t_1 + ((x_46_im_m * x_46_re_m) * (x_46_im_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)
	t_0 = Float64(Float64(x_46_im_m * Float64(Float64(x_46_re_m * x_46_re_m) - Float64(x_46_im_m * x_46_im_m))) + Float64(x_46_re_m * Float64(Float64(x_46_im_m * x_46_re_m) + Float64(x_46_im_m * x_46_re_m))))
	t_1 = Float64(x_46_re_m * Float64(Float64(x_46_im_m * x_46_re_m) * 2.0))
	tmp = 0.0
	if (t_0 <= 1e+274)
		tmp = Float64(Float64(x_46_im_m * Float64(Float64(x_46_re_m - x_46_im_m) * Float64(x_46_im_m + x_46_re_m))) + t_1);
	elseif (t_0 <= Inf)
		tmp = Float64(t_1 + Float64(Float64(x_46_im_m * x_46_re_m) * Float64(x_46_im_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)
	t_0 = (x_46_im_m * ((x_46_re_m * x_46_re_m) - (x_46_im_m * x_46_im_m))) + (x_46_re_m * ((x_46_im_m * x_46_re_m) + (x_46_im_m * x_46_re_m)));
	t_1 = x_46_re_m * ((x_46_im_m * x_46_re_m) * 2.0);
	tmp = 0.0;
	if (t_0 <= 1e+274)
		tmp = (x_46_im_m * ((x_46_re_m - x_46_im_m) * (x_46_im_m + x_46_re_m))) + t_1;
	elseif (t_0 <= Inf)
		tmp = t_1 + ((x_46_im_m * x_46_re_m) * (x_46_im_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_] := Block[{t$95$0 = N[(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] + 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]}, Block[{t$95$1 = N[(x$46$re$95$m * N[(N[(x$46$im$95$m * x$46$re$95$m), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]}, N[(x$46$im$95$s * If[LessEqual[t$95$0, 1e+274], N[(N[(x$46$im$95$m * N[(N[(x$46$re$95$m - x$46$im$95$m), $MachinePrecision] * N[(x$46$im$95$m + x$46$re$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision], If[LessEqual[t$95$0, Infinity], N[(t$95$1 + 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], 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)) < 9.99999999999999921e273

   1. Initial program 96.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 39.6%

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

      2. *-commutative 39.6%

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

   4. Applied egg-rr 96.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. Step-by-step derivation

      1. *-commutative 96.4%

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

      2. count-2 96.4%

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

      3. *-commutative 96.4%

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

   6. Applied egg-rr 96.4%

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

   if 9.99999999999999921e273 < (+.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 87.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 85.8%

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

      2. *-commutative 85.8%

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

   4. Applied egg-rr 87.2%

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

      1. *-commutative 87.2%

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

      2. count-2 87.2%

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

      3. *-commutative 87.2%

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

   6. Applied egg-rr 87.2%

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

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

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

   8. Taylor expanded in x.re around 0 63.3%

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

      1. unpow2 63.3%

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

      2. distribute-lft-in 63.3%

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

      3. associate-*r* 56.9%

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

      4. +-commutative 56.9%

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

      5. *-commutative 56.9%

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

   10. Simplified 56.9%

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

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

   1. Initial program 0.0%

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

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

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

   5. Simplified 47.1%

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

      1. difference-of-squares 100.0%

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

      2. *-commutative 100.0%

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

   7. Applied egg-rr 100.0%

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

   8. Taylor expanded in x.re around 0 94.1%

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

4. Final simplification 87.0%

   \[\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^{+274}:\\ \;\;\;\;x.im \cdot \left(\left(x.re - x.im\right) \cdot \left(x.im + x.re\right)\right) + x.re \cdot \left(\left(x.im \cdot x.re\right) \cdot 2\right)\\ \mathbf{elif}\;x.im \cdot \left(x.re \cdot x.re - x.im \cdot x.im\right) + x.re \cdot \left(x.im \cdot x.re + x.im \cdot x.re\right) \leq \infty:\\ \;\;\;\;x.re \cdot \left(\left(x.im \cdot x.re\right) \cdot 2\right) + \left(x.im \cdot x.re\right) \cdot \left(x.im + x.re\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: 92.8% 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)\\ t_1 := x.re\_m \cdot \left(\left(x.im\_m \cdot x.re\_m\right) \cdot 2\right)\\ x.im\_s \cdot \begin{array}{l} \mathbf{if}\;x.im\_m \leq 1.22 \cdot 10^{-98}:\\ \;\;\;\;t\_1 + \left(x.im\_m \cdot x.re\_m\right) \cdot \left(x.im\_m + x.re\_m\right)\\ \mathbf{elif}\;x.im\_m \leq 1.7 \cdot 10^{+78}:\\ \;\;\;\;t\_0 + t\_1\\ \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))))
        (t_1 (* x.re_m (* (* x.im_m x.re_m) 2.0))))
   (*
    x.im_s
    (if (<= x.im_m 1.22e-98)
      (+ t_1 (* (* x.im_m x.re_m) (+ x.im_m x.re_m)))
      (if (<= x.im_m 1.7e+78) (+ t_0 t_1) (+ 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 t_1 = x_46_re_m * ((x_46_im_m * x_46_re_m) * 2.0);
	double tmp;
	if (x_46_im_m <= 1.22e-98) {
		tmp = t_1 + ((x_46_im_m * x_46_re_m) * (x_46_im_m + x_46_re_m));
	} else if (x_46_im_m <= 1.7e+78) {
		tmp = t_0 + t_1;
	} 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) :: t_1
    real(8) :: tmp
    t_0 = x_46im_m * (x_46im_m * (x_46re_m - x_46im_m))
    t_1 = x_46re_m * ((x_46im_m * x_46re_m) * 2.0d0)
    if (x_46im_m <= 1.22d-98) then
        tmp = t_1 + ((x_46im_m * x_46re_m) * (x_46im_m + x_46re_m))
    else if (x_46im_m <= 1.7d+78) then
        tmp = t_0 + t_1
    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 t_1 = x_46_re_m * ((x_46_im_m * x_46_re_m) * 2.0);
	double tmp;
	if (x_46_im_m <= 1.22e-98) {
		tmp = t_1 + ((x_46_im_m * x_46_re_m) * (x_46_im_m + x_46_re_m));
	} else if (x_46_im_m <= 1.7e+78) {
		tmp = t_0 + t_1;
	} 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))
	t_1 = x_46_re_m * ((x_46_im_m * x_46_re_m) * 2.0)
	tmp = 0
	if x_46_im_m <= 1.22e-98:
		tmp = t_1 + ((x_46_im_m * x_46_re_m) * (x_46_im_m + x_46_re_m))
	elif x_46_im_m <= 1.7e+78:
		tmp = t_0 + t_1
	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)))
	t_1 = Float64(x_46_re_m * Float64(Float64(x_46_im_m * x_46_re_m) * 2.0))
	tmp = 0.0
	if (x_46_im_m <= 1.22e-98)
		tmp = Float64(t_1 + Float64(Float64(x_46_im_m * x_46_re_m) * Float64(x_46_im_m + x_46_re_m)));
	elseif (x_46_im_m <= 1.7e+78)
		tmp = Float64(t_0 + t_1);
	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));
	t_1 = x_46_re_m * ((x_46_im_m * x_46_re_m) * 2.0);
	tmp = 0.0;
	if (x_46_im_m <= 1.22e-98)
		tmp = t_1 + ((x_46_im_m * x_46_re_m) * (x_46_im_m + x_46_re_m));
	elseif (x_46_im_m <= 1.7e+78)
		tmp = t_0 + t_1;
	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]}, Block[{t$95$1 = N[(x$46$re$95$m * N[(N[(x$46$im$95$m * x$46$re$95$m), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]}, N[(x$46$im$95$s * If[LessEqual[x$46$im$95$m, 1.22e-98], N[(t$95$1 + 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], If[LessEqual[x$46$im$95$m, 1.7e+78], N[(t$95$0 + t$95$1), $MachinePrecision], N[(t$95$0 + -3.0), $MachinePrecision]]]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x.im < 1.2200000000000001e-98

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

      1. difference-of-squares 49.3%

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

      2. *-commutative 49.3%

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

   4. Applied egg-rr 83.1%

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

      1. *-commutative 83.1%

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

      2. count-2 83.1%

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

      3. *-commutative 83.1%

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

   6. Applied egg-rr 83.1%

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

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

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

   8. Taylor expanded in x.re around 0 68.4%

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

      1. unpow2 68.4%

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

      2. distribute-lft-in 69.0%

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

      3. associate-*r* 66.8%

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

      4. +-commutative 66.8%

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

      5. *-commutative 66.8%

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

   10. Simplified 66.8%

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

   if 1.2200000000000001e-98 < x.im < 1.70000000000000004e78

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

      1. difference-of-squares 40.1%

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

      2. *-commutative 40.1%

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

   4. Applied egg-rr 99.8%

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

      1. *-commutative 99.8%

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

      2. count-2 99.8%

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

      3. *-commutative 99.8%

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

   6. Applied egg-rr 99.8%

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

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

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

   if 1.70000000000000004e78 < x.im

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

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

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

      1. difference-of-squares 100.0%

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

      2. *-commutative 100.0%

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

   7. Applied egg-rr 100.0%

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

   8. Taylor expanded in x.re around 0 96.1%

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

4. Final simplification 73.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x.im \leq 1.22 \cdot 10^{-98}:\\ \;\;\;\;x.re \cdot \left(\left(x.im \cdot x.re\right) \cdot 2\right) + \left(x.im \cdot x.re\right) \cdot \left(x.im + x.re\right)\\ \mathbf{elif}\;x.im \leq 1.7 \cdot 10^{+78}:\\ \;\;\;\;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 4: 90.0% accurate, 0.9× 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.12 \cdot 10^{+20}:\\ \;\;\;\;x.re\_m \cdot \left(\left(x.im\_m \cdot x.re\_m\right) \cdot 2\right) + \left(x.im\_m \cdot x.re\_m\right) \cdot \left(x.im\_m + x.re\_m\right)\\ \mathbf{else}:\\ \;\;\;\;-3 + x.im\_m \cdot \left(\left(x.re\_m - x.im\_m\right) \cdot \left(x.im\_m + x.re\_m\right)\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.12e+20)
    (+
     (* x.re_m (* (* x.im_m x.re_m) 2.0))
     (* (* x.im_m x.re_m) (+ x.im_m x.re_m)))
    (+ -3.0 (* x.im_m (* (- x.re_m 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.12e+20) {
		tmp = (x_46_re_m * ((x_46_im_m * x_46_re_m) * 2.0)) + ((x_46_im_m * x_46_re_m) * (x_46_im_m + x_46_re_m));
	} else {
		tmp = -3.0 + (x_46_im_m * ((x_46_re_m - 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.12d+20) then
        tmp = (x_46re_m * ((x_46im_m * x_46re_m) * 2.0d0)) + ((x_46im_m * x_46re_m) * (x_46im_m + x_46re_m))
    else
        tmp = (-3.0d0) + (x_46im_m * ((x_46re_m - 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.12e+20) {
		tmp = (x_46_re_m * ((x_46_im_m * x_46_re_m) * 2.0)) + ((x_46_im_m * x_46_re_m) * (x_46_im_m + x_46_re_m));
	} else {
		tmp = -3.0 + (x_46_im_m * ((x_46_re_m - 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.12e+20:
		tmp = (x_46_re_m * ((x_46_im_m * x_46_re_m) * 2.0)) + ((x_46_im_m * x_46_re_m) * (x_46_im_m + x_46_re_m))
	else:
		tmp = -3.0 + (x_46_im_m * ((x_46_re_m - 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.12e+20)
		tmp = Float64(Float64(x_46_re_m * Float64(Float64(x_46_im_m * x_46_re_m) * 2.0)) + Float64(Float64(x_46_im_m * x_46_re_m) * Float64(x_46_im_m + x_46_re_m)));
	else
		tmp = Float64(-3.0 + Float64(x_46_im_m * Float64(Float64(x_46_re_m - 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.12e+20)
		tmp = (x_46_re_m * ((x_46_im_m * x_46_re_m) * 2.0)) + ((x_46_im_m * x_46_re_m) * (x_46_im_m + x_46_re_m));
	else
		tmp = -3.0 + (x_46_im_m * ((x_46_re_m - 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.12e+20], N[(N[(x$46$re$95$m * N[(N[(x$46$im$95$m * x$46$re$95$m), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision] + 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], N[(-3.0 + N[(x$46$im$95$m * N[(N[(x$46$re$95$m - x$46$im$95$m), $MachinePrecision] * N[(x$46$im$95$m + x$46$re$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x.im < 1.12e20

   1. Initial program 82.9%

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

      1. difference-of-squares 45.5%

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

      2. *-commutative 45.5%

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

   4. Applied egg-rr 85.0%

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

      1. *-commutative 85.0%

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

      2. count-2 85.0%

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

      3. *-commutative 85.0%

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

   6. Applied egg-rr 85.0%

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

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

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

   8. Taylor expanded in x.re around 0 65.7%

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

      1. unpow2 65.7%

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

      2. distribute-lft-in 66.3%

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

      3. associate-*r* 64.3%

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

      4. +-commutative 64.3%

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

      5. *-commutative 64.3%

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

   10. Simplified 64.3%

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

   if 1.12e20 < x.im

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

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

   5. Simplified 79.8%

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

      1. difference-of-squares 95.0%

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

      2. *-commutative 95.0%

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

   7. Applied egg-rr 95.0%

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

4. Final simplification 72.2%

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

Alternative 5: 90.0% accurate, 1.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) \\ x.im\_s \cdot \begin{array}{l} \mathbf{if}\;x.im\_m \leq 1.12 \cdot 10^{+20}:\\ \;\;\;\;x.re\_m \cdot \left(x.re\_m \cdot \left(x.im\_m \cdot 2\right) + x.im\_m \cdot \left(x.im\_m + x.re\_m\right)\right)\\ \mathbf{else}:\\ \;\;\;\;-3 + x.im\_m \cdot \left(\left(x.re\_m - x.im\_m\right) \cdot \left(x.im\_m + x.re\_m\right)\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.12e+20)
    (* x.re_m (+ (* x.re_m (* x.im_m 2.0)) (* x.im_m (+ x.im_m x.re_m))))
    (+ -3.0 (* x.im_m (* (- x.re_m 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.12e+20) {
		tmp = x_46_re_m * ((x_46_re_m * (x_46_im_m * 2.0)) + (x_46_im_m * (x_46_im_m + x_46_re_m)));
	} else {
		tmp = -3.0 + (x_46_im_m * ((x_46_re_m - 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.12d+20) then
        tmp = x_46re_m * ((x_46re_m * (x_46im_m * 2.0d0)) + (x_46im_m * (x_46im_m + x_46re_m)))
    else
        tmp = (-3.0d0) + (x_46im_m * ((x_46re_m - 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.12e+20) {
		tmp = x_46_re_m * ((x_46_re_m * (x_46_im_m * 2.0)) + (x_46_im_m * (x_46_im_m + x_46_re_m)));
	} else {
		tmp = -3.0 + (x_46_im_m * ((x_46_re_m - 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.12e+20:
		tmp = x_46_re_m * ((x_46_re_m * (x_46_im_m * 2.0)) + (x_46_im_m * (x_46_im_m + x_46_re_m)))
	else:
		tmp = -3.0 + (x_46_im_m * ((x_46_re_m - 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.12e+20)
		tmp = Float64(x_46_re_m * Float64(Float64(x_46_re_m * Float64(x_46_im_m * 2.0)) + Float64(x_46_im_m * Float64(x_46_im_m + x_46_re_m))));
	else
		tmp = Float64(-3.0 + Float64(x_46_im_m * Float64(Float64(x_46_re_m - 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.12e+20)
		tmp = x_46_re_m * ((x_46_re_m * (x_46_im_m * 2.0)) + (x_46_im_m * (x_46_im_m + x_46_re_m)));
	else
		tmp = -3.0 + (x_46_im_m * ((x_46_re_m - 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.12e+20], N[(x$46$re$95$m * N[(N[(x$46$re$95$m * N[(x$46$im$95$m * 2.0), $MachinePrecision]), $MachinePrecision] + N[(x$46$im$95$m * N[(x$46$im$95$m + x$46$re$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-3.0 + N[(x$46$im$95$m * N[(N[(x$46$re$95$m - x$46$im$95$m), $MachinePrecision] * N[(x$46$im$95$m + x$46$re$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x.im < 1.12e20

   1. Initial program 82.9%

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

      1. difference-of-squares 45.5%

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

      2. *-commutative 45.5%

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

   4. Applied egg-rr 85.0%

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

      1. *-commutative 85.0%

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

      2. count-2 85.0%

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

      3. *-commutative 85.0%

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

   6. Applied egg-rr 85.0%

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

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

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

      1. +-commutative 57.5%

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

      2. associate-*l* 57.5%

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

      3. add-sqr-sqrt 27.6%

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

      4. associate-*l* 27.6%

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

      5. *-commutative 27.6%

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

      6. associate-*l* 31.5%

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

      7. distribute-lft-out 31.5%

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

      8. associate-*l* 31.5%

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

      9. add-sqr-sqrt 66.8%

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

      10. *-commutative 66.8%

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

   9. Applied egg-rr 66.8%

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

   if 1.12e20 < x.im

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

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

   5. Simplified 79.8%

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

      1. difference-of-squares 95.0%

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

      2. *-commutative 95.0%

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

   7. Applied egg-rr 95.0%

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

4. Final simplification 74.1%

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

Alternative 6: 84.6% accurate, 1.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 1.12 \cdot 10^{+20}:\\ \;\;\;\;3 \cdot \left(x.im\_m \cdot \left(x.re\_m \cdot x.re\_m\right)\right)\\ \mathbf{else}:\\ \;\;\;\;-3 + x.im\_m \cdot \left(\left(x.re\_m - x.im\_m\right) \cdot \left(x.im\_m + x.re\_m\right)\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.12e+20)
    (* 3.0 (* x.im_m (* x.re_m x.re_m)))
    (+ -3.0 (* x.im_m (* (- x.re_m 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.12e+20) {
		tmp = 3.0 * (x_46_im_m * (x_46_re_m * x_46_re_m));
	} else {
		tmp = -3.0 + (x_46_im_m * ((x_46_re_m - 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.12d+20) then
        tmp = 3.0d0 * (x_46im_m * (x_46re_m * x_46re_m))
    else
        tmp = (-3.0d0) + (x_46im_m * ((x_46re_m - 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.12e+20) {
		tmp = 3.0 * (x_46_im_m * (x_46_re_m * x_46_re_m));
	} else {
		tmp = -3.0 + (x_46_im_m * ((x_46_re_m - 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.12e+20:
		tmp = 3.0 * (x_46_im_m * (x_46_re_m * x_46_re_m))
	else:
		tmp = -3.0 + (x_46_im_m * ((x_46_re_m - 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.12e+20)
		tmp = Float64(3.0 * Float64(x_46_im_m * Float64(x_46_re_m * x_46_re_m)));
	else
		tmp = Float64(-3.0 + Float64(x_46_im_m * Float64(Float64(x_46_re_m - 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.12e+20)
		tmp = 3.0 * (x_46_im_m * (x_46_re_m * x_46_re_m));
	else
		tmp = -3.0 + (x_46_im_m * ((x_46_re_m - 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.12e+20], N[(3.0 * N[(x$46$im$95$m * N[(x$46$re$95$m * x$46$re$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-3.0 + N[(x$46$im$95$m * N[(N[(x$46$re$95$m - x$46$im$95$m), $MachinePrecision] * N[(x$46$im$95$m + x$46$re$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x.im < 1.12e20

   1. Initial program 82.9%

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

   3. Simplified 89.3%

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

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

      1. unpow2 53.1%

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

   7. Applied egg-rr 53.1%

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

   if 1.12e20 < x.im

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

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

   5. Simplified 79.8%

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

      1. difference-of-squares 95.0%

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

      2. *-commutative 95.0%

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

   7. Applied egg-rr 95.0%

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

4. Final simplification 63.9%

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

Alternative 7: 82.8% 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.8 \cdot 10^{+34}:\\ \;\;\;\;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.8e+34)
    (* 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.8e+34) {
		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.8d+34) 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.8e+34) {
		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.8e+34:
		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.8e+34)
		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.8e+34)
		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.8e+34], 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.80000000000000008e34

   1. Initial program 83.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 89.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 53.3%

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

      1. unpow2 53.3%

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

   7. Applied egg-rr 53.3%

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

   if 2.80000000000000008e34 < x.im

   1. Initial program 75.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 75.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 82.2%

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

      1. difference-of-squares 98.6%

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

      2. *-commutative 98.6%

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

   7. Applied egg-rr 98.6%

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

   8. Taylor expanded in x.re around 0 93.4%

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

4. Final simplification 62.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x.im \leq 2.8 \cdot 10^{+34}:\\ \;\;\;\;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 8: 50.5% 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 81.5%

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

3. Simplified 85.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. Taylor expanded in x.re around inf 46.6%

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

   1. unpow2 46.6%

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

7. Applied egg-rr 46.6%

   \[\leadsto 3 \cdot \left(x.im \cdot \color{blue}{\left(x.re \cdot x.re\right)}\right) \]
8. 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 -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 81.5%

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

3. Taylor expanded in x.re around 0 81.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 51.3%

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

   1. difference-of-squares 58.3%

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

   2. *-commutative 58.3%

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

7. Applied egg-rr 58.3%

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

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

   \[\leadsto \color{blue}{-3} \]
9. 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 2024144 
(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)))