math.cube on complex, imaginary part

Percentage Accurate: 82.0% → 99.8%

Time: 8.8s

Alternatives: 8

Speedup: 1.4×

• 45.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.im + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 82.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.8% accurate, 0.2× speedup

Math

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

FPCore

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

C

x.im\_m = fabs(x_46_im);
x.im\_s = copysign(1.0, x_46_im);
double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	double tmp;
	if (x_46_im_m <= 1e+102) {
		tmp = (x_46_re * (x_46_im_m * (x_46_re * 3.0))) - pow(x_46_im_m, 3.0);
	} else {
		tmp = (x_46_re - x_46_im_m) * (x_46_im_m * (x_46_im_m + x_46_re));
	}
	return x_46_im_s * tmp;
}

Fortran

x.im\_m = abs(x_46im)
x.im\_s = copysign(1.0d0, x_46im)
real(8) function code(x_46im_s, x_46re, x_46im_m)
    real(8), intent (in) :: x_46im_s
    real(8), intent (in) :: x_46re
    real(8), intent (in) :: x_46im_m
    real(8) :: tmp
    if (x_46im_m <= 1d+102) then
        tmp = (x_46re * (x_46im_m * (x_46re * 3.0d0))) - (x_46im_m ** 3.0d0)
    else
        tmp = (x_46re - x_46im_m) * (x_46im_m * (x_46im_m + x_46re))
    end if
    code = x_46im_s * tmp
end function

Java

x.im\_m = Math.abs(x_46_im);
x.im\_s = Math.copySign(1.0, x_46_im);
public static double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	double tmp;
	if (x_46_im_m <= 1e+102) {
		tmp = (x_46_re * (x_46_im_m * (x_46_re * 3.0))) - Math.pow(x_46_im_m, 3.0);
	} else {
		tmp = (x_46_re - x_46_im_m) * (x_46_im_m * (x_46_im_m + x_46_re));
	}
	return x_46_im_s * tmp;
}

Python

x.im\_m = math.fabs(x_46_im)
x.im\_s = math.copysign(1.0, x_46_im)
def code(x_46_im_s, x_46_re, x_46_im_m):
	tmp = 0
	if x_46_im_m <= 1e+102:
		tmp = (x_46_re * (x_46_im_m * (x_46_re * 3.0))) - math.pow(x_46_im_m, 3.0)
	else:
		tmp = (x_46_re - x_46_im_m) * (x_46_im_m * (x_46_im_m + x_46_re))
	return x_46_im_s * tmp

Julia

x.im\_m = abs(x_46_im)
x.im\_s = copysign(1.0, x_46_im)
function code(x_46_im_s, x_46_re, x_46_im_m)
	tmp = 0.0
	if (x_46_im_m <= 1e+102)
		tmp = Float64(Float64(x_46_re * Float64(x_46_im_m * Float64(x_46_re * 3.0))) - (x_46_im_m ^ 3.0));
	else
		tmp = Float64(Float64(x_46_re - x_46_im_m) * Float64(x_46_im_m * Float64(x_46_im_m + x_46_re)));
	end
	return Float64(x_46_im_s * tmp)
end

MATLAB

x.im\_m = abs(x_46_im);
x.im\_s = sign(x_46_im) * abs(1.0);
function tmp_2 = code(x_46_im_s, x_46_re, x_46_im_m)
	tmp = 0.0;
	if (x_46_im_m <= 1e+102)
		tmp = (x_46_re * (x_46_im_m * (x_46_re * 3.0))) - (x_46_im_m ^ 3.0);
	else
		tmp = (x_46_re - x_46_im_m) * (x_46_im_m * (x_46_im_m + x_46_re));
	end
	tmp_2 = x_46_im_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x.im < 9.99999999999999977e101

   1. Initial program 81.9%

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

   3. Simplified 91.3%

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

   if 9.99999999999999977e101 < x.im

   1. Initial program 68.9%

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

      1. difference-of-squares 77.8%

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

      2. *-commutative 77.8%

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

   4. Applied egg-rr 77.8%

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

      1. *-commutative 77.8%

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

      2. distribute-rgt-in 66.7%

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

      3. distribute-rgt-in 64.4%

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

   6. Applied egg-rr 64.4%

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

   8. Applied egg-rr 100.0%

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

4. Final simplification 92.8%

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

Alternative 2: 85.7% accurate, 0.4× speedup

Math

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

FPCore

