Average Error: 0.0 → 0.0
Time: 1.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 r129340 = x;
        double r129341 = y;
        double r129342 = r129340 * r129341;
        double r129343 = z;
        double r129344 = t;
        double r129345 = r129343 * r129344;
        double r129346 = r129342 + r129345;
        return r129346;
}
↓
double f(double x, double y, double z, double t) {
        double r129347 = x;
        double r129348 = y;
        double r129349 = r129347 * r129348;
        double r129350 = z;
        double r129351 = t;
        double r129352 = r129350 * r129351;
        double r129353 = r129349 + r129352;
        return r129353;
}

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