Average Error: 0.0 → 0.0
Time: 2.1s
Precision: 64
\[x \cdot y + z \cdot t\]
↓
\[x \cdot y + z \cdot t\]
x \cdot y + z \cdot t
↓
x \cdot y + z \cdot t
double f(double x, double y, double z, double t) {
        double r132653 = x;
        double r132654 = y;
        double r132655 = r132653 * r132654;
        double r132656 = z;
        double r132657 = t;
        double r132658 = r132656 * r132657;
        double r132659 = r132655 + r132658;
        return r132659;
}
↓
double f(double x, double y, double z, double t) {
        double r132660 = x;
        double r132661 = y;
        double r132662 = r132660 * r132661;
        double r132663 = z;
        double r132664 = t;
        double r132665 = r132663 * r132664;
        double r132666 = r132662 + r132665;
        return r132666;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Bits error versus t

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[x \cdot y + z \cdot t\]

  2. Final simplification0.0

    \[\leadsto x \cdot y + z \cdot t\]

Reproduce

herbie shell --seed 2020024 
(FPCore (x y z t)
  :name "Linear.V2:$cdot from linear-1.19.1.3, A"
  :precision binary64
  (+ (* x y) (* z t)))