Average Error: 0.0 → 0.0
Time: 9.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 r23683 = x;
        double r23684 = y;
        double r23685 = r23683 + r23684;
        double r23686 = z;
        double r23687 = r23685 * r23686;
        return r23687;
}
↓
double f(double x, double y, double z) {
        double r23688 = x;
        double r23689 = y;
        double r23690 = r23688 + r23689;
        double r23691 = z;
        double r23692 = r23690 * r23691;
        return r23692;
}

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