Average Error: 0.0 → 0.0
Time: 952.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 r938205 = x;
        double r938206 = y;
        double r938207 = r938205 + r938206;
        double r938208 = z;
        double r938209 = r938207 + r938208;
        return r938209;
}
↓
double f(double x, double y, double z) {
        double r938210 = z;
        double r938211 = y;
        double r938212 = x;
        double r938213 = r938211 + r938212;
        double r938214 = r938210 + r938213;
        return r938214;
}

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