Average Error: 0.0 → 0.0
Time: 9.1s
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 r11838 = x;
        double r11839 = y;
        double r11840 = r11838 + r11839;
        double r11841 = z;
        double r11842 = r11840 * r11841;
        return r11842;
}
↓
double f(double x, double y, double z) {
        double r11843 = x;
        double r11844 = y;
        double r11845 = r11843 + r11844;
        double r11846 = z;
        double r11847 = r11845 * r11846;
        return r11847;
}

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