Average Error: 0.0 → 0.0
Time: 10.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 r13227 = x;
        double r13228 = y;
        double r13229 = r13227 + r13228;
        double r13230 = z;
        double r13231 = r13229 * r13230;
        return r13231;
}
↓
double f(double x, double y, double z) {
        double r13232 = x;
        double r13233 = y;
        double r13234 = r13232 + r13233;
        double r13235 = z;
        double r13236 = r13234 * r13235;
        return r13236;
}

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