Average Error: 0.0 → 0.0
Time: 4.1s
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 r18360 = x;
        double r18361 = y;
        double r18362 = r18360 + r18361;
        double r18363 = z;
        double r18364 = r18362 * r18363;
        return r18364;
}
↓
double f(double x, double y, double z) {
        double r18365 = x;
        double r18366 = y;
        double r18367 = r18365 + r18366;
        double r18368 = z;
        double r18369 = r18367 * r18368;
        return r18369;
}

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