Average Error: 0.0 → 0.0
Time: 5.7s
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 r123750 = x;
        double r123751 = y;
        double r123752 = r123750 * r123751;
        double r123753 = z;
        double r123754 = t;
        double r123755 = r123753 * r123754;
        double r123756 = r123752 + r123755;
        return r123756;
}
↓
double f(double x, double y, double z, double t) {
        double r123757 = x;
        double r123758 = y;
        double r123759 = r123757 * r123758;
        double r123760 = z;
        double r123761 = t;
        double r123762 = r123760 * r123761;
        double r123763 = r123759 + r123762;
        return r123763;
}

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