Average Error: 0.0 → 0.0
Time: 1.4s
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 r97971 = x;
        double r97972 = y;
        double r97973 = r97971 * r97972;
        double r97974 = z;
        double r97975 = t;
        double r97976 = r97974 * r97975;
        double r97977 = r97973 + r97976;
        return r97977;
}
↓
double f(double x, double y, double z, double t) {
        double r97978 = x;
        double r97979 = y;
        double r97980 = r97978 * r97979;
        double r97981 = z;
        double r97982 = t;
        double r97983 = r97981 * r97982;
        double r97984 = r97980 + r97983;
        return r97984;
}

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