Average Error: 0.0 → 0.0
Time: 2.7s
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 r8620 = x;
        double r8621 = y;
        double r8622 = r8620 + r8621;
        double r8623 = z;
        double r8624 = r8622 * r8623;
        return r8624;
}
↓
double f(double x, double y, double z) {
        double r8625 = x;
        double r8626 = y;
        double r8627 = r8625 + r8626;
        double r8628 = z;
        double r8629 = r8627 * r8628;
        return r8629;
}

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