Average Error: 0.0 → 0.0
Time: 1.6s
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 r135797 = x;
        double r135798 = y;
        double r135799 = r135797 * r135798;
        double r135800 = z;
        double r135801 = t;
        double r135802 = r135800 * r135801;
        double r135803 = r135799 + r135802;
        return r135803;
}
↓
double f(double x, double y, double z, double t) {
        double r135804 = x;
        double r135805 = y;
        double r135806 = r135804 * r135805;
        double r135807 = z;
        double r135808 = t;
        double r135809 = r135807 * r135808;
        double r135810 = r135806 + r135809;
        return r135810;
}

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