math.cube on complex, real part

Percentage Accurate: 82.4% → 96.2%

Time: 7.3s

Alternatives: 11

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.4% 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.2% 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 \cdot \left(x.re\_m \cdot x.re\_m - x.im \cdot x.im\right) - x.im \cdot \left(x.re\_m \cdot x.im + x.re\_m \cdot x.im\right) \leq -2 \cdot 10^{-318}:\\ \;\;\;\;-3 \cdot {\left(x.im \cdot \sqrt{x.re\_m}\right)}^{2}\\ \mathbf{else}:\\ \;\;\;\;{x.re\_m}^{3}\\ \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 (- (* x.re_m x.re_m) (* x.im x.im)))
        (* x.im (+ (* x.re_m x.im) (* x.re_m x.im))))
       -2e-318)
    (* -3.0 (pow (* x.im (sqrt x.re_m)) 2.0))
    (pow x.re_m 3.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_re_m * ((x_46_re_m * x_46_re_m) - (x_46_im * x_46_im))) - (x_46_im * ((x_46_re_m * x_46_im) + (x_46_re_m * x_46_im)))) <= -2e-318) {
		tmp = -3.0 * pow((x_46_im * sqrt(x_46_re_m)), 2.0);
	} else {
		tmp = pow(x_46_re_m, 3.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_46re_m * ((x_46re_m * x_46re_m) - (x_46im * x_46im))) - (x_46im * ((x_46re_m * x_46im) + (x_46re_m * x_46im)))) <= (-2d-318)) then
        tmp = (-3.0d0) * ((x_46im * sqrt(x_46re_m)) ** 2.0d0)
    else
        tmp = x_46re_m ** 3.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_re_m * ((x_46_re_m * x_46_re_m) - (x_46_im * x_46_im))) - (x_46_im * ((x_46_re_m * x_46_im) + (x_46_re_m * x_46_im)))) <= -2e-318) {
		tmp = -3.0 * Math.pow((x_46_im * Math.sqrt(x_46_re_m)), 2.0);
	} else {
		tmp = Math.pow(x_46_re_m, 3.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_re_m * ((x_46_re_m * x_46_re_m) - (x_46_im * x_46_im))) - (x_46_im * ((x_46_re_m * x_46_im) + (x_46_re_m * x_46_im)))) <= -2e-318:
		tmp = -3.0 * math.pow((x_46_im * math.sqrt(x_46_re_m)), 2.0)
	else:
		tmp = math.pow(x_46_re_m, 3.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 (Float64(Float64(x_46_re_m * Float64(Float64(x_46_re_m * x_46_re_m) - Float64(x_46_im * x_46_im))) - Float64(x_46_im * Float64(Float64(x_46_re_m * x_46_im) + Float64(x_46_re_m * x_46_im)))) <= -2e-318)
		tmp = Float64(-3.0 * (Float64(x_46_im * sqrt(x_46_re_m)) ^ 2.0));
	else
		tmp = x_46_re_m ^ 3.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_re_m * ((x_46_re_m * x_46_re_m) - (x_46_im * x_46_im))) - (x_46_im * ((x_46_re_m * x_46_im) + (x_46_re_m * x_46_im)))) <= -2e-318)
		tmp = -3.0 * ((x_46_im * sqrt(x_46_re_m)) ^ 2.0);
	else
		tmp = x_46_re_m ^ 3.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[N[(N[(x$46$re$95$m * N[(N[(x$46$re$95$m * x$46$re$95$m), $MachinePrecision] - N[(x$46$im * x$46$im), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(x$46$im * N[(N[(x$46$re$95$m * x$46$im), $MachinePrecision] + N[(x$46$re$95$m * x$46$im), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -2e-318], N[(-3.0 * N[Power[N[(x$46$im * N[Sqrt[x$46$re$95$m], $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], N[Power[x$46$re$95$m, 3.0], $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (*.f64 (-.f64 (*.f64 x.re x.re) (*.f64 x.im x.im)) x.re) (*.f64 (+.f64 (*.f64 x.re x.im) (*.f64 x.im x.re)) x.im)) < -2.0000024e-318

   1. Initial program 88.6%

      \[\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 87.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* 87.6%

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

      2. associate-*l* 87.6%

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

      3. +-commutative 87.6%

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

      4. associate-*l* 87.6%

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

      5. associate-*r* 87.6%

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

      6. associate-*r* 98.7%

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

      7. fma-define 98.7%

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

   6. Applied egg-rr 98.7%

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

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

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

      1. add-sqr-sqrt 37.0%

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

      2. pow2 37.0%

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

      3. sqrt-prod 36.4%

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

      4. sqrt-pow1 47.5%

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

      5. metadata-eval 47.5%

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

      6. pow1 47.5%

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

   9. Applied egg-rr 47.5%

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

   if -2.0000024e-318 < (-.f64 (*.f64 (-.f64 (*.f64 x.re x.re) (*.f64 x.im x.im)) x.re) (*.f64 (+.f64 (*.f64 x.re x.im) (*.f64 x.im x.re)) x.im))

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

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

4. Final simplification 62.3%

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

Alternative 2: 90.6% accurate, 0.2× speedup

Math

\[\begin{array}{l} x.re\_m = \left|x.re\right| \\ x.re\_s = \mathsf{copysign}\left(1, x.re\right) \\ \begin{array}{l} t_0 := x.re\_m \cdot \left(x.re\_m \cdot x.re\_m - x.im \cdot x.im\right)\\ x.re\_s \cdot \begin{array}{l} \mathbf{if}\;t\_0 - x.im \cdot \left(x.re\_m \cdot x.im + x.re\_m \cdot x.im\right) \leq 10^{+220}:\\ \;\;\;\;t\_0 - x.im \cdot \left(\left(x.re\_m \cdot x.im\right) \cdot 2\right)\\ \mathbf{else}:\\ \;\;\;\;{x.re\_m}^{3}\\ \end{array} \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
 (let* ((t_0 (* x.re_m (- (* x.re_m x.re_m) (* x.im x.im)))))
   (*
    x.re_s
    (if (<= (- t_0 (* x.im (+ (* x.re_m x.im) (* x.re_m x.im)))) 1e+220)
      (- t_0 (* x.im (* (* x.re_m x.im) 2.0)))
      (pow x.re_m 3.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 t_0 = x_46_re_m * ((x_46_re_m * x_46_re_m) - (x_46_im * x_46_im));
	double tmp;
	if ((t_0 - (x_46_im * ((x_46_re_m * x_46_im) + (x_46_re_m * x_46_im)))) <= 1e+220) {
		tmp = t_0 - (x_46_im * ((x_46_re_m * x_46_im) * 2.0));
	} else {
		tmp = pow(x_46_re_m, 3.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) :: t_0
    real(8) :: tmp
    t_0 = x_46re_m * ((x_46re_m * x_46re_m) - (x_46im * x_46im))
    if ((t_0 - (x_46im * ((x_46re_m * x_46im) + (x_46re_m * x_46im)))) <= 1d+220) then
        tmp = t_0 - (x_46im * ((x_46re_m * x_46im) * 2.0d0))
    else
        tmp = x_46re_m ** 3.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 t_0 = x_46_re_m * ((x_46_re_m * x_46_re_m) - (x_46_im * x_46_im));
	double tmp;
	if ((t_0 - (x_46_im * ((x_46_re_m * x_46_im) + (x_46_re_m * x_46_im)))) <= 1e+220) {
		tmp = t_0 - (x_46_im * ((x_46_re_m * x_46_im) * 2.0));
	} else {
		tmp = Math.pow(x_46_re_m, 3.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):
	t_0 = x_46_re_m * ((x_46_re_m * x_46_re_m) - (x_46_im * x_46_im))
	tmp = 0
	if (t_0 - (x_46_im * ((x_46_re_m * x_46_im) + (x_46_re_m * x_46_im)))) <= 1e+220:
		tmp = t_0 - (x_46_im * ((x_46_re_m * x_46_im) * 2.0))
	else:
		tmp = math.pow(x_46_re_m, 3.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)
	t_0 = Float64(x_46_re_m * Float64(Float64(x_46_re_m * x_46_re_m) - Float64(x_46_im * x_46_im)))
	tmp = 0.0
	if (Float64(t_0 - Float64(x_46_im * Float64(Float64(x_46_re_m * x_46_im) + Float64(x_46_re_m * x_46_im)))) <= 1e+220)
		tmp = Float64(t_0 - Float64(x_46_im * Float64(Float64(x_46_re_m * x_46_im) * 2.0)));
	else
		tmp = x_46_re_m ^ 3.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)
	t_0 = x_46_re_m * ((x_46_re_m * x_46_re_m) - (x_46_im * x_46_im));
	tmp = 0.0;
	if ((t_0 - (x_46_im * ((x_46_re_m * x_46_im) + (x_46_re_m * x_46_im)))) <= 1e+220)
		tmp = t_0 - (x_46_im * ((x_46_re_m * x_46_im) * 2.0));
	else
		tmp = x_46_re_m ^ 3.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_] := Block[{t$95$0 = 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$re$95$s * If[LessEqual[N[(t$95$0 - 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], 1e+220], N[(t$95$0 - N[(x$46$im * N[(N[(x$46$re$95$m * x$46$im), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Power[x$46$re$95$m, 3.0], $MachinePrecision]]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (*.f64 (-.f64 (*.f64 x.re x.re) (*.f64 x.im x.im)) x.re) (*.f64 (+.f64 (*.f64 x.re x.im) (*.f64 x.im x.re)) x.im)) < 1e220

   1. Initial program 93.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. *-un-lft-identity 93.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.im \cdot x.re\right) \cdot x.im \]

      2. *-commutative 93.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}{x.re \cdot x.im}\right) \cdot x.im \]

      3. *-un-lft-identity 93.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 93.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 93.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 93.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 1e220 < (-.f64 (*.f64 (-.f64 (*.f64 x.re x.re) (*.f64 x.im x.im)) x.re) (*.f64 (+.f64 (*.f64 x.re x.im) (*.f64 x.im x.re)) x.im))

   1. Initial program 55.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 51.7%

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

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

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

4. Final simplification 85.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x.re \cdot \left(x.re \cdot x.re - x.im \cdot x.im\right) - x.im \cdot \left(x.re \cdot x.im + x.re \cdot x.im\right) \leq 10^{+220}:\\ \;\;\;\;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}^{3}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 90.1% 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 2.75 \cdot 10^{+159}:\\ \;\;\;\;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 2.75e+159)
    (-
     (* 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 <= 2.75e+159) {
		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 <= 2.75d+159) 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 <= 2.75e+159) {
		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 <= 2.75e+159:
		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 <= 2.75e+159)
		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 <= 2.75e+159)
		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, 2.75e+159], 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 < 2.7499999999999999e159

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

      1. difference-of-squares 86.0%

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

      2. *-commutative 86.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 86.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 2.7499999999999999e159 < x.re

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

   3. Simplified 54.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* 54.5%

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

      2. associate-*l* 54.5%

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

      3. +-commutative 54.5%

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

      4. associate-*l* 54.5%

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

      5. associate-*r* 54.5%

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

      6. associate-*r* 54.5%

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

      7. fma-define 66.7%

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

   6. Applied egg-rr 66.7%

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

   8. Applied egg-rr 93.9%

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

4. Final simplification 87.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x.re \leq 2.75 \cdot 10^{+159}:\\ \;\;\;\;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 4: 90.0% 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.35 \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.35e+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.35e+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.35d+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.35e+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.35e+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.35e+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.35e+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.35e+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.35000000000000003e154

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

      1. *-un-lft-identity 85.1%

         \[\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.im \cdot x.re\right) \cdot x.im \]

      2. *-commutative 85.1%

         \[\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}{x.re \cdot x.im}\right) \cdot x.im \]

      3. *-un-lft-identity 85.1%

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

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

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

      \[\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.35000000000000003e154 < x.re

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

   3. Simplified 54.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* 54.5%

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

      2. associate-*l* 54.5%

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

      3. +-commutative 54.5%

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

      4. associate-*l* 54.5%

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

      5. associate-*r* 54.5%

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

      6. associate-*r* 54.5%

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

      7. fma-define 66.7%

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

   6. Applied egg-rr 66.7%

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

   8. Applied egg-rr 93.9%

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

4. Final simplification 86.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x.re \leq 1.35 \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 5: 82.0% 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 95:\\ \;\;\;\;-3 \cdot \left(x.re\_m \cdot \left(x.im \cdot x.im\right)\right)\\ \mathbf{elif}\;x.re\_m \leq 1.35 \cdot 10^{+154}:\\ \;\;\;\;x.re\_m \cdot \left(x.re\_m \cdot x.re\_m - x.im \cdot x.im\right) - 0.5\\ \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 95.0)
    (* -3.0 (* x.re_m (* x.im x.im)))
    (if (<= x.re_m 1.35e+154)
      (- (* x.re_m (- (* x.re_m x.re_m) (* x.im x.im))) 0.5)
      (* 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 <= 95.0) {
		tmp = -3.0 * (x_46_re_m * (x_46_im * x_46_im));
	} else if (x_46_re_m <= 1.35e+154) {
		tmp = (x_46_re_m * ((x_46_re_m * x_46_re_m) - (x_46_im * x_46_im))) - 0.5;
	} 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 <= 95.0d0) then
        tmp = (-3.0d0) * (x_46re_m * (x_46im * x_46im))
    else if (x_46re_m <= 1.35d+154) then
        tmp = (x_46re_m * ((x_46re_m * x_46re_m) - (x_46im * x_46im))) - 0.5d0
    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 <= 95.0) {
		tmp = -3.0 * (x_46_re_m * (x_46_im * x_46_im));
	} else if (x_46_re_m <= 1.35e+154) {
		tmp = (x_46_re_m * ((x_46_re_m * x_46_re_m) - (x_46_im * x_46_im))) - 0.5;
	} 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 <= 95.0:
		tmp = -3.0 * (x_46_re_m * (x_46_im * x_46_im))
	elif x_46_re_m <= 1.35e+154:
		tmp = (x_46_re_m * ((x_46_re_m * x_46_re_m) - (x_46_im * x_46_im))) - 0.5
	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 <= 95.0)
		tmp = Float64(-3.0 * Float64(x_46_re_m * Float64(x_46_im * x_46_im)));
	elseif (x_46_re_m <= 1.35e+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))) - 0.5);
	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 <= 95.0)
		tmp = -3.0 * (x_46_re_m * (x_46_im * x_46_im));
	elseif (x_46_re_m <= 1.35e+154)
		tmp = (x_46_re_m * ((x_46_re_m * x_46_re_m) - (x_46_im * x_46_im))) - 0.5;
	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, 95.0], N[(-3.0 * N[(x$46$re$95$m * N[(x$46$im * x$46$im), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x$46$re$95$m, 1.35e+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] - 0.5), $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 < 95

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

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

      1. associate-*r* 81.7%

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

      2. associate-*l* 81.7%

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

      3. +-commutative 81.7%

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

      4. associate-*l* 81.7%

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

      5. associate-*r* 81.7%

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

      6. associate-*r* 90.4%

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

      7. fma-define 90.9%

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

   6. Applied egg-rr 90.9%

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

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

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

      1. unpow2 54.7%

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

   9. Applied egg-rr 54.7%

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

   if 95 < x.re < 1.35000000000000003e154

   1. Initial program 96.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. *-commutative 96.5%

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

      2. *-commutative 96.5%

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

      3. 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}} \]

      4. +-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.re \cdot x.im} \]

      5. metadata-eval 0.0%

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

      6. +-inverses 0.0%

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

      7. metadata-eval 0.0%

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

      8. 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 \log 1}{\log 1}} \]

      9. metadata-eval 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}}{\log 1} \]

      10. metadata-eval 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}} \]

   4. 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}} \]

   6. Applied egg-rr 94.3%

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

   if 1.35000000000000003e154 < x.re

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

   3. Simplified 54.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* 54.5%

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

      2. associate-*l* 54.5%

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

      3. +-commutative 54.5%

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

      4. associate-*l* 54.5%

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

      5. associate-*r* 54.5%

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

      6. associate-*r* 54.5%

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

      7. fma-define 66.7%

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

   6. Applied egg-rr 66.7%

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

   8. Applied egg-rr 93.9%

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

