Average Error: 0.0 → 0.0
Time: 1.0s
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 r28150 = x;
        double r28151 = y;
        double r28152 = r28150 + r28151;
        double r28153 = z;
        double r28154 = r28152 + r28153;
        return r28154;
}
↓
double f(double x, double y, double z) {
        double r28155 = y;
        double r28156 = x;
        double r28157 = r28155 + r28156;
        double r28158 = z;
        double r28159 = r28157 + r28158;
        return r28159;
}

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