Average Error: 0.0 → 0.0
Time: 831.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 r868231 = x;
        double r868232 = y;
        double r868233 = r868231 + r868232;
        double r868234 = z;
        double r868235 = r868233 + r868234;
        return r868235;
}
↓
double f(double x, double y, double z) {
        double r868236 = z;
        double r868237 = y;
        double r868238 = x;
        double r868239 = r868237 + r868238;
        double r868240 = r868236 + r868239;
        return r868240;
}

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