Average Error: 0.0 → 0.0
Time: 1.0s
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 r843889 = x;
        double r843890 = y;
        double r843891 = r843889 + r843890;
        double r843892 = z;
        double r843893 = r843891 + r843892;
        return r843893;
}
↓
double f(double x, double y, double z) {
        double r843894 = z;
        double r843895 = y;
        double r843896 = x;
        double r843897 = r843895 + r843896;
        double r843898 = r843894 + r843897;
        return r843898;
}

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