\[\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 r1313984 = x;
        double r1313985 = y;
        double r1313986 = r1313984 + r1313985;
        double r1313987 = z;
        double r1313988 = r1313986 + r1313987;
        return r1313988;
}

↓

double f(double x, double y, double z) {
        double r1313989 = z;
        double r1313990 = y;
        double r1313991 = x;
        double r1313992 = r1313990 + r1313991;
        double r1313993 = r1313989 + r1313992;
        return r1313993;
}

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