\[\left(x + y\right) + z\]

↓

\[z + \left(y + x\right)\]

\left(x + y\right) + z

↓

z + \left(y + x\right)

double f(double x, double y, double z) {
        double r1213204 = x;
        double r1213205 = y;
        double r1213206 = r1213204 + r1213205;
        double r1213207 = z;
        double r1213208 = r1213206 + r1213207;
        return r1213208;
}

↓

double f(double x, double y, double z) {
        double r1213209 = z;
        double r1213210 = y;
        double r1213211 = x;
        double r1213212 = r1213210 + r1213211;
        double r1213213 = r1213209 + r1213212;
        return r1213213;
}

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) + z\]
Final simplification0.0
\[\leadsto z + \left(y + x\right)\]

Reproduce

herbie shell --seed 2019163 
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, I"
  (+ (+ x y) z))