Average Error: 0.0 → 0.0
Time: 2.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 r5744 = x;
        double r5745 = y;
        double r5746 = r5744 + r5745;
        double r5747 = z;
        double r5748 = r5746 * r5747;
        return r5748;
}
↓
double f(double x, double y, double z) {
        double r5749 = x;
        double r5750 = y;
        double r5751 = r5749 + r5750;
        double r5752 = z;
        double r5753 = r5751 * r5752;
        return r5753;
}

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