Average Error: 0.0 → 0.0
Time: 3.2s
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 r11949 = x;
        double r11950 = y;
        double r11951 = r11949 + r11950;
        double r11952 = z;
        double r11953 = r11951 * r11952;
        return r11953;
}
↓
double f(double x, double y, double z) {
        double r11954 = x;
        double r11955 = y;
        double r11956 = r11954 + r11955;
        double r11957 = z;
        double r11958 = r11956 * r11957;
        return r11958;
}

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