\[\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 r1922093 = x;
        double r1922094 = y;
        double r1922095 = r1922093 + r1922094;
        double r1922096 = z;
        double r1922097 = r1922095 + r1922096;
        return r1922097;
}

↓

double f(double x, double y, double z) {
        double r1922098 = z;
        double r1922099 = y;
        double r1922100 = x;
        double r1922101 = r1922099 + r1922100;
        double r1922102 = r1922098 + r1922101;
        return r1922102;
}

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