Average Error: 0.0 → 0.0
Time: 14.9s
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 r19230 = x;
        double r19231 = y;
        double r19232 = r19230 + r19231;
        double r19233 = z;
        double r19234 = r19232 * r19233;
        return r19234;
}
↓
double f(double x, double y, double z) {
        double r19235 = x;
        double r19236 = y;
        double r19237 = r19235 + r19236;
        double r19238 = z;
        double r19239 = r19237 * r19238;
        return r19239;
}

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