Average Error: 0.0 → 0.0
Time: 3.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 r574 = x;
        double r575 = y;
        double r576 = r574 * r575;
        double r577 = z;
        double r578 = t;
        double r579 = r577 * r578;
        double r580 = r576 + r579;
        return r580;
}
↓
double f(double x, double y, double z, double t) {
        double r581 = x;
        double r582 = y;
        double r583 = r581 * r582;
        double r584 = z;
        double r585 = t;
        double r586 = r584 * r585;
        double r587 = r583 + r586;
        return r587;
}

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