math.cube on complex, real part

Percentage Accurate: 82.3% → 99.8%

Time: 7.2s

Alternatives: 5

Speedup: 0.9×

• 44.5% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x_46re, x_46im)
    real(8), intent (in) :: x_46re
    real(8), intent (in) :: x_46im
    code = (((x_46re * x_46re) - (x_46im * x_46im)) * x_46re) - (((x_46re * x_46im) + (x_46im * x_46re)) * x_46im)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 82.3% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x_46re, x_46im)
    real(8), intent (in) :: x_46re
    real(8), intent (in) :: x_46im
    code = (((x_46re * x_46re) - (x_46im * x_46im)) * x_46re) - (((x_46re * x_46im) + (x_46im * x_46re)) * x_46im)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.8% accurate, 0.2× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x.re < 2.19999999999999992e92

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

   3. Simplified 83.1%

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

      1. add-sqr-sqrt 54.3%

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

      2. pow2 54.3%

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

      3. *-commutative 54.3%

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

      4. sqrt-prod 33.3%

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

      5. sqrt-prod 19.0%

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

      6. add-sqr-sqrt 38.0%

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

   6. Applied egg-rr 38.0%

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

      1. add-cbrt-cube 25.8%

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

      2. pow3 25.8%

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

      3. unpow2 25.8%

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

      4. swap-sqr 25.8%

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

      5. pow2 25.8%

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

      6. add-sqr-sqrt 63.6%

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

      7. associate-*l* 63.7%

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

   8. Applied egg-rr 63.7%

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

      1. rem-cbrt-cube 83.1%

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

      2. *-commutative 83.1%

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

      3. unpow2 83.1%

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

      4. associate-*r* 90.3%

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

   10. Applied egg-rr 90.3%

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

   if 2.19999999999999992e92 < x.re

   1. Initial program 86.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. *-commutative 86.1%

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

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

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

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

   8. 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 - 0 \]
   9. Step-by-step derivation

      1. *-commutative 100.0%

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

      2. distribute-rgt-in 94.4%

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

      3. distribute-rgt-in 69.4%

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

   10. Applied egg-rr 69.4%

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

       1. distribute-rgt-out 94.4%

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

       2. distribute-rgt-in 100.0%

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

       3. associate-*r* 100.0%

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

   12. Applied egg-rr 100.0%

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

4. Final simplification 91.7%

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

Alternative 2: 99.8% accurate, 0.2× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x.re < 2.40000000000000005e92

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

   3. Simplified 83.1%

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

      1. add-sqr-sqrt 54.3%

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

      2. pow2 54.3%

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

      3. *-commutative 54.3%

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

      4. sqrt-prod 33.3%

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

      5. sqrt-prod 19.0%

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

      6. add-sqr-sqrt 38.0%

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

   6. Applied egg-rr 38.0%

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

      1. add-cbrt-cube 25.8%

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

      2. pow3 25.8%

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

      3. unpow2 25.8%

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

      4. swap-sqr 25.8%

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

      5. pow2 25.8%

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

      6. add-sqr-sqrt 63.6%

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

      7. associate-*l* 63.7%

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

   8. Applied egg-rr 63.7%

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

      1. rem-cbrt-cube 83.1%

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

      2. associate-*r* 83.1%

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

      3. *-commutative 83.1%

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

      4. unpow2 83.1%

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

      5. associate-*l* 90.2%

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

      6. associate-*l* 90.3%

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

   10. Applied egg-rr 90.3%

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

   if 2.40000000000000005e92 < x.re

   1. Initial program 86.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. *-commutative 86.1%

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

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

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

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

   8. 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 - 0 \]
   9. Step-by-step derivation

      1. *-commutative 100.0%

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

      2. distribute-rgt-in 94.4%

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

      3. distribute-rgt-in 69.4%

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

   10. Applied egg-rr 69.4%

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

       1. distribute-rgt-out 94.4%

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

       2. distribute-rgt-in 100.0%

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

       3. associate-*r* 100.0%

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

   12. Applied egg-rr 100.0%

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

4. Final simplification 91.6%

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

Alternative 3: 93.9% accurate, 0.2× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x.re < 2.40000000000000005e92

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

   3. Simplified 83.1%

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

   if 2.40000000000000005e92 < x.re

   1. Initial program 86.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. *-commutative 86.1%

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

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

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

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

   8. 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 - 0 \]
   9. Step-by-step derivation

      1. *-commutative 100.0%

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

      2. distribute-rgt-in 94.4%

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

      3. distribute-rgt-in 69.4%

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

   10. Applied egg-rr 69.4%

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

       1. distribute-rgt-out 94.4%

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

       2. distribute-rgt-in 100.0%

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

       3. associate-*r* 100.0%

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

   12. Applied egg-rr 100.0%

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

4. Final simplification 85.5%

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

Alternative 4: 93.9% 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 2 \cdot 10^{+92}:\\ \;\;\;\;x.re\_m \cdot \left(\left(x.re\_m - x.im\right) \cdot \left(x.re\_m + x.im\right)\right) - x.im \cdot \left(\left(x.re\_m \cdot x.im\right) \cdot 2\right)\\ \mathbf{else}:\\ \;\;\;\;\left(x.re\_m \cdot \left(x.re\_m - x.im\right)\right) \cdot \left(x.re\_m + x.im\right)\\ \end{array} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x.re < 2.0000000000000001e92

   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. difference-of-squares 73.2%

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

      2. *-commutative 73.2%

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

   4. Applied egg-rr 88.5%

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

      1. *-commutative 88.5%

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

      2. *-un-lft-identity 88.5%

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

      3. distribute-lft-in 88.5%

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

      4. distribute-rgt-out 88.5%

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

      5. metadata-eval 88.5%

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

   6. Applied egg-rr 88.5%

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

   if 2.0000000000000001e92 < x.re

   1. Initial program 86.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. *-commutative 86.1%

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

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

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

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

   8. 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 - 0 \]
   9. Step-by-step derivation

      1. *-commutative 100.0%

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

      2. distribute-rgt-in 94.4%

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

      3. distribute-rgt-in 69.4%

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

   10. Applied egg-rr 69.4%

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

       1. distribute-rgt-out 94.4%

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

       2. distribute-rgt-in 100.0%

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

       3. associate-*r* 100.0%

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

   12. Applied egg-rr 100.0%

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

4. Final simplification 90.1%

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

Alternative 5: 79.4% 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 \left(\left(x.re\_m \cdot \left(x.re\_m - x.im\right)\right) \cdot \left(x.re\_m + x.im\right)\right) \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 85.9%

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

   1. *-commutative 85.9%

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

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

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

   1. difference-of-squares 76.9%

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

   2. *-commutative 76.9%

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

8. Applied egg-rr 76.9%

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

   1. *-commutative 76.9%

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

   2. distribute-rgt-in 73.4%

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

   3. distribute-rgt-in 66.0%

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

10. Applied egg-rr 66.0%

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

    1. distribute-rgt-out 73.4%

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

    2. distribute-rgt-in 76.9%

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

    3. associate-*r* 77.7%

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

12. Applied egg-rr 77.7%

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

13. Final simplification 77.7%

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

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

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

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