\[\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 r1145624 = x;
        double r1145625 = y;
        double r1145626 = r1145624 + r1145625;
        double r1145627 = z;
        double r1145628 = r1145626 + r1145627;
        return r1145628;
}

↓

double f(double x, double y, double z) {
        double r1145629 = z;
        double r1145630 = y;
        double r1145631 = x;
        double r1145632 = r1145630 + r1145631;
        double r1145633 = r1145629 + r1145632;
        return r1145633;
}

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