Average Error: 0.0 → 0.0
Time: 939.0ms
Precision: binary64
\[\]
↓
\[\]
↓
double code(double re, double im) {
	return ((double) (((double) (re * im)) + ((double) (im * re))));
}

↓
double code(double re, double im) {
	return ((double) (re * ((double) (im + im))));
}

Error
Bits error versus re
Bits error versus im
Try it out
Your Program's Arguments
Results
Enter valid numbers for all inputs
Derivation
  1. Initial program 0.0
    \[\]
  2. Simplified0.0
    \[\leadsto \]
  3. Final simplification0.0
    \[\leadsto \]
Reproduce
herbie shell --seed 2020191 
(FPCore (re im)
  :name "math.square on complex, imaginary part"
  :precision binary64
  (+ (* re im) (* im re)))