Average Error: 0.0 → 0.0
Time: 57.2s
Precision: 64
\[x.re \cdot y.re - x.im \cdot y.im\]
↓
\[y.re \cdot x.re - y.im \cdot x.im\]
x.re \cdot y.re - x.im \cdot y.im
↓
y.re \cdot x.re - y.im \cdot x.im
double f(double x_re, double x_im, double y_re, double y_im) {
        double r2801244 = x_re;
        double r2801245 = y_re;
        double r2801246 = r2801244 * r2801245;
        double r2801247 = x_im;
        double r2801248 = y_im;
        double r2801249 = r2801247 * r2801248;
        double r2801250 = r2801246 - r2801249;
        return r2801250;
}
↓
double f(double x_re, double x_im, double y_re, double y_im) {
        double r2801251 = y_re;
        double r2801252 = x_re;
        double r2801253 = r2801251 * r2801252;
        double r2801254 = y_im;
        double r2801255 = x_im;
        double r2801256 = r2801254 * r2801255;
        double r2801257 = r2801253 - r2801256;
        return r2801257;
}

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 y.re \cdot x.re - y.im \cdot x.im\]

Reproduce

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