Average Error: 0.0 → 0.0
Time: 3.1s
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 r8586 = x;
        double r8587 = y;
        double r8588 = r8586 + r8587;
        double r8589 = z;
        double r8590 = r8588 * r8589;
        return r8590;
}
↓
double f(double x, double y, double z) {
        double r8591 = y;
        double r8592 = x;
        double r8593 = r8591 + r8592;
        double r8594 = z;
        double r8595 = r8593 * r8594;
        return r8595;
}

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