Average Error: 0.0 → 0.0
Time: 2.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 r4807 = x;
        double r4808 = y;
        double r4809 = r4807 + r4808;
        double r4810 = z;
        double r4811 = r4809 * r4810;
        return r4811;
}
↓
double f(double x, double y, double z) {
        double r4812 = x;
        double r4813 = y;
        double r4814 = r4812 + r4813;
        double r4815 = z;
        double r4816 = r4814 * r4815;
        return r4816;
}

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