Average Error: 0.0 → 0.0
Time: 1.1s
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 r91987 = x;
        double r91988 = y;
        double r91989 = r91987 * r91988;
        double r91990 = z;
        double r91991 = t;
        double r91992 = r91990 * r91991;
        double r91993 = r91989 + r91992;
        return r91993;
}
↓
double f(double x, double y, double z, double t) {
        double r91994 = x;
        double r91995 = y;
        double r91996 = r91994 * r91995;
        double r91997 = z;
        double r91998 = t;
        double r91999 = r91997 * r91998;
        double r92000 = r91996 + r91999;
        return r92000;
}

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