\[\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 r1194095 = x;
        double r1194096 = y;
        double r1194097 = r1194095 + r1194096;
        double r1194098 = z;
        double r1194099 = r1194097 + r1194098;
        return r1194099;
}

↓

double f(double x, double y, double z) {
        double r1194100 = z;
        double r1194101 = y;
        double r1194102 = x;
        double r1194103 = r1194101 + r1194102;
        double r1194104 = r1194100 + r1194103;
        return r1194104;
}

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