x.im\_m = (fabs.f64 x.im)
x.im\_s = (copysign.f64 #s(literal 1 binary64) x.im)
(FPCore (x.im_s x.re x.im_m)
 :precision binary64
 (*
  x.im_s
  (if (<=
       (+
        (* x.im_m (- (* x.re x.re) (* x.im_m x.im_m)))
        (* x.re (+ (* x.im_m x.re) (* x.im_m x.re))))
       4e+305)
    (+
     (+
      (* x.im_m (* x.re (- x.re x.im_m)))
      (* x.im_m (* x.im_m (- x.re x.im_m))))
     (* x.re (* (* x.im_m x.re) 2.0)))
    (* (- x.re x.im_m) (* x.im_m x.re)))))

C

x.im\_m = fabs(x_46_im);
x.im\_s = copysign(1.0, x_46_im);
double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	double tmp;
	if (((x_46_im_m * ((x_46_re * x_46_re) - (x_46_im_m * x_46_im_m))) + (x_46_re * ((x_46_im_m * x_46_re) + (x_46_im_m * x_46_re)))) <= 4e+305) {
		tmp = ((x_46_im_m * (x_46_re * (x_46_re - x_46_im_m))) + (x_46_im_m * (x_46_im_m * (x_46_re - x_46_im_m)))) + (x_46_re * ((x_46_im_m * x_46_re) * 2.0));
	} else {
		tmp = (x_46_re - x_46_im_m) * (x_46_im_m * x_46_re);
	}
	return x_46_im_s * tmp;
}

Fortran

x.im\_m = abs(x_46im)
x.im\_s = copysign(1.0d0, x_46im)
real(8) function code(x_46im_s, x_46re, x_46im_m)
    real(8), intent (in) :: x_46im_s
    real(8), intent (in) :: x_46re
    real(8), intent (in) :: x_46im_m
    real(8) :: tmp
    if (((x_46im_m * ((x_46re * x_46re) - (x_46im_m * x_46im_m))) + (x_46re * ((x_46im_m * x_46re) + (x_46im_m * x_46re)))) <= 4d+305) then
        tmp = ((x_46im_m * (x_46re * (x_46re - x_46im_m))) + (x_46im_m * (x_46im_m * (x_46re - x_46im_m)))) + (x_46re * ((x_46im_m * x_46re) * 2.0d0))
    else
        tmp = (x_46re - x_46im_m) * (x_46im_m * x_46re)
    end if
    code = x_46im_s * tmp
end function

Java

x.im\_m = Math.abs(x_46_im);
x.im\_s = Math.copySign(1.0, x_46_im);
public static double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	double tmp;
	if (((x_46_im_m * ((x_46_re * x_46_re) - (x_46_im_m * x_46_im_m))) + (x_46_re * ((x_46_im_m * x_46_re) + (x_46_im_m * x_46_re)))) <= 4e+305) {
		tmp = ((x_46_im_m * (x_46_re * (x_46_re - x_46_im_m))) + (x_46_im_m * (x_46_im_m * (x_46_re - x_46_im_m)))) + (x_46_re * ((x_46_im_m * x_46_re) * 2.0));
	} else {
		tmp = (x_46_re - x_46_im_m) * (x_46_im_m * x_46_re);
	}
	return x_46_im_s * tmp;
}

Python

x.im\_m = math.fabs(x_46_im)
x.im\_s = math.copysign(1.0, x_46_im)
def code(x_46_im_s, x_46_re, x_46_im_m):
	tmp = 0
	if ((x_46_im_m * ((x_46_re * x_46_re) - (x_46_im_m * x_46_im_m))) + (x_46_re * ((x_46_im_m * x_46_re) + (x_46_im_m * x_46_re)))) <= 4e+305:
		tmp = ((x_46_im_m * (x_46_re * (x_46_re - x_46_im_m))) + (x_46_im_m * (x_46_im_m * (x_46_re - x_46_im_m)))) + (x_46_re * ((x_46_im_m * x_46_re) * 2.0))
	else:
		tmp = (x_46_re - x_46_im_m) * (x_46_im_m * x_46_re)
	return x_46_im_s * tmp

Julia

x.im\_m = abs(x_46_im)
x.im\_s = copysign(1.0, x_46_im)
function code(x_46_im_s, x_46_re, x_46_im_m)
	tmp = 0.0
	if (Float64(Float64(x_46_im_m * Float64(Float64(x_46_re * x_46_re) - Float64(x_46_im_m * x_46_im_m))) + Float64(x_46_re * Float64(Float64(x_46_im_m * x_46_re) + Float64(x_46_im_m * x_46_re)))) <= 4e+305)
		tmp = Float64(Float64(Float64(x_46_im_m * Float64(x_46_re * Float64(x_46_re - x_46_im_m))) + Float64(x_46_im_m * Float64(x_46_im_m * Float64(x_46_re - x_46_im_m)))) + Float64(x_46_re * Float64(Float64(x_46_im_m * x_46_re) * 2.0)));
	else
		tmp = Float64(Float64(x_46_re - x_46_im_m) * Float64(x_46_im_m * x_46_re));
	end
	return Float64(x_46_im_s * tmp)
