Average Error: 0.0 → 0.0
Time: 7.1s
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 r6174 = x;
        double r6175 = y;
        double r6176 = r6174 + r6175;
        double r6177 = z;
        double r6178 = r6176 * r6177;
        return r6178;
}
↓
double f(double x, double y, double z) {
        double r6179 = x;
        double r6180 = y;
        double r6181 = r6179 + r6180;
        double r6182 = z;
        double r6183 = r6181 * r6182;
        return r6183;
}

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))