Average Error: 0.0 → 0.0
Time: 828.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 r832485 = x;
        double r832486 = y;
        double r832487 = r832485 + r832486;
        double r832488 = z;
        double r832489 = r832487 + r832488;
        return r832489;
}
↓
double f(double x, double y, double z) {
        double r832490 = z;
        double r832491 = y;
        double r832492 = x;
        double r832493 = r832491 + r832492;
        double r832494 = r832490 + r832493;
        return r832494;
}

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