Average Error: 0.0 → 0.0
Time: 8.1s
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 r514051 = re;
        double r514052 = r514051 * r514051;
        double r514053 = im;
        double r514054 = r514053 * r514053;
        double r514055 = r514052 - r514054;
        return r514055;
}
↓
double f(double re, double im) {
        double r514056 = re;
        double r514057 = r514056 * r514056;
        double r514058 = im;
        double r514059 = r514058 * r514058;
        double r514060 = r514057 - r514059;
        return r514060;
}

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