Average Error: 0.0 → 0.0
Time: 922.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 r936177 = x;
        double r936178 = y;
        double r936179 = r936177 + r936178;
        double r936180 = z;
        double r936181 = r936179 + r936180;
        return r936181;
}
↓
double f(double x, double y, double z) {
        double r936182 = z;
        double r936183 = y;
        double r936184 = x;
        double r936185 = r936183 + r936184;
        double r936186 = r936182 + r936185;
        return r936186;
}

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))