Average Error: 0.0 → 0.0
Time: 5.9s
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 r127796 = x;
        double r127797 = y;
        double r127798 = r127796 * r127797;
        double r127799 = z;
        double r127800 = t;
        double r127801 = r127799 * r127800;
        double r127802 = r127798 + r127801;
        return r127802;
}
↓
double f(double x, double y, double z, double t) {
        double r127803 = x;
        double r127804 = y;
        double r127805 = r127803 * r127804;
        double r127806 = z;
        double r127807 = t;
        double r127808 = r127806 * r127807;
        double r127809 = r127805 + r127808;
        return r127809;
}

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