Average Error: 0.0 → 0.0
Time: 3.2s
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 r143612 = x;
        double r143613 = y;
        double r143614 = r143612 * r143613;
        double r143615 = z;
        double r143616 = t;
        double r143617 = r143615 * r143616;
        double r143618 = r143614 + r143617;
        return r143618;
}
↓
double f(double x, double y, double z, double t) {
        double r143619 = x;
        double r143620 = y;
        double r143621 = r143619 * r143620;
        double r143622 = z;
        double r143623 = t;
        double r143624 = r143622 * r143623;
        double r143625 = r143621 + r143624;
        return r143625;
}

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