Average Error: 0.0 → 0.0
Time: 3.3s
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 r8558 = x;
        double r8559 = y;
        double r8560 = r8558 + r8559;
        double r8561 = z;
        double r8562 = r8560 * r8561;
        return r8562;
}
↓
double f(double x, double y, double z) {
        double r8563 = y;
        double r8564 = x;
        double r8565 = r8563 + r8564;
        double r8566 = z;
        double r8567 = r8565 * r8566;
        return r8567;
}

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