Average Error: 0.0 → 0.0
Time: 2.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 r943363 = x;
        double r943364 = y;
        double r943365 = r943363 + r943364;
        double r943366 = z;
        double r943367 = r943365 + r943366;
        return r943367;
}
↓
double f(double x, double y, double z) {
        double r943368 = z;
        double r943369 = y;
        double r943370 = x;
        double r943371 = r943369 + r943370;
        double r943372 = r943368 + r943371;
        return r943372;
}

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