math.cube on complex, real part

Percentage Accurate: 82.4% → 99.8%

Time: 9.5s

Alternatives: 7

Speedup: 1.4×

• 45.8% 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: 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 10^{+93}:\\ \;\;\;\;{x.re\_m}^{3} + \left(x.re\_m \cdot x.im\right) \cdot \left(x.im \cdot -3\right)\\ \mathbf{else}:\\ \;\;\;\;\left(x.re\_m \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 1e+93)
    (+ (pow x.re_m 3.0) (* (* x.re_m x.im) (* x.im -3.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 <= 1e+93) {
		tmp = pow(x_46_re_m, 3.0) + ((x_46_re_m * x_46_im) * (x_46_im * -3.0));
	} else {
		tmp = (x_46_re_m * (x_46_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 <= 1d+93) then
        tmp = (x_46re_m ** 3.0d0) + ((x_46re_m * x_46im) * (x_46im * (-3.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 <= 1e+93) {
		tmp = Math.pow(x_46_re_m, 3.0) + ((x_46_re_m * x_46_im) * (x_46_im * -3.0));
	} else {
		tmp = (x_46_re_m * (x_46_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 <= 1e+93:
		tmp = math.pow(x_46_re_m, 3.0) + ((x_46_re_m * x_46_im) * (x_46_im * -3.0))
	else:
		tmp = (x_46_re_m * (x_46_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 <= 1e+93)
		tmp = Float64((x_46_re_m ^ 3.0) + Float64(Float64(x_46_re_m * x_46_im) * Float64(x_46_im * -3.0)));
	else
		tmp = Float64(Float64(x_46_re_m * 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 <= 1e+93)
		tmp = (x_46_re_m ^ 3.0) + ((x_46_re_m * x_46_im) * (x_46_im * -3.0));
	else
		tmp = (x_46_re_m * (x_46_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, 1e+93], N[(N[Power[x$46$re$95$m, 3.0], $MachinePrecision] + N[(N[(x$46$re$95$m * x$46$im), $MachinePrecision] * N[(x$46$im * -3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x$46$re$95$m * 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 < 1.00000000000000004e93

   1. Initial program 89.9%

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

   3. Simplified 88.0%

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

      1. +-commutative 88.0%

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

      2. associate-*r* 93.0%

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

      3. fma-define 95.0%

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

   6. Applied egg-rr 95.0%

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

      1. fma-undefine 93.0%

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

      2. +-commutative 93.0%

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

   8. Applied egg-rr 93.0%

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

   if 1.00000000000000004e93 < x.re

   1. Initial program 65.4%

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

      1. *-commutative 65.4%

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

      2. *-un-lft-identity 65.4%

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

      3. *-un-lft-identity 65.4%

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

      4. distribute-rgt-out 65.4%

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

      5. metadata-eval 65.4%

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

   4. Applied egg-rr 65.4%

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

      1. *-commutative 65.4%

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

      2. *-commutative 65.4%

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

      3. *-commutative 65.4%

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

      4. count-2 65.4%

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

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

      6. +-inverses 0.0%

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

      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{\color{blue}{\log 1}}{x.im \cdot x.re - x.im \cdot x.re} \]

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

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

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

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

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

   6. Applied egg-rr 0.0%

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

   8. Simplified 78.8%

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

      1. --rgt-identity 78.8%

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

      2. *-commutative 78.8%

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

      3. difference-of-squares 100.0%

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

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

   10. 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)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 94.3% accurate, 0.2× speedup

Math

\[\begin{array}{l} x.re\_m = \left|x.re\right| \\ x.re\_s = \mathsf{copysign}\left(1, x.re\right) \\ x.re\_s \cdot \begin{array}{l} \mathbf{if}\;x.re\_m \leq 10^{+93}:\\ \;\;\;\;{x.re\_m}^{3} + x.re\_m \cdot \left(x.im \cdot \left(x.im \cdot -3\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\left(x.re\_m \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 1e+93)
    (+ (pow x.re_m 3.0) (* x.re_m (* x.im (* x.im -3.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 <= 1e+93) {
		tmp = pow(x_46_re_m, 3.0) + (x_46_re_m * (x_46_im * (x_46_im * -3.0)));
	} else {
		tmp = (x_46_re_m * (x_46_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 <= 1d+93) then
        tmp = (x_46re_m ** 3.0d0) + (x_46re_m * (x_46im * (x_46im * (-3.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 <= 1e+93) {
		tmp = Math.pow(x_46_re_m, 3.0) + (x_46_re_m * (x_46_im * (x_46_im * -3.0)));
	} else {
		tmp = (x_46_re_m * (x_46_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 <= 1e+93:
		tmp = math.pow(x_46_re_m, 3.0) + (x_46_re_m * (x_46_im * (x_46_im * -3.0)))
	else:
		tmp = (x_46_re_m * (x_46_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 <= 1e+93)
		tmp = Float64((x_46_re_m ^ 3.0) + Float64(x_46_re_m * Float64(x_46_im * Float64(x_46_im * -3.0))));
	else
		tmp = Float64(Float64(x_46_re_m * 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 <= 1e+93)
		tmp = (x_46_re_m ^ 3.0) + (x_46_re_m * (x_46_im * (x_46_im * -3.0)));
	else
		tmp = (x_46_re_m * (x_46_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, 1e+93], N[(N[Power[x$46$re$95$m, 3.0], $MachinePrecision] + N[(x$46$re$95$m * N[(x$46$im * N[(x$46$im * -3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x$46$re$95$m * 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 < 1.00000000000000004e93

   1. Initial program 89.9%

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

   3. Simplified 88.0%

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

   if 1.00000000000000004e93 < x.re

   1. Initial program 65.4%

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

      1. *-commutative 65.4%

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

      2. *-un-lft-identity 65.4%

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

      3. *-un-lft-identity 65.4%

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

      4. distribute-rgt-out 65.4%

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

      5. metadata-eval 65.4%

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

   4. Applied egg-rr 65.4%

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

      1. *-commutative 65.4%

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

      2. *-commutative 65.4%

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

      3. *-commutative 65.4%

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

      4. count-2 65.4%

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

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

      6. +-inverses 0.0%

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

      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{\color{blue}{\log 1}}{x.im \cdot x.re - x.im \cdot x.re} \]

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

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

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

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

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

   6. Applied egg-rr 0.0%

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

   8. Simplified 78.8%

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

      1. --rgt-identity 78.8%

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

      2. *-commutative 78.8%

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

      3. difference-of-squares 100.0%

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

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

   10. 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)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 94.2% 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.6 \cdot 10^{+83}:\\ \;\;\;\;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}:\\ \;\;\;\;\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 1.6e+83)
    (-
     (* 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 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 <= 1.6e+83) {
		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 + 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 <= 1.6d+83) 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 + 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 <= 1.6e+83) {
		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 + 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 <= 1.6e+83:
		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 + 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 <= 1.6e+83)
		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(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 <= 1.6e+83)
		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 + 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, 1.6e+83], 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[(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 < 1.5999999999999999e83

   1. Initial program 89.8%

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

      1. *-commutative 89.8%

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

      2. *-un-lft-identity 89.8%

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

      3. *-un-lft-identity 89.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 89.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 89.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 89.8%

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

   if 1.5999999999999999e83 < x.re

   1. Initial program 67.2%

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

      1. *-commutative 67.2%

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

      2. *-un-lft-identity 67.2%

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

      3. *-un-lft-identity 67.2%

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

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

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

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

      1. *-commutative 67.2%

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

      2. *-commutative 67.2%

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

      3. *-commutative 67.2%

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

      4. count-2 67.2%

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

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

      6. +-inverses 0.0%

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

      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{\color{blue}{\log 1}}{x.im \cdot x.re - x.im \cdot x.re} \]

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

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

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

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

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

   6. Applied egg-rr 0.0%

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

   8. Simplified 80.0%

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

      1. --rgt-identity 80.0%

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

      2. *-commutative 80.0%

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

      3. difference-of-squares 100.0%

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

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

   10. 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)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 92.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x.re \leq 1.6 \cdot 10^{+83}:\\ \;\;\;\;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}:\\ \;\;\;\;\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: 87.5% accurate, 1.4× speedup

Math

\[\begin{array}{l} x.re\_m = \left|x.re\right| \\ x.re\_s = \mathsf{copysign}\left(1, x.re\right) \\ x.re\_s \cdot \begin{array}{l} \mathbf{if}\;x.re\_m \leq 1.5 \cdot 10^{-49}:\\ \;\;\;\;\left(x.im \cdot x.im\right) \cdot \left(x.re\_m \cdot -3\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 1.5e-49)
    (* (* x.im x.im) (* x.re_m -3.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 <= 1.5e-49) {
		tmp = (x_46_im * x_46_im) * (x_46_re_m * -3.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 <= 1.5d-49) then
        tmp = (x_46im * x_46im) * (x_46re_m * (-3.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 <= 1.5e-49) {
		tmp = (x_46_im * x_46_im) * (x_46_re_m * -3.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 <= 1.5e-49:
		tmp = (x_46_im * x_46_im) * (x_46_re_m * -3.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 <= 1.5e-49)
		tmp = Float64(Float64(x_46_im * x_46_im) * Float64(x_46_re_m * -3.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 <= 1.5e-49)
		tmp = (x_46_im * x_46_im) * (x_46_re_m * -3.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, 1.5e-49], N[(N[(x$46$im * x$46$im), $MachinePrecision] * N[(x$46$re$95$m * -3.0), $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 < 1.5e-49

   1. Initial program 88.2%

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

      1. add-sqr-sqrt 88.2%

         \[\leadsto \left(x.re \cdot x.re - \color{blue}{\sqrt{x.im \cdot x.im} \cdot \sqrt{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. sqrt-unprod 78.1%

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

      3. pow2 78.1%

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

      4. pow2 78.1%

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

      5. pow-prod-up 78.1%

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

      6. metadata-eval 78.1%

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

   4. Applied egg-rr 78.1%

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

   5. Taylor expanded in x.im around inf 62.8%

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

   7. Simplified 62.8%

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

      1. pow2 62.8%

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

   9. Applied egg-rr 62.8%

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

   if 1.5e-49 < x.re

   1. Initial program 78.3%

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

      1. *-commutative 78.3%

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

      2. *-un-lft-identity 78.3%

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

      3. *-un-lft-identity 78.3%

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

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

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

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

      1. *-commutative 78.3%

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

      2. *-commutative 78.3%

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

      3. *-commutative 78.3%

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

      4. count-2 78.3%

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

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

      6. +-inverses 0.0%

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

      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{\color{blue}{\log 1}}{x.im \cdot x.re - x.im \cdot x.re} \]

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

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

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

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

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

   6. Applied egg-rr 0.0%

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

   8. Simplified 81.8%

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

      1. --rgt-identity 81.8%

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

      2. *-commutative 81.8%

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

      3. difference-of-squares 95.0%

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

      4. associate-*r* 95.0%

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

   10. Applied egg-rr 95.0%

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

4. Final simplification 73.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x.re \leq 1.5 \cdot 10^{-49}:\\ \;\;\;\;\left(x.im \cdot x.im\right) \cdot \left(x.re \cdot -3\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: 49.9% accurate, 2.7× speedup

Math

\[\begin{array}{l} x.re\_m = \left|x.re\right| \\ x.re\_s = \mathsf{copysign}\left(1, x.re\right) \\ x.re\_s \cdot \left(\left(x.im \cdot x.im\right) \cdot \left(x.re\_m \cdot -3\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.im x.im) (* 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) {
	return x_46_re_s * ((x_46_im * x_46_im) * (x_46_re_m * -3.0));
}

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 84.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. add-sqr-sqrt 84.9%

      \[\leadsto \left(x.re \cdot x.re - \color{blue}{\sqrt{x.im \cdot x.im} \cdot \sqrt{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. sqrt-unprod 77.0%

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

   3. pow2 77.0%

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

   4. pow2 77.0%

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

   5. pow-prod-up 77.1%

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

   6. metadata-eval 77.1%

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

4. Applied egg-rr 77.1%

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

5. Taylor expanded in x.im around inf 50.5%

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

7. Simplified 50.5%

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

   1. pow2 50.5%

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

9. Applied egg-rr 50.5%

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

10. Final simplification 50.5%

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

Alternative 6: 20.0% accurate, 3.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 \left(\left(x.re\_m \cdot x.im\right) \cdot -27\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.im) -27.0)))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 84.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. difference-of-squares 86.9%

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

4. Applied egg-rr 86.9%

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

6. Simplified 56.1%

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

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

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

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

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

9. Final simplification 21.1%

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

Alternative 7: 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 -27 \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 -27.0))

C

x.re\_m = fabs(x_46_re);
x.re\_s = copysign(1.0, x_46_re);
double code(double x_46_re_s, double x_46_re_m, double x_46_im) {
	return x_46_re_s * -27.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 * (-27.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 * -27.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 * -27.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 * -27.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 * -27.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 * -27.0), $MachinePrecision]

Derivation

1. Initial program 84.9%

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

3. Simplified 82.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 0 50.5%

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

7. Simplified 2.6%

   \[\leadsto \color{blue}{-27} \]
8. Add Preprocessing

Developer target: 86.7% 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 2024110 
(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)))