\[\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 r949940 = x;
        double r949941 = y;
        double r949942 = r949940 + r949941;
        double r949943 = z;
        double r949944 = r949942 * r949943;
        return r949944;
}

↓

double f(double x, double y, double z) {
        double r949945 = y;
        double r949946 = x;
        double r949947 = r949945 + r949946;
        double r949948 = z;
        double r949949 = r949947 * r949948;
        return r949949;
}

Error

The X axis uses an exponential scale — Bits error versus `x`

Try it out

In
Out

Enter valid numbers for all inputs

Derivation

Initial program 0.0
\[\left(x + y\right) \cdot z\]
Final simplification0.0
\[\leadsto \left(y + x\right) \cdot z\]

Reproduce

herbie shell --seed 2019172 +o rules:numerics
(FPCore (x y z)
  :name "Text.Parsec.Token:makeTokenParser from parsec-3.1.9, B"
  (* (+ x y) z))