Average Error: 0.0 → 0.0
Time: 4.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 r64 = x;
        double r65 = y;
        double r66 = r64 + r65;
        double r67 = z;
        double r68 = r66 * r67;
        return r68;
}
↓
double f(double x, double y, double z) {
        double r69 = x;
        double r70 = y;
        double r71 = r69 + r70;
        double r72 = z;
        double r73 = r71 * r72;
        return r73;
}

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