Average Error: 0.0 → 0.0
Time: 2.8s
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 r100263 = x;
        double r100264 = y;
        double r100265 = r100263 * r100264;
        double r100266 = z;
        double r100267 = t;
        double r100268 = r100266 * r100267;
        double r100269 = r100265 + r100268;
        return r100269;
}
↓
double f(double x, double y, double z, double t) {
        double r100270 = x;
        double r100271 = y;
        double r100272 = r100270 * r100271;
        double r100273 = z;
        double r100274 = t;
        double r100275 = r100273 * r100274;
        double r100276 = r100272 + r100275;
        return r100276;
}

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