Average Error: 0.0 → 0.0
Time: 1.3s
Precision: 64
\[\left(x + y\right) + z\]
↓
\[\left(y + x\right) + z\]
\left(x + y\right) + z
↓
\left(y + x\right) + z
double f(double x, double y, double z) {
        double r31231 = x;
        double r31232 = y;
        double r31233 = r31231 + r31232;
        double r31234 = z;
        double r31235 = r31233 + r31234;
        return r31235;
}
↓
double f(double x, double y, double z) {
        double r31236 = y;
        double r31237 = x;
        double r31238 = r31236 + r31237;
        double r31239 = z;
        double r31240 = r31238 + r31239;
        return r31240;
}

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. Simplified0.0

    \[\leadsto \color{blue}{z + \left(y + x\right)}\]

  3. Final simplification0.0

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

Reproduce

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