Average Error: 0.0 → 0.0
Time: 5.9s
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 r147498 = re;
        double r147499 = r147498 * r147498;
        double r147500 = im;
        double r147501 = r147500 * r147500;
        double r147502 = r147499 - r147501;
        return r147502;
}
↓
double f(double re, double im) {
        double r147503 = re;
        double r147504 = r147503 * r147503;
        double r147505 = im;
        double r147506 = r147505 * r147505;
        double r147507 = r147504 - r147506;
        return r147507;
}

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 2019139 
(FPCore (re im)
  :name "math.square on complex, real part"
  (- (* re re) (* im im)))