end

MATLAB

x.im\_m = abs(x_46_im);
x.im\_s = sign(x_46_im) * abs(1.0);
function tmp_2 = code(x_46_im_s, x_46_re, x_46_im_m)
	tmp = 0.0;
	if (((x_46_im_m * ((x_46_re * x_46_re) - (x_46_im_m * x_46_im_m))) + (x_46_re * ((x_46_im_m * x_46_re) + (x_46_im_m * x_46_re)))) <= 4e+305)
		tmp = ((x_46_im_m * (x_46_re * (x_46_re - x_46_im_m))) + (x_46_im_m * (x_46_im_m * (x_46_re - x_46_im_m)))) + (x_46_re * ((x_46_im_m * x_46_re) * 2.0));
	else
		tmp = (x_46_re - x_46_im_m) * (x_46_im_m * x_46_re);
	end
	tmp_2 = x_46_im_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 (*.f64 (-.f64 (*.f64 x.re x.re) (*.f64 x.im x.im)) x.im) (*.f64 (+.f64 (*.f64 x.re x.im) (*.f64 x.im x.re)) x.re)) < 3.9999999999999998e305

   1. Initial program 92.7%

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

      1. difference-of-squares 92.7%

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

      2. *-commutative 92.7%

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

   4. Applied egg-rr 92.7%

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

      1. *-commutative 92.7%

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

      2. *-un-lft-identity 92.7%

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

      3. *-un-lft-identity 92.7%

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

      4. distribute-rgt-out 92.7%

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

      5. metadata-eval 92.7%

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

   6. Applied egg-rr 92.7%

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

      1. *-commutative 92.7%

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

      2. distribute-rgt-in 91.0%

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

      3. distribute-rgt-in 89.8%

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

   8. Applied egg-rr 89.8%

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

   if 3.9999999999999998e305 < (+.f64 (*.f64 (-.f64 (*.f64 x.re x.re) (*.f64 x.im x.im)) x.im) (*.f64 (+.f64 (*.f64 x.re x.im) (*.f64 x.im x.re)) x.re))

   1. Initial program 52.0%

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

      1. difference-of-squares 60.5%

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

      2. *-commutative 60.5%

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

   4. Applied egg-rr 60.5%

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

      1. *-commutative 60.5%

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

      2. distribute-rgt-in 52.0%

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

      3. distribute-rgt-in 47.1%

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

   6. Applied egg-rr 47.1%

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

   8. Applied egg-rr 89.9%

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

   9. Taylor expanded in x.re around inf 52.8%

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

4. Final simplification 78.0%

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

Alternative 3: 89.9% accurate, 0.5× speedup

Math

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

FPCore

x.im\_m = (fabs.f64 x.im)
x.im\_s = (copysign.f64 #s(literal 1 binary64) x.im)
(FPCore (x.im_s x.re x.im_m)
 :precision binary64
 (*
  x.im_s
  (if (<=
       (+
        (* x.im_m (- (* x.re x.re) (* x.im_m x.im_m)))
        (* x.re (+ (* x.im_m x.re) (* x.im_m x.re))))
       4e+305)
    (+
     (* x.re (* (* x.im_m x.re) 2.0))
     (* x.im_m (* (- x.re x.im_m) (+ x.im_m x.re))))
    (* (- x.re x.im_m) (* x.im_m x.re)))))

C

x.im\_m = fabs(x_46_im);
x.im\_s = copysign(1.0, x_46_im);
double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	double tmp;
	if (((x_46_im_m * ((x_46_re * x_46_re) - (x_46_im_m * x_46_im_m))) + (x_46_re * ((x_46_im_m * x_46_re) + (x_46_im_m * x_46_re)))) <= 4e+305) {
		tmp = (x_46_re * ((x_46_im_m * x_46_re) * 2.0)) + (x_46_im_m * ((x_46_re - x_46_im_m) * (x_46_im_m + x_46_re)));
	} else {
		tmp = (x_46_re - x_46_im_m) * (x_46_im_m * x_46_re);
	}
	return x_46_im_s * tmp;
}

Fortran

