Average Error: 0.0 → 0.0
Time: 864.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 r956164 = x;
        double r956165 = y;
        double r956166 = r956164 + r956165;
        double r956167 = z;
        double r956168 = r956166 + r956167;
        return r956168;
}
↓
double f(double x, double y, double z) {
        double r956169 = z;
        double r956170 = y;
        double r956171 = x;
        double r956172 = r956170 + r956171;
        double r956173 = r956169 + r956172;
        return r956173;
}

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