Average Error: 0.0 → 0.0
Time: 2.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 r8379 = x;
        double r8380 = y;
        double r8381 = r8379 + r8380;
        double r8382 = z;
        double r8383 = r8381 * r8382;
        return r8383;
}
↓
double f(double x, double y, double z) {
        double r8384 = x;
        double r8385 = y;
        double r8386 = r8384 + r8385;
        double r8387 = z;
        double r8388 = r8386 * r8387;
        return r8388;
}

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