Average Error: 0.0 → 0.0
Time: 8.3s
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 r22866 = x;
        double r22867 = y;
        double r22868 = r22866 + r22867;
        double r22869 = z;
        double r22870 = r22868 * r22869;
        return r22870;
}
↓
double f(double x, double y, double z) {
        double r22871 = x;
        double r22872 = y;
        double r22873 = r22871 + r22872;
        double r22874 = z;
        double r22875 = r22873 * r22874;
        return r22875;
}

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