\[\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 r1592791 = x;
        double r1592792 = y;
        double r1592793 = r1592791 + r1592792;
        double r1592794 = z;
        double r1592795 = r1592793 + r1592794;
        return r1592795;
}

↓

double f(double x, double y, double z) {
        double r1592796 = z;
        double r1592797 = y;
        double r1592798 = x;
        double r1592799 = r1592797 + r1592798;
        double r1592800 = r1592796 + r1592799;
        return r1592800;
}

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