Average Error: 0.0 → 0.0
Time: 9.1s
Precision: 64
\[re \cdot re - im \cdot im\]
↓
\[re \cdot re - im \cdot im\]
re \cdot re - im \cdot im
↓
re \cdot re - im \cdot im
double f(double re, double im) {
        double r1200696 = re;
        double r1200697 = r1200696 * r1200696;
        double r1200698 = im;
        double r1200699 = r1200698 * r1200698;
        double r1200700 = r1200697 - r1200699;
        return r1200700;
}
↓
double f(double re, double im) {
        double r1200701 = re;
        double r1200702 = r1200701 * r1200701;
        double r1200703 = im;
        double r1200704 = r1200703 * r1200703;
        double r1200705 = r1200702 - r1200704;
        return r1200705;
}

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

    \[re \cdot re - im \cdot im\]

  2. Final simplification0.0

    \[\leadsto re \cdot re - im \cdot im\]

Reproduce

herbie shell --seed 2019173 
(FPCore (re im)
  :name "math.square on complex, real part"
  (- (* re re) (* im im)))