\[\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 r1451686 = x;
        double r1451687 = y;
        double r1451688 = r1451686 + r1451687;
        double r1451689 = z;
        double r1451690 = r1451688 + r1451689;
        return r1451690;
}

↓

double f(double x, double y, double z) {
        double r1451691 = z;
        double r1451692 = y;
        double r1451693 = x;
        double r1451694 = r1451692 + r1451693;
        double r1451695 = r1451691 + r1451694;
        return r1451695;
}

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