Average Error: 0.0 → 0.0
Time: 3.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 r2207251 = x_re;
        double r2207252 = y_re;
        double r2207253 = r2207251 * r2207252;
        double r2207254 = x_im;
        double r2207255 = y_im;
        double r2207256 = r2207254 * r2207255;
        double r2207257 = r2207253 - r2207256;
        return r2207257;
}
↓
double f(double x_re, double x_im, double y_re, double y_im) {
        double r2207258 = x_re;
        double r2207259 = y_re;
        double r2207260 = r2207258 * r2207259;
        double r2207261 = x_im;
        double r2207262 = y_im;
        double r2207263 = r2207261 * r2207262;
        double r2207264 = r2207260 - r2207263;
        return r2207264;
}

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