Average Error: 0.0 → 0.0
Time: 11.6s
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 r13713 = x;
        double r13714 = y;
        double r13715 = r13713 + r13714;
        double r13716 = z;
        double r13717 = r13715 * r13716;
        return r13717;
}
↓
double f(double x, double y, double z) {
        double r13718 = x;
        double r13719 = y;
        double r13720 = r13718 + r13719;
        double r13721 = z;
        double r13722 = r13720 * r13721;
        return r13722;
}

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))