Average Error: 0.0 → 0.0
Time: 795.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 r799225 = x;
        double r799226 = y;
        double r799227 = r799225 + r799226;
        double r799228 = z;
        double r799229 = r799227 + r799228;
        return r799229;
}
↓
double f(double x, double y, double z) {
        double r799230 = z;
        double r799231 = y;
        double r799232 = x;
        double r799233 = r799231 + r799232;
        double r799234 = r799230 + r799233;
        return r799234;
}

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