Average Error: 0.0 → 0.0
Time: 6.0s
Precision: 64
\[\left(x + y\right) \cdot z\]
↓
\[\left(y + x\right) \cdot z\]
\left(x + y\right) \cdot z
↓
\left(y + x\right) \cdot z
double f(double x, double y, double z) {
        double r327266 = x;
        double r327267 = y;
        double r327268 = r327266 + r327267;
        double r327269 = z;
        double r327270 = r327268 * r327269;
        return r327270;
}
↓
double f(double x, double y, double z) {
        double r327271 = y;
        double r327272 = x;
        double r327273 = r327271 + r327272;
        double r327274 = z;
        double r327275 = r327273 * r327274;
        return r327275;
}

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(y + x\right) \cdot z\]

Reproduce

herbie shell --seed 2019156 
(FPCore (x y z)
  :name "Text.Parsec.Token:makeTokenParser from parsec-3.1.9, B"
  (* (+ x y) z))