Average Error: 0.0 → 0.0
Time: 5.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 r99051 = re;
        double r99052 = r99051 * r99051;
        double r99053 = im;
        double r99054 = r99053 * r99053;
        double r99055 = r99052 - r99054;
        return r99055;
}
↓
double f(double re, double im) {
        double r99056 = re;
        double r99057 = r99056 * r99056;
        double r99058 = im;
        double r99059 = r99058 * r99058;
        double r99060 = r99057 - r99059;
        return r99060;
}

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)))