math.cube on complex, real part

Percentage Accurate: 82.5% → 96.6%

Time: 10.2s

Alternatives: 15

Speedup: 0.9×

• 44.4% 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.5% 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: 96.6% 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 6 \cdot 10^{+47}:\\ \;\;\;\;\mathsf{fma}\left(x.re\_m \cdot x.im, x.im \cdot -3, {x.re\_m}^{3}\right)\\ \mathbf{elif}\;x.re\_m \leq 6.2 \cdot 10^{+171}:\\ \;\;\;\;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(x.re\_m \cdot x.im + x.re\_m \cdot x.im\right)\\ \mathbf{else}:\\ \;\;\;\;x.re\_m \cdot x.re\_m\\ \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 6e+47)
    (fma (* x.re_m x.im) (* x.im -3.0) (pow x.re_m 3.0))
    (if (<= x.re_m 6.2e+171)
      (-
       (* x.re_m (* (- x.re_m x.im) (+ x.re_m x.im)))
       (* x.im (+ (* x.re_m x.im) (* x.re_m x.im))))
      (* x.re_m x.re_m)))))

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 <= 6e+47) {
		tmp = fma((x_46_re_m * x_46_im), (x_46_im * -3.0), pow(x_46_re_m, 3.0));
	} else if (x_46_re_m <= 6.2e+171) {
		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) + (x_46_re_m * x_46_im)));
	} else {
		tmp = x_46_re_m * x_46_re_m;
	}
	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 <= 6e+47)
		tmp = fma(Float64(x_46_re_m * x_46_im), Float64(x_46_im * -3.0), (x_46_re_m ^ 3.0));
	elseif (x_46_re_m <= 6.2e+171)
		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) + Float64(x_46_re_m * x_46_im))));
	else
		tmp = Float64(x_46_re_m * x_46_re_m);
	end
	return Float64(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, 6e+47], N[(N[(x$46$re$95$m * x$46$im), $MachinePrecision] * N[(x$46$im * -3.0), $MachinePrecision] + N[Power[x$46$re$95$m, 3.0], $MachinePrecision]), $MachinePrecision], If[LessEqual[x$46$re$95$m, 6.2e+171], 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] + N[(x$46$re$95$m * x$46$im), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x$46$re$95$m * x$46$re$95$m), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if x.re < 6.0000000000000003e47

   1. Initial program 83.7%

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

      \[\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. associate-*r* 81.2%

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

      2. associate-*l* 81.2%

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

      3. +-commutative 81.2%

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

      4. associate-*r* 89.1%

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

      5. associate-*r* 89.2%

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

      6. fma-define 90.7%

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

   6. Applied egg-rr 90.7%

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

   if 6.0000000000000003e47 < x.re < 6.1999999999999998e171

   1. Initial program 96.8%

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

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

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

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

   if 6.1999999999999998e171 < x.re

   1. Initial program 71.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 71.4%

      \[\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. associate-*r* 71.4%

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

      2. associate-*l* 71.4%

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

      3. +-commutative 71.4%

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

      4. associate-*r* 71.4%

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

      5. associate-*r* 71.4%

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

      6. fma-define 75.0%

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

   6. Applied egg-rr 75.0%

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

   8. Applied egg-rr 92.9%

      \[\leadsto \color{blue}{x.re \cdot x.re} \]
3. Recombined 3 regimes into one program.

4. Final simplification 92.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x.re \leq 6 \cdot 10^{+47}:\\ \;\;\;\;\mathsf{fma}\left(x.re \cdot x.im, x.im \cdot -3, {x.re}^{3}\right)\\ \mathbf{elif}\;x.re \leq 6.2 \cdot 10^{+171}:\\ \;\;\;\;x.re \cdot \left(\left(x.re - x.im\right) \cdot \left(x.re + x.im\right)\right) - x.im \cdot \left(x.re \cdot x.im + x.re \cdot x.im\right)\\ \mathbf{else}:\\ \;\;\;\;x.re \cdot x.re\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 91.0% 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.4 \cdot 10^{+171}:\\ \;\;\;\;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(x.re\_m \cdot x.im + x.re\_m \cdot x.im\right)\\ \mathbf{else}:\\ \;\;\;\;x.re\_m \cdot x.re\_m\\ \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.4e+171)
    (-
     (* x.re_m (* (- x.re_m x.im) (+ x.re_m x.im)))
     (* x.im (+ (* x.re_m x.im) (* x.re_m x.im))))
    (* x.re_m x.re_m))))

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.4e+171) {
		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) + (x_46_re_m * x_46_im)));
	} else {
		tmp = x_46_re_m * x_46_re_m;
	}
	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.4d+171) then
        tmp = (x_46re_m * ((x_46re_m - x_46im) * (x_46re_m + x_46im))) - (x_46im * ((x_46re_m * x_46im) + (x_46re_m * x_46im)))
    else
        tmp = x_46re_m * x_46re_m
    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.4e+171) {
		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) + (x_46_re_m * x_46_im)));
	} else {
		tmp = x_46_re_m * x_46_re_m;
	}
	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.4e+171:
		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) + (x_46_re_m * x_46_im)))
	else:
		tmp = x_46_re_m * x_46_re_m
	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.4e+171)
		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) + Float64(x_46_re_m * x_46_im))));
	else
		tmp = Float64(x_46_re_m * x_46_re_m);
	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.4e+171)
		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) + (x_46_re_m * x_46_im)));
	else
		tmp = x_46_re_m * x_46_re_m;
	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.4e+171], 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] + N[(x$46$re$95$m * x$46$im), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x$46$re$95$m * x$46$re$95$m), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x.re < 5.3999999999999996e171

   1. Initial program 85.5%

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

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

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

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

   if 5.3999999999999996e171 < x.re

   1. Initial program 71.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 71.4%

      \[\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. associate-*r* 71.4%

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

      2. associate-*l* 71.4%

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

      3. +-commutative 71.4%

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

      4. associate-*r* 71.4%

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

      5. associate-*r* 71.4%

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

      6. fma-define 75.0%

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

   6. Applied egg-rr 75.0%

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

   8. Applied egg-rr 92.9%

      \[\leadsto \color{blue}{x.re \cdot x.re} \]
3. Recombined 2 regimes into one program.

4. Final simplification 89.0%

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

Alternative 3: 90.6% 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 1.32 \cdot 10^{+154}:\\ \;\;\;\;x.re\_m \cdot \left(x.re\_m \cdot x.re\_m - x.im \cdot x.im\right) - x.im \cdot \left(\left(x.re\_m \cdot x.im\right) \cdot 2\right)\\ \mathbf{else}:\\ \;\;\;\;x.re\_m \cdot x.re\_m\\ \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.32e+154)
    (-
     (* x.re_m (- (* x.re_m x.re_m) (* x.im x.im)))
     (* x.im (* (* x.re_m x.im) 2.0)))
    (* x.re_m x.re_m))))

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.32e+154) {
		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) * 2.0));
	} else {
		tmp = x_46_re_m * x_46_re_m;
	}
	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.32d+154) then
        tmp = (x_46re_m * ((x_46re_m * x_46re_m) - (x_46im * x_46im))) - (x_46im * ((x_46re_m * x_46im) * 2.0d0))
    else
        tmp = x_46re_m * x_46re_m
    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.32e+154) {
		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) * 2.0));
	} else {
		tmp = x_46_re_m * x_46_re_m;
	}
	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.32e+154:
		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) * 2.0))
	else:
		tmp = x_46_re_m * x_46_re_m
	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.32e+154)
		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) * 2.0)));
	else
		tmp = Float64(x_46_re_m * x_46_re_m);
	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.32e+154)
		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) * 2.0));
	else
		tmp = x_46_re_m * x_46_re_m;
	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.32e+154], 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] * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x$46$re$95$m * x$46$re$95$m), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x.re < 1.31999999999999998e154

   1. Initial program 85.8%

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

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

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

      3. *-un-lft-identity 85.8%

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

      4. distribute-rgt-out 85.8%

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

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

   4. Applied egg-rr 85.8%

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

   if 1.31999999999999998e154 < x.re

   1. Initial program 71.0%

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

      \[\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. associate-*r* 71.0%

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

      2. associate-*l* 71.0%

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

      3. +-commutative 71.0%

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

      4. associate-*r* 71.0%

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

      5. associate-*r* 71.0%

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

      6. fma-define 74.2%

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

   6. Applied egg-rr 74.2%

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

   8. Applied egg-rr 90.3%

      \[\leadsto \color{blue}{x.re \cdot x.re} \]
3. Recombined 2 regimes into one program.

4. Final simplification 86.3%

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

Alternative 4: 74.4% 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.im \leq 4.2 \cdot 10^{+138}:\\ \;\;\;\;x.re\_m \cdot \left(x.re\_m \cdot x.re\_m - x.im \cdot x.im\right)\\ \mathbf{else}:\\ \;\;\;\;\left(x.re\_m \cdot x.im\right) \cdot \left(-27 - x.im \cdot 2\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.im 4.2e+138)
    (* x.re_m (- (* x.re_m x.re_m) (* x.im x.im)))
    (* (* x.re_m x.im) (- -27.0 (* x.im 2.0))))))

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_im <= 4.2e+138) {
		tmp = x_46_re_m * ((x_46_re_m * x_46_re_m) - (x_46_im * x_46_im));
	} else {
		tmp = (x_46_re_m * x_46_im) * (-27.0 - (x_46_im * 2.0));
	}
	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_46im <= 4.2d+138) then
        tmp = x_46re_m * ((x_46re_m * x_46re_m) - (x_46im * x_46im))
    else
        tmp = (x_46re_m * x_46im) * ((-27.0d0) - (x_46im * 2.0d0))
    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_im <= 4.2e+138) {
		tmp = x_46_re_m * ((x_46_re_m * x_46_re_m) - (x_46_im * x_46_im));
	} else {
		tmp = (x_46_re_m * x_46_im) * (-27.0 - (x_46_im * 2.0));
	}
	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_im <= 4.2e+138:
		tmp = x_46_re_m * ((x_46_re_m * x_46_re_m) - (x_46_im * x_46_im))
	else:
		tmp = (x_46_re_m * x_46_im) * (-27.0 - (x_46_im * 2.0))
	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_im <= 4.2e+138)
		tmp = Float64(x_46_re_m * Float64(Float64(x_46_re_m * x_46_re_m) - Float64(x_46_im * x_46_im)));
	else
		tmp = Float64(Float64(x_46_re_m * x_46_im) * Float64(-27.0 - Float64(x_46_im * 2.0)));
	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_im <= 4.2e+138)
		tmp = x_46_re_m * ((x_46_re_m * x_46_re_m) - (x_46_im * x_46_im));
	else
		tmp = (x_46_re_m * x_46_im) * (-27.0 - (x_46_im * 2.0));
	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$im, 4.2e+138], 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[(N[(x$46$re$95$m * x$46$im), $MachinePrecision] * N[(-27.0 - N[(x$46$im * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x.im < 4.20000000000000014e138

   1. Initial program 90.0%

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

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

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

      3. *-un-lft-identity 90.0%

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

      4. distribute-rgt-out 90.0%

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

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

   4. Applied egg-rr 90.0%

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

      1. *-commutative 90.0%

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

      2. *-commutative 90.0%

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

      3. count-2 90.0%

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

      4. flip-+ 0.0%

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

      5. *-commutative 0.0%

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

      6. +-inverses 0.0%

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

      7. +-inverses 0.0%

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

      8. *-commutative 0.0%

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

      9. associate-*r/ 0.0%

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

      10. *-commutative 0.0%

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

      11. +-inverses 0.0%

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

      12. *-commutative 0.0%

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

      13. +-inverses 0.0%

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

   6. Applied egg-rr 0.0%

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

   8. Simplified 79.1%

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

   if 4.20000000000000014e138 < x.im

   1. Initial program 49.5%

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

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

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

   6. Simplified 54.2%

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

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

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

      1. *-commutative 67.3%

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

      2. associate-*l* 67.3%

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

   9. Simplified 67.3%

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

       1. *-commutative 49.5%

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

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

       3. *-un-lft-identity 49.5%

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

       4. distribute-rgt-out 49.5%

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

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

   11. Applied egg-rr 67.3%

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

       1. associate-*r* 67.3%

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

       2. *-commutative 67.3%

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

       3. associate-*l* 67.3%

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

       4. distribute-lft-out-- 67.3%

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

       5. *-commutative 67.3%

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

   13. Applied egg-rr 67.3%

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

4. Final simplification 77.3%

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

Alternative 5: 41.6% 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.im \leq 8.8 \cdot 10^{+80}:\\ \;\;\;\;x.re\_m \cdot x.re\_m\\ \mathbf{else}:\\ \;\;\;\;\left(x.re\_m \cdot x.im\right) \cdot \left(-27 - x.im \cdot 2\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.im 8.8e+80)
    (* x.re_m x.re_m)
    (* (* x.re_m x.im) (- -27.0 (* x.im 2.0))))))

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_im <= 8.8e+80) {
		tmp = x_46_re_m * x_46_re_m;
	} else {
		tmp = (x_46_re_m * x_46_im) * (-27.0 - (x_46_im * 2.0));
	}
	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_46im <= 8.8d+80) then
        tmp = x_46re_m * x_46re_m
    else
        tmp = (x_46re_m * x_46im) * ((-27.0d0) - (x_46im * 2.0d0))
    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_im <= 8.8e+80) {
		tmp = x_46_re_m * x_46_re_m;
	} else {
		tmp = (x_46_re_m * x_46_im) * (-27.0 - (x_46_im * 2.0));
	}
	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_im <= 8.8e+80:
		tmp = x_46_re_m * x_46_re_m
	else:
		tmp = (x_46_re_m * x_46_im) * (-27.0 - (x_46_im * 2.0))
	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_im <= 8.8e+80)
		tmp = Float64(x_46_re_m * x_46_re_m);
	else
		tmp = Float64(Float64(x_46_re_m * x_46_im) * Float64(-27.0 - Float64(x_46_im * 2.0)));
	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_im <= 8.8e+80)
		tmp = x_46_re_m * x_46_re_m;
	else
		tmp = (x_46_re_m * x_46_im) * (-27.0 - (x_46_im * 2.0));
	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$im, 8.8e+80], N[(x$46$re$95$m * x$46$re$95$m), $MachinePrecision], N[(N[(x$46$re$95$m * x$46$im), $MachinePrecision] * N[(-27.0 - N[(x$46$im * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x.im < 8.80000000000000011e80

   1. Initial program 90.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 88.6%

      \[\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. associate-*r* 88.6%

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

      2. associate-*l* 88.6%

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

      3. +-commutative 88.6%

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

      4. associate-*r* 90.7%

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

      5. associate-*r* 90.8%

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

      6. fma-define 92.2%

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

   6. Applied egg-rr 92.2%

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

   8. Applied egg-rr 29.1%

      \[\leadsto \color{blue}{x.re \cdot x.re} \]

   if 8.80000000000000011e80 < x.im

   1. Initial program 53.7%

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

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

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

   6. Simplified 45.8%

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

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

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

      1. *-commutative 56.2%

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

      2. associate-*l* 56.2%

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

   9. Simplified 56.2%

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

       1. *-commutative 53.7%

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

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

       3. *-un-lft-identity 53.7%

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

       4. distribute-rgt-out 53.7%

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

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

   11. Applied egg-rr 56.2%

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

       1. associate-*r* 56.2%

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

       2. *-commutative 56.2%

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

       3. associate-*l* 56.2%

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

       4. distribute-lft-out-- 56.2%

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

       5. *-commutative 56.2%

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

   13. Applied egg-rr 56.2%

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

Alternative 6: 41.2% 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.im \leq 5.8 \cdot 10^{+80}:\\ \;\;\;\;x.re\_m \cdot x.re\_m\\ \mathbf{else}:\\ \;\;\;\;x.re\_m \cdot \left(x.im \cdot \left(-27 - x.im \cdot 2\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.im 5.8e+80)
    (* x.re_m x.re_m)
    (* x.re_m (* x.im (- -27.0 (* x.im 2.0)))))))

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_im <= 5.8e+80) {
		tmp = x_46_re_m * x_46_re_m;
	} else {
		tmp = x_46_re_m * (x_46_im * (-27.0 - (x_46_im * 2.0)));
	}
	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_46im <= 5.8d+80) then
        tmp = x_46re_m * x_46re_m
    else
        tmp = x_46re_m * (x_46im * ((-27.0d0) - (x_46im * 2.0d0)))
    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_im <= 5.8e+80) {
		tmp = x_46_re_m * x_46_re_m;
	} else {
		tmp = x_46_re_m * (x_46_im * (-27.0 - (x_46_im * 2.0)));
	}
	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_im <= 5.8e+80:
		tmp = x_46_re_m * x_46_re_m
	else:
		tmp = x_46_re_m * (x_46_im * (-27.0 - (x_46_im * 2.0)))
	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_im <= 5.8e+80)
		tmp = Float64(x_46_re_m * x_46_re_m);
	else
		tmp = Float64(x_46_re_m * Float64(x_46_im * Float64(-27.0 - Float64(x_46_im * 2.0))));
	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_im <= 5.8e+80)
		tmp = x_46_re_m * x_46_re_m;
	else
		tmp = x_46_re_m * (x_46_im * (-27.0 - (x_46_im * 2.0)));
	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$im, 5.8e+80], N[(x$46$re$95$m * x$46$re$95$m), $MachinePrecision], N[(x$46$re$95$m * N[(x$46$im * N[(-27.0 - N[(x$46$im * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x.im < 5.79999999999999971e80

   1. Initial program 90.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 88.6%

      \[\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. associate-*r* 88.6%

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

      2. associate-*l* 88.6%

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

      3. +-commutative 88.6%

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

      4. associate-*r* 90.7%

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

      5. associate-*r* 90.8%

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

      6. fma-define 92.2%

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

   6. Applied egg-rr 92.2%

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

   8. Applied egg-rr 29.1%

      \[\leadsto \color{blue}{x.re \cdot x.re} \]

   if 5.79999999999999971e80 < x.im

   1. Initial program 53.7%

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

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

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

   6. Simplified 45.8%

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

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

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

      1. *-commutative 56.2%

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

      2. associate-*l* 56.2%

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

   9. Simplified 56.2%

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

       1. *-commutative 53.7%

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

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

       3. *-un-lft-identity 53.7%

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

       4. distribute-rgt-out 53.7%

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

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

   11. Applied egg-rr 56.2%

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

   12. Taylor expanded in x.im around 0 56.2%

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

       1. *-commutative 56.2%

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

       2. metadata-eval 56.2%

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

       3. *-commutative 56.2%

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

       4. cancel-sign-sub-inv 56.2%

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

       5. *-commutative 56.2%

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

       6. associate-*r* 56.2%

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

       7. distribute-lft-out-- 56.2%

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

       8. associate-*r* 56.2%

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

       9. *-commutative 56.2%

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

       10. associate-*l* 53.0%

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

   14. Simplified 53.0%

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

Alternative 7: 37.9% accurate, 1.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.im \leq 7 \cdot 10^{+170}:\\ \;\;\;\;x.re\_m \cdot x.re\_m\\ \mathbf{else}:\\ \;\;\;\;x.im \cdot \left(x.re\_m \cdot -27\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.im 7e+170) (* x.re_m x.re_m) (* x.im (* x.re_m -27.0)))))

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_im <= 7e+170) {
		tmp = x_46_re_m * x_46_re_m;
	} else {
		tmp = x_46_im * (x_46_re_m * -27.0);
	}
	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_46im <= 7d+170) then
        tmp = x_46re_m * x_46re_m
    else
        tmp = x_46im * (x_46re_m * (-27.0d0))
    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_im <= 7e+170) {
		tmp = x_46_re_m * x_46_re_m;
	} else {
		tmp = x_46_im * (x_46_re_m * -27.0);
	}
	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_im <= 7e+170:
		tmp = x_46_re_m * x_46_re_m
	else:
		tmp = x_46_im * (x_46_re_m * -27.0)
	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_im <= 7e+170)
		tmp = Float64(x_46_re_m * x_46_re_m);
	else
		tmp = Float64(x_46_im * Float64(x_46_re_m * -27.0));
	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_im <= 7e+170)
		tmp = x_46_re_m * x_46_re_m;
	else
		tmp = x_46_im * (x_46_re_m * -27.0);
	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$im, 7e+170], N[(x$46$re$95$m * x$46$re$95$m), $MachinePrecision], N[(x$46$im * N[(x$46$re$95$m * -27.0), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x.im < 7.00000000000000011e170

   1. Initial program 89.0%

      \[\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.3%

      \[\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. associate-*r* 86.3%

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

      2. associate-*l* 86.4%

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

      3. +-commutative 86.4%

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

      4. associate-*r* 89.2%

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

      5. associate-*r* 89.2%

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

      6. fma-define 91.0%

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

   6. Applied egg-rr 91.0%

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

   8. Applied egg-rr 27.5%

      \[\leadsto \color{blue}{x.re \cdot x.re} \]

   if 7.00000000000000011e170 < x.im

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

   6. Simplified 58.0%

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

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

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

      1. *-commutative 70.9%

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

      2. associate-*l* 70.9%

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

   9. Simplified 70.9%

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

       1. *-commutative 47.4%

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

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

       3. *-un-lft-identity 47.4%

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

       4. distribute-rgt-out 47.4%

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

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

   11. Applied egg-rr 70.9%

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

   12. Taylor expanded in x.im around 0 29.8%

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

       1. *-commutative 29.8%

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

       2. associate-*r* 29.8%

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

       3. *-commutative 29.8%

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

       4. *-commutative 29.8%

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

   14. Simplified 29.8%

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

Alternative 8: 37.9% accurate, 1.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.im \leq 2.1 \cdot 10^{+168}:\\ \;\;\;\;x.re\_m \cdot x.re\_m\\ \mathbf{else}:\\ \;\;\;\;\left(x.re\_m \cdot x.im\right) \cdot -27\\ \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.im 2.1e+168) (* x.re_m x.re_m) (* (* x.re_m x.im) -27.0))))

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_im <= 2.1e+168) {
		tmp = x_46_re_m * x_46_re_m;
	} else {
		tmp = (x_46_re_m * x_46_im) * -27.0;
	}
	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_46im <= 2.1d+168) then
        tmp = x_46re_m * x_46re_m
    else
        tmp = (x_46re_m * x_46im) * (-27.0d0)
    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_im <= 2.1e+168) {
		tmp = x_46_re_m * x_46_re_m;
	} else {
		tmp = (x_46_re_m * x_46_im) * -27.0;
	}
	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_im <= 2.1e+168:
		tmp = x_46_re_m * x_46_re_m
	else:
		tmp = (x_46_re_m * x_46_im) * -27.0
	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_im <= 2.1e+168)
		tmp = Float64(x_46_re_m * x_46_re_m);
	else
		tmp = Float64(Float64(x_46_re_m * x_46_im) * -27.0);
	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_im <= 2.1e+168)
		tmp = x_46_re_m * x_46_re_m;
	else
		tmp = (x_46_re_m * x_46_im) * -27.0;
	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$im, 2.1e+168], N[(x$46$re$95$m * x$46$re$95$m), $MachinePrecision], N[(N[(x$46$re$95$m * x$46$im), $MachinePrecision] * -27.0), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x.im < 2.10000000000000003e168

   1. Initial program 89.0%

      \[\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.3%

      \[\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. associate-*r* 86.3%

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

      2. associate-*l* 86.4%

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

      3. +-commutative 86.4%

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

      4. associate-*r* 89.2%

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

      5. associate-*r* 89.2%

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

      6. fma-define 91.0%

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

   6. Applied egg-rr 91.0%

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

   8. Applied egg-rr 27.5%

      \[\leadsto \color{blue}{x.re \cdot x.re} \]

   if 2.10000000000000003e168 < x.im

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

   6. Simplified 58.0%

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

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

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

      1. *-commutative 70.9%

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

      2. associate-*l* 70.9%

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

   9. Simplified 70.9%

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

       1. *-commutative 47.4%

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

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

       3. *-un-lft-identity 47.4%

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

       4. distribute-rgt-out 47.4%

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

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

   11. Applied egg-rr 70.9%

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

   12. Taylor expanded in x.im around 0 29.8%

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

4. Final simplification 27.8%

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

Alternative 9: 36.6% accurate, 2.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.im \leq 7.9 \cdot 10^{+177}:\\ \;\;\;\;x.re\_m \cdot x.re\_m\\ \mathbf{else}:\\ \;\;\;\;x.re\_m \cdot \left(-x.re\_m\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.im 7.9e+177) (* x.re_m x.re_m) (* x.re_m (- x.re_m)))))

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_im <= 7.9e+177) {
		tmp = x_46_re_m * x_46_re_m;
	} else {
		tmp = x_46_re_m * -x_46_re_m;
	}
	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_46im <= 7.9d+177) then
        tmp = x_46re_m * x_46re_m
    else
        tmp = x_46re_m * -x_46re_m
    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_im <= 7.9e+177) {
		tmp = x_46_re_m * x_46_re_m;
	} else {
		tmp = x_46_re_m * -x_46_re_m;
	}
	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_im <= 7.9e+177:
		tmp = x_46_re_m * x_46_re_m
	else:
		tmp = x_46_re_m * -x_46_re_m
	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_im <= 7.9e+177)
		tmp = Float64(x_46_re_m * x_46_re_m);
	else
		tmp = Float64(x_46_re_m * Float64(-x_46_re_m));
	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_im <= 7.9e+177)
		tmp = x_46_re_m * x_46_re_m;
	else
		tmp = x_46_re_m * -x_46_re_m;
	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$im, 7.9e+177], N[(x$46$re$95$m * x$46$re$95$m), $MachinePrecision], N[(x$46$re$95$m * (-x$46$re$95$m)), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x.im < 7.8999999999999999e177

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

   3. Simplified 85.6%

      \[\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. associate-*r* 85.6%

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

      2. associate-*l* 85.6%

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

      3. +-commutative 85.6%

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

      4. associate-*r* 88.8%

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

      5. associate-*r* 88.9%

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

      6. fma-define 90.6%

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

   6. Applied egg-rr 90.6%

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

   8. Applied egg-rr 27.2%

      \[\leadsto \color{blue}{x.re \cdot x.re} \]

   if 7.8999999999999999e177 < x.im

   1. Initial program 50.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 43.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. associate-*r* 43.5%

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

      2. associate-*l* 43.5%

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

      3. +-commutative 43.5%

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

      4. associate-*r* 72.3%

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

      5. associate-*r* 72.2%

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

      6. fma-define 72.2%

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

   6. Applied egg-rr 72.2%

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

   8. Applied egg-rr 8.3%

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

      1. fma-undefine 8.3%

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

      2. +-commutative 8.3%

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

      3. associate-+r+ 8.3%

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

      4. count-2 8.3%

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

      5. distribute-rgt-out 8.3%

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

      6. unsub-neg 8.3%

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

   10. Simplified 8.3%

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

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

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

       1. neg-mul-1 8.7%

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

   13. Simplified 8.7%

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

Alternative 10: 38.8% accurate, 2.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.05 \cdot 10^{-55}:\\ \;\;\;\;x.re\_m - x.re\_m\\ \mathbf{else}:\\ \;\;\;\;x.re\_m \cdot x.re\_m\\ \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.05e-55) (- x.re_m x.re_m) (* x.re_m x.re_m))))

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.05e-55) {
		tmp = x_46_re_m - x_46_re_m;
	} else {
		tmp = x_46_re_m * x_46_re_m;
	}
	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.05d-55) then
        tmp = x_46re_m - x_46re_m
    else
        tmp = x_46re_m * x_46re_m
    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.05e-55) {
		tmp = x_46_re_m - x_46_re_m;
	} else {
		tmp = x_46_re_m * x_46_re_m;
	}
	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.05e-55:
		tmp = x_46_re_m - x_46_re_m
	else:
		tmp = x_46_re_m * x_46_re_m
	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.05e-55)
		tmp = Float64(x_46_re_m - x_46_re_m);
	else
		tmp = Float64(x_46_re_m * x_46_re_m);
	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.05e-55)
		tmp = x_46_re_m - x_46_re_m;
	else
		tmp = x_46_re_m * x_46_re_m;
	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.05e-55], N[(x$46$re$95$m - x$46$re$95$m), $MachinePrecision], N[(x$46$re$95$m * x$46$re$95$m), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x.re < 1.0500000000000001e-55

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

   3. Simplified 79.4%

      \[\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. associate-*r* 79.4%

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

      2. associate-*l* 79.5%

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

      3. +-commutative 79.5%

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

      4. associate-*r* 88.1%

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

      5. associate-*r* 88.2%

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

      6. fma-define 89.8%

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

   6. Applied egg-rr 89.8%

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

   8. Applied egg-rr 19.4%

      \[\leadsto \color{blue}{x.re - x.re} \]

   if 1.0500000000000001e-55 < x.re

   1. Initial program 88.1%

      \[\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.2%

      \[\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. associate-*r* 84.2%

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

      2. associate-*l* 84.2%

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

      3. +-commutative 84.2%

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

      4. associate-*r* 84.2%

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

      5. associate-*r* 84.2%

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

      6. fma-define 85.5%

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

   6. Applied egg-rr 85.5%

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

   8. Applied egg-rr 40.0%

      \[\leadsto \color{blue}{x.re \cdot x.re} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 11: 36.1% accurate, 6.3× 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 x.re\_m\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 x.re_m)))

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 * x_46_re_m);
}

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 * x_46re_m)
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 * x_46_re_m);
}

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 * x_46_re_m)

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 * x_46_re_m))
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 * x_46_re_m);
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 * x$46$re$95$m), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 84.0%

   \[\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 80.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. associate-*r* 80.8%

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

   2. associate-*l* 80.9%

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

   3. +-commutative 80.9%

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

   4. associate-*r* 87.0%

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

   5. associate-*r* 87.0%

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

   6. fma-define 88.5%

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

6. Applied egg-rr 88.5%

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

8. Applied egg-rr 25.9%

   \[\leadsto \color{blue}{x.re \cdot x.re} \]
9. Add Preprocessing

Alternative 12: 6.5% accurate, 6.3× 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 7625597484989\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 7625597484989.0)))

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 * 7625597484989.0);
}

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 * 7625597484989.0d0)
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 * 7625597484989.0);
}

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 * 7625597484989.0)

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 * 7625597484989.0))
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 * 7625597484989.0);
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 * 7625597484989.0), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 84.0%

   \[\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 80.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. associate-*r* 80.8%

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

   2. associate-*l* 80.9%

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

   3. +-commutative 80.9%

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

   4. associate-*r* 87.0%

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

   5. associate-*r* 87.0%

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

   6. fma-define 88.5%

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

6. Applied egg-rr 88.5%

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

8. Applied egg-rr 5.6%

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

   1. fma-undefine 5.6%

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

   2. +-commutative 5.6%

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

   3. associate-+r+ 5.6%

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

   4. count-2 5.6%

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

   5. *-commutative 5.6%

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

   6. distribute-lft-neg-out 5.6%

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

   7. distribute-rgt-neg-in 5.6%

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

   8. distribute-lft-out 5.6%

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

   9. metadata-eval 5.6%

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

   10. metadata-eval 5.6%

       \[\leadsto x.re \cdot \color{blue}{7625597484989} \]

10. Simplified 5.6%

    \[\leadsto \color{blue}{x.re \cdot 7625597484989} \]
11. Add Preprocessing

Alternative 13: 3.1% accurate, 9.5× 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\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)))

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;
}

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
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;
}

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

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))
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;
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 * (-x$46$re$95$m)), $MachinePrecision]