x.im\_m = abs(x_46im)
x.im\_s = copysign(1.0d0, x_46im)
real(8) function code(x_46im_s, x_46re, x_46im_m)
    real(8), intent (in) :: x_46im_s
    real(8), intent (in) :: x_46re
    real(8), intent (in) :: x_46im_m
    real(8) :: tmp
    if (((x_46im_m * ((x_46re * x_46re) - (x_46im_m * x_46im_m))) + (x_46re * ((x_46im_m * x_46re) + (x_46im_m * x_46re)))) <= 4d+305) then
        tmp = (x_46re * ((x_46im_m * x_46re) * 2.0d0)) + (x_46im_m * ((x_46re - x_46im_m) * (x_46im_m + x_46re)))
    else
        tmp = (x_46re - x_46im_m) * (x_46im_m * x_46re)
    end if
    code = x_46im_s * tmp
end function

Java

x.im\_m = Math.abs(x_46_im);
x.im\_s = Math.copySign(1.0, x_46_im);
public static double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	double tmp;
	if (((x_46_im_m * ((x_46_re * x_46_re) - (x_46_im_m * x_46_im_m))) + (x_46_re * ((x_46_im_m * x_46_re) + (x_46_im_m * x_46_re)))) <= 4e+305) {
		tmp = (x_46_re * ((x_46_im_m * x_46_re) * 2.0)) + (x_46_im_m * ((x_46_re - x_46_im_m) * (x_46_im_m + x_46_re)));
	} else {
		tmp = (x_46_re - x_46_im_m) * (x_46_im_m * x_46_re);
	}
	return x_46_im_s * tmp;
}

Python

x.im\_m = math.fabs(x_46_im)
x.im\_s = math.copysign(1.0, x_46_im)
def code(x_46_im_s, x_46_re, x_46_im_m):
	tmp = 0
	if ((x_46_im_m * ((x_46_re * x_46_re) - (x_46_im_m * x_46_im_m))) + (x_46_re * ((x_46_im_m * x_46_re) + (x_46_im_m * x_46_re)))) <= 4e+305:
		tmp = (x_46_re * ((x_46_im_m * x_46_re) * 2.0)) + (x_46_im_m * ((x_46_re - x_46_im_m) * (x_46_im_m + x_46_re)))
	else:
		tmp = (x_46_re - x_46_im_m) * (x_46_im_m * x_46_re)
	return x_46_im_s * tmp

Julia

x.im\_m = abs(x_46_im)
x.im\_s = copysign(1.0, x_46_im)
function code(x_46_im_s, x_46_re, x_46_im_m)
	tmp = 0.0
	if (Float64(Float64(x_46_im_m * Float64(Float64(x_46_re * x_46_re) - Float64(x_46_im_m * x_46_im_m))) + Float64(x_46_re * Float64(Float64(x_46_im_m * x_46_re) + Float64(x_46_im_m * x_46_re)))) <= 4e+305)
		tmp = Float64(Float64(x_46_re * Float64(Float64(x_46_im_m * x_46_re) * 2.0)) + Float64(x_46_im_m * Float64(Float64(x_46_re - x_46_im_m) * Float64(x_46_im_m + x_46_re))));
	else
		tmp = Float64(Float64(x_46_re - x_46_im_m) * Float64(x_46_im_m * x_46_re));
	end
	return Float64(x_46_im_s * tmp)
end

MATLAB

x.im\_m = abs(x_46_im);
x.im\_s = sign(x_46_im) * abs(1.0);
function tmp_2 = code(x_46_im_s, x_46_re, x_46_im_m)
	tmp = 0.0;
	if (((x_46_im_m * ((x_46_re * x_46_re) - (x_46_im_m * x_46_im_m))) + (x_46_re * ((x_46_im_m * x_46_re) + (x_46_im_m * x_46_re)))) <= 4e+305)
		tmp = (x_46_re * ((x_46_im_m * x_46_re) * 2.0)) + (x_46_im_m * ((x_46_re - x_46_im_m) * (x_46_im_m + x_46_re)));
	else
		tmp = (x_46_re - x_46_im_m) * (x_46_im_m * x_46_re);
	end
	tmp_2 = x_46_im_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 (*.f64 (-.f64 (*.f64 x.re x.re) (*.f64 x.im x.im)) x.im) (*.f64 (+.f64 (*.f64 x.re x.im) (*.f64 x.im x.re)) x.re)) < 3.9999999999999998e305

   1. Initial program 92.7%

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

      1. difference-of-squares 92.7%

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

      2. *-commutative 92.7%

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

   4. Applied egg-rr 92.7%

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

      1. *-commutative 92.7%

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

      2. *-un-lft-identity 92.7%

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

      3. *-un-lft-identity 92.7%

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

      4. distribute-rgt-out 92.7%

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

      5. metadata-eval 92.7%

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

   6. Applied egg-rr 92.7%

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

   if 3.9999999999999998e305 < (+.f64 (*.f64 (-.f64 (*.f64 x.re x.re) (*.f64 x.im x.im)) x.im) (*.f64 (+.f64 (*.f64 x.re x.im) (*.f64 x.im x.re)) x.re))

   1. Initial program 52.0%

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

      1. difference-of-squares 60.5%

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

      2. *-commutative 60.5%

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

   4. Applied egg-rr 60.5%

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

      1. *-commutative 60.5%

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

      2. distribute-rgt-in 52.0%

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

      3. distribute-rgt-in 47.1%

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

   6. Applied egg-rr 47.1%

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

   8. Applied egg-rr 89.9%

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

   9. Taylor expanded in x.re around inf 52.8%

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

