Average Error: 0.0 → 0.0
Time: 3.4s
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 r132798 = x;
        double r132799 = y;
        double r132800 = r132798 * r132799;
        double r132801 = z;
        double r132802 = t;
        double r132803 = r132801 * r132802;
        double r132804 = r132800 + r132803;
        return r132804;
}
↓
double f(double x, double y, double z, double t) {
        double r132805 = x;
        double r132806 = y;
        double r132807 = r132805 * r132806;
        double r132808 = z;
        double r132809 = t;
        double r132810 = r132808 * r132809;
        double r132811 = r132807 + r132810;
        return r132811;
}

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 2020003 
(FPCore (x y z t)
  :name "Linear.V2:$cdot from linear-1.19.1.3, A"
  :precision binary64
  (+ (* x y) (* z t)))