Average Error: 0.0 → 0.0
Time: 8.7s
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 r6161 = x;
        double r6162 = y;
        double r6163 = r6161 + r6162;
        double r6164 = z;
        double r6165 = r6163 * r6164;
        return r6165;
}
↓
double f(double x, double y, double z) {
        double r6166 = x;
        double r6167 = y;
        double r6168 = r6166 + r6167;
        double r6169 = z;
        double r6170 = r6168 * r6169;
        return r6170;
}

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