Average Error: 0.0 → 0.0
Time: 7.9s
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 r6058 = x;
        double r6059 = y;
        double r6060 = r6058 + r6059;
        double r6061 = z;
        double r6062 = r6060 * r6061;
        return r6062;
}
↓
double f(double x, double y, double z) {
        double r6063 = x;
        double r6064 = y;
        double r6065 = r6063 + r6064;
        double r6066 = z;
        double r6067 = r6065 * r6066;
        return r6067;
}

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