Average Error: 0.0 → 0.0
Time: 12.7s
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 r1118388 = x;
        double r1118389 = y;
        double r1118390 = r1118388 + r1118389;
        double r1118391 = z;
        double r1118392 = r1118390 * r1118391;
        return r1118392;
}
↓
double f(double x, double y, double z) {
        double r1118393 = y;
        double r1118394 = x;
        double r1118395 = r1118393 + r1118394;
        double r1118396 = z;
        double r1118397 = r1118395 * r1118396;
        return r1118397;
}

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