Average Error: 0.0 → 0.0

Time: 945.0ms

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 r18065 = x;
        double r18066 = y;
        double r18067 = r18065 + r18066;
        double r18068 = z;
        double r18069 = r18067 + r18068;
        return r18069;
}

↓

double f(double x, double y, double z) {
        double r18070 = z;
        double r18071 = y;
        double r18072 = x;
        double r18073 = r18071 + r18072;
        double r18074 = r18070 + r18073;
        return r18074;
}

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