Average Error: 0.0 → 0.0
Time: 11.0s
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 r105284 = x;
        double r105285 = y;
        double r105286 = r105284 * r105285;
        double r105287 = z;
        double r105288 = t;
        double r105289 = r105287 * r105288;
        double r105290 = r105286 + r105289;
        return r105290;
}
↓
double f(double x, double y, double z, double t) {
        double r105291 = x;
        double r105292 = y;
        double r105293 = r105291 * r105292;
        double r105294 = z;
        double r105295 = t;
        double r105296 = r105294 * r105295;
        double r105297 = r105293 + r105296;
        return r105297;
}

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