Average Error: 0.0 → 0.0
Time: 676.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 r39905 = x;
        double r39906 = y;
        double r39907 = r39905 + r39906;
        double r39908 = z;
        double r39909 = r39907 + r39908;
        return r39909;
}
↓
double f(double x, double y, double z) {
        double r39910 = x;
        double r39911 = y;
        double r39912 = r39910 + r39911;
        double r39913 = z;
        double r39914 = r39912 + r39913;
        return r39914;
}

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