Average Error: 0.0 → 0.0
Time: 9.2s
Precision: 64
\[x.re \cdot y.re - x.im \cdot y.im\]
↓
\[x.re \cdot y.re - x.im \cdot y.im\]
x.re \cdot y.re - x.im \cdot y.im
↓
x.re \cdot y.re - x.im \cdot y.im
double f(double x_re, double x_im, double y_re, double y_im) {
        double r2387253 = x_re;
        double r2387254 = y_re;
        double r2387255 = r2387253 * r2387254;
        double r2387256 = x_im;
        double r2387257 = y_im;
        double r2387258 = r2387256 * r2387257;
        double r2387259 = r2387255 - r2387258;
        return r2387259;
}
↓
double f(double x_re, double x_im, double y_re, double y_im) {
        double r2387260 = x_re;
        double r2387261 = y_re;
        double r2387262 = r2387260 * r2387261;
        double r2387263 = x_im;
        double r2387264 = y_im;
        double r2387265 = r2387263 * r2387264;
        double r2387266 = r2387262 - r2387265;
        return r2387266;
}

Error

Bits error versus x.re

Bits error versus x.im

Bits error versus y.re

Bits error versus y.im

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[x.re \cdot y.re - x.im \cdot y.im\]

  2. Final simplification0.0

    \[\leadsto x.re \cdot y.re - x.im \cdot y.im\]

Reproduce

herbie shell --seed 2019172 
(FPCore (x.re x.im y.re y.im)
  :name "_multiplyComplex, real part"
  (- (* x.re y.re) (* x.im y.im)))