Average Error: 0.0 → 0.0
Time: 1.6s
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 r3184 = x;
        double r3185 = y;
        double r3186 = r3184 + r3185;
        double r3187 = z;
        double r3188 = r3186 * r3187;
        return r3188;
}
↓
double f(double x, double y, double z) {
        double r3189 = x;
        double r3190 = y;
        double r3191 = r3189 + r3190;
        double r3192 = z;
        double r3193 = r3191 * r3192;
        return r3193;
}

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