Average Error: 0.0 → 0.0
Time: 945.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 r39419 = x;
        double r39420 = y;
        double r39421 = r39419 + r39420;
        double r39422 = z;
        double r39423 = r39421 + r39422;
        return r39423;
}
↓
double f(double x, double y, double z) {
        double r39424 = z;
        double r39425 = y;
        double r39426 = x;
        double r39427 = r39425 + r39426;
        double r39428 = r39424 + r39427;
        return r39428;
}

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