Average Error: 0.0 → 0.0
Time: 3.2s
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 r307678 = x;
        double r307679 = y;
        double r307680 = r307678 + r307679;
        double r307681 = z;
        double r307682 = r307680 * r307681;
        return r307682;
}
↓
double f(double x, double y, double z) {
        double r307683 = y;
        double r307684 = x;
        double r307685 = r307683 + r307684;
        double r307686 = z;
        double r307687 = r307685 * r307686;
        return r307687;
}

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