Average Error: 0.0 → 0.0
Time: 2.7s
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 r8333 = x;
        double r8334 = y;
        double r8335 = r8333 + r8334;
        double r8336 = z;
        double r8337 = r8335 * r8336;
        return r8337;
}
↓
double f(double x, double y, double z) {
        double r8338 = x;
        double r8339 = y;
        double r8340 = r8338 + r8339;
        double r8341 = z;
        double r8342 = r8340 * r8341;
        return r8342;
}

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