Average Error: 0.0 → 0.0
Time: 1.1s
Precision: 64
\[\left(x + y\right) + z\]
↓
\[\left(y + x\right) + z\]
\left(x + y\right) + z
↓
\left(y + x\right) + z
double f(double x, double y, double z) {
        double r39689 = x;
        double r39690 = y;
        double r39691 = r39689 + r39690;
        double r39692 = z;
        double r39693 = r39691 + r39692;
        return r39693;
}
↓
double f(double x, double y, double z) {
        double r39694 = y;
        double r39695 = x;
        double r39696 = r39694 + r39695;
        double r39697 = z;
        double r39698 = r39696 + r39697;
        return r39698;
}

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. Simplified0.0

    \[\leadsto \color{blue}{z + \left(y + x\right)}\]

  3. Final simplification0.0

    \[\leadsto \left(y + x\right) + z\]

Reproduce

herbie shell --seed 2019179 
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, I"
  (+ (+ x y) z))