Average Error: 0.0 → 0.0
Time: 14.2s
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 r14281 = x;
        double r14282 = y;
        double r14283 = r14281 + r14282;
        double r14284 = z;
        double r14285 = r14283 * r14284;
        return r14285;
}
↓
double f(double x, double y, double z) {
        double r14286 = x;
        double r14287 = y;
        double r14288 = r14286 + r14287;
        double r14289 = z;
        double r14290 = r14288 * r14289;
        return r14290;
}

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 2019325 +o rules:numerics
(FPCore (x y z)
  :name "Text.Parsec.Token:makeTokenParser from parsec-3.1.9, B"
  :precision binary64
  (* (+ x y) z))