Average Error: 0.0 → 0.0
Time: 1.4s
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 r8619 = x;
        double r8620 = y;
        double r8621 = r8619 + r8620;
        double r8622 = z;
        double r8623 = r8621 * r8622;
        return r8623;
}
↓
double f(double x, double y, double z) {
        double r8624 = x;
        double r8625 = y;
        double r8626 = r8624 + r8625;
        double r8627 = z;
        double r8628 = r8626 * r8627;
        return r8628;
}

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