math.cube on complex, imaginary part

Average Error: 7.9 → 0.3

Time: 14.7s

Precision: binary64

Cost: 1224

Math

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

↓

\[\begin{array}{l} t_0 := \left(x.im + x.re\right) \cdot \left(x.re \cdot x.im\right) + x.re \cdot \left(x.re \cdot \left(x.im + x.im\right)\right)\\ \mathbf{if}\;x.re \leq -1.7 \cdot 10^{+96}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;x.re \leq 7.5 \cdot 10^{+144}:\\ \;\;\;\;x.im \cdot \left(x.im \cdot \left(-x.im\right) + 3 \cdot \left(x.re \cdot x.re\right)\right)\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \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)))

↓

(FPCore (x.re x.im)
 :precision binary64
 (let* ((t_0
         (+ (* (+ x.im x.re) (* x.re x.im)) (* x.re (* x.re (+ x.im x.im))))))
   (if (<= x.re -1.7e+96)
     t_0
     (if (<= x.re 7.5e+144)
       (* x.im (+ (* x.im (- x.im)) (* 3.0 (* x.re x.re))))
       t_0))))

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

↓

double code(double x_46_re, double x_46_im) {
	double t_0 = ((x_46_im + x_46_re) * (x_46_re * x_46_im)) + (x_46_re * (x_46_re * (x_46_im + x_46_im)));
	double tmp;
	if (x_46_re <= -1.7e+96) {
		tmp = t_0;
	} else if (x_46_re <= 7.5e+144) {
		tmp = x_46_im * ((x_46_im * -x_46_im) + (3.0 * (x_46_re * x_46_re)));
	} else {
		tmp = t_0;
	}
	return tmp;
}

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

↓

real(8) function code(x_46re, x_46im)
    real(8), intent (in) :: x_46re
    real(8), intent (in) :: x_46im
    real(8) :: t_0
    real(8) :: tmp
    t_0 = ((x_46im + x_46re) * (x_46re * x_46im)) + (x_46re * (x_46re * (x_46im + x_46im)))
    if (x_46re <= (-1.7d+96)) then
        tmp = t_0
    else if (x_46re <= 7.5d+144) then
        tmp = x_46im * ((x_46im * -x_46im) + (3.0d0 * (x_46re * x_46re)))
    else
        tmp = t_0
    end if
    code = tmp
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);
}

↓

public static double code(double x_46_re, double x_46_im) {
	double t_0 = ((x_46_im + x_46_re) * (x_46_re * x_46_im)) + (x_46_re * (x_46_re * (x_46_im + x_46_im)));
	double tmp;
	if (x_46_re <= -1.7e+96) {
		tmp = t_0;
	} else if (x_46_re <= 7.5e+144) {
		tmp = x_46_im * ((x_46_im * -x_46_im) + (3.0 * (x_46_re * x_46_re)));
	} else {
		tmp = t_0;
	}
	return tmp;
}

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)

↓

def code(x_46_re, x_46_im):
	t_0 = ((x_46_im + x_46_re) * (x_46_re * x_46_im)) + (x_46_re * (x_46_re * (x_46_im + x_46_im)))
	tmp = 0
	if x_46_re <= -1.7e+96:
		tmp = t_0
	elif x_46_re <= 7.5e+144:
		tmp = x_46_im * ((x_46_im * -x_46_im) + (3.0 * (x_46_re * x_46_re)))
	else:
		tmp = t_0
	return tmp

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

↓

function code(x_46_re, x_46_im)
	t_0 = Float64(Float64(Float64(x_46_im + x_46_re) * Float64(x_46_re * x_46_im)) + Float64(x_46_re * Float64(x_46_re * Float64(x_46_im + x_46_im))))
	tmp = 0.0
	if (x_46_re <= -1.7e+96)
		tmp = t_0;
	elseif (x_46_re <= 7.5e+144)
		tmp = Float64(x_46_im * Float64(Float64(x_46_im * Float64(-x_46_im)) + Float64(3.0 * Float64(x_46_re * x_46_re))));
	else
		tmp = t_0;
	end
	return tmp
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

