Average Error: 0.0 → 0.0
Time: 5.4s
Precision: 64
\[\left(x + y\right) \cdot z\]
↓
\[\left(x + y\right) \cdot z\]
\left(x + y\right) \cdot z
↓
\left(x + y\right) \cdot z
double f(double x, double y, double z) {
        double r3392 = x;
        double r3393 = y;
        double r3394 = r3392 + r3393;
        double r3395 = z;
        double r3396 = r3394 * r3395;
        return r3396;
}
↓
double f(double x, double y, double z) {
        double r3397 = x;
        double r3398 = y;
        double r3399 = r3397 + r3398;
        double r3400 = z;
        double r3401 = r3399 * r3400;
        return r3401;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\left(x + y\right) \cdot z\]

  2. Final simplification0.0

    \[\leadsto \left(x + y\right) \cdot z\]

Reproduce

herbie shell --seed 2019350 +o rules:numerics
(FPCore (x y z)
  :name "Text.Parsec.Token:makeTokenParser from parsec-3.1.9, B"
  :precision binary64
  (* (+ x y) z))