Average Error: 0.0 → 0.0
Time: 7.5s
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 r11557 = x;
        double r11558 = y;
        double r11559 = r11557 + r11558;
        double r11560 = z;
        double r11561 = r11559 * r11560;
        return r11561;
}
↓
double f(double x, double y, double z) {
        double r11562 = x;
        double r11563 = y;
        double r11564 = r11562 + r11563;
        double r11565 = z;
        double r11566 = r11564 * r11565;
        return r11566;
}

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