Average Error: 0.0 → 0.0
Time: 904.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 r150875 = x;
        double r150876 = y;
        double r150877 = r150875 + r150876;
        double r150878 = z;
        double r150879 = r150877 + r150878;
        return r150879;
}
↓
double f(double x, double y, double z) {
        double r150880 = z;
        double r150881 = y;
        double r150882 = x;
        double r150883 = r150881 + r150882;
        double r150884 = r150880 + r150883;
        return r150884;
}

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