↓

function tmp_2 = code(x_46_re, x_46_im)
	t_0 = ((x_46_im + x_46_re) * (x_46_re * x_46_im)) + (x_46_re * (x_46_re * (x_46_im + x_46_im)));
	tmp = 0.0;
	if (x_46_re <= -1.7e+96)
		tmp = t_0;
	elseif (x_46_re <= 7.5e+144)
		tmp = x_46_im * ((x_46_im * -x_46_im) + (3.0 * (x_46_re * x_46_re)));
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
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]

↓

code[x$46$re_, x$46$im_] := Block[{t$95$0 = N[(N[(N[(x$46$im + x$46$re), $MachinePrecision] * N[(x$46$re * x$46$im), $MachinePrecision]), $MachinePrecision] + N[(x$46$re * N[(x$46$re * N[(x$46$im + x$46$im), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$46$re, -1.7e+96], t$95$0, If[LessEqual[x$46$re, 7.5e+144], N[(x$46$im * N[(N[(x$46$im * (-x$46$im)), $MachinePrecision] + N[(3.0 * N[(x$46$re * x$46$re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Target

Original	7.9
Target	0.2
Herbie	0.3

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

Derivation

1. Split input into 2 regimes

2. if x.re < -1.7e96 or 7.5000000000000006e144 < x.re

   1. Initial program 44.1

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

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

      [Start] 44.1	\[ \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 \]
      rational_best.json-simplify-2 [=>] 44.1	\[ \color{blue}{x.im \cdot \left(x.re \cdot x.re - x.im \cdot x.im\right)} + \left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re \]
      rational_best.json-simplify-2 [=>] 44.1	\[ x.im \cdot \left(x.re \cdot x.re - x.im \cdot x.im\right) + \color{blue}{x.re \cdot \left(x.re \cdot x.im + x.im \cdot x.re\right)} \]
      rational_best.json-simplify-2 [<=] 44.1	\[ x.im \cdot \left(x.re \cdot x.re - x.im \cdot x.im\right) + x.re \cdot \left(x.re \cdot x.im + \color{blue}{x.re \cdot x.im}\right) \]
      rational_best.json-simplify-47 [=>] 44.1	\[ x.im \cdot \left(x.re \cdot x.re - x.im \cdot x.im\right) + x.re \cdot \color{blue}{\left(x.re \cdot \left(x.im + x.im\right)\right)} \]

   3. Applied egg-rr 61.7

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

   4. Applied egg-rr 0.4

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

   5. Simplified 0.4

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

      [Start] 0.4	\[ \left(\left(x.re + x.im\right) \cdot \left(x.im \cdot \left(x.re - x.im\right)\right) + 0\right) + x.re \cdot \left(x.re \cdot \left(x.im + x.im\right)\right) \]
      rational_best.json-simplify-4 [=>] 0.4	\[ \color{blue}{\left(x.re + x.im\right) \cdot \left(x.im \cdot \left(x.re - x.im\right)\right)} + x.re \cdot \left(x.re \cdot \left(x.im + x.im\right)\right) \]
      rational_best.json-simplify-1 [=>] 0.4	\[ \color{blue}{\left(x.im + x.re\right)} \cdot \left(x.im \cdot \left(x.re - x.im\right)\right) + x.re \cdot \left(x.re \cdot \left(x.im + x.im\right)\right) \]

   6. Taylor expanded in x.im around 0 0.4

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

   if -1.7e96 < x.re < 7.5000000000000006e144

   1. Initial program 0.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. Simplified 0.2

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

      [Start] 0.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 \]
      rational_best.json-simplify-1 [=>] 0.2	\[ \color{blue}{\left(x.re \cdot x.im + x.im \cdot x.re\right) \cdot x.re + \left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im} \]
      rational_best.json-simplify-2 [=>] 0.2	\[ \color{blue}{x.re \cdot \left(x.re \cdot x.im + x.im \cdot x.re\right)} + \left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im \]
      rational_best.json-simplify-2 [=>] 0.2	\[ x.re \cdot \left(\color{blue}{x.im \cdot x.re} + x.im \cdot x.re\right) + \left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im \]
      rational_best.json-simplify-47 [=>] 0.2	\[ x.re \cdot \color{blue}{\left(x.im \cdot \left(x.re + x.re\right)\right)} + \left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im \]
      rational_best.json-simplify-44 [=>] 0.2	\[ \color{blue}{x.im \cdot \left(x.re \cdot \left(x.re + x.re\right)\right)} + \left(x.re \cdot x.re - x.im \cdot x.im\right) \cdot x.im \]
      rational_best.json-simplify-2 [=>] 0.2	\[ x.im \cdot \left(x.re \cdot \left(x.re + x.re\right)\right) + \color{blue}{x.im \cdot \left(x.re \cdot x.re - x.im \cdot x.im\right)} \]
      rational_best.json-simplify-47 [=>] 0.2	\[ \color{blue}{x.im \cdot \left(\left(x.re \cdot x.re - x.im \cdot x.im\right) + x.re \cdot \left(x.re + x.re\right)\right)} \]

   3. Applied egg-rr 0.2

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

   4. Simplified 0.2

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

      [Start] 0.2	\[ x.im \cdot \left(\left(-x.im \cdot x.im\right) + x.re \cdot \left(x.re \cdot 3\right)\right) + 0 \]
      rational_best.json-simplify-4 [=>] 0.2	\[ \color{blue}{x.im \cdot \left(\left(-x.im \cdot x.im\right) + x.re \cdot \left(x.re \cdot 3\right)\right)} \]

   5. Applied egg-rr 0.2

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

   6. Simplified 0.2

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

      [Start] 0.2	\[ x.im \cdot \left(x.im \cdot \left(-x.im\right) + x.re \cdot \left(x.re \cdot 3\right)\right) + 0 \]
      rational_best.json-simplify-4 [=>] 0.2	\[ \color{blue}{x.im \cdot \left(x.im \cdot \left(-x.im\right) + x.re \cdot \left(x.re \cdot 3\right)\right)} \]
      rational_best.json-simplify-2 [=>] 0.2	\[ x.im \cdot \left(x.im \cdot \left(-x.im\right) + x.re \cdot \color{blue}{\left(3 \cdot x.re\right)}\right) \]
      rational_best.json-simplify-44 [=>] 0.2	\[ x.im \cdot \left(x.im \cdot \left(-x.im\right) + \color{blue}{3 \cdot \left(x.re \cdot x.re\right)}\right) \]

3. Recombined 2 regimes into one program.

4. Final simplification 0.3

   \[\leadsto \begin{array}{l} \mathbf{if}\;x.re \leq -1.7 \cdot 10^{+96}:\\ \;\;\;\;\left(x.im + x.re\right) \cdot \left(x.re \cdot x.im\right) + x.re \cdot \left(x.re \cdot \left(x.im + x.im\right)\right)\\ \mathbf{elif}\;x.re \leq 7.5 \cdot 10^{+144}:\\ \;\;\;\;x.im \cdot \left(x.im \cdot \left(-x.im\right) + 3 \cdot \left(x.re \cdot x.re\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\left(x.im + x.re\right) \cdot \left(x.re \cdot x.im\right) + x.re \cdot \left(x.re \cdot \left(x.im + x.im\right)\right)\\ \end{array} \]

Alternatives

Alternative 1
Error	0.2
Cost	1088

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

Alternative 2
Error	7.9
Cost	768

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

Alternative 3
Error	7.9
Cost	768

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

Reproduce

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

  :herbie-target
  (+ (* (* 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)))