Average Error: 0.0 → 0.0
Time: 1.5s
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 r116975 = x;
        double r116976 = y;
        double r116977 = r116975 * r116976;
        double r116978 = z;
        double r116979 = t;
        double r116980 = r116978 * r116979;
        double r116981 = r116977 + r116980;
        return r116981;
}
↓
double f(double x, double y, double z, double t) {
        double r116982 = x;
        double r116983 = y;
        double r116984 = r116982 * r116983;
        double r116985 = z;
        double r116986 = t;
        double r116987 = r116985 * r116986;
        double r116988 = r116984 + r116987;
        return r116988;
}

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