Average Error: 0.0 → 0.0
Time: 9.4s
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 r385739 = re;
        double r385740 = r385739 * r385739;
        double r385741 = im;
        double r385742 = r385741 * r385741;
        double r385743 = r385740 - r385742;
        return r385743;
}
↓
double f(double re, double im) {
        double r385744 = re;
        double r385745 = r385744 * r385744;
        double r385746 = im;
        double r385747 = r385746 * r385746;
        double r385748 = r385745 - r385747;
        return r385748;
}

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