Average Error: 0.0 → 0.0
Time: 3.8s
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 r18214 = x;
        double r18215 = y;
        double r18216 = r18214 + r18215;
        double r18217 = z;
        double r18218 = r18216 * r18217;
        return r18218;
}
↓
double f(double x, double y, double z) {
        double r18219 = x;
        double r18220 = y;
        double r18221 = r18219 + r18220;
        double r18222 = z;
        double r18223 = r18221 * r18222;
        return r18223;
}

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