Average Error: 0.0 → 0.0
Time: 12.2s
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 r9636 = re;
        double r9637 = r9636 * r9636;
        double r9638 = im;
        double r9639 = r9638 * r9638;
        double r9640 = r9637 - r9639;
        return r9640;
}
↓
double f(double re, double im) {
        double r9641 = re;
        double r9642 = r9641 * r9641;
        double r9643 = im;
        double r9644 = r9643 * r9643;
        double r9645 = r9642 - r9644;
        return r9645;
}

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