Average Error: 0.0 → 0.0
Time: 9.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 r16981 = x;
        double r16982 = y;
        double r16983 = r16981 + r16982;
        double r16984 = z;
        double r16985 = r16983 * r16984;
        return r16985;
}
↓
double f(double x, double y, double z) {
        double r16986 = x;
        double r16987 = y;
        double r16988 = r16986 + r16987;
        double r16989 = z;
        double r16990 = r16988 * r16989;
        return r16990;
}

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