\[\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 r1261532 = x;
        double r1261533 = y;
        double r1261534 = r1261532 + r1261533;
        double r1261535 = z;
        double r1261536 = r1261534 + r1261535;
        return r1261536;
}

↓

double f(double x, double y, double z) {
        double r1261537 = z;
        double r1261538 = y;
        double r1261539 = x;
        double r1261540 = r1261538 + r1261539;
        double r1261541 = r1261537 + r1261540;
        return r1261541;
}

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