Average Error: 0.0 → 0.0
Time: 1.1s
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 r901255 = x;
        double r901256 = y;
        double r901257 = r901255 + r901256;
        double r901258 = z;
        double r901259 = r901257 + r901258;
        return r901259;
}
↓
double f(double x, double y, double z) {
        double r901260 = z;
        double r901261 = y;
        double r901262 = x;
        double r901263 = r901261 + r901262;
        double r901264 = r901260 + r901263;
        return r901264;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\left(x + y\right) + z\]

  2. Final simplification0.0

    \[\leadsto z + \left(y + x\right)\]

Reproduce

herbie shell --seed 2019163 +o rules:numerics
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, I"
  (+ (+ x y) z))