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 r147547 = x;
        double r147548 = y;
        double r147549 = r147547 * r147548;
        double r147550 = z;
        double r147551 = t;
        double r147552 = r147550 * r147551;
        double r147553 = r147549 + r147552;
        return r147553;
}
↓
double f(double x, double y, double z, double t) {
        double r147554 = x;
        double r147555 = y;
        double r147556 = r147554 * r147555;
        double r147557 = z;
        double r147558 = t;
        double r147559 = r147557 * r147558;
        double r147560 = r147556 + r147559;
        return r147560;
}

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