Average Error: 0.0 → 0.0
Time: 2.6s
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 r5974 = x;
        double r5975 = y;
        double r5976 = r5974 + r5975;
        double r5977 = z;
        double r5978 = r5976 * r5977;
        return r5978;
}
↓
double f(double x, double y, double z) {
        double r5979 = x;
        double r5980 = y;
        double r5981 = r5979 + r5980;
        double r5982 = z;
        double r5983 = r5981 * r5982;
        return r5983;
}

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