Average Error: 0.0 → 0.0
Time: 3.9s
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 r17415 = x;
        double r17416 = y;
        double r17417 = r17415 + r17416;
        double r17418 = z;
        double r17419 = r17417 * r17418;
        return r17419;
}
↓
double f(double x, double y, double z) {
        double r17420 = x;
        double r17421 = y;
        double r17422 = r17420 + r17421;
        double r17423 = z;
        double r17424 = r17422 * r17423;
        return r17424;
}

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