\[\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 r1573366 = x;
        double r1573367 = y;
        double r1573368 = r1573366 + r1573367;
        double r1573369 = z;
        double r1573370 = r1573368 + r1573369;
        return r1573370;
}

↓

double f(double x, double y, double z) {
        double r1573371 = z;
        double r1573372 = y;
        double r1573373 = x;
        double r1573374 = r1573372 + r1573373;
        double r1573375 = r1573371 + r1573374;
        return r1573375;
}

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 2019179 
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, I"
  (+ (+ x y) z))