Average Error: 0.0 → 0.0
Time: 13.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 r13322 = x;
        double r13323 = y;
        double r13324 = r13322 + r13323;
        double r13325 = z;
        double r13326 = r13324 * r13325;
        return r13326;
}
↓
double f(double x, double y, double z) {
        double r13327 = x;
        double r13328 = y;
        double r13329 = r13327 + r13328;
        double r13330 = z;
        double r13331 = r13329 * r13330;
        return r13331;
}

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