Average Error: 0.0 → 0.0
Time: 2.4s
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 r5736 = x;
        double r5737 = y;
        double r5738 = r5736 + r5737;
        double r5739 = z;
        double r5740 = r5738 * r5739;
        return r5740;
}
↓
double f(double x, double y, double z) {
        double r5741 = x;
        double r5742 = y;
        double r5743 = r5741 + r5742;
        double r5744 = z;
        double r5745 = r5743 * r5744;
        return r5745;
}

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