Average Error: 0.0 → 0.0
Time: 9.4s
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 r2673324 = x_re;
        double r2673325 = y_re;
        double r2673326 = r2673324 * r2673325;
        double r2673327 = x_im;
        double r2673328 = y_im;
        double r2673329 = r2673327 * r2673328;
        double r2673330 = r2673326 - r2673329;
        return r2673330;
}
↓
double f(double x_re, double x_im, double y_re, double y_im) {
        double r2673331 = x_re;
        double r2673332 = y_re;
        double r2673333 = r2673331 * r2673332;
        double r2673334 = x_im;
        double r2673335 = y_im;
        double r2673336 = r2673334 * r2673335;
        double r2673337 = r2673333 - r2673336;
        return r2673337;
}

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 2019174 
(FPCore (x.re x.im y.re y.im)
  :name "_multiplyComplex, real part"
  (- (* x.re y.re) (* x.im y.im)))