Derivation

1. Initial program 84.0%

   \[\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 80.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. associate-*r* 80.8%

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

   2. associate-*l* 80.9%

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

   3. +-commutative 80.9%

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

   4. associate-*r* 87.0%

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

   5. associate-*r* 87.0%

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

   6. fma-define 88.5%

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

6. Applied egg-rr 88.5%

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

8. Applied egg-rr 2.2%

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

   1. sub-neg 2.2%

      \[\leadsto \color{blue}{-7625597484987 - x.re} \]

10. Simplified 2.2%

    \[\leadsto \color{blue}{-7625597484987 - x.re} \]

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

    \[\leadsto \color{blue}{-1 \cdot x.re} \]

13. Simplified 2.9%

    \[\leadsto \color{blue}{-x.re} \]
14. Add Preprocessing

Alternative 14: 2.7% accurate, 19.0× 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 1 \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 1.0))

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 * 1.0;
}

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 * 1.0d0
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 * 1.0;
}

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 * 1.0

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 * 1.0)
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 * 1.0;
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 * 1.0), $MachinePrecision]

Derivation

1. Initial program 84.0%

   \[\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 80.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. associate-*r* 80.8%

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

   2. associate-*l* 80.9%

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

   3. +-commutative 80.9%

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

   4. associate-*r* 87.0%

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

   5. associate-*r* 87.0%

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

   6. fma-define 88.5%

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

6. Applied egg-rr 88.5%

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

8. Applied egg-rr 2.7%

   \[\leadsto \color{blue}{\frac{x.re}{x.re}} \]
9. Step-by-step derivation

   1. *-inverses 2.7%

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

10. Simplified 2.7%

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

Alternative 15: 2.7% accurate, 19.0× 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 -7625597484987 \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 -7625597484987.0))

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 * -7625597484987.0;
}

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 * (-7625597484987.0d0)
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 * -7625597484987.0;
}

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 * -7625597484987.0

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 * -7625597484987.0)
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 * -7625597484987.0;
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 * -7625597484987.0), $MachinePrecision]

Derivation

1. Initial program 84.0%

   \[\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 80.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. associate-*r* 80.8%

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

   2. associate-*l* 80.9%

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

   3. +-commutative 80.9%

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

   4. associate-*r* 87.0%

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

   5. associate-*r* 87.0%

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

   6. fma-define 88.5%

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

6. Applied egg-rr 88.5%

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

8. Applied egg-rr 2.2%

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

   1. sub-neg 2.2%

      \[\leadsto \color{blue}{-7625597484987 - x.re} \]

10. Simplified 2.2%

    \[\leadsto \color{blue}{-7625597484987 - x.re} \]

11. Taylor expanded in x.re around 0 2.5%

    \[\leadsto \color{blue}{-7625597484987} \]
12. Add Preprocessing

Developer Target 1: 87.4% 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 2024137 
(FPCore (x.re x.im)
  :name "math.cube on complex, real part"
  :precision binary64

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

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