Average Error: 0.0 → 0.0
Time: 13.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 r14063 = x;
        double r14064 = y;
        double r14065 = r14063 + r14064;
        double r14066 = z;
        double r14067 = r14065 * r14066;
        return r14067;
}
↓
double f(double x, double y, double z) {
        double r14068 = x;
        double r14069 = y;
        double r14070 = r14068 + r14069;
        double r14071 = z;
        double r14072 = r14070 * r14071;
        return r14072;
}

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