Average Error: 0.0 → 0.0
Time: 7.5s
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 r132234 = x;
        double r132235 = y;
        double r132236 = r132234 * r132235;
        double r132237 = z;
        double r132238 = t;
        double r132239 = r132237 * r132238;
        double r132240 = r132236 + r132239;
        return r132240;
}
↓
double f(double x, double y, double z, double t) {
        double r132241 = x;
        double r132242 = y;
        double r132243 = r132241 * r132242;
        double r132244 = z;
        double r132245 = t;
        double r132246 = r132244 * r132245;
        double r132247 = r132243 + r132246;
        return r132247;
}

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