Average Error: 0.0 → 0.0
Time: 6.5s
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 r1108986 = x_re;
        double r1108987 = y_re;
        double r1108988 = r1108986 * r1108987;
        double r1108989 = x_im;
        double r1108990 = y_im;
        double r1108991 = r1108989 * r1108990;
        double r1108992 = r1108988 - r1108991;
        return r1108992;
}
↓
double f(double x_re, double x_im, double y_re, double y_im) {
        double r1108993 = x_re;
        double r1108994 = y_re;
        double r1108995 = r1108993 * r1108994;
        double r1108996 = x_im;
        double r1108997 = y_im;
        double r1108998 = r1108996 * r1108997;
        double r1108999 = r1108995 - r1108998;
        return r1108999;
}

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