\[\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 r1009057 = x;
        double r1009058 = y;
        double r1009059 = r1009057 + r1009058;
        double r1009060 = z;
        double r1009061 = r1009059 + r1009060;
        return r1009061;
}

↓

double f(double x, double y, double z) {
        double r1009062 = z;
        double r1009063 = y;
        double r1009064 = x;
        double r1009065 = r1009063 + r1009064;
        double r1009066 = r1009062 + r1009065;
        return r1009066;
}

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