4. Final simplification 79.9%

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

Alternative 4: 87.4% accurate, 1.4× speedup

Math

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

FPCore

x.im\_m = (fabs.f64 x.im)
x.im\_s = (copysign.f64 #s(literal 1 binary64) x.im)
(FPCore (x.im_s x.re x.im_m)
 :precision binary64
 (*
  x.im_s
  (if (<= x.im_m 7.6e-98)
    (* x.im_m (* x.re (* x.re 3.0)))
    (* (- x.re x.im_m) (* x.im_m (+ x.im_m x.re))))))

C

x.im\_m = fabs(x_46_im);
x.im\_s = copysign(1.0, x_46_im);
double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	double tmp;
	if (x_46_im_m <= 7.6e-98) {
		tmp = x_46_im_m * (x_46_re * (x_46_re * 3.0));
	} else {
		tmp = (x_46_re - x_46_im_m) * (x_46_im_m * (x_46_im_m + x_46_re));
	}
	return x_46_im_s * tmp;
}

Fortran

x.im\_m = abs(x_46im)
x.im\_s = copysign(1.0d0, x_46im)
real(8) function code(x_46im_s, x_46re, x_46im_m)
    real(8), intent (in) :: x_46im_s
    real(8), intent (in) :: x_46re
    real(8), intent (in) :: x_46im_m
    real(8) :: tmp
    if (x_46im_m <= 7.6d-98) then
        tmp = x_46im_m * (x_46re * (x_46re * 3.0d0))
    else
        tmp = (x_46re - x_46im_m) * (x_46im_m * (x_46im_m + x_46re))
    end if
    code = x_46im_s * tmp
end function

Java

x.im\_m = Math.abs(x_46_im);
x.im\_s = Math.copySign(1.0, x_46_im);
public static double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	double tmp;
	if (x_46_im_m <= 7.6e-98) {
		tmp = x_46_im_m * (x_46_re * (x_46_re * 3.0));
	} else {
		tmp = (x_46_re - x_46_im_m) * (x_46_im_m * (x_46_im_m + x_46_re));
	}
	return x_46_im_s * tmp;
}

Python

x.im\_m = math.fabs(x_46_im)
x.im\_s = math.copysign(1.0, x_46_im)
def code(x_46_im_s, x_46_re, x_46_im_m):
	tmp = 0
	if x_46_im_m <= 7.6e-98:
		tmp = x_46_im_m * (x_46_re * (x_46_re * 3.0))
	else:
		tmp = (x_46_re - x_46_im_m) * (x_46_im_m * (x_46_im_m + x_46_re))
	return x_46_im_s * tmp

Julia

x.im\_m = abs(x_46_im)
x.im\_s = copysign(1.0, x_46_im)
function code(x_46_im_s, x_46_re, x_46_im_m)
	tmp = 0.0
	if (x_46_im_m <= 7.6e-98)
		tmp = Float64(x_46_im_m * Float64(x_46_re * Float64(x_46_re * 3.0)));
	else
		tmp = Float64(Float64(x_46_re - x_46_im_m) * Float64(x_46_im_m * Float64(x_46_im_m + x_46_re)));
	end
	return Float64(x_46_im_s * tmp)
end

MATLAB

