Average Error: 0.0 → 0.0
Time: 1.5s
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 r378649 = x;
        double r378650 = y;
        double r378651 = r378649 + r378650;
        double r378652 = z;
        double r378653 = r378651 + r378652;
        return r378653;
}
↓
double f(double x, double y, double z) {
        double r378654 = z;
        double r378655 = y;
        double r378656 = x;
        double r378657 = r378655 + r378656;
        double r378658 = r378654 + r378657;
        return r378658;
}

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