Average Error: 0.0 → 0.0
Time: 351.0ms
Precision: 64
\[\left(x + y\right) + z\]
↓
\[\left(x + y\right) + z\]
\left(x + y\right) + z
↓
\left(x + y\right) + z
double f(double x, double y, double z) {
        double r17896 = x;
        double r17897 = y;
        double r17898 = r17896 + r17897;
        double r17899 = z;
        double r17900 = r17898 + r17899;
        return r17900;
}
↓
double f(double x, double y, double z) {
        double r17901 = x;
        double r17902 = y;
        double r17903 = r17901 + r17902;
        double r17904 = z;
        double r17905 = r17903 + r17904;
        return r17905;
}

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 \left(x + y\right) + z\]

Reproduce

herbie shell --seed 2020043 +o rules:numerics
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, I"
  :precision binary64
  (+ (+ x y) z))