x.im\_m = abs(x_46_im);
x.im\_s = sign(x_46_im) * abs(1.0);
function tmp_2 = code(x_46_im_s, x_46_re, x_46_im_m)
	tmp = 0.0;
	if (x_46_im_m <= 7.6e-98)
		tmp = x_46_im_m * (x_46_re * (x_46_re * 3.0));
	else
		tmp = (x_46_re - x_46_im_m) * (x_46_im_m * (x_46_im_m + x_46_re));
	end
	tmp_2 = x_46_im_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x.im < 7.6000000000000006e-98

   1. Initial program 76.3%

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

   3. Taylor expanded in x.im around 0 47.9%

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

      1. distribute-lft1-in 47.9%

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

      2. metadata-eval 47.9%

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

      3. unpow2 47.9%

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

      4. associate-*r* 47.9%

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

   5. Applied egg-rr 47.9%

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

   if 7.6000000000000006e-98 < x.im

   1. Initial program 85.2%

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

      1. difference-of-squares 89.3%

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

      2. *-commutative 89.3%

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

   4. Applied egg-rr 89.3%

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

      1. *-commutative 89.3%

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

      2. distribute-rgt-in 83.1%

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

      3. distribute-rgt-in 82.0%

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

   6. Applied egg-rr 82.0%

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

   8. Applied egg-rr 89.9%

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

4. Final simplification 63.6%

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

Alternative 5: 58.6% accurate, 1.6× speedup

Math

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

FPCore

x.im\_m = (fabs.f64 x.im)
x.im\_s = (copysign.f64 #s(literal 1 binary64) x.im)
(FPCore (x.im_s x.re x.im_m)
 :precision binary64
 (*
  x.im_s
  (if (<= x.im_m 3.5e+61)
    (* x.im_m (* x.re (* x.re 3.0)))
    (* (- x.re x.im_m) (* x.im_m x.re)))))

C

x.im\_m = fabs(x_46_im);
x.im\_s = copysign(1.0, x_46_im);
double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	double tmp;
	if (x_46_im_m <= 3.5e+61) {
		tmp = x_46_im_m * (x_46_re * (x_46_re * 3.0));
	} else {
		tmp = (x_46_re - x_46_im_m) * (x_46_im_m * x_46_re);
	}
	return x_46_im_s * tmp;
}

Fortran

x.im\_m = abs(x_46im)
x.im\_s = copysign(1.0d0, x_46im)
real(8) function code(x_46im_s, x_46re, x_46im_m)
    real(8), intent (in) :: x_46im_s
    real(8), intent (in) :: x_46re
    real(8), intent (in) :: x_46im_m
    real(8) :: tmp
    if (x_46im_m <= 3.5d+61) then
        tmp = x_46im_m * (x_46re * (x_46re * 3.0d0))
    else
        tmp = (x_46re - x_46im_m) * (x_46im_m * x_46re)
    end if
    code = x_46im_s * tmp
end function

Java

x.im\_m = Math.abs(x_46_im);
x.im\_s = Math.copySign(1.0, x_46_im);
public static double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	double tmp;
	if (x_46_im_m <= 3.5e+61) {
		tmp = x_46_im_m * (x_46_re * (x_46_re * 3.0));
	} else {
		tmp = (x_46_re - x_46_im_m) * (x_46_im_m * x_46_re);
	}
	return x_46_im_s * tmp;
}

Python

x.im\_m = math.fabs(x_46_im)
x.im\_s = math.copysign(1.0, x_46_im)
def code(x_46_im_s, x_46_re, x_46_im_m):
	tmp = 0
	if x_46_im_m <= 3.5e+61:
		tmp = x_46_im_m * (x_46_re * (x_46_re * 3.0))
	else:
		tmp = (x_46_re - x_46_im_m) * (x_46_im_m * x_46_re)
	return x_46_im_s * tmp

Julia

x.im\_m = abs(x_46_im)
x.im\_s = copysign(1.0, x_46_im)
function code(x_46_im_s, x_46_re, x_46_im_m)
	tmp = 0.0
	if (x_46_im_m <= 3.5e+61)
		tmp = Float64(x_46_im_m * Float64(x_46_re * Float64(x_46_re * 3.0)));
	else
		tmp = Float64(Float64(x_46_re - x_46_im_m) * Float64(x_46_im_m * x_46_re));
	end
	return Float64(x_46_im_s * tmp)
end

MATLAB

