Average Error: 0.0 → 0.0
Time: 9.0s
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 r18556 = x;
        double r18557 = y;
        double r18558 = r18556 + r18557;
        double r18559 = z;
        double r18560 = r18558 * r18559;
        return r18560;
}
↓
double f(double x, double y, double z) {
        double r18561 = x;
        double r18562 = y;
        double r18563 = r18561 + r18562;
        double r18564 = z;
        double r18565 = r18563 * r18564;
        return r18565;
}

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