4. Final simplification 64.5%

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

Alternative 6: 68.0% accurate, 1.6× 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 3.6 \cdot 10^{+147}:\\ \;\;\;\;-3 \cdot \left(x.re\_m \cdot \left(x.im \cdot x.im\right)\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 3.6e+147)
    (* -3.0 (* x.re_m (* x.im 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 <= 3.6e+147) {
		tmp = -3.0 * (x_46_re_m * (x_46_im * 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 <= 3.6d+147) then
        tmp = (-3.0d0) * (x_46re_m * (x_46im * 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 <= 3.6e+147) {
		tmp = -3.0 * (x_46_re_m * (x_46_im * 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 <= 3.6e+147:
		tmp = -3.0 * (x_46_re_m * (x_46_im * 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 <= 3.6e+147)
		tmp = Float64(-3.0 * Float64(x_46_re_m * Float64(x_46_im * 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 <= 3.6e+147)
		tmp = -3.0 * (x_46_re_m * (x_46_im * 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, 3.6e+147], N[(-3.0 * N[(x$46$re$95$m * N[(x$46$im * x$46$im), $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 < 3.6000000000000002e147

   1. Initial program 85.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 83.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* 83.2%

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

      2. associate-*l* 83.2%

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

      3. +-commutative 83.2%

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

      4. associate-*l* 83.2%

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

      5. associate-*r* 83.2%

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

      6. associate-*r* 90.8%

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

      7. fma-define 91.7%

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

   6. Applied egg-rr 91.7%

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

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

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

      1. unpow2 49.9%

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

   9. Applied egg-rr 49.9%

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

   if 3.6000000000000002e147 < x.re

   1. Initial program 57.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 57.1%

      \[\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* 57.1%

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

      2. associate-*l* 57.1%

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

      3. +-commutative 57.1%

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

      4. associate-*l* 57.1%

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

      5. associate-*r* 57.1%

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

      6. associate-*r* 57.1%

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

      7. fma-define 68.6%

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

   6. Applied egg-rr 68.6%

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

   8. Applied egg-rr 89.2%

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

4. Final simplification 55.3%

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

Alternative 7: 37.4% 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 3.7 \cdot 10^{-65}:\\ \;\;\;\;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 3.7e-65) (- 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 <= 3.7e-65) {
		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 <= 3.7d-65) 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 <= 3.7e-65) {
		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 <= 3.7e-65:
		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 <= 3.7e-65)
		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 <= 3.7e-65)
		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, 3.7e-65], 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 < 3.7e-65

   1. Initial program 82.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 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.8%

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

      3. +-commutative 80.8%

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

      4. associate-*l* 80.8%

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

      5. associate-*r* 80.8%

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

      6. associate-*r* 89.9%

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

      7. fma-define 90.5%

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

   6. Applied egg-rr 90.5%

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

   8. Applied egg-rr 21.5%

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

   if 3.7e-65 < x.re

   1. Initial program 78.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 76.7%

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

      1. associate-*r* 76.7%

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

      2. associate-*l* 76.7%

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

      3. +-commutative 76.7%

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

      4. associate-*l* 76.7%

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

      5. associate-*r* 76.7%

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

      6. associate-*r* 76.7%

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

      7. fma-define 83.5%

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

   6. Applied egg-rr 83.5%

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

   8. Applied egg-rr 46.0%

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

Alternative 8: 34.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 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 81.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 79.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* 79.7%

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

   2. associate-*l* 79.7%

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

   3. +-commutative 79.7%

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

   4. associate-*l* 79.7%

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

   5. associate-*r* 79.6%

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

   6. associate-*r* 86.2%

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

   7. 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 26.4%

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

Alternative 9: 4.4% 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 x.re\_m \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 * 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 81.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 79.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* 79.7%

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

   2. associate-*l* 79.7%

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

   3. +-commutative 79.7%

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

   4. associate-*l* 79.7%

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

   5. associate-*r* 79.6%

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

   6. associate-*r* 86.2%

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

   7. 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.6%

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

   1. expm1-undefine 2.6%

      \[\leadsto \color{blue}{e^{\log x.re} - 1} \]

   2. rem-exp-log 4.5%

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

10. Simplified 4.5%

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

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

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

Alternative 10: 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 81.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 79.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* 79.7%

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

   2. associate-*l* 79.7%

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

   3. +-commutative 79.7%

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

   4. associate-*l* 79.7%

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

   5. associate-*r* 79.6%

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

   6. associate-*r* 86.2%

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

   7. 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 11: 2.8% 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 81.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 79.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* 79.7%

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

   2. associate-*l* 79.7%

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

   3. +-commutative 79.7%

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

   4. associate-*l* 79.7%

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

   5. associate-*r* 79.6%

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

   6. associate-*r* 86.2%

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

   7. 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.6%

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

   1. expm1-undefine 2.6%

      \[\leadsto \color{blue}{e^{\log x.re} - 1} \]

   2. rem-exp-log 4.5%

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

10. Simplified 4.5%

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

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

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

Developer Target 1: 87.6% 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 2024185 
(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)))