x.im\_m = abs(x_46_im);
x.im\_s = sign(x_46_im) * abs(1.0);
function tmp_2 = code(x_46_im_s, x_46_re, x_46_im_m)
	tmp = 0.0;
	if (x_46_im_m <= 3.5e+61)
		tmp = x_46_im_m * (x_46_re * (x_46_re * 3.0));
	else
		tmp = (x_46_re - x_46_im_m) * (x_46_im_m * x_46_re);
	end
	tmp_2 = x_46_im_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x.im < 3.50000000000000018e61

   1. Initial program 80.9%

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

   3. Taylor expanded in x.im around 0 47.7%

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

      1. distribute-lft1-in 47.7%

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

      2. metadata-eval 47.7%

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

      3. unpow2 47.7%

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

      4. associate-*r* 47.6%

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

   5. Applied egg-rr 47.6%

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

   if 3.50000000000000018e61 < x.im

   1. Initial program 75.4%

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

      1. difference-of-squares 82.4%

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

      2. *-commutative 82.4%

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

   4. Applied egg-rr 82.4%

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

      1. *-commutative 82.4%

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

      2. distribute-rgt-in 71.8%

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

      3. distribute-rgt-in 70.1%

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

   6. Applied egg-rr 70.1%

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

   8. Applied egg-rr 99.9%

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

   9. Taylor expanded in x.re around inf 40.2%

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

4. Final simplification 46.0%

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

Alternative 6: 50.6% accurate, 2.7× speedup

Math

\[\begin{array}{l} x.im\_m = \left|x.im\right| \\ x.im\_s = \mathsf{copysign}\left(1, x.im\right) \\ x.im\_s \cdot \left(x.im\_m \cdot \left(x.re \cdot \left(x.re \cdot 3\right)\right)\right) \end{array} \]

FPCore

x.im\_m = (fabs.f64 x.im)
x.im\_s = (copysign.f64 #s(literal 1 binary64) x.im)
(FPCore (x.im_s x.re x.im_m)
 :precision binary64
 (* x.im_s (* x.im_m (* x.re (* x.re 3.0)))))

C

x.im\_m = fabs(x_46_im);
x.im\_s = copysign(1.0, x_46_im);
double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	return x_46_im_s * (x_46_im_m * (x_46_re * (x_46_re * 3.0)));
}

Fortran

x.im\_m = abs(x_46im)
x.im\_s = copysign(1.0d0, x_46im)
real(8) function code(x_46im_s, x_46re, x_46im_m)
    real(8), intent (in) :: x_46im_s
    real(8), intent (in) :: x_46re
    real(8), intent (in) :: x_46im_m
    code = x_46im_s * (x_46im_m * (x_46re * (x_46re * 3.0d0)))
end function

Java

x.im\_m = Math.abs(x_46_im);
x.im\_s = Math.copySign(1.0, x_46_im);
public static double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	return x_46_im_s * (x_46_im_m * (x_46_re * (x_46_re * 3.0)));
}

Python

x.im\_m = math.fabs(x_46_im)
x.im\_s = math.copysign(1.0, x_46_im)
def code(x_46_im_s, x_46_re, x_46_im_m):
	return x_46_im_s * (x_46_im_m * (x_46_re * (x_46_re * 3.0)))

Julia

x.im\_m = abs(x_46_im)
x.im\_s = copysign(1.0, x_46_im)
function code(x_46_im_s, x_46_re, x_46_im_m)
	return Float64(x_46_im_s * Float64(x_46_im_m * Float64(x_46_re * Float64(x_46_re * 3.0))))
end

MATLAB

x.im\_m = abs(x_46_im);
x.im\_s = sign(x_46_im) * abs(1.0);
function tmp = code(x_46_im_s, x_46_re, x_46_im_m)
	tmp = x_46_im_s * (x_46_im_m * (x_46_re * (x_46_re * 3.0)));
end

Wolfram

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

Derivation

1. Initial program 79.6%

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

3. Taylor expanded in x.im around 0 41.1%

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

   1. distribute-lft1-in 41.1%

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

   2. metadata-eval 41.1%

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

   3. unpow2 41.1%

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

   4. associate-*r* 41.1%

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

5. Applied egg-rr 41.1%

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

6. Final simplification 41.1%

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

Alternative 7: 2.6% accurate, 19.0× speedup

Math

\[\begin{array}{l} x.im\_m = \left|x.im\right| \\ x.im\_s = \mathsf{copysign}\left(1, x.im\right) \\ x.im\_s \cdot -3 \end{array} \]

FPCore

x.im\_m = (fabs.f64 x.im)
x.im\_s = (copysign.f64 #s(literal 1 binary64) x.im)
(FPCore (x.im_s x.re x.im_m) :precision binary64 (* x.im_s -3.0))

C

x.im\_m = fabs(x_46_im);
x.im\_s = copysign(1.0, x_46_im);
double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	return x_46_im_s * -3.0;
}

