Average Error: 0.0 → 0.0
Time: 3.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 r13663 = x;
        double r13664 = y;
        double r13665 = r13663 + r13664;
        double r13666 = z;
        double r13667 = r13665 * r13666;
        return r13667;
}
↓
double f(double x, double y, double z) {
        double r13668 = x;
        double r13669 = y;
        double r13670 = r13668 + r13669;
        double r13671 = z;
        double r13672 = r13670 * r13671;
        return r13672;
}

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