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 r11595 = x;
        double r11596 = y;
        double r11597 = r11595 + r11596;
        double r11598 = z;
        double r11599 = r11597 * r11598;
        return r11599;
}
↓
double f(double x, double y, double z) {
        double r11600 = x;
        double r11601 = y;
        double r11602 = r11600 + r11601;
        double r11603 = z;
        double r11604 = r11602 * r11603;
        return r11604;
}

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))