Fortran

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

Java

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

Python

x.im\_m = math.fabs(x_46_im)
x.im\_s = math.copysign(1.0, x_46_im)
def code(x_46_im_s, x_46_re, x_46_im_m):
	return x_46_im_s * -3.0

Julia

x.im\_m = abs(x_46_im)
x.im\_s = copysign(1.0, x_46_im)
function code(x_46_im_s, x_46_re, x_46_im_m)
	return Float64(x_46_im_s * -3.0)
end

MATLAB

x.im\_m = abs(x_46_im);
x.im\_s = sign(x_46_im) * abs(1.0);
function tmp = code(x_46_im_s, x_46_re, x_46_im_m)
	tmp = x_46_im_s * -3.0;
end

Wolfram

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

Derivation

1. Initial program 79.6%

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

3. Simplified 86.2%

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

5. Taylor expanded in x.re around 0 61.7%

   \[\leadsto \color{blue}{-1 \cdot {x.im}^{3}} \]

7. Simplified 2.7%

   \[\leadsto \color{blue}{-3} \]

8. Final simplification 2.7%

   \[\leadsto -3 \]
9. Add Preprocessing

Alternative 8: 3.5% accurate, 19.0× speedup

Math

\[\begin{array}{l} x.im\_m = \left|x.im\right| \\ x.im\_s = \mathsf{copysign}\left(1, x.im\right) \\ x.im\_s \cdot x.re \end{array} \]

FPCore

x.im\_m = (fabs.f64 x.im)
x.im\_s = (copysign.f64 #s(literal 1 binary64) x.im)
(FPCore (x.im_s x.re x.im_m) :precision binary64 (* x.im_s x.re))

C

x.im\_m = fabs(x_46_im);
x.im\_s = copysign(1.0, x_46_im);
double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	return x_46_im_s * x_46_re;
}

Fortran

x.im\_m = abs(x_46im)
x.im\_s = copysign(1.0d0, x_46im)
real(8) function code(x_46im_s, x_46re, x_46im_m)
    real(8), intent (in) :: x_46im_s
    real(8), intent (in) :: x_46re
    real(8), intent (in) :: x_46im_m
    code = x_46im_s * x_46re
end function

Java

x.im\_m = Math.abs(x_46_im);
x.im\_s = Math.copySign(1.0, x_46_im);
public static double code(double x_46_im_s, double x_46_re, double x_46_im_m) {
	return x_46_im_s * x_46_re;
}

Python

x.im\_m = math.fabs(x_46_im)
x.im\_s = math.copysign(1.0, x_46_im)
def code(x_46_im_s, x_46_re, x_46_im_m):
	return x_46_im_s * x_46_re

Julia

x.im\_m = abs(x_46_im)
x.im\_s = copysign(1.0, x_46_im)
function code(x_46_im_s, x_46_re, x_46_im_m)
	return Float64(x_46_im_s * x_46_re)
end

MATLAB

x.im\_m = abs(x_46_im);
x.im\_s = sign(x_46_im) * abs(1.0);
function tmp = code(x_46_im_s, x_46_re, x_46_im_m)
	tmp = x_46_im_s * x_46_re;
end

Wolfram

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

Derivation

1. Initial program 79.6%

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

   1. difference-of-squares 82.4%

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

   2. *-commutative 82.4%

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

4. Applied egg-rr 82.4%

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

   1. expm1-log1p-u 63.0%

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

   2. expm1-undefine 53.9%

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

6. Applied egg-rr 0.0%

   \[\leadsto \left(\left(x.re - x.im\right) \cdot \left(x.re + x.im\right)\right) \cdot x.im + \color{blue}{\left(e^{\mathsf{log1p}\left(\frac{0}{0}\right)} - 1\right)} \cdot x.re \]

8. Simplified 63.2%

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

   1. associate-*l* 63.7%

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

   2. fma-define 63.7%

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

   3. add-sqr-sqrt 31.7%

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

   4. sqrt-unprod 61.4%

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

   5. mul-1-neg 61.4%

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

   6. mul-1-neg 61.4%

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

   7. sqr-neg 61.4%

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

   8. sqrt-unprod 31.7%

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

   9. add-sqr-sqrt 63.5%

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

10. Applied egg-rr 63.5%

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

11. Taylor expanded in x.im around 0 3.2%

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

12. Final simplification 3.2%

    \[\leadsto x.re \]
13. Add Preprocessing

Developer target: 91.2% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024075 
(FPCore (x.re x.im)
  :name "math.cube on complex, imaginary part"
  :precision binary64

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

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