Average Error: 0.0 → 0.0
Time: 3.1s
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 r2334799 = x_re;
        double r2334800 = y_re;
        double r2334801 = r2334799 * r2334800;
        double r2334802 = x_im;
        double r2334803 = y_im;
        double r2334804 = r2334802 * r2334803;
        double r2334805 = r2334801 - r2334804;
        return r2334805;
}
↓
double f(double x_re, double x_im, double y_re, double y_im) {
        double r2334806 = x_re;
        double r2334807 = y_re;
        double r2334808 = r2334806 * r2334807;
        double r2334809 = x_im;
        double r2334810 = y_im;
        double r2334811 = r2334809 * r2334810;
        double r2334812 = r2334808 - r2334811;
        return r2334812;
}

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