\[\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 r1624106 = x;
        double r1624107 = y;
        double r1624108 = r1624106 + r1624107;
        double r1624109 = z;
        double r1624110 = r1624108 + r1624109;
        return r1624110;
}

↓

double f(double x, double y, double z) {
        double r1624111 = z;
        double r1624112 = y;
        double r1624113 = x;
        double r1624114 = r1624112 + r1624113;
        double r1624115 = r1624111 + r1624114;
        return r1624115;
}

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