Average Error: 0.0 → 0.0
Time: 840.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 r29287 = x;
        double r29288 = y;
        double r29289 = r29287 + r29288;
        double r29290 = z;
        double r29291 = r29289 + r29290;
        return r29291;
}
↓
double f(double x, double y, double z) {
        double r29292 = x;
        double r29293 = y;
        double r29294 = r29292 + r29293;
        double r29295 = z;
        double r29296 = r29294 + r29295;
        return r29296;
}

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