Average Error: 0.0 → 0.0
Time: 6.7s
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 r113611 = re;
        double r113612 = r113611 * r113611;
        double r113613 = im;
        double r113614 = r113613 * r113613;
        double r113615 = r113612 - r113614;
        return r113615;
}
↓
double f(double re, double im) {
        double r113616 = re;
        double r113617 = r113616 * r113616;
        double r113618 = im;
        double r113619 = r113618 * r113618;
        double r113620 = r113617 - r113619;
        return r113620;
}

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