Average Error: 0.0 → 0.0
Time: 2.3s
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 r1082106 = x_re;
        double r1082107 = y_re;
        double r1082108 = r1082106 * r1082107;
        double r1082109 = x_im;
        double r1082110 = y_im;
        double r1082111 = r1082109 * r1082110;
        double r1082112 = r1082108 - r1082111;
        return r1082112;
}
↓
double f(double x_re, double x_im, double y_re, double y_im) {
        double r1082113 = x_re;
        double r1082114 = y_re;
        double r1082115 = r1082113 * r1082114;
        double r1082116 = x_im;
        double r1082117 = y_im;
        double r1082118 = r1082116 * r1082117;
        double r1082119 = r1082115 - r1082118;
        return r1082119;
}

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