Average Error: 0.0 → 0.0
Time: 13.0s
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 r12614 = x;
        double r12615 = y;
        double r12616 = r12614 + r12615;
        double r12617 = z;
        double r12618 = r12616 * r12617;
        return r12618;
}
↓
double f(double x, double y, double z) {
        double r12619 = x;
        double r12620 = y;
        double r12621 = r12619 + r12620;
        double r12622 = z;
        double r12623 = r12621 * r12622;
        return r12623;
}

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