Average Error: 0.0 → 0.0
Time: 2.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 r8409 = x;
        double r8410 = y;
        double r8411 = r8409 + r8410;
        double r8412 = z;
        double r8413 = r8411 * r8412;
        return r8413;
}
↓
double f(double x, double y, double z) {
        double r8414 = y;
        double r8415 = x;
        double r8416 = r8414 + r8415;
        double r8417 = z;
        double r8418 = r8416 * r8417;
        return r8418;
}

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