Average Error: 0.0 → 0.0
Time: 10.0s
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 r118549 = x;
        double r118550 = y;
        double r118551 = r118549 * r118550;
        double r118552 = z;
        double r118553 = t;
        double r118554 = r118552 * r118553;
        double r118555 = r118551 + r118554;
        return r118555;
}
↓
double f(double x, double y, double z, double t) {
        double r118556 = x;
        double r118557 = y;
        double r118558 = r118556 * r118557;
        double r118559 = z;
        double r118560 = t;
        double r118561 = r118559 * r118560;
        double r118562 = r118558 + r118561;
        return r118562;
}

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