Average Error: 0.0 → 0.0
Time: 13.4s
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 r14054 = x;
        double r14055 = y;
        double r14056 = r14054 + r14055;
        double r14057 = z;
        double r14058 = r14056 * r14057;
        return r14058;
}
↓
double f(double x, double y, double z) {
        double r14059 = x;
        double r14060 = y;
        double r14061 = r14059 + r14060;
        double r14062 = z;
        double r14063 = r14061 * r14062;
        return r14063;
}

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