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 r32961 = x;
        double r32962 = y;
        double r32963 = r32961 + r32962;
        double r32964 = z;
        double r32965 = r32963 + r32964;
        return r32965;
}
↓
double f(double x, double y, double z) {
        double r32966 = y;
        double r32967 = x;
        double r32968 = r32966 + r32967;
        double r32969 = z;
        double r32970 = r32968 + r32969;
        return r32970;
}

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