Average Error: 0.0 → 0.0
Time: 987.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 r639398 = x;
        double r639399 = y;
        double r639400 = r639398 + r639399;
        double r639401 = z;
        double r639402 = r639400 + r639401;
        return r639402;
}
↓
double f(double x, double y, double z) {
        double r639403 = z;
        double r639404 = y;
        double r639405 = x;
        double r639406 = r639404 + r639405;
        double r639407 = r639403 + r639406;
        return r639407;
}

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