Average Error: 0.0 → 0.0
Time: 9.8s
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 r1347582 = x_re;
        double r1347583 = y_re;
        double r1347584 = r1347582 * r1347583;
        double r1347585 = x_im;
        double r1347586 = y_im;
        double r1347587 = r1347585 * r1347586;
        double r1347588 = r1347584 - r1347587;
        return r1347588;
}
↓
double f(double x_re, double x_im, double y_re, double y_im) {
        double r1347589 = x_re;
        double r1347590 = y_re;
        double r1347591 = r1347589 * r1347590;
        double r1347592 = x_im;
        double r1347593 = y_im;
        double r1347594 = r1347592 * r1347593;
        double r1347595 = r1347591 - r1347594;
        return r1347595;
}

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