Average Error: 0.0 → 0.0
Time: 5.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 r79607 = x;
        double r79608 = y;
        double r79609 = r79607 * r79608;
        double r79610 = z;
        double r79611 = t;
        double r79612 = r79610 * r79611;
        double r79613 = r79609 + r79612;
        return r79613;
}
↓
double f(double x, double y, double z, double t) {
        double r79614 = x;
        double r79615 = y;
        double r79616 = r79614 * r79615;
        double r79617 = z;
        double r79618 = t;
        double r79619 = r79617 * r79618;
        double r79620 = r79616 + r79619;
        return r79620;
}

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