Average Error: 0.0 → 0.0
Time: 5.9s
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 r3432 = x;
        double r3433 = y;
        double r3434 = r3432 + r3433;
        double r3435 = z;
        double r3436 = r3434 * r3435;
        return r3436;
}
↓
double f(double x, double y, double z) {
        double r3437 = x;
        double r3438 = y;
        double r3439 = r3437 + r3438;
        double r3440 = z;
        double r3441 = r3439 * r3440;
        return r3441;
}

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