Average Error: 0.0 → 0.0
Time: 2.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 r130980 = x;
        double r130981 = y;
        double r130982 = r130980 * r130981;
        double r130983 = z;
        double r130984 = t;
        double r130985 = r130983 * r130984;
        double r130986 = r130982 + r130985;
        return r130986;
}
↓
double f(double x, double y, double z, double t) {
        double r130987 = x;
        double r130988 = y;
        double r130989 = r130987 * r130988;
        double r130990 = z;
        double r130991 = t;
        double r130992 = r130990 * r130991;
        double r130993 = r130989 + r130992;
        return r130993;
}

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