Average Error: 0.3 → 0.2
Time: 15.5s
Precision: 64
\[\left(x.re \cdot y.re\right) - \left(x.im \cdot y.im\right)\]
↓
\[\left(\mathsf{qms}\left(\left(\left(x.re \cdot y.re\right)\right), x.im, y.im\right)\right)\]
\left(x.re \cdot y.re\right) - \left(x.im \cdot y.im\right)
↓
\left(\mathsf{qms}\left(\left(\left(x.re \cdot y.re\right)\right), x.im, y.im\right)\right)
double f(double x_re, double x_im, double y_re, double y_im) {
        double r1800054 = x_re;
        double r1800055 = y_re;
        double r1800056 = r1800054 * r1800055;
        double r1800057 = x_im;
        double r1800058 = y_im;
        double r1800059 = r1800057 * r1800058;
        double r1800060 = r1800056 - r1800059;
        return r1800060;
}
↓
double f(double x_re, double x_im, double y_re, double y_im) {
        double r1800061 = x_re;
        double r1800062 = y_re;
        double r1800063 = r1800061 * r1800062;
        double r1800064 = /*Error: no posit support in C */;
        double r1800065 = x_im;
        double r1800066 = y_im;
        double r1800067 = /*Error: no posit support in C */;
        double r1800068 = /*Error: no posit support in C */;
        return r1800068;
}

Error

Bits error versus x.re

Bits error versus x.im

Bits error versus y.re

Bits error versus y.im

Derivation

  1. Initial program 0.3

    \[\left(x.re \cdot y.re\right) - \left(x.im \cdot y.im\right)\]
  2. Using strategy rm

  3. Applied introduce-quire0.3

    \[\leadsto \color{blue}{\left(\left(\left(x.re \cdot y.re\right)\right)\right)} - \left(x.im \cdot y.im\right)\]

  4. Applied insert-quire-fdp-sub0.2

    \[\leadsto \color{blue}{\left(\mathsf{qms}\left(\left(\left(x.re \cdot y.re\right)\right), x.im, y.im\right)\right)}\]

  5. Final simplification0.2

    \[\leadsto \left(\mathsf{qms}\left(\left(\left(x.re \cdot y.re\right)\right), x.im, y.im\right)\right)\]

Reproduce

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