Average Error: 0.0 → 0.0
Time: 2.7s
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 r9367 = x;
        double r9368 = y;
        double r9369 = r9367 + r9368;
        double r9370 = z;
        double r9371 = r9369 * r9370;
        return r9371;
}
↓
double f(double x, double y, double z) {
        double r9372 = x;
        double r9373 = y;
        double r9374 = r9372 + r9373;
        double r9375 = z;
        double r9376 = r9374 * r9375;
        return r9376;
}

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