Average Error: 0.0 → 0.0
Time: 8.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 r11876 = x;
        double r11877 = y;
        double r11878 = r11876 + r11877;
        double r11879 = z;
        double r11880 = r11878 * r11879;
        return r11880;
}
↓
double f(double x, double y, double z) {
        double r11881 = x;
        double r11882 = y;
        double r11883 = r11881 + r11882;
        double r11884 = z;
        double r11885 = r11883 * r11884;
        return r11885;
}

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