Average Error: 0.0 → 0.0

Time: 1.8s

Precision: 64

\[\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 r406935 = x;
        double r406936 = y;
        double r406937 = r406935 + r406936;
        double r406938 = z;
        double r406939 = r406937 + r406938;
        return r406939;
}

↓

double f(double x, double y, double z) {
        double r406940 = z;
        double r406941 = y;
        double r406942 = x;
        double r406943 = r406941 + r406942;
        double r406944 = r406940 + r406943;
        